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
|
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
/*
* Ceph - scalable distributed file system
*
* Copyright (C) 2013 Cloudwatt <libre.licensing@cloudwatt.com>
*
* Author: Loic Dachary <loic@dachary.org>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
*/
#include "include/str_map.h"
#include "include/str_list.h"
#include <boost/algorithm/string.hpp>
#include "json_spirit/json_spirit.h"
using namespace std;
int get_json_str_map(
const string &str,
ostream &ss,
map<string,string> *str_map,
bool fallback_to_plain)
{
json_spirit::mValue json;
try {
// try json parsing first
json_spirit::read_or_throw(str, json);
if (json.type() != json_spirit::obj_type) {
ss << str << " must be a JSON object but is of type "
<< json.type() << " instead";
return -EINVAL;
}
json_spirit::mObject o = json.get_obj();
for (map<string, json_spirit::mValue>::iterator i = o.begin();
i != o.end();
++i) {
(*str_map)[i->first] = i->second.get_str();
}
} catch (json_spirit::Error_position &e) {
if (fallback_to_plain) {
// fallback to key=value format
get_str_map(str, str_map, "\t\n ");
} else {
return -EINVAL;
}
}
return 0;
}
string trim(const string& str) {
return boost::algorithm::trim_copy_if(
str,
[](unsigned char c) {
return std::isspace(c);
});
}
int get_str_map(
const string &str,
map<string,string> *str_map,
const char *delims)
{
list<string> pairs;
get_str_list(str, delims, pairs);
for (list<string>::iterator i = pairs.begin(); i != pairs.end(); ++i) {
size_t equal = i->find('=');
if (equal == string::npos)
(*str_map)[*i] = string();
else {
const string key = trim(i->substr(0, equal));
equal++;
const string value = trim(i->substr(equal));
(*str_map)[key] = value;
}
}
return 0;
}
string get_str_map_value(
const map<string,string> &str_map,
const string &key,
const string *def_val)
{
map<string,string>::const_iterator p = str_map.find(key);
// key exists in str_map
if (p != str_map.end()) {
// but value is empty
if (p->second.empty())
return p->first;
// and value is not empty
return p->second;
}
// key DNE in str_map and def_val was specified
if (def_val != NULL)
return *def_val;
// key DNE in str_map, no def_val was specified
return string();
}
string get_str_map_key(
const map<string,string> &str_map,
const string &key,
const string *fallback_key)
{
map<string,string>::const_iterator p = str_map.find(key);
if (p != str_map.end())
return p->second;
if (fallback_key != NULL) {
p = str_map.find(*fallback_key);
if (p != str_map.end())
return p->second;
}
return string();
}
// This function's only purpose is to check whether a given map has only
// ONE key with an empty value (which would mean that 'get_str_map()' read
// a map in the form of 'VALUE', without any KEY/VALUE pairs) and, in such
// event, to assign said 'VALUE' to a given 'def_key', such that we end up
// with a map of the form "m = { 'def_key' : 'VALUE' }" instead of the
// original "m = { 'VALUE' : '' }".
int get_conf_str_map_helper(
const string &str,
ostringstream &oss,
map<string,string> *m,
const string &def_key)
{
int r = get_str_map(str, m);
if (r < 0) {
return r;
}
if (r >= 0 && m->size() == 1) {
map<string,string>::iterator p = m->begin();
if (p->second.empty()) {
string s = p->first;
m->erase(s);
(*m)[def_key] = s;
}
}
return r;
}
|
