Lines Matching refs:threads
22 * (proc->threads, proc->waiting_threads, proc->nodes)
508 /* (e)poll-based threads require an explicit wakeup signal when
510 * messages without I/O block. Without it, threads risk waiting
620 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {
669 * will wake up threads that have called poll().
692 * 1. All threads are busy handling transactions
693 * In that case, one of those threads should call back into
698 * over all threads not handling transaction work, and
1504 * by threads that are being released. When done with the binder_proc,
1506 * proc if appropriate (proc has been released, all threads have
1513 if (proc->is_dead && RB_EMPTY_ROOT(&proc->threads) &&
4611 * node to serialize with other threads that
4933 struct rb_node **p = &proc->threads.rb_node;
4956 rb_insert_color(&thread->rb_node, &proc->threads);
5028 * after we remove this thread from proc->threads.
5038 rb_erase(&thread->rb_node, &proc->threads);
5320 for (n = rb_first(&proc->threads); n; n = rb_next(n)) {
5890 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {
5902 "binder_flush: %d woke %d threads\n", proc->pid,
5991 int threads, nodes, incoming_refs, outgoing_refs, active_transactions;
6009 * remove all the threads
6017 threads = 0;
6019 while ((n = rb_first(&proc->threads))) {
6024 threads++;
6067 "%s: %d threads %d, nodes %d (ref %d), refs %d, active transactions %d\n",
6068 __func__, proc->pid, threads, nodes, incoming_refs,
6297 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
6464 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
6470 seq_printf(m, " threads: %d\n", count);
6471 seq_printf(m, " requested threads: %d+%d/%d\n"
6472 " ready threads %d\n"
6755 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {