/openbsd-current/gnu/llvm/clang/lib/Tooling/Syntax/ |
H A D | ComputeReplacements.cpp | 21 void enumerateTokenSpans(const syntax::Tree *Root, argument 30 void run(const syntax::Tree *Root) { argument 31 process(Root); 69 return Enumerator(STM, Callback).run(Root);
|
/openbsd-current/gnu/llvm/llvm/include/llvm/Support/ |
H A D | FileCollector.h | 55 /// - a copy of the file inside Root 57 /// current real path -> path to the copy in Root 68 /// as relative paths inside of the Root. 92 /// \p Root is the directory where collected files are will be stored. 94 /// \p Root directory gets created in copyFiles unless it already exists. 95 FileCollector(std::string Root, std::string OverlayRoot); 132 const std::string Root; member in class:llvm::FileCollector
|
H A D | SuffixTree.h | 159 SuffixTreeNode *Root = nullptr; member in class:llvm::SuffixTree 344 iterator begin() { return iterator(Root); }
|
H A D | JSON.h | 252 /// error reporting. (The Path::Root passed in at the top level fromJSON call 634 class Root; 642 Path(Root &R) : Parent(nullptr), Seg(&R) {} 650 /// Exception: the root Path encodes a pointer to the Path::Root. 657 Segment(Root *R) : Pointer(reinterpret_cast<uintptr_t>(R)) {} 668 Root *root() const { return reinterpret_cast<Root *>(Pointer); } 679 class Path::Root { class in class:llvm::json::Path 687 Root(llvm::StringRef Name = "") : Name(Name), ErrorMessage("") {} function in class:llvm::json::Path::Root 689 Root(Roo [all...] |
/openbsd-current/gnu/llvm/llvm/include/llvm/Transforms/IPO/ |
H A D | ProfiledCallGraph.h | 126 iterator begin() { return Root.Edges.begin(); } 127 iterator end() { return Root.Edges.end(); } 128 ProfiledCallGraphNode *getEntryNode() { return &Root; } 134 Root.Edges.emplace(&Root, &ProfiledFunctions[Name], 0); 178 ProfiledCallGraphNode Root; member in class:llvm::sampleprof::ProfiledCallGraph
|
/openbsd-current/gnu/llvm/llvm/lib/CodeGen/ |
H A D | MachineCombiner.cpp | 99 unsigned getLatency(MachineInstr *Root, MachineInstr *NewRoot, 102 improvesCriticalPathLen(MachineBasicBlock *MBB, MachineInstr *Root, 108 bool reduceRegisterPressure(MachineInstr &Root, MachineBasicBlock *MBB, 124 void verifyPatternOrder(MachineBasicBlock *MBB, MachineInstr &Root, 258 /// \param Root is a machine instruction that could be replaced by NewRoot. 265 unsigned MachineCombiner::getLatency(MachineInstr *Root, MachineInstr *NewRoot, argument 283 if (UseMO && BlockTrace.isDepInTrace(*Root, *UseMO)) { 352 MachineInstr &Root, MachineBasicBlock *MBB, 363 /// The DAGCombine code sequence ends in MI (Machine Instruction) Root. 369 MachineBasicBlock *MBB, MachineInstr *Root, 351 reduceRegisterPressure( MachineInstr &Root, MachineBasicBlock *MBB, SmallVectorImpl<MachineInstr *> &InsInstrs, SmallVectorImpl<MachineInstr *> &DelInstrs, MachineCombinerPattern Pattern) argument 368 improvesCriticalPathLen( MachineBasicBlock *MBB, MachineInstr *Root, MachineTraceMetrics::Trace BlockTrace, SmallVectorImpl<MachineInstr *> &InsInstrs, SmallVectorImpl<MachineInstr *> &DelInstrs, DenseMap<unsigned, unsigned> &InstrIdxForVirtReg, MachineCombinerPattern Pattern, bool SlackIsAccurate) argument [all...] |
H A D | GCRootLowering.cpp | 157 for (AllocaInst *Root : Roots) 158 if (!InitedRoots.count(Root)) { 160 ConstantPointerNull::get(cast<PointerType>(Root->getAllocatedType())), 161 Root, Root->getNextNode());
|
H A D | TargetInstrInfo.cpp | 770 // C = B op Y (Root) 787 MachineInstr &Root, SmallVectorImpl<MachineCombinerPattern> &Patterns, 790 if (isReassociationCandidate(Root, Commute)) { 816 const MachineInstr &Root, 818 bool AssocCommutRoot = isAssociativeAndCommutative(Root); 825 assert(Root.getOpcode() == Prev.getOpcode() && "Expected to be equal"); 826 return std::make_pair(Root.getOpcode(), Root.getOpcode()); 833 assert(areOpcodesEqualOrInverse(Root.getOpcode(), Prev.getOpcode()) && 835 unsigned AssocCommutOpcode = Root 786 getMachineCombinerPatterns( MachineInstr &Root, SmallVectorImpl<MachineCombinerPattern> &Patterns, bool DoRegPressureReduce) const argument 815 getReassociationOpcodes(MachineCombinerPattern Pattern, const MachineInstr &Root, const MachineInstr &Prev) const argument 921 reassociateOps( MachineInstr &Root, MachineInstr &Prev, MachineCombinerPattern Pattern, SmallVectorImpl<MachineInstr *> &InsInstrs, SmallVectorImpl<MachineInstr *> &DelInstrs, DenseMap<unsigned, unsigned> &InstrIdxForVirtReg) const argument 1021 genAlternativeCodeSequence( MachineInstr &Root, MachineCombinerPattern Pattern, SmallVectorImpl<MachineInstr *> &InsInstrs, SmallVectorImpl<MachineInstr *> &DelInstrs, DenseMap<unsigned, unsigned> &InstIdxForVirtReg) const argument [all...] |
/openbsd-current/gnu/llvm/llvm/lib/Target/X86/ |
H A D | X86PartialReduction.cpp | 432 // reduction. Root is the Value that is used by the horizontal reduction. 435 static void collectLeaves(Value *Root, SmallVectorImpl<Instruction *> &Leaves) { argument 438 Worklist.push_back(Root); 448 if (!PN->hasNUses(PN == Root ? 2 : 1)) 460 if (BO->hasNUses(BO == Root ? 2 : 1)) { 467 if (BO->hasNUses(BO == Root ? 3 : 2)) { 491 if (!V->hasNUses(I == Root ? 2 : 1)) 523 Value *Root = matchAddReduction(*EE, ReduceInOneBB); local 524 if (!Root) 528 collectLeaves(Root, Leave [all...] |
/openbsd-current/gnu/llvm/llvm/lib/Target/Hexagon/ |
H A D | HexagonCommonGEP.cpp | 123 void getBlockTraversalOrder(BasicBlock *Root, ValueVect &Order); 179 Root = 0x01, enumerator in enum:__anon2830::GepNode::__anon2831 209 if (Flags & Root) 221 if (GN.Flags & GepNode::Root) { 247 if (GN.Flags & GepNode::Root) 324 void HexagonCommonGEP::getBlockTraversalOrder(BasicBlock *Root, argument 330 Order.push_back(Root); 331 for (auto *DTN : children<DomTreeNode*>(DT->getNode(Root))) 354 N->Flags |= GepNode::Root | InBounds; 434 if (N->Flags & GepNode::Root) { 443 nodes_for_root(GepNode *Root, NodeChildrenMap &NCM, NodeSet &Nodes) argument 1158 GepNode *Root = *First, *Last = *First; local [all...] |
/openbsd-current/gnu/llvm/llvm/lib/Target/AArch64/ |
H A D | AArch64InstrInfo.cpp | 5055 static bool getMaddPatterns(MachineInstr &Root, 5057 unsigned Opc = Root.getOpcode(); 5058 MachineBasicBlock &MBB = *Root.getParent(); 5064 int Cmp_NZCV = Root.findRegisterDefOperandIdx(AArch64::NZCV, true); 5068 unsigned NewOpc = convertToNonFlagSettingOpc(Root); 5078 if (canCombineWithMUL(MBB, Root.getOperand(Operand), Opcode, ZeroReg)) { 5085 if (canCombine(MBB, Root.getOperand(Operand), Opcode)) { 5097 assert(Root.getOperand(1).isReg() && Root.getOperand(2).isReg() && 5196 static bool getFMAPatterns(MachineInstr &Root, [all...] |
/openbsd-current/gnu/llvm/llvm/lib/Transforms/Utils/ |
H A D | SplitModule.cpp | 133 if (const GlobalObject *Root = getGVPartitioningRoot(&GV)) 134 if (&GV != Root) 135 GVtoClusterMap.unionSets(&GV, Root); 198 LLVM_DEBUG(dbgs() << "Root[" << CurrentClusterID << "] cluster_size(" 232 if (const GlobalObject *Root = getGVPartitioningRoot(GV)) 233 GV = Root;
|
/openbsd-current/gnu/llvm/llvm/include/llvm/Analysis/ |
H A D | LoopNestAnalysis.h | 32 /// Construct a loop nest rooted by loop \p Root. 33 LoopNest(Loop &Root, ScalarEvolution &SE); 38 static std::unique_ptr<LoopNest> getLoopNest(Loop &Root, ScalarEvolution &SE); 60 /// Return the maximum nesting depth of the loop nest rooted by loop \p Root. 63 /// for(i) // loop at level 1 and Root of the nest 69 static unsigned getMaxPerfectDepth(const Loop &Root, ScalarEvolution &SE); 149 /// for(i) // loop at level 1 and Root of the nest
|
H A D | DDG.h | 42 /// 4. Root node is a special node that connects to all components such that 53 Root, member in class:llvm::DDGNode::NodeKind 95 RootDDGNode() : DDGNode(NodeKind::Root) {} 102 return N->getKind() == NodeKind::Root; 262 : Name(N), DI(DepInfo), Root(nullptr) {} 264 : Name(std::move(G.Name)), DI(std::move(G.DI)), Root(G.Root) {} 272 assert(Root && "Root node is not available yet. Graph construction may " 274 return *Root; 300 NodeType *Root = nullptr; member in class:llvm::DDGEdge::DependenceGraphInfo [all...] |
/openbsd-current/gnu/llvm/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUInstructionSelector.cpp | 3502 AMDGPUInstructionSelector::selectVCSRC(MachineOperand &Root) const { 3504 [=](MachineInstrBuilder &MIB) { MIB.add(Root); } 3510 MachineOperand &Root, bool AllowAbs, bool OpSel) const { 3511 Register Src = Root.getReg(); 3533 Register Src, unsigned Mods, MachineOperand Root, MachineInstr *InsertPt, 3541 Register VGPRSrc = MRI->cloneVirtualRegister(Root.getReg()); 3555 AMDGPUInstructionSelector::selectVSRC0(MachineOperand &Root) const { 3557 [=](MachineInstrBuilder &MIB) { MIB.add(Root); } 3562 AMDGPUInstructionSelector::selectVOP3Mods0(MachineOperand &Root) const { 3565 std::tie(Src, Mods) = selectVOP3ModsImpl(Root); [all...] |
/openbsd-current/gnu/llvm/llvm/lib/Support/ |
H A D | FileCollector.cpp | 52 FileCollector::FileCollector(std::string Root, std::string OverlayRoot) argument 53 : Root(Root), OverlayRoot(OverlayRoot) { 54 assert(sys::path::is_absolute(Root) && "Root not absolute"); 125 SmallString<256> DstPath = StringRef(Root); 179 auto Err = sys::fs::create_directories(Root, /*IgnoreExisting=*/true);
|
/openbsd-current/gnu/llvm/clang/lib/AST/Interp/ |
H A D | InterpBlock.h | 150 DeadBlock(DeadBlock *&Root, Block *Blk); 161 /// Root pointer of the list. 162 DeadBlock *&Root; member in class:clang::interp::final
|
/openbsd-current/gnu/llvm/llvm/lib/Analysis/ |
H A D | LoopNestAnalysis.cpp | 42 LoopNest::LoopNest(Loop &Root, ScalarEvolution &SE) argument 43 : MaxPerfectDepth(getMaxPerfectDepth(Root, SE)) { 44 append_range(Loops, breadth_first(&Root)); 47 std::unique_ptr<LoopNest> LoopNest::getLoopNest(Loop &Root, argument 49 return std::make_unique<LoopNest>(Root, SE); 261 unsigned LoopNest::getMaxPerfectDepth(const Loop &Root, ScalarEvolution &SE) { argument 263 << Root.getName() << "'\n"); 265 const Loop *CurrentLoop = &Root;
|
/openbsd-current/gnu/llvm/clang/lib/ExtractAPI/Serialization/ |
H A D | SymbolGraphSerializer.cpp | 843 Object Root; local 844 serializeObject(Root, "metadata", serializeMetadata()); 845 serializeObject(Root, "module", serializeModule()); 847 Root["symbols"] = std::move(Symbols); 848 Root["relationships"] = std::move(Relationships); 850 return Root; 868 Object Root; 874 serializeObject(Root, "symbolGraph", Serializer.serializeCurrentGraph()); 877 serializeArray(Root, "parentContexts", 907 serializeArray(Root, "relatedSymbol [all...] |
/openbsd-current/gnu/llvm/clang/lib/Analysis/ |
H A D | CallGraph.cpp | 150 Root = getOrInsertNode(nullptr); 212 // Make Root node a parent of all functions to make sure all are reachable. 214 Root->addCallee({Node.get(), /*Call=*/nullptr}); 229 if (N == Root) 237 assert(CI->Callee != Root && "No one can call the root node.");
|
/openbsd-current/gnu/llvm/clang/lib/StaticAnalyzer/Checkers/ |
H A D | LLVMConventionsChecker.cpp | 216 const CXXRecordDecl *Root; member in class:__anon972::ASTFieldVisitor 223 : Root(root), BR(br), Checker(checker) {} 262 os << "AST class '" << Root->getName() << "' has a field '" 287 BR.EmitBasicReport(Root, Checker, "AST node allocates heap memory",
|
/openbsd-current/gnu/llvm/llvm/lib/Target/ARM/ |
H A D | ARMParallelDSP.cpp | 63 Instruction *Root; member in struct:__anon2724::MulCandidate 72 Root(I), LHS(lhs), RHS(rhs) { } 86 Instruction *Root = nullptr; member in class:__anon2724::Reduction 95 Reduction (Instruction *Add) : Root(Add) { } 146 << *Mul0->Root << "\n" 147 << *Mul1->Root << "\n"); 160 Instruction *getRoot() { return Root; } 162 bool is64Bit() const { return Root->getType()->isIntegerTy(64); } 164 Type *getType() const { return Root->getType(); } 182 Root [all...] |
/openbsd-current/gnu/llvm/compiler-rt/lib/xray/ |
H A D | xray_function_call_trie.h | 495 for (const auto Root : getRoots()) { 498 nullptr, NodeIdPairArray(*O.NodeIdPairAllocator), Root->CallCount, 499 Root->CumulativeLocalTime, Root->FId); 510 if (DFSStack.AppendEmplace(Root, NewRoot) == nullptr) 553 for (const auto Root : getRoots()) { 556 [&](const Node *Node) { return Node->FId == Root->FId; }); 560 Root->FId); 569 DFSStack.AppendEmplace(Root, TargetRoot);
|
/openbsd-current/gnu/llvm/llvm/lib/Target/AArch64/GISel/ |
H A D | AArch64InstructionSelector.cpp | 329 ComplexRendererFns selectShiftA_32(const MachineOperand &Root) const; 330 ComplexRendererFns selectShiftB_32(const MachineOperand &Root) const; 331 ComplexRendererFns selectShiftA_64(const MachineOperand &Root) const; 332 ComplexRendererFns selectShiftB_64(const MachineOperand &Root) const; 335 ComplexRendererFns selectArithImmed(MachineOperand &Root) const; 336 ComplexRendererFns selectNegArithImmed(MachineOperand &Root) const; 338 ComplexRendererFns selectAddrModeUnscaled(MachineOperand &Root, 341 ComplexRendererFns selectAddrModeUnscaled8(MachineOperand &Root) const { 342 return selectAddrModeUnscaled(Root, 1); 344 ComplexRendererFns selectAddrModeUnscaled16(MachineOperand &Root) cons 677 getImmedFromMO(const MachineOperand &Root) argument [all...] |
/openbsd-current/gnu/llvm/llvm/lib/Transforms/AggressiveInstCombine/ |
H A D | AggressiveInstCombine.cpp | 173 /// This is used by foldAnyOrAllBitsSet() to capture a source value (Root) and 178 Value *Root = nullptr; member in struct:MaskOps 220 if (!MOps.Root) 221 MOps.Root = Candidate; 229 return MOps.Root == Candidate; 264 Value *And = Builder.CreateAnd(MOps.Root, Mask); 320 Value *Root, *SubOp1; local 322 if (match(AndOp0, m_Sub(m_Value(Root), m_Value(SubOp1))) && 323 match(SubOp1, m_And(m_LShr(m_Specific(Root), m_SpecificInt(1)), 329 I.replaceAllUsesWith(Builder.CreateCall(Func, {Root})); 612 LoadInst *Root = nullptr; member in struct:LoadOps [all...] |