Home
last modified time | relevance | path

Searched full:next (Results 1 – 25 of 5011) sorted by relevance

12345678910>>...201

/linux-3.3/lib/
Dlist_debug.c16 * the prev/next entries already!
21 struct list_head *next) in __list_add() argument
23 WARN(next->prev != prev, in __list_add()
24 "list_add corruption. next->prev should be " in __list_add()
25 "prev (%p), but was %p. (next=%p).\n", in __list_add()
26 prev, next->prev, next); in __list_add()
27 WARN(prev->next != next, in __list_add()
28 "list_add corruption. prev->next should be " in __list_add()
29 "next (%p), but was %p. (prev=%p).\n", in __list_add()
30 next, prev->next, prev); in __list_add()
[all …]
Dplist.c36 WARN(n->prev != p || p->next != n, in plist_check_prev_next()
39 "next: %p, n: %p, p: %p\n", in plist_check_prev_next()
40 t, t->next, t->prev, in plist_check_prev_next()
41 p, p->next, p->prev, in plist_check_prev_next()
42 n, n->next, n->prev); in plist_check_prev_next()
47 struct list_head *prev = top, *next = top->next; in plist_check_list() local
49 plist_check_prev_next(top, prev, next); in plist_check_list()
50 while (next != top) { in plist_check_list()
51 prev = next; in plist_check_list()
52 next = prev->next; in plist_check_list()
[all …]
Dlist_sort.c24 tail->next = a; in merge()
25 a = a->next; in merge()
27 tail->next = b; in merge()
28 b = b->next; in merge()
30 tail = tail->next; in merge()
32 tail->next = a?:b; in merge()
33 return head.next; in merge()
54 tail->next = a; in merge_and_restore_back_links()
56 a = a->next; in merge_and_restore_back_links()
58 tail->next = b; in merge_and_restore_back_links()
[all …]
Dioremap.c38 unsigned long next; in ioremap_pmd_range() local
45 next = pmd_addr_end(addr, end); in ioremap_pmd_range()
46 if (ioremap_pte_range(pmd, addr, next, phys_addr + addr, prot)) in ioremap_pmd_range()
48 } while (pmd++, addr = next, addr != end); in ioremap_pmd_range()
56 unsigned long next; in ioremap_pud_range() local
63 next = pud_addr_end(addr, end); in ioremap_pud_range()
64 if (ioremap_pmd_range(pud, addr, next, phys_addr + addr, prot)) in ioremap_pud_range()
66 } while (pud++, addr = next, addr != end); in ioremap_pud_range()
75 unsigned long next; in ioremap_page_range() local
84 next = pgd_addr_end(addr, end); in ioremap_page_range()
[all …]
/linux-3.3/include/linux/
Dlist.h14 * sometimes we already know the next/prev entries and we can
26 list->next = list; in INIT_LIST_HEAD()
34 * the prev/next entries already!
39 struct list_head *next) in __list_add() argument
41 next->prev = new; in __list_add()
42 new->next = next; in __list_add()
44 prev->next = new; in __list_add()
49 struct list_head *next);
62 __list_add(new, head, head->next); in list_add()
80 * Delete a list entry by making the prev/next entries
[all …]
Drculist.h22 * return the ->next pointer of a list_head in an rcu safe
25 #define list_next_rcu(list) (*((struct list_head __rcu **)(&(list)->next)))
31 * the prev/next entries already!
34 struct list_head *prev, struct list_head *next) in __list_add_rcu() argument
36 new->next = next; in __list_add_rcu()
39 next->prev = new; in __list_add_rcu()
60 __list_add_rcu(new, head, head->next); in list_add_rcu()
111 __list_del(entry->prev, entry->next); in list_del_rcu()
154 new->next = old->next; in list_replace_rcu()
157 new->next->prev = new; in list_replace_rcu()
[all …]
/linux-3.3/arch/blackfin/mm/
Dsram-alloc.c31 struct sram_piece *next; member
78 per_cpu(free_l1_ssram_head, cpu).next = in l1sram_init()
80 if (!per_cpu(free_l1_ssram_head, cpu).next) { in l1sram_init()
85 per_cpu(free_l1_ssram_head, cpu).next->paddr = (void *)get_l1_scratch_start_cpu(cpu) + reserve; in l1sram_init()
86 per_cpu(free_l1_ssram_head, cpu).next->size = L1_SCRATCH_LENGTH - reserve; in l1sram_init()
87 per_cpu(free_l1_ssram_head, cpu).next->pid = 0; in l1sram_init()
88 per_cpu(free_l1_ssram_head, cpu).next->next = NULL; in l1sram_init()
90 per_cpu(used_l1_ssram_head, cpu).next = NULL; in l1sram_init()
106 per_cpu(free_l1_data_A_sram_head, cpu).next = in l1_data_sram_init()
108 if (!per_cpu(free_l1_data_A_sram_head, cpu).next) { in l1_data_sram_init()
[all …]
/linux-3.3/drivers/gpu/drm/i915/
Di915_mem.c16 * next paragraph) shall be included in all copies or substantial portions
76 list[(unsigned)list[i].next].prev = list[i].prev; in mark_block()
77 list[(unsigned)list[i].prev].next = list[i].next; in mark_block()
82 list[i].next = list[nr].next; in mark_block()
83 list[(unsigned)list[nr].next].prev = i; in mark_block()
84 list[nr].next = i; in mark_block()
104 newblock->next = p->next; in split_block()
106 p->next->prev = newblock; in split_block()
107 p->next = newblock; in split_block()
121 newblock->next = p->next; in split_block()
[all …]
/linux-3.3/drivers/gpu/drm/radeon/
Dmkregtable.c36 * sometimes we already know the next/prev entries and we can
42 struct list_head *next, *prev; member
52 list->next = list; in INIT_LIST_HEAD()
60 * the prev/next entries already!
64 struct list_head *prev, struct list_head *next) in __list_add() argument
66 next->prev = new; in __list_add()
67 new->next = next; in __list_add()
69 prev->next = new; in __list_add()
73 struct list_head *prev, struct list_head *next);
86 __list_add(new, head, head->next); in list_add()
[all …]
Dradeon_mem.c16 * The above copyright notice and this permission notice (including the next
53 newblock->next = p->next; in split_block()
55 p->next->prev = newblock; in split_block()
56 p->next = newblock; in split_block()
70 newblock->next = p->next; in split_block()
72 p->next->prev = newblock; in split_block()
73 p->next = newblock; in split_block()
116 if (p->next->file_priv == NULL) { in free_block()
117 struct mem_block *q = p->next; in free_block()
119 p->next = q->next; in free_block()
[all …]
/linux-3.3/drivers/scsi/sym53c8xx_2/
Dsym_malloc.c77 while (!h[j].next) { in ___sym_malloc()
79 h[j].next = (m_link_p) M_GET_MEM_CLUSTER(); in ___sym_malloc()
80 if (h[j].next) in ___sym_malloc()
81 h[j].next->next = NULL; in ___sym_malloc()
87 a = h[j].next; in ___sym_malloc()
89 h[j].next = h[j].next->next; in ___sym_malloc()
93 h[j].next = (m_link_p) (a+s); in ___sym_malloc()
94 h[j].next->next = NULL; in ___sym_malloc()
133 ((m_link_p) a)->next = h[i].next; in ___sym_mfree()
134 h[i].next = (m_link_p) a; in ___sym_mfree()
[all …]
/linux-3.3/block/
Dblk-merge.c278 struct request *next) in ll_merge_requests_fn() argument
282 req->biotail->bi_seg_back_size + next->bio->bi_seg_front_size; in ll_merge_requests_fn()
288 if (req->special || next->special) in ll_merge_requests_fn()
294 if ((blk_rq_sectors(req) + blk_rq_sectors(next)) > queue_max_sectors(q)) in ll_merge_requests_fn()
297 total_phys_segments = req->nr_phys_segments + next->nr_phys_segments; in ll_merge_requests_fn()
298 if (blk_phys_contig_segment(q, req->biotail, next->bio)) { in ll_merge_requests_fn()
301 if (next->nr_phys_segments == 1) in ll_merge_requests_fn()
302 next->biotail->bi_seg_back_size = seg_size; in ll_merge_requests_fn()
309 if (blk_integrity_rq(req) && blk_integrity_merge_rq(q, req, next)) in ll_merge_requests_fn()
368 struct request *next) in attempt_merge() argument
[all …]
/linux-3.3/mm/
Dpagewalk.c31 unsigned long next; in walk_pmd_range() local
37 next = pmd_addr_end(addr, end); in walk_pmd_range()
40 err = walk->pte_hole(addr, next, walk); in walk_pmd_range()
50 err = walk->pmd_entry(pmd, addr, next, walk); in walk_pmd_range()
64 err = walk_pte_range(pmd, addr, next, walk); in walk_pmd_range()
67 } while (pmd++, addr = next, addr != end); in walk_pmd_range()
76 unsigned long next; in walk_pud_range() local
81 next = pud_addr_end(addr, end); in walk_pud_range()
84 err = walk->pte_hole(addr, next, walk); in walk_pud_range()
90 err = walk->pud_entry(pud, addr, next, walk); in walk_pud_range()
[all …]
Dmincore.c112 unsigned long next; in mincore_pte_range() local
121 next = addr + PAGE_SIZE; in mincore_pte_range()
123 mincore_unmapped_range(vma, addr, next, vec); in mincore_pte_range()
146 } while (ptep++, addr = next, addr != end); in mincore_pte_range()
154 unsigned long next; in mincore_pmd_range() local
159 next = pmd_addr_end(addr, end); in mincore_pmd_range()
161 if (mincore_huge_pmd(vma, pmd, addr, next, vec)) { in mincore_pmd_range()
162 vec += (next - addr) >> PAGE_SHIFT; in mincore_pmd_range()
168 mincore_unmapped_range(vma, addr, next, vec); in mincore_pmd_range()
170 mincore_pte_range(vma, pmd, addr, next, vec); in mincore_pmd_range()
[all …]
/linux-3.3/drivers/pci/hotplug/
Dcpqphp_ctrl.c135 slot = slot->next; in cpqhp_find_slot()
321 if (!((*head)->next)) in sort_by_size()
328 if (((*head)->next) && in sort_by_size()
329 ((*head)->length > (*head)->next->length)) { in sort_by_size()
332 *head = (*head)->next; in sort_by_size()
333 current_res->next = (*head)->next; in sort_by_size()
334 (*head)->next = current_res; in sort_by_size()
339 while (current_res->next && current_res->next->next) { in sort_by_size()
340 if (current_res->next->length > current_res->next->next->length) { in sort_by_size()
342 next_res = current_res->next; in sort_by_size()
[all …]
/linux-3.3/arch/x86/include/asm/
Dmmu_context.h13 struct mm_struct *next) in paravirt_activate_mm() argument
33 static inline void switch_mm(struct mm_struct *prev, struct mm_struct *next, in switch_mm() argument
38 if (likely(prev != next)) { in switch_mm()
41 percpu_write(cpu_tlbstate.active_mm, next); in switch_mm()
43 cpumask_set_cpu(cpu, mm_cpumask(next)); in switch_mm()
46 load_cr3(next->pgd); in switch_mm()
54 if (unlikely(prev->context.ldt != next->context.ldt)) in switch_mm()
55 load_LDT_nolock(&next->context); in switch_mm()
60 BUG_ON(percpu_read(cpu_tlbstate.active_mm) != next); in switch_mm()
62 if (!cpumask_test_and_set_cpu(cpu, mm_cpumask(next))) { in switch_mm()
[all …]
/linux-3.3/net/ax25/
Dax25_iface.c39 struct listen_struct *next; member
52 ap->next = protocol_list; in ax25_register_pid()
69 protocol_list = protocol->next; in ax25_protocol_release()
73 while (protocol != NULL && protocol->next != NULL) { in ax25_protocol_release()
74 if (protocol->next->pid == pid) { in ax25_protocol_release()
75 protocol->next = protocol->next->next; in ax25_protocol_release()
79 protocol = protocol->next; in ax25_protocol_release()
119 listen->next = listen_list; in ax25_listen_register()
140 listen_list = listen->next; in ax25_listen_release()
146 while (listen != NULL && listen->next != NULL) { in ax25_listen_release()
[all …]
/linux-3.3/tools/power/cpupower/lib/
Dcpufreq.c80 struct cpufreq_available_governors *tmp, *next; in cpufreq_put_available_governors() local
87 next = tmp->next; in cpufreq_put_available_governors()
91 tmp = next; in cpufreq_put_available_governors()
104 struct cpufreq_available_frequencies *tmp, *next; in cpufreq_put_available_frequencies() local
111 next = tmp->next; in cpufreq_put_available_frequencies()
113 tmp = next; in cpufreq_put_available_frequencies()
125 struct cpufreq_affected_cpus *tmp, *next; in cpufreq_put_affected_cpus() local
132 next = tmp->next; in cpufreq_put_affected_cpus()
134 tmp = next; in cpufreq_put_affected_cpus()
192 struct cpufreq_stats *tmp, *next; in cpufreq_put_stats() local
[all …]
/linux-3.3/tools/firewire/
Dlist.h2 struct list *next, *prev; member
8 list->next = list; in list_init()
15 return list->next == list; in list_empty()
22 new_link->next = link; in list_insert()
23 new_link->prev->next = new_link; in list_insert()
24 new_link->next->prev = new_link; in list_insert()
36 list_insert(list->next, new_link); in list_prepend()
42 link->prev->next = link->next; in list_remove()
43 link->next->prev = link->prev; in list_remove()
50 list_entry((list)->next, type, member)
[all …]
/linux-3.3/drivers/usb/host/
Dohci-dbg.c75 #define ohci_dbg_sw(ohci, next, size, format, arg...) \ argument
77 if (next != NULL) { \
79 s_len = scnprintf (*next, *size, format, ## arg ); \
80 *size -= s_len; *next += s_len; \
85 /* Version for use where "next" is the address of a local variable */
86 #define ohci_dbg_nosw(ohci, next, size, format, arg...) \ argument
89 s_len = scnprintf(*next, *size, format, ## arg); \
90 *size -= s_len; *next += s_len; \
98 char **next, in ohci_dump_intr_mask() argument
101 ohci_dbg_sw (ohci, next, size, "%s 0x%08x%s%s%s%s%s%s%s%s%s\n", in ohci_dump_intr_mask()
[all …]
/linux-3.3/arch/powerpc/include/asm/
Dmmu_context.h20 extern void switch_mmu_context(struct mm_struct *prev, struct mm_struct *next);
35 extern void switch_cop(struct mm_struct *next);
43 static inline void switch_mm(struct mm_struct *prev, struct mm_struct *next, in switch_mm() argument
47 cpumask_set_cpu(smp_processor_id(), mm_cpumask(next)); in switch_mm()
51 tsk->thread.pgdir = next->pgd; in switch_mm()
56 get_paca()->pgd = next->pgd; in switch_mm()
59 if (prev == next) in switch_mm()
63 /* Switch coprocessor context only if prev or next uses a coprocessor */ in switch_mm()
64 if (prev->context.acop || next->context.acop) in switch_mm()
65 switch_cop(next); in switch_mm()
[all …]
/linux-3.3/arch/powerpc/boot/dts/fsl/
Dp4080si-pre.dtsi81 next-level-cache = <&L2_0>;
83 next-level-cache = <&cpc>;
89 next-level-cache = <&L2_1>;
91 next-level-cache = <&cpc>;
97 next-level-cache = <&L2_2>;
99 next-level-cache = <&cpc>;
105 next-level-cache = <&L2_3>;
107 next-level-cache = <&cpc>;
113 next-level-cache = <&L2_4>;
115 next-level-cache = <&cpc>;
[all …]
/linux-3.3/sound/pci/ctxfi/
Dctimap.c31 entry->next = entry->addr; in input_mapper_add()
53 pos = head->next; in input_mapper_add()
60 entry->next = pos_ent->addr; in input_mapper_add()
62 pre_ent->next = entry->addr; in input_mapper_add()
71 struct list_head *next, *pre, *head; in input_mapper_delete() local
80 next = (entry->list.next == head) ? head->next : entry->list.next; in input_mapper_delete()
84 entry->next = entry->addr = entry->user = entry->slot = 0; in input_mapper_delete()
91 next_ent = list_entry(next, struct imapper, list); in input_mapper_delete()
93 pre_ent->next = next_ent->addr; in input_mapper_delete()
106 pos = head->next; in free_input_mapper_list()
/linux-3.3/sound/core/seq/
Dseq_prioq.c38 * |next
170 f->tail->next = cell; in snd_seq_prioq_cell_in()
172 cell->next = NULL; in snd_seq_prioq_cell_in()
195 /* move cursor to next cell */ in snd_seq_prioq_cell_in()
197 cur = cur->next; in snd_seq_prioq_cell_in()
207 prev->next = cell; in snd_seq_prioq_cell_in()
208 cell->next = cur; in snd_seq_prioq_cell_in()
233 f->head = cell->next; in snd_seq_prioq_cell_out()
239 cell->next = NULL; in snd_seq_prioq_cell_out()
294 register struct snd_seq_event_cell *cell, *next; in snd_seq_prioq_leave() local
[all …]
/linux-3.3/net/netlabel/
Dnetlabel_addrlist.h79 i = i->next; in __af4list_valid()
91 i = rcu_dereference(i->next); in __af4list_valid_rcu()
98 for (iter = __af4list_valid((head)->next, head); \
100 iter = __af4list_valid(iter->list.next, head))
103 for (iter = __af4list_valid_rcu((head)->next, head); \
105 iter = __af4list_valid_rcu(iter->list.next, head))
108 for (iter = __af4list_valid((head)->next, head), \
109 tmp = __af4list_valid(iter->list.next, head); \
111 iter = tmp, tmp = __af4list_valid(iter->list.next, head))
146 i = i->next; in __af6list_valid()
[all …]

12345678910>>...201