rbhead            837 dev/ic/i82596.c 	*start = rbindex = sc->rbhead;
rbhead            901 dev/ic/i82596.c 	sc->rbhead = end;
rbhead           1627 dev/ic/i82596.c 	sc->rbhead = 0;
rbhead           1829 dev/ic/i82596.c 			       IE_RBD_ADDR(sc->rbds, sc->rbhead));
rbhead            254 dev/ic/i82596var.h 	int	rbhead, rbtail;
rbhead            237 dev/isa/if_ie.c 	int rfhead, rftail, rbhead, rbtail;
rbhead           1158 dev/isa/if_ie.c 	int head = sc->rbhead;
rbhead           1162 dev/isa/if_ie.c 		if (!(sc->rbuffs[sc->rbhead]->ie_rbd_actual & IE_RBD_USED))
rbhead           1246 dev/isa/if_ie.c 	head = sc->rbhead;
rbhead           1431 dev/isa/if_ie.c 		if (!(sc->rbuffs[sc->rbhead]->ie_rbd_actual & IE_RBD_USED)) {
rbhead           1433 dev/isa/if_ie.c 			print_rbd(sc->rbuffs[sc->rbhead]);
rbhead           1436 dev/isa/if_ie.c 			    sc->sc_dev.dv_xname, sc->rbhead);
rbhead           1441 dev/isa/if_ie.c 		i = sc->rbuffs[sc->rbhead]->ie_rbd_actual & IE_RBD_LAST;
rbhead           1443 dev/isa/if_ie.c 		sc->rbuffs[sc->rbhead]->ie_rbd_length |= IE_RBD_LAST;
rbhead           1444 dev/isa/if_ie.c 		sc->rbuffs[sc->rbhead]->ie_rbd_actual = 0;
rbhead           1445 dev/isa/if_ie.c 		sc->rbhead = (sc->rbhead + 1) % NRXBUF;
rbhead           1953 dev/isa/if_ie.c 	sc->rbhead = 0;
rbhead            294 uvm/uvm_map.c  	tmp = RB_INSERT(uvm_tree, &(map)->rbhead, entry);
rbhead            310 uvm/uvm_map.c  	RB_REMOVE(uvm_tree, &(map)->rbhead, entry);
rbhead            330 uvm/uvm_map.c  	RB_FOREACH(tmp, uvm_tree, &map->rbhead) {
rbhead            340 uvm/uvm_map.c  	RB_FOREACH(tmp, uvm_tree, &map->rbhead) {
rbhead            364 uvm/uvm_map.c  		trtmp = RB_FIND(uvm_tree, &map->rbhead, tmp);
rbhead           1013 uvm/uvm_map.c  		cur = RB_ROOT(&map->rbhead);
rbhead           1224 uvm/uvm_map.c  	tmp = RB_ROOT(&map->rbhead);
rbhead            217 uvm/uvm_map.h  	RB_HEAD(uvm_tree, vm_map_entry) rbhead;	/* Tree for entries */
rbhead            114 uvm/uvm_map_i.h 	RB_INIT(&map->rbhead);