d/freebsd-skq
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

sys/geom: spelling fixes in comments.

Browse Source 
No functional change.
This commit is contained in:
Pedro F. Giffuni 2016-04-29 20:56:58 +00:00
parent ad29e12e0c
commit e8d5712284
18 changed files with 26 additions and 26 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
sys/geom/bde/g_bde_lock.c
View File

@ -289,7 +289,7 @@ g_bde_decode_lock(struct g_bde_softc *sc, struct g_bde_key *gl, u_char *ptr)
* Security objectives: Encode/Decode the metadata encrypted by key-material.
*
* A simple AES/128/CBC will do. We take care to always store the metadata
* in the same endianess to make it MI.
* in the same endianness to make it MI.
*
* In the typical case the metadata is stored in encrypted format in sector
* zero on the media, but at the users discretion or if the piece of the

2
sys/geom/geom_bsd_enc.c
View File

@ -35,7 +35,7 @@
/*
* Functions to encode and decode struct disklabel and struct partition into
* a bytestream of little endianess and correct packing.
* a bytestream of little endianness and correct packing.
*
* NB! This file must be usable both in kernel and userland.
*/

4
sys/geom/geom_ccd.c
View File

@ -271,7 +271,7 @@ ccdinit(struct gctl_req *req, struct ccd_s *cs)
/*
* If uniform interleave is desired set all sizes to that of
* the smallest component. This will guarentee that a single
* the smallest component. This will guarantee that a single
* interleave table is generated.
*
* Lost space must be taken into account when calculating the
@ -291,7 +291,7 @@ ccdinit(struct gctl_req *req, struct ccd_s *cs)
* Check to see if an even number of components
* have been specified. The interleave must also
* be non-zero in order for us to be able to
* guarentee the topology.
* guarantee the topology.
*/
if (cs->sc_ndisks % 2) {
gctl_error(req,

6
sys/geom/geom_dev.c
View File

@ -630,8 +630,8 @@ g_dev_strategy(struct bio *bp)
for (;;) {
/*
* XXX: This is not an ideal solution, but I belive it to
* XXX: deadlock safe, all things considered.
* XXX: This is not an ideal solution, but I believe it to
* XXX: deadlock safely, all things considered.
*/
bp2 = g_clone_bio(bp);
if (bp2 != NULL)
@ -686,7 +686,7 @@ g_dev_callback(void *arg)
* - Clear any dump settings.
* - Request asynchronous device destruction to prevent any more requests
* from coming in. The provider is already marked with an error, so
* anything which comes in in the interrim will be returned immediately.
* anything which comes in the interim will be returned immediately.
*/
static void

2
sys/geom/geom_disk.c
View File

@ -107,7 +107,7 @@ g_disk_access(struct g_provider *pp, int r, int w, int e)
if (sc == NULL || (dp = sc->dp) == NULL || dp->d_destroyed) {
/*
* Allow decreasing access count even if disk is not
* avaliable anymore.
* available anymore.
*/
if (r <= 0 && w <= 0 && e <= 0)
return (0);

2
sys/geom/geom_kern.c
View File

@ -76,7 +76,7 @@ int g_notaste;
* part of I/O prioritization by deciding which bios/bioqs to service
* in what order.
*
* We have only one thread in each direction, it is belived that until
* We have only one thread in each direction, it is believed that until
* a very non-trivial workload in the UP/DOWN path this will be enough,
* but more than one can actually be run without problems.
*

2
sys/geom/geom_mbr_enc.c
View File

@ -25,7 +25,7 @@
*/
/* Functions to encode or decode struct dos_partition into a bytestream
* of correct endianess and packing. These functions do no validation
* of correct endianness and packing. These functions do no validation
* or sanity checking, they only pack/unpack the fields correctly.
*
* NB! This file must be usable both in kernel and userland.

2
sys/geom/geom_sunlabel_enc.c
View File

@ -26,7 +26,7 @@
* SUCH DAMAGE.
*/
/* Functions to encode or decode struct sun_disklabel into a bytestream
* of correct endianess and packing.
* of correct endianness and packing.
*
* NB! This file must be usable both in kernel and userland.
*/

6
sys/geom/journal/g_journal.c
View File

@ -520,7 +520,7 @@ g_journal_write_header(struct g_journal_softc *sc)
/*
* Every journal record has a header and data following it.
* Functions below are used to decode the header before storing it to
* little endian and to encode it after reading to system endianess.
* little endian and to encode it after reading to system endianness.
*/
static void
g_journal_record_header_encode(struct g_journal_record_header *hdr,
@ -581,7 +581,7 @@ g_journal_record_header_decode(const u_char *data,
/*
* Function reads metadata from a provider (via the given consumer), decodes
* it to system endianess and verifies its correctness.
* it to system endianness and verifies its correctness.
*/
static int
g_journal_metadata_read(struct g_consumer *cp, struct g_journal_metadata *md)
@ -1846,7 +1846,7 @@ g_journal_sync(struct g_journal_softc *sc)
for (;;) {
/*
* If the biggest record won't fit, look for a record header or
* journal header from the begining.
* journal header from the beginning.
*/
GJ_VALIDATE_OFFSET(offset, sc);
error = g_journal_sync_read(cp, bp, offset, buf);

4
sys/geom/mirror/g_mirror.c
View File

@ -1048,7 +1048,7 @@ g_mirror_kernel_dump(struct bio *bp)
/*
* We configure dumping to the first component, because this component
* will be used for reading with 'prefer' balance algorithm.
* If the component with the higest priority is currently disconnected
* If the component with the highest priority is currently disconnected
* we will not be able to read the dump after the reboot if it will be
* connected and synchronized later. Can we do something better?
*/
@ -1277,7 +1277,7 @@ g_mirror_sync_release(struct g_mirror_softc *sc)
* Handle synchronization requests.
* Every synchronization request is two-steps process: first, READ request is
* send to active provider and then WRITE request (with read data) to the provider
* beeing synchronized. When WRITE is finished, new synchronization request is
* being synchronized. When WRITE is finished, new synchronization request is
* send.
*/
static void

2
sys/geom/part/g_part_bsd64.c
View File

@ -58,7 +58,7 @@ FEATURE(geom_part_bsd64, "GEOM partitioning class for 64-bit BSD disklabels");
struct disklabel64 {
char d_reserved0[512]; /* reserved or unused */
u_int32_t d_magic; /* the magic number */
u_int32_t d_crc; /* crc32() d_magic thru last part */
u_int32_t d_crc; /* crc32() d_magic through last part */
u_int32_t d_align; /* partition alignment requirement */
u_int32_t d_npartitions; /* number of partitions */
struct uuid d_stor_uuid; /* unique uuid for label */

2
sys/geom/part/g_part_if.m
View File

@ -201,7 +201,7 @@ METHOD int setunset {
};
# type() - return a string representation of the partition type.
# Preferrably, the alias names.
# Preferably, the alias names.
METHOD const char * type {
struct g_part_table *table;
struct g_part_entry *entry;

2
sys/geom/part/g_part_ldm.c
View File

@ -1220,7 +1220,7 @@ ldm_gpt_probe(struct g_part_table *basetable, struct g_consumer *cp)
int error;
/*
* XXX: We use some knowlege about GEOM_PART_GPT internal
* XXX: We use some knowledge about GEOM_PART_GPT internal
* structures, but it is easier than parse GPT by himself.
*/
g_topology_lock();

6
sys/geom/raid/tr_raid1.c
View File

@ -840,8 +840,8 @@ g_raid_tr_iodone_raid1(struct g_raid_tr_object *tr,
* disk, remapping the bad sector. Do we need to do that by
* queueing a request to the main worker thread? It doesn't
* affect the return code of this current read, and can be
* done at our liesure. However, to make the code simpler, it
* is done syncrhonously.
* done at our leisure. However, to make the code simpler, it
* is done synchronously.
*/
G_RAID_LOGREQ(3, bp, "Recovered data from other drive");
cbp = g_clone_bio(pbp);
@ -858,7 +858,7 @@ g_raid_tr_iodone_raid1(struct g_raid_tr_object *tr,
if (pbp->bio_pflags & G_RAID_BIO_FLAG_LOCKED) {
/*
* We're done with a recovery, mark the range as unlocked.
* For any write errors, we agressively fail the disk since
* For any write errors, we aggressively fail the disk since
* there was both a READ and a WRITE error at this location.
* Both types of errors generally indicates the drive is on
* the verge of total failure anyway. Better to stop trusting

2
sys/geom/raid/tr_raid1e.c
View File

@ -1096,7 +1096,7 @@ g_raid_tr_iodone_raid1e(struct g_raid_tr_object *tr,
if ((mask & (1U << 31)) != 0) {
/*
* We're done with a recovery, mark the range as unlocked.
* For any write errors, we agressively fail the disk since
* For any write errors, we aggressively fail the disk since
* there was both a READ and a WRITE error at this location.
* Both types of errors generally indicates the drive is on
* the verge of total failure anyway. Better to stop trusting

2
sys/geom/raid3/g_raid3.c
View File

@ -1587,7 +1587,7 @@ g_raid3_sync_release(struct g_raid3_softc *sc)
* Handle synchronization requests.
* Every synchronization request is two-steps process: first, READ request is
* send to active provider and then WRITE request (with read data) to the provider
* beeing synchronized. When WRITE is finished, new synchronization request is
* being synchronized. When WRITE is finished, new synchronization request is
* send.
*/
static void

2
sys/geom/vinum/geom_vinum_drive.c
View File

@ -76,7 +76,7 @@ gv_legacy_header_type(uint8_t *hdr, int bigendian)
uint32_t *i32;
int arch_32, arch_64, i;
/* Set arch according to endianess. */
/* Set arch according to endianness. */
if (bigendian) {
arch_32 = GV_LEGACY_POWERPC;
arch_64 = GV_LEGACY_SPARC64;

2
sys/geom/vinum/geom_vinum_subr.c
View File

@ -72,7 +72,7 @@ gv_parse_config(struct gv_softc *sc, char *buf, struct gv_drive *d)
bptr = aptr;
cptr = aptr;
/* Seperate input lines. */
/* Separate input lines. */
while (*bptr != '\n')
bptr++;
*bptr = '\0';