Searched refs:next (Results 176 - 200 of 3431) sorted by relevance

1234567891011>>

/linux-master/drivers/usb/host/
H A Dxhci-ext-caps.h85 * and next capability pointer.
117 * @id Extended capability ID to search for, or 0 for the next
120 * Returns the offset of the next matching extended capability structure.
128 u32 next; local
147 next = XHCI_EXT_CAPS_NEXT(val);
148 offset += next << 2;
149 } while (next);
H A Dfhci-q.c75 td = list_entry(ed->td_list.next, struct td, node);
87 td = list_entry(frame->tds_list.next, struct td, frame_lh);
88 list_del_init(frame->tds_list.next);
100 td = list_entry(frame->tds_list.next, struct td, frame_lh);
112 td = list_entry(ed->td_list.next, struct td, node);
113 list_del_init(ed->td_list.next);
115 /* if this TD was the ED's head, find next TD */
117 ed->td_head = list_entry(ed->td_list.next, struct td,
132 td = list_entry(p_list->done_list.next, struct td, node);
133 list_del_init(p_list->done_list.next);
[all...]
/linux-master/fs/bcachefs/
H A Dmove_types.h30 struct move_bucket_in_flight *next; member in struct:move_bucket_in_flight
/linux-master/include/linux/
H A Drculist_bl.h79 n->next = first;
81 first->pprev = &n->next;
99 pos = rcu_dereference_raw(pos->next))
H A Dagpgart.h90 struct agp_client *next; member in struct:agp_client
98 struct agp_controller *next; member in struct:agp_controller
113 struct agp_file_private *next; member in struct:agp_file_private
/linux-master/arch/arm64/kvm/hyp/include/nvhe/
H A Dspinlock.h24 u16 next, owner; member in struct:hyp_spinlock::__anon10
26 u16 owner, next;
50 /* Atomically increment the next ticket. */
105 return lockval.owner != lockval.next;
/linux-master/drivers/acpi/acpica/
H A Dexmutex.c45 if (obj_desc->mutex.next) {
46 (obj_desc->mutex.next)->mutex.prev = obj_desc->mutex.prev;
50 (obj_desc->mutex.prev)->mutex.next = obj_desc->mutex.next;
61 thread->acquired_mutex_list = obj_desc->mutex.next;
89 obj_desc->mutex.next = list_head;
463 union acpi_operand_object *next = thread->acquired_mutex_list; local
470 while (next) {
471 obj_desc = next;
496 next
[all...]
H A Dpsparse.c63 * DESCRIPTION: Get next AML opcode (without incrementing AML pointer)
104 union acpi_parse_object *next; local
235 replacement_op->common.next = op->common.next;
238 op->common.next;
249 next = prev->common.next;
250 if (next == op) {
258 prev->common.next =
260 replacement_op->common.next
[all...]
/linux-master/drivers/gpu/drm/xe/
H A Dxe_res_cursor.h86 struct list_head *head, *next; local
100 next = block->link.next;
101 if (next != head)
102 block = list_entry(next, struct drm_buddy_block,
177 * Move the cursor @size bytes forwrad, walking to the next node if necessary.
182 struct list_head *next; local
210 next = block->link.next;
211 block = list_entry(next, struc
[all...]
/linux-master/tools/perf/util/
H A Dblock-range.c81 struct block_range *next, *entry = NULL; local
98 * be inside/behind the next range.
105 * If the last node is before, advance one to find the next.
113 next = rb_entry(n, struct block_range, node);
115 if (next->start <= end) { /* add head: [start...][n->start...] */
122 .end = next->start - 1,
127 rb_link_left_of_node(&head->node, &next->node);
238 next = block_range__next(entry);
239 if (!next)
243 * If @end is in beyond @entry but not inside @next, ad
[all...]
/linux-master/drivers/md/dm-vdo/indexer/
H A Dradix-sort.c71 /* Insert the next unsorted key into an array of sorted keys. */
72 static inline void insert_key(const struct task task, sort_key_t *next) argument
75 sort_key_t unsorted = *next;
78 while ((--next >= task.first_key) &&
79 (compare(unsorted, next[0], task.offset, task.length) < 0))
80 next[1] = next[0];
83 next[1] = unsorted;
92 sort_key_t *next; local
94 for (next
[all...]
/linux-master/drivers/of/
H A Dbase.c201 for (pp = np->properties; pp; pp = pp->next) {
245 * of_find_all_nodes - Get next node in global list
305 * to get the highest score. Matching type is next, followed by matching
595 struct device_node *next; local
600 next = prev ? prev->sibling : node->child;
601 of_node_get(next);
603 return next;
621 struct device_node *next; local
625 next = __of_get_next_child(node, prev);
627 return next;
635 struct device_node *next; local
697 struct device_node *next = NULL; local
1570 struct property **next; local
1591 struct property **next; local
1691 struct property **next, *oldprop; local
[all...]
/linux-master/arch/xtensa/include/asm/
H A Dmmu_context.h75 * Start new asid cycle; continue counting with next
126 static inline void switch_mm(struct mm_struct *prev, struct mm_struct *next, argument
130 int migrated = next->context.cpu != cpu;
134 next->context.cpu = cpu;
136 if (migrated || prev != next)
137 activate_context(next, cpu);
/linux-master/net/ax25/
H A Dax25_route.c50 ax25_rt = ax25_rt->next;
54 ax25_route_list = s->next;
58 for (t = ax25_route_list; t != NULL; t = t->next) {
59 if (t->next == s) {
60 t->next = s->next;
110 ax25_rt = ax25_rt->next;
137 ax25_rt->next = ax25_route_list;
164 ax25_rt = ax25_rt->next;
168 ax25_route_list = s->next;
[all...]
/linux-master/arch/csky/lib/
H A Dstring.c46 unsigned long last, next; local
56 next = s.as_ulong[0];
58 last = next;
59 next = s.as_ulong[1];
62 next << ((BYTES_LONG - distance) * 8);
/linux-master/arch/powerpc/mm/nohash/
H A De500_hugetlbpage.c21 int this, next; local
26 next = this + 1;
27 if (next >= tcd->esel_max)
28 next = tcd->esel_first;
30 tcd->esel_next = next;
/linux-master/arch/powerpc/mm/
H A Dhugetlbpage.c366 unsigned long next; local
374 next = pmd_addr_end(addr, end);
390 * Increment next by the size of the huge mapping since
396 if (more > next)
397 next = more;
400 addr, next, floor, ceiling);
401 } while (addr = next, addr != end);
417 unsigned long next; local
423 next = pud_addr_end(addr, end);
427 hugetlb_free_pmd_range(tlb, pud, addr, next, floo
464 unsigned long next; local
[all...]
/linux-master/arch/arm64/kernel/pi/
H A Dmap_range.c51 u64 next = min((start | lmask) + 1, PAGE_ALIGN(end)); local
53 if (level < 3 && (start | next | pa) & lmask) {
63 map_range(pte, start, next, pa, prot, level + 1,
84 pa += next - start;
85 start = next;
/linux-master/arch/riscv/include/asm/
H A Dswitch_to.h52 struct task_struct *next)
58 fstate_restore(next, task_pt_regs(next));
95 #define switch_to(prev, next, last) \
98 struct task_struct *__next = (next); \
51 __switch_to_fpu(struct task_struct *prev, struct task_struct *next) argument
/linux-master/tools/perf/util/bpf_skel/
H A Doff_cpu.bpf.c186 struct task_struct *next, int state)
195 goto next;
203 goto next;
209 next:
210 pelem = bpf_task_storage_get(&tstamp, next, NULL, 0);
214 .pid = next->pid,
215 .tgid = next->tgid,
218 .cgroup_id = needs_cgroup ? get_cgroup_id(next) : 0,
266 struct task_struct *prev, *next; local
273 next
185 off_cpu_stat(u64 *ctx, struct task_struct *prev, struct task_struct *next, int state) argument
[all...]
/linux-master/arch/arm/mm/
H A Dkasan_init.c46 unsigned long next; local
53 next = addr + PAGE_SIZE;
87 } while (ptep++, addr = next, addr != end);
96 unsigned long next; local
118 next = pmd_addr_end(addr, end);
119 kasan_pte_populate(pmdp, addr, next, early);
120 } while (pmdp++, addr = next, addr != end);
126 unsigned long next; local
149 next = pgd_addr_end(addr, end);
158 kasan_pmd_populate(pudp, addr, next, earl
[all...]
/linux-master/lib/zlib_inflate/
H A Dinftrees.c18 on return points to the next available entry's address. bits is the
40 code *next; /* next available space in table */ local
137 filled is at next and has curr index bits. The code being used is huff
190 next = *table; /* current table to fill in */
221 min = fill; /* save offset to next table */
224 next[(huff >> drop) + fill] = this;
238 /* go to next symbol, update count, len */
252 next += min; /* here min is 1 << curr */
254 /* determine length of next tabl
[all...]
/linux-master/fs/nilfs2/
H A Dsegbuf.h29 * @next: Block number of the next full segment
41 sector_t next; member in struct:nilfs_segsum_info
50 * @sb_nextnum: Index number of the next full segment
87 #define NILFS_NEXT_SEGBUF(segbuf) NILFS_LIST_SEGBUF((segbuf)->sb_list.next)
90 #define NILFS_FIRST_SEGBUF(head) NILFS_LIST_SEGBUF((head)->next)
91 #define NILFS_SEGBUF_IS_LAST(segbuf, head) ((segbuf)->sb_list.next == (head))
98 (list_entry((head)->next, struct buffer_head, b_assoc_buffers))
100 (list_entry((bh)->b_assoc_buffers.next, struct buffer_head, \
102 #define NILFS_SEGBUF_BH_IS_LAST(bh, head) ((bh)->b_assoc_buffers.next
[all...]
/linux-master/arch/x86/include/asm/
H A Dmmu_context.h76 extern void switch_ldt(struct mm_struct *prev, struct mm_struct *next);
82 static inline void switch_ldt(struct mm_struct *prev, struct mm_struct *next) argument
168 extern void switch_mm(struct mm_struct *prev, struct mm_struct *next,
171 extern void switch_mm_irqs_off(struct mm_struct *prev, struct mm_struct *next,
175 #define activate_mm(prev, next) \
177 paravirt_enter_mmap(next); \
178 switch_mm((prev), (next), NULL); \
/linux-master/drivers/dma-buf/
H A Ddma-fence-unwrap.c42 * dma_fence_unwrap_next - return the next fence from a fence containers
46 * the next fence from them.
115 struct dma_fence *next; local
120 next = fences[i];
121 if (!next)
131 if (!tmp || tmp->context > next->context) {
132 tmp = next;
135 } else if (tmp->context < next->context) {
138 } else if (dma_fence_is_later(tmp, next)) {

Completed in 305 milliseconds

1234567891011>>