Home
last modified time | relevance | path

Searched refs:GraphBase (Results 1 – 25 of 32) sorted by relevance

12

/external/rust/android-crates-io/crates/petgraph/src/visit/
Dmod.rs88 pub trait GraphBase { trait
100 GraphBase! {delegate_impl []}
101 GraphBase! {delegate_impl [['a, G], G, &'a mut G, deref]}
104 pub trait GraphRef: Copy + GraphBase {}
106 impl<'a, G> GraphRef for &'a G where G: GraphBase {}
208 pub trait Data : GraphBase {
323 pub trait GraphProp : GraphBase {
340 pub trait NodeIndexable : GraphBase {
357 pub trait EdgeIndexable : GraphBase {
374 pub trait NodeCount : GraphBase {
[all …]
Dreversed.rs4 Data, EdgeCount, EdgeIndexable, EdgeRef, GetAdjacencyMatrix, GraphBase, GraphProp, GraphRef,
16 impl<G: GraphBase> GraphBase for Reversed<G> {
Dfilter.rs10 EdgeIndexable, GraphBase, GraphProp, IntoEdgeReferences, IntoEdges, IntoEdgesDirected,
76 G: GraphBase,
85 impl<G, F> GraphBase for NodeFiltered<G, F>
87 G: GraphBase,
392 impl<G, F> GraphBase for EdgeFiltered<G, F>
394 G: GraphBase,
/external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/CodeGen/PBQP/
DSolution.h28 using SelectionsMap = std::map<GraphBase::NodeId, unsigned>;
38 void setSelection(GraphBase::NodeId nodeId, unsigned selection) { in setSelection()
45 unsigned getSelection(GraphBase::NodeId nodeId) const { in getSelection()
DGraph.h26 class GraphBase {
46 class Graph : public GraphBase {
DReductionRules.h181 using NodeId = GraphBase::NodeId; in backpropagate()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/
DSolution.h28 using SelectionsMap = std::map<GraphBase::NodeId, unsigned>;
38 void setSelection(GraphBase::NodeId nodeId, unsigned selection) { in setSelection()
45 unsigned getSelection(GraphBase::NodeId nodeId) const { in getSelection()
DGraph.h26 class GraphBase {
46 class Graph : public GraphBase {
DReductionRules.h181 using NodeId = GraphBase::NodeId; in backpropagate()
/external/llvm/include/llvm/CodeGen/PBQP/
DSolution.h30 typedef std::map<GraphBase::NodeId, unsigned> SelectionsMap;
76 void setSelection(GraphBase::NodeId nodeId, unsigned selection) { in setSelection()
83 unsigned getSelection(GraphBase::NodeId nodeId) const { in getSelection()
DGraph.h28 class GraphBase {
48 class Graph : public GraphBase {
DReductionRules.h180 typedef GraphBase::NodeId NodeId; in backpropagate()
/external/rust/android-crates-io/crates/petgraph/src/algo/
Dmatching.rs5 EdgeRef, GraphBase, IntoEdges, IntoNeighbors, IntoNodeIdentifiers, NodeCount, NodeIndexable,
12 pub struct Matching<G: GraphBase> {
20 G: GraphBase,
134 pub struct MatchedNodes<'a, G: GraphBase> {
160 pub struct MatchedEdges<'a, G: GraphBase> {
264 enum Label<G: GraphBase> {
278 impl<G: GraphBase> Label<G> {
306 impl<G: GraphBase> Default for Label<G> {
312 impl<G: GraphBase> PartialEq for Label<G> {
Disomorphism.rs7 use crate::visit::GraphBase;
156 pub trait NodeMatcher<G0: GraphBase, G1: GraphBase> {
161 impl<G0: GraphBase, G1: GraphBase> NodeMatcher<G0, G1> for NoSemanticMatch {
174 G0: GraphBase + DataMap,
175 G1: GraphBase + DataMap,
192 pub trait EdgeMatcher<G0: GraphBase, G1: GraphBase> {
203 impl<G0: GraphBase, G1: GraphBase> EdgeMatcher<G0, G1> for NoSemanticMatch {
222 G0: GraphBase + DataMap + IntoEdgesDirected,
223 G1: GraphBase + DataMap + IntoEdgesDirected,
268 G0: GraphBase,
[all …]
Dastar.rs7 use crate::visit::{EdgeRef, GraphBase, IntoEdges, Visitable};
144 G: GraphBase,
152 G: GraphBase,
Ddominators.rs19 use crate::visit::{DfsPostOrder, GraphBase, IntoNeighbors, Visitable, Walker};
164 <G as GraphBase>::NodeId: Eq + Hash, in simple_fast()
283 <G as GraphBase>::NodeId: Eq + Hash, in simple_fast_post_order()
Dtred.rs14 GraphBase, IntoNeighbors, IntoNeighborsDirected, NodeCompactIndexable, NodeCount,
66 G: GraphBase + IntoNeighborsDirected + NodeCompactIndexable + NodeCount, in dag_to_toposorted_adjacency_list()
Dmod.rs29 GraphBase, GraphRef, IntoEdgeReferences, IntoNeighbors, IntoNeighborsDirected,
211 type DfsSpaceType<G> = DfsSpace<<G as GraphBase>::NodeId, <G as Visitable>::Map>;
/external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h148 void setNodeIdForVReg(Register VReg, GraphBase::NodeId NId) { in setNodeIdForVReg()
152 GraphBase::NodeId getNodeIdForVReg(Register VReg) const { in getNodeIdForVReg()
155 return GraphBase::invalidNodeId(); in getNodeIdForVReg()
164 DenseMap<Register, GraphBase::NodeId> VRegToNodeId;
281 using NodeId = GraphBase::NodeId;
282 using EdgeId = GraphBase::EdgeId;
428 std::vector<GraphBase::NodeId> reduce() { in reduce()
431 using NodeId = GraphBase::NodeId; in reduce()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h146 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { in setNodeIdForVReg()
150 GraphBase::NodeId getNodeIdForVReg(unsigned VReg) const { in getNodeIdForVReg()
153 return GraphBase::invalidNodeId(); in getNodeIdForVReg()
162 DenseMap<unsigned, GraphBase::NodeId> VRegToNodeId;
278 using NodeId = GraphBase::NodeId;
279 using EdgeId = GraphBase::EdgeId;
425 std::vector<GraphBase::NodeId> reduce() { in reduce()
428 using NodeId = GraphBase::NodeId; in reduce()
/external/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h155 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { in setNodeIdForVReg()
159 GraphBase::NodeId getNodeIdForVReg(unsigned VReg) const { in getNodeIdForVReg()
162 return GraphBase::invalidNodeId(); in getNodeIdForVReg()
175 DenseMap<unsigned, GraphBase::NodeId> VRegToNodeId;
339 typedef GraphBase::NodeId NodeId;
340 typedef GraphBase::EdgeId EdgeId;
491 std::vector<GraphBase::NodeId> reduce() { in reduce()
494 typedef GraphBase::NodeId NodeId; in reduce()
/external/rust/android-crates-io/crates/petgraph/src/graph_impl/
Dfrozen.rs8 Data, EdgeCount, EdgeIndexable, GetAdjacencyMatrix, GraphBase, GraphProp, IntoEdges,
83 impl<'a, G> GraphBase for Frozen<'a, G>
85 G: GraphBase,
/external/llvm/lib/CodeGen/
DRegAllocPBQP.cpp192 typedef std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId> IEdgeKey;
228 typedef std::tuple<LiveInterval*, size_t, PBQP::GraphBase::NodeId>
239 static PBQP::GraphBase::NodeId getNodeId(const IntervalInfo &I) { in getNodeId()
336 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply()
338 PBQP::GraphBase::NodeId MId = getNodeId(A); in apply()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DRegAllocPBQP.cpp221 using IEdgeKey = std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId>;
258 std::tuple<LiveInterval*, size_t, PBQP::GraphBase::NodeId>;
268 static PBQP::GraphBase::NodeId getNodeId(const IntervalInfo &I) { in getNodeId()
365 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply()
367 PBQP::GraphBase::NodeId MId = getNodeId(A); in apply()
/external/swiftshader/third_party/llvm-16.0/llvm/lib/CodeGen/
DRegAllocPBQP.cpp220 using IEdgeKey = std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId>;
257 std::tuple<LiveInterval*, size_t, PBQP::GraphBase::NodeId>;
267 static PBQP::GraphBase::NodeId getNodeId(const IntervalInfo &I) { in getNodeId()
364 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply()
366 PBQP::GraphBase::NodeId MId = getNodeId(A); in apply()

12