Ejemplo n.º 1
0
static void strtol_func() {
	/* Without integner prefix(e.g. 0x, 0b...) */
	char text[1024] = "12345670qwert\0";
	char text2[1024] = "qwert12345670qwert\0";
	char text3[1024] = "qwert12345670\0";
	char* non_intger;
	long int rtn = 0;
	int base = 0;

		/* base 0 */
	rtn = __strtol(text, &non_intger, base);
	assert_int_equal(rtn, 12345670);
	assert_memory_equal(non_intger, text + 8, strlen(text + 8));

//	rtn = __strtol(text2, &non_intger, base);
//	assert_int_equal(rtn, 12345670);
//	assert_memory_equal(non_intger, text2 + 8, strlen(text2 + 8));
//
//	rtn = __strtol(text3, &non_intger, base);
//	assert_int_equal(rtn, 12345670);
//	assert_memory_equal(non_intger, text3 + 8, strlen(text3 + 8));

		/* base 8 */
	base = 8;
	rtn = __strtol(text, &non_intger, base);
	assert_int_equal(rtn, 012345670);
	assert_memory_equal(non_intger, text + 8, strlen(text + 8));

//	base = 8;
//	rtn = __strtol(text2, &non_intger, base);
//	assert_int_equal(rtn, 012345670);
//	assert_memory_equal(non_intger, text2 + 8, strlen(text2 + 8));
//
//	base = 8;
//	rtn = __strtol(text3, &non_intger, base);
//	assert_int_equal(rtn, 012345670);
//	assert_memory_equal(non_intger, text3 + 8, strlen(text3 + 8));

		/* base 10 */
	base = 10;
	rtn = __strtol(text, &non_intger, base);
	assert_int_equal(rtn, 12345670);
	assert_memory_equal(non_intger, text + 8, strlen(text + 8));

//	base = 10;
//	rtn = __strtol(text2, &non_intger, base);
//	assert_int_equal(rtn, 12345670);
//	assert_memory_equal(non_intger, text2 + 8, strlen(text2 + 8));
//
//	base = 10;
//	rtn = __strtol(text3, &non_intger, base);
//	assert_int_equal(rtn, 12345670);
//	assert_memory_equal(non_intger, text3 + 8, strlen(text3 + 8));

		/* base 16 */
	base = 16;
	rtn = __strtol(text, &non_intger, base);
	assert_int_equal(rtn, 0x12345670);
	assert_memory_equal(non_intger, text + 8, strlen(text + 8));

//	base = 16;
//	rtn = __strtol(text2, &non_intger, base);
//	assert_int_equal(rtn, 0x12345670);
//	assert_memory_equal(non_intger, text2 + 8, strlen(text2 + 8));
//
//	base = 16;
//	rtn = __strtol(text3, &non_intger, base);
//	assert_int_equal(rtn, 0x12345670);
//	assert_memory_equal(non_intger, text3 + 8, strlen(text3 + 8));

	/* With prefix 0(octet)*/
	memset(text, 0, 1024);
	strncpy(text, "012345670qwert", strlen("012345670qwert"));

//	memset(text2, 0, 1024);
//	strncpy(text2, "qwert012345670qwert", strlen("qwert012345670qwert"));
//
//	memset(text, 0, 1024);
//	strncpy(text, "qwert012345670", strlen("qwert012345670"));

		/* base 0 */
	base = 0;
	rtn = __strtol(text, &non_intger, base);
	assert_int_equal(rtn, 012345670);
	assert_memory_equal(non_intger, text + 9, strlen(text + 9));

//	base = 0;
//	rtn = __strtol(text2, &non_intger, base);
//	assert_int_equal(rtn, 012345670);
//	assert_memory_equal(non_intger, text2 + 9, strlen(text2 + 9));
//
//	base = 0;
//	rtn = __strtol(text3, &non_intger, base);
//	assert_int_equal(rtn, 012345670);
//	assert_memory_equal(non_intger, text3 + 9, strlen(text3 + 9));

		/* base 8 */
	base = 8;
	rtn = __strtol(text, &non_intger, base);
	assert_int_equal(rtn, 012345670);
	assert_memory_equal(non_intger, text + 9, strlen(text + 9));

//	base = 8;
//	rtn = __strtol(text2, &non_intger, base);
//	assert_int_equal(rtn, 012345670);
//	assert_memory_equal(non_intger, text2 + 9, strlen(text2 + 9));
//
//	base = 8;
//	rtn = __strtol(text3, &non_intger, base);
//	assert_int_equal(rtn, 012345670);
//	assert_memory_equal(non_intger, text3 + 9, strlen(text3 + 9));

		/* base 10 */
	base = 10;
	rtn = __strtol(text, &non_intger, base);
	assert_int_equal(rtn, 12345670);
	assert_memory_equal(non_intger, text + 9, strlen(text + 9));

//	base = 10;
//	rtn = __strtol(text2, &non_intger, base);
//	assert_int_equal(rtn, 12345670);
//	assert_memory_equal(non_intger, text2 + 9, strlen(text2 + 9));
//
//	base = 10;
//	rtn = __strtol(text3, &non_intger, base);
//	assert_int_equal(rtn, 12345670);
//	assert_memory_equal(non_intger, text3 + 9, strlen(text3 + 9));

		/* base 16 */
	base = 16;
	rtn = __strtol(text, &non_intger, base);
	assert_int_equal(rtn, 0x12345670);
	assert_memory_equal(non_intger, text + 9, strlen(text + 9));

//	base = 16;
//	rtn = __strtol(text2, &non_intger, base);
//	assert_int_equal(rtn, 0x12345670);
//	assert_memory_equal(non_intger, text2 + 9, strlen(text2 + 9));
//
//	base = 16;
//	rtn = __strtol(text3, &non_intger, base);
//	assert_int_equal(rtn, 0x12345670);
//	assert_memory_equal(non_intger, text3 + 9, strlen(text3 + 9));

	/* With prefix 0x(hex)*/
	memset(text, 0, 1024);
	strncpy(text, "0x12345670qwert", strlen("0x12345670qwert"));

//	memset(text2, 0, 1024);
//	strncpy(text2, "qwert0x12345670qwert", strlen("qwert0x12345670qwert"));
//
//	memset(text3, 0, 1024);
//	strncpy(text3, "qwert0x12345670", strlen("qwert0x12345670qwert"));

		/* base 0 */
	base = 0;
	rtn = __strtol(text, &non_intger, base);
	assert_int_equal(rtn, 0x12345670);
	assert_memory_equal(non_intger, text + 10, strlen(text + 10));

//	base = 0;
//	rtn = __strtol(text2, &non_intger, base);
//	assert_int_equal(rtn, 0x12345670);
//	assert_memory_equal(non_intger, text2 + 10, strlen(text2 + 10));
//
//	base = 0;
//	rtn = __strtol(text3, &non_intger, base);
//	assert_int_equal(rtn, 0x12345670);
//	assert_memory_equal(non_intger, text3 + 10, strlen(text3 + 10));

		/* base 8 */
	base = 8;
	rtn = __strtol(text, &non_intger, base);
	assert_int_equal(rtn, 0);
	assert_memory_equal(non_intger, text + 1, strlen(text + 1));

//	base = 8;
//	rtn = __strtol(text2, &non_intger, base);
//	assert_int_equal(rtn, 0);
//	assert_memory_equal(non_intger, text2 + 1, strlen(text2 + 1));
//
//	base = 8;
//	rtn = __strtol(text3, &non_intger, base);
//	assert_int_equal(rtn, 0);
//	assert_memory_equal(non_intger, text3 + 1, strlen(text3 + 1));

		/* base 10 */
	base = 10;
	rtn = __strtol(text, &non_intger, base);
	assert_int_equal(rtn, 0);
	assert_memory_equal(non_intger, text + 1, strlen(text + 1));

//	base = 10;
//	rtn = __strtol(text2, &non_intger, base);
//	assert_int_equal(rtn, 0);
//	assert_memory_equal(non_intger, text2 + 1, strlen(text2 + 1));
//
//	base = 10;
//	rtn = __strtol(text3, &non_intger, base);
//	assert_int_equal(rtn, 0);
//	assert_memory_equal(non_intger, text3 + 1, strlen(text3 + 1));

		/* base 16 */
	base = 16;
	rtn = __strtol(text, &non_intger, base);
	assert_int_equal(rtn, 0x12345670);
	assert_memory_equal(non_intger, text + 10, strlen(text + 10));

//	base = 16;
//	rtn = __strtol(text2, &non_intger, base);
//	assert_int_equal(rtn, 0x12345670);
//	assert_memory_equal(non_intger, text2 + 10, strlen(text + 10));
//
//	base = 16;
//	rtn = __strtol(text3, &non_intger, base);
//	assert_int_equal(rtn, 0x12345670);
//	assert_memory_equal(non_intger, text3 + 10, strlen(text + 10));
}
Ejemplo n.º 2
0
strtol_error
__xstrtol (const char *s, char **ptr, int strtol_base,
           __strtol_t *val, const char *valid_suffixes)
{
  char *t_ptr;
  char **p;
  __strtol_t tmp;
  strtol_error err = LONGINT_OK;

  assert (0 <= strtol_base && strtol_base <= 36);

  p = (ptr ? ptr : &t_ptr);

  if (! TYPE_SIGNED (__strtol_t))
    {
      const char *q = s;
      unsigned char ch = *q;
      while (isspace (ch))
        ch = *++q;
      if (ch == '-')
        return LONGINT_INVALID;
    }

  errno = 0;
  tmp = __strtol (s, p, strtol_base);

  if (*p == s)
    {
      /* If there is no number but there is a valid suffix, assume the
         number is 1.  The string is invalid otherwise.  */
      if (valid_suffixes && **p && strchr (valid_suffixes, **p))
        tmp = 1;
      else
        return LONGINT_INVALID;
    }
  else if (errno != 0)
    {
      if (errno != ERANGE)
        return LONGINT_INVALID;
      err = LONGINT_OVERFLOW;
    }

  /* Let valid_suffixes == NULL mean `allow any suffix'.  */
  /* FIXME: update all callers except the ones that allow suffixes
     after the number, changing last parameter NULL to `""'.  */
  if (!valid_suffixes)
    {
      *val = tmp;
      return err;
    }

  if (**p != '\0')
    {
      int base = 1024;
      int suffixes = 1;
      strtol_error overflow;

      if (!strchr (valid_suffixes, **p))
        {
          *val = tmp;
          return err | LONGINT_INVALID_SUFFIX_CHAR;
        }

      if (strchr (valid_suffixes, '0'))
        {
          /* The ``valid suffix'' '0' is a special flag meaning that
             an optional second suffix is allowed, which can change
             the base.  A suffix "B" (e.g. "100MB") stands for a power
             of 1000, whereas a suffix "iB" (e.g. "100MiB") stands for
             a power of 1024.  If no suffix (e.g. "100M"), assume
             power-of-1024.  */

          switch (p[0][1])
            {
            case 'i':
              if (p[0][2] == 'B')
                suffixes += 2;
              break;

            case 'B':
            case 'D': /* 'D' is obsolescent */
              base = 1000;
              suffixes++;
              break;
            }
        }

      switch (**p)
        {
        case 'b':
          overflow = bkm_scale (&tmp, 512);
          break;

        case 'B':
          overflow = bkm_scale (&tmp, 1024);
          break;

        case 'c':
          overflow = 0;
          break;

        case 'E': /* exa or exbi */
          overflow = bkm_scale_by_power (&tmp, base, 6);
          break;

        case 'G': /* giga or gibi */
        case 'g': /* 'g' is undocumented; for compatibility only */
          overflow = bkm_scale_by_power (&tmp, base, 3);
          break;

        case 'k': /* kilo */
        case 'K': /* kibi */
          overflow = bkm_scale_by_power (&tmp, base, 1);
          break;

        case 'M': /* mega or mebi */
        case 'm': /* 'm' is undocumented; for compatibility only */
          overflow = bkm_scale_by_power (&tmp, base, 2);
          break;

        case 'P': /* peta or pebi */
          overflow = bkm_scale_by_power (&tmp, base, 5);
          break;

        case 'T': /* tera or tebi */
        case 't': /* 't' is undocumented; for compatibility only */
          overflow = bkm_scale_by_power (&tmp, base, 4);
          break;

        case 'w':
          overflow = bkm_scale (&tmp, 2);
          break;

        case 'Y': /* yotta or 2**80 */
          overflow = bkm_scale_by_power (&tmp, base, 8);
          break;

        case 'Z': /* zetta or 2**70 */
          overflow = bkm_scale_by_power (&tmp, base, 7);
          break;

        default:
          *val = tmp;
          return err | LONGINT_INVALID_SUFFIX_CHAR;
        }

      err |= overflow;
      *p += suffixes;
      if (**p)
        err |= LONGINT_INVALID_SUFFIX_CHAR;
    }

  *val = tmp;
  return err;
}
Ejemplo n.º 3
0
strtol_error
__xstrtol (const char *s, char **ptr, int strtol_base,
	   __strtol_t *val, const char *valid_suffixes)
{
  char *t_ptr;
  char **p;
  __strtol_t tmp;

  assert (0 <= strtol_base && strtol_base <= 36);

  p = (ptr ? ptr : &t_ptr);

  if (! TYPE_SIGNED (__strtol_t))
    {
      const char *q = s;
      while (ISSPACE ((unsigned char) *q))
	++q;
      if (*q == '-')
	return LONGINT_INVALID;
    }

  errno = 0;
  tmp = __strtol (s, p, strtol_base);
  if (errno != 0)
    return LONGINT_OVERFLOW;
  if (*p == s)
    return LONGINT_INVALID;

  /* Let valid_suffixes == NULL mean `allow any suffix'.  */
  /* FIXME: update all callers except the ones that allow suffixes
     after the number, changing last parameter NULL to `""'.  */
  if (!valid_suffixes)
    {
      *val = tmp;
      return LONGINT_OK;
    }

  if (**p != '\0')
    {
      int base = 1024;
      int suffixes = 1;
      int overflow;

      if (!strchr (valid_suffixes, **p))
	{
	  *val = tmp;
	  return LONGINT_INVALID_SUFFIX_CHAR;
	}

      if (strchr (valid_suffixes, '0'))
	{
	  /* The ``valid suffix'' '0' is a special flag meaning that
	     an optional second suffix is allowed, which can change
	     the base, e.g. "100MD" for 100 megabytes decimal.  */

	  switch (p[0][1])
	    {
	    case 'B':
	      suffixes++;
	      break;

	    case 'D':
	      base = 1000;
	      suffixes++;
	      break;
	    }
	}

      switch (**p)
	{
	case 'b':
	  overflow = bkm_scale (&tmp, 512);
	  break;

	case 'B':
	  overflow = bkm_scale (&tmp, 1024);
	  break;

	case 'c':
	  overflow = 0;
	  break;

	case 'E': /* Exa */
	  overflow = bkm_scale_by_power (&tmp, base, 6);
	  break;

	case 'G': /* Giga */
	  overflow = bkm_scale_by_power (&tmp, base, 3);
	  break;

	case 'k': /* kilo */
	  overflow = bkm_scale_by_power (&tmp, base, 1);
	  break;

	case 'M': /* Mega */
	case 'm': /* 'm' is undocumented; for backward compatibility only */
	  overflow = bkm_scale_by_power (&tmp, base, 2);
	  break;

	case 'P': /* Peta */
	  overflow = bkm_scale_by_power (&tmp, base, 5);
	  break;

	case 'T': /* Tera */
	  overflow = bkm_scale_by_power (&tmp, base, 4);
	  break;

	case 'w':
	  overflow = bkm_scale (&tmp, 2);
	  break;

	case 'Y': /* Yotta */
	  overflow = bkm_scale_by_power (&tmp, base, 8);
	  break;

	case 'Z': /* Zetta */
	  overflow = bkm_scale_by_power (&tmp, base, 7);
	  break;

	default:
	  *val = tmp;
	  return LONGINT_INVALID_SUFFIX_CHAR;
	  break;
	}

      if (overflow)
	return LONGINT_OVERFLOW;

      (*p) += suffixes;
    }

  *val = tmp;
  return LONGINT_OK;
}