/third_party/ffmpeg/libavcodec/ |
H A D | fitsdec.c | 53 * @param end pointer to end of packet 56 static int fill_data_min_max(const uint8_t *ptr8, FITSHeader *header, const uint8_t *end) in fill_data_min_max() argument 102 * @param end pointer to end of packet 107 const uint8_t *end, AVDictionary **metadata) in fits_read_header() 116 if (end - ptr8 < 80) in fits_read_header() 126 if (end - ptr8 < bytes_left) in fits_read_header() 154 if (end - ptr8 < size) in fits_read_header() 159 ret = fill_data_min_max(ptr8, header, end); in fits_read_header() 106 fits_read_header(AVCodecContext *avctx, const uint8_t **ptr, FITSHeader *header, const uint8_t *end, AVDictionary **metadata) fits_read_header() argument 187 const uint8_t *ptr8 = avpkt->data, *end; fits_decode_frame() local [all...] |
/third_party/ffmpeg/libavformat/ |
H A D | mpjpegdec.c | 42 char *end; in trim_right() local 47 end = p + strlen(p); in trim_right() 48 while (end > p && av_isspace(*(end-1))) in trim_right() 49 *(--end) = '\0'; in trim_right() 253 const char *end; in mpjpeg_get_boundary() local 271 end = strchr(start, ';'); in mpjpeg_get_boundary() 272 if (end) in mpjpeg_get_boundary() 273 len = end - start - 1; in mpjpeg_get_boundary() 330 /* no size was given -- we read until the next boundary or end in mpjpeg_read_packet() [all...] |
/third_party/gn/src/gn/ |
H A D | command_help.cc | 219 if (found == all.end()) in PrintHelpOnSwitch() 294 if (found_command != command_map.end()) { in RunHelp() 304 if (found_function != function_map.end()) in RunHelp() 313 if (found_builtin_var != builtin_vars.end()) in RunHelp() 322 if (found_target_var != target_vars.end()) in RunHelp() 327 if (found_function != function_map.end() || in RunHelp() 328 found_builtin_var != builtin_vars.end() || in RunHelp() 329 found_target_var != target_vars.end()) in RunHelp() 356 if (found_random_topic != random_topics.end()) { in RunHelp()
|
/third_party/libphonenumber/tools/java/data/src/com/google/i18n/phonenumbers/ |
H A D | CombineGeoData.java | 66 * Utility class that contains two indexes (start and end). 70 public final int end; field in CombineGeoData.Range 72 public Range(int start, int end) { in Range() argument 74 this.end = end; in Range() 112 * Finds the end index of the range of phone number prefixes starting at the provided index. 118 * @return the index of the end of the range starting at the provided index 138 * end indexes of a set of mappings that share the same description and have the same prefix minus 166 * @param end the end o 169 findConflict(String[] prefixes, int candidate, int start, int end) findConflict() argument [all...] |
/third_party/libwebsockets/include/libwebsockets/ |
H A D | lws-http.h | 527 * name match is trimmed off if the name does not end with = itself. 570 * They each append to a buffer taking care about the buffer end, which is 588 * \param end: pointer to end of buffer 599 unsigned char *end); 608 * \param end: pointer to end of buffer 615 unsigned char **p, unsigned char *end); 624 * \param end: pointer to end o [all...] |
/third_party/node/deps/v8/src/wasm/ |
H A D | module-decoder.h | 85 std::is_sorted(names_.begin(), names_.end(), NameAssoc::IndexLess{})); in NameMap() 89 auto it = std::lower_bound(names_.begin(), names_.end(), in GetName() 91 if (it == names_.end()) return {}; in GetName() 128 DCHECK(std::is_sorted(functions_.begin(), functions_.end(), in IndirectNameMap() 133 auto it = std::lower_bound(functions_.begin(), functions_.end(), in GetName() 136 if (it == functions_.end()) return {}; in GetName() 165 const byte* end); 176 const byte* end, ValueType expected); 185 const byte* start, const byte* end);
|
/third_party/node/deps/npm/node_modules/postcss-selector-parser/dist/ |
H A D | tokenize.js | 86 var end = 0; 121 end = next; 135 end = next; 156 end = next + 1; 177 end = next + 1; 204 end = next + 1; 211 end = next + 1; 228 end // [6] End position 236 start = end;
|
/third_party/icu/icu4c/source/tools/gennorm2/ |
H A D | norms.cpp | 157 UChar32 start = 0, end; in enumRanges() local 159 while ((end = umutablecptrie_getRange(normTrie, start, UCPMAP_RANGE_NORMAL, 0, in enumRanges() 162 e.rangeHandler(start, end, norms[i]); in enumRanges() 164 start = end + 1; in enumRanges() 170 void CompositionBuilder::rangeHandler(UChar32 start, UChar32 end, Norm &norm) { in rangeHandler() argument 172 if(start!=end) { in rangeHandler() 176 (long)start, (long)end); in rangeHandler() 230 void Decomposer::rangeHandler(UChar32 start, UChar32 end, Norm &norm) { in rangeHandler() argument 241 if(start<=c && c<=end) { in rangeHandler()
|
/third_party/node/deps/v8/src/compiler/ |
H A D | control-equivalence.cc | 41 // Potentially introduce artificial dependency from start to end. in VisitMid() 44 VisitBackedge(node, graph_->end(), kInputDirection); in VisitMid() 72 parent_blist.splice(parent_blist.end(), blist); in VisitPost() 98 if (entry.input != node->input_edges().end()) { in RunUndirectedDFS() 119 if (entry.use != node->use_edges().end()) { in RunUndirectedDFS() 128 if (entry.use != node->use_edges().end()) { in RunUndirectedDFS() 149 if (entry.input != node->input_edges().end()) { in RunUndirectedDFS() 158 DCHECK(entry.input == node->input_edges().end()); in RunUndirectedDFS() 159 DCHECK(entry.use == node->use_edges().end()); in RunUndirectedDFS() 210 for (BracketList::iterator i = blist.begin(); i != blist.end(); /*no in BracketListDelete() [all...] |
/third_party/node/deps/v8/src/base/ |
H A D | vector.h | 80 // Returns a pointer past the end of the data in the vector. 81 constexpr T* end() const { return start_ + length_; } in end() function in v8::base::Vector 131 return std::equal(begin(), end(), other.begin(), other.end()); in operator ==() 187 constexpr T* end() const { return start() + size(); } in end() function in v8::base::OwnedVector 221 // {Iterator} is the common type of {std::begin} and {std::end} called on a 225 decltype(std::end(std::declval<const U&>()))>::type> 228 Iterator end = std::end(collection); in Of() local 231 OwnedVector<non_const_t>::NewForOverwrite(std::distance(begin, end)); in Of() [all...] |
/third_party/node/deps/v8/src/torque/ |
H A D | cfg.cc | 105 DCHECK_LE(range.end(), current_stack_.AboveTop()); in DeleteRange() 132 DCHECK_LE(destination.end(), origin.begin()); in Poke() 133 DCHECK_EQ(origin.end(), CurrentStack().AboveTop()); in Poke() 185 if (cfg_.end() && *cfg_.end() == block) continue; in OptimizeCfg() 193 if (cfg_.end() && *cfg_.end() == destination) break; in OptimizeCfg() 199 block->instructions().insert(block->instructions().end(), in OptimizeCfg() 201 destination->instructions().end()); in OptimizeCfg()
|
/third_party/mesa3d/src/gallium/drivers/r600/sb/ |
H A D | sb_ra_checker.cpp | 61 for (error_map::iterator I = sh.errors.begin(), E = sh.errors.end(); in dump_all_errors() 101 if (F == rmap().end()) { in check_value_gpr() 120 for (vvec::iterator I = vv.begin(), E = vv.end(); I != E; ++I) { in check_src_vec() 147 for (vvec::iterator I = n->dst.begin(), E = n->dst.end(); I != E; ++I) { in process_op_dst() 180 for (node_iterator I = p->begin(), E = p->end(); I != E; ++I) { in check_phi_src() 189 for (node_iterator I = p->begin(), E = p->end(); I != E; ++I) { in process_phi_dst() 197 for (node_iterator I = g->begin(), E = g->end(); I != E; ++I) { in check_alu_group() 211 for (node_iterator I = g->begin(), E = g->end(); I != E; ++I) { in check_alu_group() 239 for (node_iterator I = c->begin(), E = c->end(); I != E; ++I) { in run_on()
|
/third_party/node/deps/openssl/openssl/providers/fips/ |
H A D | self_test.c | 276 goto end; in SELF_TEST_post() 281 goto end; in SELF_TEST_post() 287 goto end; in SELF_TEST_post() 297 goto end; in SELF_TEST_post() 308 goto end; in SELF_TEST_post() 314 goto end; in SELF_TEST_post() 326 goto end; in SELF_TEST_post() 340 goto end; in SELF_TEST_post() 344 end: in SELF_TEST_post()
|
/third_party/vk-gl-cts/executor/ |
H A D | xeBatchExecutor.cpp | 63 ConstTestNodeIterator end = ConstTestNodeIterator::end(root); in computeExecuteSet() local 65 for (; iter != end; ++iter) in computeExecuteSet() 82 ConstTestNodeIterator end = ConstTestNodeIterator::end(root); in computeBatchRequest() local 85 for (; (iter != end) && (numCases < maxCasesInSet); ++iter) in computeBatchRequest() 102 ConstTestNodeIterator end = ConstTestNodeIterator::end(root); in removeExecuted() local 105 for (; iter != end; ++iter) in removeExecuted() 244 // Feed end o in onStateChanged() [all...] |
/third_party/openssl/providers/fips/ |
H A D | self_test.c | 291 goto end; in SELF_TEST_post() 296 goto end; in SELF_TEST_post() 302 goto end; in SELF_TEST_post() 312 goto end; in SELF_TEST_post() 323 goto end; in SELF_TEST_post() 329 goto end; in SELF_TEST_post() 341 goto end; in SELF_TEST_post() 355 goto end; in SELF_TEST_post() 359 end: in SELF_TEST_post()
|
/third_party/skia/third_party/externals/spirv-tools/source/opt/ |
H A D | dead_insert_elim_pass.cpp | 154 std::sort(ids.begin(), ids.end()); in MarkInsertChain() 155 auto new_end = std::unique(ids.begin(), ids.end()); in MarkInsertChain() 179 for (auto bi = func->begin(); bi != func->end(); ++bi) { in EliminateDeadInsertsOnePass() 180 for (auto ii = bi->begin(); ii != bi->end(); ++ii) { in EliminateDeadInsertsOnePass() 227 for (auto bi = func->begin(); bi != func->end(); ++bi) { in EliminateDeadInsertsOnePass() 228 for (auto ii = bi->begin(); ii != bi->end(); ++ii) { in EliminateDeadInsertsOnePass() 231 if (liveInserts_.find(id) != liveInserts_.end()) continue; in EliminateDeadInsertsOnePass() 244 auto i = std::find(dead_instructions.begin(), dead_instructions.end(), in EliminateDeadInsertsOnePass() 246 if (i != dead_instructions.end()) { in EliminateDeadInsertsOnePass()
|
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
H A D | dead_insert_elim_pass.cpp | 154 std::sort(ids.begin(), ids.end()); in MarkInsertChain() 155 auto new_end = std::unique(ids.begin(), ids.end()); in MarkInsertChain() 179 for (auto bi = func->begin(); bi != func->end(); ++bi) { in EliminateDeadInsertsOnePass() 180 for (auto ii = bi->begin(); ii != bi->end(); ++ii) { in EliminateDeadInsertsOnePass() 227 for (auto bi = func->begin(); bi != func->end(); ++bi) { in EliminateDeadInsertsOnePass() 228 for (auto ii = bi->begin(); ii != bi->end(); ++ii) { in EliminateDeadInsertsOnePass() 231 if (liveInserts_.find(id) != liveInserts_.end()) continue; in EliminateDeadInsertsOnePass() 244 auto i = std::find(dead_instructions.begin(), dead_instructions.end(), in EliminateDeadInsertsOnePass() 246 if (i != dead_instructions.end()) { in EliminateDeadInsertsOnePass()
|
/third_party/skia/third_party/externals/libwebp/imageio/ |
H A D | pngdec.c | 79 char* end; in HexStringToBytes() local 85 *dst++ = (uint8_t)strtol(val, &end, 16); in HexStringToBytes() 86 if (end != val + 2) break; in HexStringToBytes() 100 char* end; in ProcessRawProfile() local 115 expected_length = (int)strtol(src, &end, 10); in ProcessRawProfile() 116 if (*end != '\n') { in ProcessRawProfile() 118 *end); in ProcessRawProfile() 121 ++end; in ProcessRawProfile() 123 // 'end' now points to the profile payload. in ProcessRawProfile() 124 payload->bytes = HexStringToBytes(end, expected_lengt in ProcessRawProfile() [all...] |
/third_party/skia/third_party/externals/icu/source/tools/gennorm2/ |
H A D | norms.cpp | 157 UChar32 start = 0, end; in enumRanges() local 159 while ((end = umutablecptrie_getRange(normTrie, start, UCPMAP_RANGE_NORMAL, 0, in enumRanges() 162 e.rangeHandler(start, end, norms[i]); in enumRanges() 164 start = end + 1; in enumRanges() 170 void CompositionBuilder::rangeHandler(UChar32 start, UChar32 end, Norm &norm) { in rangeHandler() argument 172 if(start!=end) { in rangeHandler() 176 (long)start, (long)end); in rangeHandler() 230 void Decomposer::rangeHandler(UChar32 start, UChar32 end, Norm &norm) { in rangeHandler() argument 241 if(start<=c && c<=end) { in rangeHandler()
|
/third_party/spirv-headers/tools/buildHeaders/ |
H A D | jsonToSpirv.h | 45 // Please add new operand classes at the end. 160 // Constructs an EValue in place as a new element at the end of the 170 auto where = std::find_if(begin(), end(), [&value](const EValue& e) { in operator []() 173 assert((where != end()) && "Could not find enum in the enum list"); in operator []() 178 std::for_each(begin(), end(), [&](EValue& e) { in gatherAliases() 185 auto where = std::find_if(begin(), end(), [&name](const EValue& e) { in at() 188 assert((where != end()) && "Could not find name in the enum list"); in at() 193 iterator end() { return values.end(); } in end() function in spv::EnumValuesContainer 261 iterator end() { retur in begin() function in spv::EnumDefinition [all...] |
/third_party/toybox/toys/pending/ |
H A D | tftpd.c | 89 static char *next_token(char *at, char *end) in next_token() argument 93 for (; at < end; at++) { in next_token() 99 return (at < end) ? at : NULL; in next_token() 242 } // end of loop in do_action() 258 char *end; in tftpd_main() local 267 end = toybuf + recvmsg_len; in tftpd_main() 295 buf = next_token(buf, end); in tftpd_main() 303 for (buf = next_token(buf, end); buf != NULL; buf = next_token(buf, end)) { in tftpd_main() 305 buf = next_token(buf, end); in tftpd_main() [all...] |
/third_party/rust/crates/serde/serde/src/ser/ |
H A D | mod.rs | 146 /// The message should not be capitalized and should not end with a 243 /// s.end() 723 /// seq.end() 940 /// `end`. 980 /// seq.end() 989 /// then a call to `end`. 1016 /// tup.end() 1036 /// seq.end() 1044 /// call to `end`. 1063 /// ts.end() 1501 fn end(self) -> Result<Self::Ok, Self::Error>; end() functions 1601 fn end(self) -> Result<Self::Ok, Self::Error>; end() functions 1646 fn end(self) -> Result<Self::Ok, Self::Error>; end() functions 1704 fn end(self) -> Result<Self::Ok, Self::Error>; end() functions 1815 fn end(self) -> Result<Self::Ok, Self::Error>; end() functions 1875 fn end(self) -> Result<Self::Ok, Self::Error>; end() functions 1941 fn end(self) -> Result<Self::Ok, Self::Error>; end() functions [all...] |
/third_party/spirv-tools/source/opt/ |
H A D | dead_insert_elim_pass.cpp | 151 std::sort(ids.begin(), ids.end()); in MarkInsertChain() 152 auto new_end = std::unique(ids.begin(), ids.end()); in MarkInsertChain() 176 for (auto bi = func->begin(); bi != func->end(); ++bi) { in EliminateDeadInsertsOnePass() 177 for (auto ii = bi->begin(); ii != bi->end(); ++ii) { in EliminateDeadInsertsOnePass() 225 for (auto bi = func->begin(); bi != func->end(); ++bi) { in EliminateDeadInsertsOnePass() 226 for (auto ii = bi->begin(); ii != bi->end(); ++ii) { in EliminateDeadInsertsOnePass() 229 if (liveInserts_.find(id) != liveInserts_.end()) continue; in EliminateDeadInsertsOnePass() 242 auto i = std::find(dead_instructions.begin(), dead_instructions.end(), in EliminateDeadInsertsOnePass() 244 if (i != dead_instructions.end()) { in EliminateDeadInsertsOnePass()
|
/third_party/vk-gl-cts/framework/delibs/decpp/ |
H A D | deBlockBuffer.cpp | 89 /* Feed back rest of messages to buffer (they are end messages) so other consumers wake up. */ in run() 182 for (vector<Consumer*>::iterator i = consumers.begin(); i != consumers.end(); i++) in runTest() 186 for (vector<Producer*>::iterator i = producers.begin(); i != producers.end(); i++) in runTest() 190 for (vector<Producer*>::iterator i = producers.begin(); i != producers.end(); i++) in runTest() 193 // Write end messages for consumers. in runTest() 200 for (vector<Consumer*>::iterator i = consumers.begin(); i != consumers.end(); i++) in runTest() 217 for (vector<Producer*>::iterator i = producers.begin(); i != producers.end(); i++) in runTest() 219 for (vector<Consumer*>::iterator i = consumers.begin(); i != consumers.end(); i++) in runTest() 323 for (vector<Thread*>::iterator i = threads.begin(); i != threads.end(); i++) in runTest() 333 for (vector<Thread*>::iterator i = threads.begin(); i != threads.end(); in runTest() [all...] |
/kernel/linux/linux-6.6/net/core/ |
H A D | skmsg.c | 15 if (msg->sg.end > msg->sg.start && in sk_msg_try_coalesce_ok() 16 elem_first_coalesce < msg->sg.end) in sk_msg_try_coalesce_ok() 19 if (msg->sg.end < msg->sg.start && in sk_msg_try_coalesce_ok() 21 elem_first_coalesce < msg->sg.end)) in sk_msg_try_coalesce_ok() 52 i = msg->sg.end; in sk_msg_alloc() 66 sge = &msg->sg.data[msg->sg.end]; in sk_msg_alloc() 70 sk_msg_iter_next(msg, end); in sk_msg_alloc() 100 if (i == src->sg.end && off) in sk_msg_clone() 110 if (dst->sg.end) in sk_msg_clone() 111 sgd = sk_msg_elem(dst, dst->sg.end in sk_msg_clone() [all...] |