| /src/usr.bin/make/unit-tests/ |
| cmdline-undefined.exp | 2 make: cmdline-undefined.mk:41: From the command line: Undefined is .
3 make: cmdline-undefined.mk:42: From .MAKEFLAGS '=': Undefined is .
4 make: cmdline-undefined.mk:43: From .MAKEFLAGS ':=': Undefined is .
5 make: cmdline-undefined.mk:47: From the command line: Undefined is now defined.
6 make: cmdline-undefined.mk:48: From .MAKEFLAGS '=': Undefined is now defined.
7 make: cmdline-undefined.mk:49: From .MAKEFLAGS ':=': Undefined is now defined.
10 make: cmdline-undefined.mk:41: From the command line: Undefined is .
11 make: cmdline-undefined.mk:42: From .MAKEFLAGS '=': Undefined is .
12 make: cmdline-undefined.mk:43: From .MAKEFLAGS ':=': Undefined is .
13 make: cmdline-undefined.mk:47: From the command line: Undefined is now defined
[all...] |
| cmdline-undefined.mk | 11 # expect+30: From the command line: Undefined is .
12 # expect+30: From .MAKEFLAGS '=': Undefined is .
13 # expect+30: From .MAKEFLAGS ':=': Undefined is .
14 # expect+33: From the command line: Undefined is now defined.
15 # expect+33: From .MAKEFLAGS '=': Undefined is now defined.
16 # expect+33: From .MAKEFLAGS ':=': Undefined is now defined.
25 # expect+16: From the command line: Undefined is .
26 # expect+16: From .MAKEFLAGS '=': Undefined is .
27 # expect+16: From .MAKEFLAGS ':=': Undefined is .
28 # expect+19: From the command line: Undefined is now defined
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/ |
| FuzzerRandom.h | 25 intptr_t operator()(intptr_t From, intptr_t To) {
26 assert(From < To);
27 intptr_t RangeSize = To - From + 1;
28 return operator()(RangeSize) + From;
|
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| DynamicCastInfo.h | 21 DynamicCastInfo(QualType from, QualType to, CastResult resultKind)
22 : From(from), To(to), ResultKind(resultKind) {}
24 QualType from() const { return From; } function in class:clang::ento::DynamicCastInfo
27 bool equals(QualType from, QualType to) const {
28 return From == from && To == to;
35 return From == RHS.From && To == RHS.To
[all...] |
| RangedConstraintManager.h | 26 /// A Range represents the closed range [from, to]. The caller must
27 /// guarantee that from <= to. Note that Range is immutable, so as not
31 Range(const llvm::APSInt &From, const llvm::APSInt &To) : Impl(&From, &To) {
32 assert(From <= To);
38 return From() <= Point && Point <= To();
40 const llvm::APSInt &From() const { return *Impl.first; }
43 return &From() == &To() ? &From() : nullptr;
47 ID.AddPointer(&From());
[all...] |
| ConstraintManager.h | 118 const llvm::APSInt &From,
124 const llvm::APSInt &From,
127 assumeInclusiveRange(State, Value, From, To, true);
135 assumeInclusiveRange(State, Value, From, To, false);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| bit.h | 22 // This implementation of bit_cast is different from the C++17 one in two ways:
26 typename To, typename From,
27 typename = std::enable_if_t<sizeof(To) == sizeof(From)>
42 typename = std::enable_if_t<std::is_trivially_copyable<From>::value>
46 typename = std::enable_if_t<__is_trivially_copyable(From)>
55 inline To bit_cast(const From &from) noexcept {
57 std::memcpy(&to, &from, sizeof(To));
|
| SmallString.h | 30 /// Initialize from a StringRef.
49 /// Assign from a StringRef.
54 /// Assign from a list of StringRefs.
66 /// Append from a StringRef.
71 /// Append from a list of StringRefs.
139 size_t find(char C, size_t From = 0) const {
140 return str().find(C, From);
147 size_t find(StringRef Str, size_t From = 0) const {
148 return str().find(Str, From);
155 size_t rfind(char C, size_t From = StringRef::npos) const
[all...] |
| StringRef.h | 101 /// Disable conversion from nullptr. This prevents things like
105 /// Construct a string ref from a cstring.
109 /// Construct a string ref from a pointer and length.
113 /// Construct a string ref from an std::string.
118 /// Construct a string ref from an std::string_view.
175 // Don't request a length 0 copy from the allocator.
259 /// Disallow accidental assignment from a temporary std::string.
314 size_t find(char C, size_t From = 0) const {
315 size_t FindBegin = std::min(From, Length);
329 size_t find_lower(char C, size_t From = 0) const
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| Casting.h | 33 template<typename From> struct simplify_type {
34 using SimpleType = From; // The real type this represents...
37 static SimpleType &getSimplifiedValue(From &Val) { return Val; }
40 template<typename From> struct simplify_type<const From> {
41 using NonConstSimpleType = typename simplify_type<From>::SimpleType;
47 static RetType getSimplifiedValue(const From& Val) {
48 return simplify_type<From>::getSimplifiedValue(const_cast<From&>(Val));
52 // The core of the implementation of isa<X> is here; To and From should b
[all...] |
| CFGUpdate.h | 29 NodePtr From;
33 Update(UpdateKind Kind, NodePtr From, NodePtr To)
34 : From(From), ToAndKind(To, Kind) {}
37 NodePtr getFrom() const { return From; }
40 return From == RHS.From && ToAndKind == RHS.ToAndKind;
74 NodePtr From = U.getFrom();
77 std::swap(From, To); // Reverse edge for postdominators.
79 Operations[{From, To}] += (U.getKind() == UpdateKind::Insert ? 1 : -1)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
| InterpBlock.cpp | 47 void Block::movePointer(Pointer *From, Pointer *To) {
50 To->Prev = From->Prev;
53 To->Next = From->Next;
56 if (Pointers == From)
59 From->Prev = nullptr;
60 From->Next = nullptr;
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| DomTreeUpdater.cpp | 27 const auto *From = Update.getFrom();
31 // Discard updates by inspecting the current state of successors of From.
32 // Since isUpdateValid() must be called *after* the Terminator of From is
35 const bool HasEdge = llvm::is_contained(successors(From), To);
133 // Prevent forceFlushDeletedBB() from erasing DomTree or PostDomTree nodes.
260 // it is safe to infer the existence of an edge from the first update
317 void DomTreeUpdater::insertEdge(BasicBlock *From, BasicBlock *To) {
320 assert(isUpdateValid({DominatorTree::Insert, From, To}) &&
328 if (From == To)
333 DT->insertEdge(From, To)
[all...] |
| AliasAnalysisSummary.cpp | 87 auto From = instantiateInterfaceValue(ERelation.From, Call);
88 if (!From)
93 return InstantiatedRelation{*From, *To, ERelation.Offset};
|
| /src/external/apache2/llvm/dist/llvm/lib/MC/MCParser/ |
| MCAsmParserExtension.cpp | 26 StringRef From;
28 if (getParser().parseIdentifier(From))
52 MCSymbol *FromSym = getContext().getOrCreateSymbol(From);
|
| /src/external/apache2/llvm/dist/llvm/utils/unittest/googlemock/include/gmock/internal/ |
| gmock-internal-utils.h | 15 // contributors may be used to endorse or promote products derived from
165 // LosslessArithmeticConvertibleImpl<kFromKind, From, kToKind, To>::value
166 // is true if and only if arithmetic type From can be losslessly converted to
169 // It's the user's responsibility to ensure that both From and To are
172 // From, and kToKind is the kind of To; the value is
174 template <TypeKind kFromKind, typename From, TypeKind kToKind, typename To>
193 template <typename From>
194 struct LosslessArithmeticConvertibleImpl<kInteger, From, kBool, bool>
199 template <typename From, typename To>
200 struct LosslessArithmeticConvertibleImpl<kInteger, From, kInteger, To
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/CodeGen/ |
| VarBypassDetector.cpp | 139 unsigned from = S.second; local
142 Detect(from, ToScopes[LS]);
146 Detect(from, ToScopes[SC]);
155 void VarBypassDetector::Detect(unsigned From, unsigned To) {
156 while (From != To) {
157 if (From < To) {
163 assert(Scopes[From].first < From);
164 From = Scopes[From].first
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/GlobalISel/ |
| GIMatchDag.cpp | 64 auto From = format(FromFmt, E->getFromMI(), E->getFromMO()->getIdx());
67 std::swap(From, To);
69 OS << " " << From << " -> " << To << " [label=\"$" << E->getName();
97 auto From =
99 OS << " " << From << " -> " << To << " " << Style << "\n";
102 auto From = format(FromMIFmt, E->getRequiredMI());
103 OS << " " << From << " -> " << To << " " << Style << "\n";
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| StringRef.cpp | 58 size_t StringRef::find_lower(char C, size_t From) const {
60 return find_if([L](char D) { return toLower(D) == L; }, From);
127 size_t StringRef::find(StringRef Str, size_t From) const {
128 if (From > Length)
131 const char *Start = Data + From;
132 size_t Size = Length - From;
137 return From;
176 size_t StringRef::find_lower(StringRef Str, size_t From) const {
177 StringRef This = substr(From);
180 return From;
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-mca/Views/ |
| BottleneckAnalysis.h | 28 /// increases was the contention on floating point adder JFPA accessible from
61 /// Nodes of the graph represent instructions from the input assembly sequence,
219 // pre-allocated at construction time to describe instructions from "past and
237 void addDependency(unsigned From, unsigned To,
252 void addRegisterDep(unsigned From, unsigned To, unsigned RegID,
254 addDependency(From, To, {DependencyEdge::DT_REGISTER, RegID, Cost});
257 void addMemoryDep(unsigned From, unsigned To, unsigned Cost) {
258 addDependency(From, To, {DependencyEdge::DT_MEMORY, /* unused */ 0, Cost});
261 void addResourceDep(unsigned From, unsigned To, uint64_t Mask,
263 addDependency(From, To, {DependencyEdge::DT_RESOURCE, Mask, Cost})
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| SimpleConstraintManager.cpp | 95 ProgramStateRef State, NonLoc Value, const llvm::APSInt &From,
98 assert(From.isUnsigned() == To.isUnsigned() &&
99 From.getBitWidth() == To.getBitWidth() &&
106 return assumeSymInclusiveRange(State, Sym, From, To, InRange);
117 return assumeSymInclusiveRange(State, Sym, From, To, InRange);
123 bool IsInRange = IntVal >= From && IntVal <= To;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/NVPTX/ |
| NVPTXImageOptimizer.cpp | 43 void replaceWith(Instruction *From, ConstantInt *To);
147 void NVPTXImageOptimizer::replaceWith(Instruction *From, ConstantInt *To) {
151 for (CallInst::use_iterator UI = From->use_begin(), UE = From->use_end();
166 From->replaceAllUsesWith(To);
167 InstrToDelete.push_back(From);
|
| NVPTXProxyRegErasure.cpp | 56 void replaceRegisterUsage(MachineInstr &Instr, MachineOperand &From,
110 MachineOperand &From,
113 if (Op.isReg() && Op.getReg() == From.getReg()) {
|
| /src/external/apache2/llvm/dist/clang/include/clang/Lex/ |
| PreprocessorOptions.h | 109 /// Dump declarations that are deserialized from PCH, for testing.
131 /// Reading the comments from the PCH can be a performance hit even if the
139 /// that the client can get the maximum amount of information from the parser.
225 void addRemappedFile(StringRef From, StringRef To) {
226 RemappedFiles.emplace_back(std::string(From), std::string(To));
229 void addRemappedFile(StringRef From, llvm::MemoryBuffer *To) {
230 RemappedFileBuffers.emplace_back(std::string(From), To);
|
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaFixItUtils.cpp | 22 bool ConversionFixItGenerator::compareTypesSimple(CanQualType From,
27 if (!To.isAtLeastAsQualifiedAs(From))
30 From = From.getNonReferenceType();
34 if (isa<PointerType>(From) && isa<PointerType>(To)) {
35 From = S.Context.getCanonicalType(
36 (cast<PointerType>(From))->getPointeeType());
41 const CanQualType FromUnq = From.getUnqualifiedType();
45 To.isAtLeastAsQualifiedAs(From))
|
