| /third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/pae/ |
| D | ieee802_1x_secy_ops.c | 30 struct ieee802_1x_kay_ctx *ops; in secy_cp_control_protect_frames() local
37 ops = kay->ctx; in secy_cp_control_protect_frames()
38 if (!ops || !ops->enable_protect_frames) { in secy_cp_control_protect_frames()
44 return ops->enable_protect_frames(ops->ctx, enabled); in secy_cp_control_protect_frames()
50 struct ieee802_1x_kay_ctx *ops; in secy_cp_control_encrypt() local
57 ops = kay->ctx; in secy_cp_control_encrypt()
58 if (!ops || !ops->enable_encrypt) { in secy_cp_control_encrypt()
64 return ops->enable_encrypt(ops->ctx, enabled); in secy_cp_control_encrypt()
70 struct ieee802_1x_kay_ctx *ops; in secy_cp_control_replay() local
77 ops = kay->ctx; in secy_cp_control_replay()
[all …]
|
| /third_party/wpa_supplicant/wpa_supplicant-2.9/src/pae/ |
| D | ieee802_1x_secy_ops.c | 30 struct ieee802_1x_kay_ctx *ops; in secy_cp_control_protect_frames() local
37 ops = kay->ctx; in secy_cp_control_protect_frames()
38 if (!ops || !ops->enable_protect_frames) { in secy_cp_control_protect_frames()
44 return ops->enable_protect_frames(ops->ctx, enabled); in secy_cp_control_protect_frames()
50 struct ieee802_1x_kay_ctx *ops; in secy_cp_control_encrypt() local
57 ops = kay->ctx; in secy_cp_control_encrypt()
58 if (!ops || !ops->enable_encrypt) { in secy_cp_control_encrypt()
64 return ops->enable_encrypt(ops->ctx, enabled); in secy_cp_control_encrypt()
70 struct ieee802_1x_kay_ctx *ops; in secy_cp_control_replay() local
77 ops = kay->ctx; in secy_cp_control_replay()
[all …]
|
| /third_party/skia/third_party/externals/spirv-tools/test/reduce/ |
| D | structured_loop_to_selection_test.cpp | 67 const auto ops = StructuredLoopToSelectionReductionOpportunityFinder() in TEST() local
69 ASSERT_EQ(1, ops.size()); in TEST()
71 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
72 ops[0]->TryToApply(); in TEST()
213 const auto ops = StructuredLoopToSelectionReductionOpportunityFinder() in TEST() local
215 ASSERT_EQ(4, ops.size()); in TEST()
217 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
218 ops[0]->TryToApply(); in TEST()
315 ASSERT_TRUE(ops[1]->PreconditionHolds()); in TEST()
316 ops[1]->TryToApply(); in TEST()
[all …]
|
| D | conditional_branch_to_simple_conditional_branch_test.cpp | 82 auto ops = ConditionalBranchToSimpleConditionalBranchOpportunityFinder() in TEST() local
85 ASSERT_EQ(2, ops.size()); in TEST()
87 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
88 ASSERT_TRUE(ops[1]->PreconditionHolds()); in TEST()
89 ops[0]->TryToApply(); in TEST()
91 ASSERT_FALSE(ops[1]->PreconditionHolds()); in TEST()
127 ops = ConditionalBranchToSimpleConditionalBranchOpportunityFinder() in TEST()
129 ASSERT_EQ(0, ops.size()); in TEST()
136 ops = ConditionalBranchToSimpleConditionalBranchOpportunityFinder() in TEST()
138 ASSERT_EQ(2, ops.size()); in TEST()
[all …]
|
| D | remove_unused_instruction_test.cpp | 75 auto ops = finder.GetAvailableOpportunities(context.get(), 0); in TEST() local
77 ASSERT_EQ(10, ops.size()); in TEST()
79 for (auto& op : ops) { in TEST()
111 ops = finder.GetAvailableOpportunities(context.get(), 0); in TEST()
113 ASSERT_EQ(7, ops.size()); in TEST()
115 for (auto& op : ops) { in TEST()
140 ops = finder.GetAvailableOpportunities(context.get(), 0); in TEST()
142 ASSERT_EQ(1, ops.size()); in TEST()
144 for (auto& op : ops) { in TEST()
168 ops = finder.GetAvailableOpportunities(context.get(), 0); in TEST()
[all …]
|
| D | remove_selection_test.cpp | 63 auto ops = in TEST() local
67 ASSERT_EQ(1, ops.size()); in TEST()
69 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
70 ops[0]->TryToApply(); in TEST()
98 ops = RemoveSelectionReductionOpportunityFinder().GetAvailableOpportunities( in TEST()
100 ASSERT_EQ(0, ops.size()); in TEST()
137 auto ops = in TEST() local
141 ASSERT_EQ(1, ops.size()); in TEST()
143 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
144 ops[0]->TryToApply(); in TEST()
[all …]
|
| D | simple_conditional_branch_to_branch_test.cpp | 75 auto ops = SimpleConditionalBranchToBranchOpportunityFinder() in TEST() local
78 ASSERT_EQ(0, ops.size()); in TEST()
124 auto ops = SimpleConditionalBranchToBranchOpportunityFinder() in TEST() local
127 ASSERT_EQ(1, ops.size()); in TEST()
129 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
130 ops[0]->TryToApply(); in TEST()
163 ops = SimpleConditionalBranchToBranchOpportunityFinder() in TEST()
165 ASSERT_EQ(0, ops.size()); in TEST()
219 auto ops = SimpleConditionalBranchToBranchOpportunityFinder() in TEST() local
222 ASSERT_EQ(0, ops.size()); in TEST()
[all …]
|
| /third_party/spirv-tools/test/reduce/ |
| D | structured_loop_to_selection_test.cpp | 67 const auto ops = StructuredLoopToSelectionReductionOpportunityFinder() in TEST() local
69 ASSERT_EQ(1, ops.size()); in TEST()
71 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
72 ops[0]->TryToApply(); in TEST()
213 const auto ops = StructuredLoopToSelectionReductionOpportunityFinder() in TEST() local
215 ASSERT_EQ(4, ops.size()); in TEST()
217 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
218 ops[0]->TryToApply(); in TEST()
315 ASSERT_TRUE(ops[1]->PreconditionHolds()); in TEST()
316 ops[1]->TryToApply(); in TEST()
[all …]
|
| D | conditional_branch_to_simple_conditional_branch_test.cpp | 82 auto ops = ConditionalBranchToSimpleConditionalBranchOpportunityFinder() in TEST() local
85 ASSERT_EQ(2, ops.size()); in TEST()
87 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
88 ASSERT_TRUE(ops[1]->PreconditionHolds()); in TEST()
89 ops[0]->TryToApply(); in TEST()
91 ASSERT_FALSE(ops[1]->PreconditionHolds()); in TEST()
127 ops = ConditionalBranchToSimpleConditionalBranchOpportunityFinder() in TEST()
129 ASSERT_EQ(0, ops.size()); in TEST()
136 ops = ConditionalBranchToSimpleConditionalBranchOpportunityFinder() in TEST()
138 ASSERT_EQ(2, ops.size()); in TEST()
[all …]
|
| D | remove_unused_instruction_test.cpp | 75 auto ops = finder.GetAvailableOpportunities(context.get(), 0); in TEST() local
77 ASSERT_EQ(10, ops.size()); in TEST()
79 for (auto& op : ops) { in TEST()
111 ops = finder.GetAvailableOpportunities(context.get(), 0); in TEST()
113 ASSERT_EQ(7, ops.size()); in TEST()
115 for (auto& op : ops) { in TEST()
140 ops = finder.GetAvailableOpportunities(context.get(), 0); in TEST()
142 ASSERT_EQ(1, ops.size()); in TEST()
144 for (auto& op : ops) { in TEST()
168 ops = finder.GetAvailableOpportunities(context.get(), 0); in TEST()
[all …]
|
| D | remove_selection_test.cpp | 63 auto ops = in TEST() local
67 ASSERT_EQ(1, ops.size()); in TEST()
69 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
70 ops[0]->TryToApply(); in TEST()
98 ops = RemoveSelectionReductionOpportunityFinder().GetAvailableOpportunities( in TEST()
100 ASSERT_EQ(0, ops.size()); in TEST()
137 auto ops = in TEST() local
141 ASSERT_EQ(1, ops.size()); in TEST()
143 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
144 ops[0]->TryToApply(); in TEST()
[all …]
|
| D | simple_conditional_branch_to_branch_test.cpp | 75 auto ops = SimpleConditionalBranchToBranchOpportunityFinder() in TEST() local
78 ASSERT_EQ(0, ops.size()); in TEST()
124 auto ops = SimpleConditionalBranchToBranchOpportunityFinder() in TEST() local
127 ASSERT_EQ(1, ops.size()); in TEST()
129 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
130 ops[0]->TryToApply(); in TEST()
163 ops = SimpleConditionalBranchToBranchOpportunityFinder() in TEST()
165 ASSERT_EQ(0, ops.size()); in TEST()
219 auto ops = SimpleConditionalBranchToBranchOpportunityFinder() in TEST() local
222 ASSERT_EQ(0, ops.size()); in TEST()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/reduce/ |
| D | structured_loop_to_selection_test.cpp | 67 const auto ops = StructuredLoopToSelectionReductionOpportunityFinder() in TEST() local
69 ASSERT_EQ(1, ops.size()); in TEST()
71 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
72 ops[0]->TryToApply(); in TEST()
213 const auto ops = StructuredLoopToSelectionReductionOpportunityFinder() in TEST() local
215 ASSERT_EQ(4, ops.size()); in TEST()
217 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
218 ops[0]->TryToApply(); in TEST()
315 ASSERT_TRUE(ops[1]->PreconditionHolds()); in TEST()
316 ops[1]->TryToApply(); in TEST()
[all …]
|
| D | conditional_branch_to_simple_conditional_branch_test.cpp | 82 auto ops = ConditionalBranchToSimpleConditionalBranchOpportunityFinder() in TEST() local
85 ASSERT_EQ(2, ops.size()); in TEST()
87 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
88 ASSERT_TRUE(ops[1]->PreconditionHolds()); in TEST()
89 ops[0]->TryToApply(); in TEST()
91 ASSERT_FALSE(ops[1]->PreconditionHolds()); in TEST()
127 ops = ConditionalBranchToSimpleConditionalBranchOpportunityFinder() in TEST()
129 ASSERT_EQ(0, ops.size()); in TEST()
136 ops = ConditionalBranchToSimpleConditionalBranchOpportunityFinder() in TEST()
138 ASSERT_EQ(2, ops.size()); in TEST()
[all …]
|
| D | remove_unused_instruction_test.cpp | 75 auto ops = finder.GetAvailableOpportunities(context.get(), 0); in TEST() local
77 ASSERT_EQ(10, ops.size()); in TEST()
79 for (auto& op : ops) { in TEST()
111 ops = finder.GetAvailableOpportunities(context.get(), 0); in TEST()
113 ASSERT_EQ(7, ops.size()); in TEST()
115 for (auto& op : ops) { in TEST()
140 ops = finder.GetAvailableOpportunities(context.get(), 0); in TEST()
142 ASSERT_EQ(1, ops.size()); in TEST()
144 for (auto& op : ops) { in TEST()
168 ops = finder.GetAvailableOpportunities(context.get(), 0); in TEST()
[all …]
|
| D | remove_selection_test.cpp | 63 auto ops = in TEST() local
67 ASSERT_EQ(1, ops.size()); in TEST()
69 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
70 ops[0]->TryToApply(); in TEST()
98 ops = RemoveSelectionReductionOpportunityFinder().GetAvailableOpportunities( in TEST()
100 ASSERT_EQ(0, ops.size()); in TEST()
137 auto ops = in TEST() local
141 ASSERT_EQ(1, ops.size()); in TEST()
143 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
144 ops[0]->TryToApply(); in TEST()
[all …]
|
| D | simple_conditional_branch_to_branch_test.cpp | 75 auto ops = SimpleConditionalBranchToBranchOpportunityFinder() in TEST() local
78 ASSERT_EQ(0, ops.size()); in TEST()
124 auto ops = SimpleConditionalBranchToBranchOpportunityFinder() in TEST() local
127 ASSERT_EQ(1, ops.size()); in TEST()
129 ASSERT_TRUE(ops[0]->PreconditionHolds()); in TEST()
130 ops[0]->TryToApply(); in TEST()
163 ops = SimpleConditionalBranchToBranchOpportunityFinder() in TEST()
165 ASSERT_EQ(0, ops.size()); in TEST()
219 auto ops = SimpleConditionalBranchToBranchOpportunityFinder() in TEST() local
222 ASSERT_EQ(0, ops.size()); in TEST()
[all …]
|
| /third_party/skia/third_party/externals/spirv-cross/ |
| D | spirv_parser.cpp | 181 auto *ops = stream(instruction); in parse() local
195 set<SPIRString>(ops[0], extract_string(ir.spirv, instruction.offset + 1)); in parse()
200 ir.addressing_model = static_cast<AddressingModel>(ops[0]); in parse()
201 ir.memory_model = static_cast<MemoryModel>(ops[1]); in parse()
206 auto lang = static_cast<SourceLanguage>(ops[0]); in parse()
211 ir.source.version = ops[1]; in parse()
218 ir.source.version = ops[1]; in parse()
240 uint32_t result_type = ops[0]; in parse()
241 uint32_t id = ops[1]; in parse()
244 current_block->ops.push_back(instruction); in parse()
[all …]
|
| D | spirv_hlsl.cpp | 2738 auto *ops = stream(i); in emit_texture_op() local
2744 uint32_t result_type = ops[0]; in emit_texture_op()
2745 uint32_t id = ops[1]; in emit_texture_op()
2746 VariableID img = ops[2]; in emit_texture_op()
2747 uint32_t coord = ops[3]; in emit_texture_op()
2769 dref = ops[4]; in emit_texture_op()
2770 opt = &ops[5]; in emit_texture_op()
2776 dref = ops[4]; in emit_texture_op()
2778 opt = &ops[5]; in emit_texture_op()
2783 dref = ops[4]; in emit_texture_op()
[all …]
|
| /third_party/ltp/tools/sparse/sparse-src/validation/backend/ |
| D | function-ptr.c | 96 struct ops { struct
109 void ops(int a, int *p, struct ops *ops); argument
110 void ops(int a, int *p, struct ops *ops) in ops() argument
112 ops->fv(); in ops()
114 ops->fb(a); in ops()
115 ops->fi(a); in ops()
116 ops->fl(a); in ops()
117 ops->fb(123); in ops()
118 ops->fi(123); in ops()
119 ops->fl(123); in ops()
[all …]
|
| /third_party/mesa3d/src/gallium/winsys/svga/drm/ |
| D | vmw_fence.c | 89 vmw_fence_ops(struct pb_fence_ops *ops) in vmw_fence_ops() argument
91 assert(ops); in vmw_fence_ops()
92 return (struct vmw_fence_ops *)ops; in vmw_fence_ops()
104 vmw_fences_release(struct vmw_fence_ops *ops) in vmw_fences_release() argument
108 mtx_lock(&ops->mutex); in vmw_fences_release()
109 LIST_FOR_EACH_ENTRY_SAFE(fence, n, &ops->not_signaled, ops_list) in vmw_fences_release()
111 mtx_unlock(&ops->mutex); in vmw_fences_release()
130 struct vmw_fence_ops *ops = NULL; in vmw_fences_signal() local
136 ops = vmw_fence_ops(fence_ops); in vmw_fences_signal()
137 mtx_lock(&ops->mutex); in vmw_fences_signal()
[all …]
|
| /third_party/skia/src/gpu/ |
| D | BUILD.bazel | 306 "ops/AAConvexPathRenderer.cpp",
307 "ops/AAConvexPathRenderer.h",
308 "ops/AAHairLinePathRenderer.cpp",
309 "ops/AAHairLinePathRenderer.h",
310 "ops/AALinearizingConvexPathRenderer.cpp",
311 "ops/AALinearizingConvexPathRenderer.h",
312 "ops/AtlasInstancedHelper.cpp",
313 "ops/AtlasInstancedHelper.h",
314 "ops/AtlasPathRenderer.cpp",
315 "ops/AtlasPathRenderer.h",
[all …]
|
| /third_party/FreeBSD/sys/kern/ |
| D | subr_kobj.c | 82 kobj_class_compile_common(kobj_class_t cls, kobj_ops_t ops) in kobj_class_compile_common() argument
90 if (cls->ops) in kobj_class_compile_common()
105 ops->cache[i] = &null_method; in kobj_class_compile_common()
106 ops->cls = cls; in kobj_class_compile_common()
107 cls->ops = ops; in kobj_class_compile_common()
113 kobj_ops_t ops; in kobj_class_compile() local
120 ops = bsd_malloc(sizeof(struct kobj_ops), M_KOBJ, M_NOWAIT); in kobj_class_compile()
121 if (!ops) in kobj_class_compile()
131 if (cls->ops) { in kobj_class_compile()
133 bsd_free(ops, M_KOBJ); in kobj_class_compile()
[all …]
|
| /third_party/rust/crates/clap/src/builder/ |
| D | range.rs | 103 impl std::ops::RangeBounds<usize> for ValueRange {
104 fn start_bound(&self) -> std::ops::Bound<&usize> { in start_bound()
105 std::ops::Bound::Included(&self.start_inclusive) in start_bound()
108 fn end_bound(&self) -> std::ops::Bound<&usize> { in end_bound()
109 std::ops::Bound::Included(&self.end_inclusive) in end_bound()
125 impl From<std::ops::Range<usize>> for ValueRange {
126 fn from(range: std::ops::Range<usize>) -> Self { in from()
133 impl From<std::ops::RangeFull> for ValueRange {
134 fn from(_: std::ops::RangeFull) -> Self { in from()
141 impl From<std::ops::RangeFrom<usize>> for ValueRange {
[all …]
|
| /third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/reconvergence/ |
| D | vktReconvergenceTests.cpp | 344 vector<OP> ops; member in vkt::Reconvergence::__anoncadfe3a00111::RandomProgram
370 ops.push_back({OP_IF_LOCAL_INVOCATION_INDEX, localIndexCmp}); in genIf()
372 ops.push_back({OP_IF_LOOPCOUNT, 0}); in genIf()
374 ops.push_back({OP_IF_MASK, mask}); in genIf()
378 size_t thenBegin = ops.size(); in genIf()
380 size_t thenEnd = ops.size(); in genIf()
386 ops.push_back({OP_ELSE_LOCAL_INVOCATION_INDEX, localIndexCmp}); in genIf()
388 ops.push_back({OP_ELSE_LOOPCOUNT, 0}); in genIf()
390 ops.push_back({OP_ELSE_MASK, 0}); in genIf()
396 ops.push_back(ops[i]); in genIf()
[all …]
|