Searched refs:Root (Results 101 - 125 of 169) sorted by relevance

1234567

/openbsd-current/gnu/llvm/llvm/include/llvm/BinaryFormat/
H A DMsgPackDocument.h280 DocNode Root; member in class:llvm::msgpack::Document
296 DocNode &getRoot() { return Root; }
/openbsd-current/gnu/llvm/llvm/lib/Transforms/InstCombine/
H A DInstCombineLoadStoreAlloca.cpp262 PointerReplacer(InstCombinerImpl &IC, Instruction &Root) argument
263 : IC(IC), Root(Root) {}
273 return I == &Root || Worklist.contains(I);
280 Instruction &Root; member in class:__anon3383::PointerReplacer
285 if (!collectUsersRecursive(Root))
436 auto *PT = cast<PointerType>(Root.getType());
440 WorkMap[&Root] = V;
/openbsd-current/gnu/llvm/llvm/lib/CodeGen/
H A DLiveIntervals.cpp281 for (MCRegUnitRootIterator Root(Unit, TRI); Root.isValid(); ++Root) {
283 for (MCSuperRegIterator Super(*Root, TRI, /*IncludeSelf=*/true);
301 for (MCRegUnitRootIterator Root(Unit, TRI); Root.isValid(); ++Root) {
302 for (MCSuperRegIterator Super(*Root, TRI, /*IncludeSelf=*/true);
H A DScheduleDAGInstrs.cpp1334 for (const RootData &Root : RootSet) {
1335 unsigned TreeID = SubtreeClasses[Root.NodeID];
1336 if (Root.ParentNodeID != SchedDFSResult::InvalidSubtreeID)
1337 R.DFSTreeData[TreeID].ParentTreeID = SubtreeClasses[Root.ParentNodeID];
1338 R.DFSTreeData[TreeID].SubInstrCount = Root.SubInstrCount;
H A DInlineSpiller.cpp125 MachineBasicBlock *Root, SmallPtrSet<MachineInstr *, 16> &Spills,
1333 /// Starting from \p Root find a top-down traversal order of the dominator
1340 MachineBasicBlock *Root, SmallPtrSet<MachineInstr *, 16> &Spills,
1349 // non-redundant spill to the Root node.
1354 // the Root.
1355 MachineDomTreeNode *RootIDomNode = MDT[Root]->getIDom();
1357 // tree towards the Root node until it is reached. If there is other node
1360 // the path starting from the first node with non-redundant spill to the Root
1374 /// the Root node must already be traversed by another spill.
1400 Orders.push_back(MDT.getBase().getNode(Root));
1339 getVisitOrders( MachineBasicBlock *Root, SmallPtrSet<MachineInstr *, 16> &Spills, SmallVectorImpl<MachineDomTreeNode *> &Orders, SmallVectorImpl<MachineInstr *> &SpillsToRm, DenseMap<MachineDomTreeNode *, unsigned> &SpillsToKeep, DenseMap<MachineDomTreeNode *, MachineInstr *> &SpillBBToSpill) argument
1441 MachineBasicBlock *Root = LIS.getMBBFromIndex(OrigVNI.def); local
[all...]
/openbsd-current/gnu/llvm/clang/lib/CodeGen/
H A DCodeGenTBAA.h138 llvm::MDNode *Root; member in class:clang::CodeGen::CodeGenTBAA
/openbsd-current/gnu/llvm/lldb/include/lldb/Core/
H A DFormatEntity.h46 Root, member in class:lldb_private::FormatEntity::Entry::Type
/openbsd-current/gnu/llvm/llvm/include/llvm/CodeGen/GlobalISel/
H A DInstructionSelector.h563 bool isBaseWithConstantOffset(const MachineOperand &Root,
/openbsd-current/gnu/llvm/llvm/include/llvm/Analysis/
H A DLoopCacheAnalysis.h205 /// Create a CacheCost for the loop nest rooted by \p Root.
210 getCacheCost(Loop &Root, LoopStandardAnalysisResults &AR, DependenceInfo &DI,
/openbsd-current/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonConstExtenders.cpp134 Node *Root = nullptr; member in struct:__anon2835::RangeTree
137 Root = add(Root, R);
140 Root = remove(Root, N);
144 order(Root, Seq);
148 nodesWith(Root, P, CheckAlign, Nodes);
582 dbgs() << "Root: " << Root << '\n';
583 if (Root)
[all...]
/openbsd-current/gnu/llvm/llvm/utils/TableGen/
H A DAsmMatcherEmitter.cpp258 const ClassInfo *Root = this; local
259 while (!Root->SuperClasses.empty())
260 Root = Root->SuperClasses.front();
266 return Root == RHSRoot;
293 const ClassInfo *Root = this; local
294 while (!Root->SuperClasses.empty()) {
296 Root = Root->SuperClasses.front();
302 const ClassInfo *Root local
[all...]
/openbsd-current/gnu/llvm/llvm/lib/Support/
H A DYAMLParser.cpp2405 Document::Document(Stream &S) : stream(S), Root(nullptr) {
2420 if (!Root && !getRoot())
2422 Root->skip();
2548 if (Root && (isa<MappingNode>(Root) || isa<SequenceNode>(Root)))
H A DUnicodeNameToCodepoint.cpp542 Node Root = createRoot(); local
543 VisitNode(Root, 1, VisitNode);
H A DJSON.cpp215 Path::Root *R = P->Seg.root();
224 Error Path::Root::getError() const {
309 void Path::Root::printErrorContext(const Value &R, raw_ostream &OS) const {
/openbsd-current/gnu/gcc/libstdc++-v3/include/ext/
H A Dtypelist.h57 template<typename Root>
60 typedef Root root;
/openbsd-current/gnu/llvm/llvm/lib/MC/
H A DMCPseudoProbe.cpp140 assert(!isRoot() && "Root should be handled seperately");
206 const auto &Root = ProbeSec.second; local
219 for (const auto &Child : Root.getChildren())
/openbsd-current/gnu/llvm/llvm/lib/Target/AArch64/
H A DAArch64InstrInfo.h258 /// for an instruction chain ending in ``Root``. All potential patterns are
261 getMachineCombinerPatterns(MachineInstr &Root,
272 MachineInstr &Root, MachineCombinerPattern Pattern,
/openbsd-current/gnu/llvm/clang/include/clang/Lex/
H A DHeaderSearch.h650 /// \param Root The "root" directory, at which we should stop looking for
655 bool hasModuleMap(StringRef Filename, const DirectoryEntry *Root,
756 const DirectoryEntry *Root,
/openbsd-current/gnu/llvm/llvm/lib/WindowsManifest/
H A DWindowsManifestMerger.cpp539 static void stripComments(xmlNodePtr Root) { argument
541 for (xmlNodePtr Child = Root->children; Child; Child = Child->next) {
/openbsd-current/gnu/llvm/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp281 NodeId Root) {
289 Traverse(Root);
294 NodeId Root) {
297 Ids.push_back(Root);
280 getSubtreePostorder(const SyntaxTree::Impl &Tree, NodeId Root) argument
293 getSubtreeBfs(const SyntaxTree::Impl &Tree, NodeId Root) argument
/openbsd-current/gnu/llvm/llvm/lib/Target/RISCV/
H A DRISCVISelLowering.cpp9019 /// Get or create a value that can feed \p Root with the given extension \p
9022 SDValue getOrCreateExtendedOp(const SDNode *Root, SelectionDAG &DAG,
9027 MVT NarrowVT = getNarrowType(Root);
9036 SDLoc DL(Root);
9037 auto [Mask, VL] = getMaskAndVL(Root);
9053 /// Helper function to get the narrow type for \p Root.
9054 /// The narrow type is the type of \p Root where we divided the size of each
9055 /// element by 2. E.g., if Root's type <2xi16> -> narrow type <2xi8>.
9056 /// \pre The size of the type of the elements of Root must be a multiple of 2
9058 static MVT getNarrowType(const SDNode *Root) {
9122 fillUpExtensionSupport(SDNode *Root, SelectionDAG &DAG) argument
9183 isSupportedRoot(const SDNode *Root) argument
9199 NodeExtensionHelper(SDNode *Root, unsigned OperandIdx, SelectionDAG &DAG) argument
9242 getMaskAndVL(const SDNode *Root) argument
9291 SDNode *Root; member in struct:__anon3065::CombineResult
9297 CombineResult(unsigned TargetOpcode, SDNode *Root, const NodeExtensionHelper &LHS, std::optional<bool> SExtLHS, const NodeExtensionHelper &RHS, std::optional<bool> SExtRHS) argument
9328 canFoldToVWWithSameExtensionImpl(SDNode *Root, const NodeExtensionHelper &LHS, const NodeExtensionHelper &RHS, bool AllowSExt, bool AllowZExt) argument
9354 canFoldToVWWithSameExtension(SDNode *Root, const NodeExtensionHelper &LHS, const NodeExtensionHelper &RHS) argument
9365 canFoldToVW_W(SDNode *Root, const NodeExtensionHelper &LHS, const NodeExtensionHelper &RHS) argument
9390 canFoldToVWWithSEXT(SDNode *Root, const NodeExtensionHelper &LHS, const NodeExtensionHelper &RHS) argument
9401 canFoldToVWWithZEXT(SDNode *Root, const NodeExtensionHelper &LHS, const NodeExtensionHelper &RHS) argument
9412 canFoldToVW_SU(SDNode *Root, const NodeExtensionHelper &LHS, const NodeExtensionHelper &RHS) argument
9423 getSupportedFoldings(const SDNode *Root) argument
9476 SDNode *Root = Worklist.pop_back_val(); local
[all...]
/openbsd-current/gnu/llvm/llvm/lib/Target/M68k/
H A DM68kISelDAGToDAG.cpp185 bool IsProfitableToFold(SDValue N, SDNode *U, SDNode *Root) const override;
322 SDNode *Root) const {
326 if (U == Root) {
/openbsd-current/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGISel.cpp2064 /// findNonImmUse - Return true if "Def" is a predecessor of "Root" via a path
2066 static bool findNonImmUse(SDNode *Root, SDNode *Def, SDNode *ImmedUse, argument
2088 // Initialize worklist to operands of Root.
2089 if (Root != ImmedUse) {
2090 for (const SDValue &Op : Root->op_values()) {
2105 /// operand node N of U during instruction selection that starts at Root.
2107 SDNode *Root) const {
2113 /// U can be folded during instruction selection that starts at Root.
2114 bool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root, argument
2119 // If Root us
[all...]
H A DSelectionDAGBuilder.cpp1074 SDValue Root = DAG.getRoot(); local
1077 return Root;
1081 if (Root.getOpcode() != ISD::EntryToken) {
1085 if (Pending[i].getNode()->getOperand(0) == Root)
1090 Pending.push_back(Root);
1094 Root = Pending[0];
1096 Root = DAG.getTokenFactor(getCurSDLoc(), Pending);
1098 DAG.setRoot(Root);
1100 return Root;
2866 SDValue Root local
4138 SDValue Root; local
4309 SDValue Root = I.isVolatile() ? getRoot() : getMemoryRoot(); local
4586 SDValue Root = DAG.getRoot(); local
5940 SDValue Root = isVol ? getRoot() : getMemoryRoot(); local
5978 SDValue Root = isVol ? getRoot() : getMemoryRoot(); local
5995 SDValue Root = isVol ? getRoot() : getMemoryRoot(); local
6016 SDValue Root = isVol ? getRoot() : getMemoryRoot(); local
8042 SDValue Root; local
8215 SDValue Root = isVol ? getRoot() : getMemoryRoot(); local
[all...]
/openbsd-current/gnu/llvm/llvm/lib/Analysis/
H A DMemorySSA.cpp1149 void MemorySSA::renamePass(DomTreeNode *Root, MemoryAccess *IncomingVal, argument
1152 assert(Root && "Trying to rename accesses in an unreachable block");
1158 bool AlreadyVisited = !Visited.insert(Root->getBlock()).second;
1162 IncomingVal = renameBlock(Root->getBlock(), IncomingVal, RenameAllUses);
1163 renameSuccessorPhis(Root->getBlock(), IncomingVal, RenameAllUses);
1164 WorkStack.push_back({Root, Root->begin(), IncomingVal});

Completed in 542 milliseconds

1234567