if (s == OPSIZ && (b1 - b2) % OPSIZ == 0)
if (s == OPSIZ && (b1 - (char *) 0) % OPSIZ == 0)
DEFUN(msort_with_tmp, (b, n, s, cmp, t),      PTR b AND size_t n AND size_t s AND __compar_fn_t cmp AND char *t){  char *tmp;  char *b1, *b2;  size_t n1, n2;  if (n <= 1)    return;  n1 = n / 2;  n2 = n - n1;  b1 = b;  b2 = (char *) b + (n1 * s);  msort_with_tmp (b1, n1, s, cmp, t);  msort_with_tmp (b2, n2, s, cmp, t);  tmp = t;  if (s == OPSIZ && (b1 - b2) % OPSIZ == 0)    /* We are operating on aligned words.  Use direct word stores.  */    while (n1 > 0 && n2 > 0)      {	if ((*cmp) (b1, b2) <= 0)	  {	    --n1;	    *((op_t *) tmp)++ = *((op_t *) b1)++;	  }	else	  {	    --n2;	    *((op_t *) tmp)++ = *((op_t *) b2)++;	  }      }  else    while (n1 > 0 && n2 > 0)      {	if ((*cmp) (b1, b2) <= 0)	  {	    memcpy (tmp, b1, s);	    b1 += s;	    --n1;	  }	else	  {	    memcpy (tmp, b2, s);	    b2 += s;	    --n2;	  }	tmp += s;      }  if (n1 > 0)    memcpy (tmp, b1, n1 * s);  memcpy (b, t, (n - n2) * s);}