Home
last modified time | relevance | path

Searched refs:depth (Results 1 – 15 of 15) sorted by relevance

/lk-master/lib/fdtwalk/
A Dfdtwalk.c28 DEBUG_ASSERT(depth >= 0 && depth < MAX_DEPTH); in read_address_size_cells()
43 LTRACEF_LEVEL(3, "address-cells %u size-cells %u\n", address_cells[depth], size_cells[depth]); in read_address_size_cells()
53 int depth = 0; in fdt_walk() local
77 if (depth > 0) { in fdt_walk()
78 address_cells[depth] = address_cells[depth - 1]; in fdt_walk()
79 size_cells[depth] = size_cells[depth - 1]; in fdt_walk()
89 name, depth, address_cells[depth], size_cells[depth]); in fdt_walk()
97 address_cells[depth], size_cells[depth]); in fdt_walk()
130 address_cells[depth], size_cells[depth]); in fdt_walk()
158 address_cells[depth], size_cells[depth]); in fdt_walk()
[all …]
/lk-master/external/lib/fdt/
A Dfdt_check.c19 unsigned int depth = 0; in fdt_check_full() local
47 if (depth != 0) in fdt_check_full()
52 depth++; in fdt_check_full()
53 if (depth > INT_MAX) in fdt_check_full()
58 if (depth == 0) in fdt_check_full()
60 depth--; in fdt_check_full()
A Dfdt.c246 if (depth) in fdt_next_node()
247 (*depth)++; in fdt_next_node()
251 if (depth && ((--(*depth)) < 0)) in fdt_next_node()
257 || ((nextoffset == -FDT_ERR_TRUNCATED) && !depth)) in fdt_next_node()
269 int depth = 0; in fdt_first_subnode() local
271 offset = fdt_next_node(fdt, offset, &depth); in fdt_first_subnode()
272 if (offset < 0 || depth != 1) in fdt_first_subnode()
280 int depth = 1; in fdt_next_subnode() local
287 offset = fdt_next_node(fdt, offset, &depth); in fdt_next_subnode()
288 if (offset < 0 || depth < 1) in fdt_next_subnode()
[all …]
A Dfdt_ro.c226 int depth; in fdt_subnode_offset_namelen() local
230 for (depth = 0; in fdt_subnode_offset_namelen()
233 if ((depth == 1) in fdt_subnode_offset_namelen()
237 if (depth < 0) in fdt_subnode_offset_namelen()
543 int offset, depth, namelen; in fdt_get_path() local
551 for (offset = 0, depth = 0; in fdt_get_path()
554 while (pdepth > depth) { in fdt_get_path()
561 if (pdepth >= depth) { in fdt_get_path()
574 if (pdepth < (depth + 1)) in fdt_get_path()
595 int offset, depth; in fdt_supernode_atdepth_offset() local
[all …]
A Dfdt_wip.c75 int depth = 0; in fdt_node_end_offset_() local
77 while ((offset >= 0) && (depth >= 0)) in fdt_node_end_offset_()
78 offset = fdt_next_node(fdt, offset, &depth); in fdt_node_end_offset_()
/lk-master/lib/devicetree/
A Ddevicetree.c150 u32 depth = 0; in dt_walk() local
161 if (depth) in dt_walk()
165 depth++; in dt_walk()
167 if (ncb(depth, p, cookie)) in dt_walk()
171 if (depth == 0) in dt_walk()
173 depth--; in dt_walk()
176 if (depth == 0) in dt_walk()
190 if (depth != 0) in dt_walk()
A Ddevicetreedump.c57 int node_cb(int depth, const char *name, void *cookie) { in node_cb() argument
58 _depth = depth; in node_cb()
59 indent(depth*2); in node_cb()
/lk-master/lib/bcache/
A Dbcache.c30 uint32_t depth; member
109 uint32_t depth = 0; in find_block() local
117 depth++; in find_block()
123 cache->stats.depth += depth; in find_block()
317 cache->stats.hits ? cache->stats.depth / cache->stats.hits : 0, in bcache_dump()
/lk-master/platform/bcm28xx/
A Dplatform.c123 int depth = 0; in platform_early_init() local
126 offset = fdt_next_node(fdt, offset, &depth); in platform_early_init()
A Dmailbox.c106 fb_desc.depth = 32; in init_framebuffer()
130 fb->image.rowbytes = fb_desc.phys_width * fb_desc.depth/8; in display_get_framebuffer()
/lk-master/target/armemu/
A Darmemu.conf23 depth = 32
/lk-master/lib/devicetree/include/lib/
A Ddevicetree.h38 typedef int (*dt_node_cb)(int depth, const char *name, void *cookie);
/lk-master/platform/bcm28xx/include/platform/
A Dmailbox.h68 uint32_t depth; //request member
/lk-master/external/lib/fdt/include/
A Dlibfdt.h179 int fdt_next_node(const void *fdt, int offset, int *depth);
/lk-master/external/platform/nrfx/doc/
A Dnrfx.doxyfile2459 # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
2460 # generated by dot. A depth value of 3 means that only nodes reachable from the
2465 # DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.

Completed in 23 milliseconds