| /frameworks/base/core/java/android/view/accessibility/ |
| CaptioningManager.java | 302 /** Edge type value specifying no character edges. */
305 /** Edge type value specifying uniformly outlined character edges. */
308 /** Edge type value specifying drop-shadowed character edges. */
311 /** Edge type value specifying raised bevel character edges. */
314 /** Edge type value specifying depressed bevel character edges. */
|
| /frameworks/support/v4/java/android/support/v4/widget/ |
| ViewDragHelper.java | 85 * Edge flag set indicating all edges should be affected.
205 * Called when one of the subscribed edges in the parent view has been touched
221 * unlocked. The default behavior is to leave edges unlocked.
232 * of the subscribed edges in the parent view while no child view is currently captured.
426 * Enable edge tracking for the selected edges of the parent view.
429 * for edges for which edge tracking has been enabled.
431 * @param edgeFlags Combination of edge flags describing the edges to watch
442 * Return the size of an edge. This is the range in pixels along the edges of this view
[all...] |
| /external/valgrind/coregrind/ |
| m_transtab.c | 107 /* In edges ("to-me") in the graph created by chaining. */
119 /* Out edges ("from-me") in the graph created by chaining. */
137 } edges; member in struct:__anon25740
149 } edges; member in struct:__anon25742
217 backwards and forwards edges in the graph of patched-together
284 edges in the graph are not uniquely determined by a
288 If A has multiple edges to B then B will mention A multiple
511 return VG_(sizeXA)(iea->edges.var);
522 VG_(deleteXA)(iea->edges.var);
523 iea->edges.var = NULL
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| basic-block.h | 180 /* The edges into and out of the block. */
300 /* Number of edges in this flow graph. */
495 /* Number of edges in the compressed edge list. */
574 /* Iterator object for edges. */
683 vector of predecessor or successor edges. It must not be used when
883 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
898 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
913 /* Return the fallthru edge in EDGES if it exists, NULL otherwise. */
915 find_fallthru_edge (vec<edge, va_gc> *edges)
920 FOR_EACH_EDGE (e, ei, edges)
[all...] |
| /external/clang/test/Analysis/ |
| null-deref-path-notes.m | 61 // CHECK-NEXT: <key>edges</key>
124 // CHECK-NEXT: <key>edges</key>
187 // CHECK-NEXT: <key>edges</key>
221 // CHECK-NEXT: <key>edges</key>
333 // CHECK-NEXT: <key>edges</key>
367 // CHECK-NEXT: <key>edges</key>
430 // CHECK-NEXT: <key>edges</key>
464 // CHECK-NEXT: <key>edges</key>
532 // CHECK-NEXT: <key>edges</key>
566 // CHECK-NEXT: <key>edges</key
[all...] |
| cxx-for-range.cpp | 107 // CHECK-NEXT: <key>edges</key>
170 // CHECK-NEXT: <key>edges</key>
204 // CHECK-NEXT: <key>edges</key>
238 // CHECK-NEXT: <key>edges</key>
272 // CHECK-NEXT: <key>edges</key>
306 // CHECK-NEXT: <key>edges</key>
340 // CHECK-NEXT: <key>edges</key>
432 // CHECK-NEXT: <key>edges</key>
466 // CHECK-NEXT: <key>edges</key>
500 // CHECK-NEXT: <key>edges</key
[all...] |
| retain-release.m | [all...] |
| inline-plist.c | 96 // CHECK-NEXT: <key>edges</key>
130 // CHECK-NEXT: <key>edges</key>
193 // CHECK-NEXT: <key>edges</key>
227 // CHECK-NEXT: <key>edges</key>
310 // CHECK-NEXT: <key>edges</key>
416 // CHECK-NEXT: <key>edges</key>
450 // CHECK-NEXT: <key>edges</key>
533 // CHECK-NEXT: <key>edges</key>
596 // CHECK-NEXT: <key>edges</key>
630 // CHECK-NEXT: <key>edges</key
[all...] |
| /external/clang/test/Analysis/inlining/ |
| path-notes.cpp | 308 // CHECK-NEXT: <key>edges</key>
342 // CHECK-NEXT: <key>edges</key>
405 // CHECK-NEXT: <key>edges</key>
467 // CHECK-NEXT: <key>edges</key>
501 // CHECK-NEXT: <key>edges</key>
564 // CHECK-NEXT: <key>edges</key>
641 // CHECK-NEXT: <key>edges</key>
675 // CHECK-NEXT: <key>edges</key>
781 // CHECK-NEXT: <key>edges</key>
[all...] |
| path-notes.m | 184 // CHECK-NEXT: <key>edges</key>
247 // CHECK-NEXT: <key>edges</key>
324 // CHECK-NEXT: <key>edges</key>
358 // CHECK-NEXT: <key>edges</key>
421 // CHECK-NEXT: <key>edges</key>
513 // CHECK-NEXT: <key>edges</key>
596 // CHECK-NEXT: <key>edges</key>
702 // CHECK-NEXT: <key>edges</key>
[all...] |
| /external/clang/test/Analysis/diagnostics/ |
| undef-value-param.c | 102 // CHECK-NEXT: <key>edges</key>
179 // CHECK-NEXT: <key>edges</key>
213 // CHECK-NEXT: <key>edges</key>
276 // CHECK-NEXT: <key>edges</key>
339 // CHECK-NEXT: <key>edges</key>
373 // CHECK-NEXT: <key>edges</key>
456 // CHECK-NEXT: <key>edges</key>
533 // CHECK-NEXT: <key>edges</key>
567 // CHECK-NEXT: <key>edges</key>
630 // CHECK-NEXT: <key>edges</key
[all...] |
| /external/libavc/common/ |
| ih264_deblk_edge_filters.c | 89 /* title "Filtering process for edges for bS equal to 4" in */
209 /* title "Filtering process for edges for bS equal to 4" in */
332 /* title "Filtering process for edges for bS equal to 4" in */
422 /* title "Filtering process for edges for bS equal to 4" in */
521 /* title "Filtering process for edges for bS less than 4" */
637 /* title "Filtering process for edges for bS less than 4" */
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 409 * A vector of vectors of edges, built by calling the addEdge method()
414 pANTLR3_BITSET * edges; member in struct:ANTLR3_TOPO_struct
425 * as a stack and each time we descend a node to one of its edges we
435 * A flag that indicates the algorithm found a cycle in the edges
452 * One more than the largest node index that is contained in edges/sorted.
465 * while building these edges, it is perfectly OK to add nodes out of
466 * sequence. So, if you have edges:
|
| /external/gmock/src/ |
| gmock-matchers.cc | 142 // right nodes. All edges have unit capacity.
149 // following edges:
157 // - The edges (source, l), (l, r), and (r, sink) are added to the
159 // - The same three edges are removed from the residual flow graph.
160 // - The reverse edges (l, source), (r, l), and (sink, r) are added
174 // efficient queries about edges entering or leaving the right-side nodes
206 // Returns the edges of a maximal match, each in the form {left, right}.
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| StringTrieBuilder.java | 207 * Traverses the Node graph and numbers branch edges, with rightmost edges first.
211 * Most branch edges "jump" to other nodes but the rightmost branch edges
217 * This function visits and marks right branch edges first.
218 * Edges are numbered with increasingly negative values because we share the
220 * A branch edge also remembers the first number for any of its edges.
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| StringTrieBuilder.java | 209 * Traverses the Node graph and numbers branch edges, with rightmost edges first.
213 * Most branch edges "jump" to other nodes but the rightmost branch edges
219 * This function visits and marks right branch edges first.
220 * Edges are numbered with increasingly negative values because we share the
222 * A branch edge also remembers the first number for any of its edges.
[all...] |
| /external/libavc/encoder/ |
| ih264e_deblk.c | 138 * @brief Fill BS value for all the edges of an mb
141 * Fill BS value for all the edges of an mb
215 /* BS Calculation for MB Boundary Edges */
241 /* BS Calculation for MB Boundary Edges */
741 /* In slice mode the edges of mbs that lie on the slice boundary are not deblocked */
800 /* Deblock vertical edges */
855 /* Deblock Horizontal edges */
|
| /external/llvm/include/llvm/Analysis/ |
| CallGraph.h | 22 /// 1. All functions in the module without internal linkage will have edges
88 /// \brief This node has edges to all external functions and those internal
92 /// \brief This node has edges to it from all functions making indirect calls
157 /// functions (ie, there are no edges in it's CGN). The easiest way to do
218 /// \brief Removes all edges from this CallGraphNode to any functions it
254 /// \brief Removes all call edges from this node to the specified callee
372 /// functions (ie, there are no edges in it's CGN). The easiest way to do
|
| /external/opencv/cvaux/src/ |
| cvlcm.cpp | 174 // Purpose: Function seeks all non-boundary edges incident to
180 // LinkedEdges : out, matrix of incident edges
183 // for this pSite, this property hold out far all edges)
184 // Returns: number of incident edges (must be less than 10)
329 LCMEdgeSeq = (CvSeq*)(*Graph)->edges;
542 counter < pLCM->VoronoiDiagram->edges->total;
598 cvSetAdd( (CvSet*)(pLCM->Graph->edges), 0, (CvSetElem**)&pLCMEdge );
|
| /frameworks/minikin/tools/ |
| mk_hyb_file.py | 195 edges = Freelist()
202 edge_ix, cursor = edges.next(cursor)
205 all(edges.is_free(ix + s) for s in succ) and
206 ((not use_node) or edges.is_free(ix))):
209 ix, _ = edges.next(0)
219 edges.use(ix)
221 edges.use(ix + s)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setools/ |
| dta.py | 334 # 2. Iterate over all graph edges:
352 # 3. Iterate over all graph edges:
389 # only add edges if they actually
397 # only add edges if they actually
476 # cannot change the edges while iterating over them,
528 # cannot delete the edges while iterating over them
586 # a bit of a hack to make Edges work
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| BugReporter.cpp | 250 /// Remove edges in and out of C++ default initializer expressions. These are
[all...] |
| /external/llvm/lib/IR/ |
| GCOV.cpp | 165 // read edges.
183 Edges.push_back(make_unique<GCOVEdge>(*Blocks[BlockNo], *Blocks[Dst]));
184 GCOVEdge *Edge = Edges.back().get();
307 errs() << "Unexpected number of edges (in " << Name << ").\n";
316 errs() << "Unexpected number of edges (in " << Name << ").\n";
374 /// destination has no outgoing edges, also update that block's count too.
383 /// sortDstEdges - Sort destination edges by block number, nop if already
403 dbgs() << "\tSource Edges : ";
409 dbgs() << "\tDestination Edges : ";
|
| /art/test/482-checker-loop-back-edge-use/src/ |
| Main.java | 94 // 'incoming' must have a use at both back edges.
136 // 'incoming' must have a use at both back edges.
156 // 'incoming' must have a use at both back edges.
|
| /external/bison/src/ |
| ielr.c | 125 edges rather than an array because it is possible that
127 that we could end up with redundant edges. With the
128 possibility of redundant edges, it's hard to know ahead of
242 * follow (that is, it's computed by internal and successor edges) of goto
245 * successor follow edges. \c edge_counts has not been updated.
286 fprintf (stderr, "always follow edges:\n");
346 goto_number **edges; local
351 &edges, &edge_counts);
352 ielr_compute_follow_kernel_items (ritem_sees_lookahead_set, edges,
356 ielr_compute_always_follows (&edges, edge_counts, always_followsp)
[all...] |
