HomeSort by: relevance | last modified time | path
    Searched refs:r_next (Results 1 - 6 of 6) sorted by relevancy

  /src/sys/dev/ic/
dwc_gmac_var.h 89 int r_cur, r_next; member in struct:dwc_gmac_rx_ring
dwc_gmac.c 485 ring->r_cur = ring->r_next = 0;
582 ring->r_cur = ring->r_next = 0;
1694 sc->sc_rxq.r_cur, sc->sc_rxq.r_next);
  /src/sys/net/npf/
npf_ruleset.c 109 npf_rule_t * r_next; member in struct:npf_rule::__anon1::__anon3
257 * WARNING: once rg->subset or target->r_next of an *active*
259 * Must issue a load fence to ensure rl->r_next visibility first.
268 it = it->r_next;
271 atomic_store_relaxed(&rl->r_next, target->r_next);
273 atomic_store_relaxed(&target->r_next, rl);
279 atomic_store_relaxed(&rl->r_next, rg->r_subset);
295 prev->r_next = rl->r_next;
    [all...]
  /src/games/hunt/huntd/
hunt.h 130 REGEN *r_next; member in struct:regen_def
  /src/external/bsd/pcc/dist/pcc/mip/
regs.c 106 struct regw3 *r_next; member in struct:regw3
619 for (; a; a = a->r_next) {
689 x->r_next = u->r_adjList;
697 x->r_next = v->r_adjList;
1753 for (x = ADJLIST(y); x; x = x->r_next) {
1802 for (w = ADJLIST(nodes); w; w = w->r_next) {
1851 for (; l; l = l->r_next) {
1878 for (w = ADJLIST(t); w; w = w->r_next) {
1907 for (w = ADJLIST(v); w; w = w->r_next) {
1936 for (w = ADJLIST(u); w; w = w->r_next) {
    [all...]
  /src/sbin/ifconfig/
parse.h 226 SIMPLEQ_ENTRY(intrange) r_next; member in struct:intrange

Completed in 27 milliseconds