Searched refs:have (Results 1 – 9 of 9) sorted by relevance
190 have = strm->avail_in; \201 strm->avail_in = have; \217 if (have == 0) goto inf_leave; \218 have--; \360 in = have; in zlib_inflate()453 if (copy > have) copy = have; in zlib_inflate()457 have -= copy; in zlib_inflate()481 state->have = 0; in zlib_inflate()490 while (state->have < 19) in zlib_inflate()502 state->have = 0; in zlib_inflate()[all …]
107 unsigned have; /* number of code lengths in lens[] */ member
18 * This can be run on systems which have both Altivec and vpermxor instruction.
115 /* This assumes either all CPUs have Altivec or none does */
14 to have negligible cost to permit enabling it in production
279 If you have consumers of DWARF debug info that are not ready for280 newer revisions of DWARF, you may wish to choose this or have your888 semantics of the generic MM. Platforms will have to opt in for1129 high-availability systems that have uptime guarantees and1182 This hardlockup detector is useful on systems that don't have1277 high-availability systems that have uptime guarantees and2372 have to enable STACKTRACE as well.3012 We have four test modules:3111 for how many symbols TEST_KALLSYMS_C will have, scaled up by3120 How many more unusued symbols will TEST_KALLSYSMS_C have than[all …]
29 # Old GCC versions do not have proper support for no_sanitize_address.
113 Interrupts have tighter latency requirements, and their delay should
32 memory representation that can have any combination of these quirks:
Completed in 16 milliseconds