Lines Matching refs:t
51 struct llist_node *r, *t, **ep; in lwq_dequeue_all() local
59 t = llist_del_all(&q->new); in lwq_dequeue_all()
64 *ep = llist_reverse_order(t); in lwq_dequeue_all()
86 struct tnode *t; in lwq_exercise() local
89 wait_var_event(q, (t = lwq_dequeue(q, struct tnode, n)) != NULL); in lwq_exercise()
90 t->c++; in lwq_exercise()
91 if (lwq_enqueue(&t->n, q)) in lwq_exercise()
104 struct tnode *t; in lwq_test() local
113 t = kmalloc(sizeof(*t), GFP_KERNEL); in lwq_test()
114 if (!t) in lwq_test()
116 t->i = i; in lwq_test()
117 t->c = 0; in lwq_test()
118 if (lwq_enqueue(&t->n, &q)) in lwq_test()
131 t = lwq_dequeue(&q, struct tnode, n); in lwq_test()
132 if (t) in lwq_test()
133 printk(KERN_CONT " %d(%d)", t->i, t->c); in lwq_test()
134 kfree(t); in lwq_test()
139 lwq_for_each_safe(t, t1, t2, &l, n) { in lwq_test()
140 if ((t->i % 3) == 0) { in lwq_test()
141 t->i = -1; in lwq_test()
142 kfree(t); in lwq_test()
143 t = NULL; in lwq_test()
149 while ((t = lwq_dequeue(&q, struct tnode, n)) != NULL) { in lwq_test()
150 printk(KERN_CONT " %d", t->i); in lwq_test()
151 kfree(t); in lwq_test()