HomeSort by: relevance | last modified time | path
    Searched refs:upperBound (Results 1 - 19 of 19) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
MemoryLocation.h 91 // FIXME: Migrate all users to construct via either `precise` or `upperBound`,
107 static LocationSize upperBound(uint64_t Value) {
115 static LocationSize upperBound(TypeSize Value) {
118 return upperBound(Value.getFixedSize());
152 return upperBound(std::max(getValue(), Other.getValue()));
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
MemoryLocation.cpp 34 OS << "upperBound(" << getValue() << ')';
186 LocationSize::upperBound(DL.getTypeStoreSize(II->getType())),
193 LocationSize::upperBound(
266 Arg, LocationSize::upperBound(LenCI->getZExtValue()), AATags);
  /src/sys/external/bsd/compiler_rt/dist/lib/ubsan/
ubsan_diag.cc 227 static Range *upperBound(MemoryLocation Loc, Range *Ranges,
283 Range *InRange = upperBound(Min, Ranges, NumRanges);
287 InRange = upperBound(P, Ranges, NumRanges);
307 InRange = upperBound(P, Ranges, NumRanges);
  /src/external/gpl3/gcc.old/dist/libsanitizer/ubsan/
ubsan_diag.cpp 234 static Range *upperBound(MemoryLocation Loc, Range *Ranges,
290 Range *InRange = upperBound(Min, Ranges, NumRanges);
294 InRange = upperBound(P, Ranges, NumRanges);
314 InRange = upperBound(P, Ranges, NumRanges);
  /src/external/gpl3/gcc/dist/libsanitizer/ubsan/
ubsan_diag.cpp 240 static Range *upperBound(MemoryLocation Loc, Range *Ranges,
296 Range *InRange = upperBound(Min, Ranges, NumRanges);
300 InRange = upperBound(P, Ranges, NumRanges);
320 InRange = upperBound(P, Ranges, NumRanges);
  /src/external/bsd/zstd/dist/lib/compress/
zstd_compress.c 434 bounds.upperBound = ZSTD_maxCLevel();
439 bounds.upperBound = ZSTD_WINDOWLOG_MAX;
444 bounds.upperBound = ZSTD_HASHLOG_MAX;
449 bounds.upperBound = ZSTD_CHAINLOG_MAX;
454 bounds.upperBound = ZSTD_SEARCHLOG_MAX;
459 bounds.upperBound = ZSTD_MINMATCH_MAX;
464 bounds.upperBound = ZSTD_TARGETLENGTH_MAX;
469 bounds.upperBound = ZSTD_STRATEGY_MAX;
474 bounds.upperBound = 1;
479 bounds.upperBound = 1
    [all...]
zstd_compress_internal.h 556 if (value > bounds.upperBound) return 0;
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/container/
package.d 371 $(TDNW `c.upperBound(v)`)
833 Range upperBound(KeyType k)
rbtree.d 41 assert(rbt.upperBound(3).equal([4, 5]));
1673 Range upperBound(Elem e)
1679 ConstRange upperBound(Elem e) const
1685 ImmutableRange upperBound(Elem e) immutable
1743 auto ru = ts.upperBound(3);
2180 static assert(is(typeof(rt1.upperBound(3).front) == const(int)));
2182 assert(rt1.upperBound(3).equal([4, 5]));
2196 static assert(is(typeof(rt1.upperBound(3).front) == immutable(int)));
2198 assert(rt1.upperBound(2).equal([3, 4, 5]));
  /src/external/bsd/zstd/dist/lib/decompress/
zstd_decompress.c 1806 size_t const max = (size_t)1 << bounds.upperBound;
1825 bounds.upperBound = ZSTD_WINDOWLOG_MAX;
1829 bounds.upperBound = (int)ZSTD_f_zstd1_magicless;
1834 bounds.upperBound = (int)ZSTD_bm_stable;
1838 bounds.upperBound = (int)ZSTD_d_ignoreChecksum;
1842 bounds.upperBound = (int)ZSTD_rmd_refMultipleDDicts;
1846 bounds.upperBound = 1;
1850 bounds.upperBound = ZSTD_BLOCKSIZE_MAX;
1867 if (value > bounds.upperBound) return 0;
  /src/external/bsd/libarchive/dist/libarchive/
archive_write_add_filter_zstd.c 335 if ((int)long_distance < bounds.lowerBound || (int)long_distance > bounds.upperBound)
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/range/
package.d 10647 upperBound), and `equalRange` of $(LREF SortedRange) below.
10708 auto p1 = a.upperBound!(SearchPolicy.binarySearch)(3);
11041 // upperBound
11054 auto upperBound(SearchPolicy sp = SearchPolicy.binarySearch, V)(V value)
11080 auto p = a.upperBound(3);
11130 .upperBound!(SearchPolicy.gallop)(value).length;
11152 upperBound(value)). The call is faster than computing all three
11189 .upperBound!(SearchPolicy.gallop)(value).length;
11373 assert(equal(r.upperBound!(pol)(42), [52, 64]));
11374 assert(equal(r.upperBound!(pol)(41), [42, 52, 64]))
    [all...]
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
parallelism.d 2636 E reduceOnRange(R range, size_t lowerBound, size_t upperBound)
2645 immutable subSize = (upperBound - lowerBound) / nILP;
2660 foreach (i; lowerBound .. upperBound)
2698 foreach (i; nILP * subSize + lowerBound .. upperBound)
  /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ProgramState.h 194 assumeInBound(DefinedOrUnknownSVal idx, DefinedOrUnknownSVal upperBound,
  /src/external/bsd/zstd/dist/lib/
zstd.h 524 int upperBound;
  /src/external/bsd/zstd/dist/programs/
zstdcli.c 1575 assert(ZSTD_NB_STRATEGIES == strategyBounds.upperBound);
  /src/external/apache2/llvm/dist/llvm/lib/AsmParser/
LLParser.cpp 4741 /// ::= !DISubrange(lowerBound: !node1, upperBound: !node2, stride: !node3)
4746 OPTIONAL(upperBound, MDSignedOrMDField, ); \
4753 Metadata *UpperBound = nullptr;
4767 UpperBound = convToMetadata(upperBound);
4771 (Context, Count, LowerBound, UpperBound, Stride));
4777 /// ::= !DIGenericSubrange(lowerBound: !node1, upperBound: !node2, stride:
4783 OPTIONAL(upperBound, MDSignedOrMDField, ); \
4800 Metadata *UpperBound = ConvToMetadata(upperBound);
    [all...]
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
sorting.d 130 auto ub = assumeSorted!less(sortedSoFar).upperBound(rhs[i]);
  /src/external/bsd/zstd/dist/tests/
fuzzer.c 3567 value2 = (value1 != bounds.lowerBound) ? bounds.lowerBound : bounds.upperBound;

Completed in 92 milliseconds