Searched refs:largest (Results 1 - 12 of 12) sorted by relevance

/freebsd-10.0-release/contrib/llvm/lib/ExecutionEngine/JIT/
H A DJITMemoryManager.cpp357 uintptr_t largest = candidateBlock->BlockSize; local
359 // Search for the largest free block
361 if (iter->BlockSize > largest) {
362 largest = iter->BlockSize;
368 largest = largest - sizeof(MemoryRangeHeader);
372 if (largest < ActualSize ||
373 largest <= FreeRangeHeader::getMinBlockSize()) {
476 uintptr_t largest = candidateBlock->BlockSize; local
478 // Search for the largest fre
[all...]
/freebsd-10.0-release/sys/tools/sound/
H A Dfeeder_eq_mkfilter.awk114 if (fabs(v) > fabs(largest))
115 largest = v;
351 largest = 0.000010;
464 printf("\n/*\n * smallest: %.32f\n * largest: %.32f\n */\n", \
465 smallest, largest);
H A Dfeeder_rate_mkfilter.awk107 if (fabs(v) > fabs(largest))
108 largest = v;
677 largest = 0.000010;
885 printf("\n/*\n * smallest: %.32f\n * largest: %.32f\n *\n", \
886 smallest, largest);
890 printf(" * largest interpolation multiplication: %d\n */\n", v);
/freebsd-10.0-release/sys/boot/i386/gptboot/
H A Dgptldr.S83 mov $(64 * 1024 - 16),%di # largest boot2 range
/freebsd-10.0-release/sys/cddl/contrib/opensolaris/uts/common/sys/
H A Dcpuvar.h449 * Determine the smallest and largest CPU id in the set. Returns
450 * CPUSET_NOTINSET in smallest and largest when set is empty.
452 #define CPUSET_BOUNDS(set, smallest, largest) { \
453 cpuset_bounds(&(set), &(smallest), &(largest)); \
522 #define CPUSET_BOUNDS(set, smallest, largest) { \
524 largest = (uint_t)(highbit(set) - 1); \
/freebsd-10.0-release/sbin/pfctl/
H A Dpfctl_optimize.c645 int i, largest, largest_list, rule_count = 0; local
679 largest = 0;
689 DEBUG("(%d) original skipstep '%s' largest jump is %d",
692 if (skiplist->ps_count > largest)
693 largest = skiplist->ps_count;
696 if (largest == 0) {
715 largest = 1;
722 if (skiplist->ps_count > largest) {
723 largest = skiplist->ps_count;
728 if (largest <
[all...]
/freebsd-10.0-release/lib/libc/regex/
H A Dregcomp.c1560 * Compute, recursively if necessary, the largest offset among multiple
1566 int largest; local
1574 largest = 0;
1580 if (try > largest)
1581 largest = try;
1621 if (try > largest)
1622 largest = try;
1624 return largest+offset;
1731 * to the beginning of the largest must pattern prefix matching
/freebsd-10.0-release/tools/tools/net80211/wesside/wesside/
H A Dwesside.c2396 int largest; local
2458 largest = tapfd;
2460 largest = wifd;
2575 rd = select(largest+1, &rfd, NULL, NULL, &tv);
/freebsd-10.0-release/sys/dev/cxgbe/
H A Dt4_sge.c4133 * smallest size that is large enough to hold bufsize or pick the largest size
4139 int i, largest, best, delta, start; local
4153 largest = start;
4165 if (fl_buf_size > FL_BUF_SIZE(sc, largest))
4166 largest = i;
4176 fl->tag_idx = largest; /* No buf large enough for bufsize */
/freebsd-10.0-release/contrib/gcc/config/arm/
H A Dieee754-sf.S80 @ Compute exponent difference. Make largest exponent in r2,
90 @ If exponent difference is too large, return largest argument
H A Dieee754-df.S104 @ Compute exponent difference. Make largest exponent in r4,
118 @ If exponent difference is too large, return largest argument
/freebsd-10.0-release/contrib/texinfo/info/
H A Dsession.c72 For each loaded node, create a new window. Always split the largest of the
97 /* Find the largest window in WINDOWS, and make that be the active
100 WINDOW *win, *largest = NULL; local
107 largest = win;
110 if (!largest)
118 active_window = largest;
3453 /* Search NODE, looking for the largest possible match of STRING. Start the

Completed in 156 milliseconds