Home
last modified time | relevance | path

Searched refs:next (Results 3276 - 3300 of 12535) sorted by relevance

1...<<131132133134135136137138139140>>...502

/third_party/backends/backend/
H A Dnet.c166 for (nd = first_device; nd; nd = nd->next) in add_device()
238 nd->next = first_device; in add_device()
259 for (nd = first_device; nd; nd = nd->next) in add_device()
305 nd->next = first_device; in add_device()
1066 char *copy, *next, *host; local
1069 next = copy;
1070 while ((host = strsep (&next, ":")))
1079 strsep (&next, "]");
1085 if (next[0] == ':')
1086 next
[all...]
H A Depsonds-cmd.c68 char *next = start; in esci2_parse_block() local
70 while (*next != '#' && *next != 0x00 && next < end) in esci2_parse_block()
71 next++; in esci2_parse_block()
73 tlen = next - start - 1; in esci2_parse_block()
82 start = next; in esci2_parse_block()
H A Dplustek-usbcalfile.c205 char *p, *next, *rb; in usb_ReadSamples() local
247 val = strtoul( p, &next, 10 ); in usb_ReadSamples()
251 if( p == next ) { in usb_ReadSamples()
263 if( *next == ',') { in usb_ReadSamples()
264 p = next+1; in usb_ReadSamples()
267 p = next; in usb_ReadSamples()
270 if( *next == '\0' ) { in usb_ReadSamples()
274 * parse it the next time... in usb_ReadSamples()
/third_party/googletest/googlemock/scripts/generator/cpp/
H A Dast.py54 if not hasattr(builtins, 'next'):
56 def next(obj): function
57 return obj.next()
720 # Get the next token.
723 # Dispatch on the next token type.
753 # Pop the next token and only put it back if it's not
756 next = self._GetNextToken()
757 if next.name != 'class':
758 self._AddBackToken(next)
765 # Peek ahead to get the next toke
[all...]
/third_party/node/deps/v8/src/regexp/
H A Dregexp-parser.cc230 bool TryParseCharacterClassEscape(base::uc32 next,
743 base::uc32 next = Next(); in ParseDisjunction() local
749 next, InClassEscapeState::kNotInClass, ranges, zone(), in ParseDisjunction()
759 builder->AddCharacter(next); // IdentityEscape. in ParseDisjunction()
1075 // Due to special Advance requirements (see the next comment), rewind by one in ParseCaptureGroupName()
1138 // This final advance goes back into the state of pointing at the next in ParseCaptureGroupName()
1303 int next = current() - '0'; in ParseIntervalQuantifier() local
1304 if (min > (RegExpTree::kInfinity - next) / 10) { in ParseIntervalQuantifier()
1312 min = 10 * min + next; in ParseIntervalQuantifier()
1326 int next in ParseIntervalQuantifier() local
1893 const base::uc32 next = Next(); ParseClassEscape() local
1925 TryParseCharacterClassEscape( base::uc32 next, InClassEscapeState in_class_escape_state, ZoneList<CharacterRange>* ranges, Zone* zone, bool add_unicode_case_equivalents) TryParseCharacterClassEscape() argument
1930 DCHECK_EQ(Next(), next); TryParseCharacterClassEscape() local
[all...]
/kernel/linux/linux-5.10/arch/x86/mm/
H A Dinit.c647 max_pfn_mapped = 0; /* will get exact value next */ in memory_map_top_down()
690 unsigned long next, start; in memory_map_bottom_up() local
706 next = round_up(start + 1, step_size); in memory_map_bottom_up()
707 if (next > map_end) in memory_map_bottom_up()
708 next = map_end; in memory_map_bottom_up()
710 next = map_end; in memory_map_bottom_up()
713 mapped_ram_size += init_range_memory_mapping(start, next); in memory_map_bottom_up()
714 start = next; in memory_map_bottom_up()
/kernel/linux/linux-5.10/drivers/media/common/saa7146/
H A Dsaa7146_fops.c116 struct saa7146_buf *buf,*next = NULL; in saa7146_buffer_next() local
124 /* activate next one from queue */ in saa7146_buffer_next()
125 buf = list_entry(q->queue.next,struct saa7146_buf,vb.queue); in saa7146_buffer_next()
128 next = list_entry(q->queue.next,struct saa7146_buf, vb.queue); in saa7146_buffer_next()
130 DEB_INT("next buffer: buf:%p, prev:%p, next:%p\n", in saa7146_buffer_next()
131 buf, q->queue.prev, q->queue.next); in saa7146_buffer_next()
132 buf->activate(dev,buf,next); in saa7146_buffer_next()
134 DEB_INT("no next buffe in saa7146_buffer_next()
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/
H A Dec_bhf.c76 __le32 next; member
379 u32 next; in ec_bhf_setup_rx_descs() local
382 next = (u8 *)(desc + 1) - priv->rx_buf.buf; in ec_bhf_setup_rx_descs()
384 next = 0; in ec_bhf_setup_rx_descs()
385 next |= RXHDR_NEXT_VALID; in ec_bhf_setup_rx_descs()
386 desc->header.next = cpu_to_le32(next); in ec_bhf_setup_rx_descs()
/kernel/linux/linux-5.10/net/sched/
H A Dsch_hhf.c184 struct hh_flow_state *flow, *next; in seek_list() local
190 list_for_each_entry_safe(flow, next, head, flowchain) { in seek_list()
195 * to avoid kzalloc() when next time this slot is hit. in seek_list()
333 bucket->head = skb->next; in dequeue_head()
344 bucket->tail->next = skb; in bucket_add()
346 skb->next = NULL; in bucket_add()
485 struct hh_flow_state *flow, *next; in hhf_destroy() local
490 list_for_each_entry_safe(flow, next, head, flowchain) { in hhf_destroy()
/kernel/linux/linux-5.10/sound/pci/emu10k1/
H A Dmemory.c91 * if an empty region is found, return the page and store the next mapped block
137 struct list_head *next; in map_memblk() local
139 page = search_empty_map_area(emu, blk->pages, &next); in map_memblk()
147 list_add_tail(&blk->mapped_link, next); in map_memblk()
177 if ((p = blk->mapped_link.next) != &emu->mapped_link_head) { in unmap_memblk()
273 p = emu->mapped_order_link_head.next; in snd_emu10k1_memblk_map()
275 nextp = p->next; in snd_emu10k1_memblk_map()
463 if ((p = blk->mem.list.next) != &hdr->block) { in get_single_page_range()
/kernel/linux/linux-5.10/scripts/kconfig/
H A Dmconf.c326 tmp = pos->next; in set_subtitle()
334 pos->next = xcalloc(1, sizeof(*pos)); in set_subtitle()
335 pos = pos->next; in set_subtitle()
351 tmp = pos->next; in reset_subtitle()
534 for (child = menu->list; child; child = child->next) { in build_conf()
639 for (child = menu->list; child; child = child->next) in build_conf()
809 for (child = menu->list; child; child = child->next) { in conf_choice()
/kernel/linux/linux-5.10/drivers/xen/xenbus/
H A Dxenbus_client.c57 struct list_head next; member
650 list_add(&node->next, &xenbus_valloc_pages); in xenbus_map_ring_hvm()
725 list_add(&node->next, &xenbus_valloc_pages); in xenbus_map_ring_pv()
752 list_for_each_entry(node, &xenbus_valloc_pages, next) { in xenbus_unmap_ring_pv()
754 list_del(&node->next); in xenbus_unmap_ring_pv()
840 list_for_each_entry(node, &xenbus_valloc_pages, next) { in xenbus_unmap_ring_hvm()
843 list_del(&node->next); in xenbus_unmap_ring_hvm()
/kernel/linux/linux-5.10/init/
H A Dinitramfs.c55 struct hash *next; member
70 for (p = head + hash(major, minor, ino); *p; p = &(*p)->next) { in find_link()
89 q->next = NULL; in find_link()
100 *p = q->next; in free_hash()
209 static void __init read_into(char *buf, unsigned size, enum state next) in read_into() argument
214 state = next; in read_into()
218 next_state = next; in read_into()
447 static unsigned long my_inptr; /* index of next byte to be processed in inbuf */
/kernel/linux/linux-6.6/drivers/net/ethernet/
H A Dec_bhf.c76 __le32 next; member
379 u32 next; in ec_bhf_setup_rx_descs() local
382 next = (u8 *)(desc + 1) - priv->rx_buf.buf; in ec_bhf_setup_rx_descs()
384 next = 0; in ec_bhf_setup_rx_descs()
385 next |= RXHDR_NEXT_VALID; in ec_bhf_setup_rx_descs()
386 desc->header.next = cpu_to_le32(next); in ec_bhf_setup_rx_descs()
/kernel/linux/linux-6.6/drivers/xen/xenbus/
H A Dxenbus_client.c57 struct list_head next; member
693 list_add(&node->next, &xenbus_valloc_pages); in xenbus_map_ring_hvm()
768 list_add(&node->next, &xenbus_valloc_pages); in xenbus_map_ring_pv()
795 list_for_each_entry(node, &xenbus_valloc_pages, next) { in xenbus_unmap_ring_pv()
797 list_del(&node->next); in xenbus_unmap_ring_pv()
882 list_for_each_entry(node, &xenbus_valloc_pages, next) { in xenbus_unmap_ring_hvm()
885 list_del(&node->next); in xenbus_unmap_ring_hvm()
/kernel/linux/linux-6.6/init/
H A Dinitramfs.c73 struct hash *next; member
88 for (p = head + hash(major, minor, ino); *p; p = &(*p)->next) { in find_link()
107 q->next = NULL; in find_link()
118 *p = q->next; in free_hash()
239 static void __init read_into(char *buf, unsigned size, enum state next) in read_into() argument
244 state = next; in read_into()
248 next_state = next; in read_into()
479 static unsigned long my_inptr __initdata; /* index of next byte to be processed in inbuf */
/kernel/linux/linux-6.6/arch/x86/mm/
H A Dinit.c651 max_pfn_mapped = 0; /* will get exact value next */ in memory_map_top_down()
696 unsigned long next, start; in memory_map_bottom_up() local
712 next = round_up(start + 1, step_size); in memory_map_bottom_up()
713 if (next > map_end) in memory_map_bottom_up()
714 next = map_end; in memory_map_bottom_up()
716 next = map_end; in memory_map_bottom_up()
719 mapped_ram_size += init_range_memory_mapping(start, next); in memory_map_bottom_up()
720 start = next; in memory_map_bottom_up()
/kernel/linux/linux-6.6/tools/lib/perf/
H A Devlist.c122 struct perf_evsel *next; in perf_evlist__next() local
125 next = list_first_entry(&evlist->entries, in perf_evlist__next()
129 next = list_next_entry(prev, node); in perf_evlist__next()
133 if (&next->node == &evlist->entries) in perf_evlist__next()
136 return next; in perf_evlist__next()
698 return map->next; in perf_evlist__next_mmap()
718 struct perf_evsel *first = list_entry(evlist->entries.next, in perf_evlist__set_leader()
/kernel/linux/linux-6.6/net/sched/
H A Dsch_hhf.c184 struct hh_flow_state *flow, *next; in seek_list() local
190 list_for_each_entry_safe(flow, next, head, flowchain) { in seek_list()
195 * to avoid kzalloc() when next time this slot is hit. in seek_list()
333 bucket->head = skb->next; in dequeue_head()
344 bucket->tail->next = skb; in bucket_add()
346 skb->next = NULL; in bucket_add()
485 struct hh_flow_state *flow, *next; in hhf_destroy() local
490 list_for_each_entry_safe(flow, next, head, flowchain) { in hhf_destroy()
/kernel/linux/linux-6.6/sound/pci/emu10k1/
H A Dmemory.c91 * if an empty region is found, return the page and store the next mapped block
137 struct list_head *next; in map_memblk() local
139 page = search_empty_map_area(emu, blk->pages, &next); in map_memblk()
147 list_add_tail(&blk->mapped_link, next); in map_memblk()
179 p = blk->mapped_link.next; in unmap_memblk()
278 p = emu->mapped_order_link_head.next; in snd_emu10k1_memblk_map()
280 nextp = p->next; in snd_emu10k1_memblk_map()
467 p = blk->mem.list.next; in get_single_page_range()
/third_party/alsa-lib/src/control/
H A Dsetup.c63 snd_sctl_elem_t *elem = list_entry(h->elems.next, snd_sctl_elem_t, list); in free_elems()
254 snd_config_iterator_t i, next; in snd_config_get_ctl_elem_value() local
347 snd_config_for_each(i, next, conf) { in snd_config_get_ctl_elem_value()
401 snd_config_iterator_t i, next; in add_elem() local
417 snd_config_for_each(i, next, conf) { in add_elem()
606 snd_config_iterator_t i, next; in snd_sctl_build() local
625 snd_config_for_each(i, next, conf) { in snd_sctl_build()
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/locale/
H A DXLikelySubtags.java138 BytesTrie.Result result = trie.next('*'); in XLikelySubtags()
141 result = trie.next('*'); in XLikelySubtags()
144 result = trie.next('*'); in XLikelySubtags()
150 result = trie.next(c); in XLikelySubtags()
483 result = iter.next('*'); in trieNext()
489 if (!iter.next(c).hasNext()) { in trieNext()
494 result = iter.next(c | 0x80); in trieNext()
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DCharsTrie.java196 * Equivalent to reset().next(inUnit).
218 next(UTF16.getTrailSurrogate(cp)) : in firstForCodePoint()
228 public Result next(int inUnit) { in next() method in CharsTrie
259 next(cp) : in nextForCodePoint()
260 (next(UTF16.getLeadSurrogate(cp)).hasNext() ? in nextForCodePoint()
261 next(UTF16.getTrailSurrogate(cp)) : in nextForCodePoint()
272 * result=next(c);
281 public Result next(CharSequence s, int sIndex, int sLimit) { in next() method in CharsTrie
292 // Fetch the next input unit, if there is one. in next()
322 // Fetch the next inpu in next()
548 public Entry next() { next() method in CharsTrie.Iterator
[all...]
/third_party/icu/icu4c/source/test/intltest/
H A Dregiontst.cpp511 const char *crID = containedRegions->next(NULL,status); in TestGetContainedRegions()
542 const char *crID = containedRegions->next(NULL,status); in TestGetContainedRegionsWithType()
630 while ( const char *check = preferredValues->next(NULL,status) ) { in TestGetPreferredValues()
694 uprv_strcat(availableTerritoriesString,availableTerritories->next(NULL,status)); in TestAvailableTerritories()
704 uprv_strcat(containedInWorldString,containedInWorld->next(NULL,status)); in TestAvailableTerritories()
728 const char *emptyStr = containedRegions->next(NULL, status); in TestNoContainedRegions()
758 while ((actualChild = actualChildren->next(NULL, err)) != NULL && *expectedChildStart != '\0') { in TestGroupingChildren()
/third_party/icu/icu4c/source/common/
H A Dfilteredbrk.cpp214 virtual int32_t next(void) override;
216 virtual int32_t next(int32_t n) override;
329 return kExceptionHere; // See if the next is another exception. in breakExceptionAt()
348 // skip the next: in breakExceptionAt()
364 // the workhorse single next.
384 n = fDelegate->next(); // skip this one. Find the next lowerlevel break. in internalNext()
413 n = fDelegate->previous(); // skip this one. Find the next lowerlevel break. in internalPrev()
426 SimpleFilteredSentenceBreakIterator::next() { in next() function in SimpleFilteredSentenceBreakIterator
427 return internalNext(fDelegate->next()); in next()
466 SimpleFilteredSentenceBreakIterator::next(int32_t offset) { next() function in SimpleFilteredSentenceBreakIterator
[all...]

Completed in 33 milliseconds

1...<<131132133134135136137138139140>>...502