/third_party/node/deps/ngtcp2/ngtcp2/lib/ |
H A D | ngtcp2_rob.c | 32 int ngtcp2_rob_gap_new(ngtcp2_rob_gap **pg, uint64_t begin, uint64_t end, in ngtcp2_rob_gap_new() argument 40 (*pg)->range.end = end; in ngtcp2_rob_gap_new() 57 (*pd)->range.end = offset + chunk; in ngtcp2_rob_data_new() 59 (*pd)->end = (*pd)->begin + chunk; in ngtcp2_rob_data_new() 197 rv = ngtcp2_rob_gap_new(&ng, r.begin, r.end, rob->mem); in ngtcp2_rob_push() 233 if (offset < g->range.end) { in ngtcp2_rob_remove_prefix() 234 ngtcp2_range r = {offset, g->range.end}; in ngtcp2_rob_remove_prefix()
|
/third_party/ltp/testcases/realtime/func/matrix_mult/ |
H A D | matrix_mult.c | 115 nsec_t start, end, delta; in matrix_mult_record() local 121 end = rt_gettime(); in matrix_mult_record() 122 delta = (long)((end - start) / NS_PER_US); in matrix_mult_record() 175 nsec_t start, end; in main_thread() local 212 end = rt_gettime(); in main_thread() 213 delta = (long)((end - start) / NS_PER_US); in main_thread() 256 end = rt_gettime(); in main_thread() 258 delta = (long)((end - start) / NS_PER_US); in main_thread()
|
/third_party/node/deps/v8/src/torque/ |
H A D | cfg.h | 112 auto newEnd = std::remove_if(placed_blocks_.begin(), placed_blocks_.end(), in UnplaceBlockIf() 114 placed_blocks_.erase(newEnd, placed_blocks_.end()); in UnplaceBlockIf() 117 base::Optional<Block*> end() const { return end_; } in end() function in v8::internal::torque::ControlFlowGraph 118 void set_end(Block* end) { end_ = end; } in set_end() argument 172 cfg_.blocks().begin(), cfg_.blocks().end(), [this](Block* block) { in CfgIsComplete() 173 return (cfg_.end() && *cfg_.end() == block) || block->IsComplete(); in CfgIsComplete()
|
/third_party/node/deps/openssl/openssl/crypto/evp/ |
H A D | pmeth_gn.c | 55 goto end; in gen_init() 81 end: in gen_init() 91 goto end; in gen_init() 206 goto end; in EVP_PKEY_generate() 235 end: in EVP_PKEY_generate() 246 goto end; in EVP_PKEY_generate() 250 goto end; in EVP_PKEY_generate() 255 goto end; in EVP_PKEY_generate()
|
/third_party/openssl/crypto/evp/ |
H A D | pmeth_gn.c | 55 goto end; in gen_init() 81 end: in gen_init() 91 goto end; in gen_init() 206 goto end; in EVP_PKEY_generate() 235 end: in EVP_PKEY_generate() 246 goto end; in EVP_PKEY_generate() 250 goto end; in EVP_PKEY_generate() 255 goto end; in EVP_PKEY_generate()
|
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/transform_feedback/ |
H A D | vktTransformFeedbackFuzzLayoutCase.hpp | 164 inline Iterator end (void) { return m_members.end(); } in end() function in vkt::TransformFeedback::StructType 165 inline ConstIterator end (void) const { return m_members.end(); } in end() function in vkt::TransformFeedback::StructType 214 inline Iterator end (void) { return m_members.end(); } in end() function in vkt::TransformFeedback::InterfaceBlock 215 inline ConstIterator end (void) const { return m_members.end(); } in end() function in vkt::TransformFeedback::InterfaceBlock
|
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/ubo/ |
H A D | vktUniformBlockCase.hpp | 169 inline Iterator end (void) { return m_members.end(); } in end() function in vkt::ubo::StructType 170 inline ConstIterator end (void) const { return m_members.end(); } in end() function in vkt::ubo::StructType 216 inline Iterator end (void) { return m_uniforms.end(); } in end() function in vkt::ubo::UniformBlock 217 inline ConstIterator end (void) const { return m_uniforms.end(); } in end() function in vkt::ubo::UniformBlock
|
/third_party/skia/third_party/externals/angle2/src/compiler/translator/TranslatorMetalDirect/ |
H A D | ToposortStructs.cpp | 33 if (g.find(s) != g.end()) in BuildGraphImpl() 48 es.insert(ez.begin(), ez.end()); in BuildGraphImpl() 84 if (invPerms.find(n) == invPerms.end()) in Toposort() 90 if (temps.find(n) != temps.end()) in Toposort() 101 ASSERT(enIter != g.end()); in Toposort() 233 usedStructs.find(structure) == usedStructs.end() in GetAsDeclaredStructure() 337 ASSERT(rawToDeclared.find(d.structure) == rawToDeclared.end()); in ToposortStructs() 350 if (it != rawToDeclared.end()) in ToposortStructs()
|
/third_party/skia/third_party/externals/angle2/src/common/ |
H A D | CircularBuffer.h | 44 // begin() and end() are used to iterate over all elements regardless of the current position of 50 iterator end(); 51 const_iterator end() const; 60 // Move the front forward to the next index, looping back to the beginning if the end of the 76 std::fill(begin(), end(), value); in CircularBuffer() 96 std::copy(other.begin(), other.end(), begin()); in operator =() 126 ANGLE_INLINE typename CircularBuffer<T, N, Storage>::iterator CircularBuffer<T, N, Storage>::end() in end() function in angle::CircularBuffer 128 return mData.end(); in end() 133 CircularBuffer<T, N, Storage>::end() const in end() function in angle::CircularBuffer 135 return mData.end(); in end() [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
H A D | SwiftErrorValueTracking.cpp | 34 if (It == VRegDefMap.end()) { in getOrCreateVReg() 54 if (It != VRegDefUses.end()) in getOrCreateVRegDefAt() 69 if (It != VRegDefUses.end()) in getOrCreateVRegUseAt() 164 bool UpwardsUse = UUseIt != VRegUpwardsUse.end(); in propagateVRegs() 166 bool DownwardDef = VRegDefIt != VRegDefMap.end(); in propagateVRegs() 196 assert(UUseIt != VRegUpwardsUse.end()); in propagateVRegs() 206 VRegs.begin(), VRegs.end(), in propagateVRegs() 209 VRegs.end(); in propagateVRegs()
|
/third_party/vk-gl-cts/executor/tools/ |
H A D | xeTestLogCompare.cpp | 223 for (vector<ShortBatchResult>::const_iterator batchIter = batchResults.begin(); batchIter != batchResults.end(); batchIter++) in computeCaseList() 225 for (vector<xe::TestCaseResultHeader>::const_iterator caseIter = batchIter->resultHeaders.begin(); caseIter != batchIter->resultHeaders.end(); caseIter++) in computeCaseList() 227 if (addedCases.find(caseIter->casePath) == addedCases.end()) in computeCaseList() 245 if (resultPos != batchResult.resultMap.end()) in getTestResultHeaders() 305 for (vector<string>::const_iterator nameIter = batchNames.begin(); nameIter != batchNames.end(); nameIter++) in runCompare() 311 for (vector<string>::const_iterator caseIter = caseList.begin(); caseIter != caseList.end(); caseIter++) in runCompare() 319 for (vector<xe::TestCaseResultHeader>::const_iterator iter = headers.begin()+1; iter != headers.end(); iter++) in runCompare() 343 for (vector<xe::TestCaseResultHeader>::const_iterator iter = headers.begin(); iter != headers.end(); iter++) in runCompare()
|
/third_party/skia/third_party/externals/spirv-tools/source/val/ |
H A D | validate_function.cpp | 38 if (std::find(dec_a.begin(), dec_a.end(), dec) == dec_a.end()) { in DoPointeesLogicallyMatch() 90 if (std::find(acceptable.begin(), acceptable.end(), use->opcode()) == in ValidateFunction() 91 acceptable.end() && in ValidateFunction() 165 decorations.begin(), decorations.end(), [](const Decoration& d) { in ValidateFunctionParameter() 170 decorations.begin(), decorations.end(), [](const Decoration& d) { in ValidateFunctionParameter() 197 decorations.begin(), decorations.end(), [](const Decoration& d) { in ValidateFunctionParameter() 202 decorations.begin(), decorations.end(), [](const Decoration& d) { in ValidateFunctionParameter()
|
/third_party/openssl/test/ |
H A D | asynciotest.c | 303 goto end; in test_asyncio() 321 goto end; in test_asyncio() 329 goto end; in test_asyncio() 353 goto end; in test_asyncio() 357 goto end; in test_asyncio() 374 goto end; in test_asyncio() 378 goto end; in test_asyncio() 388 end: in test_asyncio()
|
/third_party/skia/third_party/externals/spirv-cross/ |
H A D | spirv_cfg.cpp | 84 return itr != end(visit_order) && itr->second.get() == 0; in is_back_edge() 91 return itr != end(visit_order) && itr->second.get() > 0; in has_visited_forward_edge() 117 // For selection constructs true/false blocks will end up visiting the merge block directly and it works out fine, in post_order_visit() 118 // but for loops, only the header might end up actually branching to merge block. in post_order_visit() 169 if (pred_itr != end(preceding_edges)) in post_order_visit() 174 if (succ_itr != end(succeeding_edges)) in post_order_visit() 220 auto itr = find(begin(l), end(l), value); in add_branch() 221 if (itr == end(l)) in add_branch() 233 if (itr == end(preceding_edges)) in find_loop_dominator() 292 if (pred_itr == end(preceding_edge in node_terminates_control_flow_in_sub_graph() [all...] |
/third_party/skia/third_party/externals/spirv-tools/source/ |
H A D | cfa.h | 87 /// predecessors), and it is therefore at the end of the postorder vector. 155 if (top.iter == end(*successor_func(top.block))) { in DepthFirstTraversal() 196 auto res = std::find_if(std::begin(predecessors), std::end(predecessors), in CalculateDominators() 201 if (res == end(predecessors)) continue; in CalculateDominators() 243 out.begin(), out.end(), in CalculateDominators() 331 augmented_preds.insert(augmented_preds.end(), preds->begin(), preds->end()); in ComputeAugmentedCFG() 341 augmented_succ.insert(augmented_succ.end(), succ->begin(), succ->end()); in ComputeAugmentedCFG()
|
/third_party/skia/third_party/externals/spirv-tools/source/fuzz/ |
H A D | transformation_replace_params_with_struct.cpp | 46 message_.parameter_id().end()); in IsApplicable() 125 std::all_of(fresh_ids.begin(), fresh_ids.end(), in IsApplicable() 175 indices_of_replaced_params.end())) { in Apply() 202 while (iter != function->begin()->end() && in Apply() 237 indices_of_replaced_params.end(), in Apply() 238 i - 1) == indices_of_replaced_params.end()) { in Apply() 294 auto it = std::find_if(params.begin(), params.end(), in ComputeIndicesOfReplacedParameters() 298 assert(it != params.end() && "Parameter's id is invalid"); in ComputeIndicesOfReplacedParameters()
|
/third_party/skia/third_party/externals/spirv-tools/source/opt/ |
H A D | scalar_analysis_nodes.h | 76 auto position = std::find_if_not(children_.begin(), children_.end(), in AddChild() 108 iterator end() { return children_.end(); } in end() function in spvtools::opt::SENode 112 const_iterator end() const { return children_.cend(); } in end() function in spvtools::opt::SENode 126 recurrent_nodes.insert(recurrent_nodes.end(), in CollectRecurrentNodes() 128 child_recurrent_nodes.end()); in CollectRecurrentNodes() 144 value_unknown_nodes.insert(value_unknown_nodes.end(), in CollectValueUnknownNodes() 146 child_value_unknown_nodes.end()); in CollectValueUnknownNodes()
|
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/ |
H A D | cfa.h | 87 /// predecessors), and it is therefore at the end of the postorder vector. 155 if (top.iter == end(*successor_func(top.block))) { in DepthFirstTraversal() 196 auto res = std::find_if(std::begin(predecessors), std::end(predecessors), in CalculateDominators() 201 if (res == end(predecessors)) continue; in CalculateDominators() 243 out.begin(), out.end(), in CalculateDominators() 331 augmented_preds.insert(augmented_preds.end(), preds->begin(), preds->end()); in ComputeAugmentedCFG() 341 augmented_succ.insert(augmented_succ.end(), succ->begin(), succ->end()); in ComputeAugmentedCFG()
|
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
H A D | transformation_replace_params_with_struct.cpp | 46 message_.parameter_id().end()); in IsApplicable() 125 std::all_of(fresh_ids.begin(), fresh_ids.end(), in IsApplicable() 175 indices_of_replaced_params.end())) { in Apply() 202 while (iter != function->begin()->end() && in Apply() 237 indices_of_replaced_params.end(), in Apply() 238 i - 1) == indices_of_replaced_params.end()) { in Apply() 294 auto it = std::find_if(params.begin(), params.end(), in ComputeIndicesOfReplacedParameters() 298 assert(it != params.end() && "Parameter's id is invalid"); in ComputeIndicesOfReplacedParameters()
|
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
H A D | ccp_pass.cpp | 64 if (it != values_.end()) { in VisitPhi() 118 if (val1_it == values_.end()) { in ComputeLatticeMeet() 142 if (it != values_.end()) { in VisitAssignment() 163 if (it == values_.end() || IsVaryingValue(it->second)) { in VisitAssignment() 186 if (iter != values_.end() && IsVaryingValue(iter->second)) return false; in VisitAssignment() 196 if (it == values_.end()) return false; in VisitAssignment() 222 if (it == values_.end() || IsVaryingValue(it->second)) { in VisitBranch() 253 if (it == values_.end() || IsVaryingValue(it->second)) { in VisitBranch()
|
H A D | scalar_analysis_nodes.h | 76 auto position = std::find_if_not(children_.begin(), children_.end(), in AddChild() 108 iterator end() { return children_.end(); } in end() function in spvtools::opt::SENode 112 const_iterator end() const { return children_.cend(); } in end() function in spvtools::opt::SENode 126 recurrent_nodes.insert(recurrent_nodes.end(), in CollectRecurrentNodes() 128 child_recurrent_nodes.end()); in CollectRecurrentNodes() 144 value_unknown_nodes.insert(value_unknown_nodes.end(), in CollectValueUnknownNodes() 146 child_value_unknown_nodes.end()); in CollectValueUnknownNodes()
|
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/val/ |
H A D | validate_function.cpp | 38 if (std::find(dec_a.begin(), dec_a.end(), dec) == dec_a.end()) { in DoPointeesLogicallyMatch() 90 if (std::find(acceptable.begin(), acceptable.end(), use->opcode()) == in ValidateFunction() 91 acceptable.end() && in ValidateFunction() 165 decorations.begin(), decorations.end(), [](const Decoration& d) { in ValidateFunctionParameter() 170 decorations.begin(), decorations.end(), [](const Decoration& d) { in ValidateFunctionParameter() 197 decorations.begin(), decorations.end(), [](const Decoration& d) { in ValidateFunctionParameter() 202 decorations.begin(), decorations.end(), [](const Decoration& d) { in ValidateFunctionParameter()
|
/third_party/skia/src/shaders/gradients/ |
H A D | Sk4fGradientBase.cpp | 47 const int end = fBegin + fAdvance * (fShader.fColorCount - 1); in iterate() local 63 } while (prev != end); in iterate() 74 const int end = fBegin + fAdvance * (fShader.fColorCount - 2); in iterateImplicitPos() local 78 while (prev != end) { in iterateImplicitPos() 88 // emit the last interval with a pinned end position, to avoid precision issues in iterateImplicitPos() 166 // wraps around at the end: in init() 174 // (the iterator should never run off the end in this mode) in init() 240 const auto* i1 = fIntervals.end() - 1; in find() 263 SkASSERT(prev >= fIntervals.begin() && prev < fIntervals.end()); in findNext() 273 if (i >= fIntervals.end()) { in findNext() [all...] |
/third_party/skia/src/utils/ |
H A D | SkParseColor.cpp | 301 std::end (gColorNames), in FindNamedColor() 307 if (rec == std::end(gColorNames) || 0 != strcmp(name, *rec)) { in FindNamedColor() 346 const char* end = SkParse::FindHex(value + 1, &hex); in FindColor() local 347 // SkASSERT(end); in FindColor() 348 if (end == nullptr) in FindColor() 349 return end; in FindColor() 350 size_t len = end - value - 1; in FindColor() 357 return end; in FindColor() 362 return end; in FindColor() 372 // const char* end in FindColor() [all...] |
/third_party/skia/third_party/externals/angle2/src/tests/test_utils/ |
H A D | compiler_test.cpp | 166 EXPECT_NE(mOutputCode.end(), code); in foundInCodeRegex() 167 if (code == mOutputCode.end()) in foundInCodeRegex() 191 EXPECT_NE(mOutputCode.end(), code); in foundInCode() 192 if (code == mOutputCode.end()) in foundInCode() 210 EXPECT_NE(mOutputCode.end(), code); in foundInCodeInOrder() 211 if (code == mOutputCode.end()) in foundInCodeInOrder() 240 EXPECT_NE(mOutputCode.end(), code); in foundInCode() 241 if (code == mOutputCode.end()) in foundInCode()
|