if (trans == NULL)
{
- printf ("catgets return NULL for %d\n", cnt);
+ printf ("catgets return NULL for %zd\n", cnt);
result = 1;
}
else if (strcmp (trans, msgs[cnt]) != 0 && msgs[cnt][0] != '\0')
for (i = len + 1; i < sizeof thepath; ++i)
if (thepath[i] != '\xff')
{
- printf ("thepath[%d] != '\xff'\n", i);
+ printf ("thepath[%zd] != '\xff'\n", i);
return 1;
}
{
printf ("Return Value: %p\n", ret);
for (i = 0; i < wcslen (wcs) + 1; i++)
- printf (" wcs[%d] = %04x", i, (unsigned int)wcs[i]);
+ printf (" wcs[%zd] = %04x", i, (unsigned int)wcs[i]);
printf ("\n");
result = 1;
}
printf ("Return Value: %p\n", ret);
for (i = 0; i < wcslen (wcs) + 1; i++)
- printf (" wcs[%d] = 0x%04x", i, (unsigned int)wcs[i]);
+ printf (" wcs[%zd] = 0x%04x", i, (unsigned int)wcs[i]);
printf ("\n");
for (i = 0; il_str2[i] != '\n'; ++i)
{
printf ("Return Value: %p\n", ret);
for (i = 0; i < wcslen (wcs) + 1; i++)
- printf (" wcs[%d] = 0x%04x", i, (unsigned int)wcs[i]);
+ printf (" wcs[%zd] = 0x%04x", i, (unsigned int)wcs[i]);
printf ("\n");
}
n = swprintf (buf, nbuf, L"Hello %s", "world");
if (n != 11)
{
- printf ("incorrect return value: %d instead of 11\n", n);
+ printf ("incorrect return value: %zd instead of 11\n", n);
result = 1;
}
else if (wcscmp (buf, L"Hello world") != 0)
n = swprintf (buf, nbuf, L"Is this >%g< 3.1?", 3.1);
if (n != 18)
{
- printf ("incorrect return value: %d instead of 18\n", n);
+ printf ("incorrect return value: %zd instead of 18\n", n);
result = 1;
}
else if (wcscmp (buf, L"Is this >3.1< 3.1?") != 0)
{
char buf[500];
regerror (n, &re, buf, sizeof (buf));
- printf ("regcomp %d failed: %s\n", i, buf);
+ printf ("regcomp %zd failed: %s\n", i, buf);
ret = 1;
continue;
}
if (regexec (&re, tests[i].string, tests[i].nmatch, rm, 0))
{
- printf ("regexec %d failed\n", i);
+ printf ("regexec %zd failed\n", i);
ret = 1;
regfree (&re);
continue;
{
char buf[500];
regerror (n, &re, buf, sizeof (buf));
- printf ("regcomp %d failed: %s\n", i, buf);
+ printf ("regcomp %zd failed: %s\n", i, buf);
ret = 1;
continue;
}
if (! regexec (&re, tests[i].string, tests[i].nmatch,
tests[i].nmatch ? rm : NULL, 0))
{
- printf ("regexec %d incorrectly matched\n", i);
+ printf ("regexec %zd incorrectly matched\n", i);
ret = 1;
}
for (c = ps; c < ps + 1000; ++c)
if (ptr[c - ps] != '0' + (c % 10))
{
- printf ("wrong data mapped at offset %d\n", c);
+ printf ("wrong data mapped at offset %zd\n", c);
result = 1;
}
}
for (c = ps; c < ps + 1000; ++c)
if (ptr[c - ps] != '0' + (c % 10))
{
- printf ("wrong data mapped at offset %d\n", c);
+ printf ("wrong data mapped at offset %zd\n", c);
result = 1;
}
}
if (ch1 != ch2)
{
- printf ("%d: '%c' vs '%c'\n", i, ch1, ch2);
+ printf ("%zd: '%c' vs '%c'\n", i, ch1, ch2);
return 1;
}
}
res = (struct entry *) bsearch (&key, arr, narr, sizeof (arr[0]), comp);
if (res == NULL)
{
- printf ("entry %d not found\n", cnt);
+ printf ("entry %zd not found\n", cnt);
result = 1;
}
else if (res != &arr[cnt])
{
if (res == NULL)
{
- printf ("entry %d not found\n", cnt);
+ printf ("entry %zd not found\n", cnt);
result = 1;
}
else if (res != &arr[cnt])