Home
last modified time | relevance | path

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

123

/external/ltp/testcases/realtime/func/pi-tests/
Dsbrk_mutex.c55 static pthread_mutex_t *mutexes[NUM_MUTEXES]; variable
85 pthread_mutex_unlock(mutexes[i - NUM_CONCURRENT_LOCKS]); in worker_thread()
89 pthread_mutex_lock(mutexes[i]); in worker_thread()
125 if (!(mutexes[m] = malloc(sizeof(pthread_mutex_t)))) { in main()
128 if ((ret = pthread_mutex_init(mutexes[m], &mutexattr))) { in main()
144 if (mutexes[m]) { in main()
145 if ((ret = pthread_mutex_destroy(mutexes[m]))) in main()
147 free(mutexes[m]); in main()
/external/compiler-rt/lib/tsan/rtl/
Dtsan_report.cc59 , mutexes(MBlockReportMutex) in ReportDesc()
261 if (rep->mutexes.Size()) in ChooseSummaryStack()
262 return rep->mutexes[0]->stack; in ChooseSummaryStack()
301 for (uptr i = 0; i < rep->mutexes.Size(); i++) in PrintReport()
302 PrintMutexShortWithAddress(rep->mutexes[i], " => "); in PrintReport()
303 PrintMutexShort(rep->mutexes[0], "\n\n"); in PrintReport()
304 CHECK_GT(rep->mutexes.Size(), 0U); in PrintReport()
305 CHECK_EQ(rep->mutexes.Size() * (flags()->second_deadlock_stack ? 2 : 1), in PrintReport()
307 for (uptr i = 0; i < rep->mutexes.Size(); i++) { in PrintReport()
309 PrintMutexShort(rep->mutexes[(i + 1) % rep->mutexes.Size()], in PrintReport()
[all …]
Dtsan_debugging.cc75 *mutex_count = rep->mutexes.Size(); in __tsan_get_report_data()
131 CHECK_LT(idx, rep->mutexes.Size()); in __tsan_get_report_mutex()
132 ReportMutex *mutex = rep->mutexes[idx]; in __tsan_get_report_mutex()
Dtsan_rtl_report.cc259 for (uptr i = 0; i < rep_->mutexes.Size(); i++) { in AddMutex()
260 if (rep_->mutexes[i]->id == s->uid) in AddMutex()
265 rep_->mutexes.PushBack(rm); in AddMutex()
292 for (uptr i = 0; i < rep_->mutexes.Size(); i++) { in AddDeadMutex()
293 if (rep_->mutexes[i]->id == id) in AddDeadMutex()
298 rep_->mutexes.PushBack(rm); in AddDeadMutex()
Dtsan_report.h110 Vector<ReportMutex*> mutexes; variable
/external/llvm-project/compiler-rt/lib/tsan/rtl/
Dtsan_report.cpp53 , mutexes() in ReportDesc()
289 if (rep->mutexes.Size()) in ChooseSummaryStack()
290 return rep->mutexes[0]->stack; in ChooseSummaryStack()
329 for (uptr i = 0; i < rep->mutexes.Size(); i++) in PrintReport()
330 PrintMutexShortWithAddress(rep->mutexes[i], " => "); in PrintReport()
331 PrintMutexShort(rep->mutexes[0], "\n\n"); in PrintReport()
332 CHECK_GT(rep->mutexes.Size(), 0U); in PrintReport()
333 CHECK_EQ(rep->mutexes.Size() * (flags()->second_deadlock_stack ? 2 : 1), in PrintReport()
335 for (uptr i = 0; i < rep->mutexes.Size(); i++) { in PrintReport()
337 PrintMutexShort(rep->mutexes[(i + 1) % rep->mutexes.Size()], in PrintReport()
[all …]
Dtsan_debugging.cpp83 *mutex_count = rep->mutexes.Size(); in __tsan_get_report_data()
156 CHECK_LT(idx, rep->mutexes.Size()); in __tsan_get_report_mutex()
157 ReportMutex *mutex = rep->mutexes[idx]; in __tsan_get_report_mutex()
Dtsan_rtl_report.cpp264 for (uptr i = 0; i < rep_->mutexes.Size(); i++) { in AddMutex()
265 if (rep_->mutexes[i]->id == s->uid) in AddMutex()
270 rep_->mutexes.PushBack(rm); in AddMutex()
297 for (uptr i = 0; i < rep_->mutexes.Size(); i++) { in AddDeadMutex()
298 if (rep_->mutexes[i]->id == id) in AddDeadMutex()
303 rep_->mutexes.PushBack(rm); in AddDeadMutex()
/external/tensorflow/tensorflow/core/kernels/
Dtraining_op_helpers.h155 std::vector<mutex*> mutexes; in MaybeLockVariableInputMutexesInOrder() local
163 if (std::find(mutexes.begin(), mutexes.end(), mutex) == mutexes.end()) { in MaybeLockVariableInputMutexesInOrder()
164 acquire_order.push_back(mutexes.size()); in MaybeLockVariableInputMutexesInOrder()
165 mutexes.push_back(mutex); in MaybeLockVariableInputMutexesInOrder()
169 [&mutexes](int a, int b) { return mutexes[a] < mutexes[b]; }); in MaybeLockVariableInputMutexesInOrder()
/external/compiler-rt/lib/tsan/benchmarks/
Dvts_many_threads_bench.cc43 Mutex mutexes[kNumMutexes]; variable
64 mutexes[(offset + i) % kNumMutexes].Lock(); in Thread()
65 mutexes[(offset + i) % kNumMutexes].Unlock(); in Thread()
/external/llvm-project/compiler-rt/lib/tsan/benchmarks/
Dvts_many_threads_bench.cpp43 Mutex mutexes[kNumMutexes]; variable
64 mutexes[(offset + i) % kNumMutexes].Lock(); in Thread()
65 mutexes[(offset + i) % kNumMutexes].Unlock(); in Thread()
/external/bcc/tools/
Ddeadlock_detector_example.txt8 - Nodes in the graph represent mutexes.
14 program will dump the cycle of mutexes, dump the stack traces where each mutex
23 high if the process has many threads and mutexes. You should only run this on
26 Note: This tool does not work for shared mutexes or recursive mutexes.
28 For shared (read-write) mutexes, a deadlock requires a cycle in the wait
29 graph where at least one of the mutexes in the cycle is acquiring exclusive
32 For recursive mutexes, lock() is called multiple times on the same mutex.
177 This is output from a process that has a potential deadlock involving 4 mutexes
236 reconsider the lock ordering. If the mutexes are global or static and debug
282 about the number of mutexes and edges in the mutex wait graph. If you want to
[all …]
/external/jemalloc_new/include/jemalloc/internal/
Dmutex_pool.h13 malloc_mutex_t mutexes[MUTEX_POOL_SIZE]; member
23 return &pool->mutexes[hash_result[0] % MUTEX_POOL_SIZE]; in mutex_pool_mutex()
29 malloc_mutex_assert_not_owner(tsdn, &pool->mutexes[i]); in mutex_pool_assert_not_held()
/external/abseil-cpp/absl/base/internal/
Dthread_identity_test.cc107 Mutex mutexes[kNumMutexes]; in TEST() local
114 MutexLock lock(&mutexes[m]); in TEST()
/external/webrtc/third_party/abseil-cpp/absl/base/internal/
Dthread_identity_test.cc107 Mutex mutexes[kNumMutexes]; in TEST() local
114 MutexLock lock(&mutexes[m]); in TEST()
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/base/internal/
Dthread_identity_test.cc108 Mutex mutexes[kNumMutexes]; in TEST() local
115 MutexLock lock(&mutexes[m]); in TEST()
/external/openscreen/third_party/abseil/src/absl/base/internal/
Dthread_identity_test.cc108 Mutex mutexes[kNumMutexes]; in TEST() local
115 MutexLock lock(&mutexes[m]); in TEST()
/external/angle/third_party/abseil-cpp/absl/base/internal/
Dthread_identity_test.cc108 Mutex mutexes[kNumMutexes]; in TEST() local
115 MutexLock lock(&mutexes[m]); in TEST()
/external/libtextclassifier/abseil-cpp/absl/base/internal/
Dthread_identity_test.cc108 Mutex mutexes[kNumMutexes]; in TEST() local
115 MutexLock lock(&mutexes[m]); in TEST()
/external/jemalloc_new/src/
Dmutex_pool.c12 if (malloc_mutex_init(&pool->mutexes[i], name, rank, in mutex_pool_init()
/external/llvm-project/clang/docs/
DThreadSafetyAnalysis.rst73 that these are two separate mutexes, in two different objects.
119 capabilities (e.g. the set of mutexes that it has locked.) These act like keys
344 annotate getter methods that return mutexes.
365 declarations, specifically declarations of mutexes or other capabilities.
366 These declarations enforce a particular order in which the mutexes must be
601 ordinary C++ scoping rules. In particular, this means that mutexes and other
624 Good software engineering practice dictates that mutexes should be private
626 its internal implementation. However, private mutexes can sometimes leak into
859 // Defines an annotated interface for mutexes.
881 // Generic unlock, can unlock exclusive and shared mutexes.
[all …]
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_mutexattr_init/
Dcoverage.txt5 2 NO *Looking for indicators to judge if initialized mutexes
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_cancel/
Dcoverage.txt13 NOTE: In a lot of these test, I didn't make use of semaphores or mutexes, but
/external/kotlinx.atomicfu/atomicfu/src/nativeMain/kotlin/kotlinx/atomicfu/locks/
DSynchronized.kt189 private val mutexes = nativeHeap.allocArray<mutex_node_t>(capacity) { mutex_node_init(ptr) } in <lambda>() constant
193 release(interpretCPointer<mutex_node_t>(mutexes.rawValue.plus(i * mutex_node_t.size))!!) in i()
/external/pigweed/pw_chrono/
Ddocs.rst17 bound operations such as thread sleeping, waiting on mutexes/semaphores, etc.

123