Home
last modified time | relevance | path

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

/external/openscreen/third_party/abseil/src/absl/synchronization/internal/
Dgraphcycles.h50 struct GraphId { struct
53 bool operator==(const GraphId& x) const { return handle == x.handle; } argument
54 bool operator!=(const GraphId& x) const { return handle != x.handle; }
58 inline GraphId InvalidGraphId() { in InvalidGraphId()
59 return GraphId{0}; in InvalidGraphId()
70 GraphId GetId(void* ptr);
78 void* Ptr(GraphId id);
83 bool InsertEdge(GraphId source_node, GraphId dest_node);
86 void RemoveEdge(GraphId source_node, GraphId dest_node);
89 bool HasNode(GraphId node);
[all …]
Dgraphcycles.cc263 inline GraphId MakeId(int32_t index, uint32_t version) { in MakeId()
264 GraphId g; in MakeId()
270 inline int32_t NodeIndex(GraphId id) { in NodeIndex()
274 inline uint32_t NodeVersion(GraphId id) { in NodeVersion()
360 static Node* FindNode(GraphCycles::Rep* rep, GraphId id) { in FindNode()
406 GraphId GraphCycles::GetId(void* ptr) { in GetId()
460 void* GraphCycles::Ptr(GraphId id) { in Ptr()
466 bool GraphCycles::HasNode(GraphId node) { in HasNode()
470 bool GraphCycles::HasEdge(GraphId x, GraphId y) const { in HasEdge()
475 void GraphCycles::RemoveEdge(GraphId x, GraphId y) { in RemoveEdge()
[all …]
Dgraphcycles_test.cc43 typedef std::map<int, GraphId> IdMap;
44 static GraphId Get(const IdMap& id, int num) { in Get()
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
284 GraphId path[2*kMaxNodes]; in TEST()
322 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
389 GraphId path[5]; in Path()
Dgraphcycles_benchmark.cc30 std::vector<absl::synchronization_internal::GraphId> nodes(num_nodes); in BM_StressTest()
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.h50 struct GraphId { struct
53 bool operator==(const GraphId& x) const { return handle == x.handle; } argument
54 bool operator!=(const GraphId& x) const { return handle != x.handle; }
58 inline GraphId InvalidGraphId() { in InvalidGraphId()
59 return GraphId{0}; in InvalidGraphId()
70 GraphId GetId(void* ptr);
78 void* Ptr(GraphId id);
83 bool InsertEdge(GraphId source_node, GraphId dest_node);
86 void RemoveEdge(GraphId source_node, GraphId dest_node);
89 bool HasNode(GraphId node);
[all …]
Dgraphcycles.cc262 inline GraphId MakeId(int32_t index, uint32_t version) { in MakeId()
263 GraphId g; in MakeId()
269 inline int32_t NodeIndex(GraphId id) { in NodeIndex()
273 inline uint32_t NodeVersion(GraphId id) { in NodeVersion()
359 static Node* FindNode(GraphCycles::Rep* rep, GraphId id) { in FindNode()
405 GraphId GraphCycles::GetId(void* ptr) { in GetId()
459 void* GraphCycles::Ptr(GraphId id) { in Ptr()
465 bool GraphCycles::HasNode(GraphId node) { in HasNode()
469 bool GraphCycles::HasEdge(GraphId x, GraphId y) const { in HasEdge()
474 void GraphCycles::RemoveEdge(GraphId x, GraphId y) { in RemoveEdge()
[all …]
Dgraphcycles_test.cc43 typedef std::map<int, GraphId> IdMap;
44 static GraphId Get(const IdMap& id, int num) { in Get()
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
284 GraphId path[2*kMaxNodes]; in TEST()
322 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
389 GraphId path[5]; in Path()
Dgraphcycles_benchmark.cc30 std::vector<absl::synchronization_internal::GraphId> nodes(num_nodes); in BM_StressTest()
/external/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.h50 struct GraphId { struct
53 bool operator==(const GraphId& x) const { return handle == x.handle; } argument
54 bool operator!=(const GraphId& x) const { return handle != x.handle; }
58 inline GraphId InvalidGraphId() { in InvalidGraphId()
59 return GraphId{0}; in InvalidGraphId()
70 GraphId GetId(void* ptr);
78 void* Ptr(GraphId id);
83 bool InsertEdge(GraphId source_node, GraphId dest_node);
86 void RemoveEdge(GraphId source_node, GraphId dest_node);
89 bool HasNode(GraphId node);
[all …]
Dgraphcycles.cc262 inline GraphId MakeId(int32_t index, uint32_t version) { in MakeId()
263 GraphId g; in MakeId()
269 inline int32_t NodeIndex(GraphId id) { in NodeIndex()
273 inline uint32_t NodeVersion(GraphId id) { in NodeVersion()
359 static Node* FindNode(GraphCycles::Rep* rep, GraphId id) { in FindNode()
405 GraphId GraphCycles::GetId(void* ptr) { in GetId()
459 void* GraphCycles::Ptr(GraphId id) { in Ptr()
465 bool GraphCycles::HasNode(GraphId node) { in HasNode()
469 bool GraphCycles::HasEdge(GraphId x, GraphId y) const { in HasEdge()
474 void GraphCycles::RemoveEdge(GraphId x, GraphId y) { in RemoveEdge()
[all …]
Dgraphcycles_test.cc43 typedef std::map<int, GraphId> IdMap;
44 static GraphId Get(const IdMap& id, int num) { in Get()
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
284 GraphId path[2*kMaxNodes]; in TEST()
322 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
389 GraphId path[5]; in Path()
Dgraphcycles_benchmark.cc30 std::vector<absl::synchronization_internal::GraphId> nodes(num_nodes); in BM_StressTest()
/external/webrtc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.h50 struct GraphId { struct
53 bool operator==(const GraphId& x) const { return handle == x.handle; } argument
54 bool operator!=(const GraphId& x) const { return handle != x.handle; }
58 inline GraphId InvalidGraphId() { in InvalidGraphId()
59 return GraphId{0}; in InvalidGraphId()
70 GraphId GetId(void* ptr);
78 void* Ptr(GraphId id);
83 bool InsertEdge(GraphId source_node, GraphId dest_node);
86 void RemoveEdge(GraphId source_node, GraphId dest_node);
89 bool HasNode(GraphId node);
[all …]
Dgraphcycles.cc262 inline GraphId MakeId(int32_t index, uint32_t version) { in MakeId()
263 GraphId g; in MakeId()
269 inline int32_t NodeIndex(GraphId id) { in NodeIndex()
273 inline uint32_t NodeVersion(GraphId id) { in NodeVersion()
359 static Node* FindNode(GraphCycles::Rep* rep, GraphId id) { in FindNode()
405 GraphId GraphCycles::GetId(void* ptr) { in GetId()
459 void* GraphCycles::Ptr(GraphId id) { in Ptr()
465 bool GraphCycles::HasNode(GraphId node) { in HasNode()
469 bool GraphCycles::HasEdge(GraphId x, GraphId y) const { in HasEdge()
474 void GraphCycles::RemoveEdge(GraphId x, GraphId y) { in RemoveEdge()
[all …]
Dgraphcycles_test.cc43 typedef std::map<int, GraphId> IdMap;
44 static GraphId Get(const IdMap& id, int num) { in Get()
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
284 GraphId path[2*kMaxNodes]; in TEST()
322 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
389 GraphId path[5]; in Path()
Dgraphcycles_benchmark.cc30 std::vector<absl::synchronization_internal::GraphId> nodes(num_nodes); in BM_StressTest()
/external/libtextclassifier/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.h50 struct GraphId { struct
53 bool operator==(const GraphId& x) const { return handle == x.handle; } argument
54 bool operator!=(const GraphId& x) const { return handle != x.handle; }
58 inline GraphId InvalidGraphId() { in InvalidGraphId()
59 return GraphId{0}; in InvalidGraphId()
70 GraphId GetId(void* ptr);
78 void* Ptr(GraphId id);
83 bool InsertEdge(GraphId source_node, GraphId dest_node);
86 void RemoveEdge(GraphId source_node, GraphId dest_node);
89 bool HasNode(GraphId node);
[all …]
Dgraphcycles.cc262 inline GraphId MakeId(int32_t index, uint32_t version) { in MakeId()
263 GraphId g; in MakeId()
269 inline int32_t NodeIndex(GraphId id) { in NodeIndex()
273 inline uint32_t NodeVersion(GraphId id) { in NodeVersion()
359 static Node* FindNode(GraphCycles::Rep* rep, GraphId id) { in FindNode()
405 GraphId GraphCycles::GetId(void* ptr) { in GetId()
459 void* GraphCycles::Ptr(GraphId id) { in Ptr()
465 bool GraphCycles::HasNode(GraphId node) { in HasNode()
469 bool GraphCycles::HasEdge(GraphId x, GraphId y) const { in HasEdge()
474 void GraphCycles::RemoveEdge(GraphId x, GraphId y) { in RemoveEdge()
[all …]
Dgraphcycles_test.cc43 typedef std::map<int, GraphId> IdMap;
44 static GraphId Get(const IdMap& id, int num) { in Get()
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
284 GraphId path[2*kMaxNodes]; in TEST()
322 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
389 GraphId path[5]; in Path()
Dgraphcycles_benchmark.cc30 std::vector<absl::synchronization_internal::GraphId> nodes(num_nodes); in BM_StressTest()
/external/abseil-cpp/absl/synchronization/
Dmutex.cc64 using absl::synchronization_internal::GraphId;
502 GraphId id; // deadlock_graph id of acquired lock
1149 static GraphId GetGraphIdLocked(Mutex *mu) in GetGraphIdLocked()
1159 static GraphId GetGraphId(Mutex *mu) ABSL_LOCKS_EXCLUDED(deadlock_graph_mu) { in GetGraphId()
1161 GraphId id = GetGraphIdLocked(mu); in GetGraphId()
1169 static void LockEnter(Mutex* mu, GraphId id, SynchLocksHeld *held_locks) { in LockEnter()
1193 static void LockLeave(Mutex* mu, GraphId id, SynchLocksHeld *held_locks) { in LockLeave()
1239 static inline void DebugOnlyLockEnter(Mutex *mu, GraphId id) { in DebugOnlyLockEnter()
1292 GraphId path[kMaxDeadlockPathLen];
1312 static GraphId DeadlockCheck(Mutex *mu) { in DeadlockCheck()
[all …]
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/
Dmutex.cc67 using absl::synchronization_internal::GraphId;
504 GraphId id; // deadlock_graph id of acquired lock
1152 static GraphId GetGraphIdLocked(Mutex *mu) in GetGraphIdLocked()
1162 static GraphId GetGraphId(Mutex *mu) ABSL_LOCKS_EXCLUDED(deadlock_graph_mu) { in GetGraphId()
1164 GraphId id = GetGraphIdLocked(mu); in GetGraphId()
1172 static void LockEnter(Mutex* mu, GraphId id, SynchLocksHeld *held_locks) { in LockEnter()
1196 static void LockLeave(Mutex* mu, GraphId id, SynchLocksHeld *held_locks) { in LockLeave()
1242 static inline void DebugOnlyLockEnter(Mutex *mu, GraphId id) { in DebugOnlyLockEnter()
1295 GraphId path[kMaxDeadlockPathLen];
1315 static GraphId DeadlockCheck(Mutex *mu) { in DeadlockCheck()
[all …]
/external/openscreen/third_party/abseil/src/absl/synchronization/
Dmutex.cc67 using absl::synchronization_internal::GraphId;
504 GraphId id; // deadlock_graph id of acquired lock
1152 static GraphId GetGraphIdLocked(Mutex *mu) in GetGraphIdLocked()
1162 static GraphId GetGraphId(Mutex *mu) ABSL_LOCKS_EXCLUDED(deadlock_graph_mu) { in GetGraphId()
1164 GraphId id = GetGraphIdLocked(mu); in GetGraphId()
1172 static void LockEnter(Mutex* mu, GraphId id, SynchLocksHeld *held_locks) { in LockEnter()
1196 static void LockLeave(Mutex* mu, GraphId id, SynchLocksHeld *held_locks) { in LockLeave()
1242 static inline void DebugOnlyLockEnter(Mutex *mu, GraphId id) { in DebugOnlyLockEnter()
1295 GraphId path[kMaxDeadlockPathLen];
1315 static GraphId DeadlockCheck(Mutex *mu) { in DeadlockCheck()
[all …]
/external/webrtc/third_party/abseil-cpp/absl/synchronization/
Dmutex.cc64 using absl::synchronization_internal::GraphId;
502 GraphId id; // deadlock_graph id of acquired lock
1149 static GraphId GetGraphIdLocked(Mutex *mu) in GetGraphIdLocked()
1159 static GraphId GetGraphId(Mutex *mu) ABSL_LOCKS_EXCLUDED(deadlock_graph_mu) { in GetGraphId()
1161 GraphId id = GetGraphIdLocked(mu); in GetGraphId()
1169 static void LockEnter(Mutex* mu, GraphId id, SynchLocksHeld *held_locks) { in LockEnter()
1193 static void LockLeave(Mutex* mu, GraphId id, SynchLocksHeld *held_locks) { in LockLeave()
1239 static inline void DebugOnlyLockEnter(Mutex *mu, GraphId id) { in DebugOnlyLockEnter()
1292 GraphId path[kMaxDeadlockPathLen];
1312 static GraphId DeadlockCheck(Mutex *mu) { in DeadlockCheck()
[all …]
/external/libtextclassifier/abseil-cpp/absl/synchronization/
Dmutex.cc67 using absl::synchronization_internal::GraphId;
504 GraphId id; // deadlock_graph id of acquired lock
1152 static GraphId GetGraphIdLocked(Mutex *mu) in GetGraphIdLocked()
1162 static GraphId GetGraphId(Mutex *mu) ABSL_LOCKS_EXCLUDED(deadlock_graph_mu) { in GetGraphId()
1164 GraphId id = GetGraphIdLocked(mu); in GetGraphId()
1172 static void LockEnter(Mutex* mu, GraphId id, SynchLocksHeld *held_locks) { in LockEnter()
1196 static void LockLeave(Mutex* mu, GraphId id, SynchLocksHeld *held_locks) { in LockLeave()
1242 static inline void DebugOnlyLockEnter(Mutex *mu, GraphId id) { in DebugOnlyLockEnter()
1295 GraphId path[kMaxDeadlockPathLen];
1315 static GraphId DeadlockCheck(Mutex *mu) { in DeadlockCheck()
[all …]