Searched refs:node (Results 1 – 6 of 6) sorted by relevance
| /external/lib/lwip/core/snmp/ |
| A D | mib_structs.c | 64 push_node(struct nse* node) in push_node() argument
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()
773 node = an->nptr[i]; in snmp_expand_tree()
889 node = ln->nptr; in snmp_expand_tree()
922 node = jn->nptr; in snmp_expand_tree()
[all …]
|
| /external/platform/pico/common/pico_util/ |
| A D | pheap.c | 90 pheap_node_t *node = ph_get_node(heap, id); in ph_remove_and_free_node() local
91 if (!node->parent) return false; // not in tree in ph_remove_and_free_node()
92 pheap_node_t *parent = ph_get_node(heap, node->parent); in ph_remove_and_free_node()
94 parent->child = node->sibling; in ph_remove_and_free_node()
101 prev_sibling->sibling = node->sibling; in ph_remove_and_free_node()
109 node->sibling = node->parent = 0; in ph_remove_and_free_node()
125 pheap_node_t *node = ph_get_node(heap, id); in ph_dump_node() local
126 printf("%d (c=%d s=%d p=%d) ", id, node->child, node->sibling, node->parent); in ph_dump_node()
129 count += ph_dump_node(heap, node->child, dump_key, user_data, indent + 1); in ph_dump_node()
130 count += ph_dump_node(heap, node->sibling, dump_key, user_data, indent); in ph_dump_node()
|
| /external/lib/fdt/ |
| A D | fdt_overlay.c | 101 static int overlay_phandle_add_offset(void *fdt, int node, in overlay_phandle_add_offset() argument
107 valp = fdt_getprop_w(fdt, node, name, &len); in overlay_phandle_add_offset()
137 static int overlay_adjust_node_phandles(void *fdto, int node, in overlay_adjust_node_phandles() argument
143 ret = overlay_phandle_add_offset(fdto, node, "phandle", delta); in overlay_adjust_node_phandles()
147 ret = overlay_phandle_add_offset(fdto, node, "linux,phandle", delta); in overlay_adjust_node_phandles()
151 fdt_for_each_subnode(child, fdto, node) { in overlay_adjust_node_phandles()
517 php = fdt_getprop(fdto, node, "phandle", &len); in overlay_adjust_local_conflicting_phandle()
524 php = fdt_getprop(fdto, node, "linux,phandle", &len); in overlay_adjust_local_conflicting_phandle()
764 void *fdto, int node) in overlay_apply_node() argument
769 fdt_for_each_property_offset(property, fdto, node) { in overlay_apply_node()
[all …]
|
| /external/lib/fdt/include/ |
| A D | libfdt.h | 239 #define fdt_for_each_subnode(node, fdt, parent) \ argument
240 for (node = fdt_first_subnode(fdt, parent); \
241 node >= 0; \
242 node = fdt_next_subnode(fdt, node))
653 #define fdt_for_each_property_offset(property, fdt, node) \ argument
654 for (property = fdt_first_property_offset(fdt, node); \
|
| /external/lib/lwip/include/lwip/ |
| A D | snmp_structs.h | 257 struct mib_node* snmp_search_tree(struct mib_node *node, u8_t ident_len, s32_t *ident, struct snmp_…
258 struct mib_node* snmp_expand_tree(struct mib_node *node, u8_t ident_len, s32_t *ident, struct snmp_…
|
| /external/platform/nrfx/doc/ |
| A D | nrfx.doxyfile | 2299 # class node. If there are many fields or methods and many nodes the graph may
2450 # by representing a node as a red box. Note that doxygen if the number of direct
2451 # children of the root node in a graph is already larger than
2462 # further from the root node will be omitted. Note that setting this option to 1
|
Completed in 21 milliseconds