HomeSort by relevance Sort by last modified time
    Searched full:graphs (Results 51 - 75 of 330) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/llvm/include/llvm/Analysis/
DOTGraphTraitsPass.h 1 //===-- DOTGraphTraitsPass.h - Print/View dotty graphs-----------*- C++ -*-===//
10 // Templates to create dotty viewer and printer passes for GraphTraits graphs.
IntervalIterator.h 12 // following types of graphs:
173 // graphs: a basic block graph, or a preexisting interval graph.
198 // graphs: a basic block graph, or a preexisting interval graph.
  /external/svox/pico/lib/
picoktab.h 71 /* Graphs type and functions */
80 /* return kb graphs for usage in PU */
  /external/testng/src/test/java/test/
GraphTest.java 133 // predecessors in certain kinds of graphs where many nodes have the
143 // takes a few milliseconds. In practice, with larger graphs, the former
  /external/v8/src/compiler/
osr.h 10 // TurboFan structures OSR graphs in a way that separates almost all phases of
17 // Graphs built for OSR from the AstGraphBuilder are structured as follows:
node.h 33 // A Node is the basic primitive of graphs. Nodes are chained together by
35 // which specific applications of graphs and nodes can use to index auxiliary
238 // Saving space for big graphs is important. We use a memory layout trick to
  /external/v8/tools/unittests/
run_perf_test.py 154 "graphs": [suite, trace["name"]],
248 "graphs": ["test", "Richards"],
252 "graphs": ["test", "Sub", "Leaf"],
256 "graphs": ["test", "DeltaBlue"],
370 "graphs": ["test", "Infra", "Constant1"],
374 "graphs": ["test", "Infra", "Constant2"],
378 "graphs": ["test", "Infra", "Constant3"],
382 "graphs": ["test", "Infra", "Constant4"],
  /external/webrtc/webrtc/test/testsupport/
perf_test.h 32 // A typical post-processing step would be to produce graphs of the data
105 // Prints memory commit charge stats for use by perf graphs.
  /external/llvm/include/llvm/IR/
CFG.h 1 //===- CFG.h - Process LLVM structures as graphs ----------------*- C++ -*-===//
11 // BasicBlock graphs to be treated as proper graphs for generic algorithms.
150 // GraphTraits specializations for basic block graphs (CFGs)
217 // GraphTraits specializations for function basic block graphs (CFGs)
  /external/llvm/include/llvm/Support/
GraphWriter.h 11 // LLVM graphs to ".dot" files. "dot" is a tool that is part of the AT&T
16 // Graphs do not need to implement any interface past what is already required
18 // of the DOTGraphTraits template if they want to customize the graphs output in
  /external/autotest/frontend/client/src/autotest/tko/
Plot.java 47 * callbacks in place for drilldown functionality from graphs.
  /external/chromium-trace/catapult/dashboard/docs/
deploy-checklist.md 34 with the selected alerts and their graphs.
  /external/chromium-trace/catapult/third_party/flot/
CONTRIBUTING.md 10 [forum](http://groups.google.com/group/flot-graphs) first, and confirm that
  /external/llvm/docs/
CMakeLists.txt 60 "Use svg instead of png files for doxygen graphs." OFF)
  /external/llvm/include/llvm/ADT/
DAGDeltaAlgorithm.h 18 /// directed acyclic graphs using a predicate function.
  /external/llvm/include/llvm/CodeGen/PBQP/
CostAllocator.h 13 // matrices). Since PBQP graphs can grow very large (E.g. hundreds of thousands
  /external/llvm/lib/CodeGen/
EdgeBundles.cpp 25 cl::desc("Pop up a window to show edge bundle graphs"));
  /external/llvm/unittests/ADT/
SCCIteratorTest.cpp 137 // size of our graphs.
247 // create graphs for which every node has a self-edge.
252 /// Enumerate all graphs using NUM_GRAPHS bits.
253 static_assert(NUM_GRAPHS < sizeof(unsigned) * CHAR_BIT, "Too many graphs!");
  /external/testng/src/main/java/org/testng/internal/thread/graph/
GraphThreadPoolExecutor.java 25 /** Set to true if you want to generate GraphViz graphs */
  /external/webrtc/webrtc/tools/loopback_test/
stat_tracker.js 13 // and simplify plugging them into graphs later.
  /external/chromium-trace/catapult/telemetry/third_party/altgraph/
PKG-INFO 11 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
115 - ``altgraph.Graph.forw_topo_sort`` failed for some sparse graphs.
  /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph.egg-info/
PKG-INFO 11 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
115 - ``altgraph.Graph.forw_topo_sort`` failed for some sparse graphs.
  /external/clang/docs/analyzer/
DebugChecks.rst 33 - debug.ViewExplodedGraph: Show the Exploded Graphs generated for the
36 that these graphs may grow very large, even for small functions.
  /external/autotest/client/tests/iozone/
postprocessing.py 6 graphs. The graph generation functionality depends on gnuplot, and if it
333 Plots graphs based on the results of an IOzone run.
335 Plots graphs based on the results of an IOzone run. Uses gnuplot to
336 generate the graphs.
450 Plot all graphs that are to be plotted, provided that we have gnuplot.
480 "iozone-graphs-%s" % time.strftime('%Y-%m-%d-%H.%M.%S'))
  /external/libchrome/sandbox/linux/bpf_dsl/
codegen_unittest.cc 24 // control flow graphs, and efficiently identifying equivalent graphs.
252 // CompileAndCompare: the serialized graphs from the program and its compiled

Completed in 1653 milliseconds

1 23 4 5 6 7 8 91011>>