| /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
|
| /packages/services/Car/car_product/overlay/frameworks/base/packages/SystemUI/res/values/ |
| styles.xml | 6 so the icon does not press along the edges of the dialog. -->
|
| /external/llvm/include/llvm/Analysis/ |
| BranchProbabilityInfo.h | 34 /// probabilities of other edges from the block. The probabilites of all edges
37 /// identify an edge, since we can have multiple edges from Src to Dst.
49 /// \brief Get an edge's probability, relative to other out-edges of the Src.
52 /// (0%) and one (100%) of this edge executing, relative to other edges
60 /// It returns the sum of all probabilities for edges from Src to Dst.
67 /// \brief Test if an edge is hot relative to other out-edges of the Src.
126 // Since we allow duplicate edges from one basic block to another, we use
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| CFGMST.h | 40 // Store all the edges in CFG. It may contain some stale edges
82 // Traverse the CFG using a stack. Find all the edges and assign the weight.
83 // Edges with large weight will be put into MST first so they are less likely
131 // Sort CFG edges based on its weight.
140 // Traverse all the edges and compute the Minimum Weight Spanning Tree
144 // This works around the insufficient support of critical edges split
176 OS << " Number of Edges: " << AllEdges.size()
|
| /external/llvm/test/Analysis/LazyCallGraph/ |
| non-leaf-intrinsics.ll | 11 ; CHECK: Call edges in function: calls_statepoint
20 ; CHECK: Call edges in function: calls_patchpoint
|
| basic.ll | 6 ; CHECK-LABEL: Call edges in function: f
13 ; A bunch more functions just to make it easier to test several call edges at once.
54 ; CHECK-LABEL: Call edges in function: test0
67 ; CHECK-LABEL: Call edges in function: test1
111 ; CHECK-LABEL: Call edges in function: test2
|
| /external/opencv3/doc/py_tutorials/py_imgproc/ |
| py_table_of_contents_imgproc.markdown | 31 to find image gradients, edges etc.
36 to find edges with Canny Edge Detection
|
| /art/compiler/optimizing/ |
| linearize_test.cc | 56 // Structure of this graph (+ are back edges)
81 // Structure of this graph (+ are back edges)
106 // Structure of this graph (+ are back edges)
133 /* Structure of this graph (+ are back edges)
163 /* Structure of this graph (+ are back edges)
219 // Structure of this graph (+ are back edges)
|
| /external/opencv3/modules/shape/src/ |
| emdL1_def.hpp | 122 cvEMDEdgeArray2D m_EdgesRight; // all edges to right
123 cvEMDEdgeArray2D m_EdgesUp; // all edges to upward
125 std::vector<cvEMDEdgeArray2D> m_3dEdgesRight; // all edges to right, 3D
126 std::vector<cvEMDEdgeArray2D> m_3dEdgesUp; // all edges to upward, 3D
127 std::vector<cvEMDEdgeArray2D> m_3dEdgesDeep; // all edges to deep, 3D
128 std::vector<cvPEmdEdge> m_NBVEdges; // pointers to all NON-BV edges
|
| /frameworks/support/v17/leanback/src/android/support/v17/leanback/util/ |
| StateMachine.java | 179 // S: Set of all nodes with no incoming edges
181 HashMap<State, ArrayList<State>> edges = new HashMap<State, ArrayList<State>>(); local
185 edges.put(state, new ArrayList<State>(state.mPriorStates));
197 edges.entrySet().iterator(); iterator.hasNext();) {
204 // insert the toState to S if it has no more incoming edges
211 if (edges.size() > 0) {
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 116 /// *all* edges from TI to the specified successor will be merged into the same
118 /// instructions, which may have many edges to any one destination. This
119 /// ensures that all edges to that dest go to one block instead of each going
124 /// IndirectBrInst. Splitting these edges will almost always create an invalid
141 /// false. Otherwise, split all edges between the two blocks and return true.
174 // SplitAllCriticalEdges - Loop over all of the edges in the CFG,
175 // breaking critical edges as they are found.
176 // Returns the number of broken edges.
205 /// (because it's complicated to handle the case where one of the edges being
223 /// (because it's complicated to handle the case where one of the edges bein
[all...] |
| /external/opencv3/modules/imgproc/src/ |
| gcgraph.hpp | 78 std::vector<Edge> edges; member in class:GCGraph
100 edges.reserve( edgeCount + 2 );
121 if( !edges.size() )
122 edges.resize( 2 );
128 vtcs[i].first = (int)edges.size();
129 edges.push_back( fromI );
134 vtcs[j].first = (int)edges.size();
135 edges.push_back( toI );
160 Edge *edgePtr = &edges[0];
261 // modify weights of the edges along the path and collect orphan
[all...] |
| /external/llvm/docs/HistoricalNotes/ |
| 2003-06-25-Reoptimizer1.txt | 7 back-edges and insert llvm_first_trigger() function call which takes
30 How do we keep track of which edges to instrument, and which edges are
34 region and mark reachable edges.
37 region IGNORING back edges, and mark the edges which are reachable in
41 3) Mark BBs which end in edges that exit the hot region; we need to
|
| /external/v8/src/compiler/ |
| control-equivalence.h | 41 // the following iterations over control edges of the graph:
106 // traversal, edges towards the representative nodes are preferred.
110 // | - Mid-visit: After all edges out of N2 in direction D have
112 // | edges out of N1 now, and we call VisitMid(N).
113 // x N2 - Post-visit: After all edges out of N1 in direction opposite
116 // This will yield a true spanning tree (without cross or forward edges) and
117 // also discover proper back edges in both directions.
|
| /external/freetype/src/autofit/ |
| aflatin2.c | 1107 /* We will begin by generating a sorted table of edges for the */
1230 AF_Edge edges = axis->edges; local
1841 AF_Edge edges = axis->edges; local
[all...] |
| /system/core/libpixelflinger/ |
| trap.cpp | 32 // enable to see triangles edges
650 triangle_dump_edges( Edge* edges,
654 for ( ; count > 0; count--, edges++ )
655 edge_dump( edges );
663 Edge* edges,
672 Edge* edge = edges + *pcount;
728 // sort the edges horizontally
765 Edge edges[3]; local
770 edge_setup( edges, &num_edges, v0, v1, ymin, ymax );
771 edge_setup( edges, &num_edges, v0, v2, ymin, ymax )
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| DefaultEdgeCreator.java | 43 List<Edge> edges = Lists.newArrayList(); local
46 edges.addAll(binding.acceptTargetVisitor(visitor));
48 return edges;
52 * {@link BindingTargetVisitor} that adds edges to the graph based on the visited {@link Binding}.
62 * edges
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.h | 24 /// Edges between SUnits are initially based on edges in the SelectionDAG,
25 /// and additional edges can be added by the schedulers as heuristics.
33 /// edges. Physical register dependence information is not carried in
158 /// ForceUnitLatencies - Return true if all scheduling edges should be given
|
| /external/llvm/test/Transforms/GCOVProfiling/ |
| return-block.ll | 67 ; There should be no destination edges for the exit block.
69 ; RETURN-LAST: Destination Edges
70 ; RETURN-SECOND-NOT: Destination Edges
73 ; RETURN-LAST-NOT: Destination Edges
74 ; RETURN-SECOND: Destination Edges
|
| /external/opencv/cvaux/src/ |
| cvsubdiv2.cpp | 47 int i, j, total = subdiv->edges->total;
59 CvQuadEdge2D* edge = (CvQuadEdge2D*)cvGetSetElem(subdiv->edges,i);
114 // count number of edges in facet
166 int i, total = subdiv->edges->total;
173 CvQuadEdge2D *edge = (CvQuadEdge2D *) cvGetSetElem( subdiv->edges, i );
|
| /packages/services/Telephony/res/values/ |
| dimens.xml | 28 <!-- Padding at the left and right edges of the "call banner". -->
30 <!-- Padding at the top and bottom edges of the "call banner". -->
33 <!-- Padding at the top and bottom edges of the "provider information" -->
53 <!-- Padding at the left and right edges of the incall_touch_ui button
55 buttons to be very close to the edges of the screen, due to the
|
| /external/opencv/cv/src/ |
| cvstereogc.cpp | 134 static int64 icvGCMaxFlow( GCVtx* vtx, int nvtx, GCEdge* edges, GCVtx**& _orphans, int& _maxOrphans )
179 for( ei = v->first; ei != 0; ei = edges[ei].next )
181 if( edges[ei^vt].weight == 0 )
183 u = edges[ei].dst;
224 min_weight = edges[e0].weight;
229 for( v = edges[e0^k].dst;; v = edges[ei].dst )
233 weight = edges[ei^k].weight;
242 // modify weights of the edges along the path and collect orphans
243 edges[e0].weight -= min_weight
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 189 EdgeVector Edges;
203 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
204 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
226 Edges[EId] = std::move(E);
228 EId = Edges.size();
229 Edges.push_back(std::move(E));
281 : CurEId(CurEId), EndEId(G.Edges.size()), FreeEdgeIds(G.FreeEdgeIds) {
321 EdgeItr end() const { return EdgeItr(G.Edges.size(), G); }
322 bool empty() const { return G.Edges.empty(); }
324 return G.Edges.size() - G.FreeEdgeIds.size()
[all...] |
| /external/libvpx/libvpx/vp9/common/ |
| vp9_pred_common.c | 52 if (has_above && has_left) { // both edges available
75 if (has_above && has_left) { // both edges available
81 // one of two edges uses comp pred (2/3)
85 // one of two edges uses comp pred (2/3)
88 else // both edges use comp pred (4)
99 } else { // no edges available (1)
122 if (above_in_image && left_in_image) { // both edges available
181 } else { // no edges available (2)
199 if (has_above && has_left) { // both edges available
247 } else { // no edges availabl
[all...] |
