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
|
/* Copyright (c) 2014, 2025, Oracle and/or its affiliates.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License, version 2.0,
as published by the Free Software Foundation.
This program is designed to work with certain software (including
but not limited to OpenSSL) that is licensed under separate terms,
as designated in a particular file or component or in included license
documentation. The authors of MySQL hereby grant you an additional
permission to link the program and your derivative works with the
separately licensed software that they have either included with
the program or referenced in the documentation.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License, version 2.0, for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
#ifndef DD__PROPERTIES_IMPL_INCLUDED
#define DD__PROPERTIES_IMPL_INCLUDED
#include <assert.h>
#include <map>
#include <memory>
#include <set>
#include <string>
#include <utility>
#include "lex_string.h"
#include "my_inttypes.h"
#include "sql/dd/properties.h" // dd::Properties
#include "sql/dd/string_type.h" // dd::String_type
namespace dd {
///////////////////////////////////////////////////////////////////////////
/**
The Properties_impl class implements the Properties interface.
The key=value pairs are stored in a std::map. An instance can be created
either by means of the default constructor, which creates an object
with an empty map, or alternatively, it can be created by means of the
static parse_properties function with a String_type argument. The string
is supposed to contain a semicolon separated list of key=value pairs,
where the characters '=' and ';' also may be part of key or value by
escaping using the '\' as an escape character. The escape character
itself must also be escaped if being part of key or value. All characters
between '=' and ';' are considered part of key or value, whitespace is
not ignored.
Escaping is removed during parsing so the strings in the map are not
escaped. Escaping is only relevant in the context of raw strings that
are to be parsed, and raw strings that are returned containing all
key=value pairs.
Example (note \\ due to escaping of C string literals):
parse_properties("a=b;b = c") -> ("a", "b"), ("b ", " c")
parse_properties("a\\==b;b=\\;c") -> ("a=", "b"), ("b", ";c")
get("a=") == "b"
get("b") == ";c"
Additional key=value pairs may be added by means of the set function,
which takes a string argument that is assumed to be unescaped.
Please also refer to the comments in the file properties.h where the
interface is defined; the functions in the interface are commented there.
*/
class Properties_impl : public Properties {
private:
/* Map containing the actual key-value pairs. */
Properties::Map m_map;
/* Set containing the valid keys. An empty set means any key is valid. */
std::set<String_type> m_keys;
public:
Properties_impl() = default;
/* Constructor accepting a set of valid keys. */
Properties_impl(const std::set<String_type> &keys) : m_keys(keys) {}
virtual const Properties_impl *impl() const { return this; }
iterator begin() override { return m_map.begin(); }
const_iterator begin() const override { return m_map.begin(); }
iterator end() override { return m_map.end(); }
const_iterator end() const override { return m_map.end(); }
size_type size() const override { return m_map.size(); }
bool empty() const override { return m_map.empty(); }
void clear() override { return m_map.clear(); }
bool valid_key(const String_type &key) const override {
return (m_keys.empty() || m_keys.find(key) != m_keys.end());
}
bool exists(const String_type &key) const override {
return m_map.find(key) != m_map.end();
}
bool remove(const String_type &key) override {
iterator it = m_map.find(key);
if (it == m_map.end()) return true;
m_map.erase(it);
return false;
}
/**
Iterate over all entries in the private hash table. For each
key value pair, escape both key and value, and append the strings
to the result. Use '=' to separate key and value, and use ';'
to separate pairs.
Invalid keys are not included in the output. However, there should
never be a situation where invalid keys are present, so we just assert
that the keys are valid.
@return string containing all escaped key value pairs
*/
const String_type raw_string() const override;
/**
Get the string value for a given key.
Return true if the operation fails, i.e., if the key does not exist
or if the key is invalid. Assert that the key exists in debug builds.
@param key key to lookup the value for
@param[out] value string value
@return Operation outcome, false if success, otherwise true
*/
bool get(const String_type &key, String_type *value) const override;
/**
Set the key/value. If the key is invalid, a warning is written
to the error log. Assert that the key exists in debug builds.
@param key Key to set.
@param value Value to set.
@return Operation outcome, false if success, otherwise true
*/
bool set(const String_type &key, const String_type &value) override;
/**
Insert key/value pairs from a different property object.
The set of valid keys is not copied, instead, the existing
set in the destination object is used to ignore all invalid
keys.
@param properties Source object.
@retval Operation outcome, false if no error, otherwise true.
*/
bool insert_values(const Properties &properties) override;
/**
Insert key/value pairs from a string.
Parse the string and add key/value pairs to this object.
The existing set of valid keys in the destination object
is used to ignore all invalid keys.
@param raw_string String to be parsed.
@retval Operation outcome, false if no error, otherwise true.
*/
bool insert_values(const String_type &raw_string) override;
#ifdef EXTRA_CODE_FOR_UNIT_TESTING
/**
Extend the set of valid keys after the property object is
created. This can be used e.g. for the SE private data.
@pre There must be a set of valid keys already, or the
map of key-value pairs must be empty. Otherwise,
we risk making existing keys invalid, thus hiding
their values.
@param keys Set of additional keys to insert into
the set of valid keys.
*/
void add_valid_keys(const std::set<String_type> &keys) {
assert(!m_keys.empty() || m_map.empty());
m_keys.insert(keys.begin(), keys.end());
}
/**
Remove the set of valid keys after the property object is
created. Convenience method used by unit tests.
*/
void clear_valid_keys() { m_keys.clear(); }
/**
Get valid key at a certain index.
If the key set is empty, return a string representation of
the index is returned. If the index is out of bounds, return
the last key.
@note This is needed by unit tests to fill in
random key/value pairs without breaking the
check for valid keys.
@param index Index at which to get the valid key.
@retval Key at the given index, a string containing the index,
or the last key.
*/
const String_type valid_key_at(size_t index) const {
if (m_keys.empty()) {
Stringstream_type ostream;
ostream << index;
return ostream.str();
}
if (m_keys.size() <= index) {
return *std::next(m_keys.begin(), m_keys.size() - 1);
}
return *std::next(m_keys.begin(), index);
}
#endif
};
///////////////////////////////////////////////////////////////////////////
} // namespace dd
#endif // DD__PROPERTIES_IMPL_INCLUDED
|