Searched defs:smaller (Results 1 - 5 of 5) sorted by relevance
| /illumos-gate/usr/src/uts/common/zmod/ |
| H A D | trees.c | 445 #define smaller(tree, n, m, depth) \ macro
452 * when the heap property is re-established (each father smaller than its
465 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
468 /* Exit if v is smaller than both sons */
469 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
| /illumos-gate/usr/src/boot/lib/libz/ |
| H A D | trees.c | 443 #define smaller(tree, n, m, depth) \ macro
450 * when the heap property is re-established (each father smaller than its
463 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
466 /* Exit if v is smaller than both sons */
467 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
| /illumos-gate/usr/src/cmd/mdb/common/modules/genunix/ |
| H A D | typegraph.c | 78 * (c) It is not uncommon for structures to embed smaller structures, and
79 * to pass pointers to these smaller structures to routines that track
80 * the structures only by the smaller type. This can be thought of as
83 * of) for the smaller structures to be used as place holders in data
85 * instance of the larger structure being pointed to by the smaller
86 * structure pointer, an instance of the smaller structure is pointed to
89 * important to identify when the smaller structures are in a contiguous
92 * assume that the array of the smaller structure is actually an array of
133 * equal to the size of the next-smaller kmem cache, we know that it's not an
135 * would have been instead allocated out of the next-smaller cach
1051 int i, smaller; local
[all...] |
| /illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/ |
| H A D | zlib.c | 294 * smaller than this value. This mechanism is used only for compression
345 * - if compression is not successful for a file smaller than 64K, we can
1803 #define smaller(tree, n, m, depth) \ macro
1810 * when the heap property is re-established (each father smaller than its
1823 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
1826 /* Exit if v is smaller than both sons */
1827 if (smaller(tree, v, s->heap[j], s->depth)) break;
3817 while (++j < z) /* try smaller tables up to z bits */
4578 #define BASE 65521L /* largest prime smaller than 65536 */
|
| /illumos-gate/usr/src/uts/common/io/ppp/spppcomp/ |
| H A D | zlib.c | 453 * is strictly smaller than this value. This mechanism is used
516 * - if compression is not successful for a file smaller
2608 #define smaller(tree, n, m, depth) \ macro
2615 * when the heap property is re-established (each father smaller than its
2629 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
2632 /* Exit if v is smaller than both sons */
2633 if (smaller(tree, v, s->heap[j], s->depth)) break;
4972 * try smaller tables
6072 #define BASE 65521L /* largest prime smaller than 65536 */
|
Completed in 98 milliseconds