/openbsd-current/gnu/llvm/llvm/lib/Target/AArch64/ |
H A D | AArch64ISelDAGToDAG.cpp | 365 bool SelectAddrModeIndexedSVE(SDNode *Root, SDValue N, SDValue &Base, 5757 /// Root. If such EVT cannot be retrived, it returns an invalid EVT. 5758 static EVT getMemVTFromNode(LLVMContext &Ctx, SDNode *Root) { argument 5759 if (isa<MemSDNode>(Root)) 5760 return cast<MemSDNode>(Root)->getMemoryVT(); 5762 if (isa<MemIntrinsicSDNode>(Root)) 5763 return cast<MemIntrinsicSDNode>(Root)->getMemoryVT(); 5765 const unsigned Opcode = Root->getOpcode(); 5773 return cast<VTSDNode>(Root->getOperand(3))->getVT(); 5775 return cast<VTSDNode>(Root 5819 SelectAddrModeIndexedSVE(SDNode *Root, SDValue N, SDValue &Base, SDValue &OffImm) argument [all...] |
/openbsd-current/gnu/llvm/llvm/lib/Transforms/Scalar/ |
H A D | SimpleLoopUnswitch.cpp | 151 collectHomogenousInstGraphLoopInvariants(const Loop &L, Instruction &Root, argument 153 assert(!L.isLoopInvariant(&Root) && 157 bool IsRootAnd = match(&Root, m_LogicalAnd()); 158 bool IsRootOr = match(&Root, m_LogicalOr()); 163 Worklist.push_back(&Root); 164 Visited.insert(&Root);
|
H A D | LowerMatrixIntrinsics.cpp | 2251 sumOpInfos(Value *Root, SmallPtrSetImpl<Value *> &ReusedExprs, argument 2254 if (!ExprsInSubprogram.count(Root)) 2258 if (!ReusedExprs.insert(Root).second) 2264 auto I = Shared.find(Root); 2265 auto CM = Inst2Matrix.find(Root); 2271 for (Value *Op : cast<Instruction>(Root)->operand_values()) {
|
H A D | GVNHoist.cpp | 378 auto Root = PDT->getNode(nullptr); local 379 if (!Root) 382 for (auto *Node : depth_first(Root)) {
|
H A D | NewGVN.cpp | 193 if (Root.lookup(Start) == 0) 207 Root[I] = ++DFSNum; 212 if (Root.lookup(Op) == 0) 215 Root[I] = std::min(Root.lookup(I), Root.lookup(Op)); 222 if (Root.lookup(I) == OurDFS) { 231 while (!Stack.empty() && Root.lookup(Stack.back()) >= OurDFS) { 247 DenseMap<const Value *, unsigned int> Root; member in struct:__anon3521::TarjanSCC
|
H A D | GVN.cpp | 2266 /// dominated by 'Root'. Exploit this, for example by replacing 'LHS' with 2269 /// value starting from the end of Root.Start. 2271 const BasicBlockEdge &Root, 2277 // DT->dominates(Root, Root.getEnd()); 2278 const bool RootDominatesEnd = isOnlyReachableViaThisEdge(Root, DT); 2323 addToLeaderTable(LVN, RHS, Root.getEnd()); 2326 // LHS always has at least one use that is not dominated by Root, this will 2331 ? replaceDominatedUsesWith(LHS, RHS, *DT, Root) 2332 : replaceDominatedUsesWith(LHS, RHS, *DT, Root [all...] |
H A D | TailRecursionElimination.cpp | 108 void walk(Value *Root) { 120 AddUsesToWorklist(Root);
|
H A D | IndVarSimplify.cpp | 763 /// OnPathTo if Root produced a posion result. Note that this doesn't say 764 /// anything about whether OnPathTo is actually executed or whether Root is 765 /// actually poison. This can be used to assess whether a new use of Root can 769 static bool mustExecuteUBIfPoisonOnPathTo(Instruction *Root, argument 772 // Basic approach is to assume Root is poison, propagate poison forward 781 Worklist.push_back(Root); 791 if (I != Root && !any_of(I->operands(), [&KnownPoison](const Use &U) {
|
/openbsd-current/gnu/llvm/llvm/tools/sancov/ |
H A D | sancov.cpp | 385 yaml::Node *Root = DI->getRoot(); local 386 failIf(!Root, "expecting root node: " + InputFile); 387 yaml::MappingNode *Top = dyn_cast<yaml::MappingNode>(Root);
|
/openbsd-current/sys/stand/efi/include/ |
H A D | efiprot.h | 167 OUT struct _EFI_FILE_HANDLE **Root
|
/openbsd-current/gnu/llvm/clang/lib/Lex/ |
H A D | HeaderSearch.cpp | 1511 const DirectoryEntry *Root, 1548 if (*Dir == Root) 1614 const FileEntry *File, const DirectoryEntry *Root, Module *RequestingModule, 1618 hasModuleMap(File->getName(), Root, IsSystemHeaderDir); 1510 hasModuleMap(StringRef FileName, const DirectoryEntry *Root, bool IsSystem) argument 1613 findUsableModuleForHeader( const FileEntry *File, const DirectoryEntry *Root, Module *RequestingModule, ModuleMap::KnownHeader *SuggestedModule, bool IsSystemHeaderDir) argument
|
/openbsd-current/gnu/llvm/llvm/include/llvm/Transforms/Scalar/ |
H A D | GVN.h | 362 bool propagateEquality(Value *LHS, Value *RHS, const BasicBlockEdge &Root,
|
/openbsd-current/gnu/llvm/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineInternal.h | 694 [[nodiscard]] std::optional<Result> run(Value *Root); 702 /// Attempt to negate \p Root. Retuns nullptr if negation can't be performed, 704 [[nodiscard]] static Value *Negate(bool LHSIsZero, Value *Root,
|
/openbsd-current/gnu/llvm/llvm/utils/TableGen/GlobalISel/ |
H A D | GIMatchTree.cpp | 364 GIMatchDagInstr *Root = local 366 Leaf.declareInstr(Root, NewInstrID);
|
/openbsd-current/gnu/llvm/llvm/utils/TableGen/ |
H A D | GICombinerEmitter.cpp | 892 for (const auto &Root : enumerate(Rule->getMatchDag().roots())) { 893 TreeBuilder.addLeaf(Rule->getName(), Root.index(), Rule->getMatchDag(),
|
/openbsd-current/gnu/llvm/lldb/source/Core/ |
H A D | FormatEntity.cpp | 262 "<root>", EntryType::Root, g_top_level_entries); 291 entry.type = Entry::Type::Root; 306 ENUM_TO_CSTR(Root); 1161 case Entry::Type::Root: 1953 if (parent->type == FormatEntity::Entry::Type::Root)
|
/openbsd-current/gnu/llvm/llvm/lib/Target/AArch64/GISel/ |
H A D | AArch64LegalizerInfo.cpp | 1157 static void matchLDPSTPAddrMode(Register Root, Register &Base, int &Offset, argument 1159 Base = Root; 1164 if (mi_match(Root, MRI, m_GPtrAdd(m_Reg(NewBase), m_ICst(NewOffset))) &&
|
/openbsd-current/gnu/llvm/llvm/tools/bugpoint/ |
H A D | CrashDebugger.cpp | 272 GlobalObject *Root = Alias.getAliaseeObject(); local 273 auto *F = dyn_cast<Function>(Root); 278 } else if (Root->isNullValue()) {
|
/openbsd-current/gnu/llvm/lldb/source/Target/ |
H A D | Trace.cpp | 123 json::Path::Root root("traceBundle");
|
/openbsd-current/gnu/llvm/llvm/include/llvm/CodeGen/GlobalISel/ |
H A D | CombinerHelper.h | 810 /// \param [in] Root - The search root. 814 findCandidatesForLoadOrCombine(const MachineInstr *Root) const;
|
/openbsd-current/gnu/llvm/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCOpts.cpp | 1467 Value *Root = GetRCIdentityRoot(Retain->getOperand(0)); local 1471 ReleaseInsertPtToRCIdentityRoots[InsertPt].insert(Root); 1501 for (const auto *Root : *Roots) { 1502 TopDownPtrState &S = MyStates.getPtrTopDownState(Root);
|
/openbsd-current/gnu/llvm/llvm/include/llvm/IR/ |
H A D | ModuleSummaryIndex.h | 1811 std::unique_ptr<GlobalValueSummary> Root = local 1814 G.SummaryList.push_back(std::move(Root));
|
/openbsd-current/gnu/llvm/llvm/lib/DebugInfo/LogicalView/Readers/ |
H A D | LVELFReader.cpp | 942 traverseDieAndChildren(CUDie, Root, SkeletonDie); 1244 void LVELFReader::sortScopes() { Root->sort(); }
|
/openbsd-current/gnu/llvm/llvm/include/llvm/CodeGen/ |
H A D | SelectionDAG.h | 252 SDValue Root; member in class:llvm::SelectionDAG 547 const SDValue &getRoot() const { return Root; } 561 Root = N; 564 return Root; 759 SDValue getEHLabel(const SDLoc &dl, SDValue Root, MCSymbol *Label); 760 SDValue getLabelNode(unsigned Opcode, const SDLoc &dl, SDValue Root,
|
/openbsd-current/gnu/llvm/llvm/lib/Transforms/Utils/ |
H A D | Local.cpp | 2813 const RootType &Root, 2819 if (!Dominates(Root, U)) 2846 const BasicBlockEdge &Root) { 2847 auto Dominates = [&DT](const BasicBlockEdge &Root, const Use &U) { 2848 return DT.dominates(Root, U); 2850 return ::replaceDominatedUsesWith(From, To, Root, Dominates);
|