m                  56 fs.c             int b, bi, m;
m                  63 fs.c                 m = 1 << (bi % 8);
m                  64 fs.c                 if((bp->data[bi/8] & m) == 0){  // Is block free?
m                  65 fs.c                   bp->data[bi/8] |= m;  // Mark block in use.
m                  82 fs.c             int bi, m;
m                  87 fs.c             m = 1 << (bi % 8);
m                  88 fs.c             if((bp->data[bi/8] & m) == 0)
m                  90 fs.c             bp->data[bi/8] &= ~m;
m                 437 fs.c             uint tot, m;
m                 451 fs.c             for(tot=0; tot<n; tot+=m, off+=m, dst+=m){
m                 453 fs.c               m = min(n - tot, BSIZE - off%BSIZE);
m                 454 fs.c               memmove(dst, bp->data + off%BSIZE, m);
m                 465 fs.c             uint tot, m;
m                 479 fs.c             for(tot=0; tot<n; tot+=m, off+=m, src+=m){
m                 481 fs.c               m = min(n - tot, BSIZE - off%BSIZE);
m                 482 fs.c               memmove(bp->data + off%BSIZE, src, m);
m                  13 grep.c           int n, m;
m                  16 grep.c           m = 0;
m                  17 grep.c           while((n = read(fd, buf+m, sizeof(buf)-m-1)) > 0){
m                  18 grep.c             m += n;
m                  19 grep.c             buf[m] = '\0';
m                  30 grep.c               m = 0;
m                  31 grep.c             if(m > 0){
m                  32 grep.c               m -= p - buf;
m                  33 grep.c               memmove(buf, p, m);