Line | Source Code | Coverage |
---|
1 | /************************************************* | - |
2 | * Perl-Compatible Regular Expressions * | - |
3 | *************************************************/ | - |
4 | | - |
5 | /* PCRE is a library of functions to support regular expressions whose syntax | - |
6 | and semantics are as close as possible to those of the Perl 5 language. | - |
7 | | - |
8 | Written by Philip Hazel | - |
9 | Copyright (c) 1997-2012 University of Cambridge | - |
10 | | - |
11 | ----------------------------------------------------------------------------- | - |
12 | Redistribution and use in source and binary forms, with or without | - |
13 | modification, are permitted provided that the following conditions are met: | - |
14 | | - |
15 | * Redistributions of source code must retain the above copyright notice, | - |
16 | this list of conditions and the following disclaimer. | - |
17 | | - |
18 | * Redistributions in binary form must reproduce the above copyright | - |
19 | notice, this list of conditions and the following disclaimer in the | - |
20 | documentation and/or other materials provided with the distribution. | - |
21 | | - |
22 | * Neither the name of the University of Cambridge nor the names of its | - |
23 | contributors may be used to endorse or promote products derived from | - |
24 | this software without specific prior written permission. | - |
25 | | - |
26 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | - |
27 | AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | - |
28 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | - |
29 | ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | - |
30 | LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | - |
31 | CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | - |
32 | SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | - |
33 | INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | - |
34 | CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | - |
35 | ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | - |
36 | POSSIBILITY OF SUCH DAMAGE. | - |
37 | ----------------------------------------------------------------------------- | - |
38 | */ | - |
39 | | - |
40 | | - |
41 | /* This module contains an internal function that is used to match an extended | - |
42 | class. It is used by both pcre_exec() and pcre_def_exec(). */ | - |
43 | | - |
44 | | - |
45 | #ifdef PCRE_HAVE_CONFIG_H | - |
46 | #include "config.h" | - |
47 | #endif | - |
48 | | - |
49 | #include "pcre_internal.h" | - |
50 | | - |
51 | #ifndef COMPILE_PCRE8 | - |
52 | | - |
53 | /************************************************* | - |
54 | * Compare string utilities * | - |
55 | *************************************************/ | - |
56 | | - |
57 | /* The following two functions compares two strings. Basically an strcmp | - |
58 | for non 8 bit characters. | - |
59 | | - |
60 | Arguments: | - |
61 | str1 first string | - |
62 | str2 second string | - |
63 | | - |
64 | Returns: 0 if both string are equal (like strcmp), 1 otherwise | - |
65 | */ | - |
66 | | - |
67 | int | - |
68 | PRIV(strcmp_uc_uc)(const pcre_uchar *str1, const pcre_uchar *str2) | - |
69 | { | - |
70 | pcre_uchar c1; executed (the execution status of this line is deduced): pcre_uchar c1; | - |
71 | pcre_uchar c2; executed (the execution status of this line is deduced): pcre_uchar c2; | - |
72 | | - |
73 | while (*str1 != '\0' || *str2 != '\0') evaluated: *str1 != '\0' yes Evaluation Count:50 | yes Evaluation Count:6 |
partially evaluated: *str2 != '\0' no Evaluation Count:0 | yes Evaluation Count:6 |
| 0-50 |
74 | { | - |
75 | c1 = *str1++; executed (the execution status of this line is deduced): c1 = *str1++; | - |
76 | c2 = *str2++; executed (the execution status of this line is deduced): c2 = *str2++; | - |
77 | if (c1 != c2) evaluated: c1 != c2 yes Evaluation Count:11 | yes Evaluation Count:39 |
| 11-39 |
78 | return ((c1 > c2) << 1) - 1; executed: return ((c1 > c2) << 1) - 1; Execution Count:11 | 11 |
79 | } executed: } Execution Count:39 | 39 |
80 | /* Both length and characters must be equal. */ | - |
81 | return 0; executed: return 0; Execution Count:6 | 6 |
82 | } | - |
83 | | - |
84 | int | - |
85 | PRIV(strcmp_uc_c8)(const pcre_uchar *str1, const char *str2) | - |
86 | { | - |
87 | const pcre_uint8 *ustr2 = (pcre_uint8 *)str2; executed (the execution status of this line is deduced): const pcre_uint8 *ustr2 = (pcre_uint8 *)str2; | - |
88 | pcre_uchar c1; executed (the execution status of this line is deduced): pcre_uchar c1; | - |
89 | pcre_uchar c2; executed (the execution status of this line is deduced): pcre_uchar c2; | - |
90 | | - |
91 | while (*str1 != '\0' || *ustr2 != '\0') evaluated: *str1 != '\0' yes Evaluation Count:75 | yes Evaluation Count:6 |
partially evaluated: *ustr2 != '\0' no Evaluation Count:0 | yes Evaluation Count:6 |
| 0-75 |
92 | { | - |
93 | c1 = *str1++; executed (the execution status of this line is deduced): c1 = *str1++; | - |
94 | c2 = (pcre_uchar)*ustr2++; executed (the execution status of this line is deduced): c2 = (pcre_uchar)*ustr2++; | - |
95 | if (c1 != c2) evaluated: c1 != c2 yes Evaluation Count:43 | yes Evaluation Count:32 |
| 32-43 |
96 | return ((c1 > c2) << 1) - 1; executed: return ((c1 > c2) << 1) - 1; Execution Count:43 | 43 |
97 | } executed: } Execution Count:32 | 32 |
98 | /* Both length and characters must be equal. */ | - |
99 | return 0; executed: return 0; Execution Count:6 | 6 |
100 | } | - |
101 | | - |
102 | /* The following two functions compares two, fixed length | - |
103 | strings. Basically an strncmp for non 8 bit characters. | - |
104 | | - |
105 | Arguments: | - |
106 | str1 first string | - |
107 | str2 second string | - |
108 | num size of the string | - |
109 | | - |
110 | Returns: 0 if both string are equal (like strcmp), 1 otherwise | - |
111 | */ | - |
112 | | - |
113 | int | - |
114 | PRIV(strncmp_uc_uc)(const pcre_uchar *str1, const pcre_uchar *str2, unsigned int num) | - |
115 | { | - |
116 | pcre_uchar c1; never executed (the execution status of this line is deduced): pcre_uchar c1; | - |
117 | pcre_uchar c2; never executed (the execution status of this line is deduced): pcre_uchar c2; | - |
118 | | - |
119 | while (num-- > 0) never evaluated: num-- > 0 | 0 |
120 | { | - |
121 | c1 = *str1++; never executed (the execution status of this line is deduced): c1 = *str1++; | - |
122 | c2 = *str2++; never executed (the execution status of this line is deduced): c2 = *str2++; | - |
123 | if (c1 != c2) never evaluated: c1 != c2 | 0 |
124 | return ((c1 > c2) << 1) - 1; never executed: return ((c1 > c2) << 1) - 1; | 0 |
125 | } | 0 |
126 | /* Both length and characters must be equal. */ | - |
127 | return 0; never executed: return 0; | 0 |
128 | } | - |
129 | | - |
130 | int | - |
131 | PRIV(strncmp_uc_c8)(const pcre_uchar *str1, const char *str2, unsigned int num) | - |
132 | { | - |
133 | const pcre_uint8 *ustr2 = (pcre_uint8 *)str2; executed (the execution status of this line is deduced): const pcre_uint8 *ustr2 = (pcre_uint8 *)str2; | - |
134 | pcre_uchar c1; executed (the execution status of this line is deduced): pcre_uchar c1; | - |
135 | pcre_uchar c2; executed (the execution status of this line is deduced): pcre_uchar c2; | - |
136 | | - |
137 | while (num-- > 0) evaluated: num-- > 0 yes Evaluation Count:220 | yes Evaluation Count:3 |
| 3-220 |
138 | { | - |
139 | c1 = *str1++; executed (the execution status of this line is deduced): c1 = *str1++; | - |
140 | c2 = (pcre_uchar)*ustr2++; executed (the execution status of this line is deduced): c2 = (pcre_uchar)*ustr2++; | - |
141 | if (c1 != c2) evaluated: c1 != c2 yes Evaluation Count:195 | yes Evaluation Count:25 |
| 25-195 |
142 | return ((c1 > c2) << 1) - 1; executed: return ((c1 > c2) << 1) - 1; Execution Count:195 | 195 |
143 | } executed: } Execution Count:25 | 25 |
144 | /* Both length and characters must be equal. */ | - |
145 | return 0; executed: return 0; Execution Count:3 | 3 |
146 | } | - |
147 | | - |
148 | /* The following function returns with the length of | - |
149 | a zero terminated string. Basically an strlen for non 8 bit characters. | - |
150 | | - |
151 | Arguments: | - |
152 | str string | - |
153 | | - |
154 | Returns: length of the string | - |
155 | */ | - |
156 | | - |
157 | unsigned int | - |
158 | PRIV(strlen_uc)(const pcre_uchar *str) | - |
159 | { | - |
160 | unsigned int len = 0; executed (the execution status of this line is deduced): unsigned int len = 0; | - |
161 | while (*str++ != 0) evaluated: *str++ != 0 yes Evaluation Count:11287 | yes Evaluation Count:368 |
| 368-11287 |
162 | len++; executed: len++; Execution Count:11287 | 11287 |
163 | return len; executed: return len; Execution Count:368 | 368 |
164 | } | - |
165 | | - |
166 | #endif /* COMPILE_PCRE8 */ | - |
167 | | - |
168 | /* End of pcre_string_utils.c */ | - |
169 | | - |
| | |