42 static uint32_t heapsize;  variable
53 	while (pos<heapsize) {  in merger_heap_sort_down()
56 		if (l>=heapsize) {  in merger_heap_sort_down()
60 		if (r<heapsize && heap[r].nextid < heap[l].nextid) {  in merger_heap_sort_down()
74 	uint32_t pos=heapsize-1;  in merger_heap_sort_up()
108 	if (heap[heapsize].fd) {  in merger_delete_entry()
109 		fclose(heap[heapsize].fd);  in merger_delete_entry()
111 	if (heap[heapsize].shfilename!=NULL) {  in merger_delete_entry()
112 		shp_dec(heap[heapsize].shfilename);  in merger_delete_entry()
114 	if (heap[heapsize].buff) {  in merger_delete_entry()
115 		free(heap[heapsize].buff);  in merger_delete_entry()
121 	if ((heap[heapsize].fd = fopen(filename,"r"))!=NULL) {  in merger_new_entry()
122 		heap[heapsize].shfilename = shp_new(strdup(filename),free);  in merger_new_entry()
123 		heap[heapsize].buff = malloc(BSIZE);  in merger_new_entry()
124 		heap[heapsize].ptr = NULL;  in merger_new_entry()
125 		heap[heapsize].nextid = INT64_C(-1);  in merger_new_entry()
126 		merger_nextentry(heapsize);  in merger_new_entry()
129 		heap[heapsize].shfilename = NULL;  in merger_new_entry()
130 		heap[heapsize].buff = NULL;  in merger_new_entry()
131 		heap[heapsize].ptr = NULL;  in merger_new_entry()
132 		heap[heapsize].nextid = INT64_C(-1);  in merger_new_entry()
138 	heapsize = 0;  in merger_start()
146 		if (heap[heapsize].nextid<0) {  in merger_start()
149 			heapsize++;  in merger_start()
173 	while (heapsize) {  in merger_loop()
200 			while (heapsize) {  in merger_loop()
201 				heapsize--;  in merger_loop()
209 			heapsize--;  in merger_loop()
211 			heap[0] = heap[heapsize];  in merger_loop()
212 			heap[heapsize] = h;  in merger_loop()