Lines Matching refs:node
43 struct hl_cs_outcome *node;
51 * It has a pre-allocated amount of nodes, each node stores
54 * On push outcome, a node (any) is taken from the free list, its
55 * information is filled in, and the node is moved to the used list.
58 * will pop the OLDEST node from the used list, and make it free.
59 * On pop, the node is searched for in the used list (using a search
61 * If found, the node is then removed from the used list, and moved
62 * back to the free list. The outcome data that the node contained is
69 node = list_last_entry(&outcome_store->used_list,
71 hash_del(&node->map_link);
72 dev_dbg(hdev->dev, "CS %llu outcome was lost\n", node->seq);
74 node = list_last_entry(&outcome_store->free_list,
78 list_del_init(&node->list_link);
80 node->seq = seq;
81 node->ts = ts;
82 node->error = error;
84 list_add(&node->list_link, &outcome_store->used_list);
85 hash_add(outcome_store->outcome_map, &node->map_link, node->seq);
93 struct hl_cs_outcome *node;
98 hash_for_each_possible(outcome_store->outcome_map, node, map_link, seq)
99 if (node->seq == seq) {
100 *ts = node->ts;
101 *error = node->error;
103 hash_del(&node->map_link);
104 list_del_init(&node->list_link);
105 list_add(&node->list_link, &outcome_store->free_list);
502 * removed the cs node from the list before getting here,
3231 * and then it's safe to delete the node out of the interrupt list
3244 "ts node removed from interrupt list now can re-use\n");
3247 "ts node in middle of irq handling\n");
3262 /* Fill up the new registration node info */
3276 dev_dbg(buf->mmg->dev, "Found available node in TS kernel CB %p\n",
3341 * before we added the node to the wait list
3372 * before adding the node to the list. this scenario might happen when
3377 * node from the list.
3422 * We keep removing the node from list here, and not at the irq handler
3424 * for ts record, the node will be deleted in the irq handler after
3482 * before we added the node to the wait list