| /external/llvm/include/llvm/Analysis/ |
| PathNumbering.h | 87 // Add an edge to the predecessor list.
88 void addPredEdge(BallLarusEdge* edge);
90 // Remove an edge from the predecessor list.
91 void removePredEdge(BallLarusEdge* edge);
93 // Add an edge to the successor list.
94 void addSuccEdge(BallLarusEdge* edge);
96 // Remove an edge from the successor list.
97 void removeSuccEdge(BallLarusEdge* edge);
123 // Removes an edge from an edgeVector. Used by removePredEdge and
128 // Represents an edge in the Dag. For an edge, v -> w, v is the source, an
[all...] |
| BranchProbabilityInfo.h | 30 /// probabilities of each "edge" in the function's CFG where such an edge is
32 /// probability of an edge from one block is always relative to the
36 /// identify an edge, since we can have multiple edges from Src to Dst.
51 /// \brief Get an edge's probability, relative to other out-edges of the Src.
54 /// (0%) and one (100%) of this edge executing, relative to other edges
66 /// \brief Test if an edge is hot relative to other out-edges of the Src.
68 /// Check whether this edge out of the source block is 'hot'. We define hot
78 /// \brief Print an edge's probability.
80 /// Retrieves an edge's probability similarly to \see getEdgeProbability, bu
[all...] |
| ProfileDataLoader.h | 39 /// An edge is defined by its source and sink basic blocks.
43 // The profiling information defines an Edge by its source and sink basic
45 typedef std::pair<const BType*, const BType*> Edge;
48 typedef DenseMap<Edge, unsigned> EdgeWeights;
53 /// As a special case, we also hold an edge from the null BasicBlock to the
58 /// getFunction() - Returns the Function for an Edge.
59 static const FType *getFunction(Edge e) {
62 && "A ProfileData::Edge can not be between two functions");
63 assert(e.second && "A ProfileData::Edge must have a real sink");
67 /// getEdge() - Creates an Edge between two BasicBlocks
[all...] |
| /external/llvm/test/Analysis/BranchProbabilityInfo/ |
| basic.ll | 7 ; CHECK: edge entry -> body probability is 16 / 16 = 100%
18 ; CHECK: edge body -> exit probability is 4 / 128
19 ; CHECK: edge body -> body probability is 124 / 128
30 ; CHECK: edge entry -> then probability is 64 / 68
31 ; CHECK: edge entry -> else probability is 4 / 68
35 ; CHECK: edge then -> exit probability is 16 / 16 = 100%
39 ; CHECK: edge else -> exit probability is 16 / 16 = 100%
55 ; CHECK: edge entry -> case_a probability is 4 / 80
56 ; CHECK: edge entry -> case_b probability is 4 / 80
57 ; CHECK: edge entry -> case_c probability is 64 / 8
[all...] |
| loop.ll | 12 ; CHECK: edge entry -> do.body probability is 16 / 16 = 100%
18 ; CHECK: edge do.body -> do.body1 probability is 124 / 124 = 100%
26 ; CHECK: edge do.body1 -> do.body1 probability is 124 / 128
27 ; CHECK: edge do.body1 -> do.end probability is 4 / 128
34 ; CHECK: edge do.end -> do.body probability is 124 / 128
35 ; CHECK: edge do.end -> do.end5 probability is 4 / 128
46 ; CHECK: edge entry -> for.body.lr.ph probability is 20 / 32
47 ; CHECK: edge entry -> for.end6 probability is 12 / 32
52 ; CHECK: edge for.body.lr.ph -> for.body probability is 16 / 16 = 100%
58 ; CHECK: edge for.body -> for.body3 probability is 62 / 124 = 50
[all...] |
| /external/llvm/test/CodeGen/ARM/ |
| 2007-05-23-BadPreIndexedStore.ll | 19 %edge.230.0.rec = shl i32 %indvar, 1 ; <i32> [#uses=3]
20 %edge.230.0 = getelementptr %struct.shape_edge_t* null, i32 %edge.230.0.rec ; <%struct.shape_edge_t*> [#uses=1]
21 %edge.230.0.sum6970 = or i32 %edge.230.0.rec, 1 ; <i32> [#uses=2]
22 %tmp154 = getelementptr %struct.shape_edge_t* null, i32 %edge.230.0.sum6970 ; <%struct.shape_edge_t*> [#uses=1]
23 %tmp11.i5 = getelementptr %struct.shape_edge_t* null, i32 %edge.230.0.sum6970, i32 0 ; <%struct.shape_edge_t**> [#uses=1]
24 store %struct.shape_edge_t* %edge.230.0, %struct.shape_edge_t** %tmp11.i5
26 %tmp16254.0.rec = add i32 %edge.230.0.rec, 2 ; <i32> [#uses=1]
|
| /external/chromium_org/third_party/skia/include/utils/ |
| SkBoundaryPatch.h | 19 enum Edge {
25 // Edge index goes clockwise around the boundary, beginning at the "top"
26 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0;
54 virtual SkPoint eval(Edge, SkScalar);
63 virtual SkPoint eval(Edge, SkScalar);
|
| /external/skia/include/utils/ |
| SkBoundaryPatch.h | 19 enum Edge {
25 // Edge index goes clockwise around the boundary, beginning at the "top"
26 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0;
54 virtual SkPoint eval(Edge, SkScalar);
63 virtual SkPoint eval(Edge, SkScalar);
|
| /external/chromium_org/third_party/freetype/src/autofit/ |
| aflatin.c | 791 /* we are already on an edge, try to locate its start */
825 /* we are just leaving an edge; record a new segment! */
1083 /* an edge in our table that corresponds to its position. */
1085 /* If no edge is found, we create and insert a new edge in the */
1086 /* sorted table. Otherwise, we simply add the segment to the edge's */
1088 /* edge's properties. */
1090 /* Note that the table of edges is sorted along the segment/edge */
1095 /* assure that edge distance threshold is at most 0.25px */
1122 AF_Edge edge = axis->edges + ee; local
1139 AF_Edge edge; local
1195 AF_Edge edge; local
1358 AF_Edge edge = axis->edges; local
1807 AF_Edge edge; local
[all...] |
| aflatin2.c | 737 /* already on an edge ?, backtrack to find its start */
1084 /* to find an edge in our table that corresponds to its position. */
1086 /* If no edge is found, we create and insert a new edge in the */
1087 /* sorted table. Otherwise, we simply add the segment to the edge's */
1089 /* edge's properties. */
1091 /* Note that the edges table is sorted along the segment/edge */
1134 AF_Edge edge = axis->edges + ee; local
1151 AF_Edge edge; local
1205 AF_Edge edge; local
1363 AF_Edge edge = axis->edges; local
1813 AF_Edge edge; local
[all...] |
| /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...] |
| /external/freetype/src/autofit/ |
| aflatin2.c | 765 /* already on an edge ?, backtrack to find its start */
1113 /* to find an edge in our table that corresponds to its position. */
1115 /* If no edge is found, we create and insert a new edge in the *
1164 AF_Edge edge = axis->edges + ee; local
1181 AF_Edge edge; local
1235 AF_Edge edge; local
1393 AF_Edge edge = axis->edges; local
1843 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/llvm/lib/Analysis/ |
| PathNumbering.cpp | 113 // Add an edge to the predecessor list.
114 void BallLarusNode::addPredEdge(BallLarusEdge* edge) {
115 _predEdges.push_back(edge);
118 // Remove an edge from the predecessor list.
119 void BallLarusNode::removePredEdge(BallLarusEdge* edge) {
120 removeEdge(_predEdges, edge);
123 // Add an edge to the successor list.
124 void BallLarusNode::addSuccEdge(BallLarusEdge* edge) {
125 _succEdges.push_back(edge);
128 // Remove an edge from the successor list
[all...] |
| /packages/inputmethods/LatinIME/java/res/xml/ |
| rows_number_password.xml | 25 <!-- Note: This Spacer prevents the below key from being marked as a left edge key. -->
34 <!-- Note: This Spacer prevents the above key from being marked as a right edge key. -->
39 <!-- Note: This Spacer prevents the below key from being marked as a left edge key. -->
48 <!-- Note: This Spacer prevents the above key from being marked as a right edge key. -->
53 <!-- Note: This Spacer prevents the below key from being marked as a left edge key. -->
62 <!-- Note: This Spacer prevents the above key from being marked as a right edge key. -->
67 <!-- Note: This Spacer prevents the below key from being marked as a left edge key. -->
76 <!-- Note: This Spacer prevents the above key from being marked as a right edge key. -->
|
| /packages/inputmethods/LatinIME/java/res/xml-sw600dp/ |
| rows_number_password.xml | 25 <!-- Note: This Spacer prevents the below key from being marked as a left edge key. -->
34 <!-- Note: This Spacer prevents the above key from being marked as a right edge key. -->
39 <!-- Note: This Spacer prevents the below key from being marked as a left edge key. -->
48 <!-- Note: This Spacer prevents the above key from being marked as a right edge key. -->
53 <!-- Note: This Spacer prevents the below key from being marked as a left edge key. -->
62 <!-- Note: This Spacer prevents the above key from being marked as a right edge key. -->
67 <!-- Note: This Spacer prevents the below key from being marked as a left edge key. -->
76 <!-- Note: This Spacer prevents the above key from being marked as a right edge key. -->
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.h | 32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
40 class Edge
53 Edge(Node *dst, Node *src, Type kind);
54 ~Edge() { unlink(); }
67 Edge *next[2]; // next edge outgoing/incident from/to origin/target
68 Edge *prev[2];
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
95 inline Edge *getEdge() const { return e;
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.h | 32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
40 class Edge
53 Edge(Node *dst, Node *src, Type kind);
54 ~Edge() { unlink(); }
67 Edge *next[2]; // next edge outgoing/incident from/to origin/target
68 Edge *prev[2];
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
95 inline Edge *getEdge() const { return e;
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkRegion_path.cpp | 344 struct Edge {
355 Edge* fNext;
372 static void find_link(Edge* base, Edge* stop) {
375 if (base->fFlags == Edge::kCompleteLink) {
385 Edge* e = base;
386 if ((base->fFlags & Edge::kY0Link) == 0) {
389 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) {
392 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link);
399 if ((base->fFlags & Edge::kY1Link) == 0)
[all...] |
| /external/skia/src/core/ |
| SkRegion_path.cpp | 344 struct Edge {
355 Edge* fNext;
372 static void find_link(Edge* base, Edge* stop) {
375 if (base->fFlags == Edge::kCompleteLink) {
385 Edge* e = base;
386 if ((base->fFlags & Edge::kY0Link) == 0) {
389 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) {
392 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link);
399 if ((base->fFlags & Edge::kY1Link) == 0)
[all...] |
| /external/pixman/pixman/ |
| pixman-edge.c | 35 #define RENDER_EDGE_STEP_SMALL(edge) \
37 edge->x += edge->stepx_small; \
38 edge->e += edge->dx_small; \
39 if (edge->e > 0) \
41 edge->e -= edge->dy; \
42 edge->x += edge->signdx;
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| basic-block.h | 35 /* Control flow edge information. */
37 /* The two blocks at the ends of the edge. */
41 /* Instructions queued on the edge. */
50 /* Location of any goto implicit in the edge and associated BLOCK. */
54 /* The index number corresponding to this edge in the edge vector
64 DEF_VEC_P(edge); variable
65 DEF_VEC_ALLOC_P(edge,gc);
66 DEF_VEC_ALLOC_P(edge,heap);
74 #define EDGE_FAKE 16 /* Not a real edge (profile.c) *
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| basic-block.h | 35 /* Control flow edge information. */
37 /* The two blocks at the ends of the edge. */
41 /* Instructions queued on the edge. */
50 /* Location of any goto implicit in the edge and associated BLOCK. */
54 /* The index number corresponding to this edge in the edge vector
64 DEF_VEC_P(edge); variable
65 DEF_VEC_ALLOC_P(edge,gc);
66 DEF_VEC_ALLOC_P(edge,heap);
74 #define EDGE_FAKE 16 /* Not a real edge (profile.c) *
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| basic-block.h | 35 /* Control flow edge information. */
37 /* The two blocks at the ends of the edge. */
41 /* Instructions queued on the edge. */
50 /* Location of any goto implicit in the edge and associated BLOCK. */
54 /* The index number corresponding to this edge in the edge vector
64 DEF_VEC_P(edge); variable
65 DEF_VEC_ALLOC_P(edge,gc);
66 DEF_VEC_ALLOC_P(edge,heap);
74 #define EDGE_FAKE 16 /* Not a real edge (profile.c) *
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| basic-block.h | 35 /* Control flow edge information. */
37 /* The two blocks at the ends of the edge. */
41 /* Instructions queued on the edge. */
50 /* Location of any goto implicit in the edge and associated BLOCK. */
54 /* The index number corresponding to this edge in the edge vector
64 DEF_VEC_P(edge); variable
65 DEF_VEC_ALLOC_P(edge,gc);
66 DEF_VEC_ALLOC_P(edge,heap);
74 #define EDGE_FAKE 16 /* Not a real edge (profile.c) *
[all...] |
