| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| bit.h | 24 // - It requires trivially-constructible To, to avoid UB in the implementation.
26 typename To, typename From,
27 typename = std::enable_if_t<sizeof(To) == sizeof(From)>
31 typename = std::enable_if_t<std::is_trivially_constructible<To>::value>
34 typename = std::enable_if_t<__is_trivially_constructible(To)>
41 typename = std::enable_if_t<std::is_trivially_copyable<To>::value>,
45 typename = std::enable_if_t<__is_trivially_copyable(To)>,
49 // llvm/Support/type_traits.h's is_trivially_copyable we don't want to
55 inline To bit_cast(const From &from) noexcept
56 To to; variable
[all...] |
| /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) {}
25 QualType to() const { return To; } 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
28 /// to subvert RangeSet's immutability.
31 Range(const llvm::APSInt &From, const llvm::APSInt &To) : Impl(&From, &To) {
32 assert(From <= To);
38 return From() <= Point && Point <= To();
41 const llvm::APSInt &To() const { return *Impl.second; }
43 return &From() == &To() ? &From() : nullptr;
48 ID.AddPointer(&To());
[all...] |
| ConstraintManager.h | 9 // This file defined the interface to manage constraints on symbolic values.
43 /// to either true or false, depending on the boolean value provided.
55 /// Return true if the constraint is perfectly constrained to 'true'.
60 /// Return true if the constraint is perfectly constrained to 'false'.
92 /// assumed to be true or false, respectively.
107 // We are careful to return the original state, /not/ StTrue,
108 // because we want to avoid having callers generate a new node
119 const llvm::APSInt &To,
125 const llvm::APSInt &To) {
127 assumeInclusiveRange(State, Value, From, To, true)
[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;
51 if (To->Prev)
52 To->Prev->Next = To;
53 To->Next = From->Next;
54 if (To->Next)
55 To->Next->Prev = To;
57 Pointers = To;
[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;
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/internal/ |
| cstring.d | 4 This module is intended to provide fast, safe and garbage free
5 way to work with $(I C strings).
48 To = character type of returned C string
49 str = string or input range to be converted
53 The value returned is implicitly convertible to $(D const To*) and
54 has two properties: `ptr` to access $(I C string) as $(D const To*)
55 and `buffPtr` to access it as `To*`
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| Casting.h | 29 // Define a template that can be specialized by smart pointers to reflect the
36 // An accessor to get the real value...
52 // The core of the implementation of isa<X> is here; To and From should be
53 // the names of classes. This template can be specialized to customize the
55 template <typename To, typename From, typename Enabler = void>
58 return To::classof(&Val);
63 template <typename To, typename From>
64 struct isa_impl<To, From, std::enable_if_t<std::is_base_of<To, From>::value>> {
68 template <typename To, typename From> struct isa_impl_cl
[all...] |
| CFGUpdate.h | 33 Update(UpdateKind Kind, NodePtr From, NodePtr To)
34 : From(From), ToAndKind(To, Kind) {}
57 // a) It removes redundant updates, which makes it easier to reverse-apply
75 NodePtr To = U.getTo();
77 std::swap(From, To); // Reverse edge for postdominators.
79 Operations[{From, To}] += (U.getKind() == UpdateKind::Insert ? 1 : -1);
96 // In the future, we should sort by something else to minimize the amount
97 // of work needed to perform the series of updates.
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| DomTreeUpdater.cpp | 10 // to update dominator tree related data structures.
28 const auto *To = Update.getTo();
35 const bool HasEdge = llvm::is_contained(successors(From), To);
106 // UnreachableInst as its terminator. So we check whether the BasicBlock to
136 // Because all trees are going to be up-to-date after recalculation,
144 // Resume forceFlushDeletedBB() to erase DomTree or PostDomTree nodes.
172 // The DT and PDT require the nodes related to updates
258 // Because it is illegal to submit updates that have already been applied
259 // and updates to an edge need to be strictly ordered
[all...] |
| AliasAnalysisSummary.cpp | 19 // It would be *slightly* prettier if we changed these to AliasAttrs, but it
90 auto To = instantiateInterfaceValue(ERelation.To, Call);
91 if (!To)
93 return InstantiatedRelation{*From, *To, ERelation.Offset};
|
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| ASTImporterSharedState.h | 32 /// Pointer to the import specific lookup table.
35 /// Mapping from the already-imported declarations in the "to"
36 /// context to the error status of the import of that declaration.
75 void setImportDeclError(Decl *To, ImportError Error) {
76 ImportErrors[To] = Error;
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-mca/Views/ |
| BottleneckAnalysis.cpp | 11 /// to report bottleneck info.
156 OS << " FROM: " << FromIID << " TO: " << ToIID << " ";
175 // Use a cut-off threshold to prune edges with a low frequency.
208 // RootSet to a leaf node (i.e. a node with no successors). The RootSet is
215 // latency as well as the actual delay (in cycles) caused to users.
219 // This algorithm is very similar to a (reverse) Dijkstra. Every iteration of
221 // nodes`, and then propagates the cost of N to all its neighbors.
224 // RootSet. A node N is added to the `unvisited nodes` if all its
228 // field `NumVisitedPredecessors`. When the value of that field drops to
229 // zero, then the corresponding node is added to a `ToVisit` set
[all...] |
| BottleneckAnalysis.h | 12 /// This view internally observes backend pressure increase events in order to
26 /// According to the example, backend pressure increased during the 40.76% of
34 /// dispatched and the number of uOps issued to the underlying pipelines.
37 /// the most "critical" sequence of dependent instructions according to the
57 /// The algorithm that computes the critical sequence is very similar to a
60 /// A dependency graph is used internally to track dependencies between nodes.
67 /// their "criticality". A dependency is considered to be critical if it takes a
68 /// long time to execute, and if it contributes to backend pressure increases.
73 /// At the end of simulation, costs are propagated to nodes through the edges o
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/MC/MCParser/ |
| MCAsmParserExtension.cpp | 35 StringRef To;
37 if (getParser().parseIdentifier(To))
53 MCSymbol *ToSym = getContext().getOrCreateSymbol(To);
|
| /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
20 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
34 // Mock. They are subject to change without notice, so please DO NOT
70 // Converts an identifier name to a space-separated list of lower-case
73 // "foo_bar_123" are converted to "foo bar 123".
76 // PointeeOf<Pointer>::type is the type of a value pointed to by a
111 // In what follows, we use the term "kind" to indicate whether a type
114 // when a matcher argument type can be safely converted to another
157 // Evaluates to the kind of 'type'
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/CodeGen/ |
| VarBypassDetector.cpp | 32 /// Returns false if we failed to build scope information and can't tell for
49 /// Walk through the statements, adding any labels or gotos to
51 /// Returns false if we failed to build scope information and can't tell for
56 // propagate out into the enclosing scope. Otherwise we have to worry about
113 // important to handle these iteratively instead of recursively in
114 // order to avoid blowing out the stack.
155 void VarBypassDetector::Detect(unsigned From, unsigned To) {
156 while (From != To) {
157 if (From < To) {
158 assert(Scopes[To].first < To)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| SimpleConstraintManager.cpp | 10 // simplified constraint manager interface, compared to ConstraintManager.
28 // If we have a Loc value, cast it to a bool NonLoc first.
59 // Just add the constraint to the expression without trying to simplify.
96 const llvm::APSInt &To, bool InRange) {
98 assert(From.isUnsigned() == To.isUnsigned() &&
99 From.getBitWidth() == To.getBitWidth() &&
103 // Just add the constraint to the expression without trying to simplify.
106 return assumeSymInclusiveRange(State, Sym, From, To, InRange)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| MemorySSAUpdater.h | 12 // automatically updates the MemorySSA IR to be correct.
13 // While updating loads or removing instructions is often easy enough to not
19 // we know where it is, without having to duplicate the entire set of create
60 /// We use WeakVH rather than a costly deletion to deal with dangling pointers.
72 /// to true if the definition may cause new aliases for loads below it. This
82 /// However, changing it to:
86 /// Where a mayalias b, *does* require RenameUses be set to true.
89 /// Update the MemoryPhi in `To` following an edge deletion between `From` and
90 /// `To`. If `To` becomes unreachable, a call to removeBlocks should be made
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/GlobalISel/ |
| GIMatchDag.cpp | 1 //===- GIMatchDag.cpp - A DAG representation of a pattern to be matched ---===//
65 auto To = format(ToFmt, E->getToMI(), E->getToMO()->getIdx());
67 std::swap(From, To);
69 OS << " " << From << " -> " << To << " [label=\"$" << E->getName();
94 auto To = format(ToFmt, E->getPredicate(), E->getPredicateOp()->getIdx());
99 OS << " " << From << " -> " << To << " " << Style << "\n";
103 OS << " " << From << " -> " << To << " " << Style << "\n";
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/NVPTX/ |
| NVPTXProxyRegErasure.cpp | 9 // The pass is needed to remove ProxyReg instructions and restore related
10 // registers. The instructions were needed at instruction selection stage to
14 // latest data flow node happens to be before callseq_end. Therefore the node
57 MachineOperand &To);
111 MachineOperand &To) {
114 Op.setReg(To.getReg());
|
| /src/external/apache2/llvm/dist/clang/include/clang/Lex/ |
| PreprocessorOptions.h | 44 /// Whether to disable the normal validation performed on precompiled
63 /// used in preprocessor initialization to InitializePreprocessor().
79 /// expected to indicate the beginning or end of the PCH.
83 /// expecting a #pragma hdrstop to separate the two. Allow for a
89 /// source file (or command-line preinclude) that is used to implement
98 /// Headers that will be converted to chained PCHs in memory.
101 /// Whether to disable most of the normal validation performed on
112 /// This is a set of names for decls that we do not want to be
125 /// When the lexer is done, one of the things that need to be preserved is the
130 /// Whether to write comment locations into the PCH when building it
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/X86/ |
| X86Counter.h | 22 // to support Windows and remove this linux-only guard.
49 doReadCounter(const void *From, const void *To) const;
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/backward/ |
| backward_warning.h | 25 * Do not attempt to use it directly. @headername{iosfwd}
37 backward_warning.h. To disable this warning use -Wno-deprecated.
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/backward/ |
| backward_warning.h | 25 * Do not attempt to use it directly. @headername{iosfwd}
37 backward_warning.h. To disable this warning use -Wno-deprecated.
|
