s/wihin/within/ s/retrieven/retrieved/ s/suppport/support/ s/wil/will/ s/accidently/accidentally/ s/if the if the/if the/ Link: https://lkml.kernel.org/r/20201010140924.3809-1-hqjagain@gmail.com
Showing the changes to kernel (2 of 2 files). Show all
Unified · Split
| @@ -9465,7 +9465,7 @@ __init static int tracer_alloc_buffers(void) · 9464 unmodified lines | ||
| 9465 | 9465 | } |
| 9466 | 9466 | |
| 9467 | 9467 | /* |
| 9468 | − * Make sure we don't accidently add more trace options | |
| 9468 | + * Make sure we don't accidentally add more trace options | |
| 9469 | 9469 | * than we have bits for. |
| 9470 | 9470 | */ |
| 9471 | 9471 | BUILD_BUG_ON(TRACE_ITER_LAST_BIT > TRACE_FLAGS_MAX_SIZE); |
| @@ -9494,7 +9494,7 @@ __init static int tracer_alloc_buffers(void) · 22 unmodified lines | ||
| 9494 | 9494 | |
| 9495 | 9495 | /* |
| 9496 | 9496 | * The prepare callbacks allocates some memory for the ring buffer. We |
| 9497 | − * don't free the buffer if the if the CPU goes down. If we were to free | |
| 9497 | + * don't free the buffer if the CPU goes down. If we were to free | |
| 9498 | 9498 | * the buffer, then the user would lose any trace that was in the |
| 9499 | 9499 | * buffer. The memory will be removed once the "instance" is removed. |
| 9500 | 9500 | */ |
| @@ -246,7 +246,7 @@ typedef bool (*cond_update_fn_t)(struct trace_array *tr, void *cond_data); · 245 unmodified lines | ||
| 246 | 246 | * tracing_snapshot_cond(tr, cond_data), the cond_data passed in is |
| 247 | 247 | * passed in turn to the cond_snapshot.update() function. That data |
| 248 | 248 | * can be compared by the update() implementation with the cond_data |
| 249 | − * contained wihin the struct cond_snapshot instance associated with | |
| 249 | + * contained within the struct cond_snapshot instance associated with | |
| 250 | 250 | * the trace_array. Because the tr->max_lock is held throughout the |
| 251 | 251 | * update() call, the update() function can directly retrieve the |
| 252 | 252 | * cond_snapshot and cond_data associated with the per-instance |
| @@ -271,7 +271,7 @@ typedef bool (*cond_update_fn_t)(struct trace_array *tr, void *cond_data); · 18 unmodified lines | ||
| 271 | 271 | * take the snapshot, by returning 'true' if so, 'false' if no |
| 272 | 272 | * snapshot should be taken. Because the max_lock is held for |
| 273 | 273 | * the duration of update(), the implementation is safe to |
| 274 | − * directly retrieven and save any implementation data it needs | |
| 274 | + * directly retrieved and save any implementation data it needs | |
| 275 | 275 | * to in association with the snapshot. |
| 276 | 276 | */ |
| 277 | 277 | struct cond_snapshot { |
| @@ -573,7 +573,7 @@ struct tracer { · 295 unmodified lines | ||
| 573 | 573 | * The function callback, which can use the FTRACE bits to |
| 574 | 574 | * check for recursion. |
| 575 | 575 | * |
| 576 | − * Now if the arch does not suppport a feature, and it calls | |
| 576 | + * Now if the arch does not support a feature, and it calls | |
| 577 | 577 | * the global list function which calls the ftrace callback |
| 578 | 578 | * all three of these steps will do a recursion protection. |
| 579 | 579 | * There's no reason to do one if the previous caller already |
| @@ -1479,7 +1479,7 @@ __trace_event_discard_commit(struct trace_buffer *buffer, · 899 unmodified lines | ||
| 1479 | 1479 | /* |
| 1480 | 1480 | * Helper function for event_trigger_unlock_commit{_regs}(). |
| 1481 | 1481 | * If there are event triggers attached to this event that requires |
| 1482 | − * filtering against its fields, then they wil be called as the | |
| 1482 | + * filtering against its fields, then they will be called as the | |
| 1483 | 1483 | * entry already holds the field information of the current event. |
| 1484 | 1484 | * |
| 1485 | 1485 | * It also checks if the event should be discarded or not. |