44 static uint32_t heapsize;  variable
54 	while (pos<heapsize) {  in merger_heap_sort_down()
57 		if (l>=heapsize) {  in merger_heap_sort_down()
61 		if (r<heapsize && heap[r].nextid < heap[l].nextid) {  in merger_heap_sort_down()
75 	uint32_t pos=heapsize-1;  in merger_heap_sort_up()
107 	if (heap[heapsize].fd) {  in merger_delete_entry()
108 		fclose(heap[heapsize].fd);  in merger_delete_entry()
110 	if (heap[heapsize].filename) {  in merger_delete_entry()
111 		free(heap[heapsize].filename);  in merger_delete_entry()
113 	if (heap[heapsize].buff) {  in merger_delete_entry()
114 		free(heap[heapsize].buff);  in merger_delete_entry()
120 	if ((heap[heapsize].fd = fopen(filename,"r"))!=NULL) {  in merger_new_entry()
121 		heap[heapsize].filename = strdup(filename);  in merger_new_entry()
122 		heap[heapsize].buff = (char*) malloc(BSIZE);  in merger_new_entry()
123 		heap[heapsize].ptr = NULL;  in merger_new_entry()
124 		heap[heapsize].nextid = 0;  in merger_new_entry()
125 		merger_nextentry(heapsize);  in merger_new_entry()
128 		heap[heapsize].filename = NULL;  in merger_new_entry()
129 		heap[heapsize].buff = NULL;  in merger_new_entry()
130 		heap[heapsize].ptr = NULL;  in merger_new_entry()
131 		heap[heapsize].nextid = 0;  in merger_new_entry()
136 	heapsize = 0;  in merger_start()
143 		if (heap[heapsize].nextid==0) {  in merger_start()
146 			heapsize++;  in merger_start()
158 	while (heapsize) {  in merger_loop()
162 			while (heapsize) {  in merger_loop()
163 				heapsize--;  in merger_loop()
170 			heapsize--;  in merger_loop()
172 			heap[0] = heap[heapsize];  in merger_loop()
173 			heap[heapsize] = h;  in merger_loop()