/linux-master/drivers/media/test-drivers/vidtv/ |
H A D | vidtv_channel.h | 51 * @next: Optionally chain this channel. 62 struct vidtv_channel *next; member in struct:vidtv_channel
|
/linux-master/arch/um/include/shared/ |
H A D | mem_user.h | 36 struct iomem_region *next; member in struct:iomem_region
|
/linux-master/tools/bpf/runqslower/ |
H A D | runqslower.bpf.c | 67 * struct task_struct *next) 70 struct task_struct *next = (struct task_struct *)ctx[2]; local 80 pid = next->pid; 87 tsp = bpf_task_storage_get(&start, next, 0, 0); 103 bpf_task_storage_delete(&start, next);
|
/linux-master/arch/riscv/kernel/ |
H A D | hibernate.c | 198 unsigned long next; local 217 next = pmd_addr_end(start, end); 225 ret = temp_pgtable_map_pte(dst_pmdp, src_pmdp, start, next, prot); 229 } while (dst_pmdp++, src_pmdp++, start = next, start != end); 237 unsigned long next; local 256 next = pud_addr_end(start, end); 264 ret = temp_pgtable_map_pmd(dst_pudp, src_pudp, start, next, prot); 268 } while (dst_pudp++, src_pudp++, start = next, start != end); 276 unsigned long next; local 295 next 316 unsigned long next; local [all...] |
/linux-master/drivers/gpu/drm/i915/gvt/ |
H A D | mmio_context.h | 11 * The above copyright notice and this permission notice (including the next 50 struct intel_vgpu *next,
|
/linux-master/drivers/usb/host/ |
H A D | xhci-ext-caps.h | 85 * 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 D | fhci-q.c | 75 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 D | move_types.h | 30 struct move_bucket_in_flight *next; member in struct:move_bucket_in_flight
|
/linux-master/include/linux/ |
H A D | rculist_bl.h | 79 n->next = first; 81 first->pprev = &n->next; 99 pos = rcu_dereference_raw(pos->next))
|
H A D | agpgart.h | 90 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
|
H A D | page_ext.h | 92 void *next = curr; local 93 next += page_ext_size; 94 return next;
|
/linux-master/arch/arm64/kvm/hyp/include/nvhe/ |
H A D | spinlock.h | 24 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 D | exmutex.c | 45 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 D | psparse.c | 63 * 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 D | xe_res_cursor.h | 86 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 D | block-range.c | 81 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 D | radix-sort.c | 71 /* 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 D | base.c | 200 for (pp = np->properties; pp; pp = pp->next) { 244 * of_find_all_nodes - Get next node in global list 304 * to get the highest score. Matching type is next, followed by matching 594 struct device_node *next; local 599 next = prev ? prev->sibling : node->child; 600 of_node_get(next); 602 return next; 620 struct device_node *next; local 624 next = __of_get_next_child(node, prev); 626 return next; 634 struct device_node *next; local 696 struct device_node *next = NULL; local 1588 struct property **next; local 1609 struct property **next; local 1709 struct property **next, *oldprop; local [all...] |
/linux-master/arch/xtensa/include/asm/ |
H A D | mmu_context.h | 75 * 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 D | ax25_route.c | 50 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 D | string.c | 46 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 D | e500_hugetlbpage.c | 21 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 D | hugetlbpage.c | 366 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 D | map_range.c | 51 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/tools/perf/util/bpf_skel/ |
H A D | off_cpu.bpf.c | 186 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...] |