forked from nijino2002/filemht
-
Notifications
You must be signed in to change notification settings - Fork 0
/
mhtfile.c
1376 lines (1174 loc) · 44.8 KB
/
mhtfile.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include "mhtfile.h"
extern PQNode g_pQHeader;
extern PQNode g_pQ;
extern int g_mhtFileFD;
PMHT_FILE_HEADER makeMHTFileHeader(){
PMHT_FILE_HEADER pmht_file_header = NULL;
pmht_file_header = (PMHT_FILE_HEADER) malloc(sizeof(MHT_FILE_HEADER));
if(!pmht_file_header){
check_pointer(pmht_file_header, "pmht_file_header");
debug_print("makeMHTFileHeader", "Creating MHT file header failed");
return NULL;
}
memset(pmht_file_header->m_magicStr, 0, MHT_FILE_MAGIC_STRING_LEN);
memcpy(pmht_file_header->m_magicStr, MHT_FILE_MAGIC_STRING, sizeof(MHT_FILE_MAGIC_STRING));
pmht_file_header->m_rootNodeOffset = UNASSIGNED_OFFSET;
pmht_file_header->m_firstSupplementaryLeafOffset = UNASSIGNED_OFFSET;
memset(pmht_file_header->m_Reserved, RESERVED_CHAR, MHT_HEADER_RSVD_SIZE);
return pmht_file_header;
}
void freeMHTFileHeader(PMHT_FILE_HEADER *pmht_file_header){
(*pmht_file_header) != NULL ? free(*pmht_file_header) : nop();
*pmht_file_header = NULL;
return;
}
void initMHTBlock(PMHT_BLOCK *pmht_block){
if(!*pmht_block){
check_pointer(*pmht_block, "*pmht_block");
debug_print("initMHTBlock", "*pmht_block cannot be NULL");
return;
}
(*pmht_block)->m_pageNo = UNASSIGNED_PAGENO;
(*pmht_block)->m_nodeLevel = 0;
memset((*pmht_block)->m_hash, 0, HASH_LEN);
(*pmht_block)->m_isSupplementaryNode = (uchar)FALSE;
(*pmht_block)->m_isZeroNode = (uchar)FALSE;
(*pmht_block)->m_lChildPageNo = UNASSIGNED_PAGENO;
(*pmht_block)->m_lChildOffset = UNASSIGNED_OFFSET;
(*pmht_block)->m_rChildPageNo = UNASSIGNED_PAGENO;
(*pmht_block)->m_rChildOffset = UNASSIGNED_OFFSET;
(*pmht_block)->m_parentPageNo = UNASSIGNED_PAGENO;
(*pmht_block)->m_parentOffset = UNASSIGNED_OFFSET;
memset((*pmht_block)->m_Reserved, 'R', MHT_BLOCK_RSVD_SIZE);
return;
}
PMHT_BLOCK makeMHTBlock(){
PMHT_BLOCK pmht_block = NULL;
pmht_block = (PMHT_BLOCK) malloc(sizeof(MHT_BLOCK));
if(!pmht_block) // Failed to allocate memory
return NULL;
initMHTBlock(&pmht_block);
return pmht_block;
}
void freeMHTBlock(PMHT_BLOCK *pmht_block){
(*pmht_block) != NULL ? free(*pmht_block) : nop();
*pmht_block = NULL;
return;
}
void testMHTQueue(){
const char str[32] = TEST_STR2;
char tmp_hash_buffer[SHA256_BLOCK_SIZE] = {0};
int i = 0;
int diff = 0;
PQNode qnode_ptr = NULL;
PQNode bkwd_ptr = NULL;
PQNode current_qnode_ptr = NULL;
PQNode cbd_qnode_ptr = NULL;
PQNode popped_qnode_ptr = NULL;
PQNode peeked_qnode_ptr = NULL;
PQNode tmp_node_ptr = NULL;
PMHTNode mhtnode_ptr = NULL;
bool bCombined = FALSE;
bool bDequeueExec = FALSE; // whether dequeue is executed (for printf control)
if(g_pQHeader != NULL && g_pQ != NULL)
freeQueue(&g_pQHeader, &g_pQ);
else if(g_pQHeader){
freeQueue2(&g_pQHeader);
}
else if(g_pQ){
freeQueue3(&g_pQ);
}
else{ // both of g_pQHeader and g_pQ are NULL
; // do nothing
}
initQueue(&g_pQHeader, &g_pQ);
check_pointer((void*)g_pQHeader, "g_pQHeader");
check_pointer((void*)g_pQ, "g_pQ");
for(i = 0; i < 100; i++){ // i refers to page number
memset(tmp_hash_buffer, 0, SHA256_BLOCK_SIZE);
generateHashByPageNo_SHA256(i + 1, tmp_hash_buffer, SHA256_BLOCK_SIZE);
mhtnode_ptr = makeMHTNode(i+1, tmp_hash_buffer);
check_pointer((void*)mhtnode_ptr, "mhtnode_ptr");
qnode_ptr = makeQNode(mhtnode_ptr, 0);
check_pointer((void*)qnode_ptr, "qnode_ptr");
enqueue(&g_pQHeader, &g_pQ, qnode_ptr);
current_qnode_ptr = g_pQ;
while ((bkwd_ptr = lookBackward(current_qnode_ptr)) && bkwd_ptr != g_pQHeader){
check_pointer(bkwd_ptr, "bkwd_ptr");
if(bkwd_ptr->m_level > g_pQ->m_level)
break;
if(bkwd_ptr->m_level == g_pQ->m_level) {
cbd_qnode_ptr = makeCombinedQNode(bkwd_ptr, g_pQ);
bCombined = TRUE;
check_pointer(cbd_qnode_ptr, "cbd_qnode_ptr");
enqueue(&g_pQHeader, &g_pQ, cbd_qnode_ptr);
}
current_qnode_ptr = current_qnode_ptr->prev;
check_pointer(current_qnode_ptr, "current_qnode_ptr");
}
//dequeue till encountering the new created combined node
if(bCombined) {
while ((peeked_qnode_ptr = peekQueue(g_pQHeader)) &&
peeked_qnode_ptr->m_level < cbd_qnode_ptr->m_level) {
popped_qnode_ptr = dequeue(&g_pQHeader, &g_pQ);
check_pointer(popped_qnode_ptr, "popped_qnode_ptr");
printf("PageNo-Level: %d-%d\t",
popped_qnode_ptr->m_MHTNode_ptr->m_pageNo,
popped_qnode_ptr->m_level);
// print_hash_value(popped_qnode_ptr->m_MHTNode_ptr->m_hash);
deleteQNode(&popped_qnode_ptr);
bDequeueExec = TRUE;
}
bDequeueExec ? printf("\n\n") : nop();
bDequeueExec = FALSE;
bCombined = FALSE;
}
} // for
//printf("%d\n", g_pQHeader->m_length);
// processing the left nodes in the queue
// Finding the first node whose level > g_pQ's level
current_qnode_ptr = g_pQ;
while ((bkwd_ptr = lookBackward(current_qnode_ptr)) && bkwd_ptr != g_pQHeader){
check_pointer(bkwd_ptr, "bkwd_ptr");
if(bkwd_ptr->m_level > g_pQ->m_level){ // node found (tmp_node_ptr)
tmp_node_ptr = bkwd_ptr;
break;
}
current_qnode_ptr = current_qnode_ptr->prev;
check_pointer(current_qnode_ptr, "current_qnode_ptr");
}
// create vacant combined nodes
diff = tmp_node_ptr->m_level - g_pQ->m_level;
for (i = 0; i < diff; i++){
qnode_ptr = makeCombinedQNodeFromSingleNode(g_pQ);
//printf("%d\n", qnode_ptr->m_level);
check_pointer(qnode_ptr, "qnode_ptr");
enqueue(&g_pQHeader, &g_pQ, qnode_ptr);
}
// building the right child of root node
cbd_qnode_ptr = makeCombinedQNode(tmp_node_ptr, g_pQ);
check_pointer(cbd_qnode_ptr, "cbd_qnode_ptr");
enqueue(&g_pQHeader, &g_pQ, cbd_qnode_ptr);
// building final root node
cbd_qnode_ptr = makeCombinedQNode(g_pQHeader->next, g_pQ);
check_pointer(cbd_qnode_ptr, "cbd_qnode_ptr");
enqueue(&g_pQHeader, &g_pQ, cbd_qnode_ptr);
//dequeue all nodes
while(popped_qnode_ptr = dequeue(&g_pQHeader, &g_pQ)){
check_pointer(popped_qnode_ptr, "popped_qnode_ptr");
printf("PageNo-Level: %d-%d\t",
popped_qnode_ptr->m_MHTNode_ptr->m_pageNo,
popped_qnode_ptr->m_level);
// free node
deleteQNode(&popped_qnode_ptr);
} //while
printQueue(g_pQHeader);
freeQueue(&g_pQHeader, &g_pQ);
return;
}
void buildMHTFile(){
PQNode popped_qnode_ptr = NULL;
PMHT_FILE_HEADER mht_file_header_ptr = NULL;
uchar *mhtblk_buffer = NULL;
uchar *mhthdr_buffer = NULL;
// Preparing MHT file
// Creating a new MHT file. Note that if the file exists, it will be truncated!
if((g_mhtFileFD = fo_create_mhtfile(MHT_DEFAULT_FILE_NAME)) < 0) {
debug_print("buildMHTFile", "Creating MHT file failed!");
return;
}
// Moving file pointer to 128th bytes to
// reserve space for header block (root node)
if(fo_locate_mht_pos(g_mhtFileFD, MHT_HEADER_LEN, SEEK_CUR) < 0) {
debug_print("buildMHTFile", "Reserving space for root node failed!");
return;
}
// Initializing MHT file header
// Header will be updated at the end of building MHT file
mht_file_header_ptr = makeMHTFileHeader();
process_all_pages(&g_pQHeader, &g_pQ);
/* g_pQHeader->m_length > 1 indicates that there are at least 1 floating leaf node in the queue,
thus, supplementary nodes must be added to construct a complete binary tree. If g_pQHeader->m_length = 1,
that means only the top root node remains in the queue. In other words, the number of leaf nodes (N_l)
satifies that log_2(N_l) is an integer.
*/
if(g_pQHeader->m_length > 1)
deal_with_remaining_nodes_in_queue(&g_pQHeader, &g_pQ);
//dequeue remaining nodes (actually, only root node remains)
while(popped_qnode_ptr = dequeue(&g_pQHeader, &g_pQ)){
check_pointer(popped_qnode_ptr, "popped_qnode_ptr");
// Building MHT blocks based on dequeued nodes, then writing to MHT file.
mhtblk_buffer = (uchar*) malloc(MHT_BLOCK_SIZE);
memset(mhtblk_buffer, 0, MHT_BLOCK_SIZE);
qnode_to_mht_buffer(popped_qnode_ptr, &mhtblk_buffer, MHT_BLOCK_SIZE);
// set the first byte of the root buffer to 0x01, which means this buffer stores root node
(mhtblk_buffer + MHT_BLOCK_OFFSET_RSVD)[0] = 0x01;
if(g_mhtFileFD > 0) {
g_mhtFileRootNodeOffset = fo_locate_mht_pos(g_mhtFileFD, 0, SEEK_CUR); //temporarily storing root node offset in MHT file
fo_update_mht_block(g_mhtFileFD, mhtblk_buffer, MHT_BLOCK_SIZE, 0, SEEK_CUR); // write root block to MHT file
}
free(mhtblk_buffer); mhtblk_buffer = NULL;
print_qnode_info(popped_qnode_ptr);
// free node
deleteQNode(&popped_qnode_ptr);
} //while
/***** Updating MHT file header *****/
mhthdr_buffer = (uchar*) malloc(MHT_HEADER_LEN);
if(mht_file_header_ptr && mhthdr_buffer){
mht_file_header_ptr->m_rootNodeOffset = g_mhtFileRootNodeOffset;
mht_file_header_ptr->m_firstSupplementaryLeafOffset = g_mhtFirstSplymtLeafOffset;
serialize_mht_file_header(mht_file_header_ptr, &mhthdr_buffer, MHT_HEADER_LEN);
fo_update_mht_file_header(g_mhtFileFD, mhthdr_buffer, MHT_HEADER_LEN);
free(mhthdr_buffer);
freeMHTFileHeader(&mht_file_header_ptr);
}
printQueue(g_pQHeader);
freeQueue(&g_pQHeader, &g_pQ);
fo_close_mhtfile(g_mhtFileFD);
return;
}
int initOpenMHTFileWR(uchar *pathname){
int ret = -1;
if(!pathname){
debug_print("initOpenMHTFile", "Null pathname");
return ret;
}
// file descriptor 0, 1 and 2 refer to STDIN, STDOUT and STDERR
if(g_mhtFileFdRd > 2) {
fo_close_mhtfile(g_mhtFileFdRd);
}
// open MHT file in "READ & WRITE" mode
g_mhtFileFdRd = fo_open_mhtfile(pathname);
ret = g_mhtFileFdRd;
return ret;
}
PMHT_FILE_HEADER readMHTFileHeader() {
PMHT_FILE_HEADER mht_file_header_ptr = NULL;
uchar *mht_file_header_buffer = NULL;
uchar *tmp_ptr = NULL;
if(g_mhtFileFdRd < 3){
debug_print("readMHTFileHeader", "Invalid file descriptor for reading");
return NULL;
}
if(!(mht_file_header_buffer = (uchar*) malloc(MHT_HEADER_LEN))) {
debug_print("readMHTFileHeader", "Failed to allocate memory for mht_file_header_buffer");
return NULL;
}
memset(mht_file_header_buffer, 0, MHT_HEADER_LEN);
fo_read_mht_file_header(g_mhtFileFdRd, mht_file_header_buffer, MHT_HEADER_LEN);
// Preparing to parse MHT file header buffer into MHT file header structure
if(!(mht_file_header_ptr = (PMHT_FILE_HEADER) malloc(sizeof(MHT_FILE_HEADER)))) {
debug_print("readMHTFileHeader", "Failed to allocate memory for mht_file_header_ptr");
return NULL;
}
tmp_ptr = mht_file_header_buffer;
memcpy(mht_file_header_ptr->m_magicStr, tmp_ptr, MHT_FILE_MAGIC_STRING_LEN);
tmp_ptr += MHT_FILE_MAGIC_STRING_LEN;
memcpy(&(mht_file_header_ptr->m_rootNodeOffset), tmp_ptr, sizeof(uint32));
tmp_ptr += sizeof(uint32);
memcpy(&(mht_file_header_ptr->m_firstSupplementaryLeafOffset), tmp_ptr, sizeof(uint32));
tmp_ptr += sizeof(uint32);
memcpy(mht_file_header_ptr->m_Reserved, tmp_ptr, MHT_HEADER_RSVD_SIZE);
return mht_file_header_ptr;
}
int locateMHTBlockOffsetByPageNo(int page_no) {
PMHT_BLOCK mhtblk_ptr = NULL; // MHT block preserving the found page
uchar *rootnode_buf = NULL; // root node block buffer
uchar *tmpblk_buf = NULL; // temporarily storing MHT block buffer
uchar *childblk_buf = NULL;
PMHT_FILE_HEADER mhtfilehdr_ptr = NULL;
bool bPageBlockFound = FALSE;
uint32 node_level = NODELEVEL_LEAF;
uint32 node_page_no = UNASSIGNED_PAGENO; // temporarily preserving MHT block's page number
int ret_offset = -1;
if(g_mhtFileFdRd < 3){
debug_print("locateMHTBlockOffsetByPageNo", "Invalid file descriptor");
return -1;
}
if(page_no < 0) {
debug_print("locateMHTBlockOffsetByPageNo", "Invalid page number");
return -1;
}
if(!(mhtfilehdr_ptr = readMHTFileHeader())){
debug_print("locateMHTBlockOffsetByPageNo", "Failed to read MHT file header");
return -1;
}
rootnode_buf = (uchar*) malloc(MHT_BLOCK_SIZE);
childblk_buf = (uchar*) malloc(MHT_BLOCK_SIZE);
memset(rootnode_buf, 0, MHT_BLOCK_SIZE);
memset(childblk_buf, 0, MHT_BLOCK_SIZE);
// after reading root node block, the file pointer is at the end of the file.
fo_read_mht_block2(g_mhtFileFdRd, rootnode_buf, MHT_BLOCK_SIZE, mhtfilehdr_ptr->m_rootNodeOffset, SEEK_SET);
// reset the file pointer to the beginning of the root node block
fo_locate_mht_pos(g_mhtFileFdRd, -MHT_BLOCK_SIZE, SEEK_CUR);
tmpblk_buf = rootnode_buf;
// binary search algorithm
while((node_level = *((int*)(tmpblk_buf + MHT_BLOCK_OFFSET_LEVEL))) > NODELEVEL_LEAF) {
node_page_no = *((int*)(tmpblk_buf + MHT_BLOCK_OFFSET_PAGENO));
//printf("pageNo: %d\n", node_page_no);
if(page_no <= node_page_no){ // go to left child block
fo_read_mht_block(g_mhtFileFdRd, childblk_buf, MHT_BLOCK_SIZE,
*((int*)(tmpblk_buf + MHT_BLOCK_OFFSET_LCOS)), SEEK_CUR);
}
else{ // go to right child block
fo_read_mht_block(g_mhtFileFdRd, childblk_buf, MHT_BLOCK_SIZE,
*((int*)(tmpblk_buf + MHT_BLOCK_OFFSET_RCOS)), SEEK_CUR);
}
// reset the file pointer to the beginning of the current left child node block
ret_offset = fo_locate_mht_pos(g_mhtFileFdRd, -MHT_BLOCK_SIZE, SEEK_CUR);
tmpblk_buf = childblk_buf;
} // while
// Now, tmpblk_buf stores the final leaf node block
if(page_no != *((int*)(tmpblk_buf + MHT_BLOCK_OFFSET_PAGENO))) {
debug_print("locateMHTBlockOffsetByPageNo", "No page found");
return -1; // search failed
}
// free memory
free(rootnode_buf);
free(childblk_buf);
free(mhtfilehdr_ptr);
return ret_offset;
}
PMHT_BLOCK searchPageByNo(int page_no) {
PMHT_BLOCK mhtblk_ptr = NULL;
uchar *block_buf = NULL;
if(locateMHTBlockOffsetByPageNo(page_no) <= 0){
debug_print("searchPageByNo", "No page found");
return NULL;
}
// Page block found and the file pointer is at the beginning of the block
// read block buffer
block_buf = (uchar*) malloc (MHT_BLOCK_SIZE);
memset(block_buf, 0, MHT_BLOCK_SIZE);
fo_read_mht_block2(g_mhtFileFdRd, block_buf, MHT_BLOCK_SIZE, 0, SEEK_CUR);
// build a MHT block structure to store the page info.
mhtblk_ptr = makeMHTBlock();
unserialize_mht_block(block_buf, MHT_BLOCK_SIZE, &mhtblk_ptr);
return mhtblk_ptr;
/*PMHT_BLOCK mhtblk_ptr = NULL; // MHT block preserving the found page
uchar *rootnode_buf = NULL; // root node block buffer
uchar *tmpblk_buf = NULL; // temporarily storing MHT block buffer
uchar *childblk_buf = NULL;
PMHT_FILE_HEADER mhtfilehdr_ptr = NULL;
bool bPageBlockFound = FALSE;
uint32 node_level = NODELEVEL_LEAF;
uint32 node_page_no = UNASSIGNED_PAGENO; // temporarily preserving MHT block's page number
if(g_mhtFileFdRd < 3){
debug_print("searchPageByNo", "Invalid file descriptor");
return NULL;
}
if(page_no < 0) {
debug_print("searchPageByNo", "Invalid page number");
return NULL;
}
if(!(mhtfilehdr_ptr = readMHTFileHeader())){
debug_print("searchPageByNo", "Failed to read MHT file header");
return NULL;
}
rootnode_buf = (uchar*) malloc(MHT_BLOCK_SIZE);
childblk_buf = (uchar*) malloc(MHT_BLOCK_SIZE);
memset(rootnode_buf, 0, MHT_BLOCK_SIZE);
memset(childblk_buf, 0, MHT_BLOCK_SIZE);
// after reading root node block, the file pointer is at the end of the file.
fo_read_mht_block2(g_mhtFileFdRd, rootnode_buf, MHT_BLOCK_SIZE, mhtfilehdr_ptr->m_rootNodeOffset, SEEK_SET);
// reset the file pointer to the beginning of the root node block
fo_locate_mht_pos(g_mhtFileFdRd, -MHT_BLOCK_SIZE, SEEK_CUR);
tmpblk_buf = rootnode_buf;
// binary search algorithm
while((node_level = *((int*)(tmpblk_buf + MHT_BLOCK_OFFSET_LEVEL))) > NODELEVEL_LEAF) {
node_page_no = *((int*)(tmpblk_buf + MHT_BLOCK_OFFSET_PAGENO));
//printf("pageNo: %d\n", node_page_no);
if(page_no <= node_page_no){ // go to left child block
fo_read_mht_block(g_mhtFileFdRd, childblk_buf, MHT_BLOCK_SIZE,
*((int*)(tmpblk_buf + MHT_BLOCK_OFFSET_LCOS)), SEEK_CUR);
// reset the file pointer to the beginning of the current left child node block
fo_locate_mht_pos(g_mhtFileFdRd, -MHT_BLOCK_SIZE, SEEK_CUR);
tmpblk_buf = childblk_buf;
}
else{ // go to right child block
fo_read_mht_block(g_mhtFileFdRd, childblk_buf, MHT_BLOCK_SIZE,
*((int*)(tmpblk_buf + MHT_BLOCK_OFFSET_RCOS)), SEEK_CUR);
// reset the file pointer to the beginning of the current left child node block
fo_locate_mht_pos(g_mhtFileFdRd, -MHT_BLOCK_SIZE, SEEK_CUR);
tmpblk_buf = childblk_buf;
}
} // while
// final leaf node has been reached when loop ends
if(page_no != *((int*)(tmpblk_buf + MHT_BLOCK_OFFSET_PAGENO))) {
debug_print("searchPageByNo", "No page found");
return NULL;
}
// build a MHT block structure to store the page info.
mhtblk_ptr = makeMHTBlock();
unserialize_mht_block(tmpblk_buf, MHT_BLOCK_SIZE, &mhtblk_ptr);
// printf("Found page: %d\n", *((int*)(tmpblk_buf + MHT_BLOCK_OFFSET_PAGENO)));
// free memory
free(rootnode_buf);
free(childblk_buf);
free(mhtfilehdr_ptr);
return mhtblk_ptr;
*/
}
int updateMHTBlockHashByPageNo(int page_no, uchar *hash_val, uint32 hash_val_len) {
uchar *block_buf = NULL;
//需要更新的MHT_block的偏移量
int update_blobk_offset = 0;
int offset = -1;
if(page_no < 0) {
debug_print("updateMHTBlockHashByPageNo", "Invalid page number");
return -1;
}
if(!hash_val || hash_val_len != HASH_LEN){
debug_print("updateMHTBlockHashByPageNo", "Invalid hash_val or hash_val_len");
return -1;
}
if((update_blobk_offset = locateMHTBlockOffsetByPageNo(page_no)) <= 0){
debug_print("updateMHTBlockHashByPageNo", "No page found");
return -2;
}
//更新指定页码的MHT_block块
//读取MHT_block内容（使用绝对偏移量）
block_buf = (uchar*) malloc(MHT_BLOCK_SIZE);
memset(block_buf, 0, MHT_BLOCK_SIZE);
fo_read_mht_block2(g_mhtFileFdRd, block_buf, MHT_BLOCK_SIZE, update_blobk_offset, SEEK_SET);
//将更新后的哈希值写入文件中
//1.替换旧哈希值
memcpy(block_buf + MHT_BLOCK_OFFSET_HASH, hash_val, HASH_LEN);
//2.将文件读写光标重新定位到更新块的开头
fo_locate_mht_pos(g_mhtFileFdRd, update_blobk_offset, SEEK_SET);
//3.写入文件
fo_update_mht_block(g_mhtFileFdRd, block_buf, MHT_BLOCK_SIZE, 0, SEEK_CUR);
//更新整条验证路径
//记录节点对应偏移量
int parent_offset = 0;
//临时存放MHT节点信息
uchar *temp_block_buf = NULL;
//存放计算后的新哈希值
uchar *new_hash = NULL;
int temp_blobk_offset = 0;
temp_block_buf = (uchar*) malloc(MHT_BLOCK_SIZE);
new_hash = (uchar*) malloc(HASH_LEN);
memset(new_hash, 0, HASH_LEN);
printf("update_offset:%d\n", update_blobk_offset);
while((parent_offset = *((int*)(block_buf + MHT_BLOCK_OFFSET_POS))) != 0)
{
//1.读取父节点信息
temp_blobk_offset = update_blobk_offset + parent_offset * MHT_BLOCK_SIZE;
printf("temp_blobk_offset:%d\n", temp_blobk_offset);
memset(temp_block_buf, 0, MHT_BLOCK_SIZE);
fo_read_mht_block2(g_mhtFileFdRd, temp_block_buf, MHT_BLOCK_SIZE, temp_blobk_offset, SEEK_SET);
//2.更新其哈希值并写入文件
cal_parent_nodes_sha256(temp_block_buf, temp_blobk_offset);
fo_update_mht_block2(g_mhtFileFdRd, temp_block_buf, MHT_BLOCK_SIZE, temp_blobk_offset, SEEK_SET);
//3.更新MHT块相关信息
memset(block_buf, 0, MHT_BLOCK_SIZE);
memcpy(block_buf, temp_block_buf, MHT_BLOCK_SIZE);
update_blobk_offset = temp_blobk_offset;
//fo_read_mht_block2(g_mhtFileFdRd, block_buf, MHT_BLOCK_SIZE, update_blobk_offset, SEEK_SET);
//printf("update_offset:%d\n", update_blobk_offset);
}
free(block_buf);
free(temp_block_buf);
free(new_hash);
return 0;
}
int insertNewMHTBlock(PMHT_BLOCK pmht_block) {
return 0;
}
/*---------- Helper Functions ---------------*/
void process_all_pages(PQNode *pQHeader, PQNode *pQ) {
char tmp_hash_buffer[SHA256_BLOCK_SIZE] = {0};
int i = 0;
int diff = 0;
PQNode qnode_ptr = NULL;
PQNode bkwd_ptr = NULL;
PQNode current_qnode_ptr = NULL;
PQNode cbd_qnode_ptr = NULL;
PQNode popped_qnode_ptr = NULL;
PQNode peeked_qnode_ptr = NULL;
PQNode lchild_ptr = NULL;
PQNode rchild_ptr = NULL;
PMHTNode mhtnode_ptr = NULL;
bool bCombined = FALSE;
bool bDequeueExec = FALSE; // whether dequeue is executed (for printf control)
PMHT_BLOCK mht_blk_ptr = NULL;
uchar *mhtblk_buffer = NULL;
if(*pQHeader != NULL && *pQ != NULL)
freeQueue(pQHeader, pQ);
else if(*pQHeader){
freeQueue2(pQHeader);
}
else if(*pQ){
freeQueue3(pQ);
}
else{ // both of g_pQHeader and g_pQ are NULL
; // do nothing
}
initQueue(pQHeader, pQ);
check_pointer((void*)*pQHeader, "pQHeader");
check_pointer((void*)*pQ, "pQ");
for(i = 0; i < 16; i++){ // i refers to page number
memset(tmp_hash_buffer, 0, SHA256_BLOCK_SIZE);
generateHashByPageNo_SHA256(i + 1, tmp_hash_buffer, SHA256_BLOCK_SIZE);
mhtnode_ptr = makeMHTNode(i+1, tmp_hash_buffer);
check_pointer((void*)mhtnode_ptr, "mhtnode_ptr");
qnode_ptr = makeQNode(mhtnode_ptr, NODELEVEL_LEAF);
check_pointer((void*)qnode_ptr, "qnode_ptr");
enqueue(pQHeader, pQ, qnode_ptr);
current_qnode_ptr = g_pQ;
while ((bkwd_ptr = lookBackward(current_qnode_ptr)) && bkwd_ptr != g_pQHeader){
check_pointer(bkwd_ptr, "bkwd_ptr");
if(bkwd_ptr->m_level > (*pQ)->m_level)
break;
if(bkwd_ptr->m_level == (*pQ)->m_level) {
lchild_ptr = bkwd_ptr;
rchild_ptr = *pQ;
cbd_qnode_ptr = makeCombinedQNode(lchild_ptr, rchild_ptr);
bCombined = TRUE;
check_pointer(cbd_qnode_ptr, "cbd_qnode_ptr");
enqueue(pQHeader, pQ, cbd_qnode_ptr);
deal_with_nodes_offset(cbd_qnode_ptr, lchild_ptr, rchild_ptr);
deal_with_interior_nodes_pageno(cbd_qnode_ptr, lchild_ptr, rchild_ptr);
}
current_qnode_ptr = current_qnode_ptr->prev;
check_pointer(current_qnode_ptr, "current_qnode_ptr");
}
//dequeue till encountering the new created combined node
if(bCombined) {
while ((peeked_qnode_ptr = peekQueue(*pQHeader)) && peeked_qnode_ptr->m_level < cbd_qnode_ptr->m_level) {
popped_qnode_ptr = dequeue(pQHeader, pQ);
check_pointer(popped_qnode_ptr, "popped_qnode_ptr");
// Building MHT blocks based on dequeued nodes, then writing to MHT file.
mhtblk_buffer = (uchar*) malloc(MHT_BLOCK_SIZE);
memset(mhtblk_buffer, 0, MHT_BLOCK_SIZE);
qnode_to_mht_buffer(popped_qnode_ptr, &mhtblk_buffer, MHT_BLOCK_SIZE);
if(g_mhtFileFD > 0) {
fo_update_mht_block(g_mhtFileFD, mhtblk_buffer, MHT_BLOCK_SIZE, 0, SEEK_CUR);
}
free(mhtblk_buffer); mhtblk_buffer = NULL;
/***************** CODE FOR TEST *****************/
/*
if(popped_qnode_ptr->m_MHTNode_ptr->m_pageNo == 1 &&
popped_qnode_ptr->m_level == 0){
mhtblk_buffer = (uchar*) malloc(sizeof(MHT_BLOCK));
mht_blk_ptr = makeMHTBlock();
convert_qnode_to_mht_block(popped_qnode_ptr, &mht_blk_ptr);
serialize_mht_block(mht_blk_ptr, &mhtblk_buffer, MHT_BLOCK_SIZE);
print_buffer_in_byte_hex(mhtblk_buffer, MHT_BLOCK_SIZE);
freeMHTBlock(&mht_blk_ptr);
free(mhtblk_buffer);
}
*/
/************************************************/
print_qnode_info(popped_qnode_ptr);
deleteQNode(&popped_qnode_ptr);
bDequeueExec = TRUE;
}
bDequeueExec ? printf("\n\n") : nop();
bDequeueExec = FALSE;
bCombined = FALSE;
}
} // for
}
void deal_with_remaining_nodes_in_queue(PQNode *pQHeader, PQNode *pQ){
PQNode qnode_ptr = NULL;
PQNode current_qnode_ptr = NULL;
PQNode bkwd_ptr = NULL;
PQNode cbd_qnode_ptr = NULL;
PQNode peeked_qnode_ptr = NULL;
PQNode popped_qnode_ptr = NULL;
PQNode lchild_ptr = NULL;
PQNode rchild_ptr = NULL;
PMHTNode mhtnode_ptr = NULL;
uint32 qHeaderLevel = 0;
bool bCombined = FALSE;
bool bDequeueExec = FALSE; // whether dequeue is executed (for printf control)
bool bEnctrFirstSplymtLeaf = FALSE; // whether firstly encountering the first supplementary leaf
char tmp_hash_buffer[SHA256_BLOCK_SIZE] = {0};
uchar *mhtblk_buffer = NULL;
// Both of these two pointer cannot be NULL.
if(!*pQHeader || !*pQ){
check_pointer(*pQHeader, "*pQHeader");
check_pointer(*pQ, "*pQ");
return;
}
// Queue cannot be empty.
if(*pQHeader == *pQ){
return debug_print("deal_with_remaining_nodes_in_queue", "queue cannot be empty");
}
/* When pQ->level > pHeader->next->m_level, loop ends.
Note that the loop ending condition reveals that the final root node
has been created. */
// temporarily storing header level
qHeaderLevel = (*pQHeader)->next->m_level;
while((*pQ)->m_level <= qHeaderLevel){
mhtnode_ptr = makeZeroMHTNode(UNASSIGNED_PAGENO);
check_pointer(mhtnode_ptr, "mhtnode_ptr");
qnode_ptr = makeQNode2(mhtnode_ptr,
NODELEVEL_LEAF,
(uchar) TRUE,
(uchar) TRUE,
UNASSIGNED_PAGENO);
check_pointer(qnode_ptr, "qnode_ptr");
enqueue(pQHeader, pQ, qnode_ptr);
current_qnode_ptr = *pQ;
while((bkwd_ptr = lookBackward(current_qnode_ptr))
&& bkwd_ptr != *pQHeader) {
check_pointer(bkwd_ptr, "bkwd_ptr");
if(bkwd_ptr->m_level > (*pQ)->m_level)
break;
if(bkwd_ptr->m_level == (*pQ)->m_level) {
lchild_ptr = bkwd_ptr;
rchild_ptr = *pQ;
cbd_qnode_ptr = makeCombinedQNode(lchild_ptr, rchild_ptr);
bCombined = TRUE;
check_pointer(cbd_qnode_ptr, "cbd_qnode_ptr");
enqueue(pQHeader, pQ, cbd_qnode_ptr);
deal_with_nodes_offset(cbd_qnode_ptr, lchild_ptr, rchild_ptr);
deal_with_interior_nodes_pageno(cbd_qnode_ptr, lchild_ptr, rchild_ptr);
} //if
current_qnode_ptr = current_qnode_ptr->prev;
check_pointer(current_qnode_ptr, "current_qnode_ptr");
} // while
if(bCombined) {
while((peeked_qnode_ptr = peekQueue(*pQHeader)) &&
peeked_qnode_ptr->m_level < cbd_qnode_ptr->m_level) {
popped_qnode_ptr = dequeue(pQHeader, pQ);
check_pointer(popped_qnode_ptr, "popped_qnode_ptr");
// Building MHT blocks based on dequeued nodes, then writing to MHT file.
mhtblk_buffer = (uchar*) malloc(MHT_BLOCK_SIZE);
memset(mhtblk_buffer, 0, MHT_BLOCK_SIZE);
qnode_to_mht_buffer(popped_qnode_ptr, &mhtblk_buffer, MHT_BLOCK_SIZE);
if(g_mhtFileFD > 0) {
// record the first supplementary leaf node offset to g_mhtFirstSplymtLeafOffset
if(!bEnctrFirstSplymtLeaf &&
popped_qnode_ptr->m_MHTNode_ptr->m_pageNo == UNASSIGNED_PAGENO &&
popped_qnode_ptr->m_level == 0) {
g_mhtFirstSplymtLeafOffset = fo_locate_mht_pos(g_mhtFileFD, 0, SEEK_CUR);
bEnctrFirstSplymtLeaf = TRUE;
}
fo_update_mht_block(g_mhtFileFD, mhtblk_buffer, MHT_BLOCK_SIZE, 0, SEEK_CUR);
}
free(mhtblk_buffer); mhtblk_buffer = NULL;
print_qnode_info(popped_qnode_ptr);
deleteQNode(&popped_qnode_ptr);
bDequeueExec = TRUE;
} // while
bDequeueExec ? printf("\n\n") : nop();
bDequeueExec = FALSE;
bCombined = FALSE;
}// if
} // while
}
uint32 compute_relative_distance_between_2_nodes(PQNode qnode1_ptr,
PQNode qnode2_ptr,
uchar pov) {
uint32 ret_val = -1;
uint32 counter = 0;
PQNode tmp_node_ptr = NULL;
if(!qnode1_ptr || !qnode2_ptr) {
check_pointer(qnode1_ptr, "qnode1_ptr");
check_pointer(qnode2_ptr, "qnode2_ptr");
return ret_val;
}
tmp_node_ptr = qnode1_ptr;
while(tmp_node_ptr != qnode2_ptr && tmp_node_ptr) {
counter ++;
tmp_node_ptr = tmp_node_ptr->next;
}
ret_val = pov == 0x01 ? counter : -counter;
return ret_val;
}
void deal_with_nodes_offset(PQNode parent_ptr, PQNode lchild_ptr, PQNode rchild_ptr){
int d1 = -1, d2 = -1;
if(!parent_ptr || !lchild_ptr || !rchild_ptr){
check_pointer(parent_ptr, "parent_ptr");
check_pointer(lchild_ptr, "lchild_ptr");
check_pointer(rchild_ptr, "rchild_ptr");
return;
}
d1 = compute_relative_distance_between_2_nodes(lchild_ptr, parent_ptr, 0x02);
d2 = compute_relative_distance_between_2_nodes(rchild_ptr, parent_ptr, 0x02);
parent_ptr->m_MHTNode_ptr->m_lchildOffset = d1;
parent_ptr->m_MHTNode_ptr->m_rchildOffset = d2;
lchild_ptr->m_MHTNode_ptr->m_parentOffset = -d1;
rchild_ptr->m_MHTNode_ptr->m_parentOffset = -d2;
return;
}
void deal_with_interior_nodes_pageno(PQNode parent_ptr, PQNode lchild_ptr, PQNode rchild_ptr) {
if(!parent_ptr || !lchild_ptr || !rchild_ptr){
check_pointer(parent_ptr, "parent_ptr");
check_pointer(lchild_ptr, "lchild_ptr");
check_pointer(rchild_ptr, "rchild_ptr");
return;
}
/* lchild_ptr and rchild_ptr are leaf nodes. */
if(lchild_ptr->m_level <= 0 || rchild_ptr->m_level <= 0){
parent_ptr->m_MHTNode_ptr->m_pageNo = lchild_ptr->m_MHTNode_ptr->m_pageNo;
parent_ptr->m_RMSTL_page_no = rchild_ptr->m_MHTNode_ptr->m_pageNo;
}
else{ /* lchild_ptr and rchild_ptr are interior nodes. */
parent_ptr->m_MHTNode_ptr->m_pageNo = lchild_ptr->m_RMSTL_page_no;
parent_ptr->m_RMSTL_page_no = rchild_ptr->m_RMSTL_page_no;
}
parent_ptr->m_MHTNode_ptr->m_lchildPageNo = lchild_ptr->m_MHTNode_ptr->m_pageNo;
parent_ptr->m_MHTNode_ptr->m_rchildPageNo = rchild_ptr->m_MHTNode_ptr->m_pageNo;
lchild_ptr->m_MHTNode_ptr->m_parentPageNo = parent_ptr->m_MHTNode_ptr->m_pageNo;
rchild_ptr->m_MHTNode_ptr->m_parentPageNo = parent_ptr->m_MHTNode_ptr->m_pageNo;
return;
}
int serialize_mht_block(PMHT_BLOCK pmht_block,
uchar **block_buf,
uint32 block_buf_len) {
int ret = 0; // 0 refers to none data has been processed.
char *p_buf = NULL;
if(!pmht_block || !*block_buf || !block_buf || block_buf_len != MHT_BLOCK_SIZE) {
check_pointer(pmht_block, "pmht_block");
check_pointer(*block_buf, "*block_buf");
check_pointer(block_buf, "block_buf");
debug_print("serialize_mht_block", "error parameters");
return ret;
}
p_buf = *block_buf;
memset(p_buf, 0, MHT_BLOCK_SIZE);
memcpy(p_buf, &(pmht_block->m_pageNo), sizeof(int));
p_buf += sizeof(int);
ret += sizeof(int);
memcpy(p_buf, &(pmht_block->m_nodeLevel), sizeof(int));
p_buf += sizeof(int);
ret += sizeof(int);
memcpy(p_buf, pmht_block->m_hash, HASH_LEN);
p_buf += HASH_LEN;
ret += HASH_LEN;
*p_buf = pmht_block->m_isSupplementaryNode;
p_buf += sizeof(char);
ret += sizeof(char);
*p_buf = pmht_block->m_isZeroNode;
p_buf += sizeof(char);
ret += sizeof(char);
memcpy(p_buf, &(pmht_block->m_lChildPageNo), sizeof(int));
p_buf += sizeof(int);
ret += sizeof(int);
memcpy(p_buf, &(pmht_block->m_lChildOffset), sizeof(int));
p_buf += sizeof(int);
ret += sizeof(int);
memcpy(p_buf, &(pmht_block->m_rChildPageNo), sizeof(int));
p_buf += sizeof(int);
ret += sizeof(int);
memcpy(p_buf, &(pmht_block->m_rChildOffset), sizeof(int));
p_buf += sizeof(int);
ret += sizeof(int);
memcpy(p_buf, &(pmht_block->m_parentPageNo), sizeof(int));
p_buf += sizeof(int);
ret += sizeof(int);
memcpy(p_buf, &(pmht_block->m_parentOffset), sizeof(int));
p_buf += sizeof(int);
ret += sizeof(int);
memcpy(p_buf, pmht_block->m_Reserved, MHT_BLOCK_RSVD_SIZE);
ret += MHT_BLOCK_RSVD_SIZE;
return ret;
}
int serialize_mht_file_header(PMHT_FILE_HEADER pmht_file_header,
uchar **header_buf,
uint32 header_buf_len){
int ret = 0; // 0 refers to none data has been processed.
char *p_buf = NULL;
if(!pmht_file_header || !*header_buf || !header_buf || header_buf_len != MHT_HEADER_LEN) {
check_pointer(pmht_file_header, "pmht_file_header");
check_pointer(*header_buf, "*header_buf");
check_pointer(header_buf, "header_buf");
debug_print("serialize_mht_file_header", "error parameters");
return ret;
}
p_buf = *header_buf;
memset(p_buf, 0, MHT_HEADER_LEN);
memcpy(p_buf, pmht_file_header->m_magicStr, MHT_FILE_MAGIC_STRING_LEN);
p_buf += MHT_FILE_MAGIC_STRING_LEN;
ret += MHT_FILE_MAGIC_STRING_LEN;
memcpy(p_buf, &(pmht_file_header->m_rootNodeOffset), sizeof(uint32));
p_buf += sizeof(uint32);
ret += sizeof(uint32);
memcpy(p_buf, &(pmht_file_header->m_firstSupplementaryLeafOffset), sizeof(uint32));
p_buf += sizeof(uint32);
ret += sizeof(uint32);
memcpy(p_buf, pmht_file_header->m_Reserved, MHT_HEADER_RSVD_SIZE);
ret += MHT_HEADER_RSVD_SIZE;
return ret;
}
int unserialize_mht_block(char *block_buf,
uint32 block_buf_len,
PMHT_BLOCK *pmht_block) {
int ret = 0; // 0 refers to none data has been processed.
PMHT_BLOCK tmpblk_ptr = NULL;
if(!pmht_block || !block_buf || block_buf_len != MHT_BLOCK_SIZE) {
check_pointer(pmht_block, "pmht_block");
check_pointer(block_buf, "block_buf");
debug_print("unserialize_mht_block", "error parameters");
return ret;
}
tmpblk_ptr = *pmht_block;
tmpblk_ptr->m_pageNo = *((int*)(block_buf + MHT_BLOCK_OFFSET_PAGENO)); ret += sizeof(int);
tmpblk_ptr->m_nodeLevel = *((int*)(block_buf + MHT_BLOCK_OFFSET_LEVEL)); ret += sizeof(int);
memcpy(tmpblk_ptr->m_hash, block_buf + MHT_BLOCK_OFFSET_HASH, HASH_LEN); ret += HASH_LEN;
tmpblk_ptr->m_isSupplementaryNode = *((char*)(block_buf + MHT_BLOCK_OFFSET_ISN)); ret += sizeof(char);
tmpblk_ptr->m_isZeroNode = *((char*)(block_buf + MHT_BLOCK_OFFSET_IZN)); ret += sizeof(char);
tmpblk_ptr->m_lChildPageNo = *((int*)(block_buf + MHT_BLOCK_OFFSET_LCPN)); ret += sizeof(int);
tmpblk_ptr->m_lChildOffset = *((int*)(block_buf + MHT_BLOCK_OFFSET_LCOS)); ret += sizeof(int);
tmpblk_ptr->m_rChildPageNo = *((int*)(block_buf + MHT_BLOCK_OFFSET_RCPN)); ret += sizeof(int);
tmpblk_ptr->m_rChildOffset = *((int*)(block_buf + MHT_BLOCK_OFFSET_RCOS)); ret += sizeof(int);
tmpblk_ptr->m_parentPageNo = *((int*)(block_buf + MHT_BLOCK_OFFSET_PPN)); ret += sizeof(int);
tmpblk_ptr->m_parentOffset = *((int*)(block_buf + MHT_BLOCK_OFFSET_POS)); ret += sizeof(int);
memcpy(tmpblk_ptr->m_Reserved, block_buf + MHT_BLOCK_OFFSET_RSVD, MHT_BLOCK_RSVD_SIZE); ret += MHT_BLOCK_RSVD_SIZE;
return ret;
/*
pmht_block->m_pageNo = *((int*)p_buf);
p_buf += sizeof(int);
pmht_block->m_nodeLevel = *((int*)p_buf);
p_buf += sizeof(int);
memcpy(pmht_block->m_hash, p_buf, HASH_LEN);
p_buf += HASH_LEN;
*/
}
int qnode_to_mht_buffer(PQNode qnode_ptr, uchar **mht_block_buf, uint32 mht_block_buf_len) {
int ret = 0;
uchar *p_buf = NULL;
if(!qnode_ptr || !(qnode_ptr->m_MHTNode_ptr) || !*mht_block_buf || !mht_block_buf || mht_block_buf_len != MHT_BLOCK_SIZE) {
check_pointer(qnode_ptr, "qnode_ptr");
check_pointer(*mht_block_buf, "*mht_block_buf");
check_pointer(mht_block_buf, "mht_block_buf");
debug_print("qnode_to_mht_buffer", "Error parameters");
return ret;
}
memset(*mht_block_buf, 0, MHT_BLOCK_SIZE);
p_buf = *mht_block_buf;
memcpy(p_buf, &(qnode_ptr->m_MHTNode_ptr->m_pageNo), sizeof(int));
p_buf += sizeof(int);
ret += sizeof(int);
memcpy(p_buf, &(qnode_ptr->m_level), sizeof(int));
p_buf += sizeof(int);
ret += sizeof(int);
memcpy(p_buf, qnode_ptr->m_MHTNode_ptr->m_hash, HASH_LEN);
p_buf += HASH_LEN;
ret += HASH_LEN;
*p_buf = qnode_ptr->m_is_supplementary_node;
p_buf += sizeof(char);
ret += sizeof(char);
*p_buf = qnode_ptr->m_is_zero_node;
p_buf += sizeof(char);
ret += sizeof(char);
memcpy(p_buf, &(qnode_ptr->m_MHTNode_ptr->m_lchildPageNo), sizeof(int));
p_buf += sizeof(int);
ret += sizeof(int);
memcpy(p_buf, &(qnode_ptr->m_MHTNode_ptr->m_lchildOffset), sizeof(int));
p_buf += sizeof(int);
ret += sizeof(int);
memcpy(p_buf, &(qnode_ptr->m_MHTNode_ptr->m_rchildPageNo), sizeof(int));
p_buf += sizeof(int);
ret += sizeof(int);
memcpy(p_buf, &(qnode_ptr->m_MHTNode_ptr->m_rchildOffset), sizeof(int));
p_buf += sizeof(int);
ret += sizeof(int);
memcpy(p_buf, &(qnode_ptr->m_MHTNode_ptr->m_parentPageNo), sizeof(int));