| /external/chromium_org/ash/wm/workspace/ |
| magnetism_matcher.h | 31 // MagnetismEdgeMatcher is used for matching a particular edge of a window. You
35 // edge. As ShouldAttach() is invoked the visible range is updated.
38 MagnetismEdgeMatcher(const gfx::Rect& bounds, MagnetismEdge edge);
41 MagnetismEdge edge() const { return edge_; } function in class:ash::internal::MagnetismEdgeMatcher
44 // Returns true if the edge is completely obscured. If true ShouldAttach()
58 static int GetPrimaryCoordinate(const gfx::Rect& bounds, MagnetismEdge edge) {
59 switch (edge) {
73 static MagnetismEdge FlipEdge(MagnetismEdge edge) {
74 switch (edge) {
121 // The edge this matcher checks
[all...] |
| magnetism_matcher.cc | 21 // primary edge of |primary|. |edges| is a bitmask of the allowed
56 MagnetismEdge edge)
58 edge_(edge) {
74 // Close enough, but only attach if some portion of the edge is visible.
143 MatchedEdge* edge) {
146 edge->primary_edge = matchers_[i]->edge();
147 AttachToSecondaryEdge(bounds, edge->primary_edge,
148 &(edge->secondary_edge));
165 MagnetismEdge edge,
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderFrameSet.h | 46 bool preventResize(FrameEdge edge) const { return m_preventResize[edge]; }
47 bool allowBorder(FrameEdge edge) const { return m_allowBorder[edge]; }
49 void setPreventResize(FrameEdge edge, bool preventResize) { m_preventResize[edge] = preventResize; }
50 void setAllowBorder(FrameEdge edge, bool allowBorder) { m_allowBorder[edge] = allowBorder; }
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
95 void Graph::Node::attach(Node *node, Edge::Type kind)
97 Edge *edge = new Edge(this, node, kind); local
101 edge->next[0] = this->out;
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
356 Graph::Edge *edge; local
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
95 void Graph::Node::attach(Node *node, Edge::Type kind)
97 Edge *edge = new Edge(this, node, kind); local
101 edge->next[0] = this->out;
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
356 Graph::Edge *edge; local
[all...] |
| /external/opencv/cv/src/ |
| cvsubdivision2d.cpp | 72 * Quad Edge algebra *
78 CvQuadEdge2D *edge = 0; local
88 edge = (CvQuadEdge2D*)cvSetNew( (CvSet*)subdiv->edges );
91 memset( edge->pt, 0, sizeof( edge->pt ));
92 edgehandle = (CvSubdiv2DEdge) edge;
94 edge->next[0] = edgehandle;
95 edge->next[1] = edgehandle + 3;
96 edge->next[2] = edgehandle + 2;
97 edge->next[3] = edgehandle + 1
254 CvSubdiv2DEdge edge = 0; local
734 CvSubdiv2DEdge edge; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/ |
| PolygonShape.cpp | 46 const FloatPolygonEdge* edge; member in struct:WebCore::EdgeIntersection
63 const FloatPolygonEdge& edge = *edgePointer; local
65 if (edge.minY() > y || edge.maxY() < y)
68 const FloatPoint& vertex1 = edge.vertex1();
69 const FloatPoint& vertex2 = edge.vertex2();
77 intersectionX = edge.minX();
78 } else if (y == edge.minY()) {
81 } else if (y == edge.maxY()) {
89 result.edge = edgePointer
414 const FloatPolygonEdge* edge = edges[i]; local
456 const FloatPolygonEdge& edge = *(edges[i]); local
[all...] |
| /external/chromium_org/third_party/freetype/src/autofit/ |
| afcjk.c | 916 /* an edge in our table that corresponds to its position. */
918 /* If no edge is found, we create and insert a new edge in the */
919 /* sorted table. Otherwise, we simply add the segment to the edge's */
921 /* edge's properties. */
923 /* Note that the edges table is sorted along the segment/edge */
942 /* look for an edge corresponding to the segment */
945 AF_Edge edge = axis->edges + ee; local
949 if ( edge->dir != seg->dir )
952 dist = seg->pos - edge->fpos
993 AF_Edge edge; local
1046 AF_Edge edge; local
1175 AF_Edge edge = axis->edges; local
1676 AF_Edge edge; local
2019 AF_Edge edge; local
[all...] |
| /external/freetype/src/autofit/ |
| afcjk.c | 920 /* an edge in our table that corresponds to its position. */
922 /* If no edge is found, we create and insert a new edge in the */
923 /* sorted table. Otherwise, we simply add the segment to the edge's */
925 /* edge's properties. */
927 /* Note that the edges table is sorted along the segment/edge */
946 /* look for an edge corresponding to the segment */
949 AF_Edge edge = axis->edges + ee; local
953 if ( edge->dir != seg->dir )
956 dist = seg->pos - edge->fpos
998 AF_Edge edge; local
1051 AF_Edge edge; local
1180 AF_Edge edge = axis->edges; local
1681 AF_Edge edge; local
2024 AF_Edge edge; local
[all...] |
| /external/chromium_org/ui/views/widget/ |
| monitor_win.h | 22 // Returns the always-on-top auto-hiding taskbar for edge |edge| (one of
28 VIEWS_EXPORT HWND GetTopmostAutoHideTaskbarForEdge(UINT edge, HMONITOR monitor);
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkEdgeBuilder.cpp | 26 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); local
27 if (edge->setLine(pts[0], pts[1], fShiftUp)) {
28 fList.push(edge);
30 // TODO: unallocate edge from storage...
35 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); local
36 if (edge->setQuadratic(pts, fShiftUp)) {
37 fList.push(edge);
39 // TODO: unallocate edge from storage...
44 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); local
45 if (edge->setCubic(pts, NULL, fShiftUp))
100 SkEdge* edge = reinterpret_cast<SkEdge*>(storage); local
[all...] |
| /external/skia/src/core/ |
| SkEdgeBuilder.cpp | 26 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); local
27 if (edge->setLine(pts[0], pts[1], fShiftUp)) {
28 fList.push(edge);
30 // TODO: unallocate edge from storage...
35 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); local
36 if (edge->setQuadratic(pts, fShiftUp)) {
37 fList.push(edge);
39 // TODO: unallocate edge from storage...
44 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); local
45 if (edge->setCubic(pts, NULL, fShiftUp))
100 SkEdge* edge = reinterpret_cast<SkEdge*>(storage); local
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| tree-flow.h | 396 /* Location to track pending stmt for edge insertion. */
424 extern edge find_taken_edge (basic_block, tree);
433 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
434 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
436 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
441 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
461 void remove_edge_and_dominated_blocks (edge);
[all...] |
| cfgloop.h | 76 /* The exit edge. */
219 void rescan_loop_exit (edge, bool, bool);
249 extern VEC (edge, heap) *get_loop_exit_edges (const struct loop *);
250 edge single_exit (const struct loop *);
253 extern edge loop_preheader_edge (const struct loop *);
254 extern edge loop_latch_edge (const struct loop *);
294 extern edge create_empty_if_region_on_edge (edge, tree);
295 extern struct loop *create_empty_loop_on_edge (edge, tree, tree, tree, tree,
299 extern bool duplicate_loop_to_header_edge (struct loop *, edge,
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| tree-flow.h | 396 /* Location to track pending stmt for edge insertion. */
424 extern edge find_taken_edge (basic_block, tree);
433 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
434 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
436 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
441 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
461 void remove_edge_and_dominated_blocks (edge);
[all...] |
| cfgloop.h | 76 /* The exit edge. */
219 void rescan_loop_exit (edge, bool, bool);
249 extern VEC (edge, heap) *get_loop_exit_edges (const struct loop *);
250 edge single_exit (const struct loop *);
253 extern edge loop_preheader_edge (const struct loop *);
254 extern edge loop_latch_edge (const struct loop *);
294 extern edge create_empty_if_region_on_edge (edge, tree);
295 extern struct loop *create_empty_loop_on_edge (edge, tree, tree, tree, tree,
299 extern bool duplicate_loop_to_header_edge (struct loop *, edge,
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| tree-flow.h | 396 /* Location to track pending stmt for edge insertion. */
424 extern edge find_taken_edge (basic_block, tree);
433 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
434 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
436 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
441 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
461 void remove_edge_and_dominated_blocks (edge);
[all...] |
| cfgloop.h | 76 /* The exit edge. */
219 void rescan_loop_exit (edge, bool, bool);
249 extern VEC (edge, heap) *get_loop_exit_edges (const struct loop *);
250 edge single_exit (const struct loop *);
253 extern edge loop_preheader_edge (const struct loop *);
254 extern edge loop_latch_edge (const struct loop *);
294 extern edge create_empty_if_region_on_edge (edge, tree);
295 extern struct loop *create_empty_loop_on_edge (edge, tree, tree, tree, tree,
299 extern bool duplicate_loop_to_header_edge (struct loop *, edge,
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| tree-flow.h | 396 /* Location to track pending stmt for edge insertion. */
424 extern edge find_taken_edge (basic_block, tree);
433 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
434 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
436 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
441 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
461 void remove_edge_and_dominated_blocks (edge);
[all...] |
| cfgloop.h | 76 /* The exit edge. */
219 void rescan_loop_exit (edge, bool, bool);
249 extern VEC (edge, heap) *get_loop_exit_edges (const struct loop *);
250 edge single_exit (const struct loop *);
253 extern edge loop_preheader_edge (const struct loop *);
254 extern edge loop_latch_edge (const struct loop *);
294 extern edge create_empty_if_region_on_edge (edge, tree);
295 extern struct loop *create_empty_loop_on_edge (edge, tree, tree, tree, tree,
299 extern bool duplicate_loop_to_header_edge (struct loop *, edge,
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| DOTGenerator.java | 131 // make a DOT edge for each transition
133 Transition edge = (Transition) s.transition(i); local
136 " edge from s"+s.stateNumber+" ["+i+"] of "+s.getNumberOfTransitions());
139 if ( edge.target instanceof DFAState &&
140 ((DFAState)edge.target).getAcceptStateReachable()!=DFA.REACHABLE_YES )
145 st = stlib.getInstanceOf("edge");
146 st.add("label", getEdgeLabel(edge));
148 st.add("target", getStateLabel(edge.target));
151 walkCreatingDFADOT(dot, (DFAState)edge.target); // keep walkin'
205 // make a DOT edge for each transitio
208 Transition edge = (Transition) s.transition(i); local
[all...] |
| /external/freetype/src/cff/ |
| cf2hints.c | 60 size_t j; /* index of upper hint map edge */
142 * non-Adobe font tool. The Type 2 spec allows edge (ghost) hints
184 /* Now that ghost hints have been detected, adjust this edge for */
323 csCoord >= hintmap->edge[i + 1].csCoord )
327 while ( i > 0 && csCoord < hintmap->edge[i].csCoord )
332 if ( i == 0 && csCoord < hintmap->edge[0].csCoord )
334 /* special case for points below first edge: use uniform scale */
335 return FT_MulFix( csCoord - hintmap->edge[0].csCoord,
337 hintmap->edge[0].dsCoord;
343 * Use edge[i], the highest entry where csCoord >= entry[i].csCoor
870 CF2_HintRec edge, invalid; local
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DFAOptimizer.java | 98 * It can yield states that have only a single edge on EOT to an accept
105 * for keyword versus ID as the state with EOT edge emanating from it will
106 * also have another edge.
192 Transition edge = (Transition) d.transition(i); local
193 DFAState edgeTarget = ((DFAState)edge.target);
196 edge.label.toString(d.dfa.nfa.grammar)+"->"+
221 Transition edge = (Transition) d.transition(i); local
222 DFAState edgeTarget = ((DFAState)edge.target);
225 edge.label.toString(d.dfa.nfa.grammar)+"->"+
228 // if only one edge coming out, it is EOT, and target is accept prun
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/ |
| FloatPolygon.h | 129 // Edge vertex index1 is less than index2, except the last edge, where index2 is 0. When a polygon edge
144 static String string(const FloatPolygonEdge* edge) { return String::format("%p (%f,%f %f,%f)", edge, edge->vertex1().x(), edge->vertex1().y(), edge->vertex2().x(), edge->vertex2().y()); }
|
| /external/llvm/lib/Analysis/ |
| ProfileEstimatorPass.cpp | 38 std::map<Edge,double> MinimalWeight;
71 void inline printEdgeWeight(Edge);
101 static void inline printEdgeError(ProfileInfo::Edge e, const char *M) {
102 DEBUG(dbgs() << "-- Edge " << e << " is not calculated, " << M << "\n");
105 void inline ProfileEstimatorPass::printEdgeWeight(Edge E) {
106 DEBUG(dbgs() << "-- Weight of Edge " << E << ":"
116 // flow, once an edge has a flow assigned this flow is never changed again,
134 Edge edge = getEdge(*bbi,BB); local
135 double w = getEdgeWeight(edge);
205 Edge edge = getEdge(Latch,0); local
267 Edge edge = getEdge(BB,0); local
273 Edge edge = getEdge(BB,*bbi); local
341 Edge edge = getEdge(0,entry); local
[all...] |
