Home	Sort by: relevance | last modified time | path

Full Search in project(s): src xsrc Definition Symbol File Path History   | | Help

    Searched defs:most (Results 1 - 5 of 5) sorted by relevancy

/src/common/dist/zlib/examples/
enough.c	281 // we can use at most this many bit patterns, lest there not be enough 283 // no limit to the code length, this would become: most = left - 1) 284 int most = (((code_t)left << (g.max - len)) - syms) / local 289 for (int use = least; use <= most; use++) { 418 // we can use at most this many bit patterns, lest there not be enough 420 // no limit to the code length, this would become: most = left - 1) 421 int most = (((code_t)left << (g.max - len)) - syms) / local 434 for (use = least; use <= most; use++) { 532 // make sure that the calculation of most will not overflow
/src/external/gpl3/binutils/dist/zlib/examples/
enough.c	281 // we can use at most this many bit patterns, lest there not be enough 283 // no limit to the code length, this would become: most = left - 1) 284 int most = (((code_t)left << (g.max - len)) - syms) / local 289 for (int use = least; use <= most; use++) { 418 // we can use at most this many bit patterns, lest there not be enough 420 // no limit to the code length, this would become: most = left - 1) 421 int most = (((code_t)left << (g.max - len)) - syms) / local 434 for (use = least; use <= most; use++) { 532 // make sure that the calculation of most will not overflow
/src/external/gpl3/binutils.old/dist/zlib/examples/
enough.c	281 // we can use at most this many bit patterns, lest there not be enough 283 // no limit to the code length, this would become: most = left - 1) 284 int most = (((code_t)left << (g.max - len)) - syms) / local 289 for (int use = least; use <= most; use++) { 418 // we can use at most this many bit patterns, lest there not be enough 420 // no limit to the code length, this would become: most = left - 1) 421 int most = (((code_t)left << (g.max - len)) - syms) / local 434 for (use = least; use <= most; use++) { 532 // make sure that the calculation of most will not overflow
/src/external/gpl3/gdb/dist/zlib/examples/
enough.c	281 // we can use at most this many bit patterns, lest there not be enough 283 // no limit to the code length, this would become: most = left - 1) 284 int most = (((code_t)left << (g.max - len)) - syms) / local 289 for (int use = least; use <= most; use++) { 418 // we can use at most this many bit patterns, lest there not be enough 420 // no limit to the code length, this would become: most = left - 1) 421 int most = (((code_t)left << (g.max - len)) - syms) / local 434 for (use = least; use <= most; use++) { 532 // make sure that the calculation of most will not overflow
/src/external/gpl3/gdb.old/dist/zlib/examples/
enough.c	281 // we can use at most this many bit patterns, lest there not be enough 283 // no limit to the code length, this would become: most = left - 1) 284 int most = (((code_t)left << (g.max - len)) - syms) / local 289 for (int use = least; use <= most; use++) { 418 // we can use at most this many bit patterns, lest there not be enough 420 // no limit to the code length, this would become: most = left - 1) 421 int most = (((code_t)left << (g.max - len)) - syms) / local 434 for (use = least; use <= most; use++) { 532 // make sure that the calculation of most will not overflow

Completed in 34 milliseconds

Indexes created Sat Feb 28 05:31:39 UTC 2026