Searched refs:key (Results 1 - 25 of 391) sorted by relevance

1234567891011>>

/vpp/src/vnet/lisp-gpe/
H A Dlisp_gpe_sub_interface.h55 * The interface's key inthe DB; rloc & vni;
56 * The key is allocated from the heap so it can be used in the hash-table.
59 lisp_gpe_sub_interface_key_t *key; member in struct:lisp_gpe_sub_interface_t_
98 * A DB of all L3 sub-interfaces. The key is:{VNI,l-RLOC}
110 lisp_gpe_sub_interface_key_t key; local
113 ip_addr_v6 (&key.local_rloc).as_u64[0] = addr->as_u64[0];
114 ip_addr_v6 (&key.local_rloc).as_u64[1] = addr->as_u64[1];
115 ip_addr_version (&key.local_rloc) = AF_IP6;
116 key.vni = vni;
118 p = hash_get_mem (&lisp_gpe_sub_interfaces_sw_if_index, &key);
134 lisp_gpe_sub_interface_key_t key; local
[all...]
H A Dlisp_gpe_tunnel.c55 if (AF_IP4 == ip_addr_version (&lgt->key->lcl))
73 ip_address_copy_addr (&ip0->src_address, &lgt->key->lcl);
74 ip_address_copy_addr (&ip0->dst_address, &lgt->key->rmt);
103 ip_address_copy_addr (&ip0->src_address, &lgt->key->lcl);
104 ip_address_copy_addr (&ip0->dst_address, &lgt->key->rmt);
128 lisp_gpe_tunnel_db_find (const lisp_gpe_tunnel_key_t * key) argument
132 p = hash_get_mem (lisp_gpe_tunnel_db, (void *) key);
151 lisp_gpe_tunnel_key_t key = { local
159 lgt = lisp_gpe_tunnel_db_find (&key);
166 lgt->key
[all...]
H A Dlisp_gpe_sub_interface.c31 * A DB of all LISP L3 sub-interfaces. The key is:{VNI,l-RLOC}
36 * A DB of all VNET L3 sub-interfaces. The key is:{VNI,l-RLOC}
52 lisp_gpe_sub_interface_key_t key; local
54 clib_memset (&key, 0, sizeof (key));
55 ip_address_copy (&key.local_rloc, lrloc);
56 key.vni = vni;
57 p = hash_get_mem (lisp_gpe_sub_interfaces, &key);
69 l3s->key, l3s - lisp_gpe_sub_interface_pool);
71 l3s->key, l3
[all...]
/vpp/extras/vom/vom/
H A Dom.cpp36 OM::mark(const client_db::key_t& key) argument
39 * Find if the object already stored on behalf of this key.
42 object_ref_list& objs = m_db->find(key);
50 OM::sweep(const client_db::key_t& key) argument
53 * Find if the object already stored on behalf of this key.
56 object_ref_list& objs = m_db->find(key);
70 OM::remove(const client_db::key_t& key) argument
73 * Simply reset the list for this key. This will desctruct the
78 m_db->flush(key);
97 OM::dump(const client_db::key_t& key, st argument
109 populate(const client_db::key_t& key) argument
138 mark_n_sweep(const client_db::key_t& key) argument
[all...]
H A Dsingular_db.hpp65 std::shared_ptr<OBJ> find_or_add(const KEY& key, const DERIVED& obj) argument
67 auto search = m_map.find(key);
72 m_map[key] = sp;
84 std::shared_ptr<OBJ> find(const KEY& key) argument
86 auto search = m_map.find(key);
100 void release(const KEY& key, const OBJ* obj) argument
102 auto search = m_map.find(key);
106 m_map.erase(key);
108 std::shared_ptr<OBJ> sp = m_map[key].lock();
111 m_map.erase(key);
120 add(const KEY& key, std::shared_ptr<OBJ> sp) argument
[all...]
H A Dom.hpp97 per-type object database, with an object-type specific key. This ‘singular’ DB
150 * Constructor - will call mark on the key
152 mark_n_sweep(const client_db::key_t& key);
155 * Destructor - will call sweep on the key
179 static void populate(const client_db::key_t& key);
182 * Mark all state owned by this key as stale
184 static void mark(const client_db::key_t& key);
187 * Sweep all the key's objects that are stale
189 static void sweep(const client_db::key_t& key);
202 static rc_t commit(const client_db::key_t& key, cons argument
221 write(const client_db::key_t& key, const OBJ& obj) argument
[all...]
H A Dacl_l2_list.hpp53 l2_list(const key_t& key);
55 l2_list(const handle_t& hdl, const key_t& key);
57 l2_list(const key_t& key, const rules_t& rules);
101 static std::shared_ptr<l2_list> find(const key_t& key);
102 static void add(const key_t& key, const HW::item<handle_t>& item);
106 const key_t& key() const;
129 void handle_populate(const client_db::key_t& key);
193 * A map of all ACL's against the client's key
H A Dacl_l3_list.hpp53 l3_list(const key_t& key);
55 l3_list(const handle_t& hdl, const key_t& key);
57 l3_list(const key_t& key, const rules_t& rules);
101 static std::shared_ptr<l3_list> find(const key_t& key);
102 static void add(const key_t& key, const HW::item<handle_t>& item);
106 const key_t& key() const;
129 void handle_populate(const client_db::key_t& key);
193 * A map of all ACL's against the client's key
/vpp/src/vppinfra/
H A Dbihash_40_8.h41 u64 key[5]; member in struct:__anon5
49 if (v->key[0] == ~0ULL && v->value == ~0ULL)
58 return clib_crc32c ((u8 *) v->key, 40);
60 u64 tmp = v->key[0] ^ v->key[1] ^ v->key[2] ^ v->key[3] ^ v->key[4];
70 s = format (s, "key %llu %llu %llu %llu %llu value %llu", v->key[
[all...]
H A Dbihash_48_8.h41 u64 key[6]; member in struct:__anon6
49 if (v->key[0] == ~0ULL && v->value == ~0ULL)
58 return clib_crc32c ((u8 *) v->key, 48);
60 u64 tmp = v->key[0] ^ v->key[1] ^ v->key[2] ^ v->key[3] ^ v->key[4]
61 ^ v->key[5];
71 s = format (s, "key
[all...]
H A Dmhash.h58 /* Possibly fixed size of key.
68 /* Hash table mapping key -> value. */
90 mhash_key_to_mem (mhash_t * h, uword key) argument
92 if (key == ~0)
101 return vec_elt_at_index (h->key_vector_or_heap, key);
104 hash_pair_t *mhash_get_pair (mhash_t * h, const void *key);
105 uword mhash_set_mem (mhash_t * h, void *key, uword * new_value,
107 uword mhash_unset (mhash_t * h, void *key, uword * old_value);
110 mhash_get (mhash_t * h, const void *key) argument
112 hash_pair_t *p = mhash_get_pair (h, key);
117 mhash_set(mhash_t * h, void *key, uword new_value, uword * old_value) argument
123 mhash_unset_key(mhash_t * h, uword key, uword * old_value) argument
[all...]
H A Dbihash_16_8.h40 u64 key[2]; member in struct:__anon2
48 if (v->key[0] == ~0ULL && v->value == ~0ULL)
57 return clib_crc32c ((u8 *) v->key, 16);
59 u64 tmp = v->key[0] ^ v->key[1];
69 s = format (s, "key %llu %llu value %llu", v->key[0], v->key[1], v->value);
H A Dbihash_16_8_32.h42 u64 key[2]; member in struct:__anon3
50 if (v->key[0] == ~0ULL && v->value == ~0ULL)
59 return clib_crc32c ((u8 *) v->key, 16);
61 u64 tmp = v->key[0] ^ v->key[1];
71 s = format (s, "key %llu %llu value %llu", v->key[0], v->key[1], v->value);
H A Dbihash_24_8.h40 u64 key[3]; member in struct:__anon4
48 if (v->key[0] == ~0ULL && v->value == ~0ULL)
57 return clib_crc32c ((u8 *) v->key, 24);
59 u64 tmp = v->key[0] ^ v->key[1] ^ v->key[2];
69 s = format (s, "key %llu %llu %llu value %llu",
70 v->key[0], v->key[1], v->key[
[all...]
/vpp/src/plugins/unittest/
H A Drbtree_test.c76 RBTREE_TEST (n->key == n_keys - 1, "max should be %u", n_keys - 1);
79 RBTREE_TEST (n->key == 0, "min should be %u", 0);
82 RBTREE_TEST (n->key == n_keys / 2, "search result should be %u",
86 RBTREE_TEST (aux->key == n_keys / 2 + 1, "successor should be %u is %u",
87 n_keys / 2 + 1, aux->key);
90 RBTREE_TEST (aux->key == n_keys / 2 - 1, "predecessor should be %u is %u",
91 n_keys / 2 - 1, aux->key);
103 RBTREE_TEST (n->key == n_keys - 1, "max should be %u", n_keys - 1);
106 RBTREE_TEST (n->key == 1, "min should be %u and is %u", 1, n->key);
[all...]
/vpp/src/plugins/gbp/
H A Dgbp_endpoint.h91 * Together with the route EPG's RD this forms the EP's L3 key
97 * Together with the route EPG's BD this forms the EP's L2 key
198 * The key/ID of this EP
272 u32 bd_index, clib_bihash_kv_16_8_t * key)
274 key->key[0] = ethernet_mac_address_u64 (mac);
275 key->key[1] = bd_index;
281 clib_bihash_kv_16_8_t key, value; local
284 gbp_endpoint_mk_key_mac (mac, bd_index, &key);
271 gbp_endpoint_mk_key_mac(const u8 * mac, u32 bd_index, clib_bihash_kv_16_8_t * key) argument
295 gbp_endpoint_mk_key_ip(const ip46_address_t * ip, u32 fib_index, clib_bihash_kv_24_8_t * key) argument
304 gbp_endpoint_mk_key_ip4(const ip4_address_t * ip, u32 fib_index, clib_bihash_kv_24_8_t * key) argument
316 clib_bihash_kv_24_8_t key, value; local
330 gbp_endpoint_mk_key_ip6(const ip6_address_t * ip, u32 fib_index, clib_bihash_kv_24_8_t * key) argument
341 clib_bihash_kv_24_8_t key, value; local
[all...]
/vpp/test/
H A Dtest_classifier.py44 key = 'ip_src'
45 self.create_classify_table(key, self.build_ip_mask(src_ip='ffffffff'))
47 self.acl_tbl_idx.get(key),
49 self.input_acl_set_interface(self.pg0, self.acl_tbl_idx.get(key))
50 self.acl_active_table = key
74 key = 'ip_dst'
75 self.create_classify_table(key, self.build_ip_mask(dst_ip='ffffffff'))
77 self.acl_tbl_idx.get(key),
79 self.input_acl_set_interface(self.pg0, self.acl_tbl_idx.get(key))
80 self.acl_active_table = key
[all...]
H A Dtest_classifier_ip6.py41 key = 'ip6_src'
43 key,
46 self.acl_tbl_idx.get(key),
48 self.input_acl_set_interface(self.pg0, self.acl_tbl_idx.get(key))
49 self.acl_active_table = key
72 key = 'ip6_dst'
74 key,
77 self.acl_tbl_idx.get(key),
79 self.input_acl_set_interface(self.pg0, self.acl_tbl_idx.get(key))
80 self.acl_active_table = key
[all...]
/vpp/src/vnet/fib/
H A Dfib_bfd.c61 const bfd_udp_key_t *key; local
73 key = &session->udp.key;
76 .fp_addr = key->peer_addr,
77 .fp_proto = (ip46_address_is_ip4 (&key->peer_addr) ?
80 .fp_len = (ip46_address_is_ip4 (&key->peer_addr) ?
88 fei = fib_table_lookup_exact_match(key->fib_index, &pfx);
109 fei = fib_table_entry_special_add(key->fib_index,
170 fib_table_entry_special_remove(key->fib_index,
/vpp/src/vnet/lisp-cp/
H A Dgid_dictionary.c30 static u32 ip4_lookup (gid_ip4_table_t * db, u32 vni, ip_prefix_t * key);
32 static u32 ip6_lookup (gid_ip6_table_t * db, u32 vni, ip_prefix_t * key);
38 u32 ip = (u32) kvp->key[0];
90 ip.as_u64[0] = kvp->key[0];
91 ip.as_u64[1] = kvp->key[1];
157 kv->key[0] = (u64) vni;
158 kv->key[1] = mac_to_u64 (dst_mac);
159 kv->key[2] = src_mac ? mac_to_u64 (src_mac) : (u64) 0;
174 kv.key[2] = 0;
187 ip4_lookup_exact_match (gid_ip4_table_t * db, u32 vni, ip_prefix_t * key) argument
208 ip4_lookup(gid_ip4_table_t * db, u32 vni, ip_prefix_t * key) argument
240 ip6_lookup_exact_match(gid_ip6_table_t * db, u32 vni, ip_prefix_t * key) argument
260 ip6_lookup(gid_ip6_table_t * db, u32 vni, ip_prefix_t * key) argument
368 arp_ndp_lookup(gid_l2_arp_ndp_table_t * db, u32 bd, ip_address_t * key) argument
399 gid_dictionary_lookup(gid_dictionary_t * db, gid_address_t * key) argument
507 ip4_address_t key; local
689 ip6_address_t key; local
904 add_del_sd(gid_dictionary_t * db, u32 vni, source_dest_t * key, u32 value, u8 is_add) argument
926 add_del_arp_ndp(gid_l2_arp_ndp_table_t * db, u32 bd, ip_address_t * key, u64 value, u8 is_add) argument
978 gid_dictionary_add_del(gid_dictionary_t * db, gid_address_t * key, u64 value, u8 is_add) argument
[all...]
/vpp/extras/deprecated/vppinfra/
H A Dpfhash.h29 /* 3 x 16 = 48 key bytes */
42 /* 5 x 8 = 40 key bytes */
55 /* 4 x 8 = 32 key bytes */
67 /* 8 x 4 = 32 key bytes */
92 /* Pool of key/value pairs */
112 u64 pfhash_get (pfhash_t * p, u32 bucket, void *key);
113 void pfhash_set (pfhash_t * p, u32 bucket, void *key, void *value);
114 void pfhash_unset (pfhash_t * p, u32 bucket, void *key);
135 * See if the supplied 16-byte key matches one of three 16-byte (key,valu
143 pfhash_search_kv_16(pfhash_t * p, u32 bucket_contents, u32x4 * key) argument
181 pfhash_search_kv_8(pfhash_t * p, u32 bucket_contents, u64 * key) argument
207 pfhash_search_kv_8v8(pfhash_t * p, u32 bucket_contents, u64 * key) argument
232 pfhash_search_kv_4(pfhash_t * p, u32 bucket_contents, u32 * key) argument
[all...]
H A Dcuckoo_16_8.h44 /** 8 octet key, 8 octet key value pair */
47 u64 key[2]; /**< the key */ member in struct:__anon2
52 @param v- pointer to the (key,value) pair
57 if (v->key[0] == ~0ULL && v->value == ~0ULL)
70 @param args (vararg) - the (key,value) pair to format
85 format (s, "key %llu%llu value %llu", v->key[0], v->key[
[all...]
/vpp/src/vnet/bier/
H A Dbier_fmask_db.c21 * The key into this table includes the table's key and the fmask's key,
26 * The table's key is part of this DB key, since the fmasks therein build up
57 bier_fmask_id_t *key)
61 * This key will be memcmp'd in the mhash, so make sure it's all 0
63 clib_memset(key, 0, sizeof(*key));
70 key
55 bier_fmask_db_mk_key(index_t bti, const fib_route_path_t *rpath, bier_fmask_id_t *key) argument
[all...]
/vpp/src/vnet/ip-neighbor/
H A Dip_neighbor_watch.c29 * The key for a watcher is {type, sw_if_index, addreess}
80 ip_neighbor_key_t *key, *empty_keys = NULL; local
87 mhash_foreach(key, v, &ipnw_db.ipnwdb_hash,
97 vec_add1 (empty_keys, *key);
101 vec_foreach (key, empty_keys)
102 mhash_unset (&ipnw_db.ipnwdb_hash, key, NULL);
122 ip_neighbor_key_t key = { local
130 p = mhash_get (&ipnw_db.ipnwdb_hash, &key);
144 mhash_set (&ipnw_db.ipnwdb_hash, &key, (uword) ipws, NULL);
153 ip_neighbor_key_t key local
200 ip_neighbor_key_t key; local
235 ip_neighbor_key_t *key; local
[all...]
/vpp/src/plugins/map/
H A Dlpm.c39 u32 key; local
41 key = masked_address32(addr->data_u32, pfxlen);
43 result = hash_get (hash, key);
55 hash = hash_set(hash, key, value);
63 u32 key; local
65 key = masked_address32(addr->data_u32, pfxlen);
67 result = hash_get (hash, key);
69 hash_unset(hash, key);
78 u32 key; local
83 key
[all...]

Completed in 15 milliseconds

1234567891011>>