diff options
author | Mauro Carvalho Chehab <mchehab@redhat.com> | 2012-03-23 07:06:43 -0400 |
---|---|---|
committer | Mauro Carvalho Chehab <mchehab@redhat.com> | 2012-03-23 07:06:43 -0400 |
commit | 7483d45f0aee3afc0646d185cabd4af9f6cab58c (patch) | |
tree | a312f7d77c34748bec62f0431df33007b10e4e7f /lib/dynamic_queue_limits.c | |
parent | 3e85fc1b9fc1c7e20b9a01f2314bb633bb10501a (diff) | |
parent | f92c97c8bd77992ff8bd6ef29a23dc82dca799cb (diff) |
Merge branch 'staging/for_v3.4' into v4l_for_linus
* staging/for_v3.4: (10117 commits)
[media] update CARDLIST.em28xx
[media] partially reverts changeset fa5527c
[media] stb0899: fix the limits for signal strength values
[media] em28xx: support for 2304:0242 PCTV QuatroStick (510e)
[media] em28xx: support for 2013:0251 PCTV QuatroStick nano (520e)
[media] -EINVAL -> -ENOTTY
[media] gspca - sn9c20x: Cleanup source
[media] gspca - sn9c20x: Simplify register write for capture start/stop
[media] gspca - sn9c20x: Add automatic JPEG compression mechanism
[media] gspca - sn9c20x: Greater delay in case of sensor no response
[media] gspca - sn9c20x: Optimize the code of write sequences
[media] gspca - sn9c20x: Add the JPEG compression quality control
[media] gspca - sn9c20x: Add a delay after Omnivision sensor reset
[media] gspca - sn9c20x: Propagate USB errors to higher level
[media] gspca - sn9c20x: Use the new video control mechanism
[media] gspca - sn9c20x: Fix loss of frame start
[media] gspca - zc3xx: Lack of register 08 value for sensor cs2102k
[media] gspca - ov534_9: Add brightness to OmniVision 5621 sensor
[media] gspca - zc3xx: Add V4L2_CID_JPEG_COMPRESSION_QUALITY control support
[media] pvrusb2: fix 7MHz & 8MHz DVB-T tuner support for HVR1900 rev D1F5
...
Diffstat (limited to 'lib/dynamic_queue_limits.c')
-rw-r--r-- | lib/dynamic_queue_limits.c | 134 |
1 files changed, 134 insertions, 0 deletions
diff --git a/lib/dynamic_queue_limits.c b/lib/dynamic_queue_limits.c new file mode 100644 index 000000000000..6ab4587d052b --- /dev/null +++ b/lib/dynamic_queue_limits.c | |||
@@ -0,0 +1,134 @@ | |||
1 | /* | ||
2 | * Dynamic byte queue limits. See include/linux/dynamic_queue_limits.h | ||
3 | * | ||
4 | * Copyright (c) 2011, Tom Herbert <therbert@google.com> | ||
5 | */ | ||
6 | #include <linux/module.h> | ||
7 | #include <linux/types.h> | ||
8 | #include <linux/ctype.h> | ||
9 | #include <linux/kernel.h> | ||
10 | #include <linux/jiffies.h> | ||
11 | #include <linux/dynamic_queue_limits.h> | ||
12 | |||
13 | #define POSDIFF(A, B) ((A) > (B) ? (A) - (B) : 0) | ||
14 | |||
15 | /* Records completed count and recalculates the queue limit */ | ||
16 | void dql_completed(struct dql *dql, unsigned int count) | ||
17 | { | ||
18 | unsigned int inprogress, prev_inprogress, limit; | ||
19 | unsigned int ovlimit, all_prev_completed, completed; | ||
20 | |||
21 | /* Can't complete more than what's in queue */ | ||
22 | BUG_ON(count > dql->num_queued - dql->num_completed); | ||
23 | |||
24 | completed = dql->num_completed + count; | ||
25 | limit = dql->limit; | ||
26 | ovlimit = POSDIFF(dql->num_queued - dql->num_completed, limit); | ||
27 | inprogress = dql->num_queued - completed; | ||
28 | prev_inprogress = dql->prev_num_queued - dql->num_completed; | ||
29 | all_prev_completed = POSDIFF(completed, dql->prev_num_queued); | ||
30 | |||
31 | if ((ovlimit && !inprogress) || | ||
32 | (dql->prev_ovlimit && all_prev_completed)) { | ||
33 | /* | ||
34 | * Queue considered starved if: | ||
35 | * - The queue was over-limit in the last interval, | ||
36 | * and there is no more data in the queue. | ||
37 | * OR | ||
38 | * - The queue was over-limit in the previous interval and | ||
39 | * when enqueuing it was possible that all queued data | ||
40 | * had been consumed. This covers the case when queue | ||
41 | * may have becomes starved between completion processing | ||
42 | * running and next time enqueue was scheduled. | ||
43 | * | ||
44 | * When queue is starved increase the limit by the amount | ||
45 | * of bytes both sent and completed in the last interval, | ||
46 | * plus any previous over-limit. | ||
47 | */ | ||
48 | limit += POSDIFF(completed, dql->prev_num_queued) + | ||
49 | dql->prev_ovlimit; | ||
50 | dql->slack_start_time = jiffies; | ||
51 | dql->lowest_slack = UINT_MAX; | ||
52 | } else if (inprogress && prev_inprogress && !all_prev_completed) { | ||
53 | /* | ||
54 | * Queue was not starved, check if the limit can be decreased. | ||
55 | * A decrease is only considered if the queue has been busy in | ||
56 | * the whole interval (the check above). | ||
57 | * | ||
58 | * If there is slack, the amount of execess data queued above | ||
59 | * the the amount needed to prevent starvation, the queue limit | ||
60 | * can be decreased. To avoid hysteresis we consider the | ||
61 | * minimum amount of slack found over several iterations of the | ||
62 | * completion routine. | ||
63 | */ | ||
64 | unsigned int slack, slack_last_objs; | ||
65 | |||
66 | /* | ||
67 | * Slack is the maximum of | ||
68 | * - The queue limit plus previous over-limit minus twice | ||
69 | * the number of objects completed. Note that two times | ||
70 | * number of completed bytes is a basis for an upper bound | ||
71 | * of the limit. | ||
72 | * - Portion of objects in the last queuing operation that | ||
73 | * was not part of non-zero previous over-limit. That is | ||
74 | * "round down" by non-overlimit portion of the last | ||
75 | * queueing operation. | ||
76 | */ | ||
77 | slack = POSDIFF(limit + dql->prev_ovlimit, | ||
78 | 2 * (completed - dql->num_completed)); | ||
79 | slack_last_objs = dql->prev_ovlimit ? | ||
80 | POSDIFF(dql->prev_last_obj_cnt, dql->prev_ovlimit) : 0; | ||
81 | |||
82 | slack = max(slack, slack_last_objs); | ||
83 | |||
84 | if (slack < dql->lowest_slack) | ||
85 | dql->lowest_slack = slack; | ||
86 | |||
87 | if (time_after(jiffies, | ||
88 | dql->slack_start_time + dql->slack_hold_time)) { | ||
89 | limit = POSDIFF(limit, dql->lowest_slack); | ||
90 | dql->slack_start_time = jiffies; | ||
91 | dql->lowest_slack = UINT_MAX; | ||
92 | } | ||
93 | } | ||
94 | |||
95 | /* Enforce bounds on limit */ | ||
96 | limit = clamp(limit, dql->min_limit, dql->max_limit); | ||
97 | |||
98 | if (limit != dql->limit) { | ||
99 | dql->limit = limit; | ||
100 | ovlimit = 0; | ||
101 | } | ||
102 | |||
103 | dql->adj_limit = limit + completed; | ||
104 | dql->prev_ovlimit = ovlimit; | ||
105 | dql->prev_last_obj_cnt = dql->last_obj_cnt; | ||
106 | dql->num_completed = completed; | ||
107 | dql->prev_num_queued = dql->num_queued; | ||
108 | } | ||
109 | EXPORT_SYMBOL(dql_completed); | ||
110 | |||
111 | void dql_reset(struct dql *dql) | ||
112 | { | ||
113 | /* Reset all dynamic values */ | ||
114 | dql->limit = 0; | ||
115 | dql->num_queued = 0; | ||
116 | dql->num_completed = 0; | ||
117 | dql->last_obj_cnt = 0; | ||
118 | dql->prev_num_queued = 0; | ||
119 | dql->prev_last_obj_cnt = 0; | ||
120 | dql->prev_ovlimit = 0; | ||
121 | dql->lowest_slack = UINT_MAX; | ||
122 | dql->slack_start_time = jiffies; | ||
123 | } | ||
124 | EXPORT_SYMBOL(dql_reset); | ||
125 | |||
126 | int dql_init(struct dql *dql, unsigned hold_time) | ||
127 | { | ||
128 | dql->max_limit = DQL_MAX_LIMIT; | ||
129 | dql->min_limit = 0; | ||
130 | dql->slack_hold_time = hold_time; | ||
131 | dql_reset(dql); | ||
132 | return 0; | ||
133 | } | ||
134 | EXPORT_SYMBOL(dql_init); | ||