1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004
|
/*
String handling tests
Copyright (C) 2001-2007, 2009, Joe Orton <joe@manyfish.co.uk>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include "config.h"
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#ifdef HAVE_ERRNO_H
#include <errno.h> /* for the ENOENT definitions in str_errors */
#endif
#ifdef HAVE_LIMITS_H
#include <limits.h>
#endif
#include "ne_string.h"
#include "ne_utils.h"
#include "tests.h"
#undef ONCMP
#define ONCMP(a,b) ONV(!a || strcmp(a, b), \
("result was [%s] not [%s]", a, b))
static int simple(void) {
ne_buffer *s = ne_buffer_create();
ON(s == NULL);
ne_buffer_zappend(s, "abcde");
ONCMP(s->data, "abcde");
ON(ne_buffer_size(s) != 5);
ne_buffer_destroy(s);
return OK;
}
static int buf_concat(void)
{
ne_buffer *s = ne_buffer_create();
ON(s == NULL);
ne_buffer_concat(s, "a", "b", "c", "d", "e", "f", "g", NULL);
ONCMP(s->data, "abcdefg");
ON(ne_buffer_size(s) != 7);
ne_buffer_destroy(s);
return OK;
}
static int buf_concat2(void)
{
#define RES "alphabetagammadeltaepsilonetatheta"
ne_buffer *s = ne_buffer_create();
ON(s == NULL);
ne_buffer_concat(s, "alpha", "beta", "gamma", "delta", "epsilon",
"eta", "theta", NULL);
ONCMP(s->data, RES);
ON(ne_buffer_size(s) != strlen(RES));
ne_buffer_destroy(s);
return OK;
}
static int buf_concat3(void)
{
ne_buffer *s = ne_buffer_create();
ON(s == NULL);
ne_buffer_zappend(s, "foobar");
ne_buffer_concat(s, "norman", NULL);
ONCMP(s->data, "foobarnorman");
ON(ne_buffer_size(s) != 12);
ne_buffer_destroy(s);
return OK;
}
static int append(void)
{
ne_buffer *s = ne_buffer_create();
ON(s == NULL);
ne_buffer_append(s, "a", 1);
ne_buffer_append(s, "b", 1);
ne_buffer_append(s, "c", 1);
ONCMP(s->data, "abc");
ON(ne_buffer_size(s) != 3);
ne_buffer_zappend(s, "hello");
ONCMP(s->data, "abchello");
ne_buffer_czappend(s, "world");
ONCMP(s->data, "abchelloworld");
ON(ne_buffer_size(s) != 13);
ne_buffer_destroy(s);
return OK;
}
static int grow(void)
{
ne_buffer *s = ne_buffer_ncreate(2);
ON(s == NULL);
ne_buffer_append(s, "a", 1);
ne_buffer_grow(s, 4);
ONCMP(s->data, "a");
ne_buffer_destroy(s);
return OK;
}
static int alter(void) {
ne_buffer *s = ne_buffer_create();
char *d;
ON(s == NULL);
ne_buffer_zappend(s, "abcdefg");
d = s->data;
ON(d == NULL);
d[2] = '\0';
ne_buffer_altered(s);
ONCMP(s->data, "ab");
ON(ne_buffer_size(s) != 2);
ne_buffer_zappend(s, "hijkl");
ONCMP(s->data, "abhijkl");
ne_buffer_destroy(s);
return OK;
}
/* Macros for testing ne_token. */
#define TEST(res) do { \
char *tok = ne_token(&pnt, ','); \
ONN(res ": return", tok == NULL); \
ONN(res ": compare", strcmp(tok, (res))); \
ONN(res ": modify", pnt == NULL); \
} while (0)
#define LASTTEST(res) do { \
char *tok = ne_token(&pnt, ','); \
ONN(res ": last return", tok == NULL); \
ONN(res ": last compare", strcmp(tok, (res))); \
ONN(res ": last modify", pnt != NULL); \
} while (0)
#define QTEST(res) do { \
char *tok = ne_qtoken(&pnt, ',', QUOTES); \
ONN(res ": return", tok == NULL); \
ONN(res ": compare", strcmp(tok, (res))); \
ONN(res ": modify", pnt == NULL); \
} while (0)
#define QLASTTEST(res) do { \
char *tok = ne_qtoken(&pnt, ',', QUOTES); \
ONN(res ": last return", tok == NULL); \
ONN(res ": last compare", strcmp(tok, (res))); \
ONN(res ": last modify", pnt != NULL); \
} while (0)
static int token1(void)
{
char *str = ne_strdup("a,b,c,d"), *pnt = str;
TEST("a"); TEST("b"); TEST("c"); LASTTEST("d");
ne_free(str);
return OK;
}
static int token2(void)
{
char *str = ne_strdup("norman,fishing, elsewhere"), *pnt = str;
TEST("norman"); TEST("fishing"); LASTTEST(" elsewhere");
ne_free(str);
return OK;
}
static int nulls(void)
{
char *str = ne_strdup("alpha,,gamma"), *pnt = str;
TEST("alpha"); TEST(""); LASTTEST("gamma");
ne_free(str);
pnt = str = ne_strdup(",,,wooo");
TEST(""); TEST(""); TEST(""); LASTTEST("wooo");
ne_free(str);
pnt = str = ne_strdup("wooo,,,");
TEST("wooo"); TEST(""); TEST(""); LASTTEST("");
ne_free(str);
return OK;
}
static int empty(void)
{
char *str = ne_strdup(""), *pnt = str;
LASTTEST("");
ne_free(str);
return OK;
}
#undef QUOTES
#define QUOTES "'"
static int quoted(void)
{
char *str =
ne_strdup("alpha,'beta, a fish called HELLO!?',sandwiches");
char *pnt = str;
QTEST("alpha");
QTEST("'beta, a fish called HELLO!?'");
QLASTTEST("sandwiches");
ne_free(str);
return OK;
}
static int badquotes(void)
{
char *str = ne_strdup("alpha,'blah"), *pnt = str;
QTEST("alpha");
ON(ne_qtoken(&pnt, ',', QUOTES) != NULL);
ne_free(str);
return OK;
}
/* for testing ne_shave. */
#undef TEST
#define TEST(str, ws, res) do { \
char *s = ne_strdup((str)); \
char *r = ne_shave(s, (ws)); \
ONN("[" str "]", strcmp(r, (res))); \
ne_free(s); \
} while (0)
static int shave(void)
{
TEST(" b ", " ", "b");
TEST("b", " ", "b");
TEST(" b ", " ", "b");
TEST("--bbb-----", "-", "bbb");
TEST("hello, world ", " ", "hello, world");
TEST("<<><<<><<this is foo<<><<<<><<", "<>", "this is foo");
TEST("09809812342347I once saw an helicopter0012312312398", "0123456789",
"I once saw an helicopter");
return OK;
}
/* Regression test for ne_shave call which should produce an empty
* string. */
static int shave_regress(void)
{
TEST("\"\"", "\"", "");
return OK;
}
/* Test the ne_token/ne_shave combination. */
#undef TEST
#undef LASTTEST
#define TEST(res) do { \
char *tok = ne_token(&pnt, ','); \
ONN(res ": return", tok == NULL); \
tok = ne_shave(tok, " "); \
ONN(res ": shave", tok == NULL); \
ONN(res ": compare", strcmp(tok, (res))); \
ONN(res ": modify", pnt == NULL); \
} while (0)
#define LASTTEST(res) do { \
char *tok = ne_token(&pnt, ','); \
ONN(res ": last return", tok == NULL); \
tok = ne_shave(tok, " "); \
ONN(res ": last shave", tok == NULL); \
ONN(res ": last compare", strcmp(tok, (res))); \
ONN(res ": last modify", pnt != NULL); \
} while (0)
/* traditional use of ne_token/ne_shave. */
static int combo(void)
{
char *str = ne_strdup(" fred , mary, jim , alice, david"), *pnt = str;
TEST("fred"); TEST("mary"); TEST("jim"); TEST("alice");
LASTTEST("david");
ne_free(str);
return 0;
}
static int concat(void)
{
#define CAT(res, args) do { char *str = ne_concat args; \
ONCMP(str, res); \
ne_free(str); } while (0)
CAT("alphabeta", ("alpha", "beta", NULL));
CAT("alpha", ("alpha", "", "", NULL));
CAT("", ("", NULL));
CAT("", ("", "", "", NULL));
CAT("alpha", ("", "a", "lph", "", "a", NULL));
return OK;
}
static int str_errors(void)
{
char expect[200], actual[200];
strncpy(expect, strerror(ENOENT), sizeof(expect)-1);
ONN("ne_strerror did not return passed-in buffer",
ne_strerror(ENOENT, actual, sizeof(actual)) != actual);
ONV(strcmp(expect, actual),
("error from ENOENT was `%s' not `%s'", actual, expect));
/* Test truncated error string is still NUL-terminated. */
ne_strerror(ENOENT, actual, 6);
NE_DEBUG(NE_DBG_HTTP, "error: %s\n", actual);
ONN("truncated string had wrong length", strlen(actual) != 5);
ne_strerror(-1, actual, 6);
ONN("truncated string for bad error had wrong length",
strlen(actual) != 5);
return OK;
}
static int strnzcpy(void)
{
char buf[16];
ne_strnzcpy(buf, "abcdefghi", 5);
ONV(strcmp(buf, "abcd"), ("result was `%s' not `abcd'", buf));
ne_strnzcpy(buf, "ab", 5);
ONV(strcmp(buf, "ab"), ("result was `%s' not `ab'", buf));
return OK;
}
#define FOX_STRING "The quick brown fox jumped over the lazy dog"
#define PUNC_STRING "<>,.;'#:@~[]{}!\"$%^&*()_+-="
static int cleaner(void)
{
static const char *strings[] = {
"alpha", "alpha",
"pretty\033[41mcolours", "pretty [41mcolours",
"beta\n", "beta ",
"del\rt\na", "del t a",
FOX_STRING, FOX_STRING,
"0123456789", "0123456789",
PUNC_STRING, PUNC_STRING,
"\01blah blee\05bloo", " blah blee bloo",
NULL,
};
unsigned int n;
for (n = 0; strings[n]; n+=2) {
char *act = ne_strclean(ne_strdup(strings[n]));
ONV(strcmp(act, strings[n+1]),
("cleansed to `%s' not `%s'", act, strings[n+1]));
ne_free(act);
}
return OK;
}
/* Check that raw data 'raw', of length 'len', has base64 encoding
* of 'expected'. */
static int b64_check(const unsigned char *raw, size_t len,
const char *expected)
{
char *encoded = ne_base64(raw, len);
unsigned char *decoded;
size_t dlen;
ONV(strcmp(encoded, expected),
("base64(\"%s\") gave \"%s\" not \"%s\"", raw, encoded, expected));
dlen = ne_unbase64(encoded, &decoded);
ONV(dlen != len,
("decoded `%s' length was %" NE_FMT_SIZE_T " not %" NE_FMT_SIZE_T,
expected, dlen, len));
ONV(memcmp(raw, decoded, dlen),
("decoded `%s' as `%.*s' not `%.*s'",
expected, (int)dlen, decoded, (int)dlen, raw));
ne_free(decoded);
ne_free(encoded);
return OK;
}
/* ALLBITS: base64 encoding of "\0..\377" */
#define ALLBITS \
"AAECAwQFBgcICQoLDA0ODxAREhMUFRYXGBkaGxwdHh8gISIjJCUmJygpKiss" \
"LS4vMDEyMzQ1Njc4OTo7PD0+P0BBQkNERUZHSElKS0xNTk9QUVJTVFVWV1hZ" \
"WltcXV5fYGFiY2RlZmdoaWprbG1ub3BxcnN0dXZ3eHl6e3x9fn+AgYKDhIWG" \
"h4iJiouMjY6PkJGSk5SVlpeYmZqbnJ2en6ChoqOkpaanqKmqq6ytrq+wsbKz" \
"tLW2t7i5uru8vb6/wMHCw8TFxsfIycrLzM3Oz9DR0tPU1dbX2Nna29zd3t/g" \
"4eLj5OXm5+jp6uvs7e7v8PHy8/T19vf4+fr7/P3+/w=="
static int base64(void)
{
unsigned char bits[256];
size_t n;
#define B64B(x, l, y) CALL(b64_check((unsigned char *)x, l, y))
#define B64(x, y) B64B(x, strlen(x), y)
/* invent these with
* $ printf "string" | uuencode -m blah
*/
B64("a", "YQ==");
B64("bb", "YmI=");
B64("ccc", "Y2Nj");
B64("Hello, world", "SGVsbG8sIHdvcmxk");
B64("Aladdin:open sesame", "QWxhZGRpbjpvcGVuIHNlc2FtZQ==");
B64("I once saw a dog called norman.\n",
"SSBvbmNlIHNhdyBhIGRvZyBjYWxsZWQgbm9ybWFuLgo=");
B64("The quick brown fox jumped over the lazy dog",
"VGhlIHF1aWNrIGJyb3duIGZveCBqdW1wZWQgb3ZlciB0aGUgbGF6eSBkb2c=");
/* binary data..
* $ printf "string" | wc -c # get the length
* $ printf "string" | uuencode -m blah # get the base64
*/
B64B("\0\0\0\0\0\n", 6, "AAAAAAAK");
B64B("I once wished \0 upon a \0 fish.", 30,
"SSBvbmNlIHdpc2hlZCAAIHVwb24gYSAAIGZpc2gu");
B64B("\201\202\203\204", 4, "gYKDhA==");
for (n = 0; n < sizeof bits; n++)
bits[n] = (unsigned char)n;
CALL(b64_check(bits, sizeof bits, ALLBITS));
#undef B64
#undef B64B
return OK;
}
static int unbase64(void)
{
static const char *ts[] = {
"", "a", "ab", "abc",
"}bcd", "a}cd", "ab}d", "abc}", " ",
"^bcd", "a^cd", "ab^d", "abc^",
"====", "=bcd", "a=cd", "ab=d", "a==d", "a=c=",
NULL
};
size_t n;
for (n = 0; ts[n]; n++) {
unsigned char *tmp;
ONV(ne_unbase64(ts[n], &tmp) != 0,
("invalid string `%s' was decoded", ts[n]));
}
return OK;
}
static int printing(void)
{
struct {
const char *in, *out;
size_t pass, ret;
} ts[] = {
{ "alpha", "alpha", 10, 5 },
{ "alpha", "alph", 5, 4 },
{ "foobar", "", 1, 0 },
{ NULL, NULL, 0, 0}
};
size_t n;
for (n = 0; ts[n].in; n++) {
char buf[512];
size_t ret;
memset(buf, 'A', sizeof buf);
ret = ne_snprintf(buf, ts[n].pass, "%s", ts[n].in);
ONCMP(ts[n].out, buf);
ONV(ret != ts[n].ret,
("got return value %" NE_FMT_SIZE_T " not %" NE_FMT_SIZE_T,
ret, ts[n].ret));
/* byte past the NUL must still be 'A' */
ONN("buffer over-ran!", buf[ret + 1] != 'A');
}
return OK;
}
static int casecmp(void)
{
static const struct {
const char *left, *right;
int expect;
} ts[] = {
{ "abcdefghijklmnopqrstuvwxyz", "ABCDEFGHIJKLMNOPQRSTUVWXYZ", 0 },
{ "ABCDEFGHIJKLMNOPQRSTUVWXYZ", "abcdefghijklmnopqrstuvwxyz", 0 },
{ "foo", "bar", 1 },
{ "!#:[@\377", "!#:[@\377", 0 },
{ "bar", "foo", -1 },
{ "foop", "foo", 1 },
{ "foo", "foop", -1 },
{ NULL, NULL, 0 }
};
size_t n;
for (n = 0; ts[n].left; n++) {
int actual;
actual = ne_strcasecmp(ts[n].left, ts[n].right);
ONV(ts[n].expect == 0 && actual != 0,
("strcasecmp(%s, %s) gave %d, expected 0",
ts[n].left, ts[n].right, actual));
ONV(ts[n].expect > 0 && actual <= 0,
("strcasecmp(%s, %s) gave %d, expected > 0",
ts[n].left, ts[n].right, actual));
ONV(ts[n].expect < 0 && actual >= 0,
("strcasecmp(%s, %s) gave %d, expected < 0",
ts[n].left, ts[n].right, actual));
}
ONN("comparison of identical pointers did not give zero",
ne_strcasecmp(ts[0].left, ts[0].left) != 0);
return OK;
}
static int casencmp(void)
{
static const struct {
const char *left, *right;
size_t n;
int expect;
} ts[] = {
{ "abcdefghijklmnopqrstuvwxyz", "ABCDEFGHIJKLMNOPQRSTUVWXYZ", 30, 0 },
{ "abcdefghijklmnopqrstuvwxyz", "ABCDEFGHIJKLMNOPQRSTUVWXYZ", 10, 0 },
{ "ABCDEFGHIJKLMNOPQRSTUVWXYZ", "abcdefghijklmnopqrstuvwxyz", 0, 0 },
{ "foo", "bar", 3, 1 },
{ "bar", "foo", 4, -1 },
{ "bar", "foo", 3, -1 },
{ "foop", "foo", 4, 1 },
{ "foo", "foop", 4, -1 },
{ "bee", "bar", 0, 0},
{ NULL, NULL, 0, 0 }
};
size_t n;
for (n = 0; ts[n].left; n++) {
int actual;
actual = ne_strncasecmp(ts[n].left, ts[n].right, ts[n].n);
ONV(ts[n].expect == 0 && actual != 0,
("strncasecmp(%s, %s, %" NE_FMT_SIZE_T ") gave %d, expected 0",
ts[n].left, ts[n].right, ts[n].n, actual));
ONV(ts[n].expect > 0 && actual <= 0,
("strncasecmp(%s, %s, %" NE_FMT_SIZE_T ") gave %d, expected > 0",
ts[n].left, ts[n].right, ts[n].n, actual));
ONV(ts[n].expect < 0 && actual >= 0,
("strncasecmp(%s, %s, %" NE_FMT_SIZE_T ") gave %d, expected < 0",
ts[n].left, ts[n].right, ts[n].n, actual));
}
ONN("comparison of identical pointers did not give zero",
ne_strncasecmp(ts[0].left, ts[0].left, 5) != 0);
return OK;
}
static int buf_print(void)
{
ne_buffer *buf = ne_buffer_create();
ne_buffer_czappend(buf, "foo-");
ne_buffer_snprintf(buf, 20, "bar-%s-asda", "norman");
ne_buffer_czappend(buf, "-bloo");
ONN("snprintf return value", ne_buffer_snprintf(buf, 2, "---") != 1);
ONCMP(buf->data, "foo-bar-norman-asda-bloo-");
ne_buffer_destroy(buf);
return OK;
}
static int qappend(void)
{
static const struct {
const char *in;
size_t inlen;
const char *out;
} ts[] = {
{ "", 0, "" },
{ "a", 1, "a" },
{ "b", 2, "b\\x00" },
{ "alpha\0alpha", 11, "alpha\\x00alpha" },
{ "a\tb", 3, "a\\x09b" },
{ "foo\x7f" "bar", 7, "foo\\x7fbar" },
{ NULL }
};
unsigned n;
for (n = 0; ts[n].in; n++) {
ne_buffer *buf = ne_buffer_create();
char *s;
const unsigned char *in = (const unsigned char *)ts[n].in;
ne_buffer_qappend(buf, in, ts[n].inlen);
ONCMP(buf->data, ts[n].out);
ONV(strlen(buf->data) + 1 != buf->used,
("bad buffer length for '%s': %" NE_FMT_SIZE_T,
ts[n].out, buf->used));
s = ne_strnqdup(in, ts[n].inlen);
ONCMP(s, ts[n].out);
ne_free(s);
ne_buffer_destroy(buf);
}
return OK;
}
static char *test_vstrhash(unsigned int flags, ...)
{
va_list ap;
char *rv;
va_start(ap, flags);
rv = ne_vstrhash(flags, ap);
va_end(ap);
return rv;
}
#define TEST1 "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
#define TEST1_SHA "248d6a61d20638b8e5c026930c3e6039a33ce45964ff2167f6ecedd419db06c1"
#define ONVEC(args, expect) \
do { char *h = ne_strhash args; ONCMP(h, expect); ne_free(h); } while (0)
static int strhash(void)
{
ONN("zero flags must return NULL", ne_strhash(0, "", NULL) != NULL);
ONN("zero flags must return NULL for vstrhash", test_vstrhash(0, "", NULL) != NULL);
ONN("no alg flags must return NULL", ne_strhash(NE_HASH_COLON, "", NULL) != NULL);
ONN("no alg flags must return NULL", ne_strhash(NE_HASH_SPACE, "", NULL) != NULL);
ONVEC((NE_HASH_MD5, "", NULL), "d41d8cd98f00b204e9800998ecf8427e");
ONVEC((NE_HASH_MD5, "foo", "ba", "r", NULL), "3858f62230ac3c915f300c664312c63f");
ONVEC((NE_HASH_MD5|NE_HASH_SPACE, "foo", "ba", "r", NULL), "38 58 f6 22 30 ac 3c 91 5f 30 0c 66 43 12 c6 3f");
return OK;
}
static int strhash_sha_256(void)
{
char *p = ne_strhash(NE_HASH_SHA256, "", NULL);
if (p == NULL) {
t_context("SHA-2-256 not supported");
return SKIP;
}
ne_free(p);
ONVEC((NE_HASH_SHA256, TEST1, NULL), TEST1_SHA);
ONVEC((NE_HASH_SHA256, "foobar", "foo", "bar", "f", "oobar", NULL),
"d173c93898d3ca8455a4526e0af2a1aee9b91c8ec19adac16e6e8be2da09436c");
return OK;
}
/* NIST examples from https://csrc.nist.gov/CSRC/media/Projects/Cryptographic-Standards-and-Guidelines/documents/examples/SHA512.pdf */
#define TEST1_512 "abc"
#define TEST1_512_MDC "dd:af:35:a1:93:61:7a:ba:cc:41:73:49:ae:20:41:31:12:e6:fa:4e:89:a9:7e:a2:0a:9e:ee:e6:4b:55:d3:9a:21:92:99:2a:27:4f:c1:a8:36:ba:3c:23:a3:fe:eb:bd:45:4d:44:23:64:3c:e8:0e:2a:9a:c9:4f:a5:4c:a4:9f"
#define TEST2_512_1 "abcdefghbcdefghicdefghijdefghijkefghijklfghijklmghijklmnhijklmnoijklmnopjklmnopqklmnopqrl"
#define TEST2_512_2 "mnopqrsmnopqrstnopqrstu"
#define TEST2_512_MD "8e959b75dae313da8cf4f72814fc143f8f7779c6eb9f7fa17299aeadb6889018501d289e4900f7e4331b99dec4b5433ac7d329eeb6dd26545e96e55b874be909"
/* NIST examples from https://csrc.nist.gov/CSRC/media/Projects/Cryptographic-Standards-and-Guidelines/documents/examples/SHA512_256.pdf */
#define TEST1_512_256 "abc"
#define TEST1_512_256_MD "53048e2681941ef99b2e29b76b4c7dabe4c2d0c634fc6d46e0e2f13107e7af23"
#define TEST2_512_256_1 "abcdefghbcdefghicdefghijdefghijkefghijklfghijklmghijklmnhijkl"
#define TEST2_512_256_2 "mnoijklmnopjklmnopqklmnopqrlmnopqrsmnopqrstnopqrstu"
#define TEST2_512_256_MD "3928e184fb8690f840da3988121d31be65cb9d3ef83ee6146feac861e19b563a"
#define TEST2_512_256_MDC "39:28:e1:84:fb:86:90:f8:40:da:39:88:12:1d:31:be:65:cb:9d:3e:f8:3e:e6:14:6f:ea:c8:61:e1:9b:56:3a"
static int strhash_sha_512(void)
{
char *p = ne_strhash(NE_HASH_SHA512, "", NULL);
if (p == NULL) {
t_context("SHA-2-512 not supported");
return SKIP;
}
ne_free(p);
ONVEC((NE_HASH_SHA512|NE_HASH_COLON, TEST1_512, NULL), TEST1_512_MDC);
ONVEC((NE_HASH_SHA512, TEST2_512_1, TEST2_512_2, NULL), TEST2_512_MD);
return OK;
}
static int strhash_sha_512_256(void)
{
char *p = ne_strhash(NE_HASH_SHA512_256, "", NULL);
if (p == NULL) {
t_context("SHA-2-512/256 not supported");
return SKIP;
}
ne_free(p);
ONVEC((NE_HASH_SHA512_256, TEST1_512_256, NULL), TEST1_512_256_MD);
ONVEC((NE_HASH_SHA512_256, TEST2_512_256_1, TEST2_512_256_2, NULL), TEST2_512_256_MD);
ONVEC((NE_HASH_SHA512_256|NE_HASH_COLON, TEST2_512_256_1, TEST2_512_256_2, NULL),
TEST2_512_256_MDC);
return OK;
}
/* FIPS 180-1 standard SHA-1 test vectors from RFC 3174 */
#define TEST1_SHA1 "abc"
#define TEST1_SHA1_MD "a9993e364706816aba3e25717850c26c9cd0d89d"
#define TEST2_SHA1 "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
#define TEST2_SHA1_MD "84983e441c3bd26ebaae4aa1f95129e5e54670f1"
#define TEST2_SHA1_MDC "84:98:3e:44:1c:3b:d2:6e:ba:ae:4a:a1:f9:51:29:e5:e5:46:70:f1"
static int strhash_sha1(void)
{
char *p = ne_strhash(NE_HASH_SHA1, "", NULL);
if (p == NULL) {
t_context("SHA-1 not supported");
return SKIP;
}
ne_free(p);
/* Test vector 1: "abc" */
ONVEC((NE_HASH_SHA1, TEST1_SHA1, NULL), TEST1_SHA1_MD);
/* Test vector 2: "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" */
ONVEC((NE_HASH_SHA1, TEST2_SHA1, NULL), TEST2_SHA1_MD);
/* Test with colon formatting */
ONVEC((NE_HASH_SHA1|NE_HASH_COLON, TEST2_SHA1, NULL), TEST2_SHA1_MDC);
/* Test with multiple string arguments */
ONVEC((NE_HASH_SHA1, "a", "b", "c", NULL), TEST1_SHA1_MD);
/* Test empty string - da39a3ee5e6b4b0d3255bfef95601890afd80709 */
ONVEC((NE_HASH_SHA1, "", NULL), "da39a3ee5e6b4b0d3255bfef95601890afd80709");
return OK;
}
static int strparam(void)
{
static const struct {
const char *charset, *lang;
const char *value;
const char *expect;
} ts[] = {
{ "UTF-8", NULL, "foobar", NULL },
{ "UTF-8", NULL, "foo12345bar", NULL },
{ "UTF-8", NULL, "foo@bar", "UTF-8''foo%40bar" },
{ "UTF-8", NULL, "foo bar", "UTF-8''foo%20bar" },
{ "iso-8859-1", "en", "\xA3 rates", "iso-8859-1'en'%a3%20rates" },
{ "UTF-8", NULL, "£ and € rates", "UTF-8''%c2%a3%20and%20%e2%82%ac%20rates" },
{ NULL }
};
unsigned n;
for (n = 0; ts[n].charset; n++) {
char *act = ne_strparam(ts[n].charset, ts[n].lang, (const unsigned char *)ts[n].value);
if (ts[n].expect == NULL) {
ONV(act != NULL, ("expected NULL output for '%s', got '%s'",
ts[n].value, act));
}
else {
ONCMP(act, ts[n].expect);
ne_free(act);
}
}
return OK;
}
static int strhextoul(void)
{
static const struct {
const char *input;
unsigned long expect;
int error; /* errno */
const char *endp;
} *t, ts[] = {
{ "0x0", ULONG_MAX, EINVAL },
{ "0X1", ULONG_MAX, EINVAL },
{ "+1", ULONG_MAX, EINVAL },
{ "-0", ULONG_MAX, EINVAL },
{ "+0x1", ULONG_MAX, EINVAL },
{ "+0X1", ULONG_MAX, EINVAL },
{ "", ULONG_MAX, EINVAL },
{ "1", 1, 0, "" },
{ " 10", ULONG_MAX, EINVAL, " 10" },
{ "0000010 ", 16, 0, " " },
{ "4242", 16962, 0 },
{ "4242zZZz", 16962, 0, "zZZz" },
{ "cAfEBeEf", 3405692655 },
#if SIZEOF_LONG == 8
{ "10000000000000000", ULONG_MAX, ERANGE },
{ "100000000", 0x100000000, 0 },
#elif SIZEOF_LONG == 4
{ "100000000", ULONG_MAX, ERANGE },
#endif
{ NULL }
};
unsigned n;
for (n = 0; ts[n].input; n++) {
unsigned long actual;
const char *endp = "(unset)", **endpp;
int errnum;
t = ts + n;
endpp = t->endp ? &endp : NULL;
errno = ENOENT;
actual = ne_strhextoul(t->input, endpp);
errnum = errno;
ONV(errnum != t->error,
("got errno %d not %d for [%s]", errnum, t->error, t->input));
ONV(actual != t->expect,
("got %lu not %lu for [%s]", actual, t->expect, t->input));
if (endpp) ONCMP(*endpp, t->endp);
}
return OK;
}
static int strlower(void)
{
char buf[256];
ne_strnzcpy(buf, "HELLO", sizeof buf);
ONN("unexpected return value", ne_strlower(buf) != buf);
ONV(strcmp(buf, "hello"), ("strlower failed: got %s", buf));
ne_strnzcpy(buf, "MiXeD CaSe 123", sizeof buf);
ne_strlower(buf);
ONV(strcmp(buf, "mixed case 123"), ("strlower failed: got %s", buf));
ne_strnzcpy(buf, "already lower", sizeof buf);
ne_strlower(buf);
ONV(strcmp(buf, "already lower"), ("strlower failed: got %s", buf));
ne_strnzcpy(buf, "", sizeof buf);
ne_strlower(buf);
ONV(strcmp(buf, ""), ("strlower failed on empty string"));
return OK;
}
static int strupper(void)
{
static const struct {
const char *input;
const char *expected;
} ts[] = {
{ "hello", "HELLO" },
{ "MiXeD CaSe 123", "MIXED CASE 123" },
{ "ALREADY UPPER", "ALREADY UPPER" },
{ "", "" },
{ NULL, NULL }
};
unsigned int i;
for (i = 0; ts[i].input != NULL; i++) {
char buf[256];
ne_strnzcpy(buf, ts[i].input, sizeof buf);
ONN("unexpected return value", ne_strupper(buf) != buf);
ONV(strcmp(buf, ts[i].expected),
("strupper failed: got %s, expected %s", buf, ts[i].expected));
}
return OK;
}
static int mknonce(void)
{
size_t ts[3] = {16, 32, 64};
unsigned int n;
for (n = 0; n < sizeof(ts)/sizeof(ts[0]); n++) {
unsigned char nonce1[256], nonce2[256];
ONN("nonce generation failed", ne_mknonce(nonce1, ts[n], 0));
ONN("second nonce generation failed", ne_mknonce(nonce2, ts[n], 0));
ONV(memcmp(nonce1, nonce2, ts[0]) == 0,
("two consecutive nonces are identical"));
}
return OK;
}
/* Test multiple nonces for uniqueness */
static int mknonce_uniqueness(void)
{
unsigned char nonces[10][16];
unsigned int i, j;
/* Generate 10 nonces */
for (i = 0; i < 10; i++)
ONN("nonce generation failed", ne_mknonce(nonces[i], sizeof nonces[i], 0));
/* Check all are unique */
for (i = 0; i < 10; i++)
for (j = i + 1; j < 10; j++)
ONV(memcmp(nonces[i], nonces[j], sizeof nonces[i]) == 0,
("nonces at positions %u and %u are identical",
i, j));
return OK;
}
ne_test tests[] = {
T(simple),
T(buf_concat),
T(buf_concat2),
T(buf_concat3),
T(append),
T(grow),
T(alter),
T(token1),
T(token2),
T(nulls),
T(empty),
T(quoted),
T(badquotes),
T(shave),
T(shave_regress),
T(combo),
T(concat),
T(str_errors),
T(strnzcpy),
T(cleaner),
T(base64),
T(unbase64),
T(printing),
T(casecmp),
T(casencmp),
T(buf_print),
T(qappend),
T(strhash),
T(strhash_sha1),
T(strhash_sha_256),
T(strhash_sha_512),
T(strhash_sha_512_256),
T(strparam),
T(strhextoul),
T(strlower),
T(strupper),
T(mknonce),
T(mknonce_uniqueness),
T(NULL)
};
|