| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| cfghooks.h | 38 /* Redirect edge E to the given basic block B and update underlying program
39 representation. Returns edge representing redirected branch (that may not
41 if edge is not easily redirectable for whatever reason. */
42 edge (*redirect_edge_and_branch) (edge e, basic_block b);
45 newly created forwarder basic block is returned. The edge must
47 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
49 /* Returns true if it is possible to remove the edge by redirecting it
50 to the destination of the other edge going from its source. */
69 /* Predict edge E using PREDICTOR to given PROBABILITY. *
[all...] |
| basic-block.h | 35 /* Control flow edge information. */
37 /* The two blocks at the ends of the edge. */
41 /* Instructions queued on the edge. */
50 /* Location of any goto implicit in the edge. */
53 /* The index number corresponding to this edge in the edge vector
69 /* Masks for edge.flags. */
77 /* Bit mask for all edge flags. */
80 /* The following four flags all indicate something special about an edge.
81 Test the edge flags on EDGE_COMPLEX to detect all forms of "strange
[all...] |
| /external/replicaisland/tools/ |
| ExtractPoints.js | 27 * edge calculation for debugging purposes.
75 var edge = new Object;
77 edge.startX = firstPoint.anchor[0];
78 edge.startY = firstPoint.anchor[1];
80 edge.endX = lastPoint.anchor[0];
81 edge.endY = lastPoint.anchor[1];
83 var normalX = -(edge.endY - edge.startY);
84 var normalY = edge.endX - edge.startX
[all...] |
| /external/opencv3/modules/stitching/include/opencv2/stitching/detail/ |
| util_inl.hpp | 60 std::list<GraphEdge>::const_iterator edge = edges_[i].begin(); local
61 for (; edge != edges_[i].end(); ++edge)
62 body(*edge);
82 std::list<GraphEdge>::const_iterator edge = edges_[vertex].begin(); local
83 for (; edge != edges_[vertex].end(); ++edge)
85 if (!was[edge->to])
87 body(*edge);
88 was[edge->to] = true
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| Match.java | 28 /** the edge of the dragged node that is matched */
31 /** the "other" edge that the dragged edge is matched with */
32 public final Segment edge; field in class:Match
50 * @param edge the "other" edge that the dragged edge is matched with
51 * @param with the edge of the dragged node that is matched
55 public Match(GuidelineHandler handler, Segment edge, Segment with,
59 this.edge = edge
[all...] |
| /external/skia/src/core/ |
| SkEdgeBuilder.cpp | 25 SkEdgeBuilder::Combine SkEdgeBuilder::CombineVertical(const SkEdge* edge, SkEdge* last) {
26 if (last->fCurveCount || last->fDX || edge->fX != last->fX) {
29 if (edge->fWinding == last->fWinding) {
30 if (edge->fLastY + 1 == last->fFirstY) {
31 last->fFirstY = edge->fFirstY;
34 if (edge->fFirstY == last->fLastY + 1) {
35 last->fLastY = edge->fLastY;
40 if (edge->fFirstY == last->fFirstY) {
41 if (edge->fLastY == last->fLastY) {
44 if (edge->fLastY < last->fLastY)
71 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); local
91 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); local
100 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); local
161 SkEdge* edge = reinterpret_cast<SkEdge*>(storage); local
[all...] |
| /build/core/ |
| host_fuzz_test.mk | 6 LOCAL_CFLAGS += -fsanitize-coverage=edge,indirect-calls,8bit-counters,trace-cmp
|
| /dalvik/dx/tests/086-ssa-edge-split/ |
| run | 18 dx --dump --width=1000 --ssa-blocks --ssa-step=edge-split Blort.class
|
| /external/opencv3/samples/cpp/ |
| edge.cpp | 12 Mat image, gray, edge, cedge; variable
17 blur(gray, edge, Size(3,3));
19 // Run the edge detector on grayscale
20 Canny(edge, edge, edgeThresh, edgeThresh*3, 3);
23 image.copyTo(cedge, edge);
24 imshow("Edge map", cedge);
29 printf("\nThis sample demonstrates Canny edge detection\n"
31 " /.edge [image_name -- Default is ../data/fruits.jpg]\n\n");
57 namedWindow("Edge map", 1)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| FASerializer.java | 97 // and then ordered by edge labels then by target state number :)
124 Transition edge = (Transition) s.transition(i); local
125 walkFANormalizingStateNumbers(edge.target); // keep walkin'
128 // to it, but don't "draw" an edge.
129 if ( edge instanceof RuleClosureTransition ) {
130 walkFANormalizingStateNumbers(((RuleClosureTransition) edge).followState);
150 // depth first walk each transition, printing its edge first
152 Transition edge = (Transition) s.transition(i); local
155 if ( edge.isAction() ) {
158 else if ( edge.isEpsilon() )
[all...] |
| /external/opencv3/modules/imgproc/src/ |
| subdivision2d.cpp | 46 int Subdiv2D::nextEdge(int edge) const
48 CV_DbgAssert((size_t)(edge >> 2) < qedges.size());
49 return qedges[edge >> 2].next[edge & 3];
52 int Subdiv2D::rotateEdge(int edge, int rotate) const
54 return (edge & ~3) + ((edge + rotate) & 3);
57 int Subdiv2D::symEdge(int edge) const
59 return edge ^ 2;
62 int Subdiv2D::getEdge(int edge, int nextEdgeType) cons
189 int edge = newEdge(); local
235 int edge = freeQEdge*4; local
288 int edge = recentEdge; local
650 int vertex = 0, edge = 0; local
737 int edge = i; local
772 int edge = rotateEdge(vtx[k].firstEdge, 1), t = edge; local
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setools/ |
| dta.py | 215 edge = Edge(self.subG, source, target)
223 edge.transition,
224 self.__generate_entrypoints(edge),
225 edge.setexec,
226 edge.dyntransition,
227 edge.setcurrent)
248 def __generate_entrypoints(edge):
263 for e in edge.entrypoint:
264 yield entrypoint_output(e, edge.entrypoint[e], edge.execute[e], edge.type_transition[e]
[all...] |
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mips/ |
| 24k-triple-stores-3.s | 17 # edge case
23 # edge case (unaligned)
34 # edge case
40 # edge case (unaligned)
51 # edge case
57 # edge case (unaligned)
69 # edge case
75 # edge case
81 # edge case (unaligned)
|
| /external/opencv3/modules/java/src/ |
| imgproc+Subdiv2D.java | 125 // C++: int getEdge(int edge, int nextEdgeType)
128 //javadoc: Subdiv2D::getEdge(edge, nextEdgeType)
129 public int getEdge(int edge, int nextEdgeType)
132 int retVal = getEdge_0(nativeObj, edge, nextEdgeType);
139 // C++: int nextEdge(int edge)
142 //javadoc: Subdiv2D::nextEdge(edge)
143 public int nextEdge(int edge)
146 int retVal = nextEdge_0(nativeObj, edge);
153 // C++: int rotateEdge(int edge, int rotate)
156 //javadoc: Subdiv2D::rotateEdge(edge, rotate
[all...] |
| /external/v8/src/compiler/ |
| graph-trimmer.cc | 32 for (Edge edge : live->use_edges()) {
33 Node* const user = edge.from();
37 os << "DeadLink: " << *user << "(" << edge.index() << ") -> " << *live
40 edge.UpdateTo(nullptr);
|
| node-properties.cc | 85 bool NodeProperties::IsValueEdge(Edge edge) {
86 Node* const node = edge.from();
87 return IsInputRange(edge, FirstValueIndex(node),
93 bool NodeProperties::IsContextEdge(Edge edge) {
94 Node* const node = edge.from();
95 return IsInputRange(edge, FirstContextIndex(node),
101 bool NodeProperties::IsFrameStateEdge(Edge edge) {
[all...] |
| verifier.h | 15 class Edge;
40 // (effect, control or frame state) to be used as an input for {edge}.
41 static void VerifyEdgeInputReplacement(const Edge& edge,
45 static void VerifyEdgeInputReplacement(const Edge& edge,
|
| /hardware/bsp/intel/peripheral/libmraa/examples/ |
| isr_pin6.c | 51 mraa_gpio_edge_t edge = MRAA_GPIO_EDGE_BOTH; local
53 mraa_gpio_isr(x, edge, &interrupt, NULL);
|
| /external/freetype/src/autofit/ |
| aflatin2.c | 766 /* already on an edge ?, backtrack to find its start */
1109 /* to find an edge in our table that corresponds to its position. */
1111 /* If no edge is found, we create and insert a new edge in the */
1112 /* sorted table. Otherwise, we simply add the segment to the edge's */
1114 /* edge's properties. *
1160 AF_Edge edge = axis->edges + ee; local
1177 AF_Edge edge; local
1232 AF_Edge edge; local
1390 AF_Edge edge = axis->edges; local
1843 AF_Edge edge; local
[all...] |
| /external/skia/src/gpu/ |
| GrTessellator.cpp | 37 * Stages (4) and (5) use an active edge list, which a list of all edges for which the
46 * not exact and may violate the mesh topology or active edge list ordering. We
50 * A) Intersections may cause a shortened edge to no longer be ordered with respect to its
53 * B) Intersections may cause an edge to violate the left-to-right ordering of the
54 * active edge list. This is handled by splitting the neighbour edge on the
56 * C) Shortening an edge may cause an active edge to become inactive or an inactive edge
57 * to become active. This is handled by removing or inserting the edge in the activ
1017 Edge* edge = new_edge(v->fPrev, v, alloc, c); local
[all...] |
| /external/opencv/cvaux/src/ |
| cvsubdiv2.cpp | 59 CvQuadEdge2D* edge = (CvQuadEdge2D*)cvGetSetElem(subdiv->edges,i); local
61 if( edge && CV_IS_SET_ELEM( edge ))
65 CvSubdiv2DEdge e = (CvSubdiv2DEdge)edge + j;
107 draw_subdiv_facet( CvSubdiv2D * subdiv, IplImage * dst, IplImage * src, CvSubdiv2DEdge edge )
109 CvSubdiv2DEdge t = edge;
120 while( t != edge && count < subdiv->quad_edges * 4 );
128 t = edge;
142 CvSubdiv2DPoint *pt = cvSubdiv2DEdgeDst( cvSubdiv2DRotateEdge( edge, 1 ));
173 CvQuadEdge2D *edge = (CvQuadEdge2D *) cvGetSetElem( subdiv->edges, i ) local
[all...] |
| /frameworks/support/v17/tests/src/android/support/v17/leanback/widget/ |
| GridTest.java | 52 public void addItem(Object item, int index, int length, int rowIndex, int edge) {
53 if (edge == Integer.MAX_VALUE || edge == Integer.MIN_VALUE) {
54 // initialize edge for first item added
55 edge = 0;
57 mEdges[index] = edge;
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| Graph.py | 57 raise GraphError("Cannot create edge from %s"%(item,))
88 Adds a directed edge going from head_id to tail_id.
89 Arbitrary data can be attached to the edge via edge_data.
94 :param edge_data: (optional) data attached to the edge
98 edge = self.next_edge
110 self.nodes[tail_id][0].append(edge)
111 self.nodes[head_id][1].append(edge)
115 # store edge information
116 self.edges[edge] = (head_id, tail_id, edge_data)
121 def hide_edge(self, edge)
[all...] |
| /frameworks/support/v17/leanback/src/android/support/v17/leanback/widget/ |
| StaggeredGridDefault.java | 25 * Returns the max edge value of item (visible or cached) in a row. This
33 int edge = mProvider.getEdge(mFirstVisibleIndex); local
35 return edge;
39 edge += loc.offset;
41 return edge;
45 int edge = mProvider.getEdge(mLastVisibleIndex); local
48 return edge + loc.size;
51 edge -= loc.offset;
54 return edge + loc.size;
62 * Returns the min edge value of item (visible or cached) in a row. Thi
70 int edge = mProvider.getEdge(mLastVisibleIndex); local
83 int edge = mProvider.getEdge(mFirstVisibleIndex); local
105 int edge = mProvider.getEdge(indexLimit); local
157 int edge = mProvider.getEdge(indexLimit); local
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
95 void Graph::Node::attach(Node *node, Edge::Type kind)
97 Edge *edge = new Edge(this, node, kind); local
101 edge->next[0] = this->out;
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
356 Graph::Edge *edge; local
[all...] |
