Searched refs:Edge (Results 1 - 25 of 66) sorted by relevance

123

/macosx-10.10.1/BerkeleyDB-21/db/java/src/com/sleepycat/asm/
H A DEdge.java37 class Edge { class
56 Edge next;
/macosx-10.10.1/JavaScriptCore-7600.1.17/dfg/
H A DDFGAdjacencyList.h55 AdjacencyList(Kind kind, Edge child1, Edge child2, Edge child3)
68 const Edge& child(unsigned i) const
74 Edge& child(unsigned i)
80 void setChild(unsigned i, Edge nodeUse)
86 Edge child1() const { return child(0); }
87 Edge child2() const { return child(1); }
88 Edge child3() const { return child(2); }
90 Edge
[all...]
H A DDFGSSALoweringPhase.cpp77 Edge base = m_graph.varArgChild(m_node, 0);
78 Edge index = m_graph.varArgChild(m_node, 1);
79 Edge storage = m_graph.varArgChild(m_node, 3);
88 m_graph.varArgChild(m_node, 4) = Edge(length, KnownInt32Use);
99 bool lowerBoundsCheck(Edge base, Edge index, Edge storage)
105 storage = Edge();
112 index, Edge(length, KnownInt32Use));
H A DDFGEdge.cpp36 void Edge::dump(PrintStream& out) const
H A DDFGEdgeUsesStructure.h42 void operator()(Node*, Edge edge)
H A DDFGEdge.h38 class Edge { class in namespace:JSC::DFG
40 explicit Edge(Node* node = 0, UseKind useKind = UntypedUse, ProofStatus proofStatus = NeedsCheck, KillStatus killStatus = DoesNotKill) function in class:JSC::DFG::Edge
155 Edge sanitized() const
157 Edge result = *this;
166 typedef void* Edge::*UnspecifiedBoolType;
171 bool operator==(Edge other) const
179 bool operator!=(Edge other) const
225 inline bool operator==(Edge edge, Node* node)
229 inline bool operator==(Node* node, Edge edge)
233 inline bool operator!=(Edge edg
[all...]
H A DDFGNode.h229 Node(NodeType op, NodeOrigin nodeOrigin, Edge child1 = Edge(), Edge child2 = Edge(), Edge child3 = Edge()) argument
244 Node(NodeFlags result, NodeType op, NodeOrigin nodeOrigin, Edge child1 = Edge(), Edge child2 = Edge(), Edg argument
260 Node(NodeType op, NodeOrigin nodeOrigin, OpInfo imm, Edge child1 = Edge(), Edge child2 = Edge(), Edge child3 = Edge()) argument
275 Node(NodeFlags result, NodeType op, NodeOrigin nodeOrigin, OpInfo imm, Edge child1 = Edge(), Edge child2 = Edge(), Edge child3 = Edge()) argument
291 Node(NodeType op, NodeOrigin nodeOrigin, OpInfo imm1, OpInfo imm2, Edge child1 = Edge(), Edge child2 = Edge(), Edge child3 = Edge()) argument
[all...]
H A DDFGAbstractInterpreter.h49 AbstractValue& forNode(Edge edge)
64 bool needsTypeCheck(Edge edge, SpeculatedType typesPassedThrough)
69 bool needsTypeCheck(Edge edge)
106 ALWAYS_INLINE void filterEdgeByUse(Node* node, Edge& edge)
173 ALWAYS_INLINE void filterByType(Node* node, Edge& edge, SpeculatedType type)
185 void verifyEdge(Node*, Edge);
H A DDFGInsertionSet.h80 Edge insertConstantForUse(
90 return Edge(insertConstant(index, origin, value, op), useKind);
93 Edge insertConstantForUse(
H A DDFGIntegerCheckCombiningPhase.cpp63 static RangeKey addition(Edge edge)
72 static RangeKey arrayBounds(Edge edge, Node* key)
112 Edge m_source;
271 Edge(minNode, Int32Use), Edge(data.m_key.m_key, Int32Use));
275 Edge(maxNode, Int32Use), Edge(data.m_key.m_key, Int32Use));
322 Edge source;
326 Edge index = node->child1();
329 source = Edge();
[all...]
H A DDFGFixupPhase.cpp275 node->children.initialize(Edge(newDivision, DoubleRepUse), Edge(), Edge());
576 Edge& child1 = m_graph.varArgChild(node, 0);
577 Edge& child2 = m_graph.varArgChild(node, 1);
578 Edge& child3 = m_graph.varArgChild(node, 2);
668 blessArrayOperation(node->child1(), Edge(), node->child3());
689 blessArrayOperation(node->child1(), Edge(), node->child2());
737 Edge newChildEdge = logicalNot->child1();
848 Edge(nod
[all...]
H A DDFGAtTailAbstractState.h50 AbstractValue& forNode(Edge edge) { return forNode(edge.node()); }
H A DDFGConstantFoldingPhase.cpp122 node->children.setChild2(Edge());
123 node->children.setChild3(Edge());
162 Edge childEdge = node->child1();
186 Edge childEdge = node->child1();
208 Edge childEdge = node->child1();
236 Edge childEdge = node->child1();
336 Edge childEdge = node->child1();
366 Edge propertyStorage;
371 propertyStorage = Edge(m_insertionSet.insertNode(
386 Edge childEdg
[all...]
H A DDFGEdgeDominates.h46 void operator()(Node*, Edge edge)
H A DDFGCPSRethreadingPhase.cpp90 node->children.setChild1(Edge());
167 node->children.setChild1(Edge(otherNode));
182 node->children.setChild1(Edge(otherNode));
197 node->children.setChild1(Edge(otherNode));
215 node->children.setChild1(Edge(phi));
277 node->children.setChild1(Edge(otherNode));
282 node->children.setChild1(Edge(addPhi<operandKind>(node->origin, variable, idx)));
446 currentPhi->children.setChild1(Edge(variableInPrevious));
450 currentPhi->children.setChild2(Edge(variableInPrevious));
454 currentPhi->children.setChild3(Edge(variableInPreviou
[all...]
H A DDFGLivenessAnalysisPhase.cpp144 void addChildUse(Node*, Edge& edge)
149 void addChildUse(Edge& edge)
H A DDFGSpeculativeJIT.h137 GPRReg fillJSValue(Edge);
139 bool fillJSValue(Edge, GPRReg&, GPRReg&, FPRReg&);
141 GPRReg fillStorage(Edge);
167 bool canReuse(Edge nodeUse)
276 void use(Edge nodeUse)
299 void writeBarrier(GPRReg owner, GPRReg value, Edge valueUse, GPRReg scratch1, GPRReg scratch2);
300 void writeBarrier(JSCell* owner, GPRReg value, Edge valueUse, GPRReg scratch1, GPRReg scratch2);
311 GPRReg fillSpeculateInt32(Edge, DataFormat& returnFormat);
312 GPRReg fillSpeculateInt32Strict(Edge);
313 GPRReg fillSpeculateInt52(Edge, DataForma
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/Analysis/
H A DProfileDataLoader.h42 // The profiling information defines an Edge by its source and sink basic
44 typedef std::pair<const BType*, const BType*> Edge; typedef in class:llvm::ProfileDataT
47 typedef DenseMap<Edge, unsigned> EdgeWeights;
57 /// getFunction() - Returns the Function for an Edge.
58 static const FType *getFunction(Edge e) {
61 && "A ProfileData::Edge can not be between two functions");
62 assert(e.second && "A ProfileData::Edge must have a real sink");
66 /// getEdge() - Creates an Edge between two BasicBlocks.
67 static Edge getEdge(const BType *Src, const BType *Dest) {
68 return Edge(Sr
[all...]
H A DProfileInfo.h58 typedef std::pair<const BType*, const BType*> Edge; typedef in class:llvm::ProfileInfoT
59 typedef std::pair<Edge, double> EdgeWeight;
60 typedef std::map<Edge, double> EdgeWeights;
87 // getFunction() - Returns the Function for an Edge, checking for validity.
88 static const FType* getFunction(Edge e) {
93 llvm_unreachable("Invalid ProfileInfo::Edge");
96 // getEdge() - Creates an Edge from two BasicBlocks.
97 static Edge getEdge(const BType *Src, const BType *Dest) {
112 double getEdgeWeight(Edge e) const {
123 void setEdgeWeight(Edge
[all...]
H A DBranchProbabilityInfo.h113 typedef std::pair<const BasicBlock *, unsigned> Edge; typedef in class:llvm::BranchProbabilityInfo
123 DenseMap<Edge, uint32_t> Weights;
/macosx-10.10.1/llvmCore-3425.0.34/lib/Analysis/
H A DProfileEstimatorPass.cpp38 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 << ":"
134 Edge edge = getEdge(*bbi,BB);
158 SmallVector<Edge, 8> ExitEdges;
159 SmallVector<Edge, 8> Edges;
183 std::set<Edge> ProcessedExit
[all...]
H A DProfileInfoLoaderPass.cpp42 std::set<Edge> SpanningTree;
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,
126 Edge tocalc;
132 void LoaderPass::readEdge(ProfileInfo::Edge e,
143 DEBUG(dbgs() << "--Read Edge Counter for " << e
200 for (std::set<Edge>
[all...]
H A DProfileInfo.cpp75 Edge e = getEdge(0, BB);
102 Edge e = getEdge(BB,0);
183 void ProfileInfoT<Function,BasicBlock>::addEdgeWeight(Edge e, double w) {
185 assert (oldw != MissingValue && "Adding weight to Edge with no previous weight");
186 DEBUG(dbgs() << "Adding to Edge " << e
212 void ProfileInfoT<Function,BasicBlock>::removeEdge(Edge e) {
223 replaceEdge(const Edge &oldedge, const Edge &newedge) {
260 Edge e = getEdge(BB,*Succ);
282 divertFlow(const Edge
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/lib/Transforms/Instrumentation/
H A DMaximumSpanningTree.h30 typedef std::pair<const T*, const T*> Edge; typedef in class:llvm::MaximumSpanningTree
31 typedef std::pair<Edge, double> EdgeWeight;
34 typedef std::vector<Edge> MaxSpanTree;
80 Edge e = (*EWi).first;
89 Edge e = (*EWi).first;
/macosx-10.10.1/dyld-353.2.1/launch-cache/
H A DMachOTrie.hpp36 struct Edge struct in namespace:mach_o::trie
38 Edge(const char* s, struct Node* n) : fSubString(s), fChild(n) { } function in struct:mach_o::trie::Edge
39 ~Edge() { }
52 std::vector<Edge> fChildren;
63 for (std::vector<Edge>::iterator it = fChildren.begin(); it != fChildren.end(); ++it) {
64 Edge& e = *it;
84 Edge& abEdge = e;
87 Edge bcEdge(bcEdgeStr, cNode);
98 Edge newEdge(strdup(partialStr), newNode);
117 for (std::vector<Edge>
[all...]

Completed in 200 milliseconds

123