Searched refs:largest (Results 1 - 11 of 11) sorted by relevance
/freebsd-9.3-release/contrib/llvm/lib/ExecutionEngine/JIT/ |
H A D | JITMemoryManager.cpp | 357 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()) { 480 uintptr_t largest = candidateBlock->BlockSize; local 482 // Search for the largest fre [all...] |
/freebsd-9.3-release/sys/tools/sound/ |
H A D | feeder_eq_mkfilter.awk | 114 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 D | feeder_rate_mkfilter.awk | 107 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-9.3-release/sys/boot/i386/gptboot/ |
H A D | gptldr.S | 83 mov $(64 * 1024 - 16),%di # largest boot2 range
|
/freebsd-9.3-release/sys/cddl/contrib/opensolaris/uts/common/sys/ |
H A D | cpuvar.h | 449 * 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-9.3-release/contrib/pf/pfctl/ |
H A D | pfctl_optimize.c | 645 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-9.3-release/lib/libc/regex/ |
H A D | regcomp.c | 1558 * Compute, recursively if necessary, the largest offset among multiple 1564 int largest; local 1572 largest = 0; 1578 if (try > largest) 1579 largest = try; 1619 if (try > largest) 1620 largest = try; 1622 return largest+offset; 1729 * to the beginning of the largest must pattern prefix matching
|
/freebsd-9.3-release/tools/tools/net80211/wesside/wesside/ |
H A D | wesside.c | 2396 int largest; local 2458 largest = tapfd; 2460 largest = wifd; 2575 rd = select(largest+1, &rfd, NULL, NULL, &tv);
|
/freebsd-9.3-release/contrib/gcc/config/arm/ |
H A D | ieee754-sf.S | 80 @ Compute exponent difference. Make largest exponent in r2, 90 @ If exponent difference is too large, return largest argument
|
H A D | ieee754-df.S | 104 @ Compute exponent difference. Make largest exponent in r4, 118 @ If exponent difference is too large, return largest argument
|
/freebsd-9.3-release/contrib/texinfo/info/ |
H A D | session.c | 72 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 209 milliseconds