Searched refs:next (Results 501 - 525 of 4898) sorted by relevance

<<21222324252627282930>>

/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/frv/mm/
H A Dpgalloc.c97 struct page *next, **pprev, *page = virt_to_page(pgd); local
98 next = (struct page *) page->index;
100 *pprev = next;
101 if (next)
102 set_page_private(next, (unsigned long) pprev);
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zebra/lib/
H A Dtable.c424 /* Unlock current node and lock next node then return it. */
428 struct route_node *next;
432 next node's pointer. */
436 next = node->l_left;
437 route_lock_node (next);
439 return next;
443 next = node->l_right;
444 route_lock_node (next);
446 return next;
454 next
427 struct route_node *next; local
468 struct route_node *next; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/arm/nwfpe/
H A Dentry.S62 the next instruction. If it is a floating point instruction, it
87 @ if condition code failed to match, next insn
88 beq next @ get the next instruction;
95 next: label
96 .Lx1: ldrt r6, [r5], #4 @ get the next instruction and
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gettext-tools/gnulib-lib/glib/
H A Dghash.c56 GHashNode *next; member in struct:_GHashNode
255 node = &(*node)->next;
258 node = &(*node)->next;
452 (*node) = dest->next;
520 (*node) = dest->next;
623 for (node = hash_table->nodes[i]; node; prev = node, node = node->next)
633 prev->next = node->next;
641 hash_table->nodes[i] = node->next;
681 for (node = hash_table->nodes[i]; node; node = node->next)
743 GHashNode *next; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/util-linux/
H A Dumount.c36 struct mtab_list *next; member in struct:mtab_list
69 m->next = mtl;
92 // Get next command line argument (and look it up in mtab list)
97 for (m = mtl; m; m = m->next)
135 // Find next matching mtab entry for -a or umount /dev
138 while (m && (m = m->next))
147 m = mtl->next;
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/samba-3.0.25b/source/nmbd/
H A Dnmbd_workgroupdb.c98 for (w = subrec->workgrouplist; w && t == -1; w = w->next) {
138 ret_work = work->next;
144 work->prev->next = work->next;
145 if (work->next)
146 work->next->prev = work->prev;
149 subrec->workgrouplist = work->next;
175 for (ret = subrec->workgrouplist; ret; ret = ret->next) {
288 for (work = subrec->workgrouplist; work; work = work->next) {
293 for (servrec = work->serverlist; servrec; servrec = servrec->next) {
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/samba-3.0.25b/source/tdb/tools/
H A Dtdbtorture.c109 goto next;
116 goto next;
123 goto next;
130 goto next;
137 goto next;
146 goto next;
155 goto next;
168 goto next;
175 goto next;
182 goto next;
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/dhcp6/
H A Ddhcp6r.c117 ci->next = cifaces_list.next;
118 cifaces_list.next = ci;
140 si->next = sifaces_list.next;
141 sifaces_list.next = si;
172 unia->next = IPv6_uniaddr_list.next;
173 IPv6_uniaddr_list.next = unia;
215 sa->next
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/mtd/
H A Dredboot.c46 struct fis_list *next; member in struct:fis_list
211 prev = &(*prev)->next;
212 new_fl->next = *prev;
223 for (tmp_fl = fl; tmp_fl->next; tmp_fl = tmp_fl->next) {
224 if (tmp_fl->img->flash_base + tmp_fl->img->size + master->erasesize <= tmp_fl->next->img->flash_base) {
271 if(fl->next && fl->img->flash_base + fl->img->size + master->erasesize <= fl->next->img->flash_base) {
274 parts[i].size = fl->next->img->flash_base - parts[i].offset;
279 fl = fl->next;
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/pci/
H A Dbus.c270 struct list_head *next; local
275 next = top->devices.next;
277 if (next == &bus->devices) {
281 next = bus->self->bus_list.next;
285 dev = list_entry(next, struct pci_dev, bus_list);
287 /* this is a pci-pci bridge, do its devices next */
288 next = dev->subordinate->devices.next;
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/usb/host/
H A Dfhci-q.c79 td = list_entry(ed->td_list.next, struct td, node);
91 td = list_entry(frame->tds_list.next, struct td, frame_lh);
92 list_del_init(frame->tds_list.next);
104 td = list_entry(frame->tds_list.next, struct td, frame_lh);
116 td = list_entry(ed->td_list.next, struct td, node);
117 list_del_init(ed->td_list.next);
119 /* if this TD was the ED's head, find next TD */
121 ed->td_head = list_entry(ed->td_list.next, struct td,
136 td = list_entry(p_list->done_list.next, struct td, node);
137 list_del_init(p_list->done_list.next);
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/security/selinux/ss/
H A Dsidtab.c48 cur = cur->next;
69 newnode->next = prev->next;
71 prev->next = newnode;
73 newnode->next = s->htable[hvalue];
96 cur = cur->next;
107 cur = cur->next;
143 cur = cur->next;
161 cur = cur->next;
222 cur = cur->next;
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/xz/src/liblzma/common/
H A Dindex_decoder.c264 index_decoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument
267 lzma_next_coder_init(&index_decoder_init, next, allocator);
272 if (next->coder == NULL) {
273 next->coder = lzma_alloc(sizeof(lzma_coder), allocator);
274 if (next->coder == NULL)
277 next->code = &index_decode;
278 next->end = &index_decoder_end;
279 next->memconfig = &index_decoder_memconfig;
280 next->coder->index = NULL;
282 lzma_index_end(next
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/router/dhcp6/
H A Ddhcp6r.c117 ci->next = cifaces_list.next;
118 cifaces_list.next = ci;
140 si->next = sifaces_list.next;
141 sifaces_list.next = si;
172 unia->next = IPv6_uniaddr_list.next;
173 IPv6_uniaddr_list.next = unia;
215 sa->next
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/tools/misc/xz/src/liblzma/common/
H A Dindex_decoder.c264 index_decoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument
267 lzma_next_coder_init(&index_decoder_init, next, allocator);
272 if (next->coder == NULL) {
273 next->coder = lzma_alloc(sizeof(lzma_coder), allocator);
274 if (next->coder == NULL)
277 next->code = &index_decode;
278 next->end = &index_decoder_end;
279 next->memconfig = &index_decoder_memconfig;
280 next->coder->index = NULL;
282 lzma_index_end(next
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iproute2/ip/
H A Dipmroute.c124 char *next = NULL; local
131 next = strchr(p, ' ');
132 if (next) {
133 *next = 0;
134 next++;
137 p = next;
140 p = next;
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iproute2/lib/
H A Dll_map.c31 struct idxmap * next; member in struct:idxmap
64 for (imp=&idxmap[h]; (im=*imp)!=NULL; imp = &im->next)
72 im->next = *imp;
99 for (im = idxmap[idx&0xF]; im; im = im->next)
120 for (im = idxmap[idx&0xF]; im; im = im->next)
133 for (im = idxmap[idx&0xF]; im; im = im->next)
151 for (im = idxmap[i]; im; im = im->next) {
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iproute2/misc/
H A Difstat.c55 struct ifstat_ent *next; member in struct:ifstat_ent
112 n->next = kern_db;
142 db = db->next;
143 n->next = kern_db;
156 char *next; local
175 if (!(next = strchr(p, ' ')))
177 *next++ = 0;
180 p = next;
184 if (!(next = strchr(p, ' ')))
186 *next
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iproute2/tc/
H A Dm_ematch.h18 struct bstr *next; member in struct:bstr
99 return b->next;
110 struct ematch *next; member in struct:ematch
130 for (t = tree; t; t = t->next) {
140 for (b = t->args; b; b = b->next)
141 printf("%s%s", b->data, b->next ? " " : "");
159 struct ematch_util *next; member in struct:ematch_util
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/build_vxworks/test_micro/
H A Db_workload.h62 struct bench_qentry *next; member in struct:bench_qentry
76 queue.tail->next = entry; \
85 if (queue.head->next == NULL) \
88 queue.head = queue.head->next; \
102 if (queue.head->next == NULL) \
105 queue.head = queue.head->next; \
110 queue.tail->next = popped; \
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/dbinc_auto/
H A Ddb_auto.h58 db_pgno_t next; member in struct:___db_relink_42_args
95 db_pgno_t next; member in struct:___db_pg_alloc_42_args
109 db_pgno_t next; member in struct:___db_pg_alloc_args
123 db_pgno_t next; member in struct:___db_pg_free_42_args
136 db_pgno_t next; member in struct:___db_pg_free_args
157 db_pgno_t next; member in struct:___db_pg_freedata_42_args
171 db_pgno_t next; member in struct:___db_pg_freedata_args
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/isdn/hysdn/
H A Dhysdn_init.c115 card->next = NULL; /*end of chain */
117 card_last->next = card; /* pointer to next card */
149 card_root = card_root->next;
155 if (tmp->next == card)
156 tmp->next = card->next;
158 tmp = tmp->next;
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/nilfs2/
H A Dsegbuf.h42 * @next: Block number of the next full segment
54 sector_t next; member in struct:nilfs_segsum_info
63 * @sb_nextnum: Index number of the next full segment
100 #define NILFS_NEXT_SEGBUF(segbuf) NILFS_LIST_SEGBUF((segbuf)->sb_list.next)
103 #define NILFS_FIRST_SEGBUF(head) NILFS_LIST_SEGBUF((head)->next)
104 #define NILFS_SEGBUF_IS_LAST(segbuf, head) ((segbuf)->sb_list.next == (head))
111 (list_entry((head)->next, struct buffer_head, b_assoc_buffers))
113 (list_entry((bh)->b_assoc_buffers.next, struct buffer_head, \
115 #define NILFS_SEGBUF_BH_IS_LAST(bh, head) ((bh)->b_assoc_buffers.next
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/test_micro/source/
H A Db_workload.h62 struct bench_qentry *next; member in struct:bench_qentry
76 queue.tail->next = entry; \
85 if (queue.head->next == NULL) \
88 queue.head = queue.head->next; \
102 if (queue.head->next == NULL) \
105 queue.head = queue.head->next; \
110 queue.tail->next = popped; \
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/zlib-1.2.3/contrib/infback9/
H A Dinftree9.c27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
145 filled is at next and has curr index bits. The code being used is huff
198 next = *table; /* current table to fill in */
231 next[(huff >> drop) + fill] = this;
245 /* go to next symbol, update count, len */
259 next += 1U << curr;
261 /* determine length of next table */
280 (*table)[low].val = (unsigned short)(next
[all...]

Completed in 327 milliseconds

<<21222324252627282930>>