Searched refs:hash (Results 251 - 275 of 1185) sorted by last modified time

<<11121314151617181920>>

/linux-master/security/integrity/ima/
H A Dima_appraise.c71 * Return 1 to appraise or hash
185 /* return default hash algo */
220 /* return default hash algo */
237 * calc_file_id_hash - calculate the hash of the ima_file_id struct data
239 * @algo: hash algorithm [enum hash_algo]
241 * @hash: (out) pointer to the hash
244 * indirectly signing the hash of the ima_file_id structure data.
253 struct ima_digest_data *hash)
262 memcpy(file_id.hash, diges
251 calc_file_id_hash(enum evm_ima_xattr_type type, enum hash_algo algo, const u8 *digest, struct ima_digest_data *hash) argument
281 struct ima_max_digest_data hash; local
[all...]
H A Dima_api.c89 * Calculate the hash of a template entry, add the template entry
129 * Violations are flagged in the measurement list with zero hash values.
175 * @allowed_algos: allowlist of hash algorithms for the IMA xattr
206 struct ima_max_digest_data *hash)
213 * hash containing 0's.
215 digest_len = fsverity_get_digest(inode, hash->digest, NULL, &alg);
220 * Unlike in the case of actually calculating the file hash, in
221 * the fsverity case regardless of the hash algorithm, return
226 hash->hdr.algo = alg;
227 hash
204 ima_get_verity_digest(struct ima_iint_cache *iint, struct inode *inode, struct ima_max_digest_data *hash) argument
249 struct ima_max_digest_data hash; local
390 char *hash; local
[all...]
H A Dima.h20 #include <linux/hash.h>
107 struct hlist_node hnext; /* place in hash collision list */
249 int ima_calc_file_hash(struct file *file, struct ima_digest_data *hash);
251 struct ima_digest_data *hash);
254 int ima_calc_boot_aggregate(struct ima_digest_data *hash);
292 /* there is no point in taking a hash of part of a digest */
/linux-master/security/integrity/evm/
H A Devm_main.c25 #include <crypto/hash.h>
H A Devm_crypto.c20 #include <crypto/hash.h>
297 /* Portable EVM signatures must include an IMA hash */
/linux-master/net/xfrm/
H A Dxfrm_interface_core.c31 #include <linux/hash.h>
/linux-master/net/tipc/
H A Dnode.c88 * @hash: links to adjacent nodes in unsorted hash chain
112 * @peer_hash_mix: hash for this peer (FIXME)
120 struct hlist_node hash; member in struct:tipc_node
337 hlist_for_each_entry_rcu(node, &tn->node_htable[thash], hash) {
501 hlist_del_rcu(&n->hash);
502 hlist_add_head_rcu(&n->hash,
563 INIT_HLIST_NODE(&n->hash);
595 hlist_add_head_rcu(&n->hash, &tn->node_htable[tipc_hashfn(addr)]);
632 hlist_del_rcu(&node->hash);
[all...]
/linux-master/net/sunrpc/auth_gss/
H A Dgss_krb5_mech.c12 #include <crypto/hash.h>
/linux-master/net/smc/
H A Daf_smc.c225 .hash = smc_hash_sk,
238 .hash = smc_hash_sk,
390 sk->sk_prot->hash(sk);
/linux-master/net/sctp/
H A Dsocket.c40 #include <crypto/hash.h>
5312 int hash = 0; local
5316 for (head = sctp_ep_hashtable; hash < sctp_ep_hashsize;
5317 hash++, head++) {
8322 * The port hash table (contained in the 'global' SCTP protocol storage
8323 * returned by struct sctp_protocol *sctp_get_protocol()). The hash
8326 * would expect from a hash function, all the ports in a given list have
8339 struct sctp_bind_hashbucket *head; /* hash list */
8384 * hash table list entry) is non-NULL and we hold it's
8391 * exahust the search in the hash lis
[all...]
/linux-master/net/sched/
H A Dsch_sfq.c53 When hash collisions occur, several flows are considered as one.
70 - number of hash buckets to 65536.
106 unsigned short hash; /* hash value (index in ht[]) */ member in struct:sfq_slot
116 unsigned int divisor; /* number of slots in hash table */
321 q->ht[slot->hash] = SFQ_EMPTY_SLOT;
349 unsigned int hash, dropped; local
356 hash = sfq_classify(skb, sch, &ret);
357 if (hash == 0) {
363 hash
563 unsigned int hash = sfq_hash(q, skb); local
[all...]
H A Dsch_sfb.c30 * This permits us to split one 32bit hash (provided per packet by rxhash or
44 /* We use a double buffering right before hash change
45 * (Section 4.4 of SFB reference : moving hash functions)
85 * We store in skb_cb the two hash values.
99 * If using 'internal' SFB flow classifier, hash comes from skb rxhash
100 * If using external classifier, hash comes from the classid.
129 u32 hash = sfbhash & SFB_BUCKET_MASK; local
132 if (b[hash].qlen < 0xFFFF)
133 b[hash].qlen++;
158 u32 hash local
331 u32 hash = sfbhash & SFB_BUCKET_MASK; local
364 u32 hash = sfbhash & SFB_BUCKET_MASK; local
[all...]
H A Dsch_qfq.c672 hlist_for_each_entry(cl, &q->clhash.hash[i], common.hnode) {
1470 hlist_for_each_entry(cl, &q->clhash.hash[i], common.hnode) {
1489 hlist_for_each_entry_safe(cl, next, &q->clhash.hash[i],
H A Dsch_htb.c185 /* find class in global hash table using given handle */
1004 hlist_for_each_entry(cl, &q->clhash.hash[i], common.hnode) {
1307 hlist_for_each_entry(c, &q->clhash.hash[i], common.hnode) {
1641 hlist_for_each_entry(cl, &q->clhash.hash[i], common.hnode) {
1651 hlist_for_each_entry_safe(cl, next, &q->clhash.hash[i],
1748 /* delete from hash and active; remainder in destroy_class */
1993 /* attach to the hash list and parent's family */
2132 hlist_for_each_entry(cl, &q->clhash.hash[i], common.hnode) {
H A Dsch_hhf.c33 * Conceptually, a multi-stage filter comprises k independent hash functions
34 * and k counter arrays. Packets are indexed into k counter arrays by k hash
39 * due to hash collision with other small flows; however, with high
77 * - T is a fixed-size hash-table with 1024 entries. Hash collision is
83 * Hence, instead of having four hash functions, we chop the 32-bit
84 * skb-hash into three 10-bit chunks, and the remaining 10-bit chunk is
114 u32 hash_id; /* hash of flow-id (e.g. TCP 5-tuple) */
116 struct list_head flowchain; /* chaining under hash collision */
129 siphash_key_t perturbation; /* hash perturbation */
180 static struct hh_flow_state *seek_list(const u32 hash, argument
250 u32 tmp_hash, hash; local
[all...]
H A Dsch_hfsc.c171 struct Qdisc_class_hash clhash; /* class hash */
1366 hlist_for_each_entry(cl, &q->clhash.hash[i],
1491 hlist_for_each_entry(cl, &q->clhash.hash[i], cl_common.hnode)
1507 hlist_for_each_entry(cl, &q->clhash.hash[i], cl_common.hnode) {
1513 hlist_for_each_entry_safe(cl, next, &q->clhash.hash[i],
H A Dsch_fq.c9 * If not, (router workload), we use rxhash as fallback, with 32 bits wide hash.
12 * Flows are dynamically allocated and stored in a hash table of RB trees
44 #include <linux/hash.h>
364 unsigned long hash = skb_get_hash(skb) & q->orphan_mask; local
369 sk = (struct sock *)((hash << 1) | 1UL);
372 unsigned long hash = skb_get_hash(skb) & q->orphan_mask; local
381 sk = (struct sock *)((hash << 1) | 1UL);
H A Dsch_drr.c287 hlist_for_each_entry(cl, &q->clhash.hash[i], common.hnode) {
432 hlist_for_each_entry(cl, &q->clhash.hash[i], common.hnode) {
450 hlist_for_each_entry_safe(cl, next, &q->clhash.hash[i],
H A Dsch_cake.c31 * set-associative hash function.
193 /* hash function stats */
661 /* If both overrides are set, or we can use the SKB hash and nat mode is
671 /* Don't use the SKB hash if we change the lookup keys from conntrack */
675 /* If we can still use the SKB hash and don't need the host hash, we can
725 flow_hash = skb->hash;
742 /* fast path if no hash collision (direct lookup succeeds) */
1666 goto hash;
1688 hash
[all...]
H A Dcls_u32.c7 * The filters are packed to hash tables of key nodes
9 * Nodes reference next level hash tables etc.
37 #include <linux/hash.h>
754 NL_SET_ERR_MSG_MOD(extack, "u32 Link handle must be a hash table");
762 NL_SET_ERR_MSG_MOD(extack, "Link hash table not found");
959 NL_SET_ERR_MSG_MOD(extack, "Exceeded maximum 256 hash buckets");
963 NL_SET_ERR_MSG_MOD(extack, "Divisor can only be used on a hash table");
1012 NL_SET_ERR_MSG_MOD(extack, "Specified hash table not found");
1022 NL_SET_ERR_MSG_MOD(extack, "Specified hash table buckets exceed configured value");
1039 * indicating hash bucketi
[all...]
H A Dcls_flower.c71 struct flow_dissector_key_hash hash; member in struct:fl_flow_key
1971 fl_set_key_val(tb, &key->hash.hash, TCA_FLOWER_KEY_HASH,
1972 &mask->hash.hash, TCA_FLOWER_KEY_HASH_MASK,
1973 sizeof(key->hash.hash));
2090 FLOW_DISSECTOR_KEY_HASH, hash);
3479 if (fl_dump_key_val(skb, &key->hash.hash, TCA_FLOWER_KEY_HAS
[all...]
H A Dcls_api.c200 u32 hash = destroy_obj_hashfn(tp); local
206 destroy_ht_node, hash) {
H A Dact_skbedit.c32 u32 hash = skb_get_hash(skb); local
34 queue_mapping += hash % params->mapping_mod;
/linux-master/net/rds/
H A Dconnection.c60 u32 lhash, fhash, hash; local
71 hash = __inet_ehashfn(lhash, 0, fhash, 0, rds_hash_secret);
73 return &rds_conn_hash[hash & RDS_CONNECTION_HASH_MASK];
426 * to the conn hash, so we never trigger a reconnect on this
/linux-master/net/netlink/
H A Ddiag.c118 rhashtable_walk_enter(&tbl->hash, hti);

Completed in 700 milliseconds

<<11121314151617181920>>