Home
last modified time | relevance | path

Searched refs:btree_node (Results 1 – 25 of 121) sorted by relevance

12345

/dports/devel/libfsapfs/libfsapfs-20210424/tests/
H A Dfsapfs_test_btree_node.c330 btree_node ); in fsapfs_test_btree_node_initialize()
347 btree_node ); in fsapfs_test_btree_node_initialize()
490 &btree_node, in fsapfs_test_btree_node_initialize()
557 btree_node ); in fsapfs_test_btree_node_read_data()
613 btree_node ); in fsapfs_test_btree_node_read_data()
632 btree_node ); in fsapfs_test_btree_node_read_data()
821 btree_node ); in fsapfs_test_btree_node_read_data()
838 &btree_node, in fsapfs_test_btree_node_read_data()
867 btree_node ); in fsapfs_test_btree_node_read_object_data()
1005 btree_node ); in fsapfs_test_btree_node_read_object_data()
[all …]
/dports/devel/libfsapfs/libfsapfs-20210424/libfsapfs/
H A Dlibfsapfs_btree_node.c49 if( btree_node == NULL ) in libfsapfs_btree_node_initialize()
60 if( *btree_node != NULL ) in libfsapfs_btree_node_initialize()
86 *btree_node, in libfsapfs_btree_node_initialize()
98 *btree_node ); in libfsapfs_btree_node_initialize()
100 *btree_node = NULL; in libfsapfs_btree_node_initialize()
124 *btree_node ); in libfsapfs_btree_node_initialize()
126 *btree_node = NULL; in libfsapfs_btree_node_initialize()
141 if( btree_node == NULL ) in libfsapfs_btree_node_free()
201 *btree_node ); in libfsapfs_btree_node_free()
203 *btree_node = NULL; in libfsapfs_btree_node_free()
[all …]
H A Dlibfsapfs_btree_node.h64 libfsapfs_btree_node_t **btree_node,
68 libfsapfs_btree_node_t **btree_node,
72 libfsapfs_btree_node_t *btree_node,
78 libfsapfs_btree_node_t *btree_node,
84 libfsapfs_btree_node_t *btree_node,
88 libfsapfs_btree_node_t *btree_node,
93 libfsapfs_btree_node_t *btree_node,
/dports/devel/libfshfs/libfshfs-20210722/tests/
H A Dfshfs_test_btree_node.c59 &btree_node, in fshfs_test_btree_node_initialize()
70 btree_node ); in fshfs_test_btree_node_initialize()
77 &btree_node, in fshfs_test_btree_node_initialize()
87 btree_node ); in fshfs_test_btree_node_initialize()
115 &btree_node, in fshfs_test_btree_node_initialize()
119 btree_node = NULL; in fshfs_test_btree_node_initialize()
172 &btree_node, in fshfs_test_btree_node_initialize()
185 btree_node ); in fshfs_test_btree_node_initialize()
215 &btree_node, in fshfs_test_btree_node_initialize()
228 btree_node ); in fshfs_test_btree_node_initialize()
[all …]
/dports/astro/gpsbabel/gpsbabel-gpsbabel_1_7_0/
H A Dduplicate.h66 struct btree_node { struct
67 btree_node* left; argument
68 btree_node* right; argument
73 btree_node* addnode(btree_node* tree, btree_node* newnode, btree_node** oldnode); argument
74 void free_tree(btree_node* tree);
H A Dduplicate.cc36 DuplicateFilter::btree_node* DuplicateFilter::addnode(btree_node* tree, btree_node* newnode, btree_… in addnode()
38 btree_node* last = nullptr; in addnode()
48 btree_node* tmp = tree; in addnode()
73 void DuplicateFilter::free_tree(btree_node* tree) in free_tree()
143 btree_node* newnode, * btmp, * sup_tree = nullptr; in process()
144 btree_node* oldnode = nullptr; in process()
191 newnode = (btree_node*)xcalloc(sizeof(btree_node), 1); in process()
/dports/astro/gpsbabel14/gpsbabel-1.4.4/
H A Dduplicate.c53 typedef struct btree_node { struct
54 struct btree_node* left, *right; argument
57 } btree_node; argument
59 static btree_node*
60 addnode(btree_node* tree, btree_node* newnode, btree_node** oldnode) in addnode()
62 btree_node* tmp, * last = NULL; in addnode()
98 free_tree(btree_node* tree) in free_tree()
178 btree_node* newnode, * btmp, * sup_tree = NULL; in duplicate_process()
179 btree_node* oldnode = NULL; in duplicate_process()
228 newnode = (btree_node*)xcalloc(sizeof(btree_node), 1); in duplicate_process()
/dports/net/seda/seda-release-20020712/seda/src/seda/nbio/jni/
H A Dmdw-btree.h43 } btree_node; typedef
45 static inline void btree_dump(btree_node *node, int indent) { in btree_dump()
60 static inline void *btree_search(btree_node *node, int key) { in btree_search()
83 static inline btree_node *btree_newnode() { in btree_newnode()
84 btree_node *node = (btree_node *)malloc(sizeof(btree_node)); in btree_newnode()
93 static inline void btree_split_child(btree_node *node, int index, btree_node *child) { in btree_split_child()
94 btree_node *newnode = btree_newnode(); in btree_split_child()
138 static inline void btree_insert_nonfull(btree_node *node, int key, void *data) { in btree_insert_nonfull()
157 btree_node *child; in btree_insert_nonfull()
182 static inline btree_node *btree_insert(btree_node *tree, int key, void *data) { in btree_insert()
[all …]
/dports/multimedia/v4l_compat/linux-5.13-rc2/drivers/md/persistent-data/
H A Ddm-btree-remove.c82 static void node_copy(struct btree_node *left, struct btree_node *right, int shift) in node_copy()
139 struct btree_node *n;
173 static void shift(struct btree_node *left, struct btree_node *right, int count) in shift()
241 struct btree_node *parent; in rebalance2()
271 struct btree_node *left, struct btree_node *center, struct btree_node *right, in delete_center_node()
302 struct btree_node *left, struct btree_node *center, struct btree_node *right, in redistribute3()
412 struct btree_node *n; in rebalance_children()
474 struct btree_node *n; in remove_raw()
524 struct btree_node *n; in dm_btree_remove()
566 struct btree_node *n; in remove_nearest()
[all …]
H A Ddm-btree-internal.h39 struct btree_node { struct
51 void inc_children(struct dm_transaction_manager *tm, struct btree_node *n, argument
74 struct btree_node *ro_node(struct ro_spine *s);
108 static inline __le64 *key_ptr(struct btree_node *n, uint32_t index) in key_ptr()
113 static inline void *value_base(struct btree_node *n) in value_base()
118 static inline void *value_ptr(struct btree_node *n, uint32_t index) in value_ptr()
127 static inline uint64_t value64(struct btree_node *n, uint32_t index) in value64()
137 int lower_bound(struct btree_node *n, uint64_t key);
/dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/md/persistent-data/
H A Ddm-btree-remove.c82 static void node_copy(struct btree_node *left, struct btree_node *right, int shift) in node_copy()
139 struct btree_node *n;
173 static void shift(struct btree_node *left, struct btree_node *right, int count) in shift()
241 struct btree_node *parent; in rebalance2()
271 struct btree_node *left, struct btree_node *center, struct btree_node *right, in delete_center_node()
302 struct btree_node *left, struct btree_node *center, struct btree_node *right, in redistribute3()
412 struct btree_node *n; in rebalance_children()
474 struct btree_node *n; in remove_raw()
524 struct btree_node *n; in dm_btree_remove()
566 struct btree_node *n; in remove_nearest()
[all …]
H A Ddm-btree-internal.h39 struct btree_node { struct
51 void inc_children(struct dm_transaction_manager *tm, struct btree_node *n, argument
74 struct btree_node *ro_node(struct ro_spine *s);
108 static inline __le64 *key_ptr(struct btree_node *n, uint32_t index) in key_ptr()
113 static inline void *value_base(struct btree_node *n) in value_base()
118 static inline void *value_ptr(struct btree_node *n, uint32_t index) in value_ptr()
127 static inline uint64_t value64(struct btree_node *n, uint32_t index) in value64()
137 int lower_bound(struct btree_node *n, uint64_t key);
/dports/multimedia/libv4l/linux-5.13-rc2/drivers/md/persistent-data/
H A Ddm-btree-remove.c82 static void node_copy(struct btree_node *left, struct btree_node *right, int shift) in node_copy()
139 struct btree_node *n;
173 static void shift(struct btree_node *left, struct btree_node *right, int count) in shift()
241 struct btree_node *parent; in rebalance2()
271 struct btree_node *left, struct btree_node *center, struct btree_node *right, in delete_center_node()
302 struct btree_node *left, struct btree_node *center, struct btree_node *right, in redistribute3()
412 struct btree_node *n; in rebalance_children()
474 struct btree_node *n; in remove_raw()
524 struct btree_node *n; in dm_btree_remove()
566 struct btree_node *n; in remove_nearest()
[all …]
H A Ddm-btree-internal.h39 struct btree_node { struct
51 void inc_children(struct dm_transaction_manager *tm, struct btree_node *n, argument
74 struct btree_node *ro_node(struct ro_spine *s);
108 static inline __le64 *key_ptr(struct btree_node *n, uint32_t index) in key_ptr()
113 static inline void *value_base(struct btree_node *n) in value_base()
118 static inline void *value_ptr(struct btree_node *n, uint32_t index) in value_ptr()
127 static inline uint64_t value64(struct btree_node *n, uint32_t index) in value64()
137 int lower_bound(struct btree_node *n, uint64_t key);
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/testsuite/gfortran.dg/
H A Dpr67460.f905 TYPE btree_node type
8 TYPE(btree_node), POINTER :: parent
9 END TYPE btree_node
11 TYPE(btree_node), POINTER :: node
16 TYPE(btree_node), INTENT(IN) :: node
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/gfortran.dg/
H A Dpr67460.f905 TYPE btree_node type
8 TYPE(btree_node), POINTER :: parent
9 END TYPE btree_node
11 TYPE(btree_node), POINTER :: node
16 TYPE(btree_node), INTENT(IN) :: node
/dports/lang/gcc8/gcc-8.5.0/gcc/testsuite/gfortran.dg/
H A Dpr67460.f905 TYPE btree_node type
8 TYPE(btree_node), POINTER :: parent
9 END TYPE btree_node
11 TYPE(btree_node), POINTER :: node
16 TYPE(btree_node), INTENT(IN) :: node
/dports/lang/gcc10/gcc-10.3.0/gcc/testsuite/gfortran.dg/
H A Dpr67460.f905 TYPE btree_node type
8 TYPE(btree_node), POINTER :: parent
9 END TYPE btree_node
11 TYPE(btree_node), POINTER :: node
16 TYPE(btree_node), INTENT(IN) :: node
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/gfortran.dg/
H A Dpr67460.f905 TYPE btree_node type
8 TYPE(btree_node), POINTER :: parent
9 END TYPE btree_node
11 TYPE(btree_node), POINTER :: node
16 TYPE(btree_node), INTENT(IN) :: node
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/testsuite/gfortran.dg/
H A Dpr67460.f905 TYPE btree_node type
8 TYPE(btree_node), POINTER :: parent
9 END TYPE btree_node
11 TYPE(btree_node), POINTER :: node
16 TYPE(btree_node), INTENT(IN) :: node
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/testsuite/gfortran.dg/
H A Dpr67460.f905 TYPE btree_node type
8 TYPE(btree_node), POINTER :: parent
9 END TYPE btree_node
11 TYPE(btree_node), POINTER :: node
16 TYPE(btree_node), INTENT(IN) :: node
/dports/devel/avr-gcc/gcc-10.2.0/gcc/testsuite/gfortran.dg/
H A Dpr67460.f905 TYPE btree_node type
8 TYPE(btree_node), POINTER :: parent
9 END TYPE btree_node
11 TYPE(btree_node), POINTER :: node
16 TYPE(btree_node), INTENT(IN) :: node
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/testsuite/gfortran.dg/
H A Dpr67460.f905 TYPE btree_node type
8 TYPE(btree_node), POINTER :: parent
9 END TYPE btree_node
11 TYPE(btree_node), POINTER :: node
16 TYPE(btree_node), INTENT(IN) :: node
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/testsuite/gfortran.dg/
H A Dpr67460.f905 TYPE btree_node type
8 TYPE(btree_node), POINTER :: parent
9 END TYPE btree_node
11 TYPE(btree_node), POINTER :: node
16 TYPE(btree_node), INTENT(IN) :: node
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/gfortran.dg/
H A Dpr67460.f905 TYPE btree_node type
8 TYPE(btree_node), POINTER :: parent
9 END TYPE btree_node
11 TYPE(btree_node), POINTER :: node
16 TYPE(btree_node), INTENT(IN) :: node

12345