patch-1.3.96 linux/drivers/block/amiflop.c

• Lines: 27
• Date: Fri Apr 26 12:12:25 1996
• Orig file: v1.3.95/linux/drivers/block/amiflop.c
• Orig date: Tue Apr 23 13:57:08 1996

diff -u --recursive --new-file v1.3.95/linux/drivers/block/amiflop.c linux/drivers/block/amiflop.c
@@ -677,7 +677,7 @@
                            but this compiler solves it  by adding silently 
                            adding a pad byte so data wont fit
                            and this cost about 3h to discover.... */
-unsigned char gap1[22];     /* for longword-aligndness (0x4e) */
+unsigned char gap1[22];     /* for longword-alignedness (0x4e) */
 };
 
 /* crc routines are borrowed from the messydos-handler  */
@@ -702,7 +702,7 @@
 ; How CRCs "really" work:
 ;
 ; First, you should regard a bitstring as a series of coefficients of
-; polymomials. We calculate with these polynomials in modulo-2
+; polynomials. We calculate with these polynomials in modulo-2
 ; arithmetic, in which both add and subtract are done the same as
 ; exclusive-or. Now, we modify our data (a very long polynomial) in
 ; such a way that it becomes divisible by the CCITT-standard 16-bit
@@ -1637,7 +1637,7 @@
   unit[drive].blocks=unit[drive].type->heads*unit[drive].type->tracks*
         unit[drive].sects;
 
-printk("fd%d: accesing %s-disk with %s-layout\n",drive,unit[drive].type->name,
+printk("fd%d: accessing %s-disk with %s-layout\n",drive,unit[drive].type->name,
   data_types[system].name);
 
   return 0;