trie             2709 fs/unicode/mkutf8data.c 	utf8trie_t	*trie;
trie             2720 fs/unicode/mkutf8data.c 	trie = utf8data + tree->index;
trie             2722 fs/unicode/mkutf8data.c 		offlen = (*trie & OFFLEN) >> OFFLEN_SHIFT;
trie             2723 fs/unicode/mkutf8data.c 		if (*trie & NEXTBYTE) {
trie             2728 fs/unicode/mkutf8data.c 		mask = 1 << (*trie & BITNUM);
trie             2733 fs/unicode/mkutf8data.c 				node = (*trie & RIGHTNODE);
trie             2734 fs/unicode/mkutf8data.c 				offset = trie[offlen];
trie             2737 fs/unicode/mkutf8data.c 					offset |= trie[offlen];
trie             2739 fs/unicode/mkutf8data.c 				trie += offset;
trie             2740 fs/unicode/mkutf8data.c 			} else if (*trie & RIGHTPATH) {
trie             2742 fs/unicode/mkutf8data.c 				node = (*trie & TRIENODE);
trie             2743 fs/unicode/mkutf8data.c 				trie++;
trie             2752 fs/unicode/mkutf8data.c 				node = (*trie & LEFTNODE);
trie             2753 fs/unicode/mkutf8data.c 				trie += offlen + 1;
trie             2754 fs/unicode/mkutf8data.c 			} else if (*trie & RIGHTPATH) {
trie             2759 fs/unicode/mkutf8data.c 				node = (*trie & TRIENODE);
trie             2760 fs/unicode/mkutf8data.c 				trie++;
trie             2770 fs/unicode/mkutf8data.c 	if (LEAF_CCC(trie) == DECOMPOSE && LEAF_STR(trie)[0] == HANGUL)
trie             2771 fs/unicode/mkutf8data.c 		trie = utf8hangul(s - 2, hangul);
trie             2772 fs/unicode/mkutf8data.c 	return trie;
trie              322 fs/unicode/utf8-norm.c 	utf8trie_t	*trie = NULL;
trie              333 fs/unicode/utf8-norm.c 	trie = utf8data + data->offset;
trie              336 fs/unicode/utf8-norm.c 		offlen = (*trie & OFFLEN) >> OFFLEN_SHIFT;
trie              337 fs/unicode/utf8-norm.c 		if (*trie & NEXTBYTE) {
trie              342 fs/unicode/utf8-norm.c 		mask = 1 << (*trie & BITNUM);
trie              347 fs/unicode/utf8-norm.c 				node = (*trie & RIGHTNODE);
trie              348 fs/unicode/utf8-norm.c 				offset = trie[offlen];
trie              351 fs/unicode/utf8-norm.c 					offset |= trie[offlen];
trie              353 fs/unicode/utf8-norm.c 				trie += offset;
trie              354 fs/unicode/utf8-norm.c 			} else if (*trie & RIGHTPATH) {
trie              356 fs/unicode/utf8-norm.c 				node = (*trie & TRIENODE);
trie              357 fs/unicode/utf8-norm.c 				trie++;
trie              366 fs/unicode/utf8-norm.c 				node = (*trie & LEFTNODE);
trie              367 fs/unicode/utf8-norm.c 				trie += offlen + 1;
trie              368 fs/unicode/utf8-norm.c 			} else if (*trie & RIGHTPATH) {
trie              373 fs/unicode/utf8-norm.c 				node = (*trie & TRIENODE);
trie              374 fs/unicode/utf8-norm.c 				trie++;
trie              384 fs/unicode/utf8-norm.c 	if (LEAF_CCC(trie) == DECOMPOSE && LEAF_STR(trie)[0] == HANGUL)
trie              385 fs/unicode/utf8-norm.c 		trie = utf8hangul(s - 2, hangul);
trie              386 fs/unicode/utf8-norm.c 	return trie;
trie              164 kernel/bpf/lpm_trie.c static size_t longest_prefix_match(const struct lpm_trie *trie,
trie              179 kernel/bpf/lpm_trie.c 	if (trie->data_size >= 8) {
trie              192 kernel/bpf/lpm_trie.c 	while (trie->data_size >= i + 4) {
trie              204 kernel/bpf/lpm_trie.c 	if (trie->data_size >= i + 2) {
trie              216 kernel/bpf/lpm_trie.c 	if (trie->data_size >= i + 1) {
trie              229 kernel/bpf/lpm_trie.c 	struct lpm_trie *trie = container_of(map, struct lpm_trie, map);
trie              235 kernel/bpf/lpm_trie.c 	for (node = rcu_dereference(trie->root); node;) {
trie              243 kernel/bpf/lpm_trie.c 		matchlen = longest_prefix_match(trie, node, key);
trie              244 kernel/bpf/lpm_trie.c 		if (matchlen == trie->max_prefixlen) {
trie              273 kernel/bpf/lpm_trie.c 	return found->data + trie->data_size;
trie              276 kernel/bpf/lpm_trie.c static struct lpm_trie_node *lpm_trie_node_alloc(const struct lpm_trie *trie,
trie              280 kernel/bpf/lpm_trie.c 	size_t size = sizeof(struct lpm_trie_node) + trie->data_size;
trie              283 kernel/bpf/lpm_trie.c 		size += trie->map.value_size;
trie              286 kernel/bpf/lpm_trie.c 			    trie->map.numa_node);
trie              293 kernel/bpf/lpm_trie.c 		memcpy(node->data + trie->data_size, value,
trie              294 kernel/bpf/lpm_trie.c 		       trie->map.value_size);
trie              303 kernel/bpf/lpm_trie.c 	struct lpm_trie *trie = container_of(map, struct lpm_trie, map);
trie              315 kernel/bpf/lpm_trie.c 	if (key->prefixlen > trie->max_prefixlen)
trie              318 kernel/bpf/lpm_trie.c 	raw_spin_lock_irqsave(&trie->lock, irq_flags);
trie              322 kernel/bpf/lpm_trie.c 	if (trie->n_entries == trie->map.max_entries) {
trie              327 kernel/bpf/lpm_trie.c 	new_node = lpm_trie_node_alloc(trie, value);
trie              333 kernel/bpf/lpm_trie.c 	trie->n_entries++;
trie              338 kernel/bpf/lpm_trie.c 	memcpy(new_node->data, key->data, trie->data_size);
trie              345 kernel/bpf/lpm_trie.c 	slot = &trie->root;
trie              348 kernel/bpf/lpm_trie.c 					lockdep_is_held(&trie->lock)))) {
trie              349 kernel/bpf/lpm_trie.c 		matchlen = longest_prefix_match(trie, node, key);
trie              353 kernel/bpf/lpm_trie.c 		    node->prefixlen == trie->max_prefixlen)
trie              376 kernel/bpf/lpm_trie.c 			trie->n_entries--;
trie              394 kernel/bpf/lpm_trie.c 	im_node = lpm_trie_node_alloc(trie, NULL);
trie              402 kernel/bpf/lpm_trie.c 	memcpy(im_node->data, node->data, trie->data_size);
trie              419 kernel/bpf/lpm_trie.c 			trie->n_entries--;
trie              425 kernel/bpf/lpm_trie.c 	raw_spin_unlock_irqrestore(&trie->lock, irq_flags);
trie              433 kernel/bpf/lpm_trie.c 	struct lpm_trie *trie = container_of(map, struct lpm_trie, map);
trie              442 kernel/bpf/lpm_trie.c 	if (key->prefixlen > trie->max_prefixlen)
trie              445 kernel/bpf/lpm_trie.c 	raw_spin_lock_irqsave(&trie->lock, irq_flags);
trie              453 kernel/bpf/lpm_trie.c 	trim = &trie->root;
trie              457 kernel/bpf/lpm_trie.c 		       *trim, lockdep_is_held(&trie->lock)))) {
trie              458 kernel/bpf/lpm_trie.c 		matchlen = longest_prefix_match(trie, node, key);
trie              477 kernel/bpf/lpm_trie.c 	trie->n_entries--;
trie              521 kernel/bpf/lpm_trie.c 	raw_spin_unlock_irqrestore(&trie->lock, irq_flags);
trie              542 kernel/bpf/lpm_trie.c 	struct lpm_trie *trie;
trie              543 kernel/bpf/lpm_trie.c 	u64 cost = sizeof(*trie), cost_per_node;
trie              560 kernel/bpf/lpm_trie.c 	trie = kzalloc(sizeof(*trie), GFP_USER | __GFP_NOWARN);
trie              561 kernel/bpf/lpm_trie.c 	if (!trie)
trie              565 kernel/bpf/lpm_trie.c 	bpf_map_init_from_attr(&trie->map, attr);
trie              566 kernel/bpf/lpm_trie.c 	trie->data_size = attr->key_size -
trie              568 kernel/bpf/lpm_trie.c 	trie->max_prefixlen = trie->data_size * 8;
trie              571 kernel/bpf/lpm_trie.c 			attr->value_size + trie->data_size;
trie              574 kernel/bpf/lpm_trie.c 	ret = bpf_map_charge_init(&trie->map.memory, cost);
trie              578 kernel/bpf/lpm_trie.c 	raw_spin_lock_init(&trie->lock);
trie              580 kernel/bpf/lpm_trie.c 	return &trie->map;
trie              582 kernel/bpf/lpm_trie.c 	kfree(trie);
trie              588 kernel/bpf/lpm_trie.c 	struct lpm_trie *trie = container_of(map, struct lpm_trie, map);
trie              603 kernel/bpf/lpm_trie.c 		slot = &trie->root;
trie              627 kernel/bpf/lpm_trie.c 	kfree(trie);
trie              633 kernel/bpf/lpm_trie.c 	struct lpm_trie *trie = container_of(map, struct lpm_trie, map);
trie              652 kernel/bpf/lpm_trie.c 	search_root = rcu_dereference(trie->root);
trie              657 kernel/bpf/lpm_trie.c 	if (!key || key->prefixlen > trie->max_prefixlen)
trie              660 kernel/bpf/lpm_trie.c 	node_stack = kmalloc_array(trie->max_prefixlen,
trie              669 kernel/bpf/lpm_trie.c 		matchlen = longest_prefix_match(trie, node, key);
trie              722 kernel/bpf/lpm_trie.c 	       next_node->data, trie->data_size);
trie              173 net/ipv4/fib_trie.c static struct key_vector *resize(struct trie *t, struct key_vector *tn);
trie              509 net/ipv4/fib_trie.c static struct key_vector *replace(struct trie *t,
trie              538 net/ipv4/fib_trie.c static struct key_vector *inflate(struct trie *t,
trie              634 net/ipv4/fib_trie.c static struct key_vector *halve(struct trie *t,
trie              689 net/ipv4/fib_trie.c static struct key_vector *collapse(struct trie *t,
trie              849 net/ipv4/fib_trie.c static struct key_vector *resize(struct trie *t, struct key_vector *tn)
trie              937 net/ipv4/fib_trie.c static struct key_vector *fib_find_node(struct trie *t,
trie             1008 net/ipv4/fib_trie.c static void trie_rebalance(struct trie *t, struct key_vector *tn)
trie             1014 net/ipv4/fib_trie.c static int fib_insert_node(struct trie *t, struct key_vector *tp,
trie             1067 net/ipv4/fib_trie.c static int fib_insert_alias(struct trie *t, struct key_vector *tp,
trie             1124 net/ipv4/fib_trie.c 	struct trie *t = (struct trie *)tb->tb_data;
trie             1315 net/ipv4/fib_trie.c 	struct trie *t = (struct trie *) tb->tb_data;
trie             1515 net/ipv4/fib_trie.c static void fib_remove_alias(struct trie *t, struct key_vector *tp,
trie             1550 net/ipv4/fib_trie.c 	struct trie *t = (struct trie *) tb->tb_data;
trie             1677 net/ipv4/fib_trie.c 	struct trie *t = (struct trie *)tb->tb_data;
trie             1735 net/ipv4/fib_trie.c 	struct trie *ot = (struct trie *)oldtb->tb_data;
trie             1739 net/ipv4/fib_trie.c 	struct trie *lt;
trie             1749 net/ipv4/fib_trie.c 	lt = (struct trie *)local_tb->tb_data;
trie             1794 net/ipv4/fib_trie.c 	struct trie *t = (struct trie *)tb->tb_data;
trie             1863 net/ipv4/fib_trie.c 	struct trie *t = (struct trie *)tb->tb_data;
trie             1951 net/ipv4/fib_trie.c 	struct trie *t = (struct trie *)tb->tb_data;
trie             2043 net/ipv4/fib_trie.c 	struct trie *t = (struct trie *)tb->tb_data;
trie             2074 net/ipv4/fib_trie.c 	struct trie *t = (struct trie *)tb->tb_data;
trie             2170 net/ipv4/fib_trie.c 	struct trie *t = (struct trie *)tb->tb_data;
trie             2225 net/ipv4/fib_trie.c 	struct trie *t;
trie             2229 net/ipv4/fib_trie.c 		sz += sizeof(struct trie);
trie             2242 net/ipv4/fib_trie.c 	t = (struct trie *) tb->tb_data;
trie             2310 net/ipv4/fib_trie.c 					     struct trie *t)
trie             2335 net/ipv4/fib_trie.c static void trie_collect_stats(struct trie *t, struct trie_stat *s)
trie             2464 net/ipv4/fib_trie.c 			struct trie *t = (struct trie *) tb->tb_data;
trie             2500 net/ipv4/fib_trie.c 						    (struct trie *) tb->tb_data);
trie             2538 net/ipv4/fib_trie.c 		n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
trie             2547 net/ipv4/fib_trie.c 			n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
trie             2705 net/ipv4/fib_trie.c 	struct trie *t;
trie             2714 net/ipv4/fib_trie.c 	t = (struct trie *)tb->tb_data;