| /third_party/node/deps/icu-small/source/common/ |
| H A D | udata.cpp | 417 const char *next(UErrorCode *pErrorCode);
509 * Get the next path on the list.
513 * @return Pointer to the next path segment, or nullptr if there are no more.
515 const char *UDataPathIterator::next(UErrorCode *pErrorCode) in next() function in UDataPathIterator
533 nextPath = path; /* start with regular path next tm. */ in next()
536 /* fix up next for next time */ in next()
542 /* segment: until next segment */ in next()
766 while ((UDataMemory_isLoaded(&tData)==false) && (pathBuffer = iter.next(pErrorCode)) != nullptr) in openCommonData()
805 * so we won't need to hunt it down and map it again next tim in openCommonData()
[all...] |
| /third_party/node/deps/icu-small/source/i18n/ |
| H A D | collationruleparser.cpp | 267 char16_t next = (i < rules->length()) ? rules->charAt(i) : 0; in parseRelationStrings() local
268 if(next == 0x7c) { // '|' separates the context prefix from the string. in parseRelationStrings()
272 next = (i < rules->length()) ? rules->charAt(i) : 0; in parseRelationStrings()
274 if(next == 0x2f) { // '/' separates the string from the extension. in parseRelationStrings()
386 // Quote literal text until the next single apostrophe. in parseString()
|
| /third_party/mesa3d/src/intel/vulkan/ |
| H A D | genX_state.c | 11 * The above copyright notice and this permission notice (including the next
238 .next = cmds, in init_render_queue_state()
419 assert(batch.next <= batch.end); in init_render_queue_state()
430 batch.start = batch.next = cmds; in init_compute_queue_state()
448 assert(batch.next <= batch.end); in init_compute_queue_state()
|
| /third_party/mesa3d/src/nouveau/codegen/ |
| H A D | nv50_ir_print.cpp | 829 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) in visit()
840 for (DLList::Iterator df = bb->getDF().iterator(); !df.end(); df.next()) in visit()
845 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) in visit()
885 for (ArrayList::Iterator it = allLValues.iterator(); !it.end(); it.next()) { in printLiveIntervals()
|
| /third_party/lzma/C/ |
| H A D | Lzma2DecMt.c | 382 cc->srcSize--; // we don't need control byte of next block
in Lzma2DecMt_MtCallback_Parse()
712 SizeT next = dec->decoder.dicBufSize;
in Lzma2Dec_Decode_ST() local
713 if (next - wrPos > p->props.outStep_ST)
in Lzma2Dec_Decode_ST()
714 next = wrPos + (SizeT)p->props.outStep_ST;
in Lzma2Dec_Decode_ST()
715 size = next - dicPos;
in Lzma2Dec_Decode_ST()
|
| /third_party/node/deps/v8/src/builtins/ |
| H A D | builtins-typed-array-gen.cc | 384 Label next(this), if_unknown_type(this, Label::kDeferred); in DispatchTypedArrayByElementsKind()
412 Goto(&next); \ in DispatchTypedArrayByElementsKind()
422 Goto(&next); \ in DispatchTypedArrayByElementsKind()
430 BIND(&next); in DispatchTypedArrayByElementsKind()
|
| /third_party/node/deps/v8/src/execution/ |
| H A D | execution.cc | 602 Address next; member
605 STATIC_ASSERT(offsetof(StackHandlerMarker, next) ==
631 stack_handler.next = isolate->thread_local_top()->handler_; in CallWasm()
659 isolate->thread_local_top()->handler_ = stack_handler.next; in CallWasm()
|
| /third_party/mesa3d/src/gallium/auxiliary/driver_rbug/ |
| H A D | rbug_core.c | 15 * next paragraph) shall be included in all copies or substantial portions
286 struct rbug_context *rb_context, *next; in rbug_context_list() local
292 LIST_FOR_EACH_ENTRY_SAFE(rb_context, next, &rb_screen->contexts, list) { in rbug_context_list()
503 struct rbug_shader *tr_shdr, *next; in rbug_shader_list() local
517 LIST_FOR_EACH_ENTRY_SAFE(tr_shdr, next, &rb_context->shaders, list) { in rbug_shader_list()
|
| /third_party/python/Lib/test/ |
| H A D | mapping_tests.py | 85 key, value = next(iter(d.items()))
86 knownkey, knownvalue = next(iter(self.other.items()))
111 key, value = next(iter(d.items()))
112 knownkey, knownvalue = next(iter(self.other.items()))
|
| /third_party/python/Lib/multiprocessing/ |
| H A D | pool.py | 750 self._job = next(job_counter)
842 self._job = next(job_counter)
853 def next(self, timeout=None): member in IMapIterator
875 __next__ = next # XXX
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| H A D | MachineOutliner.cpp | 149 /// keep track of which node the next insert should be at. This makes each
154 /// next insertion must be at the node representing S - its first character.
159 /// move to the next insertion point in O(1) time. If we don't, then we'd
252 /// Helper struct which keeps track of the next insertion point in
255 /// The next node to insert at.
265 /// The point the next insertion will take place at in the
373 // If not, then we can just insert a leaf and move too the next step. in extend()
392 // If yes, then consume the characters we've seen and move to the next in extend()
401 // next node we want to move to. in extend()
404 // Is the string we're trying to insert a substring of the next nod in extend()
[all...] |
| /third_party/skia/src/core/ |
| H A D | SkScan_Path.cpp | 56 SkEdge* next = newEdge->fNext; in insert_new_edges() local
71 newEdge = next; in insert_new_edges()
139 SkEdge* next = currE->fNext; in walk_edges() local
168 currE = next; in walk_edges()
|
| /third_party/skia/third_party/externals/libpng/contrib/libtests/ |
| H A D | pngunknown.c | 446 * exit now - there is only one test, otherwise longjmp to do the next test. in PNG_FUNCTION()
1214 const char **next = test; in main() local
1219 while (*next) ++next, ++arg_count; in main()
1234 test = next+1; in main()
|
| /third_party/skia/third_party/externals/icu/source/i18n/ |
| H A D | collationruleparser.cpp | 265 UChar next = (i < rules->length()) ? rules->charAt(i) : 0; in parseRelationStrings() local
266 if(next == 0x7c) { // '|' separates the context prefix from the string. in parseRelationStrings()
270 next = (i < rules->length()) ? rules->charAt(i) : 0; in parseRelationStrings()
272 if(next == 0x2f) { // '/' separates the string from the extension. in parseRelationStrings()
384 // Quote literal text until the next single apostrophe. in parseString()
|
| /third_party/skia/third_party/externals/freetype/src/base/ |
| H A D | ftoutln.c | 865 FT_Vector* next;
870 next = ( xmin_point == last ) ? first : xmin_point + 1;
873 FT_Atan2( next->x - xmin_point->x, next->y - xmin_point->y ) )
|
| /third_party/skia/third_party/externals/icu/source/common/ |
| H A D | udata.cpp | 417 const char *next(UErrorCode *pErrorCode);
509 * Get the next path on the list.
513 * @return Pointer to the next path segment, or NULL if there are no more.
515 const char *UDataPathIterator::next(UErrorCode *pErrorCode) in next() function in UDataPathIterator
533 nextPath = path; /* start with regular path next tm. */ in next()
536 /* fix up next for next time */ in next()
542 /* segment: until next segment */ in next()
766 while ((UDataMemory_isLoaded(&tData)==FALSE) && (pathBuffer = iter.next(pErrorCode)) != NULL) in openCommonData()
805 * so we won't need to hunt it down and map it again next tim in openCommonData()
[all...] |
| /third_party/pulseaudio/speex/libspeexdsp/ |
| H A D | jitter.c | 137 spx_uint32_t pointer_timestamp; /**< Timestamp of what we will *get* next */
138 spx_uint32_t last_returned_timestamp; /**< Useful for getting the next packet with the same timestamp (for fragmented media) */
139 spx_uint32_t next_stop; /**< Estimated time the next get() will be called */
212 int next=-1; in compute_opt_delay() local
219 next = j; in compute_opt_delay()
223 if (next != -1) in compute_opt_delay()
231 pos[next]++; in compute_opt_delay()
245 /* For the next timing we will consider, there will be one more late packet to count */ in compute_opt_delay()
377 /* Make sure we don't discard a "just-late" packet in case we want to play it next (if we interpolate). */ in jitter_buffer_put()
|
| /third_party/wpa_supplicant/wpa_supplicant-2.9/src/p2p/ |
| H A D | p2p.h | 252 struct p2ps_advertisement *next; member
1261 * p2p_stop_find_for_freq - Stop P2P Find for next oper on specific freq
1263 * @freq: Frequency in MHz for next operation
1964 * @next: Whether to select the peer entry following the one indicated by addr
1968 const u8 *addr, int next);
2141 * @next: iteration pointer, must be a pointer to a void * that is set to %NULL
2145 const u8 * p2p_iterate_group_members(struct p2p_group *group, void **next);
2198 * @next: Whether to select the peer entry following the one indicated by addr
2202 p2p_get_peer_found(struct p2p_data *p2p, const u8 *addr, int next);
|
| /third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/p2p/ |
| H A D | p2p.h | 254 struct p2ps_advertisement *next; member
1288 * p2p_stop_find_for_freq - Stop P2P Find for next oper on specific freq
1290 * @freq: Frequency in MHz for next operation
1648 * @delay: Search delay for next scan in ms
1992 * @next: Whether to select the peer entry following the one indicated by addr
1996 const u8 *addr, int next);
2171 * @next: iteration pointer, must be a pointer to a void * that is set to %NULL
2175 const u8 * p2p_iterate_group_members(struct p2p_group *group, void **next);
2228 * @next: Whether to select the peer entry following the one indicated by addr
2232 p2p_get_peer_found(struct p2p_data *p2p, const u8 *addr, int next);
[all...] |
| /third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/tls/ |
| H A D | tlsv1_cred.c | 59 while (p && p->next) in tlsv1_add_cert_der()
60 p = p->next; in tlsv1_add_cert_der()
66 p->next = cert; in tlsv1_add_cert_der()
69 cert->next = *chain; in tlsv1_add_cert_der()
|
| /device/soc/hisilicon/hi3861v100/sdk_liteos/third_party/lwip_sack/include/lwip/ |
| H A D | netif.h | 228 next header offsets are on the same pbuf.
413 /** Indicates a pointer to next in linked list. */
414 struct netif *next; member
644 #define NETIF_FOREACH(netif) for ((netif) = netif_list; (netif) != NULL; (netif) = (netif)->next)
1102 struct netif_ext_callback *next; member
|
| /drivers/peripheral/usb/ddk/device/src/ |
| H A D | usbfn_dev_mgr.c | 103 if (g_devEntry.next != 0 && !DListIsEmpty(&g_devEntry)) { in FindEmptyId()
225 if (g_devEntry.next == 0) { in UsbFnMgrDeviceCreate()
313 if (g_devEntry.next == 0 || DListIsEmpty(&g_devEntry)) { in UsbFnMgrDeviceGet()
|
| /foundation/arkui/ace_engine/frameworks/core/components/text_overlay/ |
| H A D | text_overlay_manager.cpp | 187 // Return the start of next line.
235 const int32_t next = extent + graphemeClusterLength; local
238 extent, next, txt::Paragraph::RectHeightStyle::kMax, txt::Paragraph::RectWidthStyle::kTight);
241 extent, next, Rosen::TextRectHeightStyle::COVER_TOP_AND_BOTTOM, Rosen::TextRectWidthStyle::TIGHT);
|
| /foundation/resourceschedule/soc_perf/services/core/src/ |
| H A D | socperf_thread_wrap.cpp | 111 queueHead = queueHead->next; in DoFreqActionPack()
307 head = head->next; in PostDelayTask()
311 head = head->next; in PostDelayTask()
|
| /foundation/window/window_manager/window_scene/test/dms_unittest/ |
| H A D | screen_scene_config_test.cpp | 177 for (xmlNodePtr curNodePtr = rootPtr->xmlChildrenNode; curNodePtr != nullptr; curNodePtr = curNodePtr->next) { in HWTEST_F()
219 for (xmlNodePtr curNodePtr = rootPtr->xmlChildrenNode; curNodePtr != nullptr; curNodePtr = curNodePtr->next) { in HWTEST_F()
266 for (xmlNodePtr curNodePtr = rootPtr->xmlChildrenNode; curNodePtr != nullptr; curNodePtr = curNodePtr->next) { in HWTEST_F()
|