/third_party/libwebsockets/lib/roles/h2/ |
H A D | minihuf.c | 315 int next = 1; variable 367 state[walk].state[code_bit(n, m)] = next; in main() 368 walk = next++; in main() 378 for (n = 0; n < next; n++) { in main() 387 for (n = 0; n < next; n++) { in main() 404 for (n = 0; n < next; n++) { in main()
|
/third_party/libwebsockets/lib/roles/http/ |
H A D | minilex.c | 207 int next = 1; variable 305 state[walk].state[state[walk].count] = next; in issue() 307 walk = next++; in issue() 318 for (n = 0; n < next; n++) { in issue() 327 for (n = 0; n < next; n++) { in issue() 351 for (n = 0; n < next; n++) { in issue()
|
/third_party/node/deps/icu-small/source/common/unicode/ |
H A D | stringtriebuilder.h | 301 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode() 306 Node *next; member in StringTrieBuilder::IntermediateValueNode 319 length(len), next(nextNode) {} in LinearMatchNode() 324 Node *next; member in StringTrieBuilder::LinearMatchNode 394 length(len), next(subNode) {} in BranchHeadNode() 400 Node *next; // A branch sub-node. member in StringTrieBuilder::BranchHeadNode
|
/third_party/node/deps/icu-small/source/common/ |
H A D | ucharstrie.cpp | 48 next(U16_TRAIL(cp)) : in firstForCodePoint() 55 next(cp) : in nextForCodePoint() 56 (USTRINGTRIE_HAS_NEXT(next(U16_LEAD(cp))) ? in nextForCodePoint() 57 next(U16_TRAIL(cp)) : in nextForCodePoint() 155 UCharsTrie::next(int32_t uchar) { in next() function in UCharsTrie 178 UCharsTrie::next(ConstChar16Ptr ptr, int32_t sLength) { in next() function in UCharsTrie 190 // Fetch the next input unit, if there is one. in next() 243 // Fetch the next input unit, if there is one. in next()
|
/third_party/nghttp2/tests/ |
H A D | nghttp2_buf_test.c | 63 CU_ASSERT(bufs.cur == bufs.head->next); in test_nghttp2_bufs_add() 120 CU_ASSERT(bufs.cur == bufs.head->next); in test_nghttp2_bufs_addb() 213 CU_ASSERT(chain->next == bufs.cur); in test_nghttp2_bufs_remove() 257 for (ci = bufs.head; ci; ci = ci->next) { in test_nghttp2_bufs_reset() 262 CU_ASSERT(bufs.head->next == NULL); in test_nghttp2_bufs_reset() 308 bufs.cur = bufs.head->next; in test_nghttp2_bufs_next_present()
|
/third_party/libinput/src/ |
H A D | util-prop-parsers.c | 11 * The above copyright notice and this permission notice (including the next 501 char *current, *next; in parse_evdev_abs_prop() local 517 next = index(current, ':'); in parse_evdev_abs_prop() 518 if (next) in parse_evdev_abs_prop() 519 *next = '\0'; in parse_evdev_abs_prop() 527 current = next ? ++next : NULL; in parse_evdev_abs_prop()
|
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/finitestatematcher/compiler/ |
H A D | MatcherCompiler.java | 166 DfaNode next = singleOutput(current); in buildSequencesFrom() 167 if (dfa.inDegree(next) > 1) { in buildSequencesFrom() 170 current = next; in buildSequencesFrom() 221 Operation next = getOp(nodes.get(n)); in createOps() 222 Operation merged = current.mergeWith(next); in createOps() 227 current = next; in createOps()
|
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/ |
H A D | EdgeWriter.java | 99 Optional<AnyPath> next = AnyPathVisitor.extractAnyPath(e); in visitSequence() 100 if (next.isPresent()) { in visitSequence() 101 any = any.join(next.get()); in visitSequence() 190 Optional<AnyPath> next = AnyPathVisitor.extractAnyPath(e); in visitSequence() 191 if (next.isPresent()) { in visitSequence() 192 path = path.join(next.get()); in visitSequence() 242 // Find the lo/hi size of the next contiguous range (inclusive). in appendRegex()
|
/third_party/rust/crates/aho-corasick/src/ |
H A D | automaton.rs | 92 /// An optional prefilter for quickly skipping to the next candidate match. 151 /// Given the current state that this automaton is in and the next input 152 /// byte, this method returns the identifier of the next state. The 157 /// This is not safe so that implementors may look up the next state 165 /// implementation never returns a `fail_id()` for the next state. 167 let next = self.next_state(current, input); in next_state_no_fail() 170 next != fail_id(), in next_state_no_fail() 171 "automaton should never return fail_id for next state" in next_state_no_fail() 173 next in next_state_no_fail() 221 let c = prefilter::next(prestat in standard_find_at_imp() [all...] |
/third_party/skia/third_party/externals/harfbuzz/src/ |
H A D | hb-common.cc | 254 struct hb_language_item_t *next; member 292 hb_language_item_t *next = first_lang->next; in free_langs() local 295 first_lang = next; in free_langs() 305 for (hb_language_item_t *lang = first_lang; lang; lang = lang->next) in lang_find_or_insert() 313 lang->next = first_lang; in lang_find_or_insert()
|
H A D | hb-utf.hh | 40 next (const codepoint_t *text, in next() function 118 if (likely (next (text, end, unicode, replacement) == end)) in prev() 187 next (const codepoint_t *text, in next() function 295 next (const TCodepoint *text, in next() function 353 next (const codepoint_t *text, in next() function 404 next (const codepoint_t *text, in next() function
|
/third_party/skia/tools/flags/ |
H A D | CommandLineFlags.cpp | 173 // Skip the space on the next line in print_indented() 250 for (SkFlagInfo* flag = CommandLineFlags::gHead; flag; flag = flag->next()) { in Parse() 262 for (SkFlagInfo* flag = CommandLineFlags::gHead; flag; flag = flag->next()) { in Parse() 296 // Can be handled by match, above, but can also be set by the next in Parse() 331 flag = flag->next(); in Parse() 350 SkFlagInfo* next = flag->next(); in Parse() local 352 flag = next; in Parse()
|
/third_party/skia/third_party/externals/icu/source/common/ |
H A D | ucharstrie.cpp | 48 next(U16_TRAIL(cp)) : in firstForCodePoint() 55 next(cp) : in nextForCodePoint() 56 (USTRINGTRIE_HAS_NEXT(next(U16_LEAD(cp))) ? in nextForCodePoint() 57 next(U16_TRAIL(cp)) : in nextForCodePoint() 155 UCharsTrie::next(int32_t uchar) { in next() function in UCharsTrie 178 UCharsTrie::next(ConstChar16Ptr ptr, int32_t sLength) { in next() function in UCharsTrie 190 // Fetch the next input unit, if there is one. in next() 243 // Fetch the next input unit, if there is one. in next()
|
/third_party/skia/third_party/externals/icu/source/common/unicode/ |
H A D | stringtriebuilder.h | 301 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode() 306 Node *next; member in StringTrieBuilder::IntermediateValueNode 319 length(len), next(nextNode) {} in LinearMatchNode() 324 Node *next; member in StringTrieBuilder::LinearMatchNode 394 length(len), next(subNode) {} in BranchHeadNode() 400 Node *next; // A branch sub-node. member in StringTrieBuilder::BranchHeadNode
|
/third_party/protobuf/src/google/protobuf/ |
H A D | arena_impl.h | 54 // Align n to next multiple of 8 (from Hacker's Delight, Chapter 3.) in AlignUpTo8() 157 CleanupChunk* next; // Next node in the list. member 228 SerialArena* next() const { return next_; } in next() function in google::protobuf::internal::ArenaImpl::SerialArena 229 void set_next(SerialArena* next) { next_ = next; } in set_next() argument 257 Block(size_t size, Block* next); 264 Block* next() const { return next_; } in next() function in google::protobuf::internal::ArenaImpl::Block
|
/third_party/python/Lib/test/ |
H A D | test_list.py | 135 next(itorig) 144 next(itorig) 152 self.assertRaises(StopIteration, next, itorig) 171 next(itorig) 180 next(itorig) 188 self.assertRaises(StopIteration, next, itorig)
|
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
H A D | hashtablez_sampler.cc | 95 HashtablezInfo* next = s->next; in ~HashtablezSampler() local 97 s = next; in ~HashtablezSampler() 102 sample->next = all_.load(std::memory_order_relaxed); in PushNew() 103 while (!all_.compare_exchange_weak(sample->next, sample, in PushNew() 166 s = s->next; in Iterate() 205 // Small values of interval are equivalent to just sampling next time. in SampleSlow()
|
/third_party/skia/modules/skunicode/include/ |
H A D | SkUnicode.h | 70 virtual Position next() = 0; 176 size_t next = SkToSizeT(ptr - utf8.begin()); in extractUtfConversionMapping() local 177 for (auto i = index; i < next; ++i) { in extractUtfConversionMapping() 182 //SkASSERT(fUTF16IndexForUTF8Index.size() == next); in extractUtfConversionMapping() 183 SkASSERT(size16 == next); in extractUtfConversionMapping() 184 if (size16 != next) { in extractUtfConversionMapping() 268 pos = iter->next(); in forEachBreak()
|
/third_party/vk-gl-cts/framework/common/ |
H A D | tcuApp.cpp | 58 iter.next(); in writeCaselistsToStdout() 64 iter.next(); in writeCaselistsToStdout() 69 iter.next(); in writeCaselistsToStdout() 90 iter.next(); in verifyAmberCapabilityCoherency() 106 iter.next(); in verifyAmberCapabilityCoherency() 111 iter.next(); in verifyAmberCapabilityCoherency()
|
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/common/ |
H A D | ptksa_cache.c | 38 struct ptksa_cache_entry *e, *next; in ptksa_cache_expire() local 46 dl_list_for_each_safe(e, next, &ptksa->ptksa, in ptksa_cache_expire() 109 struct ptksa_cache_entry *e, *next; in ptksa_cache_deinit() local 116 dl_list_for_each_safe(e, next, &ptksa->ptksa, in ptksa_cache_deinit() 230 struct ptksa_cache_entry *e, *next; in ptksa_cache_flush() local 236 dl_list_for_each_safe(e, next, &ptksa->ptksa, struct ptksa_cache_entry, in ptksa_cache_flush()
|
/third_party/icu/icu4c/source/test/intltest/ |
H A D | regcoll.cpp | 62 while (i1->next(status) != CollationElementIterator::NULLORDER) in Test4048446() 66 errln("error calling next()"); in Test4048446() 726 if (i->next(status) != CollationElementIterator::NULLORDER) in Test4101940() 728 errln("next did not return NULLORDER"); in Test4101940() 999 int32_t elt4 = CollationElementIterator::primaryOrder(iter->next(errorCode)); in Test4179216() 1002 int32_t elt0 = CollationElementIterator::primaryOrder(iter->next(errorCode)); in Test4179216() 1005 int32_t elt5 = CollationElementIterator::primaryOrder(iter->next(errorCode)); in Test4179216() 1016 int32_t elt14 = CollationElementIterator::primaryOrder(iter->next(errorCode)); in Test4179216() 1019 int32_t elt15 = CollationElementIterator::primaryOrder(iter->next(errorCode)); in Test4179216() 1022 int32_t elt16 = CollationElementIterator::primaryOrder(iter->next(errorCod in Test4179216() [all...] |
/third_party/lwip/src/apps/mqtt/ |
H A D | mqtt.c | 294 if (r_objs[n].next == &r_objs[n]) { in mqtt_create_request() 296 r->next = NULL; in mqtt_create_request() 322 for (iter = *tail; iter != NULL; iter = iter->next) { in mqtt_append_request() 332 head->next = r; in mqtt_append_request() 345 r->next = r; in mqtt_delete_request() 361 for (iter = *tail; iter != NULL; iter = iter->next) { in mqtt_take_request() 372 *tail = iter->next; in mqtt_take_request() 374 prev->next = iter->next; in mqtt_take_request() 376 /* If exists, add remaining timeout time for the request to next */ in mqtt_take_request() 422 struct mqtt_request_t *iter, *next; mqtt_clear_requests() local [all...] |
/third_party/vulkan-loader/loader/ |
H A D | cJSON.c | 83 cJSON *next; in loader_cJSON_Delete() local 85 next = c->next; in loader_cJSON_Delete() 90 c = next; in loader_cJSON_Delete() 620 child->next = new_item; in parse_array() 642 while (child) numentries++, child = child->next; in print_array() 664 if (child->next) { in print_array() 673 child = child->next; in print_array() 694 child = child->next; in print_array() 767 child->next in parse_object() [all...] |
/third_party/typescript/tests/baselines/reference/ |
H A D | emitter.forAwait(target=es5).js | 57 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
60 step((generator = generator.apply(thisArg, _arguments || [])).next());
65 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
70 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
93 return m ? m.call(o) : (o = typeof __values === "function" ? __values(o) : o[Symbol.iterator](), i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i);
107 case 1: return [4 /*yield*/, y_1.next()];
146 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
149 step((generator = generator.apply(thisArg, _arguments || [])).next());
154 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
159 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) [all...] |
/third_party/f2fs-tools/fsck/ |
H A D | compress.c | 120 struct _ext_t *next; member 130 p = p->next; in ext_found() 157 node->next = extension_list; in ext_filter_add() 167 extension_list = p->next; in ext_filter_destroy()
|