Home
last modified time | relevance | path

Searched refs:trie (Results 1 – 25 of 27) sorted by relevance

12

/OK3568_Linux_fs/kernel/kernel/bpf/
H A Dlpm_trie.c164 static size_t longest_prefix_match(const struct lpm_trie *trie, in longest_prefix_match() argument
179 if (trie->data_size >= 8) { in longest_prefix_match()
192 while (trie->data_size >= i + 4) { in longest_prefix_match()
204 if (trie->data_size >= i + 2) { in longest_prefix_match()
216 if (trie->data_size >= i + 1) { in longest_prefix_match()
229 struct lpm_trie *trie = container_of(map, struct lpm_trie, map); in trie_lookup_elem() local
235 for (node = rcu_dereference(trie->root); node;) { in trie_lookup_elem()
243 matchlen = longest_prefix_match(trie, node, key); in trie_lookup_elem()
244 if (matchlen == trie->max_prefixlen) { in trie_lookup_elem()
273 return found->data + trie->data_size; in trie_lookup_elem()
[all …]
/OK3568_Linux_fs/external/mpp/mpp/base/
H A Dmpp_trie.cpp55 static RK_S32 trie_get_node(MppTrieImpl *trie) in trie_get_node() argument
57 if (trie->node_used >= trie->node_count) { in trie_get_node()
58 RK_S32 old_count = trie->node_count; in trie_get_node()
60 MppTrieNode *new_nodes = mpp_realloc(trie->nodes, MppTrieNode, new_count); in trie_get_node()
71 trie, trie->nodes, trie->node_count, new_nodes, new_count); in trie_get_node()
73 trie->nodes = new_nodes; in trie_get_node()
74 trie->node_count = new_count; in trie_get_node()
77 RK_S32 idx = trie->node_used++; in trie_get_node()
78 MppTrieNode *n = &trie->nodes[idx]; in trie_get_node()
88 MPP_RET mpp_trie_init(MppTrie *trie, RK_S32 node_count, RK_S32 info_count) in mpp_trie_init() argument
[all …]
H A Dmpp_dec_cfg.cpp135 static MppDecCfgInfo *mpp_dec_cfg_flaten(MppTrie trie, MppCfgApi **cfgs) in mpp_dec_cfg_flaten() argument
138 MppTrieNode *node_root = mpp_trie_node_root(trie); in mpp_dec_cfg_flaten()
139 RK_S32 node_count = mpp_trie_get_node_count(trie); in mpp_dec_cfg_flaten()
140 RK_S32 info_count = mpp_trie_get_info_count(trie); in mpp_dec_cfg_flaten()
154 const char **info_trie = mpp_trie_get_info(trie, name); in mpp_dec_cfg_flaten()
228 MppTrie trie; in MppDecCfgService() local
235 ret = mpp_trie_init(&trie, 334, cfg_cnt); in MppDecCfgService()
241 mpp_trie_add_info(trie, &cfgs[i]->name); in MppDecCfgService()
243 mInfo = mpp_dec_cfg_flaten(trie, cfgs); in MppDecCfgService()
246 mpp_trie_deinit(trie); in MppDecCfgService()
H A Dmpp_enc_cfg.cpp272 static MppEncCfgInfo *mpp_enc_cfg_flaten(MppTrie trie, MppCfgApi **cfgs) in mpp_enc_cfg_flaten() argument
275 MppTrieNode *node_root = mpp_trie_node_root(trie); in mpp_enc_cfg_flaten()
276 RK_S32 node_count = mpp_trie_get_node_count(trie); in mpp_enc_cfg_flaten()
277 RK_S32 info_count = mpp_trie_get_info_count(trie); in mpp_enc_cfg_flaten()
291 const char **info_trie = mpp_trie_get_info(trie, name); in mpp_enc_cfg_flaten()
365 MppTrie trie; in MppEncCfgService() local
369 ret = mpp_trie_init(&trie, 1732, cfg_cnt); in MppEncCfgService()
376 mpp_trie_add_info(trie, &cfgs[i]->name); in MppEncCfgService()
378 mInfo = mpp_enc_cfg_flaten(trie, cfgs); in MppEncCfgService()
383 mpp_trie_deinit(trie); in MppEncCfgService()
/OK3568_Linux_fs/yocto/poky/meta/recipes-devtools/apt/apt/
H A Dtriehash303 my ($self, $trie, $prefix) = @_;
305 $trie->insert($prefix, $self->{label}, $self->{value}) if (defined $self->{value});
308 $self->{children}{$key}->reinsert_value_nodes_into($trie, $prefix . $key);
443 my ($self, $trie, $fh, $indent, $index) = @_;
448 if (%{$trie->{children}}) {
457 foreach my $key (sort keys %{$trie->{children}}) {
470 foreach my $key (sort keys %{$trie->{children}}) {
481 … $self->print_table($trie->{children}{$key}, $fh, $indent + 1, $index + length($key));
492 if (defined $trie->{value}) {
493 … { $fh } (' ' x $indent . "return %s;\n", ($enum_class ? "${enum_name}::" : '').$trie->{label});
[all …]
/OK3568_Linux_fs/external/mpp/utils/
H A Dmpp_opt.c28 MppTrie trie; member
49 if (impl->trie) { in mpp_opt_deinit()
50 mpp_trie_deinit(impl->trie); in mpp_opt_deinit()
51 impl->trie = NULL; in mpp_opt_deinit()
65 mpp_trie_init(&impl->trie, node_cnt, opt_cnt); in mpp_opt_setup()
66 if (impl->trie) { in mpp_opt_setup()
82 if (NULL == impl || NULL == impl->trie) in mpp_opt_add()
86 RK_S32 node_cnt = mpp_trie_get_node_count(impl->trie); in mpp_opt_add()
87 RK_S32 info_cnt = mpp_trie_get_info_count(impl->trie); in mpp_opt_add()
96 return mpp_trie_add_info(impl->trie, &info->name); in mpp_opt_add()
[all …]
/OK3568_Linux_fs/external/mpp/mpp/base/inc/
H A Dmpp_trie.h38 MPP_RET mpp_trie_init(MppTrie *trie, RK_S32 node_count, RK_S32 info_count);
39 MPP_RET mpp_trie_deinit(MppTrie trie);
41 MPP_RET mpp_trie_add_info(MppTrie trie, const char **info);
42 RK_S32 mpp_trie_get_node_count(MppTrie trie);
43 RK_S32 mpp_trie_get_info_count(MppTrie trie);
46 const char **mpp_trie_get_info(MppTrie trie, const char *name);
47 MppTrieNode *mpp_trie_node_root(MppTrie trie);
/OK3568_Linux_fs/external/mpp/mpp/base/test/
H A Dmpp_trie_test.c61 MppTrie trie = NULL; in main() local
69 mpp_trie_init(&trie, node_cnt, info_cnt); in main()
72 mpp_trie_add_info(trie, &test_info[0].name); in main()
73 mpp_trie_add_info(trie, &test_info[1].name); in main()
74 mpp_trie_add_info(trie, &test_info[2].name); in main()
75 mpp_trie_add_info(trie, &test_info[3].name); in main()
81 info = mpp_trie_get_info(trie, test_str[i]); in main()
93 mpp_trie_deinit(trie); in main()
/OK3568_Linux_fs/kernel/fs/unicode/
H A Dutf8-norm.c322 utf8trie_t *trie = NULL; in utf8nlookup() local
333 trie = utf8data + data->offset; in utf8nlookup()
336 offlen = (*trie & OFFLEN) >> OFFLEN_SHIFT; in utf8nlookup()
337 if (*trie & NEXTBYTE) { in utf8nlookup()
342 mask = 1 << (*trie & BITNUM); in utf8nlookup()
347 node = (*trie & RIGHTNODE); in utf8nlookup()
348 offset = trie[offlen]; in utf8nlookup()
351 offset |= trie[offlen]; in utf8nlookup()
353 trie += offset; in utf8nlookup()
354 } else if (*trie & RIGHTPATH) { in utf8nlookup()
[all …]
H A Dmkutf8data.c2709 utf8trie_t *trie; in utf8nlookup() local
2720 trie = utf8data + tree->index; in utf8nlookup()
2722 offlen = (*trie & OFFLEN) >> OFFLEN_SHIFT; in utf8nlookup()
2723 if (*trie & NEXTBYTE) { in utf8nlookup()
2728 mask = 1 << (*trie & BITNUM); in utf8nlookup()
2733 node = (*trie & RIGHTNODE); in utf8nlookup()
2734 offset = trie[offlen]; in utf8nlookup()
2737 offset |= trie[offlen]; in utf8nlookup()
2739 trie += offset; in utf8nlookup()
2740 } else if (*trie & RIGHTPATH) { in utf8nlookup()
[all …]
/OK3568_Linux_fs/yocto/meta-openembedded/meta-oe/recipes-core/sdbus-c++/sdbus-c++-libsystemd/
H A D0002-don-t-use-glibc-specific-qsort_r.patch118 @@ -127,9 +127,13 @@ static struct trie* trie_free(struct tri
120 DEFINE_TRIVIAL_CLEANUP_FUNC(struct trie*, trie_free);
122 …values_cmp(const struct trie_value_entry *a, const struct trie_value_entry *b, struct trie *trie) {
123 - return strcmp(trie->strings->buf + a->key_off,
124 - trie->strings->buf + b->key_off);
125 +static struct trie *trie_node_add_value_trie;
134 static int trie_node_add_value(struct trie *trie, struct trie_node *node,
139 … val = typesafe_bsearch_r(&search, node->values, node->values_count, trie_values_cmp, trie);
140 + trie_node_add_value_trie = trie;
151 - typesafe_qsort_r(node->values, node->values_count, trie_values_cmp, trie);
[all …]
/OK3568_Linux_fs/yocto/poky/meta/recipes-devtools/binutils/binutils/
H A D0020-CVE-2023-22608-1.patch4 Subject: [PATCH] add a trie to map quickly from address range to compilation
20 Add a radix-256 trie over the address space to quickly map address to
49 +/* A trie to map quickly from address range to compilation unit.
51 + This is a fairly standard radix-256 trie, used to quickly locate which
58 + We use a hybrid trie to avoid memory explosion: There are two types of trie
138 + /* Root of a trie to map addresses to compilation units. */
148 + We scan these separately when we have a trie over the ranges.
160 + /* Used when iterating over trie leaves to know which units we have
202 +/* Insert an address range in the trie mapping addresses to compilation units.
203 + Will return the new trie node (usually the same as is being sent in, but
[all …]
H A D0020-CVE-2023-22608-2.patch116 /* Insert an address range in the trie mapping addresses to compilation units.
117 Will return the new trie node (usually the same as is being sent in, but
122 - struct trie_node *trie,
132 + struct trie_node *trie,
142 return trie;
/OK3568_Linux_fs/kernel/net/ipv4/
H A Dfib_trie.c165 struct trie { struct
172 static struct key_vector *resize(struct trie *t, struct key_vector *tn); argument
506 static struct key_vector *replace(struct trie *t, in replace()
535 static struct key_vector *inflate(struct trie *t, in inflate()
631 static struct key_vector *halve(struct trie *t, in halve()
686 static struct key_vector *collapse(struct trie *t, in collapse()
846 static struct key_vector *resize(struct trie *t, struct key_vector *tn) in resize()
934 static struct key_vector *fib_find_node(struct trie *t, in fib_find_node()
1017 struct trie *t; in fib_find_matching_alias()
1023 t = (struct trie *)tb->tb_data; in fib_find_matching_alias()
[all …]
/OK3568_Linux_fs/kernel/Documentation/networking/
H A Dfib_trie.rst4 LC-trie implementation notes
14 trie node or tnode
40 the trie is kept level balanced moving, under certain conditions, the
68 straightforward trie lookup.
71 Inserts a new leaf node in the trie. This is bit more complicated than
73 level compression algorithm on part of the trie.
79 The key function for the dynamic trie after any change in the trie
80 it is run to optimize and reorganize. It will walk the trie upwards
102 This walks the full trie (using nextleaf()) and searches for empty
108 entire trie for each prefix length. In comparison, fib_hash is organized
[all …]
/OK3568_Linux_fs/kernel/drivers/net/wireguard/
H A Dallowedips.c111 static struct allowedips_node *find_node(struct allowedips_node *trie, u8 bits, in find_node() argument
114 struct allowedips_node *node = trie, *found = NULL; in find_node()
149 static bool node_placement(struct allowedips_node __rcu *trie, const u8 *key, in node_placement() argument
153 struct allowedips_node *node = rcu_dereference_protected(trie, lockdep_is_held(lock)); in node_placement()
181 static int add(struct allowedips_node __rcu **trie, u8 bits, const u8 *key, in add() argument
189 if (!rcu_access_pointer(*trie)) { in add()
196 connect_node(trie, 2, node); in add()
199 if (node_placement(*trie, key, cidr, bits, &node, lock)) { in add()
213 down = rcu_dereference_protected(*trie, lockdep_is_held(lock)); in add()
228 connect_node(trie, 2, newnode); in add()
[all …]
/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/
H A Dassoc_container.hpp731 class trie : public PB_DS_TRIE_BASE class
740 trie() { } in trie() function in __gnu_pbds::trie
744 trie(const access_traits& t) in trie() function in __gnu_pbds::trie
751 trie(It first, It last) in trie() function in __gnu_pbds::trie
758 trie(It first, It last, const access_traits& t) in trie() function in __gnu_pbds::trie
762 trie(const trie& other) in trie() function in __gnu_pbds::trie
766 ~trie() { } in ~trie()
768 trie&
769 operator=(const trie& other) in operator =()
773 trie tmp(other); in operator =()
[all …]
/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/
H A Dassoc_container.hpp731 class trie : public PB_DS_TRIE_BASE class
740 trie() { } in trie() function in __gnu_pbds::trie
744 trie(const access_traits& t) in trie() function in __gnu_pbds::trie
751 trie(It first, It last) in trie() function in __gnu_pbds::trie
758 trie(It first, It last, const access_traits& t) in trie() function in __gnu_pbds::trie
762 trie(const trie& other) in trie() function in __gnu_pbds::trie
766 ~trie() { } in ~trie()
768 trie&
769 operator=(const trie& other) in operator =()
773 trie tmp(other); in operator =()
[all …]
/OK3568_Linux_fs/buildroot/package/python-pytrie/
H A DConfig.in6 A pure Python implementation of the trie data structure.
/OK3568_Linux_fs/buildroot/package/dawgdic/
H A DConfig.in9 (DAWG). A dawg is constructed by minimizing a trie as a
/OK3568_Linux_fs/yocto/meta-openembedded/meta-oe/recipes-graphics/graphviz/graphviz/
H A D0001-Use-native-mkdefs.patch25 EXTRA_DIST = $(man_MANS) $(pdf_DATA) gprdata mkdefs.c gdefs.h trie.c gvprlib.vcxproj*
/OK3568_Linux_fs/kernel/Documentation/networking/devlink/
H A Ddevlink-dpipe.rst34 Level Path Compression trie (LPC-trie) in hardware.
/OK3568_Linux_fs/buildroot/package/qt5/qt5webengine-chromium/
H A D0001-Add-python3-build-support.patch1562 {% macro trie_switch(trie, index, return_macro, lowercase_data) %}
1563 -{% if trie|length == 1 and trie.values()[0] is string %}
1564 +{% if trie|length == 1 and (trie.values()|list)[0] is string %}
1565 {{ trie_leaf(index, trie, return_macro, lowercase_data) -}}
/OK3568_Linux_fs/kernel/Documentation/RCU/
H A DRTFP.txt159 Robert Olsson described an RCU-protected trie-hash combination
1539 ,Title="{TRASH}: A dynamic {LC}-trie and hash data structure"
1545 RCU-protected dynamic trie-hash combination.
1796 ,Title="{TRASH}: A dynamic {LC}-trie and hash data structure"
1804 RCU-protected dynamic trie-hash combination.
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/share/info/
H A Dbfd.info11356 and retrieved by means of a 'ternary search trie', following ideas of
11359 Addison-Wesley, 1998), '15.4'.) Each trie node stores a character, and
11361 less than, equal to, or greater than the character in the trie. There
11374 0x40 - Traverse left trie.
11411 0x20 - Traverse middle trie. (Read a new command byte
11415 0x10 - Traverse right trie. (Read a new command byte and
11428 This forms the trivial trie (note that the path between ":" and "M"

12