Various typo fixes.

Correct mis-spellings of "algorithm", "appear", "consistent" and
(shame, shame) "kernel".

Signed-off-by: Robert P. J. Day <rpjday@mindspring.com>
Signed-off-by: Adrian Bunk <bunk@stusta.de>
This commit is contained in:
Robert P. J. Day 2007-02-17 19:07:33 +01:00 committed by Adrian Bunk
parent 6340aa61b1
commit d08df601a3
12 changed files with 16 additions and 16 deletions

View file

@ -57,7 +57,7 @@ bttv.o
i2c_udelay= Allow reduce I2C speed. Default is 5 usecs i2c_udelay= Allow reduce I2C speed. Default is 5 usecs
(meaning 66,67 Kbps). The default is the (meaning 66,67 Kbps). The default is the
maximum supported speed by kernel bitbang maximum supported speed by kernel bitbang
algoritm. You may use lower numbers, if I2C algorithm. You may use lower numbers, if I2C
messages are lost (16 is known to work on messages are lost (16 is known to work on
all supported cards). all supported cards).

View file

@ -293,7 +293,7 @@ long strnlen_user(const char __user *s, long n)
: "0" (n), "1" (s), "r" (n & 3), "r" (mask), "r"(0x01010101) : "0" (n), "1" (s), "r" (n & 3), "r" (mask), "r"(0x01010101)
: "r0", "r1", "cbit"); : "r0", "r1", "cbit");
/* NOTE: strnlen_user() algorism: /* NOTE: strnlen_user() algorithm:
* { * {
* char *p; * char *p;
* for (p = s; n-- && *p != '\0'; ++p) * for (p = s; n-- && *p != '\0'; ++p)
@ -369,7 +369,7 @@ long strnlen_user(const char __user *s, long n)
: "0" (n), "1" (s), "r" (n & 3), "r" (mask), "r"(0x01010101) : "0" (n), "1" (s), "r" (n & 3), "r" (mask), "r"(0x01010101)
: "r0", "r1", "r2", "r3", "cbit"); : "r0", "r1", "r2", "r3", "cbit");
/* NOTE: strnlen_user() algorism: /* NOTE: strnlen_user() algorithm:
* { * {
* char *p; * char *p;
* for (p = s; n-- && *p != '\0'; ++p) * for (p = s; n-- && *p != '\0'; ++p)

View file

@ -104,7 +104,7 @@ unsigned long coldfire_timer_offset(void)
/* /*
* Choose a reasonably fast profile timer. Make it an odd value to * Choose a reasonably fast profile timer. Make it an odd value to
* try and get good coverage of kernal operations. * try and get good coverage of kernel operations.
*/ */
#define PROFILEHZ 1013 #define PROFILEHZ 1013

View file

@ -1534,7 +1534,7 @@ static int ipath_ht_early_init(struct ipath_devdata *dd)
* @kbase: ipath_base_info pointer * @kbase: ipath_base_info pointer
* *
* We set the PCIE flag because the lower bandwidth on PCIe vs * We set the PCIE flag because the lower bandwidth on PCIe vs
* HyperTransport can affect some user packet algorithims. * HyperTransport can affect some user packet algorithms.
*/ */
static int ipath_ht_get_base_info(struct ipath_portdata *pd, void *kbase) static int ipath_ht_get_base_info(struct ipath_portdata *pd, void *kbase)
{ {

View file

@ -1293,7 +1293,7 @@ int __attribute__((weak)) ipath_unordered_wc(void)
* @kbase: ipath_base_info pointer * @kbase: ipath_base_info pointer
* *
* We set the PCIE flag because the lower bandwidth on PCIe vs * We set the PCIE flag because the lower bandwidth on PCIe vs
* HyperTransport can affect some user packet algorithims. * HyperTransport can affect some user packet algorithms.
*/ */
static int ipath_pe_get_base_info(struct ipath_portdata *pd, void *kbase) static int ipath_pe_get_base_info(struct ipath_portdata *pd, void *kbase)
{ {

View file

@ -1680,7 +1680,7 @@ static void isdn_ppp_mp_receive(isdn_net_dev * net_dev, isdn_net_local * lp,
* - we hit a gap in the sequence, so no reassembly/processing is * - we hit a gap in the sequence, so no reassembly/processing is
* possible ('start' would be set to NULL) * possible ('start' would be set to NULL)
* *
* algorightm for this code is derived from code in the book * algorithm for this code is derived from code in the book
* 'PPP Design And Debugging' by James Carlson (Addison-Wesley) * 'PPP Design And Debugging' by James Carlson (Addison-Wesley)
*/ */
while (start != NULL || newfrag != NULL) { while (start != NULL || newfrag != NULL) {

View file

@ -3253,7 +3253,7 @@ struct e1000_host_command_info {
#define IFE_PMC_AUTO_MDIX 0x0080 /* 1=enable MDI/MDI-X feature, default 0=disabled */ #define IFE_PMC_AUTO_MDIX 0x0080 /* 1=enable MDI/MDI-X feature, default 0=disabled */
#define IFE_PMC_FORCE_MDIX 0x0040 /* 1=force MDIX-X, 0=force MDI */ #define IFE_PMC_FORCE_MDIX 0x0040 /* 1=force MDIX-X, 0=force MDI */
#define IFE_PMC_MDIX_STATUS 0x0020 /* 1=MDI-X, 0=MDI */ #define IFE_PMC_MDIX_STATUS 0x0020 /* 1=MDI-X, 0=MDI */
#define IFE_PMC_AUTO_MDIX_COMPLETE 0x0010 /* Resolution algorthm is completed */ #define IFE_PMC_AUTO_MDIX_COMPLETE 0x0010 /* Resolution algorithm is completed */
#define IFE_PMC_MDIX_MODE_SHIFT 6 #define IFE_PMC_MDIX_MODE_SHIFT 6
#define IFE_PHC_MDIX_RESET_ALL_MASK 0x0000 /* Disable auto MDI-X */ #define IFE_PHC_MDIX_RESET_ALL_MASK 0x0000 /* Disable auto MDI-X */

View file

@ -1168,7 +1168,7 @@ wv_mmc_show(struct net_device * dev)
m.mmr_unused0[6], m.mmr_unused0[6],
m.mmr_unused0[7]); m.mmr_unused0[7]);
#endif /* DEBUG_SHOW_UNUSED */ #endif /* DEBUG_SHOW_UNUSED */
printk(KERN_DEBUG "Encryption algorythm: %02X - Status: %02X\n", printk(KERN_DEBUG "Encryption algorithm: %02X - Status: %02X\n",
m.mmr_des_avail, m.mmr_des_status); m.mmr_des_avail, m.mmr_des_status);
#ifdef DEBUG_SHOW_UNUSED #ifdef DEBUG_SHOW_UNUSED
printk(KERN_DEBUG "mmc_unused1[]: %02X:%02X:%02X:%02X:%02X\n", printk(KERN_DEBUG "mmc_unused1[]: %02X:%02X:%02X:%02X:%02X\n",
@ -3590,9 +3590,9 @@ wv_82593_config(struct net_device * dev)
cfblk.acloc = TRUE; /* Disable source addr insertion by i82593 */ cfblk.acloc = TRUE; /* Disable source addr insertion by i82593 */
cfblk.preamb_len = 0; /* 2 bytes preamble (SFD) */ cfblk.preamb_len = 0; /* 2 bytes preamble (SFD) */
cfblk.loopback = FALSE; cfblk.loopback = FALSE;
cfblk.lin_prio = 0; /* conform to 802.3 backoff algoritm */ cfblk.lin_prio = 0; /* conform to 802.3 backoff algorithm */
cfblk.exp_prio = 5; /* conform to 802.3 backoff algoritm */ cfblk.exp_prio = 5; /* conform to 802.3 backoff algorithm */
cfblk.bof_met = 1; /* conform to 802.3 backoff algoritm */ cfblk.bof_met = 1; /* conform to 802.3 backoff algorithm */
cfblk.ifrm_spc = 0x20 >> 4; /* 32 bit times interframe spacing */ cfblk.ifrm_spc = 0x20 >> 4; /* 32 bit times interframe spacing */
cfblk.slottim_low = 0x20 >> 5; /* 32 bit times slot time */ cfblk.slottim_low = 0x20 >> 5; /* 32 bit times slot time */
cfblk.slottim_hi = 0x0; cfblk.slottim_hi = 0x0;

View file

@ -14,7 +14,7 @@
/* NOTE: It seems to me that the documentation regarding the /* NOTE: It seems to me that the documentation regarding the
pcd8584t/pcf8584 does not show the correct way to address the i2c bus. pcd8584t/pcf8584 does not show the correct way to address the i2c bus.
Based on the information on the I2C bus itself and the remainder of Based on the information on the I2C bus itself and the remainder of
the Phillips docs the following algorithims apper to be correct. I am the Phillips docs the following algorithms appear to be correct. I am
fairly certain that the flowcharts in the phillips docs are wrong. */ fairly certain that the flowcharts in the phillips docs are wrong. */

View file

@ -2,7 +2,7 @@
#define __LINUX_SEQLOCK_H #define __LINUX_SEQLOCK_H
/* /*
* Reader/writer consistent mechanism without starving writers. This type of * Reader/writer consistent mechanism without starving writers. This type of
* lock for data where the reader wants a consitent set of information * lock for data where the reader wants a consistent set of information
* and is willing to retry if the information changes. Readers never * and is willing to retry if the information changes. Readers never
* block but they may have to retry if a writer is in * block but they may have to retry if a writer is in
* progress. Writers do not wait for readers. * progress. Writers do not wait for readers.

View file

@ -40,7 +40,7 @@
* configuration according to the specified parameters. * configuration according to the specified parameters.
* (3) User starts the search(es) by calling _find() or _next() to * (3) User starts the search(es) by calling _find() or _next() to
* fetch subsequent occurrences. A state variable is provided * fetch subsequent occurrences. A state variable is provided
* to the algorihtm to store persistent variables. * to the algorithm to store persistent variables.
* (4) Core eventually resets the search offset and forwards the find() * (4) Core eventually resets the search offset and forwards the find()
* request to the algorithm. * request to the algorithm.
* (5) Algorithm calls get_next_block() provided by the user continously * (5) Algorithm calls get_next_block() provided by the user continously

View file

@ -29,7 +29,7 @@ static struct tcp_congestion_ops *tcp_ca_find(const char *name)
} }
/* /*
* Attach new congestion control algorthim to the list * Attach new congestion control algorithm to the list
* of available options. * of available options.
*/ */
int tcp_register_congestion_control(struct tcp_congestion_ops *ca) int tcp_register_congestion_control(struct tcp_congestion_ops *ca)