Searched refs:next (Results 1 - 24 of 24) sorted by relevance

/broadcom-cfe-1.4.2/cfe/lib/
H A Dlib_malloc.c75 struct memnode_s *next; /* pointer to next node */ member in struct:memnode_s
120 pool->root->next = NULL;
181 for (m = pool->root; m; m = m->next) {
194 * block and the next one are free, combine them
197 if (m->next &&
199 (m->next->status == memnode_free)) {
200 m->length += sizeof(memnode_t) + m->next->length;
201 m->next->seal = 0;
202 m->next
[all...]
/broadcom-cfe-1.4.2/cfe/arch/mips/cpu/bcm1480/src/
H A Dbcm1480_irq.c187 irq_action_t *next; member in struct:irq_action_s
376 action->next = NULL;
403 while (p->next != NULL) {
404 p = p->next;
406 p->next = action;
438 desc->actions = p->next;
443 q->next = p->next;
448 p = p->next;
470 for (action = desc->actions; action != NULL; action = action->next) {
[all...]
/broadcom-cfe-1.4.2/cfe/arch/mips/cpu/bcmcore/src/
H A Dbcmcore_irq.c95 irq_action_t *next; member in struct:irq_action_s
137 for (action = desc->actions; action != NULL; action = action->next) {
388 action->next = NULL;
410 while (p->next != NULL) {
411 p = p->next;
413 p->next = action;
444 desc->actions = p->next;
451 q->next = p->next;
456 p = p->next;
[all...]
/broadcom-cfe-1.4.2/cfe/arch/mips/cpu/sb1250/src/
H A Dsb1250_irq.c175 irq_action_t *next; member in struct:irq_action_s
338 action->next = NULL;
362 while (p->next != NULL) {
363 p = p->next;
365 p->next = action;
397 desc->actions = p->next;
402 q->next = p->next;
407 p = p->next;
429 for (action = desc->actions; action != NULL; action = action->next) {
[all...]
/broadcom-cfe-1.4.2/cfe/main/
H A Dbcmnvram.c64 struct nvram_tuple_s *next; member in struct:nvram_tuple_s
183 for (p = hashtab[hash]; p != NULL; p = p->next) {
193 tuple->next = hashtab[hash];
203 for (p = hashtab[hash]; p != NULL; p = p->next) {
206 hashtab[hash] = p->next;
208 prev->next = p->next;
339 for (p = hashtab[i]; p != NULL; p = p->next) {
382 p->next = nv_pending;
403 p->next
[all...]
H A Dcfe.mk269 # Vendor extensions come next - they live in their own directory.
/broadcom-cfe-1.4.2/cfe/pci/
H A Dpciconf.c129 pcireg_t next; member in struct:pcirange
870 address = (pciioaddr.next + (size - 1)) & ~(size - 1);
872 if (address < pciioaddr.next || address + size > pciioaddr.limit)
874 pciioaddr.next = address + size;
895 pciioaddr.next = pci_align_io_addr(pciioaddr.next);
901 pb->min_io_addr = pciioaddr.next;
902 pciioaddr.next += (1 << 12);
903 pb->max_io_addr = pciioaddr.next - 1;
949 pciioaddr.next
[all...]
/broadcom-cfe-1.4.2/cfe/arch/mips/common/src/
H A Ddev_flash_all.S187 * next byte...
190 add a0,1 # next source byte
191 add secptr,1 # next dest byte
H A Dexception.S203 ADD t0,4 # next word...
230 ADD t0,4 # next word...
H A Ddev_flashop_engine.S435 /* next byte... */
437 add reg_src,1 # next source byte
438 ADDPTR reg_dest,1 # next dest byte
475 /* next word... */
477 add reg_src,2 # next source word
478 ADDPTR reg_dest,2 # next dest word
514 /* next byte... */
516 add reg_src,1 # next source word
517 ADDPTR reg_dest,1 # next dest word
777 ADD a0,FEINST_SIZE /* advance to next inst
[all...]
H A Dinit_mips.S686 33: add v0,8 # Advance to next entry
730 add REG_PLTGOT,4 # next GOT entry
731 add v0,16 # next SYM entry
/broadcom-cfe-1.4.2/cfe/ui/
H A Dui_command.c193 * Eat the next switch description from the valid string
237 * Otherwise, next!
278 ui_token_t *next; local
300 next = (ui_token_t *) t->qb.q_next;
301 if (next->token == '=') { /* switch has value */
/broadcom-cfe-1.4.2/cfe/arch/mips/chipset/sibyte/src/
H A Ddev_sb1250_ethernet.c158 sbdmadscr_t *sbdma_addptr; /* next dscr for sw to add */
159 sbdmadscr_t *sbdma_remptr; /* next dscr for sw to remove */
166 struct sbeth_pkt_s *next; member in struct:sbeth_pkt_s
382 * Synchronize ourselves so that the PHY knows the next
771 * .. and advance to the next buffer.
812 * figure out if the ring is full - if the next descriptor
857 * point at next packet
927 s->sbe_freelist = pkt->next;
928 pkt->next = NULL;
955 pkt->next
[all...]
H A Dui_pmcmds.c315 struct packet_s *next; member in struct:packet_s
366 pkt->next = pm_pkt_pool;
375 pm_pkt_pool = pkt->next;
/broadcom-cfe-1.4.2/cfe/dev/
H A Ddev_aic6915.c104 queue_t next; /* 16 */ member in struct:eth_pkt_s
112 queue_t next; /* 8 */ member in struct:eth_pkt_s
426 dumpseq(aic_ether_t *sc, int start, int next) argument
430 int lines = (((next - start)/4 + 1) + 3)/columns;
437 if (offset + j*step < next)
489 q_enqueue(&sc->freelist, &pkt->next);
580 q_enqueue(&sc->rxqueue, &pkt->next);
H A Ddev_rtl8139.c106 queue_t next; /* 8 */ member in struct:eth_pkt_s
285 q_enqueue(&sc->freelist, &pkt->next);
340 q_enqueue(&sc->rxqueue, &pkt->next);
H A Ddev_bcm5700.c173 queue_t next; /* 8 */ member in struct:eth_pkt_s
560 dumpseq(t3_ether_t *sc, int start, int next) argument
564 int lines = (((next - start)/4 + 1) + 3)/columns;
571 if (offset + j*step < next)
626 q_enqueue(&sc->freelist, &pkt->next);
723 q_enqueue(&sc->rxqueue, &pkt->next);
H A Ddev_bcm4401.c120 queue_t next; /* 8 */ member in struct:eth_pkt_s
202 volatile rx_dscr *rxdscr_add; /* next place to put a buffer */
208 volatile tx_dscr *txdscr_add; /* next place to put a buffer */
342 q_enqueue(&sc->freelist, &pkt->next);
389 /* If the next one is the same as our remove pointer, the ring is
439 q_enqueue(&sc->rxqueue, &pkt->next);
530 /* If the next one is the same as our remove pointer, the ring is
876 local buffer so that the next access will succeed. */
H A Ddev_i82559.c162 queue_t next; /* 8 */ member in struct:eth_pkt_s
393 q_enqueue(&sc->freelist, &pkt->next);
509 q_enqueue(&sc->rxqueue, &pkt->next);
H A Ddev_dp83815.c112 queue_t next; /* 8 */ member in struct:eth_pkt_s
205 volatile rx_dscr *rxdscr_remove; /* next one we expect DMA to use */
206 volatile rx_dscr *rxdscr_add; /* next place to put a buffer */
211 volatile tx_dscr *txdscr_remove; /* next one we will use for tx */
212 volatile tx_dscr *txdscr_add; /* next place to put a buffer */
348 q_enqueue(&sc->freelist, &pkt->next);
403 /* Figure out where the next descriptor will go */
409 /* If the next one is the same as our remove pointer, the ring is
472 q_enqueue(&sc->rxqueue, &pkt->next);
541 /* Figure out where the next descripto
[all...]
H A Ddev_tulip.c126 queue_t next; /* 8 */ member in struct:eth_pkt_s
236 volatile rx_dscr *rxdscr_remove; /* next one we expect tulip to use */
237 volatile rx_dscr *rxdscr_add; /* next place to put a buffer */
242 volatile tx_dscr *txdscr_remove; /* next one we will use for tx */
243 volatile tx_dscr *txdscr_add; /* next place to put a buffer */
390 q_enqueue(&sc->freelist, &pkt->next);
446 /* Figure out where the next descriptor will go */
453 /* If the next one is the same as our remove pointer, the ring is
518 q_enqueue(&sc->rxqueue, &pkt->next);
585 /* Figure out where the next descripto
[all...]
/broadcom-cfe-1.4.2/cfe/verif/
H A Dvapi.S681 add t1,8 # next destination addr
688 add t1,8 # next destination addr
691 3: add t2,8 # next reg from table
/broadcom-cfe-1.4.2/cfe/arch/mips/chipset/bcmsb/src/
H A Ddev_sb_mac.c150 queue_t next; /* 8 */ member in struct:eth_pkt_s
238 volatile rx_dscr *rxdscr_add; /* next place to put a buffer */
244 volatile tx_dscr *txdscr_add; /* next place to put a buffer */
403 q_enqueue(&sc->freelist, &pkt->next);
449 /* If the next one is the same as our remove pointer, the ring is
500 q_enqueue(&sc->rxqueue, &pkt->next);
585 /* If the next one is the same as our remove pointer, the ring is
1017 local buffer so that the next access will succeed. */
/broadcom-cfe-1.4.2/cfe/arch/ppc/chipset/mpc824x/src/
H A Ddev_tulip.c132 queue_t next; /* 8 */ member in struct:eth_pkt_s
259 volatile rx_dscr *rxdscr_remove; /* next one we expect tulip to use */
260 volatile rx_dscr *rxdscr_add; /* next place to put a buffer */
265 volatile tx_dscr *txdscr_remove; /* next one we will use for tx */
266 volatile tx_dscr *txdscr_add; /* next place to put a buffer */
456 q_enqueue(&sc->freelist, &pkt->next);
513 /* Figure out where the next descriptor will go */
520 /* If the next one is the same as our remove pointer, the ring is
584 q_enqueue(&sc->rxqueue, &pkt->next);
653 /* Figure out where the next descripto
[all...]

Completed in 183 milliseconds