Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 125) sorted by relevance

12345

/components/utilities/libadt/avl/
A Davl.h53 if (node) in util_avl_next()
55 if (node->avl_right) in util_avl_next()
57 node = node->avl_right; in util_avl_next()
59 node = node->avl_left; in util_avl_next()
60 successor = node; in util_avl_next()
64 while ((successor = node->parent) && (node == successor->avl_right)) in util_avl_next()
75 if (node) in util_avl_prev()
77 if (node->avl_left) in util_avl_prev()
79 node = node->avl_left; in util_avl_prev()
81 node = node->avl_right; in util_avl_prev()
[all …]
A Davl.c17 #define HEIGHT_OF(node) ((node) ? (node)->height : 0) argument
18 #define IS_RCHILD(node) (!((node) - ((node)->parent->avl_right))) argument
19 #define IS_LCHILD(node) (!((node) - ((node)->parent->avl_left))) argument
21 IS_LCHILD(node) ? &(node)->parent->avl_left : &(node)->parent->avl_right
123 if (!node) in util_avl_rebalance()
183 if (node->parent != NULL) in util_avl_remove()
193 if (node->avl_right == NULL) in util_avl_remove()
197 node->avl_left->parent = node->parent; in util_avl_remove()
198 node = node->parent; in util_avl_remove()
211 node = rchild->parent; in util_avl_remove()
[all …]
/components/lwp/
A Dlwp_avl.c31 nodeleft->avl_right = node; in lwp_avl_rebalance()
74 node->avl_height = height; in lwp_avl_rebalance()
90 if (node == AVL_EMPTY) in lwp_avl_remove()
97 if (key == node->avl_key) in lwp_avl_remove()
99 if (key < node->avl_key) in lwp_avl_remove()
115 struct lwp_avl_struct *node; in lwp_avl_remove() local
118 node = *nodeplace; in lwp_avl_remove()
125 *nodeplace = node->avl_left; in lwp_avl_remove()
129 *nodeplace_to_delete = node; in lwp_avl_remove()
145 if (node == AVL_EMPTY) in lwp_avl_insert()
[all …]
/components/legacy/fdt/src/
A Ddtb_base.c88 RT_ASSERT(dtb_node_valid(node)); in dtb_node_read_bool()
103 RT_ASSERT(dtb_node_valid(node)); in dtb_node_read_prop()
150 RT_ASSERT(dtb_node_valid(node)); in dtb_node_find_subnode()
153 for (node = node->child; node; node = node->sibling) in dtb_node_find_subnode()
158 subnode = node; in dtb_node_find_subnode()
168 RT_ASSERT(dtb_node_valid(node)); in dtb_node_first_subnode()
170 return node->child; in dtb_node_first_subnode()
175 RT_ASSERT(dtb_node_valid(node)); in dtb_node_next_subnode()
177 return node->sibling; in dtb_node_next_subnode()
182 if (!dtb_node_valid(node)) in dtb_node_get_name()
[all …]
/components/drivers/serial/
A Dbypass.c70 rt_list_insert_before(&pass->node, node); in rt_bypass_register()
76 temp_curr = rt_container_of(node, struct rt_serial_bypass_func, node); in rt_bypass_register()
80 rt_list_insert_before(node, &pass->node); in rt_bypass_register()
93 node = node->next; in rt_bypass_register()
209 node = node->next; in _lower_work()
285 temp_curr = rt_container_of(node, struct rt_serial_bypass_func, node); in rt_bypass_unregister()
295 node = node->next; in rt_bypass_unregister()
340 current = rt_container_of(node, struct rt_serial_bypass_func, node); in serial_bypass_list()
342 node = node->next; in serial_bypass_list()
360 current = rt_container_of(node, struct rt_serial_bypass_func, node); in serial_bypass_list()
[all …]
/components/net/lwip-dhcpd/
A Ddhcp_server_raw.c149 for (node = dhcpserver->node_list; node != NULL; node = node->next) in dhcp_client_find_by_mac()
172 for (node = dhcpserver->node_list; node != NULL; node = node->next) in dhcp_client_find_by_ip()
201 if (node != NULL) in dhcp_client_find()
203 return node; in dhcp_client_find()
237 if (node != NULL) in dhcp_client_alloc()
239 return node; in dhcp_client_alloc()
254 if (node != NULL) in dhcp_client_alloc()
275 return node; in dhcp_client_alloc()
564 for (node = dhcp_server->node_list; node != NULL; node = node->next) in dhcp_server_recv()
579 node = node->next; in dhcp_server_recv()
[all …]
/components/drivers/ipc/
A Dwaitqueue.c34 node->wqueue = queue; in rt_wqueue_add()
44 void rt_wqueue_remove(struct rt_wqueue_node *node) in rt_wqueue_remove() argument
48 RT_ASSERT(node->wqueue != RT_NULL); in rt_wqueue_remove()
50 level = rt_spin_lock_irqsave(&(node->wqueue->spinlock)); in rt_wqueue_remove()
51 rt_list_remove(&(node->list)); in rt_wqueue_remove()
86 struct rt_list_node *node; in rt_wqueue_wakeup() local
97 for (node = queue_list->next; node != queue_list; node = node->next) in rt_wqueue_wakeup()
142 struct rt_list_node *node; in rt_wqueue_wakeup_all() local
153 for (node = queue_list->next; node != queue_list; ) in rt_wqueue_wakeup_all()
172 node = node->next; in rt_wqueue_wakeup_all()
[all …]
A Dringblk_buf.c142 struct rt_slist_node *node = l; in list_remove() local
145 while (node->next && node->next != n) node = node->next; in list_remove()
149 node->next = node->next->next; in list_remove()
153 rbb->tail = node; in list_remove()
299 rt_slist_t *node; in rt_rbb_blk_get() local
308 for (node = rt_slist_first(&rbb->blk_list); node; node = rt_slist_next(node)) in rt_rbb_blk_get()
420 if (node != RT_NULL) in rt_rbb_blk_queue_get()
422 tmp = rt_slist_next(node); in rt_rbb_blk_queue_get()
424 for (; node; node = tmp, tmp = rt_slist_next(node)) in rt_rbb_blk_queue_get()
545 rt_slist_t *node; in rt_rbb_next_blk_queue_len() local
[all …]
/components/net/lwip/lwip-2.0.3/src/apps/snmp/
A Dsnmp_mib2.c91 &snmp_mib2_system_node.node.node,
92 &snmp_mib2_interface_root.node,
94 &snmp_mib2_at_root.node,
97 &snmp_mib2_ip_root.node,
100 &snmp_mib2_icmp_root.node.node,
103 &snmp_mib2_tcp_root.node,
106 &snmp_mib2_udp_root.node,
108 &snmp_mib2_snmp_root.node.node
114 const struct snmp_mib mib2 = SNMP_MIB_CREATE(mib2_base_oid_arr, &mib2_root.node);
A Dsnmp_mib2_ip.c691 &SYNC_NODE_NAME(ip_Forwarding).node.node,
692 &SYNC_NODE_NAME(ip_DefaultTTL).node.node,
693 &SYNC_NODE_NAME(ip_InReceives).node.node,
698 &SYNC_NODE_NAME(ip_InDiscards).node.node,
699 &SYNC_NODE_NAME(ip_InDelivers).node.node,
704 &SYNC_NODE_NAME(ip_ReasmReqds).node.node,
705 &SYNC_NODE_NAME(ip_ReasmOKs).node.node,
707 &SYNC_NODE_NAME(ip_FragOKs).node.node,
708 &SYNC_NODE_NAME(ip_FragFails).node.node,
710 &SYNC_NODE_NAME(ip_AddrTable).node.node,
[all …]
A Dsnmp_mib2_tcp.c571 &SYNC_NODE_NAME(tcp_RtoMin).node.node,
572 &SYNC_NODE_NAME(tcp_RtoMax).node.node,
573 &SYNC_NODE_NAME(tcp_MaxConn).node.node,
578 &SYNC_NODE_NAME(tcp_CurrEstab).node.node,
579 &SYNC_NODE_NAME(tcp_InSegs).node.node,
580 &SYNC_NODE_NAME(tcp_OutSegs).node.node,
583 &SYNC_NODE_NAME(tcp_ConnTable).node.node,
585 &SYNC_NODE_NAME(tcp_InErrs).node.node,
586 &SYNC_NODE_NAME(tcp_OutRsts).node.node,
587 &SYNC_NODE_NAME(tcp_HCInSegs).node.node,
[all …]
A Dsnmp_mib2_udp.c52 …_node node_name ## _synced = SNMP_CREATE_THREAD_SYNC_NODE(oid, &node_name.node, &snmp_mib2_lwip_lo…
65 switch (instance->node->oid) { in udp_get_value()
85 LWIP_DEBUGF(SNMP_MIB_DEBUG,("udp_get_value(): unknown id: %"S32_F"\n", instance->node->oid)); in udp_get_value()
344 &SYNC_NODE_NAME(udp_inDatagrams).node.node,
345 &SYNC_NODE_NAME(udp_noPorts).node.node,
346 &SYNC_NODE_NAME(udp_inErrors).node.node,
347 &SYNC_NODE_NAME(udp_outDatagrams).node.node,
349 &SYNC_NODE_NAME(udp_Table).node.node,
351 &SYNC_NODE_NAME(udp_endpointTable).node.node,
352 &SYNC_NODE_NAME(udp_HCInDatagrams).node.node,
[all …]
/components/net/lwip/lwip-2.1.2/src/apps/snmp/
A Dsnmp_mib2.c91 &snmp_mib2_system_node.node.node,
92 &snmp_mib2_interface_root.node,
94 &snmp_mib2_at_root.node,
97 &snmp_mib2_ip_root.node,
100 &snmp_mib2_icmp_root.node.node,
103 &snmp_mib2_tcp_root.node,
106 &snmp_mib2_udp_root.node,
108 &snmp_mib2_snmp_root.node.node
114 const struct snmp_mib mib2 = SNMP_MIB_CREATE(mib2_base_oid_arr, &mib2_root.node);
A Dsnmp_mib2_ip.c679 &SYNC_NODE_NAME(ip_Forwarding).node.node,
680 &SYNC_NODE_NAME(ip_DefaultTTL).node.node,
681 &SYNC_NODE_NAME(ip_InReceives).node.node,
686 &SYNC_NODE_NAME(ip_InDiscards).node.node,
687 &SYNC_NODE_NAME(ip_InDelivers).node.node,
692 &SYNC_NODE_NAME(ip_ReasmReqds).node.node,
693 &SYNC_NODE_NAME(ip_ReasmOKs).node.node,
695 &SYNC_NODE_NAME(ip_FragOKs).node.node,
696 &SYNC_NODE_NAME(ip_FragFails).node.node,
698 &SYNC_NODE_NAME(ip_AddrTable).node.node,
[all …]
A Dsnmp_mib2_tcp.c582 &SYNC_NODE_NAME(tcp_RtoMin).node.node,
583 &SYNC_NODE_NAME(tcp_RtoMax).node.node,
584 &SYNC_NODE_NAME(tcp_MaxConn).node.node,
589 &SYNC_NODE_NAME(tcp_CurrEstab).node.node,
590 &SYNC_NODE_NAME(tcp_InSegs).node.node,
591 &SYNC_NODE_NAME(tcp_OutSegs).node.node,
594 &SYNC_NODE_NAME(tcp_ConnTable).node.node,
596 &SYNC_NODE_NAME(tcp_InErrs).node.node,
597 &SYNC_NODE_NAME(tcp_OutRsts).node.node,
598 &SYNC_NODE_NAME(tcp_HCInSegs).node.node,
[all …]
A Dsnmp_mib2_udp.c52 …_node node_name ## _synced = SNMP_CREATE_THREAD_SYNC_NODE(oid, &node_name.node, &snmp_mib2_lwip_lo…
65 switch (instance->node->oid) { in udp_get_value()
93 LWIP_DEBUGF(SNMP_MIB_DEBUG, ("udp_get_value(): unknown id: %"S32_F"\n", instance->node->oid)); in udp_get_value()
356 &SYNC_NODE_NAME(udp_inDatagrams).node.node,
357 &SYNC_NODE_NAME(udp_noPorts).node.node,
358 &SYNC_NODE_NAME(udp_inErrors).node.node,
359 &SYNC_NODE_NAME(udp_outDatagrams).node.node,
361 &SYNC_NODE_NAME(udp_Table).node.node,
363 &SYNC_NODE_NAME(udp_endpointTable).node.node
366 &SYNC_NODE_NAME(udp_HCInDatagrams).node.node,
[all …]
A Dsnmp_snmpv2_framework.c43 static s16_t snmpengine_scalars_get_value(const struct snmp_scalar_array_node_def *node, void *valu… in snmpengine_scalars_get_value() argument
48 switch (node->oid) { in snmpengine_scalars_get_value()
63 …LWIP_DEBUGF(SNMP_MIB_DEBUG, ("snmpengine_scalars_get_value(): unknown id: %"S32_F"\n", node->oid)); in snmpengine_scalars_get_value()
77 &snmpengine_scalars.node.node
83 &snmpframeworkmibobjects_treenode.node
87 …snmpframeworkmib_base_oid, LWIP_ARRAYSIZE(snmpframeworkmib_base_oid), &snmpframeworkmib_root.node};
/components/mm/
A Davl_adpt.c77 while (node) in search()
79 rt_varea_t varea = VAREA_ENTRY(node); in search()
85 node = node->avl_left; in search()
89 node = node->avl_right; in search()
112 while (node) in _aspace_bst_search_exceed()
114 rt_varea_t varea = VAREA_ENTRY(node); in _aspace_bst_search_exceed()
127 node = node->avl_left; in _aspace_bst_search_exceed()
132 node = node->avl_right; in _aspace_bst_search_exceed()
171 util_avl_link(&varea->node.node, current, next); in _aspace_bst_insert()
178 struct util_avl_struct *node = &varea->node.node; in _aspace_bst_remove() local
[all …]
A Davl_adpt.h21 ? rt_container_of(rt_container_of(pnode, struct _aspace_node, node), \
22 struct rt_varea, node) \
25 #define ASPACE_VAREA_NEXT(pva) (VAREA_ENTRY(util_avl_next(&pva->node.node)))
28 #define ASPACE_VAREA_PREV(pva) (VAREA_ENTRY(util_avl_prev(&pva->node.node)))
32 struct util_avl_struct node; member
/components/legacy/fdt/inc/
A Ddtb_node.h203 struct dtb_node *dtb_node_get_parent(const struct dtb_node *node);
326 return node != NULL; in dtb_node_valid()
340 const char *dtb_node_get_name(const struct dtb_node *node);
345 size_t dtb_node_get_addr(const struct dtb_node *node);
355 rt_bool_t dtb_node_is_available(const struct dtb_node *node);
387 #define dtb_node_for_each_subnode(node, parent) \ argument
388 for (node = dtb_node_first_subnode(parent); \
389 dtb_node_valid(node); \
390 node = dtb_node_next_subnode(node))
394 static inline void dtb_fwnode_init(struct dtb_node *node) in dtb_fwnode_init() argument
[all …]
/components/dfs/dfs_v2/include/
A Ddfs_vfs.h27 rt_inline void dfs_vfs_init_node(struct dfs_vfs_node *node) in dfs_vfs_init_node() argument
29 rt_list_init(&node->subnode); in dfs_vfs_init_node()
30 rt_list_init(&node->sibling); in dfs_vfs_init_node()
33 rt_inline void dfs_vfs_append_node(struct dfs_vfs_node *dir, struct dfs_vfs_node *node) in dfs_vfs_append_node() argument
35 rt_list_insert_after(&(dir->subnode), &(node->sibling)); in dfs_vfs_append_node()
38 rt_inline void dfs_vfs_remove_node(struct dfs_vfs_node *node) in dfs_vfs_remove_node() argument
40 rt_list_remove(&(node->sibling)); in dfs_vfs_remove_node()
43 #define dfs_vfs_for_each_subnode(node, tmp, dir, member) \ argument
44 rt_list_for_each_entry_safe(node, tmp, &dir->member.subnode, member.sibling)
/components/net/netdev/src/
A Dnetdev.c151 rt_slist_t *node = RT_NULL; in netdev_unregister() local
163 for (node = &(netdev_list->list); node; node = rt_slist_next(node)) in netdev_unregister()
247 for (node = &(netdev_list->list); node; node = rt_slist_next(node)) in netdev_get_first_by_flags()
283 for (node = &(netdev_list->list); node; node = rt_slist_next(node)) in netdev_get_by_ipaddr()
319 for (node = &(netdev_list->list); node; node = rt_slist_next(node)) in netdev_get_by_name()
355 for (node = &(netdev_list->list); node; node = rt_slist_next(node)) in netdev_get_by_ifindex()
393 for (node = &(netdev_list->list); node; node = rt_slist_next(node)) in netdev_get_by_family()
404 for (node = &(netdev_list->list); node; node = rt_slist_next(node)) in netdev_get_by_family()
1183 for (node = &(cur_netdev_list->list); node; node = rt_slist_next(node)) in netdev_list_if()
1474 for (node = &(netdev_list->list); node; node = rt_slist_next(node)) in netdev_list_dns()
[all …]
/components/libc/posix/io/poll/
A Dpoll.c96 struct rt_poll_node *node; in _poll_add() local
99 if (node == RT_NULL) in _poll_add()
104 node->wqn.key = req->_key; in _poll_add()
105 rt_list_init(&(node->wqn.list)); in _poll_add()
108 node->next = pt->nodes; in _poll_add()
109 node->pt = pt; in _poll_add()
110 pt->nodes = node; in _poll_add()
111 rt_wqueue_add(wq, &node->wqn); in _poll_add()
327 node = next; in poll_teardown()
329 next = node->next; in poll_teardown()
[all …]
/components/dfs/dfs_v1/filesystems/cromfs/
A Ddfs_cromfs.c550 fi = node->fi; in dfs_cromfs_unmount()
552 free(node); in dfs_cromfs_unmount()
805 if (node) in get_file_info()
811 return node->fi; in get_file_info()
850 node = (struct cromfs_avl_struct *)malloc(sizeof *node); in inset_file_info()
851 if (!node) in inset_file_info()
856 node->fi = fi; in inset_file_info()
876 if (node) in deref_file_info()
878 node->fi->ref--; in deref_file_info()
881 fi = node->fi; in deref_file_info()
[all …]
/components/net/lwip/lwip-1.4.1/src/core/snmp/
A Dmib_structs.c64 push_node(struct nse* node) in push_node() argument
67 LWIP_DEBUGF(SNMP_MIB_DEBUG,("push_node() node=%p id=%"S32_F"\n",(void*)(node->r_ptr),node->r_id)); in push_node()
79 pop_node(struct nse* node) in pop_node() argument
458 while (node != NULL) in snmp_search_tree()
492 node = an->nptr[i]; in snmp_search_tree()
539 node = ln->nptr; in snmp_search_tree()
645 if (node != NULL) in empty_table()
690 while (node != NULL) in snmp_expand_tree()
889 node = ln->nptr; in snmp_expand_tree()
922 node = jn->nptr; in snmp_expand_tree()
[all …]

Completed in 93 milliseconds

12345