HomeSort by relevance Sort by last modified time
    Searched full:edges (Results 101 - 125 of 1319) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/qemu/distrib/jpeg-6b/
transupp.h 55 * image edges are padded out to the next iMCU boundary with junk data; but
56 * no padding is possible at the top and left edges. If we were to flip
65 * right and bottom edges completely cleanly. flip_h can flip partial iMCUs
76 * followed by -rot 180 -trim trims both edges.)
  /external/skia/src/core/
SkEdgeBuilder.h 23 // returns the number of built edges. The array of those edge pointers
  /external/skia/src/pathops/
SkOpSpan.h 23 int fOppValue; // normally 0 -- when binary coincident edges combine, opp value goes here
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/
MoreKeysDetector.java 26 // Top slide allowance is slightly longer (sqrt(2) times) than other edges.
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/
HeapSnapshotLoader.js 167 this._state = "find-edges";
171 case "find-edges": {
172 var edgesToken = "\"edges\"";
184 this._state = "parse-edges";
187 case "parse-edges": {
189 this._progress.updateProgress("Loading edges\u2026 %d\%", this._arrayIndex, this._array.length);
192 this._snapshot.edges = this._array;
  /external/llvm/include/llvm/Transforms/Utils/
BasicBlockUtils.h 79 /// If MergeIdenticalEdges is true (not the default), *all* edges from TI to the
82 /// have many edges to any one destination. This ensures that all edges to that
87 /// IndirectBrInst. Splitting these edges will almost always create an invalid
102 /// false. Otherwise, split all edges between the two blocks and return true.
154 /// complicated to handle the case where one of the edges being split
170 /// case where one of the edges being split is an exit of a loop with other
  /external/llvm/lib/Analysis/
ProfileInfo.cpp 79 // the sum of the edge frequencies from the incoming edges.
313 /// This checks all edges of the function the blocks reside in and replaces the
375 // Generate edges and read current weight.
384 // First count the edges from FristBB to SecondBB, if there is more than
394 // When the edges are merged anyway, then redirect all flow.
398 // We know now how many edges there are from FirstBB to SecondBB, reroute a
421 std::set<Edge> Edges;
426 Edges.insert(old);
429 for (std::set<Edge>::iterator EI = Edges.begin(), EE = Edges.end();
    [all...]
  /external/chromium_org/tools/checkdeps/
graphdeps.py 146 """Computes nodes' and edges' properties for the dependency graph |deps| and
188 edges = []
193 # Edges and nodes are emphasized with color and line/border weight depending
237 edges.append(' "%s" -> "%s" [style=%s,color=%s,penwidth=%d];' % \
249 # Output nodes and edges to |out| (can be a file or a pipe).
250 edges.sort()
256 out.write('\n'.join(edges))
326 help="Include only edges of the graph that match the specified regexp. "
327 "The regexp is applied to edges of the graph formatted as "
  /external/llvm/lib/Transforms/Instrumentation/
PathProfiling.cpp 11 // profiling converts the CFG into a DAG by replacing backedges with edges
14 // Edges are instrumented to increment the path number register, such that the
114 // Sets the target node of this edge. Required to split edges.
178 // Returns an array of phony edges which mark those nodes
187 // instrumentation from the spanning tree edges. Implementation is based
195 // edges are in the spanning tree will not be instrumented, but this
197 // by trying to find hot edges.
208 // Removes phony edges from the successor list of the source, and the
235 BLEdgeVector _treeEdges; // All edges in the spanning tree.
236 BLEdgeVector _chordEdges; // All edges not in the spanning tree
    [all...]
  /external/chromium_org/cc/trees/
layer_sorter.cc 30 // Tests if two edges defined by their endpoints (a,b) and (c,d) intersect.
43 // If denom == 0 then the edges are parallel. While they could be overlapping
114 // Check all the edges of one layer for intersection with the other layer's
115 // edges.
301 DVLOG(2) << "Edges:";
372 // If the layer projections don't intersect, then no edges (dependencies) are
387 // Find all the nodes that don't have incoming edges.
408 // Remove all its outgoing edges from the graph.
425 // If there are still active edges but the list of nodes without incoming
426 // edges is empty then we have run into a cycle. Break the cycle by findin
    [all...]
  /art/compiler/sea_ir/debug/
dot_gen.h 45 // Saves the ssa def->use edges corresponding to @instruction.
54 // (by convention) outgoing edges, so that the composition of theToDot() of all nodes
  /external/chromium/chrome/browser/ui/
window_sizer_linux.cc 119 // Limit to not overflow the work area right and bottom edges.
124 // Adjust corner to now overflow the work area left and top edges, so
window_sizer_win.cc 94 // Limit to not overflow the work area right and bottom edges.
99 // Adjust corner to now overflow the work area left and top edges, so
  /external/chromium_org/chrome/browser/ui/panels/
display_settings_provider_win.cc 144 UINT edges[] = { ABE_BOTTOM }; local
147 views::GetTopmostAutoHideTaskbarForEdge(edges[i], monitor_);
  /external/chromium_org/ui/gfx/
rect_f.h 102 // points", except that we consider points on the right/bottom edges of the
104 // contained within the rect, because they will appear on one of these edges.
  /external/llvm/include/llvm/Analysis/
CFG.h 45 /// Return true if the specified edge is a critical edge. Critical edges are
46 /// edges from a block with multiple successors to a block with multiple
  /external/qemu/distrib/sdl-1.2.15/docs/html/
sdlsetcliprect.html 133 clipped to the edges of the surface so that the clip rectangle for a
134 surface can never fall outside the edges of the surface.</P
  /frameworks/base/graphics/java/android/graphics/
Insets.java 21 * edges of a Rectangle. By convention, positive values move edges towards the
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/
Match.java 34 /** the signed distance between the matched edges */
53 * @param delta the signed distance between the matched edges
  /external/antlr/antlr-3.4/runtime/C/vsrulefiles/
antlr3lexer.rules 127 DisplayName="Collapse Edges"
130 Description="Collapse incident edges into DFA states"
170 DisplayName="Max DFA Edges"
173 Description="Maximum &quot;comfortable&quot; number of edges for single DFA state"
antlr3lexerandparser.rules 128 DisplayName="Collapse Edges"
131 Description="Collapse incident edges into DFA states"
172 DisplayName="Max DFA Edges"
175 Description="Maximum &quot;comfortable&quot; number of edges for single DFA state"
antlr3parser.rules 127 DisplayName="Collapse Edges"
130 Description="Collapse incident edges into DFA states"
172 DisplayName="Max DFA Edges"
175 Description="Maximum &quot;comfortable&quot; number of edges for single DFA state"
antlr3treeparser.rules 127 DisplayName="Collapse Edges"
130 Description="Collapse incident edges into DFA states"
172 DisplayName="Max DFA Edges"
175 Description="Maximum &quot;comfortable&quot; number of edges for single DFA state"
  /external/bison/src/
print_graph.c 135 | Output in graph_obstack edges specifications in incidence with |
174 | edges. |
189 /* Output the edges. */
202 /* Output nodes and edges. */
  /external/chromium_org/ash/wm/
resize_shadow_controller.h 26 // a resize handle visual effect when the cursor is near the edges.

Completed in 852 milliseconds

1 2 3 45 6 7 8 91011>>