HomeSort by: relevance | last modified time | path
    Searched refs:heap_parent (Results 1 - 4 of 4) sorted by relevancy

  /src/external/mpl/bind/dist/lib/isc/
heap.c 37 * Note: to make heap_parent and heap_left easy to compute, the first
42 #define heap_parent(i) ((i) >> 1) macro
53 * holds true: for every element i > 1, heap_parent(i) has a priority
58 !heap->compare(heap->array[(i)], heap->array[heap_parent(i)]))
146 for (p = heap_parent(i); i > 1 && heap->compare(elt, heap->array[p]);
147 i = p, p = heap_parent(i))
  /src/external/mpl/dhcp/bind/dist/lib/isc/
heap.c 36 * Note: to make heap_parent and heap_left easy to compute, the first
41 #define heap_parent(i) ((i) >> 1) macro
52 * holds true: for every element i > 1, heap_parent(i) has a priority
57 !heap->compare(heap->array[(i)], heap->array[heap_parent(i)]))
148 for (p = heap_parent(i); i > 1 && heap->compare(elt, heap->array[p]);
149 i = p, p = heap_parent(i))
  /src/external/bsd/libbind/dist/isc/
heap.c 45 * Note: to make heap_parent and heap_left easy to compute, the first
49 #define heap_parent(i) ((i) >> 1) macro
111 for ( p = heap_parent(i);
113 i = p, p = heap_parent(i) ) {
  /src/external/cddl/osnet/dev/cyclic/
cyclic.c 382 cyc_index_t heap_parent, heap_current = ndx; local
390 heap_parent = CYC_HEAP_PARENT(heap_current);
394 parent = heap[heap_parent];
406 heap[heap_parent] = current;
412 if (heap_parent == 0)
415 heap_current = heap_parent;
416 heap_parent = CYC_HEAP_PARENT(heap_current);

Completed in 25 milliseconds