HomeSort by relevance Sort by last modified time
    Searched refs:NumNodes (Results 1 - 8 of 8) sorted by null

  /external/llvm/lib/Support/
FoldingSet.cpp 230 NumNodes = 0;
243 NumNodes = 0;
255 NumNodes = 0;
310 if (NumNodes+1 > NumBuckets*2) {
316 ++NumNodes;
342 --NumNodes;
  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 269 /// NumNodes - The number of nodes in the graph.
270 unsigned NumNodes;
319 bool empty() const { return NumNodes == 0; }
320 unsigned size() const { return NumNodes; }
  /external/clang/lib/StaticAnalyzer/Core/
ExplodedGraph.cpp 51 : NumNodes(0), ReclaimNodeInterval(0) {}
171 --NumNodes;
324 ++NumNodes;
  /external/llvm/include/llvm/ADT/
FoldingSet.h 121 /// NumNodes - Number of nodes in the folding set. Growth occurs when NumNodes
123 unsigned NumNodes;
178 unsigned size() const { return NumNodes; }
181 bool empty() const { return NumNodes == 0; }
  /external/llvm/utils/TableGen/
DAGISelMatcher.h 874 EmitMergeInputChainsMatcher(const unsigned *nodes, unsigned NumNodes)
875 : Matcher(EmitMergeInputChains), ChainNodes(nodes, nodes+NumNodes) {}
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGFast.cpp 774 unsigned NumNodes = Sequence.size();
775 for (unsigned i = 0; i != NumNodes; ++i) {
776 SDNode *N = Sequence[NumNodes-i-1];
ScheduleDAGSDNodes.cpp 310 unsigned NumNodes = 0;
314 ++NumNodes;
322 SUnits.reserve(NumNodes * 2);
    [all...]
SelectionDAGISel.cpp     [all...]

Completed in 501 milliseconds