summaryrefslogtreecommitdiff
path: root/graphics/asymptote/LspCpp/network/uri/detail/uri_parse.cpp
blob: 46dd1b0f267455aab6e326b779247e1457f90dbb (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
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
// Copyright 2016-2017 Glyn Matthews.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

#include "uri_parse.hpp"
#include <iterator>
#include <limits>
#include "grammar.hpp"
#include <network/uri/detail/uri_parts.hpp>

namespace network {
namespace detail {
namespace {
enum class uri_state {
  scheme,
  hier_part,
  query,
  fragment
};

enum class hier_part_state {
  first_slash,
  second_slash,
  authority,
  host,
  host_ipv6,
  port,
  path
};

bool validate_scheme(string_view::const_iterator &it,
                     string_view::const_iterator last) {
  if (it == last) {
    return false;
  }

  // The first character must be a letter
  if (!std::isalpha(*it, std::locale("C"))) {
    return false;
  }
  ++it;

  while (it != last) {
    if (*it == ':') {
      break;
    }
    else if (!isalnum(it, last) && !is_in(it, last, "+-.")) {
      return false;
    }
  }

  return true;
}

bool validate_user_info(string_view::const_iterator it,
                        string_view::const_iterator last) {
  while (it != last) {
    if (!is_unreserved(it, last) &&
        !is_pct_encoded(it, last) &&
        !is_sub_delim(it, last) &&
        !is_in(it, last, ":")) {
      return false;
    }
  }
  return true;
}

bool set_host_and_port(string_view::const_iterator first,
                       string_view::const_iterator last,
                       string_view::const_iterator last_colon,
                       uri_parts &parts) {
  if (first >= last_colon) {
    parts.hier_part.host = uri_part(first, last);
  }
  else {
    auto port_start = last_colon;
    ++port_start;
    parts.hier_part.host = uri_part(first, last_colon);
    if (!is_valid_port(port_start)) {
      return false;
    }
    parts.hier_part.port = uri_part(port_start, last);
  }
  return true;
}

bool validate_fragment(string_view::const_iterator &it,
                       string_view::const_iterator last) {
  while (it != last) {
    if (!is_pchar(it, last) && !is_in(it, last, "?/")) {
      return false;
    }
  }
  return true;
}
} // namespace

bool parse(string_view::const_iterator &it, string_view::const_iterator last,
           uri_parts &parts) {
  auto state = uri_state::scheme;

  auto first = it;

  if (it == last) {
    return false;
  }

  if (validate_scheme(it, last)) {
    parts.scheme = uri_part(first, it);
    // move past the scheme delimiter
    ++it;
    state = uri_state::hier_part;
  }
  else {
    return false;
  }

  // Hierarchical part
  auto hp_state = hier_part_state::first_slash;
  // this is used by the user_info/port
  auto last_colon = first;
  while (it != last) {
    if (hp_state == hier_part_state::first_slash) {
      if (*it == '/') {
        hp_state = hier_part_state::second_slash;
        // set the first iterator in case the second slash is not forthcoming
        first = it;
        ++it;
        continue;
      }
      else {
        hp_state = hier_part_state::path;
        first = it;
      }
    }
    else if (hp_state == hier_part_state::second_slash) {
      if (*it == '/') {
        hp_state = hier_part_state::authority;
        ++it;
        first = it;
        continue;
      }
      else {
        // it's a valid URI, and this is the beginning of the path
        hp_state = hier_part_state::path;
      }
    }
    else if (hp_state == hier_part_state::authority) {
      if (is_in(first, last, "@:")) {
        return false;
      }

      // reset the last colon
      if (first == it) {
        last_colon = first;
      }

      if (*it == '@') {
        if (!validate_user_info(first, it)) {
          return false;
        }
        parts.hier_part.user_info = uri_part(first, it);
        hp_state = hier_part_state::host;
        ++it;
        first = it;

        if (*first == '[') {
          // this is an IPv6 address
          hp_state = hier_part_state::host_ipv6;
        }

        continue;
      }
      else if (*it == '[') {
        // this is an IPv6 address
        hp_state = hier_part_state::host_ipv6;
        first = it;
        continue;
      }
      else if (*it == ':') {
        last_colon = it;
      }
      else if (*it == '/') {
        // we skipped right past the host and port, and are at the path.
        if (!set_host_and_port(first, it, last_colon, parts)) {
          return false;
        }
        hp_state = hier_part_state::path;
        first = it;
        continue;
      }
      else if (*it == '?') {
        // the path is empty, but valid, and the next part is the query
        if (!set_host_and_port(first, it, last_colon, parts)) {
          return false;
        }
        parts.hier_part.path = uri_part(it, it);
        state = uri_state::query;
        ++it;
        first = it;
        break;
      }
      else if (*it == '#') {
        // the path is empty, but valid, and the next part is the fragment
        if (!set_host_and_port(first, it, last_colon, parts)) {
          return false;
        }
        parts.hier_part.path = uri_part(it, it);
        state = uri_state::fragment;
        ++it;
        first = it;
        break;
      }
    }
    else if (hp_state == hier_part_state::host) {
      if (*first == ':') {
        return false;
      }

      if (*it == ':') {
        parts.hier_part.host = uri_part(first, it);
        hp_state = hier_part_state::port;
        ++it;
        first = it;
        continue;
      }
      else if (*it == '/') {
        parts.hier_part.host = uri_part(first, it);
        hp_state = hier_part_state::path;
        first = it;
        continue;
      }
      else if (*it == '?') {
        // the path is empty, but valid, and the next part is the query
        parts.hier_part.host = uri_part(first, it);
        parts.hier_part.path = uri_part(it, it);
        state = uri_state::query;
        ++it;
        first = it;
        break;
      }
      else if (*it == '#') {
        // the path is empty, but valid, and the next part is the fragment
        parts.hier_part.host = uri_part(first, it);
        parts.hier_part.path = uri_part(it, it);
        state = uri_state::fragment;
        ++it;
        first = it;
        break;
      }
    }
    else if (hp_state == hier_part_state::host_ipv6) {
      if (*first != '[') {
        return false;
      }

      if (*it == ']') {
        ++it;
        // Then test if the next part is a host, part, or the end of the file
        if (it == last) {
          break;
        }
        else if (*it == ':') {
          parts.hier_part.host = uri_part(first, it);
          hp_state = hier_part_state::port;
          ++it;
          first = it;
        }
        else if (*it == '/') {
          parts.hier_part.host = uri_part(first, it);
          hp_state = hier_part_state::path;
          first = it;
        }
        else if (*it == '?') {
          parts.hier_part.host = uri_part(first, it);
          parts.hier_part.path = uri_part(it, it);
          state = uri_state::query;
          ++it;
          first = it;
          break;
        }
        else if (*it == '#') {
          parts.hier_part.host = uri_part(first, it);
          parts.hier_part.path = uri_part(it, it);
          state = uri_state::fragment;
          ++it;
          first = it;
          break;
        }
        continue;
      }
    }
    else if (hp_state == hier_part_state::port) {
      if (*first == '/') {
        // the port is empty, but valid
        if (!is_valid_port(first)) {
          return false;
        }
        parts.hier_part.port = uri_part(first, it);

        // the port isn't set, but the path is
        hp_state = hier_part_state::path;
        continue;
      }

      if (*it == '/') {
        if (!is_valid_port(first)) {
          return false;
        }
        parts.hier_part.port = uri_part(first, it);
        hp_state = hier_part_state::path;
        first = it;
        continue;
      }
      else if (!isdigit(it, last)) {
        return false;
      }
      continue;
    }
    else if (hp_state == hier_part_state::path) {
      if (*it == '?') {
        parts.hier_part.path = uri_part(first, it);
        // move past the query delimiter
        ++it;
        first = it;
        state = uri_state::query;
        break;
      }
      else if (*it == '#') {
        parts.hier_part.path = uri_part(first, it);
        // move past the fragment delimiter
        ++it;
        first = it;
        state = uri_state::fragment;
        break;
      }

      if (!is_pchar(it, last) && !is_in(it, last, "/")) {
        return false;
      }
      else {
        continue;
      }
    }

    ++it;
  }

  if (state == uri_state::query) {
    while (it != last) {
      if (!is_pchar(it, last) && !is_in(it, last, "?/")) {
        // If this is a fragment, keep going
        if (*it == '#') {
          parts.query = uri_part(first, it);
          // move past the fragment delimiter
          ++it;
          first = it;
          state = uri_state::fragment;
          break;
        }
        else {
          return false;
        }
      }
    }
  }

  if (state == uri_state::fragment) {
    if (!validate_fragment(it, last)) {
      return false;
    }
  }

  // we're done!
  if (state == uri_state::hier_part) {
    if (hp_state == hier_part_state::authority) {
      if (first == last) {
        return false;
      }

      if (!set_host_and_port(first, last, last_colon, parts)) {
        return false;
      }
      parts.hier_part.path = uri_part(last, last);
    }
    else if (hp_state == hier_part_state::host) {
      if (first == last) {
        return false;
      }

      if (!set_host_and_port(first, last, last_colon, parts)) {
        return false;
      }
      parts.hier_part.path = uri_part(last, last);
    }
    else if (hp_state == hier_part_state::host_ipv6) {
      if (!set_host_and_port(first, last, last_colon, parts)) {
        return false;
      }
      parts.hier_part.path = uri_part(last, last);
    }
    else if (hp_state == hier_part_state::port) {
      if (!is_valid_port(first)) {
        return false;
      }
      parts.hier_part.port = uri_part(first, last);
      parts.hier_part.path = uri_part(last, last);
    }
    else if (hp_state == hier_part_state::path) {
      parts.hier_part.path = uri_part(first, last);
    }
  }
  else if (state == uri_state::query) {
    parts.query = uri_part(first, last);
  }
  else if (state == uri_state::fragment) {
    parts.fragment = uri_part(first, last);
  }

  return true;
}
}  // namespace detail
}  // namespace network