| /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/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/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...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| 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/include/llvm/Transforms/Utils/ |
| PredicateInfo.h | 15 /// assumes), and information attached to the copies. All uses of the original
17 /// replaced with uses of the copies. This enables passes to easily and sparsely
42 /// In order to reduce the number of copies inserted, predicateinfo is only
72 /// is the value the constraint applies to (the ssa.copy result).
84 // This can be use by passes, when destroying predicateinfo, to know
85 // whether they can just drop the intrinsic, or have to merge metadata.
88 // predicates, this is different to OriginalOp which refers to the initial
113 // position to it.
126 // predicate originates, and the TO block is the block where the predicate i
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| AliasAnalysisSummary.h | 9 /// This file defines various utility types and functions useful to
13 /// interprocedrual static analysis that tries to analyze the callees before the
14 /// callers get analyzed. The key idea of summary-based analysis is to first
17 /// function is called elsewhere. This is often in contrast to another style
23 /// arguments, the global values, and anything else external to the function. To
24 /// carry out the analysis conservative assumptions have to be made about those
27 /// easier to scale to large programs even if carried out context-sensitively.
58 /// These are attributes that an alias analysis can use to mark certain specia
[all...] |
| 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...] |
| CFLAndersAliasAnalysis.cpp | 14 // CFLSteensAliasAnalysis is almost linear), but it is able to yield more
20 // Rugina. The general idea is to extend the traditional transitive closure
21 // algorithm to perform CFL matching along the way: instead of recording
24 // matching process. To understand the matching better, it is advisable to have
26 // codes: all we do here is to selectively expand the transitive closure by
33 // fashion. We did not implement the demand-driven algorithm due to the
35 // necessary we may switch to it eventually.
39 // there's a third value Z that writes into both X and Y. To make that
41 // retrieving mod-ref info), we choose to duplicate some of the states in th
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/TableGen/ |
| SetTheory.cpp | 176 // (sequence "Format", From, To) Generate a sequence of records by name.
182 PrintFatalError(Loc, "Bad args to (sequence \"Format\", From, To): " +
198 int64_t From, To;
207 To = II->getValue();
209 PrintFatalError(Loc, "To must be an integer: " + Expr->getAsString());
210 if (To < 0 || To >= (1 << 30))
211 PrintFatalError(Loc, "To out of range");
216 Step *= From <= To ? 1 : -1
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/ |
| TargetLoweringObjectFile.cpp | 9 // This file implements classes used to handle lowerings specific to common
41 /// lowering implementations a chance to set up their default sections.
63 // call site encoding to be udata4 so that the alternative path
103 /// known to have a type that is an array of 1/2/4 byte elements) ends with a
183 const MCSymbol *To = GetSym(E->getOperand(1));
186 if (!From || !To)
194 MCSymbolRefExpr::create(To, MCSymbolRefExpr::VK_None, C), Count);
249 // relocation, then we may have to drop this into a writable data section
253 // If the global is required to have a unique address, it can't be pu
[all...] |
| /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.cpp | 12 // to support Windows and remove this linux-only guard.
53 // Copies the data-buffer into Buf, given the pointer to MMapped.
59 // The LBR buffer is a cyclic buffer, we copy data to another buffer.
71 // If data has been extracted successfully, also modifies the code to jump
74 const void *From, const void *To,
97 const uint64_t BlockEnd = To == nullptr
99 : reinterpret_cast<uint64_t>(To);
101 if (BlockStart <= Entry.from && BlockEnd >= Entry.to)
108 // Advance to next entry
113 return llvm::make_error<llvm::StringError>("Unable to parse databuffer."
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| DFAEmitter.cpp | 19 // to the NFA.
48 void DfaEmitter::addTransition(state_type From, state_type To, action_type A) {
51 NfaStates.insert(To);
52 NfaTransitions[{From, A}].push_back(To);
64 // If this action is possible from this state add the transitioned-to
65 // states to NewStates.
109 // significantly more effort to parse. A simple test with a large array of
110 // struct-pairs (N=100000) took clang-10 6s to parse. The same array of
111 // std::pair<uint64_t, uint64_t> took 242s. Instead we allow the user to
114 // FIXME: It may make sense to emit these as ULEB sequences instead o
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/BPF/ |
| BPFISelDAGToDAG.cpp | 1 //===-- BPFISelDAGToDAG.cpp - A dag to dag inst selector for BPF ----------===//
10 // converting from a legalized dag to a BPF dag.
43 /// Subtarget - Keep a pointer to the BPFSubtarget around so that we can
94 // Mapping from ConstantStruct global value to corresponding byte-list values
202 errs() << "Please convert to unsigned div/mod.\n";
267 // We want to find the pattern global_addr + offset
309 // After replacement, the current node is dead, we need to
310 // go backward one step to make iterator still work
313 SDValue To[] = {NVal, NVal};
314 CurDAG->ReplaceAllUsesOfValuesWith(From, To, 2)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| CallSiteSplitting.cpp | 9 // This file implements a transformation that tries to split a call-site to pass
11 // so that we can expose better context to the later passes (e.g, inliner, jump
15 // 1) Try to a split call-site with constrained arguments, if any constraints
18 // predecessors. For example, in the code below, we try to split the call-site
24 // to :
41 // to
80 /// DuplicationThreshold. Those instructions need to be duplicated in all
102 // It is possible we have already added the non-null attribute to the
129 /// If From has a conditional jump to To, add the condition to Conditions
[all...] |
| StructurizeCFG.cpp | 94 // A traits type that is intended to be used in graph algorithms. The graph
101 // This wraps a set of Nodes into the iterator, so we know which edges to
149 /// For every BB you add to the set, you can specify whether we "remember" the
157 /// Add BB to the resulting dominator.
188 /// Is the BB returned by getResult() one of the blocks we added to the set
221 /// Additionally to that even complicated loops look like this:
230 /// 3 3 = "Flow" block, with back edge to entry block
279 void delPhiValues(BasicBlock *From, BasicBlock *To);
281 void addPhiValues(BasicBlock *From, BasicBlock *To);
381 // A list of range indices of SCCs in Order, to be processed
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/MC/ |
| MCAssembler.h | 51 // to one another.
97 /// An optional version of the SDK that was used to build the source.
118 /// The list of linker options to propagate into the object file.
130 // here. Maybe when the relocation stuff moves to target specific,
145 // It would be good if there were an MCELFAssembler class to hold this.
147 // Access to the flags is necessary in cases where assembler directives affect
148 // which flags to be set.
151 /// Used to communicate Linker Optimization Hint information between
157 /// Evaluate a fixup to a relocatable expression and the value which should be
160 /// \param Layout The layout to use for evaluation
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| StackColoring.cpp | 11 // which represent the possible lifetime of stack slots. It attempts to
15 // TODO: In the future we plan to improve stack coloring in the following ways:
74 /// zone. This can happen when the user returns a reference to a local
75 /// data-structure. We can detect these cases and decide not to optimize the
76 /// code. If this flag is enabled, we try to save the user. This option
85 /// use of stack slot as start of slot lifetime, as opposed to looking
95 STATISTIC(StackSpaceSaved, "Number of bytes saved due to merging slots.");
127 // stack slot corresponding to `z` is always destroyed before either of the
146 // This is an important optimization if we want stack space to be under
154 // while the latter 2 calls to `bar` are running. This is justified becaus
[all...] |
| TypePromotion.cpp | 54 // The goal of this pass is to enable more efficient code generation for
64 // The issue here is that i8 is type-legalized to i32 because i8 is not a
84 // We achieve this by type promoting the IR to i32 like so for this example:
87 // %0 = zext i8 %c to i32
93 // For this to be valid and legal, we need to prove that the i32 add is
104 // legal to do so.
121 void ReplaceAllUsersOfWith(Value *From, Value *To);
224 /// a narrow 'TypeSize' value. These values will be zext to start the promotion
225 /// of the tree to i32. We guarantee that these won't populate the upper bit
[all...] |
| TwoAddressInstructionPass.cpp | 15 // to:
20 // Note that if a register allocator chooses to use this pass, that it
21 // has to be capable of handling the non-SSA nature of these rewritten
70 STATISTIC(NumCommuted , "Number of instructions commuted to coalesce");
72 STATISTIC(NumConvertedTo3Addr, "Number of instructions promoted to 3-address");
76 // Temporary flag to disable rescheduling.
82 // Limit the number of dataflow edges to traverse when evaluating the benefit
86 cl::desc("Maximum number of dataflow edges to traverse when evaluating "
111 // A map from virtual registers to physical registers which are likely targets
112 // to be coalesced to due to copies from physical registers to virtua
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/ObjectYAML/ |
| ELFEmitter.cpp | 1 //===- yaml2elf - Convert YAML to a ELF object file -----------------------===//
36 // This class is used to build up a contiguous binary blob while keeping
39 // The blob might be limited to an arbitrary size. All attempts to write data
41 // Such an approach allows us to simplify the code by delaying error reporting
70 // Request to write 0 bytes to check we did not reach the limit.
134 // Used to keep track of section and symbol names, so that in the YAML file
173 /// TODO: This class still has a ways to go before it is truly a "single
352 // affect the output, but allows us to map them by name in the code an
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyFastISel.cpp | 111 /// Keep a pointer to the WebAssemblySubtarget around so that we can make the
163 MVT::SimpleValueType To);
165 MVT::SimpleValueType To);
307 // Try to grab the base operand now.
446 // If the value is naturally an i1, we don't need to mask it. We only know
513 MVT::SimpleValueType To) {
514 if (To == MVT::i64) {
527 if (To == MVT::i32)
535 MVT::SimpleValueType To) {
536 if (To == MVT::i64)
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/ASTMatchers/ |
| ASTMatchersInternal.h | 13 // parameters define the context of the match, which allows matchers to recurse
14 // or store the current node as bound to a specific string, so that it can be
21 // to clang's AST class hierarchy, meaning that you can use a Matcher<Base>
25 // The matcher functions are defined in ASTMatchers.h. To make it possible
26 // to implement both the matcher function and the implementation of the matcher
30 // This file contains the base classes needed to construct the actual matchers.
98 /// This type is used to do recursion. TypeList<>/EmptyTypeList indicates the
106 /// Helper meta-function to determine if some type \c T is present or
120 /// using plain C++11 variadic functions, but the function object allows us to
142 // Trampoline function to allow for implicit conversions to take plac
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaCast.cpp | 96 // Walk down from the CE to the OrigSrcExpr, and mark all immediate
120 /// Try to handle the given placeholder expression kind. Return
196 // arguments, they return TC_NotApplicable and *may* set diag to a diagnostic
197 // to emit if no other way succeeds. If their way of casting is appropriate but
198 // fails, they return TC_Failed and *must* set diag; they can set it to 0 if
405 /// Try to diagnose a failed overloaded cast. Returns true if
495 // Detect if both types are (ptr to) class, and note any incompleteness.
502 QualType To = src->getType();
503 if (auto Ptr = To->getAs<PointerType>()) {
504 To = Ptr->getPointeeType()
[all...] |
