summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorRichard Braun <rbraun@sceen.net>2012-12-01 15:44:45 +0100
committerRichard Braun <rbraun@sceen.net>2012-12-01 15:44:45 +0100
commita10641a7e6f8ec5d67c76027b4296bb13194a9ed (patch)
treee76cf23dbe44e41722646eb5c8b553ad7047cabc
parentaafcc9b4959748f2ef78d793cba2710c64f0bece (diff)
Normalize the spelling of CPU in comments
-rw-r--r--arch/x86/machine/cpu.h2
-rw-r--r--kern/kmem.c2
-rw-r--r--kern/kmem.h2
-rw-r--r--vm/vm_phys.c2
4 files changed, 4 insertions, 4 deletions
diff --git a/arch/x86/machine/cpu.h b/arch/x86/machine/cpu.h
index 3b93ed6..9b23183 100644
--- a/arch/x86/machine/cpu.h
+++ b/arch/x86/machine/cpu.h
@@ -148,7 +148,7 @@ struct cpu_seg_desc {
#define CPU_STATE_ON 1
/*
- * The fs segment register is used to store the address of the per-cpu data.
+ * The fs segment register is used to store the address of the per-CPU data.
* As a result, they must be at least 16-bytes aligned.
*/
#define CPU_ALIGN (MAX(16, CPU_L1_SIZE))
diff --git a/kern/kmem.c b/kern/kmem.c
index c8c5557..568ab7e 100644
--- a/kern/kmem.c
+++ b/kern/kmem.c
@@ -40,7 +40,7 @@
* requests, avoiding many accesses to the slab layer, it is considered an
* acceptable tradeoff.
*
- * This implementation uses per-cpu pools of objects, which service most
+ * This implementation uses per-CPU pools of objects, which service most
* allocation requests. These pools act as caches (but are named differently
* to avoid confusion with CPU caches) that reduce contention on multiprocessor
* systems. When a pool is empty and cannot provide an object, it is filled by
diff --git a/kern/kmem.h b/kern/kmem.h
index 98306fa..025afb2 100644
--- a/kern/kmem.h
+++ b/kern/kmem.h
@@ -234,7 +234,7 @@ struct kmem_cache {
/*
* Cache creation flags.
*/
-#define KMEM_CACHE_NOCPUPOOL 0x1 /* Don't use the per-cpu pools */
+#define KMEM_CACHE_NOCPUPOOL 0x1 /* Don't use the per-CPU pools */
#define KMEM_CACHE_NOOFFSLAB 0x2 /* Don't allocate external slab data */
#define KMEM_CACHE_VERIFY 0x4 /* Use debugging facilities */
diff --git a/vm/vm_phys.c b/vm/vm_phys.c
index 64a3cb6..14abf90 100644
--- a/vm/vm_phys.c
+++ b/vm/vm_phys.c
@@ -21,7 +21,7 @@
* - "Dynamic Storage Allocation: A Survey and Critical Review",
* by Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles.
*
- * In addition, this allocator uses per-cpu pools of pages for order 0
+ * In addition, this allocator uses per-CPU pools of pages for order 0
* (i.e. single page) allocations. These pools act as caches (but are named
* differently to avoid confusion with CPU caches) that reduce contention on
* multiprocessor systems. When a pool is empty and cannot provide a page,