Home
last modified time | relevance | path

Searched refs:pair (Results 1 - 25 of 4796) sorted by relevance

12345678910>>...192

/third_party/ltp/include/
H A Dtst_fuzzy_sync.h23 * tst_fzsync_pair_reset(&pair, run_thread_b);
24 * while (tst_fzsync_run_a(&pair)) {
26 * tst_fzsync_start_race_a(&pair);
28 * tst_fzsync_end_race_a(&pair);
33 * while (tst_fzsync_run_b(&pair)) {
34 * tst_fzsync_start_race_b(&pair);
36 * tst_fzsync_end_race_b(&pair)
187 pair->param = (pair->param ? pair
203 tst_fzsync_pair_init(struct tst_fzsync_pair *pair) tst_fzsync_pair_init() argument
222 tst_fzsync_pair_cleanup(struct tst_fzsync_pair *pair) tst_fzsync_pair_cleanup() argument
262 tst_fzsync_pair_reset(struct tst_fzsync_pair *pair, void *(*run_b)(void *)) tst_fzsync_pair_reset() argument
305 tst_fzsync_pair_info(struct tst_fzsync_pair *pair) tst_fzsync_pair_info() argument
458 tst_fzsync_pair_update(struct tst_fzsync_pair *pair) tst_fzsync_pair_update() argument
606 tst_fzsync_wait_a(struct tst_fzsync_pair *pair) tst_fzsync_wait_a() argument
618 tst_fzsync_wait_b(struct tst_fzsync_pair *pair) tst_fzsync_wait_b() argument
635 tst_fzsync_run_a(struct tst_fzsync_pair *pair) tst_fzsync_run_a() argument
675 tst_fzsync_run_b(struct tst_fzsync_pair *pair) tst_fzsync_run_b() argument
699 tst_fzsync_start_race_a(struct tst_fzsync_pair *pair) tst_fzsync_start_race_a() argument
727 tst_fzsync_end_race_a(struct tst_fzsync_pair *pair) tst_fzsync_end_race_a() argument
740 tst_fzsync_start_race_b(struct tst_fzsync_pair *pair) tst_fzsync_start_race_b() argument
766 tst_fzsync_end_race_b(struct tst_fzsync_pair *pair) tst_fzsync_end_race_b() argument
797 tst_fzsync_pair_add_bias(struct tst_fzsync_pair *pair, int change) tst_fzsync_pair_add_bias() argument
[all...]
/third_party/protobuf/js/experimental/runtime/kernel/
H A Dreader_test.js46 for (const pair of getBoolPairs()) {
47 it(`decode ${pair.name}`, () => {
48 if (pair.error && CHECK_CRITICAL_STATE) {
49 expect(() => reader.readBool(pair.bufferDecoder, 0)).toThrow();
52 pair.bufferDecoder, pair.bufferDecoder.startIndex());
53 expect(d).toEqual(pair.boolValue);
79 for (const pair of getDoublePairs()) {
80 it(`decode ${pair.name}`, () => {
81 const d = reader.readDouble(pair
[all...]
H A Dwriter_test.js252 for (const pair of getDoublePairs()) {
253 it(`encode ${pair.name}`, () => {
254 writer.writeDouble(1, pair.doubleValue);
261 .toEqual(pair.bufferDecoder.asUint8Array());
287 for (const pair of getFixed32Pairs()) {
288 it(`encode ${pair.name}`, () => {
289 writer.writeFixed32(1, pair.intValue);
295 expect(buffer.subarray(1, 5)).toEqual(pair.bufferDecoder.asUint8Array());
306 for (const pair of getFloatPairs()) {
307 it(`encode ${pair
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/fuzz/
H A Dfuzzer_context.cpp37 const std::pair<uint32_t, uint32_t>
39 const std::pair<uint32_t, uint32_t> kChanceOfAddingAccessChain = {5, 50};
40 const std::pair<uint32_t, uint32_t> kChanceOfAddingAnotherPassToPassLoop = {50,
42 const std::pair<uint32_t, uint32_t> kChanceOfAddingAnotherStructField = {20,
44 const std::pair<uint32_t, uint32_t> kChanceOfAddingArrayOrStructType = {20, 90};
45 const std::pair<uint32_t, uint32_t> KChanceOfAddingAtomicLoad = {30, 90};
46 const std::pair<uint32_t, uint32_t> KChanceOfAddingAtomicStore = {20, 90};
47 const std::pair<uint32_t, uint32_t> kChanceOfAddingBitInstructionSynonym = {5,
49 const std::pair<uint32_t, uint32_t>
51 const std::pair<uint32_
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/
H A Dfuzzer_context.cpp37 const std::pair<uint32_t, uint32_t>
39 const std::pair<uint32_t, uint32_t> kChanceOfAddingAccessChain = {5, 50};
40 const std::pair<uint32_t, uint32_t> kChanceOfAddingAnotherPassToPassLoop = {50,
42 const std::pair<uint32_t, uint32_t> kChanceOfAddingAnotherStructField = {20,
44 const std::pair<uint32_t, uint32_t> kChanceOfAddingArrayOrStructType = {20, 90};
45 const std::pair<uint32_t, uint32_t> KChanceOfAddingAtomicLoad = {30, 90};
46 const std::pair<uint32_t, uint32_t> KChanceOfAddingAtomicStore = {20, 90};
47 const std::pair<uint32_t, uint32_t> kChanceOfAddingBitInstructionSynonym = {5,
49 const std::pair<uint32_t, uint32_t>
51 const std::pair<uint32_
[all...]
/third_party/spirv-tools/source/fuzz/
H A Dfuzzer_context.cpp37 const std::pair<uint32_t, uint32_t>
39 const std::pair<uint32_t, uint32_t> kChanceOfAddingAccessChain = {5, 50};
40 const std::pair<uint32_t, uint32_t> kChanceOfAddingAnotherPassToPassLoop = {50,
42 const std::pair<uint32_t, uint32_t> kChanceOfAddingAnotherStructField = {20,
44 const std::pair<uint32_t, uint32_t> kChanceOfAddingArrayOrStructType = {20, 90};
45 const std::pair<uint32_t, uint32_t> KChanceOfAddingAtomicLoad = {30, 90};
46 const std::pair<uint32_t, uint32_t> KChanceOfAddingAtomicStore = {20, 90};
47 const std::pair<uint32_t, uint32_t> kChanceOfAddingBitInstructionSynonym = {5,
49 const std::pair<uint32_t, uint32_t>
51 const std::pair<uint32_
[all...]
/third_party/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_program_pair.c38 int rc_pair_alloc_source(struct rc_pair_instruction *pair, in rc_pair_alloc_source() argument
53 if (rgb && pair->RGB.Src[RC_PAIR_PRESUB_SRC].Used in rc_pair_alloc_source()
54 && index != pair->RGB.Src[RC_PAIR_PRESUB_SRC].Index) { in rc_pair_alloc_source()
58 if (alpha && pair->Alpha.Src[RC_PAIR_PRESUB_SRC].Used in rc_pair_alloc_source()
59 && index != pair->Alpha.Src[RC_PAIR_PRESUB_SRC].Index) { in rc_pair_alloc_source()
67 if (pair->RGB.Src[i].Used) { in rc_pair_alloc_source()
68 if (pair->RGB.Src[i].File != file || in rc_pair_alloc_source()
69 pair->RGB.Src[i].Index != index) { in rc_pair_alloc_source()
77 if (pair->Alpha.Src[i].Used) { in rc_pair_alloc_source()
78 if (pair in rc_pair_alloc_source()
131 pair_foreach_source_callback( struct rc_pair_instruction * pair, void * data, rc_pair_foreach_src_fn cb, unsigned int swz, unsigned int src) pair_foreach_source_callback() argument
169 rc_pair_foreach_source_that_alpha_reads( struct rc_pair_instruction * pair, void * data, rc_pair_foreach_src_fn cb) rc_pair_foreach_source_that_alpha_reads() argument
184 rc_pair_foreach_source_that_rgb_reads( struct rc_pair_instruction * pair, void * data, rc_pair_foreach_src_fn cb) rc_pair_foreach_source_that_rgb_reads() argument
[all...]
H A Dradeon_pair_translate.c148 * Fill the given ALU instruction's opcodes and source operands into the given pair,
152 struct rc_pair_instruction * pair, in set_pair_instruction()
159 memset(pair, 0, sizeof(struct rc_pair_instruction)); in set_pair_instruction()
165 pair->RGB.Opcode = RC_OPCODE_REPL_ALPHA; in set_pair_instruction()
167 pair->RGB.Opcode = inst->Opcode; in set_pair_instruction()
169 pair->RGB.Saturate = 1; in set_pair_instruction()
172 pair->Alpha.Opcode = inst->Opcode; in set_pair_instruction()
174 pair->Alpha.Saturate = 1; in set_pair_instruction()
184 * pair->{RGB,ALPHA}.Src[RC_PAIR_PRESUB_SRC] */ in set_pair_instruction()
198 pair in set_pair_instruction()
151 set_pair_instruction(struct r300_fragment_program_compiler *c, struct rc_pair_instruction * pair, struct rc_sub_instruction * inst) set_pair_instruction() argument
[all...]
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DCollationFastLatin.java95 * Use INDEX_MASK to find the pair of CEs after the fixed table.
298 * Single mini CE or a pair. in compareUTF16()
741 private static int getPrimaries(int variableTop, int pair) { in getPrimaries() argument
742 int ce = pair & 0xffff; in getPrimaries()
743 if(ce >= MIN_SHORT) { return pair & TWO_SHORT_PRIMARIES_MASK; } in getPrimaries()
744 if(ce > variableTop) { return pair & TWO_LONG_PRIMARIES_MASK; } in getPrimaries()
746 return pair; // special mini CE in getPrimaries()
758 private static int getSecondaries(int variableTop, int pair) { in getSecondaries() argument
759 if(pair <= 0xffff) { in getSecondaries()
761 if(pair > in getSecondaries()
783 getCases(int variableTop, boolean strengthIsPrimary, int pair) getCases() argument
823 getTertiaries(int variableTop, boolean withCaseBits, int pair) getTertiaries() argument
873 getQuaternaries(int variableTop, int pair) getQuaternaries() argument
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/
H A DCollationFastLatin.java99 * Use INDEX_MASK to find the pair of CEs after the fixed table.
302 * Single mini CE or a pair. in compareUTF16()
745 private static int getPrimaries(int variableTop, int pair) { in getPrimaries() argument
746 int ce = pair & 0xffff; in getPrimaries()
747 if(ce >= MIN_SHORT) { return pair & TWO_SHORT_PRIMARIES_MASK; } in getPrimaries()
748 if(ce > variableTop) { return pair & TWO_LONG_PRIMARIES_MASK; } in getPrimaries()
750 return pair; // special mini CE in getPrimaries()
762 private static int getSecondaries(int variableTop, int pair) { in getSecondaries() argument
763 if(pair <= 0xffff) { in getSecondaries()
765 if(pair > in getSecondaries()
787 getCases(int variableTop, boolean strengthIsPrimary, int pair) getCases() argument
827 getTertiaries(int variableTop, boolean withCaseBits, int pair) getTertiaries() argument
877 getQuaternaries(int variableTop, int pair) getQuaternaries() argument
[all...]
/foundation/communication/netmanager_base/frameworks/js/napi/netstats/src/
H A Dstatistics_callback_observer.cpp31 auto pair = new std::pair<std::string, uint32_t>; in NetIfaceStatsChanged() local
32 pair->first = iface; in NetIfaceStatsChanged()
33 pair->second = KEY_UID_ARG; in NetIfaceStatsChanged()
34 StatisticsObserverWrapper::GetInstance().GetEventManager()->EmitByUv(EVENT_STATS_CHANGE, pair, in NetIfaceStatsChanged()
45 auto pair = new std::pair<std::string, uint32_t>; in NetUidStatsChanged() local
46 pair->first = iface; in NetUidStatsChanged()
47 pair->second = uid; in NetUidStatsChanged()
48 StatisticsObserverWrapper::GetInstance().GetEventManager()->EmitByUv(EVENT_STATS_CHANGE, pair, in NetUidStatsChanged()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/numeric/
H A Dint128_test.cc698 for (const HighLowPair& pair : values) { in TEST()
699 absl::int128 value = absl::MakeInt128(pair.high, pair.low); in TEST()
700 EXPECT_EQ(pair.low, absl::Int128Low64(value)); in TEST()
701 EXPECT_EQ(pair.high, absl::Int128High64(value)); in TEST()
747 for (const TestCase& pair : cases) { in TEST()
748 SCOPED_TRACE(::testing::Message() << "pair.smaller = " << pair.smaller in TEST()
749 << "; pair.larger = " << pair in TEST()
[all...]
H A Dint128_benchmark.cc38 std::vector<std::pair<T, T>> GetRandomClass128SampleUniformDivisor() { in GetRandomClass128SampleUniformDivisor()
39 std::vector<std::pair<T, T>> values; in GetRandomClass128SampleUniformDivisor()
55 for (const auto& pair : values) { in BM_DivideClass128UniformDivisor()
56 benchmark::DoNotOptimize(pair.first / pair.second); in BM_DivideClass128UniformDivisor()
67 for (const auto& pair : values) { in BM_RemainderClass128UniformDivisor()
68 benchmark::DoNotOptimize(pair.first % pair.second); in BM_RemainderClass128UniformDivisor()
78 std::vector<std::pair<T, H>> GetRandomClass128SampleSmallDivisor() { in GetRandomClass128SampleSmallDivisor()
79 std::vector<std::pair< in GetRandomClass128SampleSmallDivisor()
[all...]
/third_party/cups-filters/fontembed/
H A Dfrequent.c11 struct { intptr_t key; int count,zero; } pair[]; member
18 FREQUENT *ret=malloc(sizeof(ret[0])+sizeof(ret->pair[0])*size); in frequent_new()
27 ret->pair[iA].key=INTPTR_MIN; in frequent_new()
28 ret->pair[iA].count=0; in frequent_new()
29 ret->pair[iA].zero=0; in frequent_new()
41 if (freq->pair[iA].key==key) { in frequent_add()
42 freq->pair[iA].count++; in frequent_add()
45 } else if (freq->pair[iA].count==freq->czero) { in frequent_add()
50 freq->pair[zero].key=key; in frequent_add()
51 freq->pair[zer in frequent_add()
[all...]
/third_party/lzma/CPP/7zip/UI/Common/
H A DUpdateProduce.cpp19 const CUpdatePair &pair = updatePairs[i]; in UpdateProduce() local
22 up2.DirIndex = pair.DirIndex; in UpdateProduce()
23 up2.ArcIndex = pair.ArcIndex; in UpdateProduce()
27 switch (actionSet.StateActions[(unsigned)pair.State]) in UpdateProduce()
30 if (pair.ArcIndex >= 0 && callback) in UpdateProduce()
31 callback->ShowDeleteFile((unsigned)pair.ArcIndex); in UpdateProduce()
35 if (pair.State == NPairState::kOnlyOnDisk) in UpdateProduce()
37 if (pair.State == NPairState::kOnlyInArchive) in UpdateProduce()
39 if (pair.HostIndex >= 0) in UpdateProduce()
46 if (updatePairs[(unsigned)pair in UpdateProduce()
[all...]
/foundation/communication/netmanager_ext/frameworks/js/napi/ethernet/
H A Dinterface_state_observer.cpp34 auto pair = new std::pair<std::string, bool>(iface, true); in OnInterfaceAdded() local
35 InterfaceStateObserverWrapper::GetInstance().GetEventManager()->EmitByUv(EVENT_STATS_CHANGE, pair, in OnInterfaceAdded()
46 auto pair = new std::pair<std::string, bool>(iface, false); in OnInterfaceRemoved() local
47 InterfaceStateObserverWrapper::GetInstance().GetEventManager()->EmitByUv(EVENT_STATS_CHANGE, pair, in OnInterfaceRemoved()
58 auto pair = new std::pair<std::string, bool>(iface, up); in OnInterfaceChanged() local
59 InterfaceStateObserverWrapper::GetInstance().GetEventManager()->EmitByUv(EVENT_STATS_CHANGE, pair, in OnInterfaceChanged()
66 auto pair(reinterpret_cas in CreateIfaceChangedParam()
[all...]
/foundation/graphic/graphic_2d/rosen/modules/render_service_base/src/pipeline/
H A Drs_render_node_map.cpp109 [](const auto& pair) -> bool { in GetVisibleLeashWindowCount()
110 return pair.second && pair.second->IsLeashWindowSurfaceNodeVisible(); in GetVisibleLeashWindowCount()
118 [nodePid](const auto& pair) -> bool { return ExtractPid(pair.first) == nodePid; }); in IsResidentProcessNode()
215 EraseIf(renderNodeMap_, [pid, useBatchRemoving](const auto& pair) -> bool { in FilterNodeByPid()
216 if (ExtractPid(pair.first) != pid) { in FilterNodeByPid()
219 if (pair.second == nullptr) { in FilterNodeByPid()
223 RSRenderNodeGC::Instance().AddToOffTreeNodeBucket(pair.second); in FilterNodeByPid()
225 if (auto parent = pair in FilterNodeByPid()
[all...]
/base/useriam/pin_auth/test/unittest/src/
H A Dpin_auth_all_in_one_hdi_unit_test.cpp100 for (const auto &pair : RESULT_CODE_MAP) { in HWTEST_F()
105 .WillOnce([&pair](ExecutorInfo &info) { in HWTEST_F()
111 return static_cast<int32_t>(pair.first); in HWTEST_F()
116 EXPECT_TRUE(ret == pair.second); in HWTEST_F()
122 static const std::map<AuthType, pair<IamAuthType, IamResultCode>> data = { in HWTEST_F()
129 for (const auto &pair : data) { in HWTEST_F()
134 .WillOnce([&pair](ExecutorInfo &info) { in HWTEST_F()
137 .authType = pair.first, in HWTEST_F()
145 EXPECT_TRUE(ret == pair.second.second); in HWTEST_F()
147 EXPECT_TRUE(info.authType == pair in HWTEST_F()
[all...]
H A Dpin_auth_verifier_hdi_unit_test.cpp100 for (const auto &pair : RESULT_CODE_MAP) { in HWTEST_F()
105 .WillOnce([&pair](ExecutorInfo &info) { in HWTEST_F()
111 return static_cast<int32_t>(pair.first); in HWTEST_F()
116 EXPECT_TRUE(ret == pair.second); in HWTEST_F()
122 static const std::map<AuthType, pair<IamAuthType, IamResultCode>> data = { in HWTEST_F()
129 for (const auto &pair : data) { in HWTEST_F()
134 .WillOnce([&pair](ExecutorInfo &info) { in HWTEST_F()
137 .authType = pair.first, in HWTEST_F()
145 EXPECT_TRUE(ret == pair.second.second); in HWTEST_F()
147 EXPECT_TRUE(info.authType == pair in HWTEST_F()
[all...]
H A Dpin_auth_collector_hdi_unit_test.cpp100 for (const auto &pair : RESULT_CODE_MAP) { in HWTEST_F()
105 .WillOnce([&pair](ExecutorInfo &info) { in HWTEST_F()
111 return static_cast<int32_t>(pair.first); in HWTEST_F()
116 EXPECT_TRUE(ret == pair.second); in HWTEST_F()
122 static const std::map<AuthType, pair<IamAuthType, IamResultCode>> data = { in HWTEST_F()
129 for (const auto &pair : data) { in HWTEST_F()
134 .WillOnce([&pair](ExecutorInfo &info) { in HWTEST_F()
137 .authType = pair.first, in HWTEST_F()
145 EXPECT_TRUE(ret == pair.second.second); in HWTEST_F()
147 EXPECT_TRUE(info.authType == pair in HWTEST_F()
[all...]
/third_party/node/test/sequential/
H A Dtest-tls-securepair-client.js52 function check(pair) {
54 assert.strictEqual(pair.cleartext.getPeerCertificate().ext_key_usage.length,
56 assert.strictEqual(pair.cleartext.getPeerCertificate().ext_key_usage[0],
131 const pair = tls.createSecurePair(sslcontext, false);
133 assert.ok(pair.encrypted.writable);
134 assert.ok(pair.cleartext.writable);
136 pair.encrypted.pipe(s);
137 s.pipe(pair.encrypted);
144 pair.cleartext.write('hello\r\n', function() {
150 pair
[all...]
/third_party/ltp/lib/newlib_tests/
H A Dtst_fuzzy_sync03.c21 static struct tst_fzsync_pair pair; variable
27 pair.exec_loops = LOOPS; in setup()
28 tst_fzsync_pair_init(&pair); in setup()
35 for (i = 0; tst_fzsync_run_b(&pair); i++) { in worker()
36 tst_fzsync_start_race_b(&pair); in worker()
39 tst_fzsync_end_race_b(&pair); in worker()
57 tst_fzsync_pair_reset(&pair, worker); in run()
58 for (i = 0; tst_fzsync_run_a(&pair); i++) { in run()
59 tst_fzsync_start_race_a(&pair); in run()
63 tst_fzsync_end_race_a(&pair); in run()
[all...]
/third_party/node/test/parallel/
H A Dtest-webcrypto-wrap-unwrap.js19 pair: true
24 pair: false
29 pair: false
38 pair: false
43 pair: false
53 if (kWrappingData[name].pair) {
74 pair: true,
85 pair: true,
96 pair: true,
105 pair
[all...]
/third_party/node/deps/v8/src/inspector/
H A Dv8-debugger-id.cc13 V8DebuggerId::V8DebuggerId(std::pair<int64_t, int64_t> pair) in V8DebuggerId() argument
14 : m_first(pair.first), m_second(pair.second) {} in V8DebuggerId()
23 std::pair<int64_t, int64_t> V8DebuggerId::pair() const { in pair() function in v8_inspector::V8DebuggerId
29 V8DebuggerId::V8DebuggerId(std::pair<int64_t, int64_t> pair) in V8DebuggerId() argument
30 : m_debugger_id(pair) {} in V8DebuggerId()
56 std::pair<int64_ function in v8_inspector::internal::V8DebuggerId
[all...]
/third_party/skia/third_party/externals/microhttpd/src/microspdy/
H A Dstructures.c44 struct SPDY_NameValue *pair; in SPDY_name_value_create() local
46 if(NULL == (pair = malloc(sizeof(struct SPDY_NameValue)))) in SPDY_name_value_create()
49 memset (pair, 0, sizeof (struct SPDY_NameValue)); in SPDY_name_value_create()
51 return pair; in SPDY_name_value_create()
62 struct SPDY_NameValue *pair; in SPDY_name_value_add() local
102 pair = container; in SPDY_name_value_add()
103 while(NULL != pair) in SPDY_name_value_add()
105 if(0 == strcmp(pair->name, name)) in SPDY_name_value_add()
107 //the value will be added to this pair in SPDY_name_value_add()
110 pair in SPDY_name_value_add()
[all...]

Completed in 13 milliseconds

12345678910>>...192