Searched refs:next (Results 101 - 125 of 12498) sorted by relevance

1234567891011>>

/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/arch/frv/include/asm/
H A Dmmu_context.h35 #define switch_mm(prev, next, tsk) \
37 if (prev != next) \
38 change_mm_context(&prev->context, &next->context, next->pgd); \
41 #define activate_mm(prev, next) \
43 change_mm_context(&prev->context, &next->context, next->pgd); \
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/include/linux/
H A Dlist.h15 * sometimes we already know the next/prev entries and we can
27 list->next = list;
35 * the prev/next entries already!
40 struct list_head *next)
42 next->prev = new;
43 new->next = next;
45 prev->next = new;
50 struct list_head *next);
63 __list_add(new, head, head->next);
38 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
87 __list_del(struct list_head * prev, struct list_head * next) argument
201 struct list_head *next = head->next; local
268 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
587 struct hlist_node *next = n->next; local
620 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
629 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/include/linux/
H A Dlist.h15 * sometimes we already know the next/prev entries and we can
27 list->next = list;
35 * the prev/next entries already!
40 struct list_head *next)
42 next->prev = new;
43 new->next = next;
45 prev->next = new;
50 struct list_head *next);
63 __list_add(new, head, head->next);
38 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
87 __list_del(struct list_head * prev, struct list_head * next) argument
201 struct list_head *next = head->next; local
268 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
587 struct hlist_node *next = n->next; local
620 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
629 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/mm/
H A Dpagewalk.c31 unsigned long next; local
36 next = pmd_addr_end(addr, end);
39 err = walk->pte_hole(addr, next, walk);
45 err = walk->pmd_entry(pmd, addr, next, walk);
47 err = walk_pte_range(pmd, addr, next, walk);
50 } while (pmd++, addr = next, addr != end);
59 unsigned long next; local
64 next = pud_addr_end(addr, end);
67 err = walk->pte_hole(addr, next, walk);
73 err = walk->pud_entry(pud, addr, next, wal
96 unsigned long next; local
140 unsigned long next; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/mm/
H A Dpagewalk.c31 unsigned long next; local
36 next = pmd_addr_end(addr, end);
39 err = walk->pte_hole(addr, next, walk);
45 err = walk->pmd_entry(pmd, addr, next, walk);
47 err = walk_pte_range(pmd, addr, next, walk);
50 } while (pmd++, addr = next, addr != end);
59 unsigned long next; local
64 next = pud_addr_end(addr, end);
67 err = walk->pte_hole(addr, next, walk);
73 err = walk->pud_entry(pud, addr, next, wal
96 unsigned long next; local
140 unsigned long next; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/xz/src/liblzma/common/
H A Dauto_decoder.c19 lzma_next_coder next; member in struct:lzma_coder_s
53 &coder->next, allocator,
56 return_if_error(lzma_alone_decoder_init(&coder->next,
73 const lzma_ret ret = coder->next.code(
74 coder->next.coder, allocator,
105 lzma_next_end(&coder->next, allocator);
115 return coder->next.get_check == NULL ? LZMA_CHECK_NONE
116 : coder->next.get_check(coder->next.coder);
126 if (coder->next
146 auto_decoder_init(lzma_next_coder *next, lzma_allocator *allocator, uint64_t memlimit, uint32_t flags) argument
[all...]
H A Dalone_decoder.c19 lzma_next_coder next; member in struct:lzma_coder_s
136 const lzma_ret ret = lzma_next_filter_init(&coder->next,
142 lzma_lz_decoder_uncompressed(coder->next.coder,
150 return coder->next.code(coder->next.coder,
166 lzma_next_end(&coder->next, allocator);
191 lzma_alone_decoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument
194 lzma_next_coder_init(&lzma_alone_decoder_init, next, allocator);
199 if (next->coder == NULL) {
200 next
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/curl-7.21.7/lib/
H A Dslist.c47 while(item->next) {
48 item = item->next;
70 new_item->next = NULL;
83 last->next = new_item;
110 inlist = inlist->next;
118 struct curl_slist *next; local
126 next = item->next;
132 item = next;
133 } while(next);
[all...]
H A Dllist.c83 list->head->next = NULL;
88 ne->next = e?e->next:list->head;
94 else if(e->next) {
95 e->next->prev = ne;
101 e->next = ne;
120 list->head = e->next;
125 e->next->prev = NULL;
128 e->prev->next = e->next;
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/curl-7.21.7/lib/
H A Dslist.c47 while(item->next) {
48 item = item->next;
70 new_item->next = NULL;
83 last->next = new_item;
110 inlist = inlist->next;
118 struct curl_slist *next; local
126 next = item->next;
132 item = next;
133 } while(next);
[all...]
H A Dllist.c83 list->head->next = NULL;
88 ne->next = e?e->next:list->head;
94 else if(e->next) {
95 e->next->prev = ne;
101 e->next = ne;
120 list->head = e->next;
125 e->next->prev = NULL;
128 e->prev->next = e->next;
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/curl-7.21.7/lib/
H A Dslist.c47 while(item->next) {
48 item = item->next;
70 new_item->next = NULL;
83 last->next = new_item;
110 inlist = inlist->next;
118 struct curl_slist *next; local
126 next = item->next;
132 item = next;
133 } while(next);
[all...]
H A Dllist.c83 list->head->next = NULL;
88 ne->next = e?e->next:list->head;
94 else if(e->next) {
95 e->next->prev = ne;
101 e->next = ne;
120 list->head = e->next;
125 e->next->prev = NULL;
128 e->prev->next = e->next;
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/hotplug2/
H A Dchildlist.c26 for (; child->next; child = child->next);
28 child->next = xmalloc(sizeof(struct hotplug2_child_t));
30 child = child->next;
36 child->next = NULL;
58 ((struct hotplug2_child_t *)(child->prev))->next = child->next;
60 if (child->next != NULL)
61 ((struct hotplug2_child_t *)(child->next))->prev = child->prev;
71 if (child->next !
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/hotplug2/
H A Dchildlist.c26 for (; child->next; child = child->next);
28 child->next = xmalloc(sizeof(struct hotplug2_child_t));
30 child = child->next;
36 child->next = NULL;
58 ((struct hotplug2_child_t *)(child->prev))->next = child->next;
60 if (child->next != NULL)
61 ((struct hotplug2_child_t *)(child->next))->prev = child->prev;
71 if (child->next !
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/hotplug2/
H A Dchildlist.c26 for (; child->next; child = child->next);
28 child->next = xmalloc(sizeof(struct hotplug2_child_t));
30 child = child->next;
36 child->next = NULL;
58 ((struct hotplug2_child_t *)(child->prev))->next = child->next;
60 if (child->next != NULL)
61 ((struct hotplug2_child_t *)(child->next))->prev = child->prev;
71 if (child->next !
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/drivers/acpi/acpica/
H A Dpstree.c101 arg = arg->common.next;
160 while (prev_arg->common.next) {
161 prev_arg = prev_arg->common.next;
163 prev_arg->common.next = arg;
174 arg = arg->common.next;
190 * DESCRIPTION: Get next op in tree (walking the tree in depth-first order)
198 union acpi_parse_object *next = NULL; local
210 next = acpi_ps_get_arg(op, 0);
211 if (next) {
212 return (next);
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/drivers/acpi/acpica/
H A Dpstree.c101 arg = arg->common.next;
160 while (prev_arg->common.next) {
161 prev_arg = prev_arg->common.next;
163 prev_arg->common.next = arg;
174 arg = arg->common.next;
190 * DESCRIPTION: Get next op in tree (walking the tree in depth-first order)
198 union acpi_parse_object *next = NULL; local
210 next = acpi_ps_get_arg(op, 0);
211 if (next) {
212 return (next);
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/drivers/scsi/sym53c8xx_2/
H A Dsym_malloc.c77 while (!h[j].next) {
79 h[j].next = (m_link_p) M_GET_MEM_CLUSTER();
80 if (h[j].next)
81 h[j].next->next = NULL;
87 a = h[j].next;
89 h[j].next = h[j].next->next;
93 h[j].next
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/drivers/scsi/sym53c8xx_2/
H A Dsym_malloc.c77 while (!h[j].next) {
79 h[j].next = (m_link_p) M_GET_MEM_CLUSTER();
80 if (h[j].next)
81 h[j].next->next = NULL;
87 a = h[j].next;
89 h[j].next = h[j].next->next;
93 h[j].next
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/arch/cris/include/asm/
H A Dmmu_context.h9 extern void switch_mm(struct mm_struct *prev, struct mm_struct *next,
14 #define activate_mm(prev,next) switch_mm((prev),(next),NULL)
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/arch/cris/include/asm/
H A Dmmu_context.h9 extern void switch_mm(struct mm_struct *prev, struct mm_struct *next,
14 #define activate_mm(prev,next) switch_mm((prev),(next),NULL)
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/netatalk-3.0.5/libatalk/util/
H A Dqueue.c49 queue->prev = queue->next = queue;
62 node->next = q;
64 q->prev->next = node;
79 q->next->prev = node;
80 node->next = q->next;
82 q->next = node;
93 if (q == NULL || q->next == q)
97 node = q->next;
99 q->next
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/netatalk-3.0.5/libatalk/util/
H A Dqueue.c49 queue->prev = queue->next = queue;
62 node->next = q;
64 q->prev->next = node;
79 q->next->prev = node;
80 node->next = q->next;
82 q->next = node;
93 if (q == NULL || q->next == q)
97 node = q->next;
99 q->next
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/netatalk-3.0.5/libatalk/util/
H A Dqueue.c49 queue->prev = queue->next = queue;
62 node->next = q;
64 q->prev->next = node;
79 q->next->prev = node;
80 node->next = q->next;
82 q->next = node;
93 if (q == NULL || q->next == q)
97 node = q->next;
99 q->next
[all...]

Completed in 155 milliseconds

1234567891011>>