Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 255) sorted by relevance

1234567891011

/bsp/xuantie/libraries/xuantie_libraries/csi/csi2/include/drv/
A Dlist.h34 node->next = next; in __dlist_add()
65 dlist_t *next = node->next; in dlist_del() local
67 prev->next = next; in dlist_del()
111 for (pos = (head)->next; pos != (head); pos = pos->next)
148 n = (queue)->next ? (queue)->next->next : NULL; \
207 node->next = head->next; in slist_add()
217 head->next = node->next; in slist_del()
239 while (node->next && node->next != n) node = node->next; in slist_remove()
242 if (node->next != (slist_t *)0) node->next = node->next->next; in slist_remove()
254 while (l->next) l = l->next; in slist_tail()
[all …]
/bsp/allwinner/libraries/sunxi-hal/include/hal/
A Daw_list.h31 list->next = list; in INIT_LIST_HEAD()
47 new->next = next; in __list_add()
94 prev->next = next; in __list_del()
130 new->next = old->next; in list_replace()
211 struct list_head *next = head->next; in list_empty_careful() local
212 return (next == head) && (next == head->prev); in list_empty_careful()
242 list->next = head->next; in __list_cut_position()
288 last->next = next; in __list_splice()
375 for (pos = (head)->next; pos != (head); pos = pos->next)
386 for (pos = (head)->next; pos != (head); pos = pos->next)
[all …]
/bsp/rockchip/common/rk_hal/lib/hal/inc/
A Dhal_list.h50 l->next = l->prev = l; in HAL_LIST_Init()
60 l->next->prev = n; in HAL_LIST_InsertAfter()
61 n->next = l->next; in HAL_LIST_InsertAfter()
63 l->next = n; in HAL_LIST_InsertAfter()
74 l->prev->next = n; in HAL_LIST_InsertBefore()
78 n->next = l; in HAL_LIST_InsertBefore()
88 n->prev->next = n->next; in HAL_LIST_Remove()
99 return l->next == l; in HAL_LIST_IsEmpty()
112 p = p->next; in HAL_LIST_Len()
134 for (pos = (head)->next; pos != (head); pos = pos->next)
[all …]
/bsp/allwinner/libraries/sunxi-hal/include/hal/sdmmc/sys/
A Dlist.h31 list->next = list; in INIT_LIST_HEAD()
45 next->prev = newl; in __list_add()
46 newl->next = next; in __list_add()
88 prev->next = next; in __list_del()
118 newl->next = old->next; in list_replace()
199 struct list_head *next = head->next; in list_empty_careful() local
200 return (next == head) && (next == head->prev); in list_empty_careful()
230 list->next = head->next; in __list_cut_position()
276 last->next = next; in __list_splice()
401 for (pos = (head)->next; pos != (head); pos = pos->next)
[all …]
/bsp/stm32/stm32mp157a-st-discovery/board/ports/OpenAMP/libmetal/lib/include/metal/
A Dlist.h25 struct metal_list *next, *prev; member
42 list->next = list->prev = list; in metal_list_init()
49 new_node->next = node; in metal_list_add_before()
50 new_node->next->prev = new_node; in metal_list_add_before()
51 new_node->prev->next = new_node; in metal_list_add_before()
58 new_node->next = node->next; in metal_list_add_after()
77 return list->next == list; in metal_list_is_empty()
82 node->next->prev = node->prev; in metal_list_del()
83 node->prev->next = node->next; in metal_list_del()
93 for ((node) = (list)->next; \
[all …]
/bsp/stm32/stm32mp157a-st-ev1/board/ports/OpenAMP/libmetal/lib/include/metal/
A Dlist.h25 struct metal_list *next, *prev; member
42 list->next = list->prev = list; in metal_list_init()
49 new_node->next = node; in metal_list_add_before()
50 new_node->next->prev = new_node; in metal_list_add_before()
51 new_node->prev->next = new_node; in metal_list_add_before()
58 new_node->next = node->next; in metal_list_add_after()
77 return list->next == list; in metal_list_is_empty()
82 node->next->prev = node->prev; in metal_list_del()
83 node->prev->next = node->next; in metal_list_del()
93 for ((node) = (list)->next; \
[all …]
/bsp/bouffalo_lab/libraries/bl_mcu_sdk/drivers/lhal/include/
A Dbflb_list.h55 l->next = l->prev = l; in bflb_dlist_init()
66 l->next->prev = n; in bflb_dlist_insert_after()
67 n->next = l->next; in bflb_dlist_insert_after()
69 l->next = n; in bflb_dlist_insert_after()
81 l->prev->next = n; in bflb_dlist_insert_before()
85 n->next = l; in bflb_dlist_insert_before()
95 n->prev->next = n->next; in bflb_dlist_remove()
126 return l->next == l; in bflb_dlist_isempty()
139 p = p->next; in bflb_dlist_len()
195 for (pos = (head)->next; pos != (head); pos = pos->next)
[all …]
/bsp/microchip/samd51-adafruit-metro-m4/bsp/hal/utils/src/
A Dutils_list.c43 for (it = list->head; it; it = it->next) { in is_list_element()
68 ((struct list_element *)element)->next = ((struct list_element *)after)->next; in list_insert_after()
83 ((struct list_element *)element)->next = NULL; in list_insert_at_end()
87 while (it->next) { in list_insert_at_end()
88 it = it->next; in list_insert_at_end()
91 ((struct list_element *)element)->next = NULL; in list_insert_at_end()
102 list->head = list->head->next; in list_remove_head()
119 list->head = list->head->next; in list_delete_element()
124 while (it && it->next != element) { in list_delete_element()
125 it = it->next; in list_delete_element()
[all …]
/bsp/microchip/samc21/bsp/hal/utils/src/
A Dutils_list.c43 for (it = list->head; it; it = it->next) { in is_list_element()
68 ((struct list_element *)element)->next = ((struct list_element *)after)->next; in list_insert_after()
83 ((struct list_element *)element)->next = NULL; in list_insert_at_end()
87 while (it->next) { in list_insert_at_end()
88 it = it->next; in list_insert_at_end()
91 ((struct list_element *)element)->next = NULL; in list_insert_at_end()
102 list->head = list->head->next; in list_remove_head()
119 list->head = list->head->next; in list_delete_element()
124 while (it && it->next != element) { in list_delete_element()
125 it = it->next; in list_delete_element()
[all …]
/bsp/microchip/samd51-seeed-wio-terminal/bsp/hal/utils/src/
A Dutils_list.c43 for (it = list->head; it; it = it->next) { in is_list_element()
68 ((struct list_element *)element)->next = ((struct list_element *)after)->next; in list_insert_after()
83 ((struct list_element *)element)->next = NULL; in list_insert_at_end()
87 while (it->next) { in list_insert_at_end()
88 it = it->next; in list_insert_at_end()
91 ((struct list_element *)element)->next = NULL; in list_insert_at_end()
102 list->head = list->head->next; in list_remove_head()
119 list->head = list->head->next; in list_delete_element()
124 while (it && it->next != element) { in list_delete_element()
125 it = it->next; in list_delete_element()
[all …]
/bsp/microchip/saml10/bsp/hal/utils/src/
A Dutils_list.c43 for (it = list->head; it; it = it->next) { in is_list_element()
68 ((struct list_element *)element)->next = ((struct list_element *)after)->next; in list_insert_after()
83 ((struct list_element *)element)->next = NULL; in list_insert_at_end()
87 while (it->next) { in list_insert_at_end()
88 it = it->next; in list_insert_at_end()
91 ((struct list_element *)element)->next = NULL; in list_insert_at_end()
102 list->head = list->head->next; in list_remove_head()
119 list->head = list->head->next; in list_delete_element()
124 while (it && it->next != element) { in list_delete_element()
125 it = it->next; in list_delete_element()
[all …]
/bsp/microchip/same70/bsp/hal/utils/src/
A Dutils_list.c43 for (it = list->head; it; it = it->next) { in is_list_element()
68 ((struct list_element *)element)->next = ((struct list_element *)after)->next; in list_insert_after()
83 ((struct list_element *)element)->next = NULL; in list_insert_at_end()
87 while (it->next) { in list_insert_at_end()
88 it = it->next; in list_insert_at_end()
91 ((struct list_element *)element)->next = NULL; in list_insert_at_end()
102 list->head = list->head->next; in list_remove_head()
119 list->head = list->head->next; in list_delete_element()
124 while (it && it->next != element) { in list_delete_element()
125 it = it->next; in list_delete_element()
[all …]
/bsp/microchip/same54/bsp/hal/utils/src/
A Dutils_list.c43 for (it = list->head; it; it = it->next) { in is_list_element()
68 ((struct list_element *)element)->next = ((struct list_element *)after)->next; in list_insert_after()
83 ((struct list_element *)element)->next = NULL; in list_insert_at_end()
87 while (it->next) { in list_insert_at_end()
88 it = it->next; in list_insert_at_end()
91 ((struct list_element *)element)->next = NULL; in list_insert_at_end()
102 list->head = list->head->next; in list_remove_head()
119 list->head = list->head->next; in list_delete_element()
124 while (it && it->next != element) { in list_delete_element()
125 it = it->next; in list_delete_element()
[all …]
/bsp/allwinner/libraries/sunxi-hal/hal/source/usb/include/
A Dusb_list.h37 struct usb_list_head *next; member
72 node->next = next; in __usb_list_add()
74 prev->next = node; in __usb_list_add()
75 next->prev = node; in __usb_list_add()
81 __usb_list_add(node, head, head->next); in usb_list_add()
95 next->prev = prev; in __usb_list_del()
96 prev->next = next; in __usb_list_del()
102 __usb_list_del(entry->prev, entry->next); in usb_list_del()
105 entry->next = entry; in usb_list_del()
112 __usb_list_del(entry->prev, entry->next); in usb_list_del_init()
[all …]
A Dlist_head_ext.c89 list_now = list_start->next; in list_head_ext_remov_node_from_list()
93 list_next = list_now->next; in list_head_ext_remov_node_from_list()
145 list_now = list_start->next; in list_node_exist()
156 list_now = list_now->next; in list_node_exist()
200 list_now = list->next; in list_del_node_by_data()
206 list_next = list_now->next; in list_del_node_by_data()
271 list_now = list->next; in list_destroy_whole_list()
278 list_next = list_now->next; in list_destroy_whole_list()
/bsp/samd21/sam_d2x_asflib/sam0/drivers/events/
A Devents_hooks.c64 hook->next = NULL; in events_create_hook()
85 while (tmp_hook->next != NULL) { in events_add_hook()
86 tmp_hook = tmp_hook->next; in events_add_hook()
90 tmp_hook->next = hook; in events_add_hook()
110 tmp_hook = tmp_hook->next; in events_del_hook()
121 tmp_hook = tmp_hook->next; in events_del_hook()
125 last_hook->next = tmp_hook->next; in events_del_hook()
127 _events_inst.hook_list = tmp_hook->next; in events_del_hook()
226 current_hook = current_hook->next; in EVSYS_Handler()
/bsp/xuantie/libraries/xuantie_libraries/chip_riscv_dummy/src/drivers/
A Dpower_manage.c43 struct reten_mem_node *next; member
77 node->next = NULL; in csi_pm_set_reten_mem()
100 node = node->next; in pm_alloc_reten_mem()
112 newnode->next = node->next; in pm_alloc_reten_mem()
113 node->next = newnode; in pm_alloc_reten_mem()
123 node = node->next; in pm_alloc_reten_mem()
143 node = node->next; in pm_free_reten_mem()
157 slist_add(&dev->pm_dev.next, &pm_dev_list[priority]); in csi_pm_dev_register()
174 slist_del(&dev->pm_dev.next, &pm_dev_list[i]); in csi_pm_dev_unregister()
206 slist_for_each_entry(&pm_dev_list[i], node, csi_pm_dev_t, next) { in csi_pm_dev_notify()
[all …]
/bsp/nxp/imx/imxrt/libraries/drivers/vglite/VGLiteKernel/rtos/
A Dvg_lite_hal.c67 struct list_head *next; member
72 (entry)->next = (entry);\
79 to_add->next = head; in add_list()
85 to_add->prev->next = to_add; in add_list()
93 entry->prev->next = entry->next; in delete_list()
95 if (entry->next != NULL) { in delete_list()
96 entry->next->prev = entry->prev; in delete_list()
295 for (pos = (heap_node_t *)pos->list.next; in vg_lite_hal_free_contiguous()
297 pos = (heap_node_t *)pos->list.next) { in vg_lite_hal_free_contiguous()
341 n = (heap_node_t *)pos->list.next; in vg_lite_hal_free_os_heap()
[all …]
/bsp/allwinner/libraries/sunxi-hal/hal/source/g2d_rcq/
A Dsimple_idr.c107 tmp->next = dir->head; in id_alloc()
123 (*cur)->next = dir->head; in id_alloc()
186 if (lu[i]->layer[id_index]->next != NULL) in id_free()
187 lu[i]->layer[id_index]->next->pre = lu[i]->layer[id_index]->pre; in id_free()
189 lu[i]->layer[id_index]->pre->next = lu[i]->layer[id_index]->next; in id_free()
191 dir->head = lu[i]->layer[id_index]->next; in id_free()
203 if (lu[0]->next != NULL) in id_free()
204 lu[0]->next->pre = lu[0]->pre; in id_free()
206 lu[0]->pre->next = lu[0]->next; in id_free()
208 dir->head = lu[0]->next; in id_free()
[all …]
/bsp/hpmicro/libraries/hpm_sdk/components/usb/host/
A Dhpm_usb_host.c71 prev->address = qhd->next.address; in usb_host_list_remove_qhd_by_addr()
103 return (hcd_qhd_t *)usb_host_align32(p_qhd->next.address); in usb_host_qhd_next()
193 p_qhd->qtd_overlay.next.terminate = 1; in usb_host_qhd_init()
235 return (hcd_qtd_t *)usb_host_align32(p_qtd->next.address); in usb_host_qtd_next()
243 p_qhd->p_qtd_list_tail->next.address = (uint32_t)p_qtd_new; in usb_host_qtd_insert_to_qhd()
253 p_qtd->next.terminate = 1; /* init to null */ in usb_host_qtd_init()
291 async_head->next.type = usb_qtype_qhd; in usb_host_init_async_list()
294 async_head->qtd_overlay.next.terminate = 1; in usb_host_init_async_list()
446 qtd->next.terminate = 1; in usb_host_edpt_xfer()
490 td->next.terminate = 1; in usb_host_setup_send()
[all …]
/bsp/allwinner/libraries/sunxi-hal/hal/source/msgbox/msgbox_amp/
A Dmsgbox_amp.c50 for (t = it_edp; t != NULL; t = t->next) { in irq_msgbox_handler()
104 if (t->next == NULL) { in hal_msgbox_alloc_channel()
105 t->next = edp; in hal_msgbox_alloc_channel()
109 t = t->next; in hal_msgbox_alloc_channel()
113 edp->next = NULL; in hal_msgbox_alloc_channel()
/bsp/airm2m/air105/libraries/HAL_Driver/Src/
A Dbsp_common.c1120 next->prev = p; in __llist_add()
1121 p->next = next; in __llist_add()
1123 prev->next = p; in __llist_add()
1161 next->prev = prev; in __llist_del()
1162 prev->next = next; in __llist_del()
1177 entry->next = LLIST_POISON1; in llist_del()
1216 llist_head *node = head->next; in llist_traversal()
1229 node = node->next; in llist_traversal()
1246 return head->next == head; in llist_empty()
1251 llist_head *node = head->next; in llist_num()
[all …]
/bsp/allwinner/libraries/sunxi-hal/hal/source/dma/
A Dhal_dma.c195 if ((!prev && !chan) || !next) in sunxi_lli_list()
201 chan->desc = next; in sunxi_lli_list()
203 chan->desc->vlln = next; in sunxi_lli_list()
208 prev->vlln = next; in sunxi_lli_list()
211 next->p_lln = LINK_END; in sunxi_lli_list()
212 next->vlln = NULL; in sunxi_lli_list()
214 return next; in sunxi_lli_list()
350 next = li_adr->vlln; in sunxi_dma_free_ill()
352 li_adr = next; in sunxi_dma_free_ill()
512 next = li_adr->vlln; in hal_dma_prep_cyclic()
[all …]
/bsp/allwinner/libraries/sunxi-hal/hal/source/usb/core/
A Dusb_virt_bus.c140 list_now = list_start->next; in usb_virt_bus_drv_reg()
152 list_now = list_now->next; in usb_virt_bus_drv_reg()
228 list_now = list_start->next; in usb_virt_bus_drv_unreg()
240 list_now = list_now->next; in usb_virt_bus_drv_unreg()
328 list_now = list_start->next; in usb_virt_bus_dev_add()
334 list_now = list_now->next; in usb_virt_bus_dev_add()
/bsp/dm365/platform/
A Dfindbit.S28 add r2, r2, #8 @ next bit pointer
53 b 2b @ loop for next bit
71 add r2, r2, #8 @ next bit pointer
95 b 2b @ loop for next bit
110 add r2, r2, #8 @ next bit pointer
131 b 2b @ loop for next bit
144 add r2, r2, #8 @ next bit pointer
164 b 2b @ loop for next bit

Completed in 30 milliseconds

1234567891011