| /src/external/gpl3/gcc/dist/libgfortran/ |
| mk-kinds-h.sh | 16 largest=""
24 largest="$k"
46 echo "#define GFC_INTEGER_LARGEST GFC_INTEGER_${largest}"
47 echo "#define GFC_UINTEGER_LARGEST GFC_UINTEGER_${largest}"
|
| /src/external/gpl3/gcc.old/dist/libgfortran/ |
| mk-kinds-h.sh | 15 largest=""
23 largest="$k"
45 echo "#define GFC_INTEGER_LARGEST GFC_INTEGER_${largest}"
46 echo "#define GFC_UINTEGER_LARGEST GFC_UINTEGER_${largest}"
|
| /src/lib/libm/arch/m68k/ |
| s_floor.S | 44 | the largest integer no larger than x
|
| /src/sys/arch/m68k/m68k/ |
| compat_13_sigreturn13.s | 54 lea -84(%sp),%sp | leave enough space for largest frame
|
| compat_16_sigreturn14.s | 54 lea -84(%sp),%sp | leave enough space for largest frame
|
| /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;
|
| huf_compress.c | 452 * Otherwise, this symbol will be the largest in the new rank so no adjustment.
463 if (rankLast[nBitsToDecrease] == 0) /* special case, reached largest symbol */
474 * We take the largest nodes from the lowest rank 0 and move them
480 * let's create one from largest rank 0 (using targetNbBits).
1382 { CHECK_V_F(largest, HIST_count_wksp (table->count, &maxSymbolValue, (const BYTE*)src, srcSize, table->wksps.hist_wksp, sizeof(table->wksps.hist_wksp)) );
1383 if (largest == srcSize) { *ostart = ((const BYTE*)src)[0]; return 1; } /* single symbol, rle */
1384 if (largest <= (srcSize >> 7)+4) return 0; /* heuristic : probably not compressible enough */
|
| /src/external/cddl/osnet/dist/uts/common/sys/ |
| cpuvar.h | 442 * Determine the smallest and largest CPU id in the set. Returns
443 * CPUSET_NOTINSET in smallest and largest when set is empty.
445 #define CPUSET_BOUNDS(set, smallest, largest) { \
446 cpuset_bounds(&(set), &(smallest), &(largest)); \
515 #define CPUSET_BOUNDS(set, smallest, largest) { \
517 largest = (uint_t)(highbit(set) - 1); \
|
| /src/usr.bin/make/unit-tests/ |
| cond-token-number.mk | 102 # the largest representable number (VAX); in particular, make does not fall
|
| /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/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/sys/arch/amiga/amiga/ |
| cc.c | 636 avail_chipmem(int largest)
643 if (largest == 0)
|
| /src/external/gpl3/gcc/dist/libgcc/config/cris/ |
| mulsi3.S | 192 ;; Check if the largest operand is still just 16 bits.
|
| umulsidi3.S | 201 ;; Check if the largest operand is still just 16 bits.
|
| /src/external/gpl3/gcc.old/dist/libgcc/config/cris/ |
| mulsi3.S | 192 ;; Check if the largest operand is still just 16 bits.
|
| umulsidi3.S | 201 ;; Check if the largest operand is still just 16 bits.
|
| /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/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/crypto/external/apache2/openssl/dist/ |
| Configure | 3517 my $largest =
3523 print " '",$_,"'"," " x ($largest - length($_))," => [ ",join(", ", map { "'$_'" } @{$target{$_}})," ],\n";
3525 print " '",$_,"'"," " x ($largest - length($_))," => '",$target{$_},"',\n";
|
| /src/crypto/external/bsd/openssl/dist/ |
| Configure | 3358 my $largest =
3364 print " '",$_,"'"," " x ($largest - length($_))," => [ ",join(", ", map { "'$_'" } @{$target{$_}})," ],\n";
3366 print " '",$_,"'"," " x ($largest - length($_))," => '",$target{$_},"',\n";
|
| /src/crypto/external/bsd/openssl.old/dist/ |
| Configure | 3388 my $largest =
3394 print " '",$_,"'"," " x ($largest - length($_))," => [ ",join(", ", map { "'$_'" } @{$target{$_}})," ],\n";
3396 print " '",$_,"'"," " x ($largest - length($_))," => '",$target{$_},"',\n";
|
| /src/external/gpl3/gcc/dist/libgcc/config/arm/ |
| ieee754-df.S | 110 @ Compute exponent difference. Make largest exponent in r4,
125 @ If exponent difference is too large, return largest argument
|
| ieee754-sf.S | 82 @ Compute exponent difference. Make largest exponent in r2,
94 @ If exponent difference is too large, return largest argument
|
| /src/external/gpl3/gcc/dist/libgcc/config/m68k/ |
| lb1sf68.S | 864 | the largest exponent in a2.
883 1: movew d4,d2 | move largest exponent to d2
981 subw d5,d6 | keep d5 (largest exponent) in d4
2729 | same, and put the largest exponent in d6. Note that we are using two
2738 bhi 5f | branch if second exponent largest
2740 subl d6,d7 | keep the largest exponent
2801 subl d6,d7 | keep the largest exponent
2855 | Now we have a in d0-d1, b in d2-d3, and the largest exponent in d6 (the
|
