| /minix3/external/bsd/llvm/dist/llvm/lib/CodeGen/ |
| H A D | ShadowStackGC.cpp | 13 // to identify roots.
22 // In order to support this particular transformation, all stack roots are
44 /// roots.
52 /// Roots - GC roots in the current function. Each is a pair of the
54 std::vector<std::pair<CallInst*,AllocaInst*> > Roots; member in __anon716e35ed0111::ShadowStackGC
210 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap()
211 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); in GetFrameMap()
221 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap()
263 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType()
264 EltTys.push_back(Roots[I].second->getAllocatedType()); in GetConcreteStackEntryType()
[all …]
|
| H A D | GCStrategy.cpp | 14 // Roots are identified in SelectionDAGISel.
50 AllocaInst **Roots, unsigned Count);
155 bool LowerIntrinsics::InsertRootInitializers(Function &F, AllocaInst **Roots, in InsertRootInitializers() argument
172 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I) in InsertRootInitializers()
186 // action. The default for roots is no action. in NeedsDefaultLoweringPass()
261 SmallVector<AllocaInst*, 32> Roots; in PerformDefaultLowering() local
291 Roots.push_back(cast<AllocaInst>( in PerformDefaultLowering()
304 if (Roots.size()) in PerformDefaultLowering()
305 MadeChange |= InsertRootInitializers(F, Roots.begin(), Roots.size()); in PerformDefaultLowering()
401 // Find the stack offsets for all roots. in runOnMachineFunction()
|
| H A D | TargetRegisterInfo.cpp | 70 MCRegUnitRootIterator Roots(Unit, TRI); in print() local
71 assert(Roots.isValid() && "Unit has no roots."); in print()
72 OS << TRI->getName(*Roots); in print()
73 for (++Roots; Roots.isValid(); ++Roots) in print()
74 OS << '~' << TRI->getName(*Roots); in print()
|
| /minix3/external/bsd/llvm/dist/llvm/include/llvm/CodeGen/ |
| H A D | GCMetadata.h | 19 // - Stack offsets for GC roots, as specified by calls to llvm.gcroot
21 // As a refinement, liveness analysis calculates the set of live roots at each
23 // generator, so all roots are assumed live.
94 std::vector<GCRoot> Roots; variable
104 // The bit vector is the more compact representation where >3.2% of roots
123 Roots.push_back(GCRoot(Num, Metadata)); in addStackRoot()
128 return Roots.erase(position); in removeStackRoot()
149 /// roots_begin/roots_end - Iterators for all roots in the function.
151 roots_iterator roots_begin() { return Roots.begin(); } in roots_begin()
152 roots_iterator roots_end () { return Roots.end(); } in roots_end()
[all …]
|
| H A D | GCStrategy.h | 32 // - Roots
39 // When used with gc.statepoint, information about safepoint and roots can be
71 bool UseStatepoints; /// Uses gc.statepoints as opposed to gc.roots,
81 bool InitRoots; ///< If set, roots are nulled during lowering.
136 /// By default, roots are left for the code generator so it can generate a
190 /// Note that to use a custom GCMetadataPrinter w/gc.roots, you must also
|
| /minix3/external/bsd/llvm/dist/clang/unittests/Basic/ |
| H A D | VirtualFileSystemTest.cpp | 565 getFromYAMLString("{ 'roots': [\n" in TEST_F()
616 " 'roots': [\n" in TEST_F()
652 " 'roots': [\n" in TEST_F()
685 // invalid YAML in roots in TEST_F()
686 FS = getFromYAMLString("{ 'roots':[}", Lower); in TEST_F()
689 "{ 'roots':[ { 'name': 'foo', 'type': 'directory', 'contents': [}", in TEST_F()
694 FS = getFromYAMLString("{ 'knobular': 'true', 'roots':[] }", Lower); in TEST_F()
696 FS = getFromYAMLString("{ 'case-sensitive': 'maybe', 'roots':[] }", Lower); in TEST_F()
699 // invalid roots in TEST_F()
700 FS = getFromYAMLString("{ 'roots':'' }", Lower); in TEST_F()
[all …]
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Support/ |
| H A D | DAGDeltaAlgorithm.cpp | 69 std::vector<change_ty> Roots; member in __anonca73c8ac0111::DAGDeltaAlgorithmImpl
203 // Compute the roots. in DAGDeltaAlgorithmImpl()
207 Roots.push_back(*it); in DAGDeltaAlgorithmImpl()
210 std::vector<change_ty> Worklist(Roots.begin(), Roots.end()); in DAGDeltaAlgorithmImpl()
255 llvm::errs() << "Roots: ["; in DAGDeltaAlgorithmImpl()
256 for (std::vector<change_ty>::const_iterator it = Roots.begin(), in DAGDeltaAlgorithmImpl()
257 ie = Roots.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
258 if (it != Roots.begin()) llvm::errs() << ", "; in DAGDeltaAlgorithmImpl()
311 // The current set of changes we are minimizing, starting at the roots. in Run()
312 changeset_ty CurrentSet(Roots.begin(), Roots.end()); in Run()
|
| /minix3/external/bsd/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | DominanceFrontier.h | 41 std::vector<BlockT *> Roots; variable
52 return Roots; in getRoots()
56 assert(Roots.size() == 1 && "Should always have entry node!"); in getRoot()
57 return Roots[0]; in getRoot()
127 this->Roots = DT.getRoots(); in analyze()
128 assert(this->Roots.size() == 1 && in analyze()
130 calculate(DT, DT[this->Roots[0]]); in analyze()
|
| /minix3/external/bsd/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ExplodedGraph.h | 256 /// The roots of the simulation graph. Usually there will be only
259 /// different roots reach the same state at the same program location.
260 NodeVector Roots; variable
304 /// addRoot - Add an untyped node to the set of roots.
306 Roots.push_back(V); in addRoot()
320 unsigned num_roots() const { return Roots.size(); } in num_roots()
344 roots_iterator roots_begin() { return Roots.begin(); } in roots_begin()
346 roots_iterator roots_end() { return Roots.end(); } in roots_end()
348 const_roots_iterator roots_begin() const { return Roots.begin(); } in roots_begin()
350 const_roots_iterator roots_end() const { return Roots.end(); } in roots_end()
|
| /minix3/external/bsd/llvm/dist/llvm/docs/ |
| H A D | Lexicon.rst | 179 .. _stack roots:
196 In garbage collection, it is necessary to identify `stack roots`_ so that
201 pointers`_ must be reloaded from stack roots.
224 identifies `roots`_ within the stack frame of an executing function.
|
| H A D | GarbageCollection.rst | 101 * Registration of global roots with the runtime.
133 #. Implement a registry for global roots.
147 * Use ``@llvm.gcroot`` to mark stack roots.
202 roots, and for this it needs to integrate with the shadow stack. Luckily, doing
214 int32_t NumRoots; //< Number of roots in stack frame.
224 void *Roots[0]; //< Stack roots (in-place array).
245 // For roots [0, NumMeta), the metadata pointer is in the FrameMap.
247 Visitor(&R->Roots[i], R->Map->Meta[i]);
249 // For roots [NumMeta, NumRoots), the metadata pointer is null.
251 Visitor(&R->Roots[i], NULL);
[all …]
|
| /minix3/external/bsd/llvm/dist/clang/unittests/libclang/ |
| H A D | LibclangTest.cpp | 77 " 'roots': [\n" in TEST()
99 " 'roots': [\n" in TEST()
127 " 'roots': [\n" in TEST()
180 " 'roots': [\n" in TEST()
203 " 'roots': [\n" in TEST()
255 " 'roots': [\n" in TEST()
301 " 'roots': [\n" in TEST()
323 " 'roots': [\n" in TEST()
|
| /minix3/external/bsd/llvm/dist/llvm/include/llvm/Support/ |
| H A D | GenericDomTree.h | 36 std::vector<NodeT *> Roots;
39 : Roots(), IsPostDominators(isPostDom) {} in DominatorBase()
41 : Roots(std::move(Arg.Roots)), in DominatorBase()
43 Arg.Roots.clear(); in DominatorBase()
46 Roots = std::move(RHS.Roots);
48 RHS.Roots.clear();
57 const std::vector<NodeT *> &getRoots() const { return Roots; } in getRoots()
244 this->Roots.clear(); in reset()
474 assert(this->Roots.size() == 1 && "Should always have entry node!"); in getRoot()
475 return this->Roots[0]; in getRoot()
[all …]
|
| H A D | GenericDomTreeConstruction.h | 40 InfoRec &VInfo = DT.Info[DT.Roots[i]]; in DFSPass()
156 bool MultipleRoots = (DT.Roots.size() > 1); in Calculate()
168 for (unsigned i = 0, e = static_cast<unsigned>(DT.Roots.size()); in Calculate()
170 N = DFSPass<GraphT>(DT, DT.Roots[i], N); in Calculate()
246 if (DT.Roots.empty()) return; in Calculate()
252 typename GraphT::NodeType* Root = !MultipleRoots ? DT.Roots[0] : nullptr; in Calculate()
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | LoopRerollPass.cpp | 318 const SmallInstructionVector &Roots,
331 SmallVector<SmallInstructionVector, 32> &Roots,
508 const SmallInstructionVector &Roots, in collectInLoopUserSet() argument
512 for (SmallInstructionVector::const_iterator I = Roots.begin(), in collectInLoopUserSet()
513 IE = Roots.end(); I != IE; ++I) in collectInLoopUserSet()
610 SmallVector<SmallInstructionVector, 32> &Roots, in collectAllRoots() argument
628 Roots[Idx-1].push_back(UI); in collectAllRoots()
636 if (Roots[0].empty()) in collectAllRoots()
640 if (Roots[i].size() != Roots[0].size()) { in collectAllRoots()
746 // First, we collect the use set of %iv, excluding the other increment roots.
[all …]
|
| /minix3/external/bsd/llvm/dist/llvm/utils/TableGen/ |
| H A D | CodeGenRegisters.h | 443 const CodeGenRegister *Roots[2]; member
450 Roots[0] = Roots[1] = nullptr; in RegUnit()
454 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array"); in getRoots()
455 return makeArrayRef(Roots, !!Roots[0] + !!Roots[1]); in getRoots()
621 RegUnits.back().Roots[0] = R0;
622 RegUnits.back().Roots[1] = R1;
|
| /minix3/external/bsd/llvm/dist/llvm/test/CodeGen/ARM/ |
| H A D | 2010-04-15-ScavengerDebugValue.ll | 20 !12 = !{!"libgcc2.c", !"/Users/bwilson/local/nightly/test-2010-04-14/build/llvmgcc.roots/llvmgcc~ob…
25 !7 = !{!"0x29", !"libgcc2.h", !"/Users/bwilson/local/nightly/test-2010-04-14/build/llvmgcc.roots/ll…
|
| /minix3/external/bsd/llvm/dist/clang/test/VFS/Inputs/ |
| H A D | invalid-yaml.yaml | 3 'roots': []
|
| H A D | unknown-key.yaml | 4 'roots': []
|
| H A D | unknown-value.yaml | 4 'roots': []
|
| H A D | missing-key.yaml | 3 'roots': [ { 'name' : 'foo', 'external-contents': 'bar' } ]
|
| H A D | use-external-names.yaml | 4 'roots': [{ 'type': 'file', 'name': 'OUT_DIR/external-names.h',
|
| H A D | vfsoverlay2.yaml | 3 'roots': [
|
| /minix3/external/bsd/llvm/dist/clang/lib/Basic/ |
| H A D | VirtualFileSystem.cpp | 424 /// 'roots': [
468 std::vector<Entry *> Roots; ///< The root(s) of the virtual file system. member in __anonfd6d57aa0511::VFSFromYAML
491 /// \brief Looks up \p Path in \c Roots.
780 KeyStatusPair("roots", true), in parse()
786 // Parse configuration and 'roots' in parse()
797 if (Key == "roots") { in parse()
798 yaml::SequenceNode *Roots = dyn_cast<yaml::SequenceNode>(I->getValue()); in parse() local
799 if (!Roots) { in parse()
804 for (yaml::SequenceNode::iterator I = Roots->begin(), E = Roots->end(); in parse()
807 FS->Roots.push_back(E); in parse()
[all …]
|
| /minix3/external/bsd/llvm/dist/clang/test/Index/Inputs/ |
| H A D | vfsoverlay.yaml | 3 'roots': [
|