| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| omxVCM4P10_DeblockChroma_I.c | 43 * Performs in-place deblocking filtering on all edges of the chroma
64 * for vertical edges and then horizontal edges); valid in the
|
| omxVCM4P10_DeblockLuma_I.c | 45 * vertical edges of a luma macroblock (16x16).
65 * order for vertical edges and then horizontal edges; valid in the
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| tree-inline.h | 26 /* Indicate the desired behavior wrt call graph edges. We can either
28 parallelization), or move the edges of the clones (saving). */
88 /* What to do with call graph edges. */
|
| /system/update_engine/payload_generator/ |
| graph_utils.cc | 94 // For each node N in graph, drop all edges N->|index|.
97 // edges in the graph.
135 LOG(INFO) << " out edges:";
|
| /external/clang/test/Analysis/ |
| objc-radar17039661.m | 69 // CHECK: <key>edges</key>
146 // CHECK: <key>edges</key>
180 // CHECK: <key>edges</key>
257 // CHECK: <key>edges</key>
334 // CHECK: <key>edges</key>
368 // CHECK: <key>edges</key>
431 // CHECK: <key>edges</key>
465 // CHECK: <key>edges</key>
528 // CHECK: <key>edges</key>
605 // CHECK: <key>edges</key
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/ |
| GraphvizGrapher.java | 51 private final List<GraphvizEdge> edges = Lists.newArrayList(); field in class:GraphvizGrapher
66 edges.clear();
84 for (GraphvizEdge edge : edges) {
299 edges.add(gedge);
319 edges.add(gedge);
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineDominators.h | 50 /// \brief Pile up all the critical edges to be split.
62 /// \brief Apply all the recorded critical edges to the DT.
227 /// \note Do not use this method with regular edges.
231 /// interface between two edges splitting. In other words, they have to
232 /// pack the splitting of critical edges as much as possible.
|
| /external/llvm/test/CodeGen/X86/ |
| switch-edge-weight.ll | 31 ; Check if weights are correctly assigned to edges generated from switch
99 ; Check if weights are correctly assigned to edges generated from switch
160 ; Check if weights are correctly assigned to edges generated from switch
213 ; Check if weights are correctly assigned to edges generated from switch
270 ; Check if weights are correctly assigned to edges generated from switch
|
| /external/skia/gm/ |
| concavepaths.cpp | 83 // Collinear edges
284 // Coincident edges (big ones first, coincident vert on top).
298 // Coincident edges (small ones first, coincident vert on top).
312 // Coincident edges (small ones first, coincident vert on bottom).
326 // Coincident edges (big ones first, coincident vert on bottom).
|
| /frameworks/support/v7/gridlayout/res/values/ |
| attrs.xml | 43 causes alignment to take place between the edges of the view.
173 Additional option that can be set to have the top and/or bottom edges of
176 edge, a bottom gravity will clip the top edge, and neither will clip both edges.
180 Additional option that can be set to have the left and/or right edges of
183 edge, a right gravity will clip the left edge, and neither will clip both edges.
|
| /prebuilts/sdk/current/support/v7/gridlayout/res/values/ |
| attrs.xml | 43 causes alignment to take place between the edges of the view.
173 Additional option that can be set to have the top and/or bottom edges of
176 edge, a bottom gravity will clip the top edge, and neither will clip both edges.
180 Additional option that can be set to have the left and/or right edges of
183 edge, a right gravity will clip the left edge, and neither will clip both edges.
|
| /sdk/testapps/gridlayoutTest/v7-gridlayout/res/values/ |
| attrs.xml | 43 causes alignment to take place between the edges of the view.
178 Additional option that can be set to have the top and/or bottom edges of
181 edge, a bottom gravity will clip the top edge, and neither will clip both edges.
185 Additional option that can be set to have the left and/or right edges of
188 edge, a right gravity will clip the left edge, and neither will clip both edges.
|
| /external/ceres-solver/internal/ceres/ |
| visibility_based_preconditioner.cc | 156 // forest. The set of edges in this forest are the cluster pairs.
165 // edges are the number of 3D points/e_blocks visible in both the
243 // pairs/edges, including self edges, the check can be reduced to
367 // all the cells in the preconditioner corresponding to the edges in
382 // belong to the edges of the degree-2 forest. In the CLUSTER_JACOBI
398 // to edges in the degree-2 forest are off diagonal entries of this
498 // Convert a graph into a list of edges that includes self edges for
507 // Add all the cluster pairs corresponding to the edges in th
[all...] |
| graph_algorithms.h | 81 // vertices that have no edges connecting them. The maximum
266 // empty edge set. We then iterate over the edges of G in decreasing
275 // Array of edges sorted in decreasing order of their weights.
283 // Sort of the edges in the graph in decreasing order of their
309 // edge>. Sorting it using the reverse iterators gives us the edges
310 // in decreasing order of edges.
313 // Greedily add edges to the spanning tree/forest as long as they do
|
| /external/opencv3/modules/core/doc/ |
| intro.markdown | 140 Mat frame, edges;
141 namedWindow("edges",1);
145 cvtColor(frame, edges, COLOR_BGR2GRAY);
146 GaussianBlur(edges, edges, Size(7,7), 1.5, 1.5);
147 Canny(edges, edges, 0, 30, 3);
148 imshow("edges", edges);
155 the bit-depth is known to the video capturing module. The array edges is automatically allocated b
[all...] |
| /external/opencv3/modules/cudaimgproc/src/cuda/ |
| generalized_hough.cu | 64 __global__ void buildEdgePointList(const PtrStepSzb edges, const PtrStep<T> dx, const PtrStep<T> dy,
79 if (y < edges.rows)
82 const uchar* edgesRow = edges.ptr(y);
86 for (int i = 0, xx = x; i < PIXELS_PER_THREAD && xx < edges.cols; ++i, xx += blockDim.x)
139 int buildEdgePointList_gpu(PtrStepSzb edges, PtrStepSzb dx, PtrStepSzb dy, unsigned int* coordList, float* thetaList)
149 const dim3 grid(divUp(edges.cols, block.x * PIXELS_PER_THREAD), divUp(edges.rows, block.y));
153 buildEdgePointList<T, PIXELS_PER_THREAD><<<grid, block>>>(edges, (PtrStepSz<T>) dx, (PtrStepSz<T>) dy, coordList, thetaList);
164 template int buildEdgePointList_gpu<short>(PtrStepSzb edges, PtrStepSzb dx, PtrStepSzb dy, unsigned int* coordList, float* thetaList);
165 template int buildEdgePointList_gpu<int>(PtrStepSzb edges, PtrStepSzb dx, PtrStepSzb dy, unsigned int* coordList, float* thetaList)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| DOTGenerator.java | 109 * states and edges attributes.
150 dot.add("edges", st);
157 * states and edges attributes. We know this is an NFA
158 * for a rule so don't traverse edges to other rules and
222 dot.add("edges", edgeST);
239 dot.add("edges", edgeST);
295 // look for gated predicates; don't add gated to simple sempred edges
|
| /external/icu/icu4c/source/common/unicode/ |
| stringtriebuilder.h | 199 * Traverses the Node graph and numbers branch edges, with rightmost edges first.
203 * Most branch edges "jump" to other nodes but the rightmost branch edges
209 * This function visits and marks right branch edges first.
210 * Edges are numbered with increasingly negative values because we share the
212 * A branch edge also remembers the first number for any of its edges.
|
| /external/llvm/lib/IR/ |
| Dominators.cpp | 144 // edges, the callers can normally handle them more efficiently.
146 "This function is not efficient in handling multiple edges");
195 // edges, the callers can normally handle them more efficiently.
197 "This function is not efficient in handling multiple edges");
221 // their operands on edges; simulate this by thinking of the use
237 // Invoke instructions define their return values on the edges to their normal
274 // PHI nodes use their operands on their incoming edges.
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 2417 pANTLR3_BITSET edges; local
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/pprof/internal/report/ |
| report.go | 375 // Print outgoing edges.
434 // Print incoming edges.
452 // Print outgoing edges.
498 var edges edgeList
506 // Collect outgoing edges.
508 edges = append(edges, e)
511 // Sort edges by frequency as a hint to the graph layout engine.
512 sort.Sort(edges)
513 for _, e := range edges {
[all...] |
| /prebuilts/go/linux-x86/src/cmd/pprof/internal/report/ |
| report.go | 375 // Print outgoing edges.
434 // Print incoming edges.
452 // Print outgoing edges.
498 var edges edgeList
506 // Collect outgoing edges.
508 edges = append(edges, e)
511 // Sort edges by frequency as a hint to the graph layout engine.
512 sort.Sort(edges)
513 for _, e := range edges {
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 16 /// edges in this call graph that do not correspond to a 'call' or 'invoke'
59 /// With the edges of this graph, the motivating constraint that we are
78 /// both the direct call edges and any direct call edges that might be formed
83 /// edges for functions. Walking "up" the graph can be done by looking at all
302 /// This removes an inter-SCC edge. All inter-SCC edges originating from
339 /// where V is the number of nodes in this SCC and E is the number of edges
340 /// leaving the nodes in this SCC. Note that E includes both edges within
341 /// this SCC and edges from this SCC to child SCCs. Some effort has been
342 /// made to minimize the overhead of common cases such as self-edges an
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 12 // to records the edges between blocks that run and emit a complementary "gcda"
97 // Modify the program to track transitions along edges and call into the
112 // pred block number for certain non-trivial edges.
241 // function, number of lines belonging to each block, and a set of edges to
288 // Only allow copy before edges and lines have been added. After that,
289 // there are inter-block pointers (eg: edges) that won't take kindly to
309 // set of blocks and a map of edges between blocks. This is the only GCOV
389 // Emit edges between blocks.
586 unsigned Edges = 0;
590 ++Edges;
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/ |
| ActionScript.stg | 818 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
820 <edges; separator="\nelse ">
837 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
839 <edges; separator="\nelse ">
848 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
850 <edges; separator="\nelse "><\n>
852 <if(!edges)>
853 alt<decisionNumber>=<eotPredictsAlt>; <! if no edges, don't gen ELSE !>
880 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
882 <edges; separator="\n"
[all...] |
