Commit b9327242 authored by Steven Cole's avatar Steven Cole Committed by Paul Mackerras

[PATCH] 2.5.61 fix spelling of necessary in 11 files

This fixes the spelling of "necessary" in 11 files, plus these other
fixes which were nearby:

 divisable -> divisible
 feild -> field
 effectivly -> effectively
 belive -> believe
parent 8ee2c1f0
...@@ -109,7 +109,7 @@ ddb_set_pdar(u32 pdar, u32 phys, u32 size, int width, ...@@ -109,7 +109,7 @@ ddb_set_pdar(u32 pdar, u32 phys, u32 size, int width,
* When programming a PDAR, the register should be read immediately * When programming a PDAR, the register should be read immediately
* after writing it. This ensures that address decoders are properly * after writing it. This ensures that address decoders are properly
* configured. * configured.
* [jsun] is this really necesary? * [jsun] is this really necessary?
*/ */
ddb_in32(pdar); ddb_in32(pdar);
ddb_in32(pdar + 4); ddb_in32(pdar + 4);
......
...@@ -336,7 +336,7 @@ DECLARE_WORK(fd1772_tq, (void *)fd1772_checkint, NULL); ...@@ -336,7 +336,7 @@ DECLARE_WORK(fd1772_tq, (void *)fd1772_checkint, NULL);
*/ */
static int Probing = 0; static int Probing = 0;
/* This flag is set when a dummy seek is necesary to make the WP /* This flag is set when a dummy seek is necessary to make the WP
* status bit accessible. * status bit accessible.
*/ */
static int NeedSeek = 0; static int NeedSeek = 0;
......
...@@ -176,7 +176,7 @@ Amd7930_new_ph(struct IsdnCardState *cs) ...@@ -176,7 +176,7 @@ Amd7930_new_ph(struct IsdnCardState *cs)
cs->dc.amd7930.old_state = cs->dc.amd7930.ph_state; cs->dc.amd7930.old_state = cs->dc.amd7930.ph_state;
/* abort transmit if nessesary */ /* abort transmit if necessary */
if ((message & 0xf0) && (cs->tx_skb)) { if ((message & 0xf0) && (cs->tx_skb)) {
wByteAMD(cs, 0x21, 0xC2); wByteAMD(cs, 0x21, 0xC2);
wByteAMD(cs, 0x21, 0x02); wByteAMD(cs, 0x21, 0x02);
......
...@@ -754,7 +754,7 @@ static int flash_write(struct mtd_info *mtd, loff_t start, size_t len, ...@@ -754,7 +754,7 @@ static int flash_write(struct mtd_info *mtd, loff_t start, size_t len,
size_t *retlen, const u_char *buf) size_t *retlen, const u_char *buf)
{ {
/* Does IO to the currently selected chip. It takes the bank addressing /* Does IO to the currently selected chip. It takes the bank addressing
base (which is divisable by the chip size) adds the necesary lower bits base (which is divisible by the chip size) adds the necessary lower bits
of addrshift (interleve index) and then adds the control register index. */ of addrshift (interleve index) and then adds the control register index. */
#define flread(x) map->read8(map,base+(off&((1<<chip->addrshift)-1))+((x)<<chip->addrshift)) #define flread(x) map->read8(map,base+(off&((1<<chip->addrshift)-1))+((x)<<chip->addrshift))
#define flwrite(v,x) map->write8(map,v,base+(off&((1<<chip->addrshift)-1))+((x)<<chip->addrshift)) #define flwrite(v,x) map->write8(map,v,base+(off&((1<<chip->addrshift)-1))+((x)<<chip->addrshift))
......
...@@ -54,7 +54,7 @@ ...@@ -54,7 +54,7 @@
* allocation/registration for linux-2.3.22+. * allocation/registration for linux-2.3.22+.
* - Adopted David Brownell's <david-b@pacbell.net> technique for * - Adopted David Brownell's <david-b@pacbell.net> technique for
* assigning bulk endpoints. * assigning bulk endpoints.
* - Removed unnessesary #include's * - Removed unnecessary #include's
* - Scanner model now reported via syslog INFO after being detected * - Scanner model now reported via syslog INFO after being detected
* *and* configured. * *and* configured.
* - Added user specified vendor:product USB ID's which can be passed * - Added user specified vendor:product USB ID's which can be passed
......
...@@ -56,9 +56,9 @@ ...@@ -56,9 +56,9 @@
/* Note: /* Note:
* *
* The book states 2 confusing things about befs b+trees. First, * The book states 2 confusing things about befs b+trees. First,
* it states that the overflow feild of node headers is used by internal nodes * it states that the overflow field of node headers is used by internal nodes
* to point to another node that "effectivly continues this one". Here is what * to point to another node that "effectively continues this one". Here is what
* I belive that means. Each key in internal nodes points to another node that * I believe that means. Each key in internal nodes points to another node that
* contains key values less than itself. Inspection reveals that the last key * contains key values less than itself. Inspection reveals that the last key
* in the internal node is not the last key in the index. Keys that are * in the internal node is not the last key in the index. Keys that are
* greater than the last key in the internal node go into the overflow node. * greater than the last key in the internal node go into the overflow node.
...@@ -124,7 +124,7 @@ static int befs_compare_strings(const void *key1, int keylen1, ...@@ -124,7 +124,7 @@ static int befs_compare_strings(const void *key1, int keylen1,
* @sup: Buffer in which to place the btree superblock * @sup: Buffer in which to place the btree superblock
* *
* Calls befs_read_datastream to read in the btree superblock and * Calls befs_read_datastream to read in the btree superblock and
* makes sure it is in cpu byteorder, byteswapping if nessisary. * makes sure it is in cpu byteorder, byteswapping if necessary.
* *
* On success, returns BEFS_OK and *@sup contains the btree superblock, * On success, returns BEFS_OK and *@sup contains the btree superblock,
* in cpu byte order. * in cpu byte order.
...@@ -179,8 +179,8 @@ befs_bt_read_super(struct super_block *sb, befs_data_stream * ds, ...@@ -179,8 +179,8 @@ befs_bt_read_super(struct super_block *sb, befs_data_stream * ds,
* @node_off: Starting offset (in bytes) of the node in @ds * @node_off: Starting offset (in bytes) of the node in @ds
* *
* Calls befs_read_datastream to read in the indicated btree node and * Calls befs_read_datastream to read in the indicated btree node and
* makes sure its header feilds are in cpu byteorder, byteswapping if * makes sure its header fields are in cpu byteorder, byteswapping if
* nessisary. * necessary.
* Note: node->bh must be NULL when this function called first * Note: node->bh must be NULL when this function called first
* time. Don't forget brelse(node->bh) after last call. * time. Don't forget brelse(node->bh) after last call.
* *
......
...@@ -229,7 +229,7 @@ befs_count_blocks(struct super_block * sb, befs_data_stream * ds) ...@@ -229,7 +229,7 @@ befs_count_blocks(struct super_block * sb, befs_data_stream * ds)
Algorithm: Algorithm:
Linear search. Checks each element of array[] to see if it Linear search. Checks each element of array[] to see if it
contains the blockno-th filesystem block. This is nessisary contains the blockno-th filesystem block. This is necessary
because the block runs map variable amounts of data. Simply because the block runs map variable amounts of data. Simply
keeps a count of the number of blocks searched so far (sum), keeps a count of the number of blocks searched so far (sum),
incrementing this by the length of each block run as we come incrementing this by the length of each block run as we come
......
...@@ -454,7 +454,7 @@ void ipgre_err(struct sk_buff *skb, u32 info) ...@@ -454,7 +454,7 @@ void ipgre_err(struct sk_buff *skb, u32 info)
/* Impossible event. */ /* Impossible event. */
return; return;
case ICMP_FRAG_NEEDED: case ICMP_FRAG_NEEDED:
/* And it is the only really necesary thing :-) */ /* And it is the only really necessary thing :-) */
rel_info = ntohs(skb->h.icmph->un.frag.mtu); rel_info = ntohs(skb->h.icmph->un.frag.mtu);
if (rel_info < grehlen+68) if (rel_info < grehlen+68)
return; return;
......
...@@ -383,7 +383,7 @@ void ipip_err(struct sk_buff *skb, u32 info) ...@@ -383,7 +383,7 @@ void ipip_err(struct sk_buff *skb, u32 info)
/* Impossible event. */ /* Impossible event. */
return; return;
case ICMP_FRAG_NEEDED: case ICMP_FRAG_NEEDED:
/* And it is the only really necesary thing :-) */ /* And it is the only really necessary thing :-) */
rel_info = ntohs(skb->h.icmph->un.frag.mtu); rel_info = ntohs(skb->h.icmph->un.frag.mtu);
if (rel_info < hlen+68) if (rel_info < hlen+68)
return; return;
......
...@@ -797,7 +797,7 @@ cbq_update(struct cbq_sched_data *q) ...@@ -797,7 +797,7 @@ cbq_update(struct cbq_sched_data *q)
That is not all. That is not all.
To maintain the rate allocated to the class, To maintain the rate allocated to the class,
we add to undertime virtual clock, we add to undertime virtual clock,
necesary to complete transmitted packet. necessary to complete transmitted packet.
(len/phys_bandwidth has been already passed (len/phys_bandwidth has been already passed
to the moment of cbq_update) to the moment of cbq_update)
*/ */
......
...@@ -1543,7 +1543,7 @@ int cs46xx_dsp_enable_spdif_out (cs46xx_t *chip) ...@@ -1543,7 +1543,7 @@ int cs46xx_dsp_enable_spdif_out (cs46xx_t *chip)
/* dont touch anything if SPDIF is open */ /* dont touch anything if SPDIF is open */
if ( ins->spdif_status_out & DSP_SPDIF_STATUS_PLAYBACK_OPEN) { if ( ins->spdif_status_out & DSP_SPDIF_STATUS_PLAYBACK_OPEN) {
/* when cs46xx_iec958_post_close(...) is called it /* when cs46xx_iec958_post_close(...) is called it
will call this function if necesary depending on will call this function if necessary depending on
this bit */ this bit */
ins->spdif_status_out |= DSP_SPDIF_STATUS_OUTPUT_ENABLED; ins->spdif_status_out |= DSP_SPDIF_STATUS_OUTPUT_ENABLED;
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment