diff -urN mtd-utils-1.2.0-clean/fec.c mtd-utils-1.2.0/fec.c
--- mtd-utils-1.2.0-clean/fec.c	2008-06-27 17:21:28.000000000 +0100
+++ mtd-utils-1.2.0/fec.c	2009-03-23 17:13:49.418875355 +0000
@@ -433,7 +433,7 @@
     gf *id_row = NEW_GF_MATRIX(1, k);
     gf *temp_row = NEW_GF_MATRIX(1, k);
 
-    bzero(id_row, k*sizeof(gf));
+    memset(id_row, '\0', k*sizeof(gf));
     DEB( pivloops=0; pivswaps=0 ; /* diagnostic */ )
     /*
      * ipiv marks elements already used as pivots.
@@ -513,7 +513,7 @@
 	 * we can optimize the addmul).
 	 */
 	id_row[icol] = 1;
-	if (bcmp(pivot_row, id_row, k*sizeof(gf)) != 0) {
+	if (memcmp(pivot_row, id_row, k*sizeof(gf)) != 0) {
 	    for (p = src, ix = 0 ; ix < k ; ix++, p += k ) {
 		if (ix != icol) {
 		    c = p[icol] ;
@@ -704,7 +704,7 @@
     /*
      * the upper matrix is I so do not bother with a slow multiply
      */
-    bzero(retval->enc_matrix, k*k*sizeof(gf) );
+    memset(retval->enc_matrix, '\0',  k*k*sizeof(gf));
     for (p = retval->enc_matrix, col = 0 ; col < k ; col++, p += k+1 )
 	*p = 1 ;
     free(tmp_m);
@@ -731,10 +731,10 @@
 	sz /= 2 ;
 
     if (index < k)
-         bcopy(src[index], fec, sz*sizeof(gf) ) ;
+         memcpy(fec, src[index],  sz*sizeof(gf));
     else if (index < code->n) {
 	p = &(code->enc_matrix[index*k] );
-	bzero(fec, sz*sizeof(gf));
+    memset(fec, '\0', sz*sizeof(gf));
 	for (i = 0; i < k ; i++)
 	    addmul(fec, src[i], p[i], sz ) ;
     } else
@@ -751,10 +751,10 @@
 	sz /= 2 ;
 
     if (index < k)
-	    bcopy(src + (index * sz), fec, sz*sizeof(gf) ) ;
+        memcpy( fec, src + (index * sz), sz*sizeof(gf));
     else if (index < code->n) {
 	p = &(code->enc_matrix[index*k] );
-	bzero(fec, sz*sizeof(gf));
+    memset(fec, '\0', sz*sizeof(gf));
 	for (i = 0; i < k ; i++)
 	    addmul(fec, src + (i * sz), p[i], sz ) ;
     } else
@@ -814,12 +814,12 @@
     for (i = 0, p = matrix ; i < k ; i++, p += k ) {
 #if 1 /* this is simply an optimization, not very useful indeed */
 	if (index[i] < k) {
-	    bzero(p, k*sizeof(gf) );
+        memset(p, '\0', k*sizeof(gf));
 	    p[i] = 1 ;
 	} else
 #endif
 	if (index[i] < code->n )
-	    bcopy( &(code->enc_matrix[index[i]*k]), p, k*sizeof(gf) ); 
+        memcpy(p, &(code->enc_matrix[index[i]*k]), k*sizeof(gf));
 	else {
 	    fprintf(stderr, "decode: invalid index %d (max %d)\n",
 		index[i], code->n - 1 );
@@ -870,7 +870,7 @@
     for (row = 0 ; row < k ; row++ ) {
 	if (index[row] >= k) {
 	    new_pkt[row] = my_malloc (sz * sizeof (gf), "new pkt buffer" );
-	    bzero(new_pkt[row], sz * sizeof(gf) ) ;
+        memset(new_pkt[row], '\0',  sz * sizeof(gf));
 	    for (col = 0 ; col < k ; col++ )
 		addmul(new_pkt[row], pkt[col], m_dec[row*k + col], sz) ;
 	}
@@ -880,7 +880,7 @@
      */
     for (row = 0 ; row < k ; row++ ) {
 	if (index[row] >= k) {
-	    bcopy(new_pkt[row], pkt[row], sz*sizeof(gf));
+        memcpy(pkt[row], new_pkt[row], sz*sizeof(gf));
 	    free(new_pkt[row]);
 	}
     }
diff -urN mtd-utils-1.2.0-clean/jffs2reader.c mtd-utils-1.2.0/jffs2reader.c
--- mtd-utils-1.2.0-clean/jffs2reader.c	2008-06-27 17:21:28.000000000 +0100
+++ mtd-utils-1.2.0/jffs2reader.c	2009-03-23 16:59:44.996814624 +0000
@@ -87,7 +87,6 @@
 #define MINOR(dev) ((dev)&0xff)
 #endif
 
-
 #define DIRENT_INO(dirent) ((dirent)!=NULL?(dirent)->ino:0)
 #define DIRENT_PINO(dirent) ((dirent)!=NULL?(dirent)->pino:0)
 
@@ -142,7 +141,7 @@
 	}
 
 	if (*rsize < n->isize)
-		bzero(b + *rsize, n->isize - *rsize);
+		memset(b + *rsize, '\0', n->isize - *rsize);
 
 	switch (n->compr) {
 		case JFFS2_COMPR_ZLIB:
@@ -157,7 +156,7 @@
 			break;
 
 		case JFFS2_COMPR_ZERO:
-			bzero(b + n->offset, dlen);
+			memset(b + n->offset, '\0', dlen);
 			break;
 
 			/* [DYN]RUBIN support required! */
