Searched defs:limit (Results 1 - 25 of 30) sorted by relevance

12

/net/sched/
H A Dsch_plug.c68 u32 limit; member in struct:plug_sched_data
93 if (likely(sch->qstats.backlog + skb->len <= q->limit)) {
133 /* We will set a default limit of 100 pkts (~150kB)
138 q->limit = pkt_limit * psched_mtu(qdisc_dev(sch));
145 q->limit = ctl->limit;
202 q->limit = msg->limit;
H A Dsch_fifo.c24 if (likely(sch->qstats.backlog + qdisc_pkt_len(skb) <= sch->limit))
32 if (likely(skb_queue_len(&sch->q) < sch->limit))
40 if (likely(skb_queue_len(&sch->q) < sch->limit))
43 /* queue full, remove one skb to fulfill the limit */
57 u32 limit = qdisc_dev(sch)->tx_queue_len ? : 1; local
60 limit *= psched_mtu(qdisc_dev(sch));
62 sch->limit = limit;
69 sch->limit = ctl->limit;
141 fifo_set_limit(struct Qdisc *q, unsigned int limit) argument
163 fifo_create_dflt(struct Qdisc *sch, struct Qdisc_ops *ops, unsigned int limit) argument
[all...]
H A Dact_police.c49 u32 limit; member in struct:tc_police_compat
H A Dsch_red.c29 limit - bytes (must be > qth_max + burst)
31 Hard limit on queue length, should be chosen >qth_max
35 Really, this limit will never be reached
40 u32 limit; /* HARD maximal queue length */ member in struct:red_sched_data
203 if (ctl->limit > 0) {
204 child = fifo_create_dflt(sch, &bfifo_qdisc_ops, ctl->limit);
211 q->limit = ctl->limit;
262 .limit = q->limit,
[all...]
H A Dsch_gred.c36 u32 limit; /* HARD maximal queue length */ member in struct:gred_sched_data
232 if (q->backlog + qdisc_pkt_len(skb) <= q->limit) {
400 q->limit = ctl->limit;
554 opt.limit = q->limit;
H A Dsch_pie.c43 u32 limit; /* number of packets that can be enqueued */ member in struct:pie_params
52 u32 prob; /* probability but scaled by u32 limit. */
84 params->limit = 1000; /* default of 1000 packets */
142 if (unlikely(qdisc_qlen(sch) >= sch->limit)) {
212 u32 limit = nla_get_u32(tb[TCA_PIE_LIMIT]); local
214 q->params.limit = limit;
215 sch->limit = limit;
230 /* Drop excess packets if new limit i
[all...]
H A Dsch_tbf.c96 With classful TBF, limit is just kept for backwards compatibility.
98 changed the limit is not effective anymore.
103 u32 limit; /* Maximal length of backlog: bytes */ member in struct:tbf_sched_data
389 err = fifo_set_limit(q->qdisc, qopt->limit);
392 } else if (qopt->limit > 0) {
393 child = fifo_create_dflt(sch, &bfifo_qdisc_ops, qopt->limit);
406 q->limit = qopt->limit;
461 opt.limit = q->limit;
[all...]
H A Dsch_choke.c53 u32 limit; member in struct:choke_sched_data
331 if (sch->q.qlen < q->limit) {
434 if (ctl->limit > CHOKE_MAX_QUEUE)
437 mask = roundup_pow_of_two(ctl->limit + 1) - 1;
478 q->limit = ctl->limit;
504 .limit = q->limit,
H A Dsch_netem.c72 /* internal t(ime)fifo qdisc uses t_root and sch->limit */
85 u32 limit; member in struct:netem_sched_data
478 if (unlikely(skb_queue_len(&sch->q) >= sch->limit))
857 sch->limit = qopt->limit;
861 q->limit = qopt->limit;
984 qopt.limit = q->limit;
H A Dsch_sfb.c65 u32 limit; /* HARD maximal queue length */ member in struct:sfb_sched_data
292 if (unlikely(sch->q.qlen >= q->limit)) {
299 unsigned long limit = q->rehash_time + q->rehash_interval; local
301 if (unlikely(time_after(jiffies, limit))) {
305 time_after(jiffies, limit - q->warmup_time))) {
482 .limit = 0,
497 u32 limit; local
511 limit = ctl->limit;
512 if (limit
[all...]
H A Dsch_sfq.c119 int limit; /* limit of total number of packets in this qdisc */ member in struct:sfq_sched_data
122 u8 maxdepth; /* limit of packets per flow */
483 if (++sch->q.qlen <= q->limit)
686 if (ctl->limit) {
687 q->limit = min_t(u32, ctl->limit, q->maxdepth * q->maxflows);
688 q->maxflows = min_t(u32, q->maxflows, q->limit);
692 while (sch->q.qlen > q->limit)
746 q->limit
[all...]
/net/bridge/netfilter/
H A Debt_among.c27 int start, limit, i; local
33 limit = wh->table[key + 1];
35 for (i = start; i < limit; i++) {
42 for (i = start; i < limit; i++) {
H A Debtables.c423 unsigned int limit = repl->entries_size; local
434 while (offset < limit) {
435 size_t left = limit - offset;
472 if (offset != limit) {
/net/batman-adv/
H A Dfragmentation.c76 int limit = BATADV_FRAG_MAX_FRAG_SIZE; local
78 limit -= sizeof(struct batadv_frag_packet);
79 limit *= BATADV_FRAG_MAX_FRAGMENTS;
81 return limit;
/net/9p/
H A Dtrans_virtio.c87 /* This is global limit. Since we don't have a global structure,
175 * @limit: maximum segment to pack data to
186 int limit, char *data, int count)
195 BUG_ON(index > limit);
224 pack_sg_list_p(struct scatterlist *sg, int start, int limit, argument
231 BUG_ON(nr_pages > (limit - start));
575 /* Ceiling limit to avoid denial of service attacks */
185 pack_sg_list(struct scatterlist *sg, int start, int limit, char *data, int count) argument
/net/tipc/
H A Dbcast.c823 int tipc_bclink_set_queue_limits(u32 limit) argument
827 if ((limit < TIPC_MIN_LINK_WIN) || (limit > TIPC_MAX_LINK_WIN))
831 tipc_link_set_queue_limits(bcl, limit);
H A Dname_table.c609 * Note: Publications with a scope narrower than 'limit' are ignored.
615 int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit, argument
641 if (publ->scope <= limit)
665 pr_warn("Publication failed, local publication limit reached (%u)\n",
/net/appletalk/
H A Dddp.c670 int limit; local
769 limit = ntohs(nr->nr_lastnet);
770 if (limit - ntohs(nr->nr_firstnet) > 4096) {
777 ct <= limit; ct++) {
/net/netfilter/
H A Dnf_conntrack_sip.c59 const char *limit, int *shift)
63 while (dptr < limit && isalpha(*dptr)) {
71 const char *limit, int *shift)
74 while (dptr < limit && isdigit(*dptr)) {
91 static int word_len(const char *dptr, const char *limit) argument
94 while (dptr < limit && iswordc(*dptr)) {
102 const char *limit, int *shift)
106 len = word_len(dptr, limit);
108 if (!len || dptr == limit || *dptr != '@')
113 domain_len = word_len(dptr, limit);
58 string_len(const struct nf_conn *ct, const char *dptr, const char *limit, int *shift) argument
70 digits_len(const struct nf_conn *ct, const char *dptr, const char *limit, int *shift) argument
101 callid_len(const struct nf_conn *ct, const char *dptr, const char *limit, int *shift) argument
120 media_len(const struct nf_conn *ct, const char *dptr, const char *limit, int *shift) argument
134 sip_parse_addr(const struct nf_conn *ct, const char *cp, const char **endp, union nf_inet_addr *addr, const char *limit, bool delim) argument
176 epaddr_len(const struct nf_conn *ct, const char *dptr, const char *limit, int *shift) argument
196 skp_epaddr_len(const struct nf_conn *ct, const char *dptr, const char *limit, int *shift) argument
233 const char *start = dptr, *limit = dptr + datalen, *end; local
303 sip_follow_continuation(const char *dptr, const char *limit) argument
327 sip_skip_whitespace(const char *dptr, const char *limit) argument
342 ct_sip_header_search(const char *dptr, const char *limit, const char *needle, unsigned int len) argument
365 const char *start = dptr, *limit = dptr + datalen; local
433 const char *start = dptr, *limit = dptr + datalen; local
503 const char *c, *limit = dptr + datalen; local
535 const char *limit = dptr + datalen; local
564 const char *limit = dptr + datalen; local
591 const char *limit = dptr + datalen; local
638 sdp_parse_addr(const struct nf_conn *ct, const char *cp, const char **endp, union nf_inet_addr *addr, const char *limit) argument
665 sdp_addr_len(const struct nf_conn *ct, const char *dptr, const char *limit, int *shift) argument
703 ct_sdp_header_search(const char *dptr, const char *limit, const char *needle, unsigned int len) argument
726 const char *start = dptr, *limit = dptr + datalen; local
[all...]
/net/sctp/
H A Dprotocol.c1321 unsigned long limit; local
1357 limit = nr_free_buffer_pages() / 8;
1358 limit = max(limit, 128UL);
1359 sysctl_sctp_mem[0] = limit / 4 * 3;
1360 sysctl_sctp_mem[1] = limit;
1364 limit = (sysctl_sctp_mem[1]) << (PAGE_SHIFT - 7);
1365 max_share = min(4UL*1024*1024, limit);
/net/sunrpc/
H A Dsvc_xprt.c551 unsigned int limit = serv->sv_maxconn ? serv->sv_maxconn : local
554 if (serv->sv_tmpcnt > limit) {
/net/ipv4/netfilter/
H A Darp_tables.c563 const unsigned char *limit,
571 (unsigned char *)e + sizeof(struct arpt_entry) >= limit) {
1215 const unsigned char *limit,
1227 (unsigned char *)e + sizeof(struct compat_arpt_entry) >= limit) {
1228 duprintf("Bad offset %p, limit = %p\n", e, limit);
560 check_entry_size_and_hooks(struct arpt_entry *e, struct xt_table_info *newinfo, const unsigned char *base, const unsigned char *limit, const unsigned int *hook_entries, const unsigned int *underflows, unsigned int valid_hooks) argument
1211 check_compat_entry_size_and_hooks(struct compat_arpt_entry *e, struct xt_table_info *newinfo, unsigned int *size, const unsigned char *base, const unsigned char *limit, const unsigned int *hook_entries, const unsigned int *underflows, const char *name) argument
H A Dip_tables.c726 const unsigned char *limit,
734 (unsigned char *)e + sizeof(struct ipt_entry) >= limit) {
1479 const unsigned char *limit,
1493 (unsigned char *)e + sizeof(struct compat_ipt_entry) >= limit) {
1494 duprintf("Bad offset %p, limit = %p\n", e, limit);
723 check_entry_size_and_hooks(struct ipt_entry *e, struct xt_table_info *newinfo, const unsigned char *base, const unsigned char *limit, const unsigned int *hook_entries, const unsigned int *underflows, unsigned int valid_hooks) argument
1475 check_compat_entry_size_and_hooks(struct compat_ipt_entry *e, struct xt_table_info *newinfo, unsigned int *size, const unsigned char *base, const unsigned char *limit, const unsigned int *hook_entries, const unsigned int *underflows, const char *name) argument
/net/ipv4/
H A Dtcp.c3056 unsigned long limit = nr_free_buffer_pages() / 8; local
3057 limit = max(limit, 128UL);
3058 sysctl_tcp_mem[0] = limit / 4 * 3;
3059 sysctl_tcp_mem[1] = limit;
3066 unsigned long limit; local
3124 limit = nr_free_buffer_pages() << (PAGE_SHIFT - 7);
3125 max_wshare = min(4UL*1024*1024, limit);
3126 max_rshare = min(6UL*1024*1024, limit);
H A Dudp.c2513 unsigned long limit; local
2516 limit = nr_free_buffer_pages() / 8;
2517 limit = max(limit, 128UL);
2518 sysctl_udp_mem[0] = limit / 4 * 3;
2519 sysctl_udp_mem[1] = limit;

Completed in 846 milliseconds

12