diff options
Diffstat (limited to 'kernel/trace/trace_seq.c')
-rw-r--r-- | kernel/trace/trace_seq.c | 177 |
1 files changed, 82 insertions, 95 deletions
diff --git a/kernel/trace/trace_seq.c b/kernel/trace/trace_seq.c index fabfa0f190a3..f8b45d8792f9 100644 --- a/kernel/trace/trace_seq.c +++ b/kernel/trace/trace_seq.c | |||
@@ -27,10 +27,19 @@ | |||
27 | #include <linux/trace_seq.h> | 27 | #include <linux/trace_seq.h> |
28 | 28 | ||
29 | /* How much buffer is left on the trace_seq? */ | 29 | /* How much buffer is left on the trace_seq? */ |
30 | #define TRACE_SEQ_BUF_LEFT(s) ((PAGE_SIZE - 1) - (s)->len) | 30 | #define TRACE_SEQ_BUF_LEFT(s) seq_buf_buffer_left(&(s)->seq) |
31 | 31 | ||
32 | /* How much buffer is written? */ | 32 | /* How much buffer is written? */ |
33 | #define TRACE_SEQ_BUF_USED(s) min((s)->len, (unsigned int)(PAGE_SIZE - 1)) | 33 | #define TRACE_SEQ_BUF_USED(s) seq_buf_used(&(s)->seq) |
34 | |||
35 | /* | ||
36 | * trace_seq should work with being initialized with 0s. | ||
37 | */ | ||
38 | static inline void __trace_seq_init(struct trace_seq *s) | ||
39 | { | ||
40 | if (unlikely(!s->seq.size)) | ||
41 | trace_seq_init(s); | ||
42 | } | ||
34 | 43 | ||
35 | /** | 44 | /** |
36 | * trace_print_seq - move the contents of trace_seq into a seq_file | 45 | * trace_print_seq - move the contents of trace_seq into a seq_file |
@@ -43,10 +52,11 @@ | |||
43 | */ | 52 | */ |
44 | int trace_print_seq(struct seq_file *m, struct trace_seq *s) | 53 | int trace_print_seq(struct seq_file *m, struct trace_seq *s) |
45 | { | 54 | { |
46 | unsigned int len = TRACE_SEQ_BUF_USED(s); | ||
47 | int ret; | 55 | int ret; |
48 | 56 | ||
49 | ret = seq_write(m, s->buffer, len); | 57 | __trace_seq_init(s); |
58 | |||
59 | ret = seq_buf_print_seq(m, &s->seq); | ||
50 | 60 | ||
51 | /* | 61 | /* |
52 | * Only reset this buffer if we successfully wrote to the | 62 | * Only reset this buffer if we successfully wrote to the |
@@ -72,24 +82,23 @@ int trace_print_seq(struct seq_file *m, struct trace_seq *s) | |||
72 | */ | 82 | */ |
73 | void trace_seq_printf(struct trace_seq *s, const char *fmt, ...) | 83 | void trace_seq_printf(struct trace_seq *s, const char *fmt, ...) |
74 | { | 84 | { |
75 | unsigned int len = TRACE_SEQ_BUF_LEFT(s); | 85 | unsigned int save_len = s->seq.len; |
76 | va_list ap; | 86 | va_list ap; |
77 | int ret; | ||
78 | 87 | ||
79 | if (s->full || !len) | 88 | if (s->full) |
80 | return; | 89 | return; |
81 | 90 | ||
91 | __trace_seq_init(s); | ||
92 | |||
82 | va_start(ap, fmt); | 93 | va_start(ap, fmt); |
83 | ret = vsnprintf(s->buffer + s->len, len, fmt, ap); | 94 | seq_buf_vprintf(&s->seq, fmt, ap); |
84 | va_end(ap); | 95 | va_end(ap); |
85 | 96 | ||
86 | /* If we can't write it all, don't bother writing anything */ | 97 | /* If we can't write it all, don't bother writing anything */ |
87 | if (ret >= len) { | 98 | if (unlikely(seq_buf_has_overflowed(&s->seq))) { |
99 | s->seq.len = save_len; | ||
88 | s->full = 1; | 100 | s->full = 1; |
89 | return; | ||
90 | } | 101 | } |
91 | |||
92 | s->len += ret; | ||
93 | } | 102 | } |
94 | EXPORT_SYMBOL_GPL(trace_seq_printf); | 103 | EXPORT_SYMBOL_GPL(trace_seq_printf); |
95 | 104 | ||
@@ -104,14 +113,19 @@ EXPORT_SYMBOL_GPL(trace_seq_printf); | |||
104 | void trace_seq_bitmask(struct trace_seq *s, const unsigned long *maskp, | 113 | void trace_seq_bitmask(struct trace_seq *s, const unsigned long *maskp, |
105 | int nmaskbits) | 114 | int nmaskbits) |
106 | { | 115 | { |
107 | unsigned int len = TRACE_SEQ_BUF_LEFT(s); | 116 | unsigned int save_len = s->seq.len; |
108 | int ret; | ||
109 | 117 | ||
110 | if (s->full || !len) | 118 | if (s->full) |
111 | return; | 119 | return; |
112 | 120 | ||
113 | ret = bitmap_scnprintf(s->buffer + s->len, len, maskp, nmaskbits); | 121 | __trace_seq_init(s); |
114 | s->len += ret; | 122 | |
123 | seq_buf_bitmask(&s->seq, maskp, nmaskbits); | ||
124 | |||
125 | if (unlikely(seq_buf_has_overflowed(&s->seq))) { | ||
126 | s->seq.len = save_len; | ||
127 | s->full = 1; | ||
128 | } | ||
115 | } | 129 | } |
116 | EXPORT_SYMBOL_GPL(trace_seq_bitmask); | 130 | EXPORT_SYMBOL_GPL(trace_seq_bitmask); |
117 | 131 | ||
@@ -128,21 +142,20 @@ EXPORT_SYMBOL_GPL(trace_seq_bitmask); | |||
128 | */ | 142 | */ |
129 | void trace_seq_vprintf(struct trace_seq *s, const char *fmt, va_list args) | 143 | void trace_seq_vprintf(struct trace_seq *s, const char *fmt, va_list args) |
130 | { | 144 | { |
131 | unsigned int len = TRACE_SEQ_BUF_LEFT(s); | 145 | unsigned int save_len = s->seq.len; |
132 | int ret; | ||
133 | 146 | ||
134 | if (s->full || !len) | 147 | if (s->full) |
135 | return; | 148 | return; |
136 | 149 | ||
137 | ret = vsnprintf(s->buffer + s->len, len, fmt, args); | 150 | __trace_seq_init(s); |
151 | |||
152 | seq_buf_vprintf(&s->seq, fmt, args); | ||
138 | 153 | ||
139 | /* If we can't write it all, don't bother writing anything */ | 154 | /* If we can't write it all, don't bother writing anything */ |
140 | if (ret >= len) { | 155 | if (unlikely(seq_buf_has_overflowed(&s->seq))) { |
156 | s->seq.len = save_len; | ||
141 | s->full = 1; | 157 | s->full = 1; |
142 | return; | ||
143 | } | 158 | } |
144 | |||
145 | s->len += ret; | ||
146 | } | 159 | } |
147 | EXPORT_SYMBOL_GPL(trace_seq_vprintf); | 160 | EXPORT_SYMBOL_GPL(trace_seq_vprintf); |
148 | 161 | ||
@@ -163,21 +176,21 @@ EXPORT_SYMBOL_GPL(trace_seq_vprintf); | |||
163 | */ | 176 | */ |
164 | void trace_seq_bprintf(struct trace_seq *s, const char *fmt, const u32 *binary) | 177 | void trace_seq_bprintf(struct trace_seq *s, const char *fmt, const u32 *binary) |
165 | { | 178 | { |
166 | unsigned int len = TRACE_SEQ_BUF_LEFT(s); | 179 | unsigned int save_len = s->seq.len; |
167 | int ret; | ||
168 | 180 | ||
169 | if (s->full || !len) | 181 | if (s->full) |
170 | return; | 182 | return; |
171 | 183 | ||
172 | ret = bstr_printf(s->buffer + s->len, len, fmt, binary); | 184 | __trace_seq_init(s); |
185 | |||
186 | seq_buf_bprintf(&s->seq, fmt, binary); | ||
173 | 187 | ||
174 | /* If we can't write it all, don't bother writing anything */ | 188 | /* If we can't write it all, don't bother writing anything */ |
175 | if (ret >= len) { | 189 | if (unlikely(seq_buf_has_overflowed(&s->seq))) { |
190 | s->seq.len = save_len; | ||
176 | s->full = 1; | 191 | s->full = 1; |
177 | return; | 192 | return; |
178 | } | 193 | } |
179 | |||
180 | s->len += ret; | ||
181 | } | 194 | } |
182 | EXPORT_SYMBOL_GPL(trace_seq_bprintf); | 195 | EXPORT_SYMBOL_GPL(trace_seq_bprintf); |
183 | 196 | ||
@@ -198,13 +211,14 @@ void trace_seq_puts(struct trace_seq *s, const char *str) | |||
198 | if (s->full) | 211 | if (s->full) |
199 | return; | 212 | return; |
200 | 213 | ||
214 | __trace_seq_init(s); | ||
215 | |||
201 | if (len > TRACE_SEQ_BUF_LEFT(s)) { | 216 | if (len > TRACE_SEQ_BUF_LEFT(s)) { |
202 | s->full = 1; | 217 | s->full = 1; |
203 | return; | 218 | return; |
204 | } | 219 | } |
205 | 220 | ||
206 | memcpy(s->buffer + s->len, str, len); | 221 | seq_buf_putmem(&s->seq, str, len); |
207 | s->len += len; | ||
208 | } | 222 | } |
209 | EXPORT_SYMBOL_GPL(trace_seq_puts); | 223 | EXPORT_SYMBOL_GPL(trace_seq_puts); |
210 | 224 | ||
@@ -223,12 +237,14 @@ void trace_seq_putc(struct trace_seq *s, unsigned char c) | |||
223 | if (s->full) | 237 | if (s->full) |
224 | return; | 238 | return; |
225 | 239 | ||
240 | __trace_seq_init(s); | ||
241 | |||
226 | if (TRACE_SEQ_BUF_LEFT(s) < 1) { | 242 | if (TRACE_SEQ_BUF_LEFT(s) < 1) { |
227 | s->full = 1; | 243 | s->full = 1; |
228 | return; | 244 | return; |
229 | } | 245 | } |
230 | 246 | ||
231 | s->buffer[s->len++] = c; | 247 | seq_buf_putc(&s->seq, c); |
232 | } | 248 | } |
233 | EXPORT_SYMBOL_GPL(trace_seq_putc); | 249 | EXPORT_SYMBOL_GPL(trace_seq_putc); |
234 | 250 | ||
@@ -247,19 +263,17 @@ void trace_seq_putmem(struct trace_seq *s, const void *mem, unsigned int len) | |||
247 | if (s->full) | 263 | if (s->full) |
248 | return; | 264 | return; |
249 | 265 | ||
266 | __trace_seq_init(s); | ||
267 | |||
250 | if (len > TRACE_SEQ_BUF_LEFT(s)) { | 268 | if (len > TRACE_SEQ_BUF_LEFT(s)) { |
251 | s->full = 1; | 269 | s->full = 1; |
252 | return; | 270 | return; |
253 | } | 271 | } |
254 | 272 | ||
255 | memcpy(s->buffer + s->len, mem, len); | 273 | seq_buf_putmem(&s->seq, mem, len); |
256 | s->len += len; | ||
257 | } | 274 | } |
258 | EXPORT_SYMBOL_GPL(trace_seq_putmem); | 275 | EXPORT_SYMBOL_GPL(trace_seq_putmem); |
259 | 276 | ||
260 | #define MAX_MEMHEX_BYTES 8U | ||
261 | #define HEX_CHARS (MAX_MEMHEX_BYTES*2 + 1) | ||
262 | |||
263 | /** | 277 | /** |
264 | * trace_seq_putmem_hex - write raw memory into the buffer in ASCII hex | 278 | * trace_seq_putmem_hex - write raw memory into the buffer in ASCII hex |
265 | * @s: trace sequence descriptor | 279 | * @s: trace sequence descriptor |
@@ -273,32 +287,26 @@ EXPORT_SYMBOL_GPL(trace_seq_putmem); | |||
273 | void trace_seq_putmem_hex(struct trace_seq *s, const void *mem, | 287 | void trace_seq_putmem_hex(struct trace_seq *s, const void *mem, |
274 | unsigned int len) | 288 | unsigned int len) |
275 | { | 289 | { |
276 | unsigned char hex[HEX_CHARS]; | 290 | unsigned int save_len = s->seq.len; |
277 | const unsigned char *data = mem; | ||
278 | unsigned int start_len; | ||
279 | int i, j; | ||
280 | 291 | ||
281 | if (s->full) | 292 | if (s->full) |
282 | return; | 293 | return; |
283 | 294 | ||
284 | while (len) { | 295 | __trace_seq_init(s); |
285 | start_len = min(len, HEX_CHARS - 1); | 296 | |
286 | #ifdef __BIG_ENDIAN | 297 | /* Each byte is represented by two chars */ |
287 | for (i = 0, j = 0; i < start_len; i++) { | 298 | if (len * 2 > TRACE_SEQ_BUF_LEFT(s)) { |
288 | #else | 299 | s->full = 1; |
289 | for (i = start_len-1, j = 0; i >= 0; i--) { | 300 | return; |
290 | #endif | 301 | } |
291 | hex[j++] = hex_asc_hi(data[i]); | 302 | |
292 | hex[j++] = hex_asc_lo(data[i]); | 303 | /* The added spaces can still cause an overflow */ |
293 | } | 304 | seq_buf_putmem_hex(&s->seq, mem, len); |
294 | if (WARN_ON_ONCE(j == 0 || j/2 > len)) | 305 | |
295 | break; | 306 | if (unlikely(seq_buf_has_overflowed(&s->seq))) { |
296 | 307 | s->seq.len = save_len; | |
297 | /* j increments twice per loop */ | 308 | s->full = 1; |
298 | len -= j / 2; | 309 | return; |
299 | hex[j++] = ' '; | ||
300 | |||
301 | trace_seq_putmem(s, hex, j); | ||
302 | } | 310 | } |
303 | } | 311 | } |
304 | EXPORT_SYMBOL_GPL(trace_seq_putmem_hex); | 312 | EXPORT_SYMBOL_GPL(trace_seq_putmem_hex); |
@@ -317,30 +325,27 @@ EXPORT_SYMBOL_GPL(trace_seq_putmem_hex); | |||
317 | */ | 325 | */ |
318 | int trace_seq_path(struct trace_seq *s, const struct path *path) | 326 | int trace_seq_path(struct trace_seq *s, const struct path *path) |
319 | { | 327 | { |
320 | unsigned char *p; | 328 | unsigned int save_len = s->seq.len; |
321 | 329 | ||
322 | if (s->full) | 330 | if (s->full) |
323 | return 0; | 331 | return 0; |
324 | 332 | ||
333 | __trace_seq_init(s); | ||
334 | |||
325 | if (TRACE_SEQ_BUF_LEFT(s) < 1) { | 335 | if (TRACE_SEQ_BUF_LEFT(s) < 1) { |
326 | s->full = 1; | 336 | s->full = 1; |
327 | return 0; | 337 | return 0; |
328 | } | 338 | } |
329 | 339 | ||
330 | p = d_path(path, s->buffer + s->len, PAGE_SIZE - s->len); | 340 | seq_buf_path(&s->seq, path, "\n"); |
331 | if (!IS_ERR(p)) { | 341 | |
332 | p = mangle_path(s->buffer + s->len, p, "\n"); | 342 | if (unlikely(seq_buf_has_overflowed(&s->seq))) { |
333 | if (p) { | 343 | s->seq.len = save_len; |
334 | s->len = p - s->buffer; | 344 | s->full = 1; |
335 | return 1; | 345 | return 0; |
336 | } | ||
337 | } else { | ||
338 | s->buffer[s->len++] = '?'; | ||
339 | return 1; | ||
340 | } | 346 | } |
341 | 347 | ||
342 | s->full = 1; | 348 | return 1; |
343 | return 0; | ||
344 | } | 349 | } |
345 | EXPORT_SYMBOL_GPL(trace_seq_path); | 350 | EXPORT_SYMBOL_GPL(trace_seq_path); |
346 | 351 | ||
@@ -366,25 +371,7 @@ EXPORT_SYMBOL_GPL(trace_seq_path); | |||
366 | */ | 371 | */ |
367 | int trace_seq_to_user(struct trace_seq *s, char __user *ubuf, int cnt) | 372 | int trace_seq_to_user(struct trace_seq *s, char __user *ubuf, int cnt) |
368 | { | 373 | { |
369 | int len; | 374 | __trace_seq_init(s); |
370 | int ret; | 375 | return seq_buf_to_user(&s->seq, ubuf, cnt); |
371 | |||
372 | if (!cnt) | ||
373 | return 0; | ||
374 | |||
375 | if (s->len <= s->readpos) | ||
376 | return -EBUSY; | ||
377 | |||
378 | len = s->len - s->readpos; | ||
379 | if (cnt > len) | ||
380 | cnt = len; | ||
381 | ret = copy_to_user(ubuf, s->buffer + s->readpos, cnt); | ||
382 | if (ret == cnt) | ||
383 | return -EFAULT; | ||
384 | |||
385 | cnt -= ret; | ||
386 | |||
387 | s->readpos += cnt; | ||
388 | return cnt; | ||
389 | } | 376 | } |
390 | EXPORT_SYMBOL_GPL(trace_seq_to_user); | 377 | EXPORT_SYMBOL_GPL(trace_seq_to_user); |