Searched refs:prev (Results 51 - 75 of 89) sorted by relevance

1234

/haiku/src/add-ons/kernel/generic/scsi_periph/
H A Dscsi_periph_int.h57 struct scsi_periph_handle_info *next, *prev; member in struct:scsi_periph_handle_info
/haiku/src/system/boot/platform/riscv/
H A Dmmu.cpp332 MemoryRegion* prev = NULL; local
335 prev = region;
344 if (prev == NULL)
347 prev->next = region->next;
/haiku/src/add-ons/kernel/file_systems/nfs4/
H A DInode.cpp785 LockInfo* prev = NULL; local
796 state->RemoveLock(linfo, prev);
800 prev = linfo;
804 prev = NULL;
808 cookie->RemoveLock(linfo, prev);
812 prev = linfo;
844 LockInfo* prev = NULL; local
848 state->RemoveLock(stateLock, prev);
852 prev = stateLock;
/haiku/src/system/libroot/posix/malloc_debug/
H A Dguarded_heap.cpp87 list_link* prev; member in struct:list_link
101 link->next->prev = link->prev;
102 link->prev->next = link->next;
112 link->prev = list->link.prev;
114 list->link.prev->next = link;
115 list->link.prev = link;
140 list->link.next = list->link.prev = &list->link;
/haiku/src/add-ons/kernel/busses/usb/
H A Dehci_hardware.h141 struct ehci_itd *prev; member in struct:ehci_itd
193 struct ehci_sitd *prev; member in struct:ehci_sitd
H A Dehci.cpp2152 " prev (%p/0x%" B_PRIx32 ") at frame %" B_PRId32 "\n", itd,
2153 itd->this_phy, itd->prev, itd->prev != NULL
2154 ? itd->prev->this_phy : 0, currentFrame);
2160 while (!(itd->next_phy & EHCI_ITEM_TERMINATE) && itd->prev != NULL) {
2211 itd = itd->prev;
2227 itd = itd->prev;
2745 itd->prev = last;
2758 sitd->prev = last;
2768 itd->prev
[all...]
/haiku/src/add-ons/kernel/partitioning_systems/common/
H A DPartitionMap.cpp606 LogicalPartition* prev = partition->Previous();
609 if (prev)
610 prev->SetNext(next);
614 next->SetPrevious(prev);
616 fTail = prev;
/haiku/src/add-ons/kernel/drivers/network/ether/ipro1000/dev/e1000/
H A Dem_txrx.c436 qidx_t cur, prev, ntxd, rs_cidx; local
456 prev = txr->tx_cidx_processed;
459 MPASS(prev != cur);
460 delta = (int32_t)cur - (int32_t)prev;
466 __FUNCTION__, prev, cur, clear, delta);
469 prev = cur;
479 txr->tx_cidx_processed = prev;
/haiku/src/add-ons/kernel/debugger/laplinkll/
H A Dlaplinkll.cpp403 int i, prev = 0; local
408 if ((*buf == '\n') && (prev != '\r'))
411 prev = *buf;
/haiku/src/libs/glut/
H A DglutWindow.cpp262 GlutWindow **prev = &parent->children; local
266 *prev = cur->siblings;
269 prev = &(cur->siblings);
/haiku/src/system/kernel/debug/
H A Ddebug_commands.cpp541 struct debugger_command *prev = NULL; local
551 prev = cmd;
559 prev->next = cmd->next;
/haiku/src/libs/agg/src/
H A Dagg_vcgen_smooth_poly1.cpp156 calculate(m_src_vertices.prev(m_src_vertex),
/haiku/src/add-ons/kernel/drivers/bluetooth/h2/h2generic/
H A Dsnet_buffer.cpp248 kprintf("item=%p\tprev=%p\tnext=%p\tallocated=%d\n", snb, snb->link.prev,
/haiku/src/add-ons/kernel/drivers/disk/virtual/nbd/
H A Dnbd.c241 struct nbd_request_entry *r, *prev; local
244 prev = NULL;
246 prev = r;
252 if (prev)
253 prev->next = r->next;
/haiku/src/system/libroot/posix/glibc/extensions/
H A Dobstack.h161 struct _obstack_chunk *prev; /* address of prior chunk or NULL */
394 (__o->chunk->prev == 0 && __o->next_free - __o->chunk->contents == 0); })
514 ((h)->chunk->prev == 0 && (h)->next_free - (h)->chunk->contents == 0)
160 struct _obstack_chunk *prev; /* address of prior chunk or NULL */ member in struct:_obstack_chunk
/haiku/headers/os/drivers/bus/
H A DSCSI.h112 struct scsi_ccb *next, *prev; // internal member in struct:scsi_ccb
/haiku/src/add-ons/kernel/partitioning_systems/session/
H A DDisc.cpp386 list_item* prev = NULL; local
400 if (prev) {
402 prev->next = next;
421 prev = item;
/haiku/headers/private/runtime_loader/
H A Druntime_loader.h98 struct image_t *prev; member in struct:image_t
/haiku/src/add-ons/kernel/drivers/network/wlan/marvell88w8335/dev/malo/
H A Dif_malo.c1409 struct malo_rxbuf *bf, *prev; local
1417 prev = NULL;
1426 if (prev != NULL) {
1427 ds = prev->bf_desc;
1430 prev = bf;
1432 if (prev != NULL) {
1433 ds = prev->bf_desc;
/haiku/src/add-ons/kernel/drivers/network/ether/3com/dev/xl/
H A Dif_xl.c2478 struct xl_chain *prev = NULL, *cur_tx = NULL, *start_tx; local
2527 if (prev != NULL) {
2528 prev->xl_next = cur_tx;
2529 prev->xl_ptr->xl_next = htole32(cur_tx->xl_phys);
2531 prev = cur_tx;
2610 struct xl_chain *prev = NULL, *cur_tx = NULL, *start_tx; local
2649 if (prev != NULL)
2650 prev->xl_ptr->xl_next = htole32(cur_tx->xl_phys);
2651 prev = cur_tx;
/haiku/src/add-ons/kernel/bus_managers/firewire/
H A Dfwohci.cpp1588 struct fw_bulkxfer *first, *chunk, *prev; local
1611 prev = STAILQ_LAST(&it->stdma, fw_bulkxfer, link);
1618 if (prev != NULL) {
1619 db = ((struct fwohcidb_tr *)(prev->end))->db;
1635 prev = chunk;
1709 struct fw_bulkxfer *first, *prev, *chunk; local
1741 prev = STAILQ_LAST(&ir->stdma, fw_bulkxfer, link);
1760 if (prev != NULL) {
1761 db = ((struct fwohcidb_tr *)(prev->end))->db;
1766 prev
2332 struct fwohcidb *curr = NULL, *prev, *next = NULL; local
[all...]
/haiku/src/add-ons/kernel/partitioning_systems/intel/
H A Dwrite_support.cpp1941 LogicalPartition* prev = logical->Previous(); local
1942 error = prev ? writer.WriteLogical(prev, primary, false)
2046 // TODO: If partition->offset is > prev->offset, then writing
2054 LogicalPartition* prev = logical->Previous();
2055 error = prev ? writer.WriteLogical(prev, primary, false)
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dcompress.c95 s16 prev[NTFS_SB_SIZE]; member in struct:COMPRESS_CONTEXT
154 s16 * const prev = pctx->prev; local
170 prev[i] = cur_match;
182 cur_match = prev[cur_match])
257 pctx->prev[i] = pctx->head[hash];
/haiku/src/bin/network/telnet/
H A Dcommands.c1615 struct env_lst *prev; /* pointer to previous structure */
1697 ep->prev = &envlisthead;
1699 ep->next->prev = ep;
1714 ep->prev->next = ep->next;
1716 ep->next->prev = ep->prev;
1607 struct env_lst *prev; /* pointer to previous structure */ member in struct:env_lst
/haiku/src/libs/compat/freebsd_network/
H A Dfbsd_uipc_mbuf.c1346 struct mbuf *m, *n, *n2, **prev; local
1384 prev = &m0->m_next; /* NB: not the first mbuf */
1385 while ((n = *prev) != NULL) {
1396 *prev = m;
1407 prev = &n->m_next;

Completed in 163 milliseconds

1234