| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | OSObjectCStyleCast.cpp | 40 return Builder->removeBindings([this, &Node](const BoundNodesMap &Nodes) { in AST_MATCHER_P()
51 static void emitDiagnostics(const BoundNodes &Nodes, in emitDiagnostics()
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | BalancedPartitioning.cpp | 112 void BalancedPartitioning::bisect(const FunctionNodeRange Nodes, in bisect()
165 void BalancedPartitioning::runIterations(const FunctionNodeRange Nodes, in runIterations()
208 unsigned BalancedPartitioning::runIteration(const FunctionNodeRange Nodes, in runIteration()
301 void BalancedPartitioning::split(const FunctionNodeRange Nodes, in split()
|
| H A D | IntervalMap.cpp | 120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, in distribute()
|
| /freebsd/contrib/llvm-project/clang/lib/Tooling/Transformer/ |
| H A D | RewriteRule.cpp | 213 ast_matchers::BoundNodes Nodes; member in __anonefb0af210611::BindingsMatcher
217 explicit BindingsMatcher(ast_matchers::BoundNodes Nodes, in BindingsMatcher()
260 forEachDescendantDynamically(ast_matchers::BoundNodes Nodes, in forEachDescendantDynamically()
273 void registerMatchers(const ast_matchers::BoundNodes &Nodes, in registerMatchers()
|
| /freebsd/contrib/llvm-project/clang/include/clang/ASTMatchers/ |
| H A D | ASTMatchFinder.h | 81 const BoundNodes Nodes; member
297 SmallVector<BoundNodes, 1> Nodes; variable
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | CallGraphSCCPass.h | 90 std::vector<CallGraphNode *> Nodes; variable
|
| H A D | LazyCallGraph.h | 424 SmallVector<Node *, 1> Nodes; variable
427 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC()
|
| /freebsd/contrib/llvm-project/clang/include/clang/AST/ |
| H A D | ParentMapContext.h | 95 ArrayRef<DynTypedNode> Nodes; member
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| H A D | CGProfile.cpp | 33 std::vector<Metadata *> Nodes; in addModuleFlags() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ScopedNoAliasAA.cpp | 111 collectMDInDomain(const MDNode * List,const MDNode * Domain,SmallPtrSetImpl<const MDNode * > & Nodes) collectMDInDomain() argument
|
| H A D | LazyCallGraph.cpp | 383 SmallVector<Node *> Nodes; in verify() local
1899 void LazyCallGraph::buildSCCs(RefSCC &RC, node_stack_range Nodes) { in buildSCCs()
1920 [this, &RC](node_stack_range Nodes) { in buildSCCs()
1954 [this](node_stack_range Nodes) { in buildRefSCCs()
|
| H A D | DDG.cpp | 89 auto &Nodes = cast<const PiBlockDDGNode>(&N)->getNodes(); in operator <<() local
|
| H A D | CallGraph.cpp | 119 SmallVector<CallGraphNode *, 16> Nodes; in print() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | RDFDeadCode.cpp | 180 bool DeadCodeElimination::erase(const SetVector<NodeId> &Nodes) { in erase()
|
| H A D | HexagonCommonGEP.cpp | 151 NodeVect Nodes; member in __anon9d81f58e0111::HexagonCommonGEP
431 static void invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, in invert_find_roots()
444 NodeSet &Nodes) { in nodes_for_root()
|
| H A D | HexagonConstExtenders.cpp | 147 SmallVector<Node*,8> Nodes; in nodesWith() local
153 SmallVector<Node*,8> Nodes; in ~RangeTree() local
1340 SmallVector<RangeTree::Node*,8> Nodes; in assignInits() local
1344 uint8_t Align, uint8_t Offset) { in assignInits()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | StructurizeCFG.cpp | 108 SmallDenseSet<RegionNode *> *Nodes; member in __anone8c890770111::SubGraphTraits::WrappedSuccIterator
111 WrappedSuccIterator(BaseSuccIterator It, SmallDenseSet<RegionNode *> *Nodes) in WrappedSuccIterator()
385 SmallDenseSet<RegionNode *> Nodes; in INITIALIZE_PASS_DEPENDENCY() local
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 297 NodesType Nodes; variable
|
| H A D | IntervalMap.h | 340 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, in adjustSiblingSizes() argument
1218 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; branchRoot() local
1259 const unsigned Nodes = RootBranch::Capacity / Branch::Capacity + 1; splitRoot() local
2022 unsigned Nodes = 0; overflow() local
[all...] |
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | ExprMutationAnalyzer.cpp | 194 for (const auto &Nodes : Matches) { in tryEachMatch() local
635 for (const auto &Nodes : Matches) { in findFunctionArgMutation() local
|
| /freebsd/contrib/llvm-project/llvm/lib/ProfileData/ |
| H A D | ItaniumManglingCanonicalizer.cpp | 87 llvm::FoldingSet<NodeHeader> Nodes; member in __anonef03fe500111::FoldingNodeAllocator
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/profile/ |
| H A D | InstrProfilingValue.c | 308 ValueProfNode **Nodes = (ValueProfNode **)Data->Values; initializeValueProfRuntimeRecord() local
|
| /freebsd/contrib/llvm-project/clang/lib/Tooling/ |
| H A D | JSONCompilationDatabase.cpp | 298 const std::vector<llvm::yaml::ScalarNode *> &Nodes) { in nodeToCommandLine()
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-mca/Views/ |
| H A D | BottleneckAnalysis.h | 233 SmallVector<DGNode, 16> Nodes; variable
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | ScheduleDAG.cpp | 608 std::vector<int> Nodes; in GetSubGraph() local
|