HomeSort by relevance Sort by last modified time
    Searched refs:heap_index (Results 1 - 3 of 3) sorted by null

  /hardware/intel/img/psb_video/src/
object_heap.c 53 new_heap_index = (object_base_p *) realloc(heap->heap_index, new_heap_size * sizeof(object_base_p));
57 heap->heap_index = new_heap_index;
61 heap->heap_index[i] = obj;
74 if (heap->heap_index[i]) {
75 free(heap->heap_index[i]);
78 /* heap->heap_index is left as is */
95 heap->heap_index = NULL;
114 obj = heap->heap_index[heap->next_free];
131 obj = heap->heap_index[id];
161 obj = heap->heap_index[i]
    [all...]
object_heap.h 46 object_base_p *heap_index; member in struct:object_heap_s
  /external/fio/lib/
prio_tree.c 31 * heap_index]. We assume that always radix_index <= heap_index. McCreight's PST
34 * overcome by using the size, i.e., heap_index - radix_index, as part of the
35 * index, so we index the tree using [(radix_index,size), heap_index].
62 * Maximum heap_index that can be stored in a PST with index_bits bits
70 * Extend a priority search tree so that it can store a node with heap_index
161 * required to represent the maximum heap_index. In the worst case, the algo
164 * If a prior node with same radix_index and heap_index is already found in
172 unsigned long radix_index, heap_index; local
176 get_index(node, &radix_index, &heap_index);
    [all...]

Completed in 70 milliseconds