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
|
/* $Id: strstr_P.c,v 1.1 2007/03/01 13:12:09 dmix Exp $ */
#ifndef __AVR__
# include <stdio.h>
# define strstr_P strstr
#endif
#include <stdlib.h>
#include <string.h>
#include "progmem.h"
void Check (int line, const char *s1, const char *s2, int expect)
{
char t1[200];
char *p;
if (strlen_P(s1) > sizeof(t1) - 1)
exit (1);
strcpy_P (t1, s1);
p = strstr_P (t1, s2);
if ((!p && expect == -1) || (p == t1 + expect))
return;
#if !defined(__AVR__)
printf ("\nLine %d: expect: %d, result: %d\n",
line, expect, (p ? p - t1 : -1));
if (line > 255) line = 255;
#elif defined(DEBUG)
exit (p ? p - t1 : -1);
#endif
exit (line);
}
#define CHECK(s1, s2, expect) do { \
Check (__LINE__, PSTR(s1), PSTR(s2), expect); \
} while (0)
int main ()
{
/* Empty 'needle'. */
CHECK ("", "", 0);
CHECK ("12345", "", 0);
/* bug #19135 */
CHECK ("ababac", "abac", 2);
/* 'needle' of 1 byte long */
CHECK ("", "a", -1);
CHECK ("b", "a", -1);
CHECK ("a", "a", 0);
CHECK ("abcbef", "a", 0);
CHECK (".a", "a", 1);
CHECK (".a.", "a", 1);
CHECK ("ABCDEFGH", "H", 7);
/* 'needle' of 2 bytes long */
CHECK ("", "12", -1);
CHECK ("13", "12", -1);
CHECK ("32", "12", -1);
CHECK ("12", "12", 0);
CHECK ("123", "12", 0);
CHECK ("012", "12", 1);
CHECK ("01200", "12", 1);
/* partially mathing */
CHECK ("a_ab_abc_abcd_abcde", "abcdef", -1);
CHECK ("a_ab_abc_abcd_abcde_abcdef", "abcdef", 20);
CHECK ("aababcabcdabcde", "abcdef", -1);
CHECK ("aababcabcdabcdeabcdef", "abcdef", 15);
/* repeated chars */
CHECK ("abaabaaabaaaab", "aaaaab", -1);
CHECK ("abaabaaabaaaabaaaaab", "aaaaab", 14);
/* A first match is returned. */
CHECK ("_foo_foo", "foo", 1);
/* Case is importent. */
CHECK ("A", "a", -1);
return 0;
}
|
