blob: 31e4a9164d5d4d945f05805bacdd0f18693a3c15 [file] [log] [blame]
Damien George04b91472014-05-03 23:27:38 +01001/*
2 * This file is part of the Micro Python project, http://micropython.org/
3 *
4 * The MIT License (MIT)
5 *
6 * Copyright (c) 2013, 2014 Damien P. George
7 *
8 * Permission is hereby granted, free of charge, to any person obtaining a copy
9 * of this software and associated documentation files (the "Software"), to deal
10 * in the Software without restriction, including without limitation the rights
11 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
12 * copies of the Software, and to permit persons to whom the Software is
13 * furnished to do so, subject to the following conditions:
14 *
15 * The above copyright notice and this permission notice shall be included in
16 * all copies or substantial portions of the Software.
17 *
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
19 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
20 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
21 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
22 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
23 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
24 * THE SOFTWARE.
25 */
26
Damien George51dfcb42015-01-01 20:27:54 +000027#include "py/parsenum.h"
Damien George06201ff2014-03-01 19:50:50 +000028
29// find real radix base, and strip preceding '0x', '0o' and '0b'
30// puts base in *base, and returns number of bytes to skip the prefix
Damien George38161822014-07-03 14:13:33 +010031mp_uint_t mp_parse_num_base(const char *str, mp_uint_t len, mp_uint_t *base) {
Paul Sokolovsky02946612014-06-14 17:56:44 +030032 const byte *p = (const byte*)str;
Damien George7d414a12015-02-08 01:57:40 +000033 if (len <= 1) {
34 goto no_prefix;
35 }
Damien George38161822014-07-03 14:13:33 +010036 unichar c = *(p++);
Damien George06201ff2014-03-01 19:50:50 +000037 if ((*base == 0 || *base == 16) && c == '0') {
38 c = *(p++);
39 if ((c | 32) == 'x') {
40 *base = 16;
41 } else if (*base == 0 && (c | 32) == 'o') {
42 *base = 8;
43 } else if (*base == 0 && (c | 32) == 'b') {
44 *base = 2;
45 } else {
Paul Sokolovsky6e8085b2014-05-10 04:42:56 +030046 if (*base == 0) {
47 *base = 10;
48 }
Damien George06201ff2014-03-01 19:50:50 +000049 p -= 2;
50 }
51 } else if (*base == 8 && c == '0') {
52 c = *(p++);
53 if ((c | 32) != 'o') {
54 p -= 2;
55 }
56 } else if (*base == 2 && c == '0') {
57 c = *(p++);
58 if ((c | 32) != 'b') {
59 p -= 2;
60 }
61 } else {
Damien George7d414a12015-02-08 01:57:40 +000062 p--;
63 no_prefix:
Damien George06201ff2014-03-01 19:50:50 +000064 if (*base == 0) {
65 *base = 10;
66 }
Damien George06201ff2014-03-01 19:50:50 +000067 }
Paul Sokolovsky02946612014-06-14 17:56:44 +030068 return p - (const byte*)str;
Damien George06201ff2014-03-01 19:50:50 +000069}