Classes | Typedefs | Functions | Variables
absl::synchronization_internal Namespace Reference

Classes

struct  Edge
 
class  GraphCycles
 
class  GraphCyclesTest
 
struct  GraphId
 
class  KernelTimeout
 
class  PerThreadSem
 
class  PerThreadSemTest
 
class  SimpleSemaphore
 
struct  ThreadData
 
class  ThreadPool
 
class  Waiter
 

Typedefs

using Edges = std::vector< Edge >
 
typedef std::map< int, GraphIdIdMap
 
using Nodes = std::vector< int >
 
using RandomEngine = std::mt19937_64
 

Functions

static void BackwardDFS (GraphCycles::Rep *r, int32_t n, int32_t lower_bound)
 
static void BackwardDFS (GraphCycles::Rep *r, int32_t n, int32_t lower_bound)
 
static void CheckEdges (Nodes *nodes, Edges *edges, const IdMap &id, GraphCycles *gc)
 
static void CheckEdges (Nodes *nodes, Edges *edges, const IdMap &id, GraphCycles *gc)
 
static void CheckInvariants (const GraphCycles &gc)
 
static void CheckInvariants (const GraphCycles &gc)
 
static void CheckTransitiveClosure (Nodes *nodes, Edges *edges, const IdMap &id, GraphCycles *gc)
 
static void CheckTransitiveClosure (Nodes *nodes, Edges *edges, const IdMap &id, GraphCycles *gc)
 
base_internal::ThreadIdentityCreateThreadIdentity ()
 
static int EdgeIndex (Edges *edges, int from, int to)
 
static int EdgeIndex (Edges *edges, int from, int to)
 
static Node * FindNode (GraphCycles::Rep *rep, GraphId id)
 
static Node * FindNode (GraphCycles::Rep *rep, GraphId id)
 
static bool ForwardDFS (GraphCycles::Rep *r, int32_t n, int32_t upper_bound)
 
static bool ForwardDFS (GraphCycles::Rep *r, int32_t n, int32_t upper_bound)
 
static ABSL_CONST_INIT base_internal::SpinLock freelist_lock (absl::kConstInit, base_internal::SCHEDULE_KERNEL_ONLY)
 
static ABSL_CONST_INIT base_internal::SpinLock freelist_lock (absl::kConstInit, base_internal::SCHEDULE_KERNEL_ONLY)
 
static GraphId Get (const IdMap &id, int num)
 
static GraphId Get (const IdMap &id, int num)
 
base_internal::ThreadIdentityGetOrCreateCurrentThreadIdentity ()
 
GraphId InvalidGraphId ()
 
static bool IsReachable (Edges *edges, int from, int to, std::unordered_set< int > *seen)
 
static bool IsReachable (Edges *edges, int from, int to, std::unordered_set< int > *seen)
 
static void MaybeBecomeIdle ()
 
static void MaybeBecomeIdle ()
 
static void MoveToList (GraphCycles::Rep *r, Vec< int32_t > *src, Vec< int32_t > *dst)
 
static void MoveToList (GraphCycles::Rep *r, Vec< int32_t > *src, Vec< int32_t > *dst)
 
int MutexDelay (int32_t c, int mode)
 
static base_internal::ThreadIdentityNewThreadIdentity ()
 
static base_internal::ThreadIdentityNewThreadIdentity ()
 
void OneTimeInitThreadIdentity (base_internal::ThreadIdentity *identity)
 
static void PrintEdges (Edges *edges)
 
static void PrintEdges (Edges *edges)
 
static void PrintGCEdges (Nodes *nodes, const IdMap &id, GraphCycles *gc)
 
static void PrintGCEdges (Nodes *nodes, const IdMap &id, GraphCycles *gc)
 
static void PrintGCTransitiveClosure (Nodes *nodes, const IdMap &id, GraphCycles *gc)
 
static void PrintGCTransitiveClosure (Nodes *nodes, const IdMap &id, GraphCycles *gc)
 
static void PrintTransitiveClosure (Nodes *nodes, Edges *edges)
 
static void PrintTransitiveClosure (Nodes *nodes, Edges *edges)
 
static int RandomEdge (RandomEngine *rng, Edges *edges)
 
static int RandomEdge (RandomEngine *rng, Edges *edges)
 
static int RandomNode (RandomEngine *rng, Nodes *nodes)
 
static int RandomNode (RandomEngine *rng, Nodes *nodes)
 
static void ReclaimThreadIdentity (void *v)
 
static void Reorder (GraphCycles::Rep *r)
 
static void Reorder (GraphCycles::Rep *r)
 
static void ResetThreadIdentity (base_internal::ThreadIdentity *identity)
 
static void ResetThreadIdentityBetweenReuse (base_internal::ThreadIdentity *identity)
 
static intptr_t RoundUp (intptr_t addr, intptr_t align)
 
static intptr_t RoundUp (intptr_t addr, intptr_t align)
 
static void Sort (const Vec< Node * > &, Vec< int32_t > *delta)
 
static void Sort (const Vec< Node * > &, Vec< int32_t > *delta)
 
 TEST (GraphCycles, RandomizedTest)
 
 TEST_F (GraphCyclesTest, IndirectCycle)
 
 TEST_F (GraphCyclesTest, LongPath)
 
 TEST_F (GraphCyclesTest, ManyEdges)
 
 TEST_F (GraphCyclesTest, NoCycle)
 
 TEST_F (GraphCyclesTest, RemoveNode)
 
 TEST_F (GraphCyclesTest, SimpleCycle)
 

Variables

static ABSL_CONST_INIT base_internal::ThreadIdentitythread_identity_freelist
 
static ABSL_CONST_INIT base_internal::ThreadIdentitythread_identity_freelist
 

Typedef Documentation

◆ Edges

◆ IdMap

◆ Nodes

◆ RandomEngine

Function Documentation

◆ BackwardDFS() [1/2]

static void absl::synchronization_internal::BackwardDFS ( GraphCycles::Rep r,
int32_t  n,
int32_t  lower_bound 
)
static

◆ BackwardDFS() [2/2]

static void absl::synchronization_internal::BackwardDFS ( GraphCycles::Rep r,
int32_t  n,
int32_t  lower_bound 
)
static

◆ CheckEdges() [1/2]

static void absl::synchronization_internal::CheckEdges ( Nodes nodes,
Edges edges,
const IdMap id,
GraphCycles gc 
)
static

◆ CheckEdges() [2/2]

static void absl::synchronization_internal::CheckEdges ( Nodes nodes,
Edges edges,
const IdMap id,
GraphCycles gc 
)
static

◆ CheckInvariants() [1/2]

static void absl::synchronization_internal::CheckInvariants ( const GraphCycles gc)
static

◆ CheckInvariants() [2/2]

static void absl::synchronization_internal::CheckInvariants ( const GraphCycles gc)
static

◆ CheckTransitiveClosure() [1/2]

static void absl::synchronization_internal::CheckTransitiveClosure ( Nodes nodes,
Edges edges,
const IdMap id,
GraphCycles gc 
)
static

◆ CheckTransitiveClosure() [2/2]

static void absl::synchronization_internal::CheckTransitiveClosure ( Nodes nodes,
Edges edges,
const IdMap id,
GraphCycles gc 
)
static

◆ CreateThreadIdentity()

base_internal::ThreadIdentity * absl::synchronization_internal::CreateThreadIdentity ( )

◆ EdgeIndex() [1/2]

static int absl::synchronization_internal::EdgeIndex ( Edges edges,
int  from,
int  to 
)
static

◆ EdgeIndex() [2/2]

static int absl::synchronization_internal::EdgeIndex ( Edges edges,
int  from,
int  to 
)
static

◆ FindNode() [1/2]

static Node* absl::synchronization_internal::FindNode ( GraphCycles::Rep rep,
GraphId  id 
)
static

◆ FindNode() [2/2]

static Node* absl::synchronization_internal::FindNode ( GraphCycles::Rep rep,
GraphId  id 
)
static

◆ ForwardDFS() [1/2]

static bool absl::synchronization_internal::ForwardDFS ( GraphCycles::Rep r,
int32_t  n,
int32_t  upper_bound 
)
static

◆ ForwardDFS() [2/2]

static bool absl::synchronization_internal::ForwardDFS ( GraphCycles::Rep r,
int32_t  n,
int32_t  upper_bound 
)
static

◆ freelist_lock() [1/2]

static ABSL_CONST_INIT base_internal::SpinLock absl::synchronization_internal::freelist_lock ( absl::kConstInit  ,
base_internal::SCHEDULE_KERNEL_ONLY   
)
static

◆ freelist_lock() [2/2]

static ABSL_CONST_INIT base_internal::SpinLock absl::synchronization_internal::freelist_lock ( absl::kConstInit  ,
base_internal::SCHEDULE_KERNEL_ONLY   
)
static

◆ Get() [1/2]

static GraphId absl::synchronization_internal::Get ( const IdMap id,
int  num 
)
static

◆ Get() [2/2]

static GraphId absl::synchronization_internal::Get ( const IdMap id,
int  num 
)
static

◆ GetOrCreateCurrentThreadIdentity()

base_internal::ThreadIdentity * absl::synchronization_internal::GetOrCreateCurrentThreadIdentity ( )
inline

◆ InvalidGraphId()

GraphId absl::synchronization_internal::InvalidGraphId ( )
inline

◆ IsReachable() [1/2]

static bool absl::synchronization_internal::IsReachable ( Edges edges,
int  from,
int  to,
std::unordered_set< int > *  seen 
)
static

◆ IsReachable() [2/2]

static bool absl::synchronization_internal::IsReachable ( Edges edges,
int  from,
int  to,
std::unordered_set< int > *  seen 
)
static

◆ MaybeBecomeIdle() [1/2]

static void absl::synchronization_internal::MaybeBecomeIdle ( )
static

◆ MaybeBecomeIdle() [2/2]

static void absl::synchronization_internal::MaybeBecomeIdle ( )
static

◆ MoveToList() [1/2]

static void absl::synchronization_internal::MoveToList ( GraphCycles::Rep r,
Vec< int32_t > *  src,
Vec< int32_t > *  dst 
)
static

◆ MoveToList() [2/2]

static void absl::synchronization_internal::MoveToList ( GraphCycles::Rep r,
Vec< int32_t > *  src,
Vec< int32_t > *  dst 
)
static

◆ MutexDelay()

int absl::synchronization_internal::MutexDelay ( int32_t  c,
int  mode 
)

Definition at line 165 of file abseil-cpp/absl/synchronization/mutex.cc.

◆ NewThreadIdentity() [1/2]

static base_internal::ThreadIdentity* absl::synchronization_internal::NewThreadIdentity ( )
static

◆ NewThreadIdentity() [2/2]

static base_internal::ThreadIdentity* absl::synchronization_internal::NewThreadIdentity ( )
static

◆ OneTimeInitThreadIdentity()

void absl::synchronization_internal::OneTimeInitThreadIdentity ( base_internal::ThreadIdentity identity)

◆ PrintEdges() [1/2]

static void absl::synchronization_internal::PrintEdges ( Edges edges)
static

◆ PrintEdges() [2/2]

static void absl::synchronization_internal::PrintEdges ( Edges edges)
static

◆ PrintGCEdges() [1/2]

static void absl::synchronization_internal::PrintGCEdges ( Nodes nodes,
const IdMap id,
GraphCycles gc 
)
static

◆ PrintGCEdges() [2/2]

static void absl::synchronization_internal::PrintGCEdges ( Nodes nodes,
const IdMap id,
GraphCycles gc 
)
static

◆ PrintGCTransitiveClosure() [1/2]

static void absl::synchronization_internal::PrintGCTransitiveClosure ( Nodes nodes,
const IdMap id,
GraphCycles gc 
)
static

◆ PrintGCTransitiveClosure() [2/2]

static void absl::synchronization_internal::PrintGCTransitiveClosure ( Nodes nodes,
const IdMap id,
GraphCycles gc 
)
static

◆ PrintTransitiveClosure() [1/2]

static void absl::synchronization_internal::PrintTransitiveClosure ( Nodes nodes,
Edges edges 
)
static

◆ PrintTransitiveClosure() [2/2]

static void absl::synchronization_internal::PrintTransitiveClosure ( Nodes nodes,
Edges edges 
)
static

◆ RandomEdge() [1/2]

static int absl::synchronization_internal::RandomEdge ( RandomEngine rng,
Edges edges 
)
static

◆ RandomEdge() [2/2]

static int absl::synchronization_internal::RandomEdge ( RandomEngine rng,
Edges edges 
)
static

◆ RandomNode() [1/2]

static int absl::synchronization_internal::RandomNode ( RandomEngine rng,
Nodes nodes 
)
static

◆ RandomNode() [2/2]

static int absl::synchronization_internal::RandomNode ( RandomEngine rng,
Nodes nodes 
)
static

◆ ReclaimThreadIdentity()

void absl::synchronization_internal::ReclaimThreadIdentity ( void *  v)
static

◆ Reorder() [1/2]

static void absl::synchronization_internal::Reorder ( GraphCycles::Rep r)
static

◆ Reorder() [2/2]

static void absl::synchronization_internal::Reorder ( GraphCycles::Rep r)
static

◆ ResetThreadIdentity()

static void absl::synchronization_internal::ResetThreadIdentity ( base_internal::ThreadIdentity identity)
static

◆ ResetThreadIdentityBetweenReuse()

static void absl::synchronization_internal::ResetThreadIdentityBetweenReuse ( base_internal::ThreadIdentity identity)
static

◆ RoundUp() [1/2]

static intptr_t absl::synchronization_internal::RoundUp ( intptr_t  addr,
intptr_t  align 
)
static

◆ RoundUp() [2/2]

static intptr_t absl::synchronization_internal::RoundUp ( intptr_t  addr,
intptr_t  align 
)
static

◆ Sort() [1/2]

static void absl::synchronization_internal::Sort ( const Vec< Node * > &  nodes,
Vec< int32_t > *  delta 
)
static

◆ Sort() [2/2]

static void absl::synchronization_internal::Sort ( const Vec< Node * > &  nodes,
Vec< int32_t > *  delta 
)
static

◆ TEST()

absl::synchronization_internal::TEST ( GraphCycles  ,
RandomizedTest   
)

◆ TEST_F() [1/6]

absl::synchronization_internal::TEST_F ( GraphCyclesTest  ,
IndirectCycle   
)

◆ TEST_F() [2/6]

absl::synchronization_internal::TEST_F ( GraphCyclesTest  ,
LongPath   
)

◆ TEST_F() [3/6]

absl::synchronization_internal::TEST_F ( GraphCyclesTest  ,
ManyEdges   
)

◆ TEST_F() [4/6]

absl::synchronization_internal::TEST_F ( GraphCyclesTest  ,
NoCycle   
)

◆ TEST_F() [5/6]

absl::synchronization_internal::TEST_F ( GraphCyclesTest  ,
RemoveNode   
)

◆ TEST_F() [6/6]

absl::synchronization_internal::TEST_F ( GraphCyclesTest  ,
SimpleCycle   
)

Variable Documentation

◆ thread_identity_freelist [1/2]

ABSL_CONST_INIT base_internal::ThreadIdentity* absl::synchronization_internal::thread_identity_freelist
static

◆ thread_identity_freelist [2/2]

ABSL_CONST_INIT base_internal::ThreadIdentity* absl::synchronization_internal::thread_identity_freelist
static


grpc
Author(s):
autogenerated on Fri May 16 2025 03:02:55