Searched refs:lo_next (Results 1 – 7 of 7) sorted by relevance
254 (void) strcpy(&AP(dbp)[tlop->lo_next], in find_so()274 (char *)(&AP(dbp)[tlop->lo_next] in find_so()277 [tlop->lo_next], in find_so()292 (void) strcpy(&AP(dbp)[tlop->lo_next], in find_so()341 tlop->lo_next = (long)RELPTR(dbp, calloc(MAXNAMLEN, 1));396 tp = &AP(dbp)[lop->lo_next];
111 long lo_next; /* next one (often relative) */ member
204 need = &TEXTBASE(clmp)[((Lnk_obj *)(need))->lo_next]) { in aout_needed()
562 nlp = tlp->lo_next; in lgrow()563 tlp->lo_next = newtable[hash].lh_chain; in lgrow()612 lp->lo_next = TABLE_BUCKET(lp->lo_vp, li); in lsave()667 ltprev = lt, lt = lt->lo_next) { in freelonode()699 TABLE_BUCKET(lt->lo_vp, li) = lt->lo_next; in freelonode()701 ltprev->lo_next = lt->lo_next; in freelonode()731 lt = lt->lo_next; in lfind()
45 struct lnode *lo_next; /* link for hash chain */ member
53 long lo_next; /* next one (often relative) */ member
176 wsp->walk_addr = (uintptr_t)lwp->lw_lnode->lo_next; in lnode_walk_step()