Home
last modified time | relevance | path

Searched full:nodes (Results 1 – 25 of 73) sorted by relevance

123

/nrf52832-nimble/packages/NimBLE-latest/docs/mesh/
H A Dindex.rst19 …ors network. It utilizes managed flood based approach where only mains-powered nodes relay messages
20 making it very power efficient (battery powered low-power nodes that don't relay messages can opera…
37 …elp a node supporting the Low Power feature to operate by storing messages destined for those nodes
46 - Uses LE advertising to broadcast messages to all nodes that are listening at this time
65 Models define basic functionality of nodes on a mesh network. Mesh Profile Specification defines fo…
/nrf52832-nimble/rt-thread/components/dfs/filesystems/jffs2/src/
H A Dbuild.c85 - Scan physical nodes. Build map of inodes/dirents. Allocate inocaches as we go
98 lists of physical nodes */ in jffs2_build_filesystem()
132 …printk(KERN_DEBUG "Pass 2: ino #%u, nlink %d, ic %p, nodes %p\n", ic->ino, ic->nlink, ic, ic->node… in jffs2_build_filesystem()
158 D1(printk(KERN_DEBUG "Pass 3: ino #%u, ic %p, nodes %p\n", ic->ino, ic, ic->nodes)); in jffs2_build_filesystem()
199 raw = ic->nodes; in jffs2_build_remove_unlinked_inode()
258 The erase code will do that, when all the nodes are completely gone. in jffs2_build_remove_unlinked_inode()
273 of the medium to be available, for overhead caused by nodes being in jffs2_calc_trigger_levels()
286 /* When do we allow garbage collection to merge nodes to make in jffs2_calc_trigger_levels()
H A Dreadinode.c63 actually matter. As long as the two nodes with the same in jffs2_add_tn_to_tree()
149 /* The direntry nodes are checked during the flash scanning */ in read_direntry()
351 /* There was a bug where we wrote hole nodes out with in read_dnode()
380 /* We don't mark unknown nodes as REF_UNCHECKED */ in read_unknown()
421 /* Get tmp_dnode_info and full_dirent for all non-obsolete nodes associated
442 valid_ref = jffs2_first_valid_node(f->inocache->nodes); in jffs2_get_inode_nodes()
445 JFFS2_WARNING("no valid nodes for ino #%u\n", f->inocache->ino); in jffs2_get_inode_nodes()
449 but _obsolete_ nodes may disappear at any time, if the block in jffs2_get_inode_nodes()
563 /* Grab all nodes relevant to this ino */ in jffs2_do_read_inode_internal()
567 JFFS2_ERROR("cannot read nodes for ino %u, returned error is %d\n", f->inocache->ino, ret); in jffs2_do_read_inode_internal()
[all …]
H A Dnodemgmt.c22 * jffs2_reserve_space - request physical space to write nodes to flash
73 * of nodes. in jffs2_reserve_space()
90 * don't know, if unchecked size contains obsoleted nodes, which could give us some in jffs2_reserve_space()
92 * of nodes. in jffs2_reserve_space()
295 * Should only be used to report nodes for which space has been allocated
311 /* we could get some obsolete nodes after nextblock was refiled in jffs2_add_physical_node_ref()
409 function without actually obliterating any nodes or freeing in jffs2_mark_node_obsolete()
475 obliterate nodes that look obsolete. If they weren't in jffs2_mark_node_obsolete()
573 /* Nodes which have been marked obsolete no longer need to be in jffs2_mark_node_obsolete()
577 obsolete dirent nodes to stay on the lists, because of the in jffs2_mark_node_obsolete()
[all …]
H A Dnodelist.h88 scan the nodes which are listed for it and build up a proper map of
89 which nodes are currently valid. JFFSv1 always used to keep that whole
103 /* flash_offset & 3 always has to be zero, because nodes are
119 dirent nodes) would take more space than this does. We also keep
128 struct jffs2_raw_node_ref *nodes; member
164 we're actually building up the original map of which nodes go where,
215 /* Calculate totlen from surrounding nodes or eraseblock */
H A Dgc.c182 finished checking all its nodes */ in jffs2_garbage_collect_pass()
236 printk(KERN_WARNING "eep. End of raw list while still supposedly nodes to GC\n"); in jffs2_garbage_collect_pass()
282 We can just copy any pristine nodes, but have in jffs2_garbage_collect_pass()
315 the alloc_sem() (for marking nodes invalid) so we must in jffs2_garbage_collect_pass()
359 the only valid nodes in the block, followed by erasure, in jffs2_garbage_collect_pass()
361 held _all_ the nodes of that inode.... never been seen but in jffs2_garbage_collect_pass()
455 frag->node->raw = f->inocache->nodes; in jffs2_garbage_collect_live()
650 going to be fetched from ic->nodes by our caller. */ in jffs2_garbage_collect_pristine()
652 nraw->next_in_ino = ic->nodes; in jffs2_garbage_collect_pristine()
653 ic->nodes = nraw; in jffs2_garbage_collect_pristine()
[all …]
H A Derase.c227 /* Walk the inode's list once, removing any nodes from this eraseblock */ in jffs2_remove_node_refs_from_ino_list()
234 prev = &ic->nodes; in jffs2_remove_node_refs_from_ino_list()
261 D1(printk(KERN_DEBUG "Removed nodes in range 0x%08x-0x%08x from ino #%u\n", in jffs2_remove_node_refs_from_ino_list()
269 this = ic->nodes; in jffs2_remove_node_refs_from_ino_list()
282 if (ic->nodes == (void *)ic && ic->nlink == 0) in jffs2_remove_node_refs_from_ino_list()
H A Dwrite.c37 f->inocache->nodes = (struct jffs2_raw_node_ref *)f->inocache; in jffs2_do_new_inode()
197 raw->next_in_ino = f->inocache->nodes; in jffs2_write_dnode()
198 f->inocache->nodes = raw; in jffs2_write_dnode()
330 raw->next_in_ino = f->inocache->nodes; in jffs2_write_dirent()
331 f->inocache->nodes = raw; in jffs2_write_dirent()
H A Dscan.c269 … printk(KERN_NOTICE "Cowardly refusing to erase blocks on filesystem with no valid JFFS2 nodes\n"); in jffs2_scan_medium()
686 ic->nodes = (void *)ic; in jffs2_scan_make_ino_cache()
744 raw->next_in_ino = ic->nodes; in jffs2_scan_inode_node()
746 ic->nodes = raw; in jffs2_scan_inode_node()
822 raw->next_in_ino = ic->nodes; in jffs2_scan_dirent_node()
823 ic->nodes = raw; in jffs2_scan_dirent_node()
/nrf52832-nimble/rt-thread/components/dfs/src/
H A Dpoll.c29 struct rt_poll_node *nodes; member
67 node->next = pt->nodes; in _poll_add()
69 pt->nodes = node; in _poll_add()
77 pt->nodes = RT_NULL; in poll_table_init()
193 next = pt->nodes; in poll_teardown()
/nrf52832-nimble/rt-thread/tools/
H A Dkconfiglib.py60 symbols and choices have a 'nodes' attribute containing their menu nodes
224 nodes by following the 'list' pointer, and any following menu nodes by
226 menu or Choice, but menu nodes for symbols can sometimes have a non-None 'list'
235 locations will have one menu node for each location. The list of menu nodes for
236 a Symbol or Choice can be found in the Symbol/Choice.nodes attribute.
242 single menu node, do sym.nodes[0].help and sym.nodes[0].prompt, respectively.
250 hence why Choice.nodes is also a list.
426 symbols, choices, and menu nodes appearing in the configuration. Creating
438 Undefined symbols can be recognized by Symbol.nodes being empty -- see
966 if not sym.nodes:
[all …]
H A Dpymenuconfig.py178 # for menu nodes whether 'visible if' is not false
258 if sym.nodes and sym.nodes[0].prompt is not None:
259 choice_selection = sym.nodes[0].prompt[0]
411 for n in item.nodes:
756 Given first MenuNode of nodes list at some level in menu hierarchy,
757 collects nodes that may be displayed when viewing and editing that
758 hierarchy level. Includes implicit menu nodes, i.e. the ones dependent
969 # for menu nodes whether 'visible if' is not false
/nrf52832-nimble/rt-thread/components/dfs/filesystems/jffs2/include/linux/
H A Djffs2.h36 /* How small can we sensibly write nodes? */
97 jint32_t totlen; /* So we can skip over nodes we don't grok */
165 jint32_t totlen; /* So we can skip over nodes we don't grok */
H A Djffs2_fs_i.h28 /* This also holds the _only_ dnode for symlinks/device nodes,
/nrf52832-nimble/rt-thread/components/dfs/filesystems/uffs/src/inc/uffs/
H A Duffs_mem.h52 void * tree_nodes_pool_buf; //!< tree nodes buffer
57 int tree_nodes_pool_size; //!< tree nodes buffer size
/nrf52832-nimble/rt-thread/components/net/uip/doc/
H A Dpt-doc.txt6 sensor network nodes. Protothreads provides linear code execution for
60 - Sensor network nodes
/nrf52832-nimble/packages/NimBLE-latest/nimble/host/mesh/
H A Dsyscfg.yml216 looking for Friend nodes. If this option is disabled LPN mode
224 will wait before starting to look for Friend nodes.
316 Number of Low Power Nodes the Friend can have a Friendship
/nrf52832-nimble/rt-thread/components/dfs/filesystems/jffs2/kernel/linux/
H A Drbtree.h43 /* Find logical next and previous nodes in a tree */
/nrf52832-nimble/rt-thread/components/dfs/filesystems/uffs/
H A DREADME43 [VARY]Tree nodes: 16 * total_blocks
57 [VARY]Tree nodes: 16 * total_blocks
/nrf52832-nimble/rt-thread/components/net/lwip-1.4.1/src/include/lwip/
H A Dsnmp_structs.h186 /* counts list nodes in list */
237 /** dummy function pointers for non-leaf MIB nodes from mib2.c */
/nrf52832-nimble/rt-thread/components/net/lwip-2.0.2/src/include/lwip/apps/
H A Dsnmp_core.h153 all other nodes are assumed to be leaf nodes.
/nrf52832-nimble/rt-thread/components/net/lwip-2.1.0/src/include/lwip/apps/
H A Dsnmp_core.h158 all other nodes are assumed to be leaf nodes.
/nrf52832-nimble/rt-thread/components/dfs/filesystems/uffs/src/uffs/
H A Duffs_pool.c288 * \brief this is more efficient version for small nodes number memory pool (< 32)
316 * \note This is NOT efficient, don't do it on a pool with large free nodes !
/nrf52832-nimble/packages/NimBLE-latest/apps/blemesh_models_example_1/
H A DREADME.md62 the mesh configuration. As additional nodes (boards) are provisioned, it
/nrf52832-nimble/packages/NimBLE-latest/apps/blemesh_models_example_2/
H A DREADME.md87 the mesh configuration. As additional nodes (boards) are provisioned, it

123