| /NextBSD/contrib/compiler-rt/lib/ubsan/ |
| HD | ubsan_diag.cc | 237 MemoryLocation Min = subtractNoOverflow(Loc, MinBytesNearLoc); in renderMemorySnippet() local 239 MemoryLocation OrigMin = Min; in renderMemorySnippet() 241 Min = __sanitizer::Min(Ranges[I].getStart().getMemoryLocation(), Min); in renderMemorySnippet() 247 if (Max - Min > BytesToShow) in renderMemorySnippet() 248 Min = __sanitizer::Min(Max - BytesToShow, OrigMin); in renderMemorySnippet() 249 Max = addNoOverflow(Min, BytesToShow); in renderMemorySnippet() 251 if (!IsAccessibleMemoryRange(Min, Max - Min)) { in renderMemorySnippet() 257 for (uptr P = Min; P != Max; ++P) { in renderMemorySnippet() 265 Range *InRange = upperBound(Min, Ranges, NumRanges); in renderMemorySnippet() 266 for (uptr P = Min; P != Max; ++P) { in renderMemorySnippet() [all …]
|
| /NextBSD/contrib/llvm/include/llvm/CodeGen/PBQP/ |
| HD | ReductionRules.h | 49 PBQPNum Min = ECosts[0][j] + XCosts[0]; in applyR1() local 52 if (C < Min) in applyR1() 53 Min = C; in applyR1() 55 YCosts[j] += Min; in applyR1() 59 PBQPNum Min = ECosts[i][0] + XCosts[0]; in applyR1() local 62 if (C < Min) in applyR1() 63 Min = C; in applyR1() 65 YCosts[i] += Min; in applyR1() 111 PBQPNum Min = (*YXECosts)[i][0] + (*ZXECosts)[j][0] + XCosts[0]; in applyR2() local 114 if (C < Min) { in applyR2() [all …]
|
| /NextBSD/contrib/ofed/management/opensm/ |
| HD | autogen.sh | 11 echo Min autoconf version is 2.57 14 echo Min autoconf version is 2.57 24 echo Min automake version is 1.6.3 40 echo Min libtool version is 1.4.2
|
| /NextBSD/contrib/llvm/include/llvm/Transforms/IPO/ |
| HD | LowerBitSets.h | 64 uint64_t Min, Max; member 66 BitSetBuilder() : Min(std::numeric_limits<uint64_t>::max()), Max(0) {} in BitSetBuilder() 69 if (Min > Offset) in addOffset() 70 Min = Offset; in addOffset()
|
| /NextBSD/contrib/llvm/tools/clang/include/clang/Frontend/ |
| HD | VerifyDiagnosticConsumer.h | 152 unsigned Min, unsigned Max); 161 unsigned Min, Max; variable 175 bool MatchAnyLine, StringRef Text, unsigned Min, unsigned Max) in Directive() argument 177 Text(Text), Min(Min), Max(Max), MatchAnyLine(MatchAnyLine) { in Directive()
|
| /NextBSD/contrib/llvm/tools/clang/lib/Frontend/ |
| HD | VerifyDiagnosticConsumer.cpp | 164 bool MatchAnyLine, StringRef Text, unsigned Min, in StandardDirective() argument 166 : Directive(DirectiveLoc, DiagnosticLoc, MatchAnyLine, Text, Min, Max) { } in StandardDirective() 183 bool MatchAnyLine, StringRef Text, unsigned Min, unsigned Max, in RegexDirective() argument 185 : Directive(DirectiveLoc, DiagnosticLoc, MatchAnyLine, Text, Min, Max), in RegexDirective() 434 unsigned Min = 1; in ParseDirective() local 436 if (PH.Next(Min)) { in ParseDirective() 445 if (!PH.Next(Max) || Max < Min) { in ParseDirective() 452 Max = Min; in ParseDirective() 504 RegexKind, Pos, ExpectedLoc, MatchAnyLine, Text, Min, Max); in ParseDirective() 721 if (i >= D.Min) break; in CheckLists() [all …]
|
| /NextBSD/contrib/llvm/lib/Analysis/IPA/ |
| HD | GlobalsModRef.cpp | 131 ModRefBehavior Min = UnknownModRefBehavior; in getModRefBehavior() local 135 Min = DoesNotAccessMemory; in getModRefBehavior() 137 Min = OnlyReadsMemory; in getModRefBehavior() 140 return ModRefBehavior(AliasAnalysis::getModRefBehavior(F) & Min); in getModRefBehavior() 147 ModRefBehavior Min = UnknownModRefBehavior; in getModRefBehavior() local 152 Min = DoesNotAccessMemory; in getModRefBehavior() 154 Min = OnlyReadsMemory; in getModRefBehavior() 157 return ModRefBehavior(AliasAnalysis::getModRefBehavior(CS) & Min); in getModRefBehavior()
|
| /NextBSD/contrib/llvm/tools/clang/include/clang/Basic/ |
| HD | TargetInfo.h | 556 int Min; member 566 ImmRange.Min = ImmRange.Max = 0; in ConstraintInfo() 594 int getImmConstantMin() const { return ImmRange.Min; } in getImmConstantMin() 602 void setRequiresImmediate(int Min, int Max) { in setRequiresImmediate() 604 ImmRange.Min = Min; in setRequiresImmediate()
|
| /NextBSD/contrib/compiler-rt/lib/asan/ |
| HD | asan_debugging.cc | 42 Min(descr->name_size, vars[i].name_len)); in GetInfoForStackVar() 101 size = Min(size, Min(stack.size, kStackTraceMax)); in AsanGetStack()
|
| HD | asan_poisoning.cc | 127 *beg.chunk = Min(value, beg.offset); in __asan_poison_memory_region() 140 *beg.chunk = Min(beg.value, beg.offset); in __asan_poison_memory_region() 348 uptr a = RoundDownTo(Min(old_mid, new_mid), granularity); in __sanitizer_annotate_contiguous_container() 391 uptr r1_end = Min(end + kMaxRangeToCheck, mid); in __sanitizer_verify_contiguous_container() 393 uptr r2_end = Min(end, mid + kMaxRangeToCheck); in __sanitizer_verify_contiguous_container()
|
| HD | asan_interceptors.cc | 392 ASAN_READ_RANGE(ctx, s1, Min(i + 1, size)); in INTERCEPTOR() 393 ASAN_READ_RANGE(ctx, s2, Min(i + 1, size)); in INTERCEPTOR() 546 uptr copy_length = Min(size, from_length + 1); in INTERCEPTOR() 630 uptr from_size = Min(size, MaybeRealStrnlen(from, size) + 1); in INTERCEPTOR() 645 ASAN_READ_RANGE(ctx, s, Min(length + 1, maxlen)); in INTERCEPTOR()
|
| /NextBSD/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
| HD | RangeConstraintManager.cpp | 470 llvm::APSInt Min = AdjustmentType.getMinValue(); in assumeSymLT() local 471 if (ComparisonVal == Min) in assumeSymLT() 474 llvm::APSInt Lower = Min-Adjustment; in assumeSymLT() 528 llvm::APSInt Min = AdjustmentType.getMinValue(); in assumeSymGE() local 529 if (ComparisonVal == Min) in assumeSymGE() 561 llvm::APSInt Min = AdjustmentType.getMinValue(); in assumeSymLE() local 562 llvm::APSInt Lower = Min-Adjustment; in assumeSymLE()
|
| /NextBSD/contrib/llvm/lib/Analysis/ |
| HD | BlockFrequencyInfoImpl.cpp | 430 const Scaled64 &Min, const Scaled64 &Max) { in convertFloatingToInteger() argument 438 const unsigned SpreadBits = (Max / Min).lg(); in convertFloatingToInteger() 443 ScalingFactor = Min.inverse(); in convertFloatingToInteger() 453 DEBUG(dbgs() << "float-to-int: min = " << Min << ", max = " << Max in convertFloatingToInteger() 502 auto Min = Scaled64::getLargest(); in finalizeMetrics() local 506 Min = std::min(Min, Freqs[Index].Scaled); in finalizeMetrics() 511 convertFloatingToInteger(*this, Min, Max); in finalizeMetrics()
|
| HD | BasicAliasAnalysis.cpp | 670 ModRefBehavior Min = UnknownModRefBehavior; in getModRefBehavior() local 675 Min = OnlyReadsMemory; in getModRefBehavior() 678 Min = ModRefBehavior(Min & OnlyAccessesArgumentPointees); in getModRefBehavior() 681 return ModRefBehavior(AliasAnalysis::getModRefBehavior(CS) & Min); in getModRefBehavior() 699 ModRefBehavior Min = UnknownModRefBehavior; in getModRefBehavior() local 703 Min = OnlyReadsMemory; in getModRefBehavior() 706 Min = ModRefBehavior(Min & OnlyAccessesArgumentPointees); in getModRefBehavior() 711 Min = OnlyAccessesArgumentPointees; in getModRefBehavior() 714 return ModRefBehavior(AliasAnalysis::getModRefBehavior(F) & Min); in getModRefBehavior()
|
| HD | AliasAnalysis.cpp | 239 ModRefBehavior Min = UnknownModRefBehavior; in getModRefBehavior() local 244 Min = getModRefBehavior(F); in getModRefBehavior() 247 if (!AA) return Min; in getModRefBehavior() 251 return ModRefBehavior(AA->getModRefBehavior(CS) & Min); in getModRefBehavior()
|
| HD | TypeBasedAliasAnalysis.cpp | 499 ModRefBehavior Min = UnknownModRefBehavior; in getModRefBehavior() local 506 Min = OnlyReadsMemory; in getModRefBehavior() 508 return ModRefBehavior(AliasAnalysis::getModRefBehavior(CS) & Min); in getModRefBehavior()
|
| /NextBSD/usr.bin/ministat/ |
| HD | README | 22 N Min Max Median Avg Stddev 40 N Min Max Median Avg Stddev
|
| HD | ministat.c | 172 Min(struct dataset *ds) in Min() function 227 ds->n, Min(ds), Max(ds), Median(ds), Avg(ds), Stddev(ds)); in Vitals() 311 AdjPlot(Min(ds)); in DimPlot()
|
| /NextBSD/contrib/llvm/tools/clang/lib/Sema/ |
| HD | JumpDiagnostics.cpp | 650 unsigned Min = TargetScope; in VerifyIndirectJumps() local 652 Reachable.set(Min); in VerifyIndirectJumps() 655 if (Min == 0) break; in VerifyIndirectJumps() 658 if (Scopes[Min].InDiag) break; in VerifyIndirectJumps() 660 Min = Scopes[Min].ParentScope; in VerifyIndirectJumps() 687 if (Scope == 0 || Scope < Min) break; in VerifyIndirectJumps()
|
| /NextBSD/contrib/ofed/management/opensm/doc/ |
| HD | current-routing.txt | 6 1. Min Hop Algorithm - based on the minimum hops to each node where the 25 5. DOR Unicast routing algorithm - based on the Min Hop algorithm, but 97 Min Hop Algorithm 100 The Min Hop algorithm is invoked by default if no routing algorithm is 103 The Min Hop algorithm is divided into two stages: computation of 141 specify a guid list file, OpenSM defaults back to the Min Hop 149 3. Min Hop Table setting - after ranking is done, a BFS algorithm is run from 329 The Dimension Order Routing algorithm is based on the Min Hop
|
| /NextBSD/contrib/llvm/include/llvm/ADT/ |
| HD | SCCIterator.h | 55 StackElement(NodeType *Node, const ChildItTy &Child, unsigned Min) in StackElement() 56 : Node(Node), NextChild(Child), MinVisited(Min) {} in StackElement()
|
| HD | Triple.h | 285 unsigned Maj, Min, Micro; in getOSMajorVersion() local 286 getOSVersion(Maj, Min, Micro); in getOSMajorVersion()
|
| /NextBSD/contrib/llvm/lib/Transforms/IPO/ |
| HD | LowerBitSets.cpp | 94 if (Min > Max) in build() 95 Min = 0; in build() 104 Offset -= Min; in build() 109 BSI.ByteOffset = Min; in build() 117 BSI.BitSize = ((Max - Min) >> BSI.AlignLog2) + 1; in build()
|
| /NextBSD/contrib/compiler-rt/lib/sanitizer_common/ |
| HD | sanitizer_procmaps_freebsd.cc | 77 Min(filename_size, (uptr)PATH_MAX), in Next()
|
| /NextBSD/contrib/llvm/lib/Target/Hexagon/ |
| HD | HexagonCommonGEP.cpp | 597 GepNode *Min = *std::min_element(S.begin(), S.end(), NodeOrder); in common() local 598 std::pair<ProjMap::iterator,bool> Ins = PM.insert(std::make_pair(&S, Min)); in common() 604 UseSet &MinUs = Uses[Min]; in common() 615 Uses.erase(Min); in common() 618 assert((Min->Flags & Flags) == Min->Flags); in common() 619 Min->Flags = Flags; in common()
|