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

12 3 4 5 6 7 8 91011>>

  /external/chromium_org/third_party/skia/src/core/
SkRegion_rects.cpp 46 static void SetFromRect(VEdge edges[], const SkIRect& r) {
47 edges[0].fX = r.fLeft;
48 edges[0].fTop = r.fTop;
49 edges[0].fBottom = r.fBottom;
50 edges[0].fWinding = -1;
52 edges[1].fX = r.fRight;
53 edges[1].fTop = r.fTop;
54 edges[1].fBottom = r.fBottom;
55 edges[1].fWinding = 1;
239 // check if we have no edges
    [all...]
  /external/skia/src/core/
SkRegion_rects.cpp 46 static void SetFromRect(VEdge edges[], const SkIRect& r) {
47 edges[0].fX = r.fLeft;
48 edges[0].fTop = r.fTop;
49 edges[0].fBottom = r.fBottom;
50 edges[0].fWinding = -1;
52 edges[1].fX = r.fRight;
53 edges[1].fTop = r.fTop;
54 edges[1].fBottom = r.fBottom;
55 edges[1].fWinding = 1;
239 // check if we have no edges
    [all...]
  /external/llvm/include/llvm/Analysis/
PathNumbering.h 12 // edges to obtain a DAG, and thus the unique path numbers [Ball96].
14 // The purpose of this analysis is to enumerate the edges in a CFG in order
16 // [Ball96] edges can be enumerated such that given a path number by following
75 // Iterator information for predecessor edges. Includes phony and
81 // Iterator information for successor edges. Includes phony and
108 // Holds the predecessor edges of this node.
111 // Holds the successor edges of this node.
189 // For backedges and split-edges, the phony edge which is linked to the
193 // For backedges and split-edges, the phony edge which is linked to the
202 // An ID to differentiate between those edges which have the same sourc
    [all...]
BranchProbabilityInfo.h 33 /// probabilities of other edges from the block. The probabilites of all edges
36 /// identify an edge, since we can have multiple edges from Src to Dst.
51 /// \brief Get an edge's probability, relative to other out-edges of the Src.
54 /// (0%) and one (100%) of this edge executing, relative to other edges
62 /// It returns the sum of all probabilities for edges from Src to Dst.
66 /// \brief Test if an edge is hot relative to other out-edges of the Src.
111 // Since we allow duplicate edges from one basic block to another, we use
  /external/replicaisland/tools/
ExtractPoints.js 20 * each path in the current document and generates a list of edges and normals
53 // Walk the list of paths and extract edges and normals. Store these in
67 tile.edges = new Array();
111 tile.edges.push(edge);
138 // For each tile print the edges to a string.
142 for (var y = 0; y < tile.edges.length; y++) {
143 var edge = tile.edges[y];
191 // Render the edges and normals to the new document.
195 // draw the edges to make sure everything works
224 for (var y = 0; y < tile.edges.length; y++)
    [all...]
  /external/chromium_org/ash/wm/workspace/
magnetism_matcher.h 33 // care of all edges.
141 // left edge of the target. |secondary_edge| indicates one of the edges along
157 // edges are completely obscured).
162 // |edges| is a bitmask of MagnetismEdges to match against.
163 MagnetismMatcher(const gfx::Rect& bounds, uint32 edges);
175 // Sets |secondary_edge| based on whether the secondary edges should snap.
180 // The edges to match against.
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
RenderBoxModelObject.cpp 2383 BorderEdge edges[4]; local
    [all...]
  /external/llvm/lib/Transforms/Instrumentation/
OptimalEdgeProfiling.cpp 32 STATISTIC(NumEdgesInserted, "The # of edges inserted.");
83 // NumEdges counts all the edges that may be instrumented. Later on its
84 // decided which edges to actually instrument, to achieve optimal profiling.
86 // with no successors an edge (BB,0) is reserved. These edges are necessary
98 // edges!
126 // Instrument all of the edges not in MST...
134 // edges (0,entry) and (BB,0) (for blocks with no successors) and this
135 // edges also participate in the maximum spanning tree calculation.
137 // actual MST is returned but the edges _not_ in the MST.
213 // Check if the number of edges counted at first was the number of edges w
    [all...]
  /external/pixman/pixman/
pixman-vmx.c 179 edges = vec_perm (tmp4, tmp3, dest ## _mask); \
180 tmp3 = vec_perm ((vector unsigned char)v ## dest, edges, store_mask); \
181 tmp1 = vec_perm (edges, (vector unsigned char)v ## dest, store_mask); \
192 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
231 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
287 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
325 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
380 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
416 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
469 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
506 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
560 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
597 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
650 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
688 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
742 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
782 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
841 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
881 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
940 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
980 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1039 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1075 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1131 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1171 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1215 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1258 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1300 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1343 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1387 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1431 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1482 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1530 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1578 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
    [all...]
  /external/chromium_org/third_party/freetype/src/autofit/
aflatin.c 1103 /* Link segments to edges, using feature analysis for selection. */
1260 AF_Edge edges = axis->edges; local
1869 AF_Edge edges = axis->edges; local
    [all...]
  /external/freetype/src/autofit/
aflatin.c 1103 /* Link segments to edges, using feature analysis for selection. */
1260 AF_Edge edges = axis->edges; local
1869 AF_Edge edges = axis->edges; local
    [all...]
  /external/chromium_org/chrome/android/java/res/values/
dimens.xml 16 <!-- The amount to fade the edges of the menu to indicate more content is available
  /external/chromium_org/chrome/browser/resources/options/
certificate_manager.css 15 /* Force tab strip to extend to the left and right edges of the window. */
  /external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/
PolygonShape.cpp 248 Vector<const FloatPolygonEdge*> edges; local
249 if (!polygon.overlappingEdges(y, y, edges))
254 for (unsigned i = 0; i < edges.size(); ++i) {
255 if (computeXIntersection(edges[i], y, intersection) && intersection.type != VertexYBoth)
332 Vector<const FloatPolygonEdge*> edges; local
333 if (!polygon.overlappingEdges(y1, y2, edges))
337 for (unsigned i = 0; i < edges.size(); ++i) {
338 const FloatPolygonEdge *edge = edges[i];
424 Vector<const FloatPolygonEdge*> edges; local
425 if (!polygon.overlappingEdges(rect.y(), rect.maxY(), edges))
    [all...]
  /external/llvm/include/llvm/CodeGen/
EdgeBundles.h 1 //===-------- EdgeBundles.h - Bundles of CFG edges --------------*- c++ -*-===//
10 // The EdgeBundles analysis forms equivalence classes of CFG edges such that all
11 // edges leaving a machine basic block are in the same bundle, and all edges
  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 111 EdgeList edges; member in class:PBQP::Graph
128 assert(findEdge(e.getNode1(), e.getNode2()) == edges.end() &&
131 EdgeItr edgeItr = edges.insert(edges.end(), e);
162 /// This will clear the current graph, erasing any nodes and edges added,
193 /// \brief Get the number of edges in the graph.
194 /// @return Number of edges in the graph.
265 EdgeItr edgesBegin() { return edges.begin(); }
268 EdgeItr edgesEnd() { return edges.end(); }
272 /// @return Begin iterator for the set of edges connected to the given node
    [all...]
  /external/llvm/test/Analysis/Dominators/
2006-10-02-BreakCritEdges.ll 1 ; RUN: opt < %s -domtree -break-crit-edges -analyze -domtree | FileCheck %s
  /external/llvm/test/Transforms/JumpThreading/
degenerate-phi.ll 5 ; "%phi = phi i16" when it removes all edges leading to %unreachable.
  /ndk/tests/device/test-stlport_shared-exception/jni/
reg-stack.cpp 3 // exception edges lost the REG_DEAD note indicating a pop. Which
  /ndk/tests/device/test-stlport_static-exception/jni/
reg-stack.cpp 3 // exception edges lost the REG_DEAD note indicating a pop. Which
  /external/chromium_org/chrome/browser/ui/window_sizer/
window_sizer_gtk.cc 34 // Limit to not overflow the work area right and bottom edges.
39 // Adjust corner to now overflow the work area left and top edges, so
window_sizer_mac.mm 29 // Limit to not overflow the work area right and bottom edges.
36 // Adjust corner to now overflow the work area left and top edges, so
window_sizer_win.cc 27 // Limit to not overflow the work area right and bottom edges.
34 // Adjust corner to now overflow the work area left and top edges, so
  /external/chromium_org/third_party/WebKit/ManualTests/
select-webkit-appearance-off-narrow-select.html 26 <p>The options in this selects should have padding on both the left and the right, the edges of
27 the text should not be pressed against the edges of the opened select.</p>
  /external/chromium_org/tools/telemetry/telemetry/core/heap/
live_heap_object.py 13 edges_to: [RetainingEdge], edges whose end point this LiveHeapObject is.
14 edges_from: [RetainingEdge], edges whose start point this LiveHeapObject is.

Completed in 1695 milliseconds

12 3 4 5 6 7 8 91011>>