Commit 8fb33b60 authored by Zhen Lei's avatar Zhen Lei Committed by Andrii Nakryiko
Browse files

bpf: Fix spelling mistakes 



Fix some spelling mistakes in comments:
aother ==> another
Netiher ==> Neither
desribe ==> describe
intializing ==> initializing
funciton ==> function
wont ==> won't and move the word 'the' at the end to the next line
accross ==> across
pathes ==> paths
triggerred ==> triggered
excute ==> execute
ether ==> either
conervative ==> conservative
convetion ==> convention
markes ==> marks
interpeter ==> interpreter

Signed-off-by: default avatarZhen Lei <thunder.leizhen@huawei.com>
Signed-off-by: default avatarAndrii Nakryiko <andrii@kernel.org>
Link: https://lore.kernel.org/bpf/20210525025659.8898-2-thunder.leizhen@huawei.com
parent 4ce7d68b

include/linux/bpf_local_storage.h

+2 −2
Original line number Diff line number Diff line
@@ -58,7 +58,7 @@ struct bpf_local_storage_data { 
	 * from the object's bpf_local_storage.

	 *

	 * Put it in the same cacheline as the data to minimize

	 * the number of cachelines access during the cache hit case.

	 * the number of cachelines accessed during the cache hit case.

	 */

	struct bpf_local_storage_map __rcu *smap;

	u8 data[] __aligned(8);
@@ -71,7 +71,7 @@ struct bpf_local_storage_elem { 
	struct bpf_local_storage __rcu *local_storage;

	struct rcu_head rcu;

	/* 8 bytes hole */

	/* The data is stored in aother cacheline to minimize

	/* The data is stored in another cacheline to minimize

	 * the number of cachelines access during a cache hit.

	 */

	struct bpf_local_storage_data sdata ____cacheline_aligned;

kernel/bpf/bpf_inode_storage.c

+1 −1
Original line number Diff line number Diff line
@@ -72,7 +72,7 @@ void bpf_inode_storage_free(struct inode *inode) 
		return;

	}



	/* Netiher the bpf_prog nor the bpf-map's syscall

	/* Neither the bpf_prog nor the bpf-map's syscall

	 * could be modifying the local_storage->list now.

	 * Thus, no elem can be added-to or deleted-from the

	 * local_storage->list by the bpf_prog or by the bpf-map's syscall.

kernel/bpf/btf.c

+3 −3
Original line number Diff line number Diff line
@@ -51,7 +51,7 @@ 
 * The BTF type section contains a list of 'struct btf_type' objects.

 * Each one describes a C type.  Recall from the above section

 * that a 'struct btf_type' object could be immediately followed by extra

 * data in order to desribe some particular C types.

 * data in order to describe some particular C types.

 *

 * type_id:

 * ~~~~~~~
@@ -1143,7 +1143,7 @@ static void *btf_show_obj_safe(struct btf_show *show, 


	/*

	 * We need a new copy to our safe object, either because we haven't

	 * yet copied and are intializing safe data, or because the data

	 * yet copied and are initializing safe data, or because the data

	 * we want falls outside the boundaries of the safe object.

	 */

	if (!safe) {
@@ -3417,7 +3417,7 @@ static struct btf_kind_operations func_proto_ops = { 
	 * BTF_KIND_FUNC_PROTO cannot be directly referred by

	 * a struct's member.

	 *

	 * It should be a funciton pointer instead.

	 * It should be a function pointer instead.

	 * (i.e. struct's member -> BTF_KIND_PTR -> BTF_KIND_FUNC_PROTO)

	 *

	 * Hence, there is no btf_func_check_member().

kernel/bpf/devmap.c

+2 −2
Original line number Diff line number Diff line
@@ -382,8 +382,8 @@ void __dev_flush(void) 
}



/* rcu_read_lock (from syscall and BPF contexts) ensures that if a delete and/or

 * update happens in parallel here a dev_put wont happen until after reading the

 * ifindex.

 * update happens in parallel here a dev_put won't happen until after reading

 * the ifindex.

 */

static void *__dev_map_lookup_elem(struct bpf_map *map, u32 key)

{

kernel/bpf/hashtab.c

+2 −2
Original line number Diff line number Diff line
@@ -46,12 +46,12 @@ 
 * events, kprobes and tracing to be invoked before the prior invocation

 * from one of these contexts completed. sys_bpf() uses the same mechanism

 * by pinning the task to the current CPU and incrementing the recursion

 * protection accross the map operation.

 * protection across the map operation.

 *

 * This has subtle implications on PREEMPT_RT. PREEMPT_RT forbids certain

 * operations like memory allocations (even with GFP_ATOMIC) from atomic

 * contexts. This is required because even with GFP_ATOMIC the memory

 * allocator calls into code pathes which acquire locks with long held lock

 * allocator calls into code paths which acquire locks with long held lock

 * sections. To ensure the deterministic behaviour these locks are regular

 * spinlocks, which are converted to 'sleepable' spinlocks on RT. The only

 * true atomic contexts on an RT kernel are the low level hardware