Searched refs:runnable_tree (Results 1 – 4 of 4) sorted by relevance
185 return RB_EMPTY_ROOT(&rb->runnable_tree); in jsctx_rb_none_to_pull_prio()239 while (!RB_EMPTY_ROOT(&queue->runnable_tree)) { in jsctx_queue_foreach_prio()240 struct rb_node *node = rb_first(&queue->runnable_tree); in jsctx_queue_foreach_prio()244 rb_erase(node, &queue->runnable_tree); in jsctx_queue_foreach_prio()297 node = rb_first(&rb->runnable_tree); in jsctx_rb_peek_prio()356 rb_erase(&katom->runnable_tree_node, &rb->runnable_tree); in jsctx_rb_pull()367 struct rb_node **new = &(queue->runnable_tree.rb_node), *parent = NULL; in jsctx_tree_add()384 rb_insert_color(&katom->runnable_tree_node, &queue->runnable_tree); in jsctx_tree_add()592 kctx->jsctx_queue[i][j].runnable_tree = RB_ROOT; in kbasep_js_kctx_init()
1276 struct rb_root runnable_tree; member
161 none_to_pull = RB_EMPTY_ROOT(&rb->runnable_tree); in jsctx_rb_none_to_pull_prio()219 while (!RB_EMPTY_ROOT(&queue->runnable_tree)) { in jsctx_queue_foreach_prio()220 struct rb_node *node = rb_first(&queue->runnable_tree); in jsctx_queue_foreach_prio()224 rb_erase(node, &queue->runnable_tree); in jsctx_queue_foreach_prio()303 node = rb_first(&rb->runnable_tree); in jsctx_rb_peek_prio()367 rb_erase(&katom->runnable_tree_node, &rb->runnable_tree); in jsctx_rb_pull()377 struct rb_node **new = &(queue->runnable_tree.rb_node), *parent = NULL; in jsctx_tree_add()397 rb_insert_color(&katom->runnable_tree_node, &queue->runnable_tree); in jsctx_tree_add()670 kctx->jsctx_queue[i][j].runnable_tree = RB_ROOT; in kbasep_js_kctx_init()
846 struct rb_root runnable_tree; member