Home
last modified time | relevance | path

Searched refs:next (Results 6201 - 6225 of 12994) sorted by relevance

1...<<241242243244245246247248249250>>...520

/third_party/zlib/
H A Dzlib.h87 z_const Bytef *next_in; /* next input byte */
91 Bytef *next_out; /* next output byte will go here */
263 processing will resume at this point for the next call of deflate().
293 that is three bits plus filler bits to the next byte, followed by four bytes
306 seven bits of the current block are held to be written as the next byte after
307 the next deflate block is completed. In this case, the decompressor may not
309 the data provided so far to the compressor. It may need to wait for the next
414 accordingly, and processing will resume at this point for the next call of
436 stop if and when it gets to the next deflate block boundary. When decoding
719 respectively. The new level and strategy will take effect at the next cal
1839 unsigned char *next; global() member
[all...]
/kernel/linux/linux-6.6/mm/
H A Dslub.c420 * pointer value in the case the current thread loses the race for the next
1510 * returns the start of next block if there's any, or NULL
1809 void *next = *head; in slab_free_freelist_hook() local
1812 if (is_kfence_address(next)) { in slab_free_freelist_hook()
1813 slab_free_hook(s, next, false); in slab_free_freelist_hook()
1822 object = next; in slab_free_freelist_hook()
1823 next = get_freepointer(s, object); in slab_free_freelist_hook()
1928 /* Get the next entry on the pre-computed freelist randomized */
1955 void *next; in shuffle_freelist() local
1974 next in shuffle_freelist()
2001 void *start, *p, *next; allocate_slab() local
6209 struct saved_alias *next; global() member
[all...]
/third_party/mesa3d/src/nouveau/codegen/
H A Dnv50_ir_lowering_nvc0.cpp331 Instruction *next; in visit() local
332 for (Instruction *i = bb->getEntry(); i; i = next) { in visit()
333 next = i->next; in visit()
441 findFirstUsesBB(minGPR, maxGPR, texi->next, texi, uses, visited); in findFirstUses()
462 for (Instruction *insn = start; insn != bb->getExit(); insn = insn->next) { in findFirstUsesBB()
487 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in findFirstUsesBB()
519 for (ArrayList::Iterator i = fn->allBBlocks.iterator(); !i.end(); i.next()) { in insertTextureBarriers()
610 for (bi->reset(); !bi->end(); bi->next()) { in insertTextureBarriers()
615 for (Instruction *i = bb->getFirst(); i; i = i->next) { in insertTextureBarriers()
661 Instruction *next; insertTextureBarriers() local
834 Instruction *i, *next; visit() local
[all...]
/kernel/linux/linux-5.10/drivers/usb/gadget/udc/
H A Domap_udc.c510 * the next DMA transfer for that USB transfer.
645 req = container_of(ep->queue.next, in dma_irq()
652 req = container_of(ep->queue.next, in dma_irq()
664 req = container_of(ep->queue.next, in dma_irq()
671 req = container_of(ep->queue.next, in dma_irq()
788 req = container_of(ep->queue.next, struct omap_req, queue); in dma_channel_claim()
813 req = container_of(ep->queue.next, struct omap_req, queue); in dma_channel_release()
1024 if (use_dma && ep->dma_channel && ep->queue.next == &req->queue) { in omap_ep_dequeue()
1342 req = list_entry(ep->queue.next, struct omap_req, queue); in nuke()
1418 req = container_of(ep0->queue.next, struc in ep0_irq()
[all...]
H A Dgr_udc.c165 struct gr_dma_desc *next; in gr_seq_ep_show() local
170 next = req->first_desc; in gr_seq_ep_show()
172 desc = next; in gr_seq_ep_show()
173 next = desc->next_desc; in gr_seq_ep_show()
257 struct gr_dma_desc *next; in gr_free_dma_desc_chain() local
259 next = req->first_desc; in gr_free_dma_desc_chain()
260 if (!next) in gr_free_dma_desc_chain()
264 desc = next; in gr_free_dma_desc_chain()
265 next = desc->next_desc; in gr_free_dma_desc_chain()
402 * next reques
[all...]
/kernel/linux/linux-5.10/tools/objtool/
H A Dcheck.c52 struct instruction *next = list_next_entry(insn, list); in next_insn_same_sec() local
54 if (!next || &next->list == &file->insn_list || next->sec != insn->sec) in next_insn_same_sec()
57 return next; in next_insn_same_sec()
63 struct instruction *next = list_next_entry(insn, list); in next_insn_same_func() local
69 if (&next->list != &file->insn_list && next->func == func) in next_insn_same_func()
70 return next; in next_insn_same_func()
1652 * First pass: Mark the head of each jump table so that in the next pas
3151 struct instruction *next, *dest; validate_entry() local
[all...]
/kernel/linux/linux-5.10/drivers/nfc/pn533/
H A Dpn533.c519 * next cmd from the queue.
1370 u8 *next, nfcid3[NFC_NFCID3_MAXSIZE]; in pn533_poll_dep() local
1400 next = skb_put(skb, 1); /* Next */ in pn533_poll_dep()
1401 *next = 0; in pn533_poll_dep()
1405 *next |= 1; in pn533_poll_dep()
1409 *next |= 2; in pn533_poll_dep()
1412 *next |= 4; /* We have some Gi */ in pn533_poll_dep()
2000 u8 *next, *arg, nfcid3[NFC_NFCID3_MAXSIZE]; in pn533_dep_link_up() local
2035 next = skb_put(skb, 1); /* Next */ in pn533_dep_link_up()
2036 *next in pn533_dep_link_up()
[all...]
/kernel/linux/linux-6.6/drivers/thunderbolt/
H A Dswitch.c832 * tb_next_port_on_path() - Return next port for given port on a path
849 struct tb_port *next; in tb_next_port_on_path() local
861 next = tb_port_at(tb_route(end->sw), prev->sw); in tb_next_port_on_path()
862 /* Walk down the topology if next == prev */ in tb_next_port_on_path()
864 (next == prev || next->dual_link_port == prev)) in tb_next_port_on_path()
865 next = prev->remote; in tb_next_port_on_path()
868 next = prev->remote; in tb_next_port_on_path()
870 next = tb_upstream_port(prev->sw); in tb_next_port_on_path()
872 * Keep the same link if prev and next ar in tb_next_port_on_path()
[all...]
/kernel/linux/linux-6.6/drivers/usb/gadget/udc/
H A Domap_udc.c513 * the next DMA transfer for that USB transfer.
648 req = container_of(ep->queue.next, in dma_irq()
655 req = container_of(ep->queue.next, in dma_irq()
667 req = container_of(ep->queue.next, in dma_irq()
674 req = container_of(ep->queue.next, in dma_irq()
791 req = container_of(ep->queue.next, struct omap_req, queue); in dma_channel_claim()
816 req = container_of(ep->queue.next, struct omap_req, queue); in dma_channel_release()
1029 if (use_dma && ep->dma_channel && ep->queue.next == &req->queue) { in omap_ep_dequeue()
1347 req = list_entry(ep->queue.next, struct omap_req, queue); in nuke()
1423 req = container_of(ep0->queue.next, struc in ep0_irq()
[all...]
/kernel/linux/linux-6.6/drivers/nfc/pn533/
H A Dpn533.c511 * next cmd from the queue.
1346 u8 *next, nfcid3[NFC_NFCID3_MAXSIZE]; in pn533_poll_dep() local
1374 next = skb_put(skb, 1); /* Next */ in pn533_poll_dep()
1375 *next = 0; in pn533_poll_dep()
1379 *next |= 1; in pn533_poll_dep()
1383 *next |= 2; in pn533_poll_dep()
1386 *next |= 4; /* We have some Gi */ in pn533_poll_dep()
1966 u8 *next, *arg, nfcid3[NFC_NFCID3_MAXSIZE]; in pn533_dep_link_up() local
1999 next = skb_put(skb, 1); /* Next */ in pn533_dep_link_up()
2000 *next in pn533_dep_link_up()
[all...]
/kernel/linux/linux-6.6/net/sched/
H A Dsch_taprio.c312 /* Returns the entry corresponding to next available interval. If
373 * first available interval in the next cycle. in find_entry_to_transmit()
472 * successfully. So, schedule the packet in the next open window.
531 /* Update the txtime of current entry to the next time it's in get_packet_txtime()
901 * the next schedule base_time. in should_change_schedules()
908 * next schedule base_time, we can extend the current schedule in should_change_schedules()
930 struct sched_entry *entry, *next; in advance_sched() local
953 next = list_first_entry(&oper->entries, struct sched_entry, in advance_sched()
955 end_time = next->end_time; in advance_sched()
960 next in advance_sched()
[all...]
/third_party/backends/backend/
H A Dapple.c483 for (dev = first_dev; dev; dev = dev->next) in attach()
609 dev->next = first_dev; in attach()
1914 Apple_Device *dev, *next; in sane_exit() local
1916 for (dev = first_dev; dev; dev = next) in sane_exit()
1918 next = dev->next; in sane_exit()
1943 for (dev = first_dev; i < num_devices; dev = dev->next) in sane_get_devices()
1961 for (dev = first_dev; dev; dev = dev->next) in sane_open()
1992 s->next = first_handle; in sane_open()
2006 for (s = first_handle; s; s = s->next) in sane_close()
[all...]
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/lang/
H A DUnicodeSetTest.java154 for (UnicodeSetIterator it = new UnicodeSetIterator(testSet); it.next();) { in TestPropertyAccess()
398 * the backslash to generically escape the next character. */ in unescapeAt()
689 if (!iset.next() || iset.codepoint != UnicodeSetIterator.IS_STRING) { in TestAPI()
690 errln("FAIL: UnicodeSetIterator.next/IS_STRING"); in TestAPI()
792 log(myiter.next().toString() + " "); in TestAPI()
1549 for (UnicodeSetIterator it = new UnicodeSetIterator(set1); it.next();) { in TestGenerics()
2283 while (it.next()) { in copyWithIterator()
2487 assertFalse("", it.next()); in TestIteration()
2864 assertTrue("set iterator.next()", sit.next()); in TestEmptyString()
[all...]
/third_party/pcre2/pcre2/src/
H A Dpcre2_dfa_match.c325 struct RWS_anchor *next; member
400 workspace block. If there's an existing next block, use it; otherwise get a new
418 if (rws->next != NULL) in more_workspace()
420 new = rws->next; in more_workspace()
441 new->next = NULL; in more_workspace()
443 rws->next = new; in more_workspace()
857 on with the next opcode. For repeating opcodes, also add the repeat in internal_dfa_match()
987 /* These opcodes inspect the next subject character, and sometimes in internal_dfa_match()
1161 /* Check the next character by Unicode property. We will get here only in internal_dfa_match()
2948 /* For each successful matched substring, set up the next stat in internal_dfa_match()
4052 RWS_anchor *next = rws->next; pcre2_dfa_match() local
[all...]
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DGeneratedMessageV3.java1167 // a way to get the next element without advancing the iterator.
1171 private Map.Entry<FieldDescriptor, Object> next; field in GeneratedMessageV3.ExtendableMessage.ExtensionWriter
1176 next = iter.next(); in ExtensionWriter()
1183 while (next != null && next.getKey().getNumber() < end) { in writeUntil()
1184 FieldDescriptor descriptor = next.getKey(); in writeUntil()
1188 if (next instanceof LazyField.LazyEntry<?>) { in writeUntil()
1190 ((LazyField.LazyEntry<?>) next).getField().toByteString()); in writeUntil()
1193 (Message) next in writeUntil()
[all...]
H A DGeneratedMessage.java999 // a way to get the next element without advancing the iterator.
1003 private Map.Entry<FieldDescriptor, Object> next; field in GeneratedMessage.ExtendableMessage.ExtensionWriter
1008 next = iter.next(); in ExtensionWriter()
1015 while (next != null && next.getKey().getNumber() < end) { in writeUntil()
1016 FieldDescriptor descriptor = next.getKey(); in writeUntil()
1020 if (next instanceof LazyField.LazyEntry<?>) { in writeUntil()
1022 ((LazyField.LazyEntry<?>) next).getField().toByteString()); in writeUntil()
1025 (Message) next in writeUntil()
[all...]
/kernel/linux/linux-5.10/drivers/atm/
H A Dfirestream.c724 td->flags, td->next, td->bsa, td->aal_bufsize, td->skb ); in process_txdone_queue()
784 pe->flags, pe->next, pe->bsa, pe->aal_bufsize, in process_incoming()
899 /* Increment the channel numer: take a free one next time. */ in fs_open()
904 /* If we need to do RX, AND the RX is inuse, try the next */ in fs_open()
907 /* If we need to do TX, AND the TX is inuse, try the next */ in fs_open()
1187 td->next = 0; in fs_send()
1196 dq[qd].next = td->next; in fs_send()
1493 ne->next = virt_to_bus (NULL); in top_off_fp()
1509 qe->next in top_off_fp()
[all...]
/kernel/linux/linux-5.10/drivers/iommu/loongson/
H A Diommu.c1046 unsigned long next, old, step; in iommu_ptw_map() local
1068 next = iommu_ptable_end(start, end, level); in iommu_ptw_map()
1069 step = next - start; in iommu_ptw_map()
1084 iommu_ptw_map(iommu, (spt_entry *)*psentry, start, next, pa, level - 1); in iommu_ptw_map()
1090 start = next; in iommu_ptw_map()
1124 unsigned long next, old; in iommu_ptw_unmap() local
1138 next = iommu_ptable_end(start, end, level); in iommu_ptw_unmap()
1143 if ((next - start) != IOMMU_HPAGE_SIZE) in iommu_ptw_unmap()
1148 iommu_ptw_unmap(iommu, (spt_entry *)*psentry, start, next, level - 1); in iommu_ptw_unmap()
1149 } while (psentry++, phwentry++, start = next, star in iommu_ptw_unmap()
[all...]
/kernel/linux/linux-5.10/drivers/media/pci/intel/ipu3/
H A Dipu3-cio2.c896 unsigned int i, j, next = q->bufs_next; in cio2_vb2_buf_queue() local
923 * on, but since it could jump to next entry at any time, in cio2_vb2_buf_queue()
928 if (bufs_queued <= 1 || fbpt_rp == next) in cio2_vb2_buf_queue()
930 next = (fbpt_rp + 1) % CIO2_MAX_BUFFERS; in cio2_vb2_buf_queue()
939 if (!q->bufs[next]) { in cio2_vb2_buf_queue()
940 q->bufs[next] = b; in cio2_vb2_buf_queue()
941 entry = &q->fbpt[next * CIO2_MAX_LOPS]; in cio2_vb2_buf_queue()
944 q->bufs_next = (next + 1) % CIO2_MAX_BUFFERS; in cio2_vb2_buf_queue()
951 dev_dbg(&cio2->pci_dev->dev, "entry %i was full!\n", next); in cio2_vb2_buf_queue()
952 next in cio2_vb2_buf_queue()
[all...]
/kernel/linux/linux-5.10/drivers/infiniband/hw/hfi1/
H A Ddriver.c639 goto next; in __prescan_rxq()
642 goto next; in __prescan_rxq()
655 goto next; /* just in case */ in __prescan_rxq()
659 goto next; in __prescan_rxq()
668 goto next; in __prescan_rxq()
677 next: in __prescan_rxq()
740 /* Set up for the next packet */ in skip_rcv_packet()
778 /* Set up for the next packet */ in process_rcv_packet_napi()
824 /* Set up for the next packet */ in process_rcv_packet()
1090 /* On to the next packe in handle_receive_interrupt()
[all...]
/kernel/linux/linux-5.10/drivers/net/wireless/broadcom/brcm80211/brcmsmac/
H A Dmac80211_if.c288 struct brcms_timer *t, *next; in brcms_free() local
318 for (t = wl->timers; t; t = next) { in brcms_free()
319 next = t->next; in brcms_free()
1506 t->next = wl->timers; in brcms_init_timer()
1572 wl->timers = wl->timers->next; in brcms_free_timer()
1583 if (tmp->next == t) { in brcms_free_timer()
1584 tmp->next = t->next; in brcms_free_timer()
1591 tmp = tmp->next; in brcms_free_timer()
[all...]
/kernel/linux/linux-5.10/drivers/staging/rtl8712/
H A Drtl871x_mlme.c143 plist = phead->next; in r8712_find_network()
146 plist = plist->next; in r8712_find_network()
164 plist = phead->next; in r8712_free_network_queue()
167 plist = plist->next; in r8712_free_network_queue()
265 plist = phead->next; in r8712_get_oldest_wlan_network()
276 plist = plist->next; in r8712_get_oldest_wlan_network()
344 plist = phead->next; in update_scanned_network()
358 plist = plist->next; in update_scanned_network()
1080 pmlmepriv->pscanned = phead->next; in r8712_select_and_join_from_scan()
1091 pmlmepriv->pscanned = pmlmepriv->pscanned->next; in r8712_select_and_join_from_scan()
[all...]
/kernel/linux/linux-5.10/tools/perf/util/
H A Dheader.c954 struct rb_node *next; in write_bpf_prog_info() local
965 next = rb_first(root); in write_bpf_prog_info()
966 while (next) { in write_bpf_prog_info()
970 node = rb_entry(next, struct bpf_prog_info_node, rb_node); in write_bpf_prog_info()
971 next = rb_next(&node->rb_node); in write_bpf_prog_info()
1003 struct rb_node *next; in write_bpf_btf() local
1015 next = rb_first(root); in write_bpf_btf()
1016 while (next) { in write_bpf_btf()
1019 node = rb_entry(next, struct btf_node, rb_node); in write_bpf_btf()
1020 next in write_bpf_btf()
1645 struct rb_node *next; print_bpf_prog_info() local
1669 struct rb_node *next; print_bpf_btf() local
[all...]
/kernel/linux/linux-5.10/mm/
H A Dzsmalloc.c244 unsigned long next; member
934 struct page *page, *next; in __free_zspage() local
945 next = page = get_first_page(zspage); in __free_zspage()
948 next = get_next_page(page); in __free_zspage()
953 page = next; in __free_zspage()
996 link->next = freeobj++ << OBJ_TAG_BITS; in init_zspage()
1002 * page, which must point to the first object on the next in init_zspage()
1007 link->next = freeobj++ << OBJ_TAG_BITS; in init_zspage()
1013 link->next = -1UL << OBJ_TAG_BITS; in init_zspage()
1388 set_freeobj(zspage, link->next >> OBJ_TAG_BIT in obj_malloc()
[all...]
/kernel/linux/linux-5.10/fs/zonefs/
H A Dsuper.c1493 struct blk_zone *zone, *next, *end; in zonefs_create_zgroup() local
1523 for (zone = &zd->zones[1]; zone < end; zone = next) { in zonefs_create_zgroup()
1525 next = zone + 1; in zonefs_create_zgroup()
1539 for (; next < end; next++) { in zonefs_create_zgroup()
1540 if (zonefs_zone_type(next) != type) in zonefs_create_zgroup()
1542 zone->len += next->len; in zonefs_create_zgroup()
1543 zone->capacity += next->capacity; in zonefs_create_zgroup()
1544 if (next->cond == BLK_ZONE_COND_READONLY && in zonefs_create_zgroup()
1547 else if (next in zonefs_create_zgroup()
[all...]

Completed in 67 milliseconds

1...<<241242243244245246247248249250>>...520