Searched defs:have (Results 1 - 5 of 5) sorted by relevance

/ast/src/lib/libz/
H A Dinfback.c124 have = strm->avail_in; \
135 strm->avail_in = have; \
151 if (have == 0) { \
152 have = in(in_desc, &next); \
153 if (have == 0) { \
166 have--; \
251 unsigned have, left; /* available input and output */ local
274 have = next != Z_NULL ? strm->avail_in : 0;
336 if (copy > have) copy = have;
[all...]
H A Dinflate.c100 local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,
408 have = strm->avail_in; \
419 strm->avail_in = have; \
435 if (have == 0) goto inf_leave; \
436 have--; \
515 would all have to actually be part of the saved state in case NEEDBITS()
561 unsigned have, left; /* available input and output */ local
584 in = have;
683 if (copy > have) copy = have;
[all...]
H A Dinflate.h110 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
/ast/src/lib/libtk/generic/
H A DtkGrid.c1343 int constraintCount; /* Count of rows or columns that have
1538 * weights. At each pass, at least one slot boundary will have
1547 int have = 0; /* The actual amount of space that will
1556 * slot boundaries have a range of possible positions.
1580 have = layoutPtr[end].maxOffset - layoutPtr[start-1].minOffset;
1597 * entire span, would cause a slot boundary to have its possible
1609 (diff*totalWeight/weight) < (have-need)) {
1610 have = diff * totalWeight / weight + need;
1622 (int)((double) (have-need) * weight/totalWeight + 0.5);
2341 * Make sure we have
1540 int have = 0; /* The actual amount of space that will local
[all...]
/ast/src/cmd/INIT/
H A Dratz.c25 " that do not have \bpax\b(1), \btar\b(1) or \bgunzip\b(1). Only regular"
308 * This was tested only with MSC; for other MSDOS compilers you may have
470 (deflation) but other algorithms will be added later and will have the same
756 * You may have to use the same strategy for Borland C (untested).
892 * will return a usable pointer which doesn't have to be normalized.
1441 * fast adaptation but have of course the overhead of transmitting
1449 /* Buffer for distances. To simplify the code, d_buf and l_buf have
1503 * must not have side effects. _dist_code[256] and _dist_code[257] are never
1671 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
1841 used keeps track of how many table entries have bee
2780 unsigned have, left; /* available input and output */ local
[all...]

Completed in 28 milliseconds