Commit e2db7592 authored by Ingo Molnar's avatar Ingo Molnar
Browse files

locking: Fix typos in comments 



Fix ~16 single-word typos in locking code comments.

Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Paul E. McKenney <paulmck@kernel.org>
Cc: Will Deacon <will.deacon@arm.com>
Cc: linux-kernel@vger.kernel.org
Signed-off-by: default avatarIngo Molnar <mingo@kernel.org>
parent 8c52cca0

arch/arm/include/asm/spinlock.h

+1 −1
Original line number Diff line number Diff line
@@ -22,7 +22,7 @@ 
 * assembler to insert a extra (16-bit) IT instruction, depending on the

 * presence or absence of neighbouring conditional instructions.

 *

 * To avoid this unpredictableness, an approprite IT is inserted explicitly:

 * To avoid this unpredictability, an appropriate IT is inserted explicitly:

 * the assembler won't change IT instructions which are explicitly present

 * in the input.

 */

include/linux/lockdep.h

+1 −1
Original line number Diff line number Diff line
@@ -155,7 +155,7 @@ extern void lockdep_set_selftest_task(struct task_struct *task); 
extern void lockdep_init_task(struct task_struct *task);



/*

 * Split the recrursion counter in two to readily detect 'off' vs recursion.

 * Split the recursion counter in two to readily detect 'off' vs recursion.

 */

#define LOCKDEP_RECURSION_BITS	16

#define LOCKDEP_OFF		(1U << LOCKDEP_RECURSION_BITS)

include/linux/rwsem.h

+1 −1
Original line number Diff line number Diff line
@@ -110,7 +110,7 @@ do { \ 


/*

 * This is the same regardless of which rwsem implementation that is being used.

 * It is just a heuristic meant to be called by somebody alreadying holding the

 * It is just a heuristic meant to be called by somebody already holding the

 * rwsem to see if somebody from an incompatible type is wanting access to the

 * lock.

 */

kernel/locking/lockdep.c

+2 −2
Original line number Diff line number Diff line
@@ -1747,7 +1747,7 @@ static enum bfs_result __bfs(struct lock_list *source_entry, 


		/*

		 * Step 4: if not match, expand the path by adding the

		 *         forward or backwards dependencis in the search

		 *         forward or backwards dependencies in the search

		 *

		 */

		first = true;
@@ -1916,7 +1916,7 @@ print_circular_bug_header(struct lock_list *entry, unsigned int depth, 
 * -> B is -(ER)-> or -(EN)->, then we don't need to add A -> B into the

 * dependency graph, as any strong path ..-> A -> B ->.. we can get with

 * having dependency A -> B, we could already get a equivalent path ..-> A ->

 * .. -> B -> .. with A -> .. -> B. Therefore A -> B is reduntant.

 * .. -> B -> .. with A -> .. -> B. Therefore A -> B is redundant.

 *

 * We need to make sure both the start and the end of A -> .. -> B is not

 * weaker than A -> B. For the start part, please see the comment in

kernel/locking/lockdep_proc.c

+1 −1
Original line number Diff line number Diff line
@@ -348,7 +348,7 @@ static int lockdep_stats_show(struct seq_file *m, void *v) 
			debug_locks);



	/*

	 * Zappped classes and lockdep data buffers reuse statistics.

	 * Zapped classes and lockdep data buffers reuse statistics.

	 */

	seq_puts(m, "\n");

	seq_printf(m, " zapped classes:                %11lu\n",