HomeSort by relevance Sort by last modified time
    Searched defs:SMALLEST (Results 1 - 8 of 8) sorted by null

  /external/oj-libjdwp/src/share/back/
inStream.c 35 #define SMALLEST(a, b) ((a) < (b)) ? (a) : (b)
outStream.c 36 #define SMALLEST(a, b) ((a) < (b)) ? (a) : (b)
109 jint segSize = SMALLEST(2 * stream->segment->length, MAX_SEGMENT_SIZE);
126 count = SMALLEST(size, stream->left);
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/
trees.c 424 #define SMALLEST 1
429 * Remove the smallest element from the heap and recreate the heap with
434 top = s->heap[SMALLEST]; \
435 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
436 pqdownheap(s, tree, SMALLEST); \
449 * exchanging a node with the smallest of its two sons if necessary, stopping
461 /* Set j to the smallest of the two sons: */
469 /* Exchange v with the smallest son */
629 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
668 m = s->heap[SMALLEST]; /* m = node of next least frequency */
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/
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...]
  /external/python/cpython2/Modules/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...]
  /external/u-boot/lib/zlib/
trees.c 430 #define SMALLEST 1
435 * Remove the smallest element from the heap and recreate the heap with
440 top = s->heap[SMALLEST]; \
441 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
442 pqdownheap(s, tree, SMALLEST); \
455 * exchanging a node with the smallest of its two sons if necessary, stopping
467 /* Set j to the smallest of the two sons: */
475 /* Exchange v with the smallest son */
635 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
674 m = s->heap[SMALLEST]; /* m = node of next least frequency *
    [all...]
  /external/zlib/src/
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...]
  /bionic/libc/tzcode/
localtime.c 112 #define SMALLEST(a, b) (((a) < (b)) ? (a) : (b))
    [all...]

Completed in 5350 milliseconds