int main() {
int isNormal;
setVariables();
while (1) {
calibrateInit();
displayCalibrate();
if(isCalibrated(&gAccRead)) {
standbyInit();
countDown();
while(1) {
if (resetFlag) break;
sendReadySignal();
runTemp(&isNormal);
if (isSafe && isNormal && hasEstablished) {
initActive();
while(1) {
int freq = calculateFreq();
runActive(freq);
runTemp(&isNormal);
if (resetFlag)
break;
if(isMayDay) {
switchDisplayToMayDay();
break;
}
if(!isNormal || !isSafe || standbyFlag) {
standbyFlag = 0;
switchDisplayToStandby();
countDown();
break;
}
}
if(resetFlag) {
switchDisplayToCalibrate();
break;
}
if(isMayDay) {
initMayDay();
runMayDay();
initLight();
switchDisplayToStandby();
countDown();
}
}
}
}
}
}
int main()
{
char * inFp = "C:\\abc.txt";
//char * inFpZeroes= "C:\\abc_zeroes.txt";
char * inFpCrc = "C:\\abc_crc.txt";
char * outFp = "C:\\abc_compressed.txt";
char * decompressedFpCrc = "C:\\abc_decompressed_crc.txt";
char * decompressedFp = "C:\\abc_decompressed.txt";
copyFile(inFp, inFpCrc);
//appendZeroes(inFpZeroes, SIZECRC);
unsigned char * restPoly = calculateCrc(inFp);
printf("Generated polynomial:\n");
printPolynomial(restPoly, SIZECRC);
appendCrcToFile(inFpCrc, SIZECRC, restPoly);
int lettersFrequencies[LETTERS_COUNT]; // = {81, 15, 28, 43, 128, 23, 20, 61, 71, 2, 1, 40, 24, 69, 76, 20, 1, 61, 64, 91, 28, 10, 24, 1, 20, 1, 130};;
//char letters[LETTERS_COUNT] = {'?', '?', '?', '?', '?', '?', '?', '?', '?', '?','?', '?', '?', '?', '?','?', '?', '?', '?', '?','?', '?', '?', '?', '?','?', '?', '?', '?', '?', '?', '?', '!', '"', '#', '$', '%', '&', '(', ')', '*', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', ' '};
//printTabInt(lettersFrequencies, LETTERS_COUNT);
//printTabChar(letters, LETTERS_COUNT);
//printf("Letter indices: ");
calculateFreq(inFpCrc, lettersFrequencies);
//printTabInt(lettersFrequencies, 255);
Node *nodes[LETTERS_COUNT];
int i;
for(i=0; i<LETTERS_COUNT; i++)
{
nodes[i] = malloc(sizeof(Node));
nodes[i]->value = lettersFrequencies[i];
nodes[i]->letterIndex = i;
nodes[i]->left = NULL;
nodes[i]->right = NULL;
}
//printLetterIndices(nodes);
Node *tree = buildHuffmanTree(nodes);
int codeTable[LETTERS_COUNT];
int invertedCodeTable2[LETTERS_COUNT];
resetIntTable(codeTable, LETTERS_COUNT);
//printf("codeTable: \n");
//printTabInt(codeTable, LETTERS_COUNT);
fillTable(codeTable, tree, 0);
invertCodeTable(codeTable, invertedCodeTable2);
//printf("codeTable: \n");
//printTabInt(codeTable, LETTERS_COUNT);
//printf("inverted codeTable: \n");
//printTabInt(invertedCodeTable2, LETTERS_COUNT);
//printCodeTable(letters, codeTable, LETTERS_COUNT);
//printCodeTableForIdx(codeTable, LETTERS_COUNT);
//printTabInt(codeTable, LETTERS_COUNT);
//createCrcFile(inFpCrc, SIZECRC, restPoly);
//appendFileToFile(inFp, inFpCrc);
compressFile(inFpCrc, outFp, invertedCodeTable2);
printf("\n\ndecompressed file:\n");
decompressFile(outFp, decompressedFpCrc, tree);
unsigned char * restPolyFromDec = calulateRest(decompressedFpCrc);
printf("\n\nRest from decopressed file:\n");
printPolynomial(restPolyFromDec, SIZECRC);
if(!isIntegral()){
printf("Integrity check failed!");
exit(EXIT_FAILURE);
}else{
copySkip(decompressedFpCrc, decompressedFp, SIZECRC);
}
//checkIntegrity();
//FILE * output = fopen("C:\\codeblocks\\Huffman\\huffman\\to.txt","w");
//compressFile(input, output, codeTable);
return 0;
}
