50 	struct nvkm_fifo_chan *chan = *pchan;  in nvkm_fifo_chan_put()  local
51 	if (likely(chan)) {  in nvkm_fifo_chan_put()
60 	struct nvkm_fifo_chan *chan;  in nvkm_fifo_chan_inst()  local
63 	list_for_each_entry(chan, &fifo->chan, head) {  in nvkm_fifo_chan_inst()
64 		if (chan->inst->addr == inst) {  in nvkm_fifo_chan_inst()
65 			list_del(&chan->head);  in nvkm_fifo_chan_inst()
66 			list_add(&chan->head, &fifo->chan);  in nvkm_fifo_chan_inst()
68 			return chan;  in nvkm_fifo_chan_inst()
78 	struct nvkm_fifo_chan *chan;  in nvkm_fifo_chan_chid()  local
81 	list_for_each_entry(chan, &fifo->chan, head) {  in nvkm_fifo_chan_chid()
82 		if (chan->chid == chid) {  in nvkm_fifo_chan_chid()
83 			list_del(&chan->head);  in nvkm_fifo_chan_chid()
84 			list_add(&chan->head, &fifo->chan);  in nvkm_fifo_chan_chid()
86 			return chan;  in nvkm_fifo_chan_chid()
181 	while ((sclass = fifo->func->chan[c])) {  in nvkm_fifo_class_get()
255 	INIT_LIST_HEAD(&fifo->chan);  in nvkm_fifo_ctor()