Home
last modified time | relevance | path

Searched refs:random (Results 1 – 10 of 10) sorted by relevance

/net/netfilter/
A Dxt_statistic.c37 if ((get_random_u32() & 0x7FFFFFFF) < info->u.random.probability) in statistic_mt()
A DKconfig500 incremental counting and random numbers bound to a upper limit.
/net/tipc/
A Ddiscover.c93 msg_set_node_sig(hdr, tn->random); in tipc_disc_init_msg()
98 msg_set_peer_net_hash(hdr, tipc_net_hash_mixes(net, tn->random)); in tipc_disc_init_msg()
A Dcore.h100 int random; member
A Dcore.c67 get_random_bytes(&tn->random, sizeof(int)); in tipc_init_net()
A Dmonitor.c677 mon->timer_intv = msecs_to_jiffies(MON_TIMEOUT + (tn->random & 0xffff)); in tipc_mon_create()
A Dnode.c459 hash_chk = tipc_net_hash_mixes(tmp, tn_peer->random); in tipc_node_assign_peer_net()
1122 addr ^= tipc_net(net)->random; in tipc_node_suggest_addr()
/net/sctp/
A Dauth.c185 struct sctp_random_param *random, in sctp_auth_make_key_vector() argument
195 random_len = ntohs(random->param_hdr.length); in sctp_auth_make_key_vector()
206 memcpy(new->data, random, random_len); in sctp_auth_make_key_vector()
/net/netfilter/ipvs/
A DKconfig276 tristate "weighted random twos choice least-connection scheduling"
278 The weighted random twos choice least-connection scheduling
279 algorithm picks two random real servers and directs network
/net/ipv4/
A DKconfig599 type. TCP Veno cuts down less congestion window in response to random

Completed in 23 milliseconds