Home
last modified time | relevance | path

Searched refs:held_locks (Results 1 – 2 of 2) sorted by relevance

/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/
Dmutex.cc1181 static void LockEnter(Mutex* mu, GraphId id, SynchLocksHeld *held_locks) { in LockEnter() argument
1182 int n = held_locks->n; in LockEnter()
1184 while (i != n && held_locks->locks[i].id != id) { in LockEnter()
1188 if (n == ABSL_ARRAYSIZE(held_locks->locks)) { in LockEnter()
1189 held_locks->overflow = true; // lost some data in LockEnter()
1191 held_locks->locks[i].mu = mu; in LockEnter()
1192 held_locks->locks[i].count = 1; in LockEnter()
1193 held_locks->locks[i].id = id; in LockEnter()
1194 held_locks->n = n + 1; in LockEnter()
1197 held_locks->locks[i].count++; in LockEnter()
[all …]
/third_party/abseil-cpp/absl/synchronization/
Dmutex.cc1172 static void LockEnter(Mutex* mu, GraphId id, SynchLocksHeld *held_locks) { in LockEnter() argument
1173 int n = held_locks->n; in LockEnter()
1175 while (i != n && held_locks->locks[i].id != id) { in LockEnter()
1179 if (n == ABSL_ARRAYSIZE(held_locks->locks)) { in LockEnter()
1180 held_locks->overflow = true; // lost some data in LockEnter()
1182 held_locks->locks[i].mu = mu; in LockEnter()
1183 held_locks->locks[i].count = 1; in LockEnter()
1184 held_locks->locks[i].id = id; in LockEnter()
1185 held_locks->n = n + 1; in LockEnter()
1188 held_locks->locks[i].count++; in LockEnter()
[all …]