2.5.61 fix spelling of necessary in 11 files
Subsystems (8)
PATCH 1/1 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
Steven
arch/mips/ddb5xxx/common/nile4.c +1 -1
@@ -109,7 +109,7 @@* When programming a PDAR, the register should be read immediately * after writing it. This ensures that address decoders are properly * configured. -* [jsun] is this really necesary? +* [jsun] is this really necessary? */ ddb_in32 (pdar);ddb_in32 (pdar +4 );
drivers/acorn/block/fd1772.c +1 -1
@@ -336,7 +336,7 @@*/ 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. */ static int NeedSeek =0 ;
drivers/isdn/hisax/amd7930_fn.c +1 -1
@@ -176,7 +176,7 @@ cs->dc.amd7930.old_state = cs->dc.amd7930.ph_state; -/* abort transmit if nessesary */ +/* abort transmit if necessary */ if ((message &0xf0 ) && (cs->tx_skb)) {wByteAMD (cs,0x21 ,0xC2 );wByteAMD (cs,0x21 ,0x02 );
drivers/mtd/chips/jedec.c +1 -1
@@ -754,7 +754,7 @@ size_t *retlen, const u_char *buf) {/* 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. */ #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))
drivers/usb/image/scanner.c +1 -1
@@ -54,7 +54,7 @@* allocation/registration for linux-2.3.22+. * - Adopted David Brownell's <[email protected]> technique for * assigning bulk endpoints. -* - Removed unnessesary #include's +* - Removed unnecessary #include's * - Scanner model now reported via syslog INFO after being detected * *and* configured. * - Added user specified vendor:product USB ID's which can be passed
fs/befs/btree.c +6 -6
@@ -56,9 +56,9 @@/* Note: * * 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 -* to point to another node that "effectivly continues this one". Here is what -* I belive that means. Each key in internal nodes points to another node that +* it states that the overflow field of node headers is used by internal nodes +* to point to another node that "effectively continues this one". Here is what +* 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 * 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.
@@ -124,7 +124,7 @@* @sup: Buffer in which to place the btree superblock * * 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, * in cpu byte order.
@@ -179,8 +179,8 @@* @node_off: Starting offset (in bytes) of the node in @ds * * Calls befs_read_datastream to read in the indicated btree node and -* makes sure its header feilds are in cpu byteorder, byteswapping if -* nessisary. +* makes sure its header fields are in cpu byteorder, byteswapping if +* necessary. * Note: node->bh must be NULL when this function called first * time. Don't forget brelse(node->bh) after last call. *
fs/befs/datastream.c +1 -1
@@ -229,7 +229,7 @@ Algorithm: 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 keeps a count of the number of blocks searched so far (sum), incrementing this by the length of each block run as we come
net/ipv4/ip_gre.c +1 -1
@@ -454,7 +454,7 @@/* Impossible event. */ return ;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);if (rel_info < grehlen+68 )return ;
net/ipv4/ipip.c +1 -1
@@ -383,7 +383,7 @@/* Impossible event. */ return ;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);if (rel_info < hlen+68 )return ;
net/sched/sch_cbq.c +1 -1
@@ -797,7 +797,7 @@That is not all. To maintain the rate allocated to the class, we add to undertime virtual clock, -necesary to complete transmitted packet. +necessary to complete transmitted packet. (len/phys_bandwidth has been already passed to the moment of cbq_update) */
sound/pci/cs46xx/dsp_spos_scb_lib.c +1 -1
@@ -1543,7 +1543,7 @@/* dont touch anything if SPDIF is open */ if ( ins->spdif_status_out &DSP_SPDIF_STATUS_PLAYBACK_OPEN ) {/* 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 */ ins->spdif_status_out |=DSP_SPDIF_STATUS_OUTPUT_ENABLED ;