Searched refs:heap_len (Results 1 - 14 of 14) sorted by relevance

/macosx-10.9.5/xar-202/xar/lib/
H A Darchive.h75 off_t heap_len; /* current length of the heap */ member in struct:__xar_t
H A Dio.c301 XAR(x)->heap_len += writesize;
333 XAR(x)->heap_len -= writesize;
355 XAR(x)->heap_len -= writesize;
569 XAR(xdest)->heap_len += off;
H A Darchive.c242 XAR(ret)->heap_len += 20;
696 if( (XAR(x)->heap_len - rbytes) < rsize )
697 rsize = XAR(x)->heap_len - rbytes;
721 if( rbytes >= XAR(x)->heap_len )
H A Dsignature.c84 XAR(x)->heap_len += length;
/macosx-10.9.5/rsync-42/rsync/zlib/
H A Dtrees.c432 * one less element. Updates heap and heap_len.
437 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
462 while (j <= s->heap_len) {
464 if (j < s->heap_len &&
634 s->heap_len = 0, s->heap_max = HEAP_SIZE;
638 s->heap[++(s->heap_len)] = max_code = n;
650 while (s->heap_len < 2) {
651 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
659 /* The elements heap[heap_len/2+1 .. heap_len] ar
[all...]
H A Ddeflate.h204 int heap_len; /* number of elements in the heap */ member in struct:internal_state
/macosx-10.9.5/sudo-72/src/zlib/
H A Dtrees.c430 * one less element. Updates heap and heap_len.
435 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
460 while (j <= s->heap_len) {
462 if (j < s->heap_len &&
632 s->heap_len = 0, s->heap_max = HEAP_SIZE;
636 s->heap[++(s->heap_len)] = max_code = n;
648 while (s->heap_len < 2) {
649 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
657 /* The elements heap[heap_len/2+1 .. heap_len] ar
[all...]
H A Ddeflate.h207 int heap_len; /* number of elements in the heap */ member in struct:internal_state
/macosx-10.9.5/xnu-2422.115.4/libkern/zlib/
H A Dtrees.c459 * one less element. Updates heap and heap_len.
464 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
489 while (j <= s->heap_len) {
491 if (j < s->heap_len &&
661 s->heap_len = 0, s->heap_max = HEAP_SIZE;
665 s->heap[++(s->heap_len)] = max_code = n;
677 while (s->heap_len < 2) {
678 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
686 /* The elements heap[heap_len/2+1 .. heap_len] ar
[all...]
H A Ddeflate.h231 int heap_len; /* number of elements in the heap */ member in struct:internal_state
/macosx-10.9.5/zlib-53/zlib/
H A Dtrees.c436 * one less element. Updates heap and heap_len.
441 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
466 while (j <= s->heap_len) {
468 if (j < s->heap_len &&
638 s->heap_len = 0, s->heap_max = HEAP_SIZE;
642 s->heap[++(s->heap_len)] = max_code = n;
654 while (s->heap_len < 2) {
655 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
663 /* The elements heap[heap_len/2+1 .. heap_len] ar
[all...]
H A Ddeflate.h204 int heap_len; /* number of elements in the heap */ member in struct:internal_state
/macosx-10.9.5/ppp-727.90.1/Helpers/pppdump/
H A Dzlib.c347 int heap_len; /* number of elements in the heap */ member in struct:deflate_state
1812 * one less element. Updates heap and heap_len.
1817 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
1842 while (j <= s->heap_len) {
1844 if (j < s->heap_len &&
2014 s->heap_len = 0, s->heap_max = HEAP_SIZE;
2018 s->heap[++(s->heap_len)] = max_code = n;
2030 while (s->heap_len < 2) {
2031 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
2039 /* The elements heap[heap_len/
[all...]
/macosx-10.9.5/ksh-20/ksh/src/cmd/INIT/
H A Dratz.c1409 int heap_len; /* number of elements in the heap */ member in struct:internal_state

Completed in 523 milliseconds