HomeSort by: relevance | last modified time | path
    Searched defs:largest (Results 1 - 6 of 6) sorted by relevancy

  /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...]
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;
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/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
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

Completed in 43 milliseconds