Home
last modified time | relevance | path

Searched refs:queue_node (Results 1 – 11 of 11) sorted by relevance

/aosp_15_r20/external/trusty/lk/kernel/
Dthread.c122 DEBUG_ASSERT(!list_in_list(&t->queue_node)); in insert_in_run_queue_head()
126 list_add_head(&run_queue[t->priority], &t->queue_node); in insert_in_run_queue_head()
134 DEBUG_ASSERT(!list_in_list(&t->queue_node)); in insert_in_run_queue_tail()
138 list_add_tail(&run_queue[t->priority], &t->queue_node); in insert_in_run_queue_tail()
145 DEBUG_ASSERT(list_in_list(&t->queue_node)); in delete_from_run_queue()
149 list_delete(&t->queue_node); in delete_from_run_queue()
576 DEBUG_ASSERT(!list_in_list(&t->queue_node)); in thread_join()
757 list_for_every_entry(&run_queue[next_queue], newthread, thread_t, queue_node) { in get_top_thread()
1782 list_add_tail(&wait->list, &current_thread->queue_node); in wait_queue_block()
1839 t = list_remove_head_type(&wait->list, thread_t, queue_node); in wait_queue_wake_one()
[all …]
/aosp_15_r20/external/selinux/checkpolicy/
H A Dqueue.h17 typedef struct queue_node *queue_node_ptr_t;
19 typedef struct queue_node { struct
H A Dqueue.c33 newnode = (queue_node_ptr_t) malloc(sizeof(struct queue_node)); in queue_insert()
57 newnode = (queue_node_ptr_t) malloc(sizeof(struct queue_node)); in queue_push()
/aosp_15_r20/external/trusty/lk/app/threadtest/
Dthreadtest.c218 ASSERT_EQ(list_in_list(&sleeping_thread->queue_node), false); in TEST()
228 list_add_head(&queue.list, &sleeping_thread->queue_node); in TEST()
259 list_add_head(&queue->list, &fake.queue_node); in thread_fake_then_wake_fn()
/aosp_15_r20/external/tensorflow/tensorflow/core/grappler/costs/
H A Dgraph_properties.cc2421 Status GraphProperties::UpdateQueue(const NodeDef* queue_node, in UpdateQueue() argument
2424 auto* ctx = shape_refiner->GetNodeContext(queue_node); in UpdateQueue()
2426 TF_RETURN_IF_ERROR(shape_refiner->AddNode(queue_node)); in UpdateQueue()
2427 ctx = CHECK_NOTNULL(shape_refiner->GetNodeContext(queue_node)); in UpdateQueue()
2434 return shape_refiner->UpdateNode(queue_node, new_shapes); in UpdateQueue()
2437 if (queue_node->attr().count("shapes") <= 0 || in UpdateQueue()
2438 queue_node->attr().count("component_types") <= 0 || in UpdateQueue()
2439 queue_node->attr().at("shapes").list().shape_size() != in UpdateQueue()
2440 queue_node->attr().at("component_types").list().type_size()) { in UpdateQueue()
2442 return shape_refiner->UpdateNode(queue_node, new_shapes); in UpdateQueue()
[all …]
H A Dgraph_properties.h178 static Status UpdateQueue(const NodeDef* queue_node,
/aosp_15_r20/external/trusty/lk/include/kernel/
Dthread.h108 struct list_node queue_node; member
/aosp_15_r20/external/bcc/libbpf-tools/x86/
H A Dvmlinux.h47795 struct hlist_node queue_node; member
H A Dvmlinux_518.h47795 struct hlist_node queue_node; member
/aosp_15_r20/external/bcc/libbpf-tools/arm64/
H A Dvmlinux_608.h71760 struct hlist_node queue_node; member
H A Dvmlinux.h71760 struct hlist_node queue_node; member