| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 1 //===- GCOVProfiling.cpp - Insert edge counters for gcov profiling --------===//
517 unsigned Edge = 0;
526 Edge);
532 Builder.getInt64(Edge),
533 Builder.getInt64(Edge + 1));
546 Edge += Successors;
625 // the whole-Module pred edge# between the time we set it and the time we next
638 unsigned Edge = 0;
647 Edge + i);
652 Edge += Successors
[all...] |
| /frameworks/base/core/java/android/widget/ |
| GridView.java | 599 // ... and its bottom edge
604 // This is how far the bottom edge of the last view is from the bottom of the
638 // ... and its top edge
647 // This is how far the top edge of the first view is from the top of the
737 * @param fadingEdgeLength Length of the fading edge in pixels, if present
756 * @param fadingEdgeLength Length of the fading edge in pixels, if present
771 * fading edge (if necessary).
800 * fading edge (if necessary).
[all...] |
| /external/llvm/lib/Analysis/ |
| LazyValueInfo.cpp | 392 /// value for the specified Value* that is true on the specified edge.
396 /// edge from PredBB to OldSucc has been threaded to be from PredBB to
777 /// \brief Compute the value of Val on the edge BBFrom -> BBTo. Returns false if
778 /// Val is not constrained on the edge.
841 // If the edge was formed by a switch on the value, then we may know exactly
868 /// \brief Compute the value of Val on the edge BBFrom -> BBTo, or the value at
869 /// the basic block if the edge does not constraint Val.
891 // Try to intersect ranges of the BB and the constraint on the edge.
907 // if we couldn't compute the value on the edge, use the value from the BB
926 DEBUG(dbgs() << "LVI Getting edge value " << *V << " from '
[all...] |
| /system/media/camera/docs/ |
| metadata_model.py | 47 parent: An edge to a parent Node.
196 parent: An edge to the parent Node. This is always None for Metadata.
589 parent: An edge to the parent, which is always the Metadata root node.
623 parent: An edge to the parent, which is always the Metadata root node.
652 parent: An edge to the parent, which is always the Metadata root node.
673 parent: An edge to the parent, which is always an OuterNamespace instance.
768 parent: An edge to the parent, which is always a Section instance.
868 parent: An edge to the parent, which is an InnerNamespace or a Kind.
948 parent: An edge to the parent, always an Enum instance.
977 parent: An edge to the parent, always an Entry instance
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 424 * A vector used to detect cycles in the edge dependecies. It is used
463 * A method that adds an edge from one node to another. An edge
475 void (*addEdge) (struct ANTLR3_TOPO_struct * topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency);
481 * is only as large as the largest node index you created an edge for. This means
482 * that if you had an input of 32 nodes, but that largest node with an edge
496 * on the previously supplied edge data.
|
| /external/chromium/chrome/browser/ui/views/frame/ |
| app_panel_browser_frame_view.cc | 34 // 16 px at the end of each edge triggers diagonal resizing.
39 // The titlebar has a 2 px 3D edge along the bottom, and we reserve 2 px (1 for
310 // space above the icon, since the 3D edge (+ client edge, for restored
399 // The bottom of the titlebar actually comes from the top of the Client Edge
400 // graphic, with the actual client edge clipped off the bottom.
498 // on the title from overlapping the 3D edge at the bottom of the titlebar.
|
| /external/chromium_org/chrome/browser/ui/views/frame/ |
| app_panel_browser_frame_view.cc | 36 // 16 px at the end of each edge triggers diagonal resizing.
41 // The titlebar has a 2 px 3D edge along the bottom, and we reserve 2 px (1 for
305 // space above the icon, since the 3D edge (+ client edge, for restored
402 // The bottom of the titlebar actually comes from the top of the Client Edge
403 // graphic, with the actual client edge clipped off the bottom.
502 // on the title from overlapping the 3D edge at the bottom of the titlebar.
|
| /external/chromium_org/v8/src/ |
| heap-snapshot-generator.cc | 85 HeapGraphEdge edge(type, name, this->index(), entry->index());
86 snapshot_->edges().Add(edge);
94 HeapGraphEdge edge(type, index, this->index(), entry->index());
95 snapshot_->edges().Add(edge);
127 HeapGraphEdge& edge = *ch[i]; local
131 switch (edge.type()) {
134 edge_name = edge.name();
137 OS::SNPrintF(index, "%d", edge.index());
141 edge_name = edge.name();
144 edge_name = edge.name()
291 HeapGraphEdge* edge = &edges()[i]; local
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocPBQP.cpp | 276 PBQP::Graph::EdgeItr edge = local
280 addInterferenceCosts(g.getEdgeCosts(edge), vr1Allowed, vr2Allowed, tri);
375 PBQP::Graph::EdgeItr edge = g.findEdge(node1, node2); local
376 if (edge == g.edgesEnd()) {
377 edge = g.addEdge(node1, node2, PBQP::Matrix(allowed1->size() + 1,
381 if (g.getEdgeNode1(edge) == node2) {
387 addVirtRegCoalesce(g.getEdgeCosts(edge), *allowed1, *allowed2,
|
| CriticalAntiDepBreaker.cpp | 129 // Find the predecessor edge with the greatest depth.
135 // In the case of a latency tie, prefer an anti-dependency edge over
486 // fix that remaining critical edge too. This is a little more involved,
513 // edge per instruction. Note that we'd have to be able to break all of
517 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) {
518 const SUnit *NextSU = Edge->getSUnit();
521 if (Edge->getKind() == SDep::Anti) {
522 AntiDepReg = Edge->getReg();
610 DEBUG(dbgs() << "Breaking anti-dependence edge on "
|
| /external/protobuf/gtest/test/ |
| gtest-param-test_test.cc | 171 // Edge case. Tests that Range() generates the single element sequence
179 // Edge case. Tests that Range() with generates empty sequence when
293 // Edge case. Tests that ValuesIn() with an array parameter containing a
328 // Edge case. Tests that ValuesIn() provided with an iterator range specifying a
340 // Edge case. Tests that ValuesIn() provided with an empty iterator range
384 // Edge case test. Tests that single-parameter Values() generates the sequence
494 // Edge case. Tests that combine works with the maximum number
|
| /frameworks/base/core/java/android/view/ |
| ViewConfiguration.java | 127 * Inset in dips to look for touchable content when the user touches the edge of the screen
206 * Max distance in dips to overscroll for edge effects
211 * Max distance in dips to overfling for edge effects
477 * @return Inset in dips to look for touchable content when the user touches the edge of the
488 * @return Inset in pixels to look for touchable content when the user touches the edge of the
639 * @return The maximum distance a View should overscroll by when showing edge effects (in
647 * @return The maximum distance a View should overfling by when showing edge effects (in
|
| /frameworks/ex/carousel/java/com/android/ex/carousel/ |
| CarouselController.java | 390 * @param loffx an optional offset to apply to the line (in pixels) from left edge of card
770 * @param x The number of pixels from the left edge that the event occurred
771 * @param y The number of pixels from the top edge that the event occurred
780 * @param x The number of pixels from the left edge that the event occurred
781 * @param y The number of pixels from the top edge that the event occurred
797 * @param x The number of pixels from the left edge that the event occurred
798 * @param y The number of pixels from the top edge that the event occurred
|
| /packages/apps/Gallery/src/com/android/camera/ |
| CropImage.java | 631 int edge = hv.getHit(event.getX(), event.getY()); local
632 if (edge != HighlightView.GROW_NONE) {
657 int edge = hv.getHit(event.getX(), event.getY()); local
658 if (edge != HighlightView.GROW_NONE) {
659 mMotionEdge = edge;
664 (edge == HighlightView.MOVE)
709 // the edge of the screen causes scrolling but it means
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| Keyboard.java | 68 /** Edge of left */
71 /** Edge of right */
74 /** Edge of top */
77 /** Edge of bottom */
178 * Edge flags for this row of keys. Possible values that can be assigned are
438 * @return whether or not the point falls inside the key. If the key is attached to an edge,
439 * it will assume that all points between the key and the edge are considered to be inside
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DecisionProbe.java | 77 * alternative's left edge. Though, later, we may find that predicates
155 /** Used while finding a path through an NFA whose edge labels match
763 /** Given a start state and a final state, find a list of edge labels
779 // pick the first edge in states as the one to traverse
786 labels.add(t.label); // traverse edge and track label
832 // pick the first edge whose target is in states and whose
854 continue; // look at the next edge
[all...] |
| /frameworks/base/packages/Keyguard/src/com/android/keyguard/ |
| SlidingChallengeLayout.java | 50 // The drag handle is measured in dp above & below the top edge of the
222 * @param challengeTop Position of the top edge of the challenge view in px in the
389 * Animate the bottom edge of the challenge view to the given position.
391 * @param y desired final position for the bottom edge of the challenge view in px
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/ |
| GridLayoutConverter.java | 576 * The left edge of the view to be used for placement
578 * @return the left edge x coordinate
585 * The top edge of the view to be used for placement
587 * @return the top edge y coordinate
594 * The right edge of the view to be used for placement
596 * @return the right edge x coordinate
603 * The bottom edge of the view to be used for placement
605 * @return the bottom edge y coordinate
812 // See if this view shares the edge with the removed
[all...] |
| /bootable/recovery/minzip/ |
| Hash.c | 206 break; /* edge case - single-entry table */
277 break; /* edge case - single-entry table */
341 break; /* edge case - single-entry table */
|
| /dalvik/vm/ |
| Hash.cpp | 201 break; /* edge case - single-entry table */
272 break; /* edge case - single-entry table */
372 break; /* edge case - single-entry table */
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| DFA.cs | 43 * Any state that has a semantic predicate edge is special; those states
124 // eot[s]>=0 indicates that an EOT edge goes to another
132 // which assumed here that the EOT edge always
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| DFA.cs | 44 * Any state that has a semantic predicate edge is special; those states
148 // eot[s]>=0 indicates that an EOT edge goes to another
157 // which assumed here that the EOT edge always
|
| /external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/ |
| rhino-python.extensions | 41 Here the "b" token on the left edge signals that a DEDENT is needed
113 at a non left edge.
165 cpos = -1; // pretend EOF always happens at left edge
|
| /external/chromium/chrome/browser/ui/cocoa/bookmarks/ |
| bookmark_bar_folder_controller.h | 80 // top and/or bottom edge of the screen in order to support mouse tracking
82 // window must be inset a bit from the edge of the screen for aesthetics;
129 // Precalculated sum of left and right edge padding of buttons in a
|
| /external/chromium_org/chrome/browser/ui/cocoa/browser/ |
| avatar_button_controller.mm | 36 // Space between the avatar label and the left edge of the container containing
44 // Space between the right edge of the avatar label and the right edge of the
|
