m                  14 kernel/file.h  #define	mkdev(m,n)  ((uint)((m)<<16| (n)))
m                  68 kernel/fs.c      int b, bi, m;
m                  75 kernel/fs.c          m = 1 << (bi % 8);
m                  76 kernel/fs.c          if((bp->data[bi/8] & m) == 0){  // Is block free?
m                  77 kernel/fs.c            bp->data[bi/8] |= m;  // Mark block in use.
m                  95 kernel/fs.c      int bi, m;
m                  99 kernel/fs.c      m = 1 << (bi % 8);
m                 100 kernel/fs.c      if((bp->data[bi/8] & m) == 0)
m                 102 kernel/fs.c      bp->data[bi/8] &= ~m;
m                 474 kernel/fs.c      uint tot, m;
m                 482 kernel/fs.c      for(tot=0; tot<n; tot+=m, off+=m, dst+=m){
m                 487 kernel/fs.c        m = min(n - tot, BSIZE - off%BSIZE);
m                 488 kernel/fs.c        if(either_copyout(user_dst, dst, bp->data + (off % BSIZE), m) == -1) {
m                 508 kernel/fs.c      uint tot, m;
m                 516 kernel/fs.c      for(tot=0; tot<n; tot+=m, off+=m, src+=m){
m                 521 kernel/fs.c        m = min(n - tot, BSIZE - off%BSIZE);
m                 522 kernel/fs.c        if(either_copyin(bp->data + (off % BSIZE), user_src, src, m) == -1) {
m                  14 user/grep.c      int n, m;
m                  17 user/grep.c      m = 0;
m                  18 user/grep.c      while((n = read(fd, buf+m, sizeof(buf)-m-1)) > 0){
m                  19 user/grep.c        m += n;
m                  20 user/grep.c        buf[m] = '\0';
m                  30 user/grep.c        if(m > 0){
m                  31 user/grep.c          m -= p - buf;
m                  32 user/grep.c          memmove(buf, p, m);