/src/botan/src/lib/utils/scan_name.cpp
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * SCAN Name Abstraction |
3 | | * (C) 2008-2009,2015 Jack Lloyd |
4 | | * |
5 | | * Botan is released under the Simplified BSD License (see license.txt) |
6 | | */ |
7 | | |
8 | | #include <botan/internal/scan_name.h> |
9 | | #include <botan/internal/parsing.h> |
10 | | #include <botan/exceptn.h> |
11 | | |
12 | | namespace Botan { |
13 | | |
14 | | namespace { |
15 | | |
16 | | std::string make_arg(const std::vector<std::pair<size_t, std::string>>& name, size_t start) |
17 | 49.6k | { |
18 | 49.6k | std::string output = name[start].second; |
19 | 49.6k | size_t level = name[start].first; |
20 | | |
21 | 49.6k | size_t paren_depth = 0; |
22 | | |
23 | 49.6k | for(size_t i = start + 1; i != name.size(); ++i) |
24 | 506 | { |
25 | 506 | if(name[i].first <= name[start].first) |
26 | 506 | break; |
27 | | |
28 | 0 | if(name[i].first > level) |
29 | 0 | { |
30 | 0 | output += "(" + name[i].second; |
31 | 0 | ++paren_depth; |
32 | 0 | } |
33 | 0 | else if(name[i].first < level) |
34 | 0 | { |
35 | 0 | for (size_t j = name[i].first; j < level; j++) { |
36 | 0 | output += ")"; |
37 | 0 | --paren_depth; |
38 | 0 | } |
39 | 0 | output += "," + name[i].second; |
40 | 0 | } |
41 | 0 | else |
42 | 0 | { |
43 | 0 | if(output[output.size() - 1] != '(') |
44 | 0 | output += ","; |
45 | 0 | output += name[i].second; |
46 | 0 | } |
47 | |
|
48 | 0 | level = name[i].first; |
49 | 0 | } |
50 | | |
51 | 49.6k | for(size_t i = 0; i != paren_depth; ++i) |
52 | 0 | output += ")"; |
53 | | |
54 | 49.6k | return output; |
55 | 49.6k | } |
56 | | |
57 | | } |
58 | | |
59 | | SCAN_Name::SCAN_Name(const char* algo_spec) : SCAN_Name(std::string(algo_spec)) |
60 | 0 | { |
61 | 0 | } |
62 | | |
63 | | SCAN_Name::SCAN_Name(std::string algo_spec) : m_orig_algo_spec(algo_spec), m_alg_name(), m_args(), m_mode_info() |
64 | 49.3k | { |
65 | 49.3k | if(algo_spec.size() == 0) |
66 | 0 | throw Invalid_Argument("Expected algorithm name, got empty string"); |
67 | | |
68 | 49.3k | std::vector<std::pair<size_t, std::string>> name; |
69 | 49.3k | size_t level = 0; |
70 | 49.3k | std::pair<size_t, std::string> accum = std::make_pair(level, ""); |
71 | | |
72 | 49.3k | const std::string decoding_error = "Bad SCAN name '" + algo_spec + "': "; |
73 | | |
74 | 800k | for(size_t i = 0; i != algo_spec.size(); ++i) |
75 | 750k | { |
76 | 750k | char c = algo_spec[i]; |
77 | | |
78 | 750k | if(c == '/' || c == ',' || c == '(' || c == ')') |
79 | 98.6k | { |
80 | 98.6k | if(c == '(') |
81 | 49.0k | ++level; |
82 | 49.6k | else if(c == ')') |
83 | 49.0k | { |
84 | 49.0k | if(level == 0) |
85 | 0 | throw Decoding_Error(decoding_error + "Mismatched parens"); |
86 | 49.0k | --level; |
87 | 49.0k | } |
88 | | |
89 | 98.6k | if(c == '/' && level > 0) |
90 | 0 | accum.second.push_back(c); |
91 | 98.6k | else |
92 | 98.6k | { |
93 | 98.6k | if(accum.second != "") |
94 | 98.6k | name.push_back(accum); |
95 | 98.6k | accum = std::make_pair(level, ""); |
96 | 98.6k | } |
97 | 98.6k | } |
98 | 652k | else |
99 | 652k | accum.second.push_back(c); |
100 | 750k | } |
101 | | |
102 | 49.3k | if(accum.second != "") |
103 | 231 | name.push_back(accum); |
104 | | |
105 | 49.3k | if(level != 0) |
106 | 0 | throw Decoding_Error(decoding_error + "Missing close paren"); |
107 | | |
108 | 49.3k | if(name.size() == 0) |
109 | 0 | throw Decoding_Error(decoding_error + "Empty name"); |
110 | | |
111 | 49.3k | m_alg_name = name[0].second; |
112 | | |
113 | 49.3k | bool in_modes = false; |
114 | | |
115 | 98.9k | for(size_t i = 1; i != name.size(); ++i) |
116 | 49.6k | { |
117 | 49.6k | if(name[i].first == 0) |
118 | 0 | { |
119 | 0 | m_mode_info.push_back(make_arg(name, i)); |
120 | 0 | in_modes = true; |
121 | 0 | } |
122 | 49.6k | else if(name[i].first == 1 && !in_modes) |
123 | 49.6k | m_args.push_back(make_arg(name, i)); |
124 | 49.6k | } |
125 | 49.3k | } |
126 | | |
127 | | std::string SCAN_Name::arg(size_t i) const |
128 | 56.0k | { |
129 | 56.0k | if(i >= arg_count()) |
130 | 0 | throw Invalid_Argument("SCAN_Name::arg " + std::to_string(i) + |
131 | 0 | " out of range for '" + to_string() + "'"); |
132 | 56.0k | return m_args[i]; |
133 | 56.0k | } |
134 | | |
135 | | std::string SCAN_Name::arg(size_t i, const std::string& def_value) const |
136 | 68 | { |
137 | 68 | if(i >= arg_count()) |
138 | 0 | return def_value; |
139 | 68 | return m_args[i]; |
140 | 68 | } |
141 | | |
142 | | size_t SCAN_Name::arg_as_integer(size_t i, size_t def_value) const |
143 | 803 | { |
144 | 803 | if(i >= arg_count()) |
145 | 494 | return def_value; |
146 | 309 | return to_u32bit(m_args[i]); |
147 | 803 | } |
148 | | |
149 | | size_t SCAN_Name::arg_as_integer(size_t i) const |
150 | 0 | { |
151 | 0 | return to_u32bit(arg(i)); |
152 | 0 | } |
153 | | |
154 | | } |