toss             7672 drivers/net/wireless/broadcom/brcm80211/brcmsmac/main.c 			goto toss;
toss             7682 drivers/net/wireless/broadcom/brcm80211/brcmsmac/main.c 			goto toss;
toss             7687 drivers/net/wireless/broadcom/brcm80211/brcmsmac/main.c 		goto toss;
toss             7692 drivers/net/wireless/broadcom/brcm80211/brcmsmac/main.c 		goto toss;
toss             7697 drivers/net/wireless/broadcom/brcm80211/brcmsmac/main.c  toss:
toss              428 fs/dlm/debug_fs.c 	int toss = (seq->op == &format4_seq_ops);
toss              450 fs/dlm/debug_fs.c 	tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep;
toss              482 fs/dlm/debug_fs.c 		tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep;
toss              508 fs/dlm/debug_fs.c 	int toss = (seq->op == &format4_seq_ops);
toss              547 fs/dlm/debug_fs.c 		tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep;
toss              210 fs/dlm/dir.c   		rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[bucket].toss,
toss              110 fs/dlm/dlm_internal.h 	struct rb_root		toss;
toss              608 fs/dlm/lock.c  	error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r);
toss              648 fs/dlm/lock.c  	rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[b].toss);
toss              752 fs/dlm/lock.c  	error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r);
toss              783 fs/dlm/lock.c  	rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[b].toss);
toss              958 fs/dlm/lock.c  	error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r);
toss             1066 fs/dlm/lock.c  	error = rsb_insert(r, &ls->ls_rsbtbl[b].toss);
toss             1114 fs/dlm/lock.c  	error = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r);
toss             1131 fs/dlm/lock.c  	rsb_insert(r, &ls->ls_rsbtbl[r->res_bucket].toss);
toss             1667 fs/dlm/lock.c  	for (n = rb_first(&ls->ls_rsbtbl[b].toss); n; n = next) {
toss             1712 fs/dlm/lock.c  		rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[b].toss);
toss             1741 fs/dlm/lock.c  		rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r);
toss             1779 fs/dlm/lock.c  		rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[b].toss);
toss             4041 fs/dlm/lock.c  	rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r);
toss             4427 fs/dlm/lock.c  	rv = dlm_search_rsb_tree(&ls->ls_rsbtbl[b].toss, name, len, &r);
toss             4463 fs/dlm/lock.c  		rb_erase(&r->res_hashnode, &ls->ls_rsbtbl[b].toss);
toss              524 fs/dlm/lockspace.c 		ls->ls_rsbtbl[i].toss.rb_node = NULL;
toss              828 fs/dlm/lockspace.c 		while ((n = rb_first(&ls->ls_rsbtbl[i].toss))) {
toss              830 fs/dlm/lockspace.c 			rb_erase(n, &ls->ls_rsbtbl[i].toss);
toss              914 fs/dlm/recover.c 		if (!RB_EMPTY_ROOT(&ls->ls_rsbtbl[i].toss))
toss              944 fs/dlm/recover.c 		for (n = rb_first(&ls->ls_rsbtbl[i].toss); n; n = next) {
toss              947 fs/dlm/recover.c 			rb_erase(n, &ls->ls_rsbtbl[i].toss);