test_memmem.c 7.97 KB
Newer Older
Pekka Pessi's avatar
Pekka Pessi committed
1 2 3 4 5 6 7
/*
 * This file is part of the Sofia-SIP package
 *
 * Copyright (C) 2005 Nokia Corporation.
 *
 * Contact: Pekka Pessi <pekka.pessi@nokia.com>
 *
8
 * This library is free software; you can redistribute it and/or
Pekka Pessi's avatar
Pekka Pessi committed
9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
 * modify it under the terms of the GNU Lesser General Public License
 * as published by the Free Software Foundation; either version 2.1 of
 * the License, or (at your option) any later version.
 *
 * This library 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
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
 * 02110-1301 USA
 *
 */

/**@ingroup test_memmem
 *
 * @CFILE test_memmem.c
 *
29
 * Torture tests for memmem() and strcasestr().
Pekka Pessi's avatar
Pekka Pessi committed
30 31 32 33 34 35 36 37 38 39 40 41 42 43
 *
 * @author Pekka Pessi <Pekka.Pessi@nokia.com>
 *
 * @date Created: Tue Aug 21 15:18:26 2001 ppessi
 */

#include "config.h"

#include <stddef.h>
#include <stdlib.h>
#include <limits.h>
#include <stdio.h>
#include <assert.h>

44
#if !HAVE_MEMMEM
Pekka Pessi's avatar
Pekka Pessi committed
45 46
void *memmem(const void *haystack, size_t haystacklen,
	     const void *needle, size_t needlelen);
47 48 49 50
#endif
#if !HAVE_STRCASESTR
char *strcasestr(const char *haystack, const char *needle);
#endif
Pekka Pessi's avatar
Pekka Pessi committed
51 52 53 54 55 56

#include <string.h>

static int test_flags = 0;
#define TSTFLAGS test_flags

57
#include <sofia-sip/tstdef.h>
Pekka Pessi's avatar
Pekka Pessi committed
58 59 60

char const name[] = "test_memmem";

61
void usage(int exitcode)
Pekka Pessi's avatar
Pekka Pessi committed
62
{
63 64
  fprintf(stderr, "usage: %s [-v] [-a]\n", name);
  exit(exitcode);
Pekka Pessi's avatar
Pekka Pessi committed
65 66 67 68 69
}

static int test_notfound(void);
static int test_pattern(void);

70 71
char const *null = NULL;

Pekka Pessi's avatar
Pekka Pessi committed
72 73
static int test_notfound(void)
{
74 75
  char const haystack[] = "abcabcabcabc";
  char const needle[] = "cab";
Pekka Pessi's avatar
Pekka Pessi committed
76 77 78
  char const *a;
  BEGIN();

79 80
  TEST_P(memmem(haystack, 12, needle, 3), haystack + 2);
  TEST_P(memmem(needle, 3, haystack, 12), NULL);
81

82 83 84 85 86
#if HAVE_MEMMEM
  if (memmem(haystack, 12, "", 0) == NULL) {
    fprintf(stderr, "test_memmem.c: "
	    "*** WARNING: system memmem() fails with empty needle ***\n");
  }
87
  else
88 89 90 91 92 93 94
#endif
  {
    TEST_P(memmem(haystack, 12, "", 0), haystack);
    TEST_P(memmem(haystack, 12, null, 0), haystack);
    TEST_P(memmem(haystack, 0, "", 0), haystack);
    TEST_P(memmem(haystack, 0, null, 0), haystack);
  }
Pekka Pessi's avatar
Pekka Pessi committed
95

96 97 98
  TEST_P(memmem(haystack + 2, 3, needle, 3), haystack + 2);
  TEST_P(memmem(haystack + 2, 2, needle, 3), NULL);
  TEST_P(memmem(a = "a\0bc", 4, "a\0bc", 4), a);
99
  TEST_P(memmem(a, 4, "\0bc", 3), a + 1);
Pekka Pessi's avatar
Pekka Pessi committed
100 101 102 103 104 105 106 107 108 109

  END();
}

static int test_pattern(void)
{
  BEGIN();
  END();
}

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
int test_strcasestr(void)
{
  BEGIN();

  {
    char const hs[] =
      "A case-folding string searching test consisting of a Long String";
    char const *s;

    s = strcasestr(hs, "sting");
    TEST_S(s, hs + 42);

    s = strcasestr(hs, "String");
    TEST_S(s, hs + 15);

    s = strcasestr(hs, "S");
    TEST_S(s, hs + 4);

    s = strcasestr(hs, "L");
    TEST_S(s, hs + 9);

    s = strcasestr(hs, "trings");
    TEST_1(s == NULL);

    s = strcasestr(hs, "String");
    TEST_S(s, hs + 15);

    s = strcasestr(hs, "StRiNg");
    TEST_S(s, hs + 15);

    s = strcasestr(hs, "OnG");
    TEST_S(s, hs + 54);

    /* Special cases */
    TEST_1(strcasestr(hs, "") == hs);
145 146
    TEST_1(strcasestr("", "ong") == NULL);
    TEST_1(strcasestr("", "OnG") == NULL);
147 148 149 150 151 152 153
    TEST_1(strcasestr("ong", hs) == NULL);
    TEST_1(strcasestr("OnG", hs) == NULL);
    TEST_1(strcasestr(hs, "Z") == NULL);
    TEST_1(strcasestr(hs, "z") == NULL);
  }

  {
154
    char const hs[] =
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
"A case-folding string searching test consisting of a Very Long String\n"

"Lorem ipsum dolor sit amet, consectetuer adipiscing elit. Integer felis. "
"Suspendisse potenti. Morbi malesuada erat eget enim. Sed dui lorem, aliquam "
"eu, lobortis eget, dapibus vitae, velit. Cras non purus. Suspendisse massa. "
"Curabitur gravida condimentum massa. Donec nunc magna, lacinia non, "
"pellentesque ac, laoreet vel, eros. Praesent lectus leo, vestibulum eu, "
"tempus eu, ullamcorper tristique, mi. Duis fringilla ultricies lacus. Ut "
"non pede. Donec id libero. Cum sociis natoque penatibus et magnis dis "
"parturient montes, nascetur ridiculus mus. Phasellus bibendum.\n"

"Vestibulum turpis. Nunc euismod. Maecenas venenatis, purus at pharetra "
"ultrices, orci orci blandit nisl, eget vulputate enim tortor sed nunc. "
"Proin sit amet elit. Donec ut justo. In quis nisi. Praesent posuere. "
"Maecenas porta. Curabitur pharetra. Class aptent taciti sociosqu ad litora "
"torquent per conubia nostra, per inceptos hymenaeos. Donec suscipit ligula. "
"Quisque facilisis ante eget mi. Nunc ac est.\n"

"Quisque in sapien eget justo aliquam laoreet. Nullam ultricies est id dolor. "
"Lorem ipsum dolor sit amet, consectetuer adipiscing elit. Suspendisse ante "
"velit, eleifend at, ullamcorper ut, rutrum et, ipsum. Mauris luctus, tellus "
"non elementum convallis, nunc ipsum hendrerit lectus, ut lacinia elit nulla "
"ac tellus. In sit amet velit. Maecenas non dolor. Sed commodo diam a pede. "
"Ut non pede. Vestibulum condimentum turpis vel lacus consectetuer dictum. "
"Nulla ullamcorper mi eu pede. Donec mauris tortor, facilisis vitae, "
"hendrerit nec, lobortis nec, eros. Nam sit amet mi. Ut pharetra, orci nec "
"porta convallis, lacus velit blandit sapien, luctus nonummy lacus dolor vel "
"sapien. Suspendisse placerat. Donec ante turpis, volutpat eu, hendrerit "
"vel, eleifend ac, arcu. Nulla facilisi. Sed faucibus facilisis lectus. "
"Aliquam congue justo nec dui.\n"

"Donec dapibus dui sed nisl. Proin congue. Curabitur placerat diam id eros. "
"Pellentesque vitae nulla. Quisque at lorem et dolor auctor consequat. Sed "
"sed tellus non nibh imperdiet venenatis. Integer ultrices dapibus nisi. "
"Aenean vehicula malesuada risus. Fusce egestas malesuada leo. In "
"ullamcorper pretium lorem. Vestibulum ante ipsum primis in faucibus orci "
"luctus et ultrices posuere cubilia Curae;\n"

"Phasellus congue. Morbi lectus arcu, mattis non, pulvinar et, condimentum "
"non, mi. Suspendisse vestibulum nunc eu neque. Sed rutrum felis aliquam "
"urna. Ut tincidunt orci vitae ipsum. Nullam eros. Quisque augue. Quisque "
"lacinia. Nunc ligula diam, nonummy a, porta in, tristique quis, leo. "
197
"Phasellus nunc nulla, fringilla vel, lacinia et, suscipit a, turpis. "
198 199 200 201 202 203
"Integer a est. Curabitur mauris lacus, vehicula sit amet, sodales vel, "
"iaculis vitae, massa. Nam diam est, ultrices vitae, varius et, tempor a, "
"leo. Class aptent taciti sociosqu ad litora torquent per conubia nostra, "
"per inceptos hymenaeos. Fusce felis nibh, ullamcorper non, malesuada eget, "
      "facilisis vel, purus.\n";

204
char const needle[] =
205 206 207 208 209 210 211
"Proin congue. Curabitur placerat diam id eros. "
"Pellentesque vitae nulla. Quisque at lorem et dolor auctor consequat. Sed "
"sed tellus non nibh imperdiet venenatis. Integer ultrices dapibus nisi. "
"Aenean vehicula malesuada risus. Fusce egestas malesuada leo. In "
"ullamcorper pretium lorem. Vestibulum ante ipsum primis in faucibus orci "
"luctus et ultrices posuere cubilia Curae;\n";

212
char const Needle[] =
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
"PROIN CONGUE. CURABITUR PLACERAT DIAM ID EROS. "
"PELLENTESQUE VITAE NULLA. QUISQUE AT LOREM ET DOLOR AUCTOR CONSEQUAT. SED "
"SED TELLUS NON NIBH IMPERDIET VENENATIS. INTEGER ULTRICES DAPIBUS NISI. "
"AENEAN VEHICULA MALESUADA RISUS. FUSCE EGESTAS MALESUADA LEO. IN "
"ULLAMCORPER PRETIUM LOREM. VESTIBULUM ANTE IPSUM PRIMIS IN FAUCIBUS ORCI "
"LUCTUS ET ULTRICES POSUERE CUBILIA CURAE;\n";

    char const *s;

    s = strcasestr(hs, needle);
    TEST_S(s, hs + 1920);

    s = strcasestr(hs, Needle);
    TEST_S(s, hs + 1920);
  }

  END();
}

int main(int argc, char *argv[])
{
  int retval = 0;
  int i;

  for (i = 1; argv[i]; i++) {
    if (strcmp(argv[i], "-v") == 0)
      test_flags |= tst_verbatim;
240 241
    else if (strcmp(argv[i], "-a") == 0)
      test_flags |= tst_abort;
242
    else
243
      usage(1);
244 245 246 247 248 249 250 251 252 253
  }

  retval |= test_notfound(); fflush(stdout);
  retval |= test_pattern(); fflush(stdout);
  retval |= test_strcasestr(); fflush(stdout);


  return retval;
}