Home
last modified time | relevance | path

Searched full:node (Results 1 – 25 of 176) sorted by relevance

12345678

/nrf52832-nimble/rt-thread/components/dfs/filesystems/uffs/src/uffs/
H A Duffs_tree.c52 static void uffs_InsertToFileEntry(uffs_Device *dev, TreeNode *node);
53 static void uffs_InsertToDirEntry(uffs_Device *dev, TreeNode *node);
54 static void uffs_InsertToDataEntry(uffs_Device *dev, TreeNode *node);
142 static u16 _GetBlockFromNode(u8 type, TreeNode *node) in _GetBlockFromNode() argument
146 return node->u.dir.block; in _GetBlockFromNode()
148 return node->u.file.block; in _GetBlockFromNode()
150 return node->u.data.block; in _GetBlockFromNode()
157 static u16 _GetParentFromNode(u8 type, TreeNode *node)
161 return node->u.dir.parent;
163 return node->u.file.parent;
[all …]
H A Duffs_fs.c54 (obj)->node->u.dir.serial : (obj)->node->u.file.serial \
60 (obj)->node->u.dir.parent : (obj)->node->u.file.parent \
64 ((obj)->node ? GET_OBJ_NODE_SERIAL(obj) : obj->serial)
67 ((obj)->node ? GET_OBJ_NODE_FATHER(obj) : obj->parent)
73 (obj)->node->u.dir.block : (obj)->node->u.file.block \
303 TreeNode *node; in uffs_CreateObjectEx() local
333 node = uffs_TreeFindFileNodeByName(obj->dev, obj->name, in uffs_CreateObjectEx()
336 if (node != NULL) { in uffs_CreateObjectEx()
341 obj->node = uffs_TreeFindDirNodeByName(obj->dev, obj->name, in uffs_CreateObjectEx()
344 if (obj->node != NULL) { in uffs_CreateObjectEx()
[all …]
H A Duffs_find.c55 TreeNode *node, in _LoadObjectInfo() argument
62 buf = uffs_BufGetEx(dev, (u8)type, node, 0, 0); in _LoadObjectInfo()
74 info->serial = node->u.dir.serial; in _LoadObjectInfo()
77 info->len = node->u.file.len; in _LoadObjectInfo()
78 info->serial = node->u.file.serial; in _LoadObjectInfo()
95 * \node the obj should be openned before call this function.
115 ret = _LoadObjectInfo(dev, obj->node, info, obj->type, err); in uffs_GetObjectInfo()
162 TreeNode *node; in uffs_FindObjectOpenEx() local
167 node = uffs_TreeFindDirNode(dev, dir); in uffs_FindObjectOpenEx()
169 if (node == NULL) in uffs_FindObjectOpenEx()
[all …]
/nrf52832-nimble/rt-thread/components/finsh/
H A Dfinsh_compiler.c24 static int finsh_compile(struct finsh_node* node) in finsh_compile() argument
26 if (node != NULL) in finsh_compile()
28 /* compile child node */ in finsh_compile()
29 if (finsh_node_child(node) != NULL) in finsh_compile()
30 finsh_compile(finsh_node_child(node)); in finsh_compile()
32 /* compile current node */ in finsh_compile()
33 switch (node->node_type) in finsh_compile()
38 if (node->idtype & FINSH_IDTYPE_SYSCALL) in finsh_compile()
42 finsh_code_dword((long)node->id.syscall->func); in finsh_compile()
45 else if (node->idtype & FINSH_IDTYPE_SYSVAR) in finsh_compile()
[all …]
H A Dfinsh_node.c41 /* return this allocated node */ in finsh_node_allocate()
47 struct finsh_node* node; in finsh_node_new_id() local
53 node = NULL; in finsh_node_new_id()
73 /* allocate a new node */ in finsh_node_new_id()
74 node = finsh_node_allocate(FINSH_NODE_ID); in finsh_node_new_id()
76 /* allocate node error */ in finsh_node_new_id()
77 if (node == NULL) in finsh_node_new_id()
83 /* fill node value according type */ in finsh_node_new_id()
87 node->id.var = (struct finsh_var*)symbol; in finsh_node_new_id()
91 node->id.sysvar = (struct finsh_sysvar*)symbol; in finsh_node_new_id()
[all …]
H A Dfinsh_heap.c149 struct finsh_block_header* node; in finsh_block_insert() local
158 node = *list; in finsh_block_insert()
160 if (node > header) in finsh_block_insert()
162 /* insert node in the header of list */ in finsh_block_insert()
163 header->next = node; in finsh_block_insert()
170 for (node = *list; node; node = node->next) in finsh_block_insert()
172 if (node->next > header) break; in finsh_block_insert()
174 if (node->next == NULL) break; in finsh_block_insert()
178 /* insert node */ in finsh_block_insert()
179 if (node->next != NULL) header->next = node->next; in finsh_block_insert()
[all …]
H A Dfinsh_parser.c83 struct finsh_node *node; in proc_variable_decl() local
87 node = NULL; in proc_variable_decl()
128 node = end; in proc_variable_decl()
157 /* make assign expression node */ in proc_variable_decl()
158 if (node != NULL) in proc_variable_decl()
166 node = end; in proc_variable_decl()
175 return node; in proc_variable_decl()
186 /* make assign expression node */ in proc_variable_decl()
188 node = end; in proc_variable_decl()
214 /* make assign expression node */ in proc_variable_decl()
[all …]
/nrf52832-nimble/packages/NimBLE-latest/nimble/host/mesh/include/mesh/
H A Dslist.h54 * @param __sn A sys_snode_t pointer to peek each node of the list
61 * @brief Provide the primitive to iterate on a list, from a node in the list
70 * Like SYS_SLIST_FOR_EACH_NODE(), but __dn already contains a node in the list
77 * @param __sn A sys_snode_t pointer to peek each node of the list
78 * it contains the starting node, or NULL to start from the head
99 * @param __sn A sys_snode_t pointer to peek each node of the list
109 * @brief Provide the primitive to resolve the container of a list node
213 * @brief Peek the first node from the list
215 * @param list A point on the list to peek the first node from
217 * @return A pointer on the first node of the list (or NULL if none)
[all …]
/nrf52832-nimble/rt-thread/components/dfs/filesystems/jffs2/src/
H A Dnodelist.c34 JFFS2_DBG_DENTLIST("Eep! Marking new dirent node is obsolete, old is \"%s\", ino #%u\n", in jffs2_add_fd_to_list()
56 if (this->node) { in jffs2_obsolete_node_frag()
57 this->node->frags--; in jffs2_obsolete_node_frag()
58 if (!this->node->frags) { in jffs2_obsolete_node_frag()
59 /* The node has no valid frags left. It's totally obsoleted */ in jffs2_obsolete_node_frag()
60 JFFS2_DBG_FRAGTREE2("marking old node @0x%08x (0x%04x-0x%04x) obsolete\n", in jffs2_obsolete_node_frag()
61 ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size); in jffs2_obsolete_node_frag()
62 jffs2_mark_node_obsolete(c, this->node->raw); in jffs2_obsolete_node_frag()
63 jffs2_free_full_dnode(this->node); in jffs2_obsolete_node_frag()
65 JFFS2_DBG_FRAGTREE2("marking old node @0x%08x (0x%04x-0x%04x) REF_NORMAL. frags is %d\n", in jffs2_obsolete_node_frag()
[all …]
H A Ddebug.c41 struct jffs2_full_dnode *fn = frag->node; in __jffs2_dbg_fragtree_paranoia_check_nolock()
48 JFFS2_ERROR("REF_PRISTINE node at 0x%08x had %d frags. Tell dwmw2.\n", in __jffs2_dbg_fragtree_paranoia_check_nolock()
53 /* A hole node which isn't multi-page should be garbage-collected in __jffs2_dbg_fragtree_paranoia_check_nolock()
55 rather than mucking around with actually reading the node in __jffs2_dbg_fragtree_paranoia_check_nolock()
57 to tell a hole node. */ in __jffs2_dbg_fragtree_paranoia_check_nolock()
59 && frag_prev(frag)->size < PAGE_CACHE_SIZE && frag_prev(frag)->node) { in __jffs2_dbg_fragtree_paranoia_check_nolock()
60 JFFS2_ERROR("REF_PRISTINE node at 0x%08x had a previous non-hole frag " in __jffs2_dbg_fragtree_paranoia_check_nolock()
66 && frag_next(frag)->size < PAGE_CACHE_SIZE && frag_next(frag)->node) { in __jffs2_dbg_fragtree_paranoia_check_nolock()
67 JFFS2_ERROR("REF_PRISTINE node at 0x%08x (%08x-%08x) had a following " in __jffs2_dbg_fragtree_paranoia_check_nolock()
111 JFFS2_ERROR("argh, about to write node to %#08x on flash, but there are data " in __jffs2_dbg_prewrite_paranoia_check()
[all …]
H A Dscan.c170 /* Only a CLEANMARKER node is valid */ in jffs2_scan_medium()
310 struct jffs2_unknown_node *node; in jffs2_scan_eraseblock() local
409 if (jeb->offset + c->sector_size < ofs + sizeof(*node)) { in jffs2_scan_eraseblock()
411 jeb->offset, c->sector_size, ofs, sizeof(*node))); in jffs2_scan_eraseblock()
416 if (buf_ofs + buf_len < ofs + sizeof(*node)) { in jffs2_scan_eraseblock()
418 …D1(printk(KERN_DEBUG "Fewer than %zd bytes (node header) left to end of buf. Reading 0x%x at 0x%08… in jffs2_scan_eraseblock()
426 node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs]; in jffs2_scan_eraseblock()
477 if (ofs == jeb->offset && je16_to_cpu(node->magic) == KSAMTIB_CIGAM_2SFFJ) { in jffs2_scan_eraseblock()
483 if (je16_to_cpu(node->magic) == JFFS2_DIRTY_BITMASK) { in jffs2_scan_eraseblock()
489 if (je16_to_cpu(node->magic) == JFFS2_OLD_MAGIC_BITMASK) { in jffs2_scan_eraseblock()
[all …]
H A Dgc.c118 * Make a single attempt to progress GC. Move one node, and possibly
138 the node CRCs etc. Do it now. */ in jffs2_garbage_collect_pass()
233 D1(printk(KERN_DEBUG "Node at 0x%08x is obsolete... skipping\n", ref_offset(raw))); in jffs2_garbage_collect_pass()
247 D1(printk(KERN_DEBUG "Going to garbage collect node at 0x%08x\n", ref_offset(raw))); in jffs2_garbage_collect_pass()
250 /* Inode-less node. Clean marker, snapshot or something like that */ in jffs2_garbage_collect_pass()
268 …D1(printk(KERN_DEBUG "jffs2_garbage_collect_pass collecting from block @0x%08x. Node @0x%08x(%d), … in jffs2_garbage_collect_pass()
273 2. Inode is not in-core, node is REF_PRISTINE. We lock the in jffs2_garbage_collect_pass()
274 inocache to prevent a read_inode(), copy the node intact. in jffs2_garbage_collect_pass()
275 3. Inode is not in-core, node is not pristine. We must iget() in jffs2_garbage_collect_pass()
288 D1(printk(KERN_DEBUG "Ino #%u is absent but node not REF_PRISTINE. Reading.\n", in jffs2_garbage_collect_pass()
[all …]
H A Dreadinode.c118 /* Returns first valid node after 'ref'. May return 'ref' */
124 JFFS2_DBG_NODEREF("node at 0x%08x is obsoleted. Ignoring.\n", ref_offset(ref)); in jffs2_first_valid_node()
132 * It is called every time an directory entry node is found.
135 * 1 if the node should be marked obsolete;
156 JFFS2_ERROR("illegal nsize in node at %#08x: nsize %#02x, totlen %#04x\n", in read_direntry()
217 * It is called every time an inode node is found.
220 * 1 if the node should be marked obsolete;
238 /* If we've never checked the CRCs on this node, check them now */ in read_dnode()
244 JFFS2_NOTICE("header CRC failed on node at %#08x: read %#08x, calculated %#08x\n", in read_dnode()
252 JFFS2_WARNING("inode node header CRC is corrupted at %#08x\n", ref_offset(ref)); in read_dnode()
[all …]
/nrf52832-nimble/rt-thread/components/net/lwip_dhcpd/
H A Ddhcp_server_raw.c101 * The dhcp client node struct.
133 * Find a dhcp client node by mac address
138 * @return dhcp client node
143 struct dhcp_client_node *node; in dhcp_client_find_by_mac() local
145 for (node = dhcpserver->node_list; node != NULL; node = node->next) in dhcp_client_find_by_mac()
147 if (memcmp(node->chaddr, chaddr, hlen) == 0) in dhcp_client_find_by_mac()
149 return node; in dhcp_client_find_by_mac()
157 * Find a dhcp client node by ip address
162 * @return dhcp client node
167 struct dhcp_client_node *node; in dhcp_client_find_by_ip() local
[all …]
/nrf52832-nimble/rt-thread/components/net/lwip-1.4.1/src/core/snmp/
H A Dmib_structs.c47 /** node stack entry (old news?) */
64 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()
70 node_stack[node_stack_cnt] = *node; in push_node()
79 pop_node(struct nse* node) in pop_node() argument
84 *node = node_stack[node_stack_cnt]; in pop_node()
86 LWIP_DEBUGF(SNMP_MIB_DEBUG,("pop_node() node=%p id=%"S32_F"\n",(void *)(node->r_ptr),node->r_id)); in pop_node()
205 * Inserts node in idx list in a sorted
207 * allocates the node if needed.
209 * @param rn points to the root node
[all …]
/nrf52832-nimble/rt-thread/tools/
H A Dpymenuconfig.py89 Represents visible menu node and holds all information related to displaying
90 menu node in a Listbox.
93 A node is displayed as a single line of text:
115 - BODY is a menu node prompt. '***' is added if node is a comment
120 node:
163 def __init__(self, mconf, node, indent): argument
165 self.node = node
174 node = self.node
176 v = v and node.prompt is not None
179 v = v and kconfiglib.expr_value(node.prompt[1]) > 0
[all …]
H A Dkconfiglib.py58 The item contained in a menu node is found in MenuNode.item (note that this can
61 (usually only one). Printing a menu node will print its item, in Kconfig
218 MenuNode objects. The top node of the configuration corresponds to an implicit
223 The top node is found in Kconfig.top_node. From there, you can visit child menu
230 MENU and COMMENT. The prompt of the menu node can be found in MenuNode.prompt,
234 Most symbols will only have a single menu node. A symbol defined in multiple
235 locations will have one menu node for each location. The list of menu nodes for
239 menu node(s) rather than in the Symbol or Choice objects themselves. This makes
242 single menu node, do sym.nodes[0].help and sym.nodes[0].prompt, respectively.
554 The menu node (see the MenuNode class) of the implicit top-level menu.
[all …]
/nrf52832-nimble/rt-thread/include/
H A Drtservice.h53 * @brief insert a node after a list
56 * @param n new node to be inserted
68 * @brief insert a node before a list
70 * @param n new node to be inserted
83 * @brief remove node from list.
84 * @param n the node to remove from the list.
122 * @param node the entry point
126 #define rt_list_entry(node, type, member) \ argument
127 rt_container_of(node, type, member)
196 struct rt_slist_node *node; in rt_slist_append() local
[all …]
/nrf52832-nimble/rt-thread/components/net/lwip-2.0.2/src/apps/snmp/
H A Dsnmp_mib2_ip.c52 …_node node_name ## _synced = SNMP_CREATE_THREAD_SYNC_NODE(oid, &node_name.node, &snmp_mib2_lwip_lo…
67 switch (instance->node->oid) { in ip_get_value()
139 LWIP_DEBUGF(SNMP_MIB_DEBUG,("ip_get_value(): unknown id: %"S32_F"\n", instance->node->oid)); in ip_get_value()
149 * @param instance node instance
163 switch (instance->node->oid) { in ip_set_test()
182 LWIP_DEBUGF(SNMP_MIB_DEBUG,("ip_set_test(): unknown id: %"S32_F"\n", instance->node->oid)); in ip_set_test()
691 &SYNC_NODE_NAME(ip_Forwarding).node.node,
692 &SYNC_NODE_NAME(ip_DefaultTTL).node.node,
693 &SYNC_NODE_NAME(ip_InReceives).node.node,
694 &SYNC_NODE_NAME(ip_InHdrErrors).node.node,
[all …]
H A Dsnmp_mib2_tcp.c53 …_node node_name ## _synced = SNMP_CREATE_THREAD_SYNC_NODE(oid, &node_name.node, &snmp_mib2_lwip_lo…
67 switch (instance->node->oid) { in tcp_get_value()
132 LWIP_DEBUGF(SNMP_MIB_DEBUG,("tcp_get_value(): unknown id: %"S32_F"\n", instance->node->oid)); in tcp_get_value()
570 &SYNC_NODE_NAME(tcp_RtoAlgorithm).node.node,
571 &SYNC_NODE_NAME(tcp_RtoMin).node.node,
572 &SYNC_NODE_NAME(tcp_RtoMax).node.node,
573 &SYNC_NODE_NAME(tcp_MaxConn).node.node,
574 &SYNC_NODE_NAME(tcp_ActiveOpens).node.node,
575 &SYNC_NODE_NAME(tcp_PassiveOpens).node.node,
576 &SYNC_NODE_NAME(tcp_AttemptFails).node.node,
[all …]
H A Dsnmp_core.c59 * - Comfortable node types and helper functions for scalar arrays and tables.
781 node_instance->node = mn; in snmp_get_node_instance_from_oid()
792 …LWIP_DEBUGF(SNMP_DEBUG, ("SNMP inconsistent access: node is readable but no get_value function is … in snmp_get_node_instance_from_oid()
795 …LWIP_DEBUGF(SNMP_DEBUG, ("SNMP inconsistent access: node is writable but no set_value and/or set_t… in snmp_get_node_instance_from_oid()
828 /* resolve target node from MIB, skip to next MIB if no suitable node is found in current MIB */ in snmp_get_next_node_instance_from_oid()
832 …/* check if OID directly references a node inside current MIB, in this case we have to ask this no… in snmp_get_next_node_instance_from_oid()
835 snmp_oid_assign(node_oid, start_oid, start_oid_len - oid_instance_len); /* set oid to node */ in snmp_get_next_node_instance_from_oid()
838 … reference a node, search for the next closest node inside MIB; set instance_oid.len to zero becau… in snmp_get_next_node_instance_from_oid()
843 …/* validate the node; if the node has no further instance or the returned instance is invalid, sea… in snmp_get_next_node_instance_from_oid()
844 node_instance->node = mn; in snmp_get_next_node_instance_from_oid()
[all …]
/nrf52832-nimble/rt-thread/components/net/lwip-2.1.0/src/apps/snmp/
H A Dsnmp_mib2_ip.c52 …_node node_name ## _synced = SNMP_CREATE_THREAD_SYNC_NODE(oid, &node_name.node, &snmp_mib2_lwip_lo…
67 switch (instance->node->oid) { in ip_get_value()
139 LWIP_DEBUGF(SNMP_MIB_DEBUG, ("ip_get_value(): unknown id: %"S32_F"\n", instance->node->oid)); in ip_get_value()
149 * @param instance node instance
163 switch (instance->node->oid) { in ip_set_test()
182 LWIP_DEBUGF(SNMP_MIB_DEBUG, ("ip_set_test(): unknown id: %"S32_F"\n", instance->node->oid)); in ip_set_test()
679 &SYNC_NODE_NAME(ip_Forwarding).node.node,
680 &SYNC_NODE_NAME(ip_DefaultTTL).node.node,
681 &SYNC_NODE_NAME(ip_InReceives).node.node,
682 &SYNC_NODE_NAME(ip_InHdrErrors).node.node,
[all …]
H A Dsnmp_mib2_tcp.c53 …_node node_name ## _synced = SNMP_CREATE_THREAD_SYNC_NODE(oid, &node_name.node, &snmp_mib2_lwip_lo…
67 switch (instance->node->oid) { in tcp_get_value()
139 LWIP_DEBUGF(SNMP_MIB_DEBUG, ("tcp_get_value(): unknown id: %"S32_F"\n", instance->node->oid)); in tcp_get_value()
581 &SYNC_NODE_NAME(tcp_RtoAlgorithm).node.node,
582 &SYNC_NODE_NAME(tcp_RtoMin).node.node,
583 &SYNC_NODE_NAME(tcp_RtoMax).node.node,
584 &SYNC_NODE_NAME(tcp_MaxConn).node.node,
585 &SYNC_NODE_NAME(tcp_ActiveOpens).node.node,
586 &SYNC_NODE_NAME(tcp_PassiveOpens).node.node,
587 &SYNC_NODE_NAME(tcp_AttemptFails).node.node,
[all …]
/nrf52832-nimble/packages/NimBLE-latest/nimble/host/mesh/
H A Dsyscfg.yml53 This option determines for how long the local node advertises
54 using Node Identity. The given value is in seconds. The
63 node supports.
119 based on what kind of features the local node shoule have. E.g.
134 In order to fulfil the above requirement, even if the node might
136 how many hours the node has been in the state. This doesn't
139 ways that the node will be used and what kind of power source it
145 duration that the node has been in the current state gets
176 models the local node supports, i.e. what's the largest
177 message payload that the node needs to be able to send.
[all …]
/nrf52832-nimble/rt-thread/components/dfs/src/
H A Dpoll.c55 struct rt_poll_node *node; in _poll_add() local
57 node = rt_malloc(sizeof(struct rt_poll_node)); in _poll_add()
58 if (node == RT_NULL) in _poll_add()
63 node->wqn.key = req->_key; in _poll_add()
64 rt_list_init(&(node->wqn.list)); in _poll_add()
65 node->wqn.polling_thread = pt->polling_thread; in _poll_add()
66 node->wqn.wakeup = __wqueue_pollwake; in _poll_add()
67 node->next = pt->nodes; in _poll_add()
68 node->pt = pt; in _poll_add()
69 pt->nodes = node; in _poll_add()
[all …]

12345678