|
sl@0
|
1 |
/*
|
|
sl@0
|
2 |
* LIBOIL - Library of Optimized Inner Loops
|
|
sl@0
|
3 |
* Copyright (c) 2004 David A. Schleef <ds@schleef.org>
|
|
sl@0
|
4 |
* All rights reserved.
|
|
sl@0
|
5 |
*
|
|
sl@0
|
6 |
* Redistribution and use in source and binary forms, with or without
|
|
sl@0
|
7 |
* modification, are permitted provided that the following conditions
|
|
sl@0
|
8 |
* are met:
|
|
sl@0
|
9 |
* 1. Redistributions of source code must retain the above copyright
|
|
sl@0
|
10 |
* notice, this list of conditions and the following disclaimer.
|
|
sl@0
|
11 |
* 2. Redistributions in binary form must reproduce the above copyright
|
|
sl@0
|
12 |
* notice, this list of conditions and the following disclaimer in the
|
|
sl@0
|
13 |
* documentation and/or other materials provided with the distribution.
|
|
sl@0
|
14 |
*
|
|
sl@0
|
15 |
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
sl@0
|
16 |
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
sl@0
|
17 |
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
sl@0
|
18 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
|
|
sl@0
|
19 |
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
sl@0
|
20 |
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
sl@0
|
21 |
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
sl@0
|
22 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
sl@0
|
23 |
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
|
|
sl@0
|
24 |
* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
sl@0
|
25 |
* POSSIBILITY OF SUCH DAMAGE.
|
|
sl@0
|
26 |
*/
|
|
sl@0
|
27 |
|
|
sl@0
|
28 |
#ifdef HAVE_CONFIG_H
|
|
sl@0
|
29 |
#include "config.h"
|
|
sl@0
|
30 |
#endif
|
|
sl@0
|
31 |
|
|
sl@0
|
32 |
#include <liboil/liboil.h>
|
|
sl@0
|
33 |
#include <liboil/liboiltest.h>
|
|
sl@0
|
34 |
#include <liboil/liboilrandom.h>
|
|
sl@0
|
35 |
#include "liboil/utf8/utf8.h"
|
|
sl@0
|
36 |
|
|
sl@0
|
37 |
|
|
sl@0
|
38 |
/*
|
|
sl@0
|
39 |
* Little explanation:
|
|
sl@0
|
40 |
* 0x00-0x7f ASCII, one byte character
|
|
sl@0
|
41 |
* 0x80-0xbf continuation byte, not a valid start byte
|
|
sl@0
|
42 |
* 0xc0-0xdf 2-byte character
|
|
sl@0
|
43 |
* 0xe0-0xef 3-byte character
|
|
sl@0
|
44 |
* 0xf0-0xf7 4-byte character
|
|
sl@0
|
45 |
* 0xf8-0xff reserved (illegal at the present time)
|
|
sl@0
|
46 |
*/
|
|
sl@0
|
47 |
static void
|
|
sl@0
|
48 |
utf8_validate_test (OilTest *test)
|
|
sl@0
|
49 |
{
|
|
sl@0
|
50 |
int i;
|
|
sl@0
|
51 |
int n = test->n;
|
|
sl@0
|
52 |
uint8_t *ptr = oil_test_get_source_data (test, OIL_ARG_SRC1);
|
|
sl@0
|
53 |
int x;
|
|
sl@0
|
54 |
int extra_chars = 0;
|
|
sl@0
|
55 |
|
|
sl@0
|
56 |
for (i=0;i<n;i++){
|
|
sl@0
|
57 |
if (i >= n-16) {
|
|
sl@0
|
58 |
/* if it's close to the end, we'll randomly drop in a bad
|
|
sl@0
|
59 |
* byte from either the 0x80-0xbf or 0xf8-0xff segments */
|
|
sl@0
|
60 |
x = oil_rand_u8();
|
|
sl@0
|
61 |
if (x < 16) {
|
|
sl@0
|
62 |
x = oil_rand_u8();
|
|
sl@0
|
63 |
if (extra_chars>0) {
|
|
sl@0
|
64 |
/* this might not actually be a bad char */
|
|
sl@0
|
65 |
ptr[i] = x;
|
|
sl@0
|
66 |
extra_chars--;
|
|
sl@0
|
67 |
} else {
|
|
sl@0
|
68 |
if (x & 0x80) {
|
|
sl@0
|
69 |
ptr[i] = 0x80 | (x&0x3f);
|
|
sl@0
|
70 |
} else {
|
|
sl@0
|
71 |
ptr[i] = 0xf8 | (x&0x07);
|
|
sl@0
|
72 |
}
|
|
sl@0
|
73 |
}
|
|
sl@0
|
74 |
continue;
|
|
sl@0
|
75 |
}
|
|
sl@0
|
76 |
}
|
|
sl@0
|
77 |
if (extra_chars > 0) {
|
|
sl@0
|
78 |
ptr[i] = 0x80 | (oil_rand_u8() & 0x3f);
|
|
sl@0
|
79 |
extra_chars--;
|
|
sl@0
|
80 |
} else {
|
|
sl@0
|
81 |
/* otherwise, we'll do a low probability of a multibyte char */
|
|
sl@0
|
82 |
x = oil_rand_u8() & 0xf;
|
|
sl@0
|
83 |
if (x == 0) {
|
|
sl@0
|
84 |
ptr[i] = 0xc0 | (oil_rand_u8() & 0x1f);
|
|
sl@0
|
85 |
extra_chars = 1;
|
|
sl@0
|
86 |
} else if (x == 1) {
|
|
sl@0
|
87 |
ptr[i] = 0xe0 | (oil_rand_u8() & 0x0f);
|
|
sl@0
|
88 |
extra_chars = 2;
|
|
sl@0
|
89 |
} else if (x == 2) {
|
|
sl@0
|
90 |
ptr[i] = 0xf0 | (oil_rand_u8() & 0x07);
|
|
sl@0
|
91 |
extra_chars = 3;
|
|
sl@0
|
92 |
} else {
|
|
sl@0
|
93 |
ptr[i] = oil_rand_u8() & 0x7f;
|
|
sl@0
|
94 |
}
|
|
sl@0
|
95 |
}
|
|
sl@0
|
96 |
}
|
|
sl@0
|
97 |
|
|
sl@0
|
98 |
}
|
|
sl@0
|
99 |
|
|
sl@0
|
100 |
/**
|
|
sl@0
|
101 |
* oil_utf8_validate:
|
|
sl@0
|
102 |
* @d_1:
|
|
sl@0
|
103 |
* @s:
|
|
sl@0
|
104 |
* @n:
|
|
sl@0
|
105 |
*
|
|
sl@0
|
106 |
* Checks @s for valid UTF-8 characters. If the entire @s array
|
|
sl@0
|
107 |
* represents valid UTF-8 characters, @n is written to @d_1.
|
|
sl@0
|
108 |
* Otherwise, the index in the array of the beginning of the first
|
|
sl@0
|
109 |
* invalid UTF-8 character is written to @d_1.
|
|
sl@0
|
110 |
*/
|
|
sl@0
|
111 |
OIL_DEFINE_CLASS_FULL (utf8_validate, "int32_t *d_1, uint8_t *s, int n",
|
|
sl@0
|
112 |
utf8_validate_test);
|
|
sl@0
|
113 |
|
|
sl@0
|
114 |
|
|
sl@0
|
115 |
static void
|
|
sl@0
|
116 |
utf8_validate_ref (int32_t *d_1, uint8_t *s, int n)
|
|
sl@0
|
117 |
{
|
|
sl@0
|
118 |
int i;
|
|
sl@0
|
119 |
int extra_bytes;
|
|
sl@0
|
120 |
int mask;
|
|
sl@0
|
121 |
|
|
sl@0
|
122 |
for(i=0;i<n;i++){
|
|
sl@0
|
123 |
extra_bytes = 0;
|
|
sl@0
|
124 |
if (s[i] < 128) continue;
|
|
sl@0
|
125 |
if ((s[i] & 0xe0) == 0xc0) {
|
|
sl@0
|
126 |
extra_bytes = 1;
|
|
sl@0
|
127 |
mask = 0x7f;
|
|
sl@0
|
128 |
} else if ((s[i] & 0xf0) == 0xe0) {
|
|
sl@0
|
129 |
extra_bytes = 2;
|
|
sl@0
|
130 |
mask = 0x1f;
|
|
sl@0
|
131 |
} else if ((s[i] & 0xf8) == 0xf0) {
|
|
sl@0
|
132 |
extra_bytes = 3;
|
|
sl@0
|
133 |
mask = 0x0f;
|
|
sl@0
|
134 |
} else {
|
|
sl@0
|
135 |
goto error;
|
|
sl@0
|
136 |
}
|
|
sl@0
|
137 |
if (i + extra_bytes >= n) goto error;
|
|
sl@0
|
138 |
while(extra_bytes--) {
|
|
sl@0
|
139 |
i++;
|
|
sl@0
|
140 |
if ((s[i] & 0xc0) != 0x80) goto error;
|
|
sl@0
|
141 |
}
|
|
sl@0
|
142 |
}
|
|
sl@0
|
143 |
|
|
sl@0
|
144 |
error:
|
|
sl@0
|
145 |
d_1[0] = i;
|
|
sl@0
|
146 |
}
|
|
sl@0
|
147 |
|
|
sl@0
|
148 |
OIL_DEFINE_IMPL_REF (utf8_validate_ref, utf8_validate);
|
|
sl@0
|
149 |
|
|
sl@0
|
150 |
|
|
sl@0
|
151 |
|