| /external/scapy/test/contrib/automotive/gm/ |
| D | gmlanutils.uts | 43 requ = isotpsock2.sniff(count=1, timeout=1, started_callback=started.set)
44 pkt = GMLAN()/GMLAN_RD(memorySize=4)
52 thread = threading.Thread(target=ecusim)
54 thread.start()
56 res = GMLAN_RequestDownload(isotpsock, 4, timeout=1) == True
57 thread.join(timeout=5)
66 isotpsock2.sniff(count=1, timeout=1, started_callback=started.set)
70 thread = threading.Thread(target=ecusim)
72 thread.start()
74 res = GMLAN_RequestDownload(isotpsock, 4, timeout=1) == False
[all …]
|
| /external/openthread/.github/workflows/ |
| D | simulation-1.4.yml | 7 # 1. Redistributions of source code must retain the above copyright
33 branches-ignore:
34 - 'dependabot/**'
37 - 'main'
40 …group: ${{ github.workflow }}-${{ github.event.pull_request.number || (github.repository == 'opent…
41 cancel-in-progress: true
43 permissions: # added using https://github.com/step-security/secure-workflows
48 thread-1-4:
49 name: thread-1-4-${{ matrix.compiler.c }}-${{ matrix.arch }}
50 runs-on: ubuntu-22.04
[all …]
|
| /external/bcc/tools/ |
| D | deadlock_example.txt | 8 - Nodes in the graph represent mutexes.
9 - Edge (A, B) exists if there exists some thread T where lock(A) was called
21 Since this traces all mutex lock and unlock events and all thread creation
28 For shared (read-write) mutexes, a deadlock requires a cycle in the wait
39 Tracing... Hit Ctrl-C to end.
40 ----------------
45 … here while holding Mutex M0 (main::static_mutex3 0x0000000000473c60) in Thread 357250 (lockinvers…
52 @ 000000000040673a std::thread::_Impl<std::_Bind_simple<main::{lambda()#3} ()> >::_M_run()
57 Mutex M0 (main::static_mutex3 0x0000000000473c60) previously acquired by the same Thread 357250 (lo…
64 @ 000000000040673a std::thread::_Impl<std::_Bind_simple<main::{lambda()#3} ()> >::_M_run()
[all …]
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| D | incorrect-dom-info.ll | 2 ; incorrect updating of the dom-tree.
3 ; RUN: opt < %s -loop-vectorize -verify-dom-info
4 target datalayout = "e-m:o-i64:64-f80:128-n8:16:32:64-S128"
11 br i1 undef, label %2, label %1
13 ; <label>:1 ; preds = %0
19 ; <label>:3 ; preds = %2, %1
20 br i1 undef, label %34, label %4
22 ; <label>:4 ; preds = %3
25 ; <label>:5 ; preds = %4
28 ; <label>:6 ; preds = %5, %4
[all …]
|
| /external/ot-br-posix/src/web/web-service/frontend/ |
| D | join.dialog.html | 1 <div role="dialog" aria-label="Eat me!" layout="column" layout-align="center center">
2 <md-toolbar>
3 <div class="md-toolbar-tools">
4 <h2>Join Thread Network</h2>
6 </md-toolbar>
7 <md-progress-linear md-mode="indeterminate" ng-show="isDisplay"></md-progress-linear>
8 …<div id="div_home" class="demo-charts mdl-color--white mdl-shadow--2dp mdl-cell mdl-cell--12-col m…
10 <div class="demo-dialog-content md-dense" style="width: 500px; height: 310px">
11 <h5>Are you sure you want to JOIN this Thread Network?</h5>
13 <md-input-container flex="80">
[all …]
|
| /external/pytorch/aten/src/ATen/test/ |
| D | cpu_generator_test.cpp | 8 #include <thread>
26 // NOLINTNEXTLINE(performance-unnecessary-copy-initialization) in TEST()
38 // NOLINTNEXTLINE(clang-analyzer-security.insecureAPI.rand) in TEST()
39 cpu_gen1->random(); // advance gen1 state in TEST()
40 // NOLINTNEXTLINE(clang-analyzer-security.insecureAPI.rand) in TEST()
41 cpu_gen1->random(); in TEST()
45 // NOLINTNEXTLINE(clang-analyzer-security.insecureAPI.rand) in TEST()
46 ASSERT_EQ(cpu_gen1->random(), cpu_gen2->random()); in TEST()
50 std::lock_guard<std::mutex> lock(generator->mutex_); in thread_func_get_engine_op()
51 // NOLINTNEXTLINE(clang-analyzer-security.insecureAPI.rand) in thread_func_get_engine_op()
[all …]
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_rwlock_unlock/ |
| D | 1-1.c | 10 * read-write lock object referenced by rwlock
11 * If this function is called to release a read lock from the read-write lock object
12 * and there are other read locks currently held on this read-write lock object,
13 * the read-write lock object remains in the read locked state.
14 * If this function releases the last read lock for this read-write lock object,
15 * the read-write lock object shall be put in the unlocked state with no owners.
18 * 1. Initialize a pthread_rwlock_t object 'rwlock' with pthread_rwlock_init()
19 * 2. Main thread read lock 'rwlock'
20 * 3. Create a child thread, the thread read lock 'rwlock', should not block
21 * 4. Child thread unlock 'rwlock', while the main thread still hold the read lock.
[all …]
|
| /external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/test/ |
| D | EventLoopsTest.kt | 40 expect(1) in testNestedUnconfined()
45 expect(4) in testNestedUnconfined()
54 expect(1) in <lambda>()
56 delay(1) in <lambda>()
57 assertTrue(Thread.currentThread().name.startsWith(DefaultExecutor.THREAD_NAME)) in <lambda>()
59 // now runBlocking inside default executor thread --> should use outer event loop in <lambda>()
61 expect(4) // will execute when runBlocking runs loop in <lambda>()
72 * Simple test for [processNextEventInCurrentThread] API use-case.
76 expect(1) in <lambda>()
83 // main coroutine waits for event (same thread!) in <lambda>()
[all …]
|
| /external/rust/android-crates-io/crates/threadpool/src/ |
| D | lib.rs | 2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
11 //! A thread pool used to execute functions in parallel.
20 //! Every thread sends one message over the channel, which then is collected with the `take()`.
26 //! let n_workers = 4;
34 //! tx.send(1).expect("channel will be there waiting for the pool");
46 //! https://doc.rust-lang.org/reference/behavior-not-considered-unsafe.html).
[all …]
|
| /external/pytorch/aten/src/ATen/native/mps/operations/ |
| D | Quantized.mm | 16 // #define _CAPTURE_KERNEL 1
59 device uchar *outputData [[buffer(1)]],
64 const uint n = thread_index.x; // 0..N-1
65 const uint k = thread_index.y; // 0..K_int32-1
71 outputData[n * K_int32 * 4 + k * 4] = ((src_val3 & 0xF) << 4) | (src_val3 >> 4);
72 outputData[n * K_int32 * 4 + k * 4 + 1] = ((src_val2 & 0xF) << 4) | (src_val2 >> 4);
73 outputData[n * K_int32 * 4 + k * 4 + 2] = ((src_val1 & 0xF) << 4) | (src_val1 >> 4);
74 outputData[n * K_int32 * 4 + k * 4 + 3] = ((src_val0 & 0xF) << 4) | (src_val0 >> 4);
79 https://github.com/ml-explore/mlx/blob/main/mlx/backend/metal/kernels/quantized.metal#L381
81 - Multiplying activation by inverse scaling factor to reduce compute
[all …]
|
| /external/rust/android-crates-io/crates/quiche/deps/boringssl/src/crypto/pool/ |
| D | pool_test.cc | 23 #include <thread>
28 static const uint8_t kData[4] = {1, 2, 3, 4}; in TEST()
36 // Test that reference-counting works properly. in TEST()
52 static const uint8_t kData[4] = {1, 2, 3, 4}; in TEST()
70 static const uint8_t kData[4] = {1, 2, 3, 4}; in TEST()
71 static const uint8_t kData2[3] = {4, 5, 6}; in TEST()
74 std::thread thread([&] { in TEST() local
77 std::thread thread2([&] { in TEST()
81 thread.join(); in TEST()
96 // Reference-counting of |CRYPTO_BUFFER| interacts with pooling. Race an in TEST()
[all …]
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| D | sext-iv-1.ll | 1 ; RUN: opt < %s -scalar-evolution -analyze \
4 ; CHECK: --> (sext i{{.}} {{{.*}},+,{{.*}}}<%bb1> to i64)
5 ; CHECK: --> (sext i{{.}} {{{.*}},+,{{.*}}}<%bb1> to i64)
6 ; CHECK: --> (sext i{{.}} {{{.*}},+,{{.*}}}<%bb1> to i64)
7 ; CHECK: --> (sext i{{.}} {{{.*}},+,{{.*}}}<%bb1> to i64)
8 ; CHECK: --> (sext i{{.}} {{{.*}},+,{{.*}}}<%bb1> to i64)
9 ; CHECK-NOT: --> (sext
14 …et datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:…
15 target triple = "x86_64-unknown-linux-gnu"
18 bb1.thread:
[all …]
|
| /external/llvm/test/CodeGen/BPF/ |
| D | sockex2.ll | 1 ; RUN: llc < %s -march=bpfel -show-mc-encoding | FileCheck %s
6 @hash_map = global %struct.bpf_map_def { i32 1, i32 4, i32 8, i32 1024 }, section "maps", align 4
10 %key = alloca i32, align 4
12 %1 = bitcast %struct.sk_buff* %skb to i8*
13 %2 = call i64 @llvm.bpf.load.half(i8* %1, i64 12) #2
15 br i1 %3, label %4, label %6
17 ; <label>:4 ; preds = %0
18 %5 = call i64 @llvm.bpf.load.half(i8* %1, i64 16) #2
21 ; <label>:6 ; preds = %4, %0
22 %proto.0.i = phi i64 [ %5, %4 ], [ %2, %0 ]
[all …]
|
| /external/chromium-crossbench/tests/crossbench/runner/ |
| D | test_runner.py | 2 # Use of this source code is governed by a BSD-style license that can be
18 from crossbench.runner.groups.thread import RunThreadGroup
30 # pytype: disable=wrong-arg-types
33 # pylint: disable=no-member
35 def create_session(self, browser, index) -> BrowserSessionRunGroup:
46 def setUp(self) -> None:
49 self.browser_a_1 = MockBrowser("mock browser a 1", self.platform_a)
50 self.browser_a_2 = MockBrowser("mock browser b 1", self.platform_a)
51 self.browser_b_1 = MockBrowser("mock browser b 1", self.platform_b)
58 MockRun(self.runner, self.create_session(self.browser_a_1, 1), "run 1"),
[all …]
|
| /external/rust/android-crates-io/crates/thread_local/src/ |
| D | thread_id.rs | 3 // Licensed under the Apache License, Version 2.0, <LICENSE-APACHE or
4 // http://apache.org/licenses/LICENSE-2.0> or the MIT license <LICENSE-MIT or
15 /// Thread ID manager which allocates thread IDs. It attempts to aggressively
16 /// reuse thread IDs where possible to avoid cases where a ThreadLocal grows
17 /// indefinitely when it is used by many short-lived threads.
23 fn new() -> Self { in new()
29 fn alloc(&mut self) -> usize { in alloc()
33 // `free_from` can't overflow as each thread takes up at least 2 bytes of memory and in alloc()
34 // thus we can't even have `usize::MAX / 2 + 1` threads. in alloc()
37 self.free_from += 1; in alloc()
[all …]
|
| /external/openthread/src/cli/ |
| D | README.md | 24 - [attachtime](#attachtime)
25 - [ba](#ba)
26 - [bbr](#bbr)
27 - [br](README_BR.md)
28 - [bufferinfo](#bufferinfo)
29 - [ccathreshold](#ccathreshold)
30 - [channel](#channel)
31 - [child](#child-list)
32 - [childip](#childip)
33 - [childmax](#childmax)
[all …]
|
| /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_create/ |
| D | threads_scenarii.c | 15 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
30 int detached; /* 0 => joinable; 1 => detached */
32 int explicitsched; /* 0 => sched policy is inherited; 1 => sched policy from the attr param */
33 int schedpolicy; /* 0 => default; 1=> SCHED_FIFO; 2=> SCHED_RR */
34 …int schedparam; /* 0 => default sched param; 1 => max value for sched param; -1 => min value for …
35 int altscope; /* 0 => default contension scope; 1 => alternative contension scope */
37 int altstack; /* 0 => system manages the stack; 1 => stack is provided */
38 …int guard; /* 0 => default guardsize; 1=> guardsize is 0; 2=> guard is 1 page -- this setting onl…
39 …int altsize; /* 0 => default stack size; 1 => stack size specified (min value) -- ignored when st…
43 int result; /* This thread creation is expected to: 0 => succeed; 1 => fail; 2 => unknown */
[all …]
|
| /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_exit/ |
| D | threads_scenarii.c | 15 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
30 int detached; /* 0 => joinable; 1 => detached */
32 int explicitsched; /* 0 => sched policy is inherited; 1 => sched policy from the attr param */
33 int schedpolicy; /* 0 => default; 1=> SCHED_FIFO; 2=> SCHED_RR */
34 …int schedparam; /* 0 => default sched param; 1 => max value for sched param; -1 => min value for …
35 int altscope; /* 0 => default contension scope; 1 => alternative contension scope */
37 int altstack; /* 0 => system manages the stack; 1 => stack is provided */
38 …int guard; /* 0 => default guardsize; 1=> guardsize is 0; 2=> guard is 1 page -- this setting onl…
39 …int altsize; /* 0 => default stack size; 1 => stack size specified (min value) -- ignored when st…
43 int result; /* This thread creation is expected to: 0 => succeed; 1 => fail; 2 => unknown */
[all …]
|
| /external/sdv/vsomeip/third_party/boost/thread/test/ |
| D | test_condition.cpp | 1 // Copyright (C) 2001-2003
11 #include <boost/thread/detail/config.hpp>
13 #include <boost/thread/condition.hpp>
14 #include <boost/thread/thread_only.hpp>
15 #include <boost/thread/xtime.hpp>
34 boost::unique_lock<boost::mutex> lock(data->mutex); in condition_test_thread()
36 while (!(data->notified > 0)) in condition_test_thread()
37 data->condition.wait(lock); in condition_test_thread()
39 data->awoken++; in condition_test_thread()
60 boost::unique_lock<boost::mutex> lock(data->mutex); in condition_test_waits()
[all …]
|
| /external/starlark-go/starlark/ |
| D | eval_test.go | 2 // Use of this source code is governed by a BSD-style
27 // A test may enable non-standard options by containing (e.g.) "option:recursion".
48 thread := new(starlark.Thread)
51 {`-1`, `-1`},
53 {`1+2`, `3`},
57 {`[1]`, `[1]`},
58 {`[1,]`, `[1]`},
59 {`[1, 2]`, `[1, 2]`},
60 {`[2 * x for x in [1, 2, 3]]`, `[2, 4, 6]`},
61 {`[2 * x for x in [1, 2, 3] if x > 1]`, `[4, 6]`},
[all …]
|
| /external/igt-gpu-tools/lib/ |
| D | gpu_cmds.c | 32 ret = drm_intel_bo_subdata(batch->bo, 0, 4096, batch->buffer); in gen7_render_flush()
34 ret = drm_intel_bo_mrb_exec(batch->bo, batch_end, in gen7_render_flush()
44 ret = drm_intel_bo_subdata(batch->bo, 0, 4096, batch->buffer); in gen7_render_context_flush()
46 ret = drm_intel_gem_bo_context_exec(batch->bo, batch->ctx, in gen7_render_context_flush()
78 *curbe_buffer = 1; in gen11_fill_curbe_buffer_data()
103 ss->ss0.surface_type = SURFACE_2D; in gen7_fill_surface_state()
104 ss->ss0.surface_format = format; in gen7_fill_surface_state()
105 ss->ss0.render_cache_read_write = 1; in gen7_fill_surface_state()
107 if (buf->tiling == I915_TILING_X) in gen7_fill_surface_state()
108 ss->ss0.tiled_mode = 2; in gen7_fill_surface_state()
[all …]
|
| /external/perfetto/protos/perfetto/trace/etw/ |
| D | etw.proto | 8 * http://www.apache.org/licenses/LICENSE-2.0
21 // See: https://learn.microsoft.com/en-us/windows/win32/etw/cswitch
23 // New thread ID after the switch.
24 optional uint32 new_thread_id = 1;
26 // Previous thread ID.
29 // Thread priority of the new thread.
32 // Thread priority of the previous thread.
33 optional sint32 old_thread_priority = 4;
35 // The index of the C-state that was last used by the processor. A value of 0
37 // C-states.
[all …]
|
| /external/cronet/stable/third_party/boringssl/src/crypto/pool/ |
| D | pool_test.cc | 24 #include <thread>
29 static const uint8_t kData[4] = {1, 2, 3, 4}; in TEST()
37 // Test that reference-counting works properly. in TEST()
46 // Test that reference-counting works properly. in TEST()
69 static const uint8_t kData1[4] = {1, 2, 3, 4}; in TEST()
85 static const uint8_t kData2[4] = {5, 6, 7, 8}; in TEST()
95 EXPECT_EQ(1u, lh_CRYPTO_BUFFER_num_items(pool->bufs)); in TEST()
113 // When creating a static buffer, if there is already a non-static buffer, it in TEST()
134 static const uint8_t kData[4] = {1, 2, 3, 4}; in TEST()
135 static const uint8_t kData2[3] = {4, 5, 6}; in TEST()
[all …]
|
| /external/cronet/tot/third_party/boringssl/src/crypto/pool/ |
| D | pool_test.cc | 24 #include <thread>
29 static const uint8_t kData[4] = {1, 2, 3, 4}; in TEST()
37 // Test that reference-counting works properly. in TEST()
46 // Test that reference-counting works properly. in TEST()
69 static const uint8_t kData1[4] = {1, 2, 3, 4}; in TEST()
85 static const uint8_t kData2[4] = {5, 6, 7, 8}; in TEST()
95 EXPECT_EQ(1u, lh_CRYPTO_BUFFER_num_items(pool->bufs)); in TEST()
113 // When creating a static buffer, if there is already a non-static buffer, it in TEST()
134 static const uint8_t kData[4] = {1, 2, 3, 4}; in TEST()
135 static const uint8_t kData2[3] = {4, 5, 6}; in TEST()
[all …]
|
| /external/boringssl/src/crypto/pool/ |
| D | pool_test.cc | 24 #include <thread>
29 static const uint8_t kData[4] = {1, 2, 3, 4}; in TEST()
37 // Test that reference-counting works properly. in TEST()
46 // Test that reference-counting works properly. in TEST()
69 static const uint8_t kData1[4] = {1, 2, 3, 4}; in TEST()
85 static const uint8_t kData2[4] = {5, 6, 7, 8}; in TEST()
95 EXPECT_EQ(1u, lh_CRYPTO_BUFFER_num_items(pool->bufs)); in TEST()
113 // When creating a static buffer, if there is already a non-static buffer, it in TEST()
134 static const uint8_t kData[4] = {1, 2, 3, 4}; in TEST()
135 static const uint8_t kData2[3] = {4, 5, 6}; in TEST()
[all …]
|