Home
last modified time | relevance | path

Searched refs:From (Results 1 – 25 of 802) sorted by relevance

12345678910>>...33

/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DCasting.h34 template <typename From> struct simplify_type {
35 using SimpleType = From; // The real type this represents...
38 static SimpleType &getSimplifiedValue(From &Val) { return Val; } in getSimplifiedValue()
41 template <typename From> struct simplify_type<const From> {
42 using NonConstSimpleType = typename simplify_type<From>::SimpleType;
47 static RetType getSimplifiedValue(const From &Val) {
48 return simplify_type<From>::getSimplifiedValue(const_cast<From &>(Val));
63 template <typename To, typename From, typename Enabler = void> struct isa_impl {
64 static inline bool doit(const From &Val) { return To::classof(&Val); }
68 template <typename To, typename From>
[all …]
H A DCFGUpdate.h30 NodePtr From; variable
34 Update(UpdateKind Kind, NodePtr From, NodePtr To) in Update() argument
35 : From(From), ToAndKind(To, Kind) {} in Update()
38 NodePtr getFrom() const { return From; } in getFrom()
41 return From == RHS.From && ToAndKind == RHS.ToAndKind;
75 NodePtr From = U.getFrom();
78 std::swap(From, To); // Reverse edge for postdominators.
80 Operations[{From, To}] += (U.getKind() == UpdateKind::Insert ? 1 : -1);
/freebsd/contrib/bmake/unit-tests/
H A Dcmdline-undefined.exp2 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 …]
H A Dcmdline-undefined.mk41 .info From the command line: ${CMDLINE}
42 .info From .MAKEFLAGS '=': ${MAKEFLAGS_ASSIGN}
43 .info From .MAKEFLAGS ':=': ${MAKEFLAGS_SUBST}
47 .info From the command line: ${CMDLINE}
48 .info From .MAKEFLAGS '=': ${MAKEFLAGS_ASSIGN}
49 .info From .MAKEFLAGS ':=': ${MAKEFLAGS_SUBST}
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSmallString.h137 [[nodiscard]] size_t find(char C, size_t From = 0) const {
138 return str().find(C, From);
145 [[nodiscard]] size_t find(StringRef Str, size_t From = 0) const {
146 return str().find(Str, From);
153 [[nodiscard]] size_t rfind(char C, size_t From = StringRef::npos) const {
154 return str().rfind(C, From);
165 [[nodiscard]] size_t find_first_of(char C, size_t From = 0) const {
166 return str().find_first_of(C, From);
173 [[nodiscard]] size_t find_first_of(StringRef Chars, size_t From = 0) const {
174 return str().find_first_of(Chars, From);
[all …]
H A DStringRef.h299 [[nodiscard]] size_t find(char C, size_t From = 0) const {
300 return std::string_view(*this).find(C, From);
308 size_t From = 0) const;
315 size_t From = 0) const {
316 StringRef S = drop_front(From);
330 size_t From = 0) const {
331 return find_if([F](char c) { return !F(c); }, From);
338 [[nodiscard]] LLVM_ABI size_t find(StringRef Str, size_t From = 0) const;
345 size_t From = 0) const;
351 [[nodiscard]] size_t rfind(char C, size_t From = npos) const {
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DDynamicCastInfo.h22 : From(from), To(to), ResultKind(resultKind) {} in DynamicCastInfo()
24 QualType from() const { return From; } in from()
28 return From == from && To == to; in equals()
35 return From == RHS.From && To == RHS.To;
38 return From < RHS.From && To < RHS.To;
42 ID.Add(From); in Profile()
48 QualType From, To;
H A DRangedConstraintManager.h31 Range(const llvm::APSInt &From, const llvm::APSInt &To) : Impl(&From, &To) { in Range() argument
32 assert(From <= To); in Range()
38 return From() <= Point && Point <= To(); in Includes()
40 const llvm::APSInt &From() const { return *Impl.first; } in From() function
43 return &From() == &To() ? &From() : nullptr; in getConcreteValue()
47 ID.AddPointer(&From()); in Profile()
55 bool operator<(const Range &RHS) const { return From() < RHS.From(); }
166 RangeSet unite(RangeSet Original, llvm::APSInt From, llvm::APSInt To);
173 RangeSet getRangeSet(const llvm::APSInt &From, const llvm::APSInt &To) { in getRangeSet() argument
174 return getRangeSet(Range(From, To)); in getRangeSet()
[all …]
/freebsd/contrib/dma/test/
H A Dquote.rfc28221 From: test <test@example.org>
5 From what i can see...
11 From his rabbit hole.
15 > From the previous mail
17 >From the quote
19 From here
20 From there
21 >>>From everywhere.
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DStringRef.cpp56 size_t StringRef::find_insensitive(char C, size_t From) const { in find_insensitive()
58 return find_if([L](char D) { return toLower(D) == L; }, From); in find_insensitive()
131 size_t StringRef::find(StringRef Str, size_t From) const { in find()
132 if (From > size()) in find()
135 const char *Start = data() + From; in find()
136 size_t Size = size() - From; in find()
141 return From; in find()
192 size_t StringRef::find_insensitive(StringRef Str, size_t From) const { in find_insensitive()
193 StringRef This = substr(From); in find_insensitive()
196 return From; in find_insensitive()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanUtils.h172 static void connectBlocks(VPBlockBase *From, VPBlockBase *To,
174 assert((From->getParent() == To->getParent()) &&
176 assert((SuccIdx != -1u || From->getNumSuccessors() < 2) &&
179 From->appendSuccessor(To);
181 From->getSuccessors()[SuccIdx] = To;
184 To->appendPredecessor(From);
186 To->getPredecessors()[PredIdx] = From;
191 static void disconnectBlocks(VPBlockBase *From, VPBlockBase *To) { in disconnectBlocks() argument
193 From->removeSuccessor(To); in disconnectBlocks()
194 To->removePredecessor(From); in disconnectBlocks()
[all …]
/freebsd/contrib/llvm-project/libc/src/__support/CPP/type_traits/
H A Dis_convertible.h26 template <class From, class To>
28 -> decltype(void(cpp::declval<void (&)(To)>()(cpp::declval<From>())),
34 template <class From, class To>
38 decltype(detail::test_implicitly_convertible<From, To>(0))::value) ||
39 (cpp::is_void_v<From> && cpp::is_void_v<To>)> {};
41 template <class From, class To>
43 is_convertible<From, To>::value;
/freebsd/contrib/file/magic/Magdir/
H A Drevision6 # From Hendrik Scholz <hendrik@scholz.net>
10 # From: Jonathan Smith <smithj@rpath.com>
14 # From: Josh Triplett <josh@freedesktop.org>
18 # From: Adam Buchbinder <adam.buchbinder@gmail.com>
23 # From: Frederic Briare <fbriere@fbriere.net>
29 # From: Seo Sanghyeon <tinuviel@sparcs.kaist.ac.kr>
35 # From: Uwe Zeisberger <zeisberg@informatik.uni-freiburg.de>
41 # From: Jelmer Vernooij <jelmer@samba.org>
/freebsd/contrib/llvm-project/llvm/include/llvm/SandboxIR/
H A DOperator.h27 static bool classof(const Value *From) { in classof() argument
28 return llvm::Operator::classof(From->Val); in classof()
46 static bool classof(const Instruction *From) { in classof() argument
48 cast<llvm::Instruction>(From->Val)); in classof()
50 static bool classof(const ConstantExpr *From) { in classof() argument
52 cast<llvm::ConstantExpr>(From->Val)); in classof()
54 static bool classof(const Value *From) { in classof() argument
55 return llvm::OverflowingBinaryOperator::classof(From->Val); in classof()
H A DConstant.h47 static bool classof(const sandboxir::Value *From) { in classof() argument
48 switch (From->getSubclassID()) { in classof()
241 static bool classof(const sandboxir::Value *From) { in classof() argument
242 return From->getSubclassID() == ClassID::ConstantInt; in classof()
327 static bool classof(const sandboxir::Value *From) { in classof() argument
328 return From->getSubclassID() == ClassID::ConstantFP; in classof()
354 static bool classof(const sandboxir::Value *From) { in classof() argument
355 auto ID = From->getSubclassID(); in classof()
373 static bool classof(const Value *From) { in classof() argument
374 return From->getSubclassID() == ClassID::ConstantArray; in classof()
[all …]
H A DInstruction.h223 LLVM_ABI static bool classof(const sandboxir::Value *From);
434 static bool classof(const Value *From) { in classof() argument
435 return From->getSubclassID() == ClassID::Fence; in classof()
472 LLVM_ABI static bool classof(const Value *From);
487 static bool classof(const Value *From) { in classof() argument
488 return From->getSubclassID() == ClassID::InsertElement; in classof()
509 static bool classof(const Value *From) { in classof() argument
510 return From->getSubclassID() == ClassID::ExtractElement; in classof()
538 static bool classof(const Value *From) { in classof() argument
539 return From->getSubclassID() == ClassID::ShuffleVector; in classof()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Drelease.h31 void releasePageRangeToOS(uptr From, uptr To) { in releasePageRangeToOS() argument
32 const uptr Size = To - From; in releasePageRangeToOS()
33 RegionMemMap->releasePagesToOS(getBase() + Offset + From, Size); in releasePageRangeToOS()
56 void releasePageRangeToOS(uptr From, uptr To) { in releasePageRangeToOS() argument
57 const uptr Size = To - From; in releasePageRangeToOS()
58 releasePagesToOS(Base, From + Offset, Size, Data); in releasePageRangeToOS()
81 void releasePageRangeToOS(uptr From, uptr To) { in releasePageRangeToOS() argument
82 DCHECK_EQ((To - From) % getPageSizeCached(), 0U); in releasePageRangeToOS()
83 ReleasedPagesCount += (To - From) >> getPageSizeLogCached(); in releasePageRangeToOS()
95 void releasePageRangeToOS(uptr From, uptr To) { in releasePageRangeToOS() argument
[all …]
H A Dquarantine.h43 bool canMerge(const QuarantineBatch *const From) const { in canMerge()
44 return Count + From->Count <= MaxCount; in canMerge()
47 void merge(QuarantineBatch *const From) { in merge()
48 DCHECK_LE(Count + From->Count, MaxCount); in merge()
51 for (uptr I = 0; I < From->Count; ++I) in merge()
52 Batch[Count + I] = From->Batch[I]; in merge()
53 Count += From->Count; in merge()
54 Size += From->getQuarantinedSize(); in merge()
56 From->Count = 0; in merge()
57 From->Size = sizeof(QuarantineBatch); in merge()
[all …]
H A Dmem_map_base.h61 void releasePagesToOS(uptr From, uptr Size) { in releasePagesToOS() argument
63 DCHECK((From >= getBase()) && (From + Size <= getBase() + getCapacity())); in releasePagesToOS()
64 invokeImpl(&Derived::releasePagesToOSImpl, From, Size); in releasePagesToOS()
68 void releaseAndZeroPagesToOS(uptr From, uptr Size) { in releaseAndZeroPagesToOS() argument
70 DCHECK((From >= getBase()) && (From + Size <= getBase() + getCapacity())); in releaseAndZeroPagesToOS()
71 invokeImpl(&Derived::releaseAndZeroPagesToOSImpl, From, Size); in releaseAndZeroPagesToOS()
/freebsd/contrib/llvm-project/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.h241 void addDependency(unsigned From, unsigned To,
257 void addRegisterDep(unsigned From, unsigned To, unsigned RegID, in addRegisterDep() argument
259 addDependency(From, To, {DependencyEdge::DT_REGISTER, RegID, Cost}); in addRegisterDep()
262 void addMemoryDep(unsigned From, unsigned To, unsigned Cost) { in addMemoryDep() argument
263 addDependency(From, To, {DependencyEdge::DT_MEMORY, /* unused */ 0, Cost}); in addMemoryDep()
266 void addResourceDep(unsigned From, unsigned To, uint64_t Mask, in addResourceDep() argument
268 addDependency(From, To, {DependencyEdge::DT_RESOURCE, Mask, Cost}); in addResourceDep()
319 void addRegisterDep(unsigned From, unsigned To, unsigned RegID, unsigned Cy);
320 void addMemoryDep(unsigned From, unsigned To, unsigned Cy);
321 void addResourceDep(unsigned From, unsigned To, uint64_t Mask, unsigned Cy);
H A DBottleneckAnalysis.cpp421 void DependencyGraph::addDependency(unsigned From, unsigned To, in addDependency() argument
423 DGNode &NodeFrom = Nodes[From]; in addDependency()
437 DependencyEdge DE = {Dep, From, To, 1}; in addDependency()
452 void BottleneckAnalysis::addRegisterDep(unsigned From, unsigned To, in addRegisterDep() argument
454 bool IsLoopCarried = From >= To; in addRegisterDep()
457 DG.addRegisterDep(From, To + SourceSize, RegID, Cost); in addRegisterDep()
458 DG.addRegisterDep(From + SourceSize, To + (SourceSize * 2), RegID, Cost); in addRegisterDep()
461 DG.addRegisterDep(From + SourceSize, To + SourceSize, RegID, Cost); in addRegisterDep()
464 void BottleneckAnalysis::addMemoryDep(unsigned From, unsigned To, in addMemoryDep() argument
466 bool IsLoopCarried = From >= To; in addMemoryDep()
[all …]
/freebsd/contrib/ntp/
H A DCommitLog-4.1.09 From: reg@dwf.com
13 From: Scott Allendorf <sca@newton.physics.uiowa.edu>
17 From: <justin_forrester@hp.com>
26 From: Mike Stump <mrs@kithrup.com>
31 From: Martin Janzen <janzen@pixelmetrix.com>
47 From: Reynir Siik <reynir@royal.net>
57 From: Dean Gibson <timekeeper@tcp-udp.net>
70 From: Bela Lubkin <belal@sco.com>
75 From: Dean Gibson <timekeeper@tcp-udp.net>
88 From: John Stone <johns@ks.uiuc.edu>
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DASTImporter.h267 virtual Expected<Decl *> ImportImpl(Decl *From);
308 [[nodiscard]] llvm::Error importInto(ImportT &To, const ImportT &From) { in importInto() argument
309 auto ToOrErr = Import(From); in importInto()
317 Import(ExprWithCleanups::CleanupObject From);
356 Import(const InheritedConstructor &From);
419 llvm::Expected<TemplateName> Import(TemplateName From);
494 [[nodiscard]] llvm::Error ImportDefinition(Decl *From);
499 Expected<TemplateArgument> Import(const TemplateArgument &From);
561 virtual void Imported(Decl *From, Decl *To) {} in Imported() argument
568 Decl *MapImported(Decl *From, Decl *To);
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/Analysis/
H A DSPIRVConvergenceRegionAnalysis.cpp194 bool isBackEdge(const BasicBlock *From, const BasicBlock *To) const { in isBackEdge() argument
195 if (From == To) in isBackEdge()
206 if (L->contains(From) && L->isLoopLatch(From)) in isBackEdge()
213 findPathsToMatch(LoopInfo &LI, BasicBlock *From, in findPathsToMatch() argument
217 if (isMatch(From)) in findPathsToMatch()
218 Output.insert(From); in findPathsToMatch()
220 auto *Terminator = From->getTerminator(); in findPathsToMatch()
224 if (isBackEdge(From, To)) in findPathsToMatch()
232 Output.insert(From); in findPathsToMatch()
233 if (LI.isLoopHeader(From)) { in findPathsToMatch()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Frontend/OpenMP/
H A DDirectiveNameParser.cpp57 DirectiveNameParser::insertTransition(State *From, StringRef Tok) { in insertTransition() argument
58 assert(From && "Expecting state"); in insertTransition()
59 if (!From->Transition) in insertTransition()
60 From->Transition = std::make_unique<State::TransitionMapTy>(); in insertTransition()
61 if (State *Next = From->next(Tok)) in insertTransition()
64 auto [Where, DidIt] = From->Transition->try_emplace(Tok, State()); in insertTransition()

12345678910>>...33