Searched refs:edge (Results 1 - 25 of 87) sorted by relevance

1234

/macosx-10.9.5/cctools-845/gprof/
H A Dscatter.c76 Edge *edge);
80 Edge *edge);
239 Edge *edge; local
241 for(edge = tree[v1].next1; edge; edge = edge->next1){
242 if(edge->v2 == v2){
243 edge->w += w;
244 return(edge);
257 Edge *edge; local
287 free_edge( Edge *edge) argument
418 Edge *edge; local
439 make_edge_e1( Edge *edge) argument
454 make_edge_e2( Edge *edge) argument
469 find_edge_e1( Edge *edge) argument
485 find_edge_e2( Edge *edge) argument
501 pqinsert_e1( Edge *edge) argument
514 Edge *edge; local
647 int i; Edge *edge; local
[all...]
/macosx-10.9.5/JavaScriptCore-7537.78.1/dfg/
H A DDFGDCEPhase.cpp127 Edge edge = m_graph.m_varArgChildren[childIdx]; local
129 if (!edge || edge.isProved() || edge.useKind() == UntypedUse)
132 insertionSet.insertNode(indexInBlock, SpecNone, Phantom, node->codeOrigin, edge);
157 void findTypeCheckRoot(Node*, Edge edge) argument
161 if (edge.isProved() || edge.useKind() == UntypedUse)
163 if (!edge->postfixRef())
164 m_worklist.append(edge
167 countEdge(Node*, Edge edge) argument
181 Edge edge = node->children.child(i); local
[all...]
H A DDFGAbstractState.h105 AbstractValue& forNode(Edge edge) argument
107 return forNode(edge.node());
182 // filterEdgeByUse() (or some equivalent) on each edge.
186 ALWAYS_INLINE void filterEdgeByUse(Node* node, Edge& edge) argument
189 switch (edge.useKind()) {
194 ASSERT(!(forNode(edge).m_type & ~typeFilterFor(edge.useKind())));
201 filterByType(node, edge, typeFilterFor(edge.useKind()));
264 ALWAYS_INLINE void filterByType(Node* node, Edge& edge, SpeculatedTyp argument
[all...]
H A DDFGValidate.cpp107 Edge edge = m_graph.child(node, j); local
108 if (!edge)
111 myRefCounts.find(edge.node())->value++;
117 VALIDATE((node, edge), edge->hasVariableAccessData());
118 VALIDATE((node, edge), edge->variableAccessData() == node->variableAccessData());
121 VALIDATE((node, edge), edge->hasVariableAccessData());
122 VALIDATE((node, edge), edg
178 Edge edge = m_graph.child(node, j); local
195 Edge edge = m_graph.child(node, j); local
298 Edge edge = m_graph.child(node, j); local
391 reportValidationContext(Node* node, Edge edge) argument
[all...]
H A DDFGEdge.h177 inline bool operator==(Edge edge, Node* node) argument
179 return edge.node() == node;
181 inline bool operator==(Node* node, Edge edge) argument
183 return edge.node() == node;
185 inline bool operator!=(Edge edge, Node* node) argument
187 return edge.node() != node;
189 inline bool operator!=(Node* node, Edge edge) argument
191 return edge.node() != node;
H A DDFGArgumentsSimplificationPhase.cpp748 void observeProperArgumentsUse(Node* node, Edge edge) argument
750 if (edge->op() != GetLocal) {
762 if (edge->op() == CreateArguments
764 != edge->codeOrigin.inlineCallFrame)
765 m_createsArguments.add(edge->codeOrigin.inlineCallFrame);
770 VariableAccessData* variableAccessData = edge->variableAccessData();
771 if (edge->local() == m_graph.uncheckedArgumentsRegisterFor(edge->codeOrigin)
772 && node->codeOrigin.inlineCallFrame != edge->codeOrigin.inlineCallFrame) {
773 m_createsArguments.add(edge
822 Edge edge = node->children.child(edgeIndex); local
[all...]
H A DDFGFixupPhase.cpp895 void createToString(Node* node, Edge& edge) argument
897 edge.setNode(m_insertionSet.insertNode(
899 Edge(edge.node(), useKind)));
927 void convertStringAddUse(Node* node, Edge& edge) argument
933 observeUseKindOnNode<StringUse>(edge.node());
936 Edge(edge.node(), StringUse));
937 edge.setUseKind(KnownStringUse);
943 observeUseKindOnNode<useKind>(edge.node());
944 createToString<useKind>(node, edge);
956 Edge& edge local
1284 observeUseKindOnEdge(Edge edge) argument
1329 setUseKindAndUnboxIfProfitable(Edge& edge) argument
1335 fixIntEdge(Edge& edge) argument
1355 fixDoubleEdge(Edge& edge, SpeculationDirection direction = BackwardSpeculation) argument
1367 injectInt32ToDoubleNode(Edge& edge, UseKind useKind = NumberUse, SpeculationDirection direction = BackwardSpeculation) argument
1383 truncateConstantToInt32(Edge& edge) argument
[all...]
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Instrumentation/
H A DPathProfiling.cpp28 // 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 ha
393 operator <<(raw_ostream& os, const BLInstrumentationEdge& edge) argument
651 BallLarusEdge* edge; local
782 unlinkEdge(BallLarusEdge* edge) argument
791 makeEdgeSpanning(BLInstrumentationEdge* edge) argument
797 pushInitializationFromEdge( BLInstrumentationEdge* edge) argument
825 pushCountersFromEdge(BLInstrumentationEdge* edge) argument
902 createIncrementConstant( BLInstrumentationEdge* edge) argument
1079 insertInstrumentationStartingAt(BLInstrumentationEdge* edge, BLInstrumentationDag* dag) argument
1403 splitCritical(BLInstrumentationEdge* edge, BLInstrumentationDag* dag) argument
[all...]
H A DOptimalEdgeProfiling.cpp1 //===- OptimalEdgeProfiling.cpp - Insert counters for opt. edge profiling -===//
10 // This pass instruments the specified program with counters for edge profiling.
15 #define DEBUG_TYPE "insert-optimal-edge-profiling"
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",
78 errs() << "WARNING: cannot insert edge profiling into a module"
85 // For the entry block a virtual edge (0,entry) is reserved, for each block
86 // with no successors an edge (B
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...]
/macosx-10.9.5/WebCore-7537.78.1/rendering/
H A DRenderFrameSet.h45 bool preventResize(FrameEdge edge) const { return m_preventResize[edge]; }
46 bool allowBorder(FrameEdge edge) const { return m_allowBorder[edge]; }
48 void setPreventResize(FrameEdge edge, bool preventResize) { m_preventResize[edge] = preventResize; } argument
49 void setAllowBorder(FrameEdge edge, bool allowBorder) { m_allowBorder[edge] = allowBorder; } argument
/macosx-10.9.5/WebCore-7537.78.1/rendering/shapes/
H A DPolygonShape.cpp45 const FloatPolygonEdge* edge; member in struct:WebCore::EdgeIntersection
62 const FloatPolygonEdge& edge = *edgePointer; local
64 if (edge.minY() > y || edge.maxY() < y)
67 const FloatPoint& vertex1 = edge.vertex1();
68 const FloatPoint& vertex2 = edge.vertex2();
76 intersectionX = edge.minX();
77 } else if (y == edge.minY()) {
80 } else if (y == edge.maxY()) {
88 result.edge
95 inwardEdgeNormal(const FloatPolygonEdge& edge) argument
106 outwardEdgeNormal(const FloatPolygonEdge& edge) argument
411 const FloatPolygonEdge* edge = edges[i]; local
453 const FloatPolygonEdge& edge = *(edges[i]); local
[all...]
H A DPolygonShape.h47 OffsetPolygonEdge(const FloatPolygonEdge& edge, const FloatSize& offset) argument
48 : m_vertex1(edge.vertex1() + offset)
49 , m_vertex2(edge.vertex2() + offset)
50 , m_edgeIndex(edge.edgeIndex())
/macosx-10.9.5/WebCore-7537.78.1/platform/graphics/
H A DFloatPolygon.h129 // 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()); } argument
H A DIntRect.h118 void shiftXEdgeTo(int edge) argument
120 int delta = edge - x();
121 setX(edge);
124 void shiftMaxXEdgeTo(int edge) argument
126 int delta = edge - maxX();
129 void shiftYEdgeTo(int edge) argument
131 int delta = edge - y();
132 setY(edge);
135 void shiftMaxYEdgeTo(int edge) argument
137 int delta = edge
[all...]
H A DFloatRect.h119 void shiftXEdgeTo(float edge) argument
121 float delta = edge - x();
122 setX(edge);
125 void shiftMaxXEdgeTo(float edge) argument
127 float delta = edge - maxX();
130 void shiftYEdgeTo(float edge) argument
132 float delta = edge - y();
133 setY(edge);
136 void shiftMaxYEdgeTo(float edge) argument
138 float delta = edge
[all...]
H A DLayoutRect.h117 void shiftXEdgeTo(LayoutUnit edge) argument
119 LayoutUnit delta = edge - x();
120 setX(edge);
123 void shiftMaxXEdgeTo(LayoutUnit edge) argument
125 LayoutUnit delta = edge - maxX();
128 void shiftYEdgeTo(LayoutUnit edge) argument
130 LayoutUnit delta = edge - y();
131 setY(edge);
134 void shiftMaxYEdgeTo(LayoutUnit edge) argument
136 LayoutUnit delta = edge
[all...]
H A DFloatPolygon.cpp135 FloatPolygonEdge* edge = &m_edges[i];
136 m_edgeTree.add(EdgeInterval(edge->minY(), edge->maxY(), edge));
147 const FloatPolygonEdge* edge = static_cast<const FloatPolygonEdge*>(overlappingEdgeIntervals[i].data());
148 ASSERT(edge);
149 result[i] = edge;
/macosx-10.9.5/llvmCore-3425.0.33/lib/Analysis/
H A DProfileEstimatorPass.cpp116 // 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);
140 // loop, thus the edge is a backedge, continue and do not check if the
143 printEdgeError(edge, "but is backedge, continuing");
149 printEdgeError(edge, "returning");
172 // *) In case there is not a single exiting edge left, create one at the loop
205 Edge edge = getEdge(Latch,0); local
206 EdgeInformation[BB->getParent()][edge] = BBWeight;
207 printEdgeWeight(edge);
267 Edge edge = getEdge(BB,0); local
273 Edge edge = getEdge(BB,*bbi); local
341 Edge edge = getEdge(0,entry); local
[all...]
H A DPathNumbering.cpp114 // Add an edge to the predecessor list.
115 void BallLarusNode::addPredEdge(BallLarusEdge* edge) { argument
116 _predEdges.push_back(edge);
119 // Remove an edge from the predecessor list.
120 void BallLarusNode::removePredEdge(BallLarusEdge* edge) { argument
121 removeEdge(_predEdges, edge);
124 // Add an edge to the successor list.
125 void BallLarusNode::addSuccEdge(BallLarusEdge* edge) { argument
126 _succEdges.push_back(edge);
129 // Remove an edge fro
130 removeSuccEdge(BallLarusEdge* edge) argument
[all...]
/macosx-10.9.5/llvmCore-3425.0.33/utils/
H A Dprofile.pl12 # -edge - Enable edge profiling
20 my $ProfilePass = "-insert-edge-profiling";
33 if (/^-?-edge$/) { $ProfilePass = "-insert-edge-profiling"; next; }
47 print " -edge - Enable edge profiling\n";
/macosx-10.9.5/WebCore-7537.78.1/inspector/front-end/
H A DJSHeapSnapshot.js75 function filter(edge) {
76 if (edge.isInvisible())
80 return !edge.isHidden() && !edge.node().isHidden();
88 function filter(edge) {
89 if (!containmentEdgesFilter(edge))
91 return edge.node().id() !== 1 && !edge.node().isSynthetic() && !edge.isWeak();
108 var edge
[all...]
/macosx-10.9.5/libpcap-42/libpcap/
H A Dgencode.h229 struct edge { struct
235 struct edge *next; /* link list of incoming edges for a node */
248 struct edge et;
249 struct edge ef;
254 struct edge *in_edges;
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Analysis/
H A DPathNumbering.h87 // 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 i
[all...]
/macosx-10.9.5/CPANInternal-140/Graph/lib/Graph/
H A DMatrix.pm66 Return the value at the edge from $u to $v.
70 Set the edge from $u to $v to value $val.
/macosx-10.9.5/CPANInternal-140/Graph-0.94/lib/Graph/
H A DMatrix.pm66 Return the value at the edge from $u to $v.
70 Set the edge from $u to $v to value $val.

Completed in 339 milliseconds

1234