heap              203 lib/zlib/deflate.h     int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */
heap              436 lib/zlib/trees.c     top = s->heap[SMALLEST]; \
heap              437 lib/zlib/trees.c     s->heap[SMALLEST] = s->heap[s->heap_len--]; \
heap              460 lib/zlib/trees.c     int v = s->heap[k];
heap              465 lib/zlib/trees.c             smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
heap              469 lib/zlib/trees.c         if (smaller(tree, v, s->heap[j], s->depth)) break;
heap              472 lib/zlib/trees.c         s->heap[k] = s->heap[j];  k = j;
heap              477 lib/zlib/trees.c     s->heap[k] = v;
heap              512 lib/zlib/trees.c     tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
heap              515 lib/zlib/trees.c         n = s->heap[h];
heap              556 lib/zlib/trees.c             m = s->heap[--h];
heap              638 lib/zlib/trees.c             s->heap[++(s->heap_len)] = max_code = n;
heap              651 lib/zlib/trees.c         node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
heap              670 lib/zlib/trees.c         m = s->heap[SMALLEST]; /* m = node of next least frequency */
heap              672 lib/zlib/trees.c         s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
heap              673 lib/zlib/trees.c         s->heap[--(s->heap_max)] = m;
heap              687 lib/zlib/trees.c         s->heap[SMALLEST] = node++;
heap              692 lib/zlib/trees.c     s->heap[--(s->heap_max)] = s->heap[SMALLEST];
heap               69 source4/ntvfs/ipc/ipc_rap.c static void rap_heap_save(struct rap_string_heap *heap,
heap               72 source4/ntvfs/ipc/ipc_rap.c 	save->offset = heap->offset;
heap               73 source4/ntvfs/ipc/ipc_rap.c 	save->num_strings = heap->num_strings;
heap               76 source4/ntvfs/ipc/ipc_rap.c static void rap_heap_restore(struct rap_string_heap *heap,
heap               79 source4/ntvfs/ipc/ipc_rap.c 	heap->offset = save->offset;
heap               80 source4/ntvfs/ipc/ipc_rap.c 	heap->num_strings = save->num_strings;
heap               98 source4/ntvfs/ipc/ipc_rap.c 	struct rap_string_heap *heap;
heap              133 source4/ntvfs/ipc/ipc_rap.c 	call->heap = talloc(mem_ctx, struct rap_string_heap);
heap              135 source4/ntvfs/ipc/ipc_rap.c 	if (call->heap == NULL)
heap              138 source4/ntvfs/ipc/ipc_rap.c 	ZERO_STRUCTP(call->heap);
heap              140 source4/ntvfs/ipc/ipc_rap.c 	call->heap->mem_ctx = mem_ctx;
heap              208 source4/ntvfs/ipc/ipc_rap.c 	call->heap->offset = *bufsize;
heap              222 source4/ntvfs/ipc/ipc_rap.c 				struct rap_string_heap *heap,
heap              232 source4/ntvfs/ipc/ipc_rap.c 	if (heap->offset < space)
heap              235 source4/ntvfs/ipc/ipc_rap.c 	heap->offset -= space;
heap              237 source4/ntvfs/ipc/ipc_rap.c 	NDR_RETURN(ndr_push_uint16(data_push, NDR_SCALARS, heap->offset));
heap              240 source4/ntvfs/ipc/ipc_rap.c 	heap->strings = talloc_realloc(heap->mem_ctx,
heap              241 source4/ntvfs/ipc/ipc_rap.c 					 heap->strings,
heap              243 source4/ntvfs/ipc/ipc_rap.c 					 heap->num_strings + 1);
heap              245 source4/ntvfs/ipc/ipc_rap.c 	if (heap->strings == NULL)
heap              248 source4/ntvfs/ipc/ipc_rap.c 	heap->strings[heap->num_strings] = str;
heap              249 source4/ntvfs/ipc/ipc_rap.c 	heap->num_strings += 1;
heap              289 source4/ntvfs/ipc/ipc_rap.c 		rap_heap_save(call->heap, &heap_save);
heap              307 source4/ntvfs/ipc/ipc_rap.c 					       call->heap,
heap              313 source4/ntvfs/ipc/ipc_rap.c 		if (call->ndr_push_data->offset > call->heap->offset) {
heap              318 source4/ntvfs/ipc/ipc_rap.c 			rap_heap_restore(call->heap, &heap_save);
heap              371 source4/ntvfs/ipc/ipc_rap.c 		rap_heap_save(call->heap, &heap_save);
heap              391 source4/ntvfs/ipc/ipc_rap.c 					       call->heap,
heap              397 source4/ntvfs/ipc/ipc_rap.c 		if (call->ndr_push_data->offset > call->heap->offset) {
heap              402 source4/ntvfs/ipc/ipc_rap.c 			rap_heap_restore(call->heap, &heap_save);
heap              494 source4/ntvfs/ipc/ipc_rap.c 				  NDR_SCALARS, call->heap->offset - result_data.length));
heap              501 source4/ntvfs/ipc/ipc_rap.c 	for (i=call->heap->num_strings-1; i>=0; i--)
heap              503 source4/ntvfs/ipc/ipc_rap.c 					  call->heap->strings[i]));