Home
last modified time | relevance | path

Searched refs:insert_node (Results 1 – 10 of 10) sorted by relevance

/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/binomial_heap_base_/
H A Dinsert_fn_imps.hpp50 insert_node(p_nd); in push()
59 insert_node(node_pointer p_nd) in insert_node() function in PB_DS_CLASS_C_DEC
177 insert_node(p_nd); in modify()
H A Dbinomial_heap_base_.hpp171 insert_node(node_pointer);
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/binomial_heap_base_/
H A Dinsert_fn_imps.hpp50 insert_node(p_nd); in push()
59 insert_node(node_pointer p_nd) in insert_node() function in PB_DS_CLASS_C_DEC
177 insert_node(p_nd); in modify()
H A Dbinomial_heap_base_.hpp171 insert_node(node_pointer);
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dfibonacci_heap.h253 fibonacci_node_t *insert_node (fibonacci_node_t *node);
363 return insert_node (node); in insert()
376 return insert_node (node); in insert()
383 fibonacci_heap<K,V>::insert_node (fibonacci_node_t *node) in insert_node() function
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dfibonacci_heap.h253 fibonacci_node_t *insert_node (fibonacci_node_t *node);
363 return insert_node (node); in insert()
376 return insert_node (node); in insert()
383 fibonacci_heap<K,V>::insert_node (fibonacci_node_t *node) in insert_node() function
/OK3568_Linux_fs/u-boot/fs/ubifs/
H A Dreplay.c350 static int insert_node(struct ubifs_info *c, int lnum, int offs, int len, in insert_node() function
601 err = insert_node(c, lnum, snod->offs, snod->len, in replay_bud()
613 err = insert_node(c, lnum, snod->offs, snod->len, in replay_bud()
653 err = insert_node(c, lnum, snod->offs, snod->len, in replay_bud()
/OK3568_Linux_fs/kernel/fs/ubifs/
H A Dreplay.c383 static int insert_node(struct ubifs_info *c, int lnum, int offs, int len, in insert_node() function
745 err = insert_node(c, lnum, snod->offs, snod->len, hash, in replay_bud()
757 err = insert_node(c, lnum, snod->offs, snod->len, hash, in replay_bud()
797 err = insert_node(c, lnum, snod->offs, snod->len, hash, in replay_bud()
/OK3568_Linux_fs/u-boot/fs/jffs2/
H A Djffs2_1pass.c551 insert_node(struct b_list *list, u32 offset) in insert_node() function
1283 ret = insert_node(&pL->frag, in jffs2_sum_process_sum_data()
1300 ret = insert_node(&pL->dir, in jffs2_sum_process_sum_data()
1697 if (insert_node(&pL->frag, (u32) part->offset + in jffs2_1pass_build_lists()
1732 if (insert_node(&pL->dir, (u32) part->offset + in jffs2_1pass_build_lists()
H A Djffs2_nand_1pass.c94 insert_node(struct b_list *list, struct b_node *new) in insert_node() function
150 return insert_node(list, (struct b_node *)new); in insert_inode()
170 return insert_node(list, (struct b_node *)new); in insert_dirent()