/u-boot/include/linux/ |
A D | list.h | 48 new->next = next; in __list_add() 89 prev->next = next; in __list_del() 115 new->next = old->next; in list_replace() 213 list->next = head->next; in __list_cut_position() 259 last->next = next; in __list_splice() 623 n->next = next; in hlist_add_before() 624 next->pprev = &n->next; in hlist_add_before() 631 next->next = n->next; in hlist_add_after() 632 n->next = next; in hlist_add_after() 635 if(next->next) in hlist_add_after() [all …]
|
/u-boot/scripts/kconfig/ |
A D | list.h | 25 struct list_head *next, *prev; member 63 n = list_entry(pos->member.next, typeof(*pos), member); \ 73 return head->next == head; in list_empty() 84 struct list_head *next) in __list_add() argument 86 next->prev = _new; in __list_add() 87 _new->next = next; in __list_add() 89 prev->next = _new; in __list_add() 114 next->prev = prev; in __list_del() 115 prev->next = next; in __list_del() 128 __list_del(entry->prev, entry->next); in list_del() [all …]
|
A D | menu.c | 59 last_entry_ptr = &menu->next; in menu_add_entry() 73 last_entry_ptr = ¤t_menu->next; in menu_end_menu() 451 for (menu = parent->next; menu; menu = menu->next) { in menu_finalize() 458 goto next; in menu_finalize() 481 next: in menu_finalize() 488 parent->list = parent->next; in menu_finalize() 489 parent->next = last_menu->next; in menu_finalize() 490 last_menu->next = NULL; in menu_finalize() 567 if (!last_menu->next) in menu_finalize() 570 last_menu->next = menu->next; in menu_finalize() [all …]
|
/u-boot/lib/ |
A D | list_sort.c | 32 tail->next = a; in merge() 33 a = a->next; in merge() 35 tail->next = b; in merge() 36 b = b->next; in merge() 40 tail->next = a?:b; in merge() 41 return head.next; in merge() 62 tail->next = a; in merge_and_restore_back_links() 64 a = a->next; in merge_and_restore_back_links() 68 b = b->next; in merge_and_restore_back_links() 81 (*cmp)(priv, tail->next, tail->next); in merge_and_restore_back_links() [all …]
|
/u-boot/test/ |
A D | time_ut.c | 15 ulong base, start, next, diff; in test_get_timer() local 22 next = get_timer(0); in test_get_timer() 23 } while (start == next); in test_get_timer() 25 if (start + 1 != next) { in test_get_timer() 27 __func__, iter, start, next); in test_get_timer() 49 ulong prev, next, min = 1000000; in test_timer_get_us() local 56 next = timer_get_us(); in test_timer_get_us() 57 if (next != prev) { in test_timer_get_us() 58 delta = next - prev; in test_timer_get_us() 61 __func__, prev, next); in test_timer_get_us() [all …]
|
/u-boot/lib/efi_loader/ |
A D | efi_var_mem.c | 53 if (next) in efi_var_mem_compare() 73 if (next) { in efi_var_mem_find() 75 if (*next >= last) in efi_var_mem_find() 76 *next = NULL; in efi_var_mem_find() 82 if (next && *next >= last) in efi_var_mem_find() 83 *next = NULL; in efi_var_mem_find() 97 if (next) in efi_var_mem_find() 98 *next = pos; in efi_var_mem_find() 104 if (next) in efi_var_mem_find() 105 *next = NULL; in efi_var_mem_find() [all …]
|
/u-boot/fs/btrfs/ |
A D | extent-cache.c | 163 struct rb_node *next; in search_cache_extent() local 172 node = next; in search_cache_extent() 183 struct rb_node *next; in search_cache_extent2() local 193 node = next; in search_cache_extent2() 284 next = cache; in add_merge_cache_extent() 295 BUG_ON(next && start + size > next->start); in add_merge_cache_extent() 298 if (next && start + size == next->start) { in add_merge_cache_extent() 300 next->size = next->start + next->size - start; in add_merge_cache_extent() 301 next->start = start; in add_merge_cache_extent() 306 next->size = next->start + next->size - prev->start; in add_merge_cache_extent() [all …]
|
A D | ctree.c | 610 struct extent_buffer *next = NULL; in btrfs_prev_leaf() local 629 if (IS_ERR(next)) in btrfs_prev_leaf() 630 return PTR_ERR(next); in btrfs_prev_leaf() 640 slot = btrfs_header_nritems(next); in btrfs_prev_leaf() 643 path->nodes[level] = next; in btrfs_prev_leaf() 647 next = read_node_slot(fs_info, next, slot); in btrfs_prev_leaf() 649 if (IS_ERR(next)) in btrfs_prev_leaf() 650 return PTR_ERR(next); in btrfs_prev_leaf() 671 struct extent_buffer *next = NULL; in btrfs_next_sibling_tree_block() local 697 path->nodes[level] = next; in btrfs_next_sibling_tree_block() [all …]
|
/u-boot/arch/powerpc/dts/ |
A D | t104xsi-pre.dtsi | 51 next-level-cache = <&L2_1>; 54 next-level-cache = <&cpc>; 61 next-level-cache = <&L2_2>; 64 next-level-cache = <&cpc>; 71 next-level-cache = <&L2_3>; 74 next-level-cache = <&cpc>; 81 next-level-cache = <&L2_4>; 84 next-level-cache = <&cpc>;
|
/u-boot/arch/mips/lib/ |
A D | bootm.c | 91 next = bootargs; in linux_cmdline_legacy() 95 next = strchr(bootargs, ' '); in linux_cmdline_legacy() 97 while (next && quote && quote < next) { in linux_cmdline_legacy() 102 next = strchr(quote + 1, '"'); in linux_cmdline_legacy() 103 if (next) { in linux_cmdline_legacy() 104 quote = strchr(next + 1, '"'); in linux_cmdline_legacy() 105 next = strchr(next + 1, ' '); in linux_cmdline_legacy() 109 if (!next) in linux_cmdline_legacy() 114 if (*next) in linux_cmdline_legacy() 115 next++; in linux_cmdline_legacy() [all …]
|
/u-boot/tools/buildman/ |
A D | test.py | 299 self.assertEqual(next(lines).text, 312 self.assertEqual(next(lines).text, 333 self.assertEqual(next(lines).text, 338 next(lines).text, 352 self.assertEqual(next(lines).text, 357 next(lines).text, 373 self.assertEqual(next(lines).text, 375 self.assertEqual(next(lines).text, 395 next(lines).text, 398 self.assertEqual(next(lines).text, [all …]
|
/u-boot/tools/patman/ |
A D | func_test.py | 232 prev = next(lines) 919 next(lines)) 928 next(lines)) 934 next(lines)) 939 next(lines)) 944 None), next(lines)) 1237 next(lines)) 1258 next(lines)) 1263 next(lines)) 1268 next(lines)) [all …]
|
/u-boot/fs/jffs2/ |
A D | mergesort.c | 26 q = q->next; in sort_list() 37 q = q->next; in sort_list() 41 p = p->next; in sort_list() 44 e->next = NULL; /* break accidental loops. */ in sort_list() 46 tail = &e->next; in sort_list()
|
A D | summary.h | 86 union jffs2_sum_mem *next; member 92 union jffs2_sum_mem *next; member 102 union jffs2_sum_mem *next; member 116 union jffs2_sum_mem *next; member 126 union jffs2_sum_mem *next; member
|
/u-boot/net/ |
A D | eth_legacy.c | 73 dev = dev->next; in eth_get_dev_by_name() 93 dev = dev->next; in eth_get_dev_by_index() 132 dev = dev->next; in on_ethaddr() 202 for (d = eth_devices; d->next != eth_devices; d = d->next) in eth_register() 204 d->next = dev; in eth_register() 222 for (cur = eth_devices; cur->next != eth_devices && cur->next != dev; in eth_unregister() 223 cur = cur->next) in eth_unregister() 227 if (cur->next != dev) in eth_unregister() 230 cur->next = dev->next; in eth_unregister() 233 eth_devices = dev->next == eth_devices ? NULL : dev->next; in eth_unregister() [all …]
|
/u-boot/arch/arm/lib/ |
A D | cache.c | 113 phys_addr_t next = ALIGN(noncached_next, align); in noncached_alloc() local 115 if (next >= noncached_end || (noncached_end - next) < size) in noncached_alloc() 118 debug("allocated %zu bytes of uncached memory @%pa\n", size, &next); in noncached_alloc() 119 noncached_next = next + size; in noncached_alloc() 121 return next; in noncached_alloc()
|
/u-boot/arch/sandbox/cpu/ |
A D | os.c | 422 struct os_dirent_node *next; in os_dirent_free() local 425 next = node->next; in os_dirent_free() 427 node = next; in os_dirent_free() 465 if (!next) { in os_dirent_ls() 476 free(next); in os_dirent_ls() 482 next->next = NULL; in os_dirent_ls() 486 next->type = OS_FILET_REG; in os_dirent_ls() 497 next->size = 0; in os_dirent_ls() 500 next->size = buf.st_size; in os_dirent_ls() 502 node->next = next; in os_dirent_ls() [all …]
|
/u-boot/cmd/ |
A D | bootmenu.c | 33 struct bootmenu_entry *next; /* next menu entry (num+1) */ member 245 iter = iter->next; in bootmenu_choice_entry() 250 while (iter->next) in bootmenu_choice_entry() 251 iter = iter->next; in bootmenu_choice_entry() 266 struct bootmenu_entry *next; in bootmenu_destroy() local 269 next = iter->next; in bootmenu_destroy() 273 iter = next; in bootmenu_destroy() 336 entry->next = NULL; in bootmenu_create() 341 iter->next = entry; in bootmenu_create() 373 entry->next = NULL; in bootmenu_create() [all …]
|
/u-boot/fs/yaffs2/ |
A D | yaffs_allocator.c | 35 struct yaffs_tnode_list *next; member 40 struct yaffs_obj_list *next; member 69 tmp = allocator->alloc_tnode_list->next; in yaffs_deinit_raw_tnodes() 104 struct yaffs_tnode *next; in yaffs_create_tnodes() local 128 next = (struct yaffs_tnode *)&mem[(i + 1) * dev->tnode_size]; in yaffs_create_tnodes() 129 curr->internal[0] = next; in yaffs_create_tnodes() 150 tnl->next = allocator->alloc_tnode_list; in yaffs_create_tnodes() 232 tmp = allocator->allocated_obj_list->next; in yaffs_deinit_raw_objs() 282 list->next = allocator->allocated_obj_list; in yaffs_create_free_objs() 304 lh = allocator->free_objs.next; in yaffs_alloc_raw_obj()
|
/u-boot/common/ |
A D | cli_simple.c | 320 char *line, *next; in cli_simple_run_command_list() local 327 next = cmd; in cli_simple_run_command_list() 329 while (*next) { in cli_simple_run_command_list() 330 if (*next == '\n') { in cli_simple_run_command_list() 331 *next = '\0'; in cli_simple_run_command_list() 340 line = next + 1; in cli_simple_run_command_list() 342 ++next; in cli_simple_run_command_list()
|
/u-boot/arch/arm/dts/ |
A D | meson-g12b.dtsi | 52 next-level-cache = <&l2>; 62 next-level-cache = <&l2>; 72 next-level-cache = <&l2>; 82 next-level-cache = <&l2>; 92 next-level-cache = <&l2>; 102 next-level-cache = <&l2>;
|
A D | k3-am654.dtsi | 47 next-level-cache = <&L2_0>; 61 next-level-cache = <&L2_0>; 75 next-level-cache = <&L2_1>; 89 next-level-cache = <&L2_1>; 99 next-level-cache = <&msmc_l3>; 108 next-level-cache = <&msmc_l3>;
|
A D | fsl-imx8-ca35.dtsi | 20 next-level-cache = <&A35_L2>; 29 next-level-cache = <&A35_L2>; 38 next-level-cache = <&A35_L2>; 47 next-level-cache = <&A35_L2>;
|
/u-boot/lib/zlib/ |
A D | inftrees.c | 50 code FAR *next; /* next available space in table */ in inflate_table() local 198 next = *table; /* current table to fill in */ in inflate_table() 231 next[(huff >> drop) + fill] = this; in inflate_table() 259 next += min; /* here min is 1 << curr */ in inflate_table() 280 (*table)[low].val = (unsigned short)(next - *table); in inflate_table() 299 next = *table; in inflate_table() 304 next[huff >> drop] = this; in inflate_table()
|
/u-boot/lib/acpi/ |
A D | acpi_dp.c | 68 for (dp = array->next; dp; dp = dp->next) { in acpi_dp_write_array() 80 struct acpi_dp *p = dp->next; in acpi_dp_free() 113 prop = table->next; in acpi_dp_write_internal() 119 for (dp = prop; dp; dp = dp->next) { in acpi_dp_write_internal() 162 for (dp = prop; dp; dp = dp->next) in acpi_dp_write_internal() 173 for (dp = prop; dp; dp = dp->next) { in acpi_dp_write_internal() 214 while (dp->next) in acpi_dp_new() 215 dp = dp->next; in acpi_dp_new() 216 dp->next = new; in acpi_dp_new()
|