| /frameworks/rs/driver/runtime/ |
| rs_cl.c | [all...] |
| /external/chromium_org/chrome/browser/ui/gtk/apps/ |
| native_app_window_gtk.cc | 473 bool NativeAppWindowGtk::GetWindowEdge(int x, int y, GdkWindowEdge* edge) {
480 return gtk_window_util::GetWindowEdge(bounds_.size(), 0, x, y, edge);
498 GdkWindowEdge edge;
500 static_cast<int>(event->y), &edge);
503 new_cursor = gtk_window_util::GdkWindowEdgeToGdkCursorType(edge);
525 GdkWindowEdge edge; local
528 bool has_hit_edge = resizable_ && GetWindowEdge(point.x(), point.y(), &edge);
541 gtk_window_begin_resize_drag(window_, edge, event->button,
|
| native_app_window_gtk.h | 92 // returns true and sets |edge| to the appropriate GdkWindowEdge value.
94 bool GetWindowEdge(int x, int y, GdkWindowEdge* edge);
|
| /external/chromium/chrome/browser/ui/ |
| window_sizer.h | 136 // The edge of the screen to check for out-of-bounds.
137 enum Edge { TOP, LEFT, BOTTOM, RIGHT };
160 // Returns true if the specified position is "offscreen" for the given edge,
161 // meaning that it's outside all work areas in the direction of that edge.
162 bool PositionIsOffscreen(int position, Edge edge) const;
|
| /external/chromium_org/chrome/common/extensions/docs/examples/api/downloads/download_manager/ |
| background.js | 77 var edge = ctx.canvas.width-ctx.lineWidth;
80 ctx.lineTo(edge, edge);
81 ctx.lineTo(s*55, edge);
83 ctx.lineTo(edge, edge);
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| HeapSnapshotGridNodes.js | 535 WebInspector.HeapSnapshotObjectNode = function(tree, isFromBaseSnapshot, edge, parentGridNode)
537 WebInspector.HeapSnapshotGenericObjectNode.call(this, tree, edge.node);
538 this._referenceName = edge.name;
539 this._referenceType = edge.type;
540 this._distance = edge.distance;
581 _childHashForEntity: function(edge)
583 var prefix = this.showRetainingEdges ? edge.node.id + "#" : "";
584 return prefix + edge.type + "#" + edge.name;
680 _childHashForEntity: function(edge)
[all...] |
| /external/llvm/lib/Analysis/ |
| ProfileInfoLoaderPass.cpp | 42 std::set<Edge> SpanningTree;
61 // recurseBasicBlock() - Calculates the edge weights for as much basic
64 virtual void readEdgeOrRemember(Edge, Edge&, unsigned &, double &);
65 virtual void readEdge(ProfileInfo::Edge, std::vector<unsigned>&);
97 void LoaderPass::readEdgeOrRemember(Edge edge, Edge &tocalc,
100 if ((w = getEdgeWeight(edge)) == MissingValue) {
101 tocalc = edge;
[all...] |
| /hardware/samsung_slsi/exynos5/libcamera2/ |
| MetadataConverter.cpp | 417 dst->ctl.edge.mode = PROCESSING_MODE_FAST;
418 dst->ctl.edge.strength = 0;
436 dst->ctl.edge.mode = PROCESSING_MODE_FAST;
437 dst->ctl.edge.strength = 0;
455 dst->ctl.edge.mode = PROCESSING_MODE_FAST;
456 dst->ctl.edge.strength = 0;
473 dst->ctl.edge.mode = PROCESSING_MODE_FAST;
474 dst->ctl.edge.strength = 0;
488 dst->ctl.edge.mode = PROCESSING_MODE_OFF;
489 dst->ctl.edge.strength = 0
[all...] |
| /external/chromium/chrome/browser/ui/gtk/ |
| browser_window_gtk.cc | 119 // the 16 px at the end of each edge triggers diagonal resizing.
220 GdkCursorType GdkWindowEdgeToGdkCursorType(GdkWindowEdge edge) {
221 switch (edge) {
2028 GdkWindowEdge edge; local
2070 GdkWindowEdge edge; local
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkOpSegment.cpp | 12 #define F (false) // discard the edge
13 #define T (true) // keep the edge
92 // edge leading into junction
349 SkPoint edge[4]; local
356 subDivide(start, end, edge);
357 ePtr = edge;
402 // add 2 to edge or out of range values to get T extremes
419 // Defer all coincident edge processing until
546 // FIXME: there's probably an edge case that can be constructed where
781 // add edge leading into junctio
[all...] |
| /external/skia/src/pathops/ |
| SkOpSegment.cpp | 12 #define F (false) // discard the edge
13 #define T (true) // keep the edge
92 // edge leading into junction
349 SkPoint edge[4]; local
356 subDivide(start, end, edge);
357 ePtr = edge;
402 // add 2 to edge or out of range values to get T extremes
419 // Defer all coincident edge processing until
546 // FIXME: there's probably an edge case that can be constructed where
781 // add edge leading into junctio
[all...] |
| /external/opencv/cxcore/src/ |
| cxdrawing.cpp | 995 edge[2];
1167 CvPolyEdge edge; local
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/collision/ |
| SweepSphere.java | 174 Vector3f edge = temp1.set(l2).subtractLocal(l1); local
177 float edgeSquared = edge.lengthSquared();
180 float EdotV = edge.dot(sVelocity);
181 float EdotB = edge.dot(base);
191 store.scaleAdd(f, edge, l1);
320 // edge 1-2
327 // edge 2-3
334 // edge 3-1
|
| /frameworks/support/v4/java/android/support/v4/widget/ |
| ViewDragHelper.java | 64 * Edge flag indicating that the left edge should be affected.
69 * Edge flag indicating that the right edge should be affected.
74 * Edge flag indicating that the top edge should be affected.
79 * Edge flag indicating that the bottom edge should be affected.
84 * Edge flag set indicating all edges should be affected.
165 * @param left New X coordinate of the left edge of the vie
[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,
|
| /cts/tests/tests/widget/src/android/widget/cts/ |
| HorizontalScrollViewTest.java | 446 int edge = mScrollView.getHorizontalFadingEdgeLength(); local
452 rect = new Rect(edge, 0, PAGE_WIDTH, 0);
456 rect = new Rect(edge + 1, 0, PAGE_WIDTH, 0);
457 assertEquals(edge, mScrollView.computeScrollDeltaToGetChildRectOnScreen(rect));
491 int edge = mScrollView.getHorizontalFadingEdgeLength();
502 assertEquals(ITEM_WIDTH - mScrollView.getWidth() + edge, mScrollView.getScrollX());
|
| ScrollViewTest.java | 474 int edge = mScrollView.getVerticalFadingEdgeLength(); local
480 rect = new Rect(0, edge, 0, mPageHeight);
484 rect = new Rect(0, edge + 1, 0, mPageHeight);
485 assertEquals(edge, mScrollView.computeScrollDeltaToGetChildRectOnScreen(rect));
521 int edge = mScrollView.getVerticalFadingEdgeLength();
535 assertEquals(edge, mScrollView.getScrollY());
|
| /packages/apps/Gallery2/src/com/android/photos/views/ |
| GalleryThumbnailView.java | 232 * @param x Left or right edge of the view to add
233 * @param forward If true, align left edge to x and increase position.
234 * If false, align right edge to x and decrease position.
354 // Break fling velocity if we impacted an edge.
422 EdgeEffectCompat edge = deltaX > 0 ? mLeftEdge : mRightEdge; local
423 edge.onPull((float) Math.abs(deltaX) / getWidth());
546 final EdgeEffectCompat edge; local
548 edge = mLeftEdge;
550 edge = mRightEdge;
552 edge.onAbsorb(Math.abs((int) mScroller.getCurrVelocity()))
[all...] |
| /external/ceres-solver/internal/ceres/ |
| graph_algorithms.h | 266 // empty edge set. We then iterate over the edges of G in decreasing
309 // edge>. Sorting it using the reverse iterators gives us the edges
316 const pair<Vertex, Vertex>& edge = weighted_edges[i].second; local
317 const Vertex vertex1 = edge.first;
318 const Vertex vertex2 = edge.second;
321 // which case adding this edge will violate the degree 2
331 // vertex, and adding this edge will create a cycle.
339 // This edge can be added, add an edge in either direction with
|
| /external/chromium/chrome/browser/ui/views/bubble/ |
| bubble_border.h | 96 // Sets a fixed offset for the arrow from the beginning of corresponding edge.
116 SkBitmap* edge,
145 // Minimal offset of the arrow from the closet edge of bounding rect.
|
| /external/chromium_org/remoting/webapp/ |
| toolbar.js | 36 * @type {number} The left edge of the tool-bar stub, updated on resize.
41 * @type {number} The right edge of the tool-bar stub, updated on resize.
|
| /external/chromium_org/v8/test/webkit/ |
| parseInt.js | 50 // Test edge cases for the Number.toString exponential ranges.
66 // Test edge cases of our optimized int handling.
|
| number-parsing-crash.js | 25 "This tests edge cases of number parsing."
|
| /external/chromium_org/third_party/freetype/src/autofit/ |
| afhints.h | 83 * edges. An edge corresponds to a single position on the main
172 * Experience has shown that points which are not part of an edge need
234 /* edge hint flags */
269 FT_Byte flags; /* edge/segment flags for this segment */
276 AF_Edge edge; /* the segment's parent edge */ member in struct:AF_SegmentRec_
277 AF_Segment edge_next; /* link to next segment in parent edge */
285 AF_Point first; /* first point in edge segment */
286 AF_Point last; /* last point in edge segment */
297 FT_Byte flags; /* edge flags *
[all...] |
| /external/freetype/src/autofit/ |
| afhints.h | 83 * edges. An edge corresponds to a single position on the main
172 * Experience has shown that points which are not part of an edge need
234 /* edge hint flags */
269 FT_Byte flags; /* edge/segment flags for this segment */
276 AF_Edge edge; /* the segment's parent edge */ member in struct:AF_SegmentRec_
277 AF_Segment edge_next; /* link to next segment in parent edge */
285 AF_Point first; /* first point in edge segment */
286 AF_Point last; /* last point in edge segment */
297 FT_Byte flags; /* edge flags *
[all...] |
