| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/WebKit/ |
| H A D | MemoryUnsafeCastChecker.cpp | 40 static void emitDiagnostics(const BoundNodes &Nodes, BugReporter &BR, in emitDiagnostics()
60 static void emitDiagnosticsUnrelated(const BoundNodes &Nodes, BugReporter &BR, in emitDiagnosticsUnrelated()
83 return Builder->removeBindings([this, &Node](const BoundNodesMap &Nodes) { in AST_MATCHER_P()
|
| /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 | 113 void BalancedPartitioning::bisect(const FunctionNodeRange Nodes, in bisect()
167 void BalancedPartitioning::runIterations(const FunctionNodeRange Nodes, in runIterations()
211 unsigned BalancedPartitioning::runIteration(const FunctionNodeRange Nodes, in runIteration()
304 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/llvm/lib/ProfileData/ |
| H A D | PGOCtxProfWriter.cpp | 195 createNode(std::vector<std::unique_ptr<char[]>> &Nodes, in createNode()
214 createNode(std::vector<std::unique_ptr<char[]>> &Nodes, in createNode()
264 std::vector<std::unique_ptr<char[]>> Nodes; in createCtxProfFromYAML() local
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | IntervalPartition.cpp | 28 std::vector<const Node *> Nodes; member
128 std::vector<const CFGBlock *> Nodes; in fillIntervalNode() local
|
| H A D | ExprMutationAnalyzer.cpp | 250 for (const auto &Nodes : Matches) { in tryEachMatch() local
686 for (const auto &Nodes : Matches) { in findFunctionArgMutation() local
|
| /freebsd/contrib/llvm-project/clang/lib/Tooling/Transformer/ |
| H A D | RewriteRule.cpp | 212 ast_matchers::BoundNodes Nodes; member in __anonefb0af210611::BindingsMatcher
216 explicit BindingsMatcher(ast_matchers::BoundNodes Nodes, in BindingsMatcher()
259 forEachDescendantDynamically(ast_matchers::BoundNodes Nodes, in forEachDescendantDynamically()
272 void registerMatchers(const ast_matchers::BoundNodes &Nodes, in registerMatchers()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | SDNodeInfoEmitter.cpp | 75 static bool haveCompatibleDescriptions(ArrayRef<SDNodeInfo> Nodes) { in haveCompatibleDescriptions()
295 ArrayRef<SDNodeInfo> Nodes, unsigned NameOffset, in emitDesc()
|
| /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/clang/include/clang/AST/ |
| H A D | ParentMapContext.h | 95 ArrayRef<DynTypedNode> Nodes; member
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | CallGraphSCCPass.h | 86 std::vector<CallGraphNode *> Nodes; variable
|
| H A D | LazyCallGraph.h | 422 SmallVector<Node *, 1> Nodes; variable
425 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC()
|
| /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 | 110 SmallPtrSetImpl<const MDNode *> &Nodes) { in collectMDInDomain()
|
| H A D | LazyCallGraph.cpp | 385 SmallVector<Node *> Nodes; in verify() local
1901 void LazyCallGraph::buildSCCs(RefSCC &RC, node_stack_range Nodes) { in buildSCCs()
1922 [this, &RC](node_stack_range Nodes) { in buildSCCs()
1956 [this](node_stack_range Nodes) { in buildRefSCCs()
|
| H A D | CallGraph.cpp | 117 SmallVector<CallGraphNode *, 16> Nodes; in print() local
|
| H A D | DDG.cpp | 89 auto &Nodes = cast<const PiBlockDDGNode>(&N)->getNodes(); in operator <<() 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 | 144 NodeVect Nodes; member in __anon9d81f58e0111::HexagonCommonGEP
424 static void invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, in invert_find_roots()
437 NodeSet &Nodes) { in nodes_for_root()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | Scheduler.h | 122 SchedBundle(ContainerTy &&Nodes) : Nodes(std::move(Nodes)) { in SchedBundle()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 297 NodesType Nodes; variable
|
| H A D | IntervalMap.h | 341 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, in adjustSiblingSizes()
1219 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot() local
1260 const unsigned Nodes = RootBranch::Capacity / Branch::Capacity + 1; in splitRoot() local
2023 unsigned Nodes = 0; in overflow() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | Scheduler.cpp | 115 SchedBundle::ContainerTy Nodes; in createBundle() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | StructurizeCFG.cpp | 146 SmallDenseSet<RegionNode *> *Nodes; member in __anone8c890770111::SubGraphTraits::WrappedSuccIterator
149 WrappedSuccIterator(BaseSuccIterator It, SmallDenseSet<RegionNode *> *Nodes) in WrappedSuccIterator()
425 SmallDenseSet<RegionNode *> Nodes; in INITIALIZE_PASS_DEPENDENCY() local
|