| /art/test/084-class-init/ |
| info.txt | 1 Test class initialization edge cases and race conditions.
|
| /art/test/537-checker-arraycopy/ |
| info.txt | 1 Test for edge cases of System.arraycopy.
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| cfghooks.h | 38 /* Redirect edge E to the given basic block B and update underlying program
39 representation. Returns edge representing redirected branch (that may not
41 if edge is not easily redirectable for whatever reason. */
42 edge (*redirect_edge_and_branch) (edge e, basic_block b);
45 newly created forwarder basic block is returned. The edge must
47 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
49 /* Returns true if it is possible to remove the edge by redirecting it
50 to the destination of the other edge going from its source. */
69 /* Predict edge E using PREDICTOR to given PROBABILITY. *
[all...] |
| /external/skia/src/gpu/ |
| GrTessellator.cpp | 42 * Stages (4) and (5) use an active edge list -- a list of all edges for which the
51 * not exact and may violate the mesh topology or active edge list ordering. We
55 * A) Intersections may cause a shortened edge to no longer be ordered with respect to its
58 * B) Intersections may cause an edge to violate the left-to-right ordering of the
59 * active edge list. This is handled by detecting potential violations and rewinding
60 * the active edge list to the vertex before they occur (rewind() during merging,
65 * currently uses a linked list for the active edge list, rather than a 2-3 tree as the
70 * are O(1), since we know the adjacent edge in the active edge list based on the topology.
96 struct Edge;
1041 Edge* edge = new_edge(prev, next, type, c, alloc); local
[all...] |
| /external/v8/tools/clang/blink_gc_plugin/ |
| CheckGCRootsVisitor.cpp | 19 it->second.edge()->Accept(this);
25 void CheckGCRootsVisitor::VisitValue(Value* edge) {
27 if (edge->value()->record()->isUnion())
31 if (visiting_set_.find(edge->value()) != visiting_set_.end())
34 visiting_set_.insert(edge->value());
42 ContainsGCRoots(edge->value());
43 visiting_set_.erase(edge->value());
46 void CheckGCRootsVisitor::VisitPersistent(Persistent* edge) {
50 void CheckGCRootsVisitor::AtCollection(Collection* edge) {
51 if (edge->is_root()
[all...] |
| CheckFieldsVisitor.cpp | 32 current_->edge()->Accept(this);
37 void CheckFieldsVisitor::AtMember(Member* edge) {
44 if ((*it)->Kind() == Edge::kRoot)
50 void CheckFieldsVisitor::AtIterator(Iterator* edge) {
54 if (edge->IsUnsafe())
58 void CheckFieldsVisitor::AtValue(Value* edge) {
60 if (edge->value()->record()->isUnion())
63 if (!stack_allocated_host_ && edge->value()->IsStackAllocated()) {
69 edge->value()->IsGCDerived() &&
70 !edge->value()->IsGCMixin())
[all...] |
| CheckGCRootsVisitor.h | 11 #include "Edge.h"
28 void VisitValue(Value* edge) override;
29 void VisitPersistent(Persistent* edge) override;
30 void AtCollection(Collection* edge) override;
|
| CheckFinalizerVisitor.cpp | 20 void VisitMember(Member* edge) override;
21 void VisitCollection(Collection* edge) override;
43 void MightBeCollectedVisitor::VisitMember(Member* edge) {
45 if (edge->ptr()->IsValue()) {
46 Value* member = static_cast<Value*>(edge->ptr());
57 void MightBeCollectedVisitor::VisitCollection(Collection* edge) {
58 if (edge->on_heap() && !is_eagerly_finalized_) {
59 might_be_collected_ = !edge->is_root();
61 edge->AcceptMembers(this);
130 point->edge()->Accept(&visitor)
[all...] |
| Edge.h | 16 class Edge;
46 // Recursive edge visitor. The traversed path is accessible in context.
63 typedef std::deque<Edge*> Context;
65 Edge* Parent() { return context_.empty() ? 0 : context_.front(); }
66 void Enter(Edge* e) { return context_.push_front(e); }
87 class Edge {
92 virtual ~Edge() {}
110 // A value edge is a direct edge to some type, eg, part-object edges.
111 class Value : public Edge {
[all...] |
| /external/replicaisland/tools/ |
| ExtractPoints.js | 27 * edge calculation for debugging purposes.
75 var edge = new Object;
77 edge.startX = firstPoint.anchor[0];
78 edge.startY = firstPoint.anchor[1];
80 edge.endX = lastPoint.anchor[0];
81 edge.endY = lastPoint.anchor[1];
83 var normalX = -(edge.endY - edge.startY);
84 var normalY = edge.endX - edge.startX
[all...] |
| /art/test/547-regression-trycatch-critic-edge/ |
| info.txt | 1 Test a specific SSA building regression a back edge would not be split due to
|
| /frameworks/support/design/jvm-tests/src/android/support/design/widget/ |
| DirectedAcyclicGraphTest.java | 66 final TestNode edge = new TestNode("edge"); local
69 mGraph.addNode(edge);
70 mGraph.addEdge(node, edge);
76 final TestNode edge = new TestNode("edge"); local
78 // Add the node, but not the edge node
82 mGraph.addEdge(node, edge);
88 final TestNode edge = new TestNode("edge"); local
102 final TestNode edge = new TestNode("edge"); local
118 final TestNode edge = new TestNode("edge"); local
137 final TestNode edge = new TestNode("edge"); local
153 final TestNode edge = new TestNode("edge"); local
[all...] |
| /external/skia/src/core/ |
| SkEdgeBuilder.cpp | 21 SkEdgeBuilder::Combine SkEdgeBuilder::CombineVertical(const SkEdge* edge, SkEdge* last) {
22 if (last->fCurveCount || last->fDX || edge->fX != last->fX) {
25 if (edge->fWinding == last->fWinding) {
26 if (edge->fLastY + 1 == last->fFirstY) {
27 last->fFirstY = edge->fFirstY;
30 if (edge->fFirstY == last->fLastY + 1) {
31 last->fLastY = edge->fLastY;
36 if (edge->fFirstY == last->fFirstY) {
37 if (edge->fLastY == last->fLastY) {
40 if (edge->fLastY < last->fLastY)
124 SkAnalyticEdge* edge = fAlloc.make<SkAnalyticEdge>(); local
142 SkEdge* edge = fAlloc.make<SkEdge>(); local
164 SkAnalyticQuadraticEdge* edge = fAlloc.make<SkAnalyticQuadraticEdge>(); local
171 SkQuadraticEdge* edge = fAlloc.make<SkQuadraticEdge>(); local
182 SkAnalyticCubicEdge* edge = fAlloc.make<SkAnalyticCubicEdge>(); local
189 SkCubicEdge* edge = fAlloc.make<SkCubicEdge>(); local
255 char* edge = fAnalyticAA ? (char*)fAlloc.makeArrayDefault<SkAnalyticEdge>(maxEdgeCount) local
[all...] |
| SkEdgeBuilder.h | 23 // returns the number of built edges. The array of those edge pointers
41 Combine CombineVertical(const SkEdge* edge, SkEdge* last);
42 Combine CombineVertical(const SkAnalyticEdge* edge, SkAnalyticEdge* last);
43 Combine checkVertical(const SkEdge* edge, SkEdge** edgePtr);
44 Combine checkVertical(const SkAnalyticEdge* edge, SkAnalyticEdge** edgePtr);
45 bool vertical_line(const SkEdge* edge);
46 bool vertical_line(const SkAnalyticEdge* edge);
|
| /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/llvm/test/Analysis/BranchProbabilityInfo/ |
| loop.ll | 13 ; CHECK: edge entry -> do.body probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
19 ; CHECK: edge do.body -> do.body1 probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
27 ; CHECK: edge do.body1 -> do.body1 probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
28 ; CHECK: edge do.body1 -> do.end probability is 0x04000000 / 0x80000000 = 3.12%
35 ; CHECK: edge do.end -> do.body probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
36 ; CHECK: edge do.end -> do.end5 probability is 0x04000000 / 0x80000000 = 3.12
[all...] |
| basic.ll | 8 ; CHECK: edge entry -> body probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
19 ; CHECK: edge body -> exit probability is 0x04000000 / 0x80000000 = 3.12%
20 ; CHECK: edge body -> body probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
31 ; CHECK: edge entry -> then probability is 0x78787878 / 0x80000000 = 94.12% [HOT edge]
32 ; CHECK: edge entry -> else probability is 0x07878788 / 0x80000000 = 5.88%
36 ; CHECK: edge then -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| Edge.java | 22 * Edge in a guice dependency graph.
27 public abstract class Edge {
31 protected Edge(NodeId fromId, NodeId toId) {
45 if (!(obj instanceof Edge)) {
48 Edge other = (Edge) obj;
57 * Returns a copy of the edge with new node IDs.
61 * @return copy of the edge with the new node IDs
63 public abstract Edge copy(NodeId fromId, NodeId toId);
|
| DefaultEdgeCreator.java | 36 * Default edge creator.
42 @Override public Iterable<Edge> getEdges(Iterable<Binding<?>> bindings) {
43 List<Edge> edges = Lists.newArrayList();
55 extends DefaultBindingTargetVisitor<Object, Collection<Edge>> {
58 * Returns a dependency edge for each {@link Dependency} in the binding. These will be from the
65 private <T extends Binding<?> & HasDependencies> Collection<Edge> newDependencyEdges(
67 ImmutableList.Builder<Edge> builder = ImmutableList.builder();
79 @Override public Collection<Edge> visit(ConstructorBinding<?> binding) {
88 @Override public Collection<Edge> visit(ConvertedConstantBinding<?> binding) {
89 return ImmutableList.<Edge>of(new BindingEdge(NodeId.newTypeId(binding.getKey())
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| Match.java | 28 /** the edge of the dragged node that is matched */
31 /** the "other" edge that the dragged edge is matched with */
32 public final Segment edge; field in class:Match
50 * @param edge the "other" edge that the dragged edge is matched with
51 * @param with the edge of the dragged node that is matched
55 public Match(GuidelineHandler handler, Segment edge, Segment with,
59 this.edge = edge
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/ |
| PathProfiling.cpp | 28 // v->w, insert edge ENTRY->w and edge v->EXIT.
33 // Chord - An edge not in the spanning tree.
108 // instrumentation that will end up on each edge.
115 // Sets the target node of this edge. Required to split edges.
118 // Get/set whether edge is in the spanning tree.
122 // Get/ set whether this edge will be instrumented with a path number
127 // Get/set whether this edge will be instrumented with a path counter
134 // Get/set the path number increment that this edge will be instrumented
142 // Get/set whether the edge has been instrumented
651 BallLarusEdge* edge; local
[all...] |
| OptimalEdgeProfiling.cpp | 1 //===- OptimalEdgeProfiling.cpp - Insert counters for opt. edge profiling -===//
10 // This pass instruments the specified program with counters for edge profiling.
11 // Edge profiling can give a reasonable approximation of the hot paths through a
15 #define DEBUG_TYPE "insert-optimal-edge-profiling"
49 return "Optimal Edge Profiler";
55 INITIALIZE_PASS_BEGIN(OptimalEdgeProfiler, "insert-optimal-edge-profiling",
56 "Insert optimal instrumentation for edge profiling",
60 INITIALIZE_PASS_END(OptimalEdgeProfiler, "insert-optimal-edge-profiling",
61 "Insert optimal instrumentation for edge profiling",
68 inline static void printEdgeCounter(ProfileInfo::Edge e
150 ProfileInfo::Edge edge = ProfileInfo::getEdge(0, entry); local
173 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB, 0); local
184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ); local
[all...] |
| /packages/apps/Test/connectivity/sl4n/rapidjson/doc/diagram/ |
| utilityclass.dot | 13 edge [fontname="Inconsolata, Consolas", fontsize=10, penwidth=0.5]
21 edge [arrowtail=onormal, dir=back]
35 edge [arrowtail=onormal, dir=back]
53 edge [arrowtail=onormal, dir=back]
58 edge [arrowtail=odiamond, arrowhead=vee, dir=both]
67 edge [arrowhead=vee, style=dashed]
|
| /external/mesa3d/src/gallium/drivers/nouveau/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;
366 Graph::Edge *edge; local
[all...] |
| /external/swiftshader/third_party/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...] |
