497 	LIST_FOREACH(lo, &lf_lock_owners[hash].list, lo_link)  in lf_advlockasync()
696 	LIST_FOREACH(lock, &state->ls_active, lf_link) {  in lf_advlockasync()
702 		LIST_FOREACH(lf, &state->ls_active, lf_link) {  in lf_advlockasync()
712 	LIST_FOREACH(lock, &state->ls_pending, lf_link) {  in lf_advlockasync()
900 	LIST_FOREACH(e, &x->lf_outedges, le_outlink)  in lf_add_edge()
978 	LIST_FOREACH(overlap, &state->ls_active, lf_link) {  in lf_add_outgoing()
1013 	LIST_FOREACH(overlap, &state->ls_pending, lf_link) {  in lf_add_outgoing()
1052 	LIST_FOREACH(overlap, &state->ls_pending, lf_link) {  in lf_add_incoming()
1091 	LIST_FOREACH(lf, &state->ls_active, lf_link) {  in lf_insert_lock()
1437 			LIST_FOREACH(e, &lock->lf_outedges, le_outlink) {  in lf_setlock()
1599 	LIST_FOREACH(reallock, &state->ls_pending, lf_link) {  in lf_cancel()
1648 	LIST_FOREACH(overlap, &state->ls_active, lf_link) {  in lf_getblock()
1874 	LIST_FOREACH(ls, &lf_lock_states, ls_link) {  in lf_iteratelocks_sysid()
1876 		LIST_FOREACH(lf, &ls->ls_active, lf_link) {  in lf_iteratelocks_sysid()
1946 	LIST_FOREACH(lf, &ls->ls_active, lf_link) {  in lf_iteratelocks_vnode()
2013 		LIST_FOREACH(lo, &lf_lock_owners[i].list, lo_link)  in lf_countlocks()
2041 	LIST_FOREACH(e, &x->v_outedges, e_outlink) {  in graph_reaches()
2123 		LIST_FOREACH(e, &v->v_outedges, e_outlink) {  in graph_delta_forward()
2164 		LIST_FOREACH(e, &v->v_inedges, e_inlink) {  in graph_delta_backward()
2230 	LIST_FOREACH(e, &x->v_outedges, e_outlink) {  in graph_add_edge()
2366 	LIST_FOREACH(e, &x->v_outedges, e_outlink) {  in graph_remove_edge()
2482 	LIST_FOREACH(ls, &lf_lock_states, ls_link) {  in vfs_report_lockf()
2484 		LIST_FOREACH(lf, &ls->ls_active, lf_link) {  in vfs_report_lockf()
2643 	LIST_FOREACH(lf, &lock->lf_vnode->v_lockf->ls_active, lf_link) {  in lf_printlist()
2651 		LIST_FOREACH(e, &lf->lf_outedges, le_outlink) {  in lf_printlist()