Home
last modified time | relevance | path

Searched refs:node_pos (Results 1 – 3 of 3) sorted by relevance

/OK3568_Linux_fs/kernel/lib/
H A Dplist.c188 struct plist_node *first, *prio_pos, *node_pos; in plist_test_check() local
196 plist_for_each(node_pos, &test_head) { in plist_test_check()
199 if (node_pos == first) in plist_test_check()
201 if (node_pos->prio == prio_pos->prio) { in plist_test_check()
202 BUG_ON(!list_empty(&node_pos->prio_list)); in plist_test_check()
206 BUG_ON(prio_pos->prio > node_pos->prio); in plist_test_check()
207 BUG_ON(prio_pos->prio_list.next != &node_pos->prio_list); in plist_test_check()
208 prio_pos = node_pos; in plist_test_check()
/OK3568_Linux_fs/app/forlinx/flapp/src/keyboard/pinyin/share/
H A Ddicttrie.cpp806 for (size_t node_pos = 0; node_pos < node_to_num; node_pos++) { in get_lpis() local
809 LmaNodeLE0* node_le0 = node_to_le0[node_pos]; in get_lpis()
823 LmaNodeGE1* node_ge1 = node_to_ge1[node_pos]; in get_lpis()
/OK3568_Linux_fs/kernel/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Dfwsignal.c1333 int node_pos; in brcmf_fws_deq() local
1340 node_pos = fws->deq_node_pos[fifo]; in brcmf_fws_deq()
1343 entry = &table[(node_pos + i) % num_nodes]; in brcmf_fws_deq()
1368 fws->deq_node_pos[fifo] = (node_pos + i + 1) % num_nodes; in brcmf_fws_deq()