| /src/dist/pf/sbin/pfctl/ |
| pfctl_optimize.c | 641 int i, largest, largest_list = -1, rule_count = 0; local
675 largest = 0;
685 DEBUG("(%d) original skipstep '%s' largest jump is %d",
688 if (skiplist->ps_count > largest)
689 largest = skiplist->ps_count;
692 if (largest == 0) {
711 largest = 1;
718 if (skiplist->ps_count > largest) {
719 largest = skiplist->ps_count;
724 if (largest <= 1)
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/nouveau/ |
| nouveau_connector.c | 63 struct drm_display_mode *mode, *largest = NULL; local
78 /* Otherwise, take the resolution with the largest width, then
94 largest = mode;
97 NV_DEBUG(drm, "native mode from largest: %dx%d@%d\n",
99 return largest ? drm_mode_duplicate(dev, largest) : NULL;
|
| /src/external/bsd/zstd/dist/lib/compress/ |
| fse_compress.c | 482 unsigned largest=0; local
498 if (proba > largestP) { largestP=proba; largest=s; }
502 if (-stillToDistribute >= (normalizedCounter[largest] >> 1)) {
507 else normalizedCounter[largest] += (short)stillToDistribute;
|
| zstd_compress_superblock.c | 320 size_t const largest = HIST_count_wksp (countWksp, &maxSymbolValue, (const BYTE*)literals, litSize, workspace, wkspSize); local
321 if (ZSTD_isError(largest)) return litSize;
|
| zstd_compress.c | 1782 /* Choose the set of cParams for a given level across all srcSizes that give the largest cctxSize */
3610 { size_t const largest = local
3614 FORWARD_IF_ERROR(largest, "HIST_count_wksp failed");
3615 if (largest == srcSize) {
3621 if (largest <= (srcSize >> 7)+4) {
3780 size_t const largest = HIST_count_wksp (countWksp, &maxSymbolValue, (const BYTE*)literals, litSize, workspace, wkspSize); local
3781 if (ZSTD_isError(largest)) return litSize;
4125 * In theory, this means the absolute largest recursion depth is 10 == log2(maxNbSeqInBlock/MIN_SEQUENCES_BLOCK_SPLITTING).
5719 * window log for compression level 1 with the largest source size.
|
| /src/lib/libc/regex/ |
| regcomp.c | 2191 * Compute, recursively if necessary, the largest offset among multiple
2197 int largest; local
2207 largest = 0;
2213 if (try > largest)
2214 largest = try;
2257 if (try > largest)
2258 largest = try;
2260 return largest+offset;
2374 * to the beginning of the largest must pattern prefix matching
|
| /src/external/bsd/zstd/dist/tests/ |
| decodecorpus.c | 448 { size_t const largest = HIST_count_wksp (count, &maxSymbolValue, (const BYTE*)src, srcSize, WKSP, sizeof(WKSP)); local
449 assert(!HIST_isError(largest));
450 if (largest == srcSize) { *ostart = ((const BYTE*)src)[0]; return 0; } /* single symbol, rle */
451 if (largest <= (srcSize >> 7)+1) return 0; /* Fast heuristic : not compressible enough */
|
| /src/external/gpl2/texinfo/dist/info/ |
| session.c | 74 For each loaded node, create a new window. Always split the largest of the
99 /* Find the largest window in WINDOWS, and make that be the active
102 WINDOW *win, *largest = NULL; local
109 largest = win;
112 if (!largest)
120 active_window = largest;
3455 /* Search NODE, looking for the largest possible match of STRING. Start the
4855 /* Largest number of characters that we can read in advance. */
|
| /src/external/gpl3/gcc.old/dist/gcc/fortran/ |
| trans-intrinsic.cc | 7027 where ULL_MAX is the largest value that a ULL_MAX can hold
7139 where ULL_MAX is the largest value that a ULL_MAX can hold
9254 tree type, cond, tmp, count, exit_label, n, max, largest; local
9296 largest = TYPE_PRECISION (sizetype) > TYPE_PRECISION (ncopies_type)
9299 fold_convert (largest, ncopies),
9300 fold_convert (largest, max));
|
| /src/external/gpl3/gcc/dist/gcc/fortran/ |
| trans-intrinsic.cc | 7049 where ULL_MAX is the largest value that a ULL_MAX can hold
7161 where ULL_MAX is the largest value that a ULL_MAX can hold
9321 tree type, cond, tmp, count, exit_label, n, max, largest; local
9363 largest = TYPE_PRECISION (sizetype) > TYPE_PRECISION (ncopies_type)
9366 fold_convert (largest, ncopies),
9367 fold_convert (largest, max));
|
