summaryrefslogtreecommitdiff
path: root/libxsd/xsd/cxx/xml/char-utf8.txx
blob: a6511beb4c9df9158f861d117ba54f8ae721a19b (plain)
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
// file      : xsd/cxx/xml/char-utf8.txx
// copyright : Copyright (c) 2005-2014 Code Synthesis Tools CC
// license   : GNU GPL v2 + exceptions; see accompanying LICENSE file

#include <xsd/cxx/config.hxx> // XSD_CXX11

#ifdef XSD_CXX11
#  include <memory> // std::unique_ptr
#else
#  include <xsd/cxx/auto-array.hxx>
#endif

namespace xsd
{
  namespace cxx
  {
    namespace xml
    {
      template <typename C>
      const unsigned char char_utf8_transcoder<C>::first_byte_mask_[5] =
      {
        0x00, 0x00, 0xC0, 0xE0, 0xF0
      };

      template <typename C>
      std::basic_string<C> char_utf8_transcoder<C>::
      to (const XMLCh* s, std::size_t len)
      {
        const XMLCh* end (s + len);

        // Find what the resulting buffer size will be.
        //
        std::size_t rl (0);
        unsigned int u (0); // Four byte UCS-4 char.

        bool valid (true);
        const XMLCh* p (s);

        for (; p < end; ++p)
        {
          XMLCh x (*p);

          if (x < 0xD800 || x > 0xDBFF)
            u = x;
          else
          {
            // Make sure we have one more char and it has a valid
            // value for the second char in a surrogate pair.
            //
            if (++p == end || !((*p >= 0xDC00) && (*p <= 0xDFFF)))
            {
              valid = false;
              break;
            }

            u = ((x - 0xD800) << 10) + (*p - 0xDC00) + 0x10000;
          }

          if (u < 0x80)
            rl++;
          else if (u < 0x800)
            rl += 2;
          else if (u < 0x10000)
            rl += 3;
          else if (u < 0x110000)
            rl += 4;
          else
          {
            valid = false;
            break;
          }
        }

        if (!valid)
          throw invalid_utf16_string ();

        std::basic_string<C> r;
        r.reserve (rl + 1);
        r.resize (rl);
        C* rs (const_cast<C*> (r.c_str ()));

        std::size_t i (0);
        unsigned int count (0);

        p = s;

        // Tight first loop for the common case.
        //
        for (; p < end && *p < 0x80; ++p)
          rs[i++] = C (*p);

        for (; p < end; ++p)
        {
          XMLCh x (*p);

          if ((x >= 0xD800) && (x <= 0xDBFF))
          {
            u = ((x - 0xD800) << 10) + (*++p - 0xDC00) + 0x10000;
          }
          else
            u = x;

          if (u < 0x80)
            count = 1;
          else if (u < 0x800)
            count = 2;
          else if (u < 0x10000)
            count = 3;
          else if (u < 0x110000)
            count = 4;

          switch(count)
          {
          case 4:
            {
              rs[i + 3] = C ((u | 0x80UL) & 0xBFUL);
              u >>= 6;
            }
          case 3:
            {
              rs[i + 2] = C ((u | 0x80UL) & 0xBFUL);
              u >>= 6;
            }
          case 2:
            {
              rs[i + 1] = C ((u | 0x80UL) & 0xBFUL);
              u >>= 6;
            }
          case 1:
            {
              rs[i] = C (u | first_byte_mask_[count]);
            }
          }

          i += count;
        }

        return r;
      }

      template <typename C>
      XMLCh* char_utf8_transcoder<C>::
      from (const C* s, std::size_t len)
      {
        bool valid (true);
        const C* end (s + len);

        // Find what the resulting buffer size will be.
        //
        std::size_t rl (0);
        unsigned int count (0);

        for (const C* p (s); p < end; ++p)
        {
          unsigned char c (*p);

          if (c < 0x80)
          {
            // Fast path.
            //
            rl += 1;
            continue;
          }
          else if ((c >> 5) == 0x06)
            count = 2;
          else if ((c >> 4) == 0x0E)
            count = 3;
          else if ((c >> 3) == 0x1E)
            count = 4;
          else
          {
            valid = false;
            break;
          }

          p += count - 1; // One will be added in the for loop

          if (p + 1 > end)
          {
            valid = false;
            break;
          }

          // BMP is represented by up to 3 code points in UTF-8.
          //
          rl += count > 3 ? 2 : 1;
        }

        if (!valid)
          throw invalid_utf8_string ();

#ifdef XSD_CXX11
        std::unique_ptr<XMLCh[]> r (
#else
        auto_array<XMLCh> r (
#endif
          new XMLCh[rl + 1]);
        XMLCh* ir (r.get ());

        unsigned int u (0); // Four byte UCS-4 char.

        for (const C* p (s); p < end; ++p)
        {
          unsigned char c (*p);

          if (c < 0x80)
          {
            // Fast path.
            //
            *ir++ = static_cast<XMLCh> (c);
            continue;
          }
          else if ((c >> 5) == 0x06)
          {
            // UTF-8:   110yyyyy 10zzzzzz
            // Unicode: 00000yyy yyzzzzzz
            //
            u = (c & 0x1F) << 6;

            c = *++p;
            if ((c >> 6) != 2)
            {
              valid = false;
              break;
            }
            u |= c & 0x3F;
          }
          else if ((c >> 4) == 0x0E)
          {
            // UTF-8:   1110xxxx 10yyyyyy 10zzzzzz
            // Unicode: xxxxyyyy yyzzzzzz
            //
            u = (c & 0x0F) << 6;

            c = *++p;
            if ((c >> 6) != 2)
            {
              valid = false;
              break;
            }
            u = (u | (c & 0x3F)) << 6;

            c = *++p;
            if ((c >> 6) != 2)
            {
              valid = false;
              break;
            }
            u |= c & 0x3F;
          }
          else if ((c >> 3) == 0x1E)
          {
            // UTF-8:   000wwwxx xxxxyyyy yyzzzzzz
            // Unicode: 11110www 10xxxxxx 10yyyyyy 10zzzzzz
            //
            u = (c & 0x07) << 6;

            c = *++p;
            if ((c >> 6) != 2)
            {
              valid = false;
              break;
            }
            u = (u | (c & 0x3F)) << 6;

            c = *++p;
            if ((c >> 6) != 2)
            {
              valid = false;
              break;
            }
            u = (u | (c & 0x3F)) << 6;

            c = *++p;
            if ((c >> 6) != 2)
            {
              valid = false;
              break;
            }
            u |= c & 0x3F;
          }

          if (u & 0xFFFF0000)
          {
            // Surrogate pair.
            //
            *ir++ = static_cast<XMLCh> (((u - 0x10000) >> 10) + 0xD800);
            *ir++ = static_cast<XMLCh> ((u & 0x3FF) + 0xDC00);
          }
          else
            *ir++ = static_cast<XMLCh> (u);
        }

        if (!valid)
          throw invalid_utf8_string ();

        *ir = XMLCh (0);

        return r.release ();
      }
    }
  }
}