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

  /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/
RegisterValue.h 40 SMALLEST = ULP, // The minimum subnormal number
  /src/common/dist/zlib/
trees.c 480 #define SMALLEST 1
485 * Remove the smallest element from the heap and recreate the heap with
490 top = s->heap[SMALLEST]; \
491 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
492 pqdownheap(s, tree, SMALLEST); \
505 * exchanging a node with the smallest of its two sons if necessary, stopping
513 /* Set j to the smallest of the two sons: */
521 /* Exchange v with the smallest son */
636 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n + 1].
675 m = s->heap[SMALLEST]; /* m = node of next least frequency *
    [all...]
  /src/external/cddl/osnet/dist/uts/common/zmod/
trees.c 426 #define SMALLEST 1
431 * Remove the smallest element from the heap and recreate the heap with
436 top = s->heap[SMALLEST]; \
437 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
438 pqdownheap(s, tree, SMALLEST); \
451 * exchanging a node with the smallest of its two sons if necessary, stopping
463 /* Set j to the smallest of the two sons: */
471 /* Exchange v with the smallest son */
631 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
670 m = s->heap[SMALLEST]; /* m = node of next least frequency *
    [all...]
  /src/external/gpl3/binutils/dist/zlib/
trees.c 478 #define SMALLEST 1
483 * Remove the smallest element from the heap and recreate the heap with
488 top = s->heap[SMALLEST]; \
489 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
490 pqdownheap(s, tree, SMALLEST); \
503 * exchanging a node with the smallest of its two sons if necessary, stopping
511 /* Set j to the smallest of the two sons: */
519 /* Exchange v with the smallest son */
634 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n + 1].
673 m = s->heap[SMALLEST]; /* m = node of next least frequency *
    [all...]
  /src/external/gpl3/binutils.old/dist/zlib/
trees.c 422 #define SMALLEST 1
427 * Remove the smallest element from the heap and recreate the heap with
432 top = s->heap[SMALLEST]; \
433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
434 pqdownheap(s, tree, SMALLEST); \
447 * exchanging a node with the smallest of its two sons if necessary, stopping
459 /* Set j to the smallest of the two sons: */
467 /* Exchange v with the smallest son */
627 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
666 m = s->heap[SMALLEST]; /* m = node of next least frequency *
    [all...]
  /src/external/gpl3/gdb/dist/zlib/
trees.c 422 #define SMALLEST 1
427 * Remove the smallest element from the heap and recreate the heap with
432 top = s->heap[SMALLEST]; \
433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
434 pqdownheap(s, tree, SMALLEST); \
447 * exchanging a node with the smallest of its two sons if necessary, stopping
459 /* Set j to the smallest of the two sons: */
467 /* Exchange v with the smallest son */
627 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
666 m = s->heap[SMALLEST]; /* m = node of next least frequency *
    [all...]
  /src/external/gpl3/gdb.old/dist/zlib/
trees.c 422 #define SMALLEST 1
427 * Remove the smallest element from the heap and recreate the heap with
432 top = s->heap[SMALLEST]; \
433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
434 pqdownheap(s, tree, SMALLEST); \
447 * exchanging a node with the smallest of its two sons if necessary, stopping
459 /* Set j to the smallest of the two sons: */
467 /* Exchange v with the smallest son */
627 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
666 m = s->heap[SMALLEST]; /* m = node of next least frequency *
    [all...]
  /src/sys/net/
zlib.c 2522 #define SMALLEST 1
2527 * Remove the smallest element from the heap and recreate the heap with
2532 top = s->heap[SMALLEST]; \
2533 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
2534 pqdownheap(s, tree, SMALLEST); \
2547 * exchanging a node with the smallest of its two sons if necessary, stopping
2558 /* Set j to the smallest of the two sons: */
2566 /* Exchange v with the smallest son */
2723 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
2762 m = s->heap[SMALLEST]; /* m = node of next least frequency *
    [all...]

Completed in 33 milliseconds