2 The software in this package is distributed under the GNU General
3 Public License version 2 (with a special exception described below).
5 A copy of GNU General Public License (GPL) is included in this distribution,
6 in the file COPYING.GPL.
8 As a special exception, if other files instantiate templates or use macros
9 or inline functions from this file, or you compile this file and link it
10 with other works to produce a work based on this file, this file
11 does not by itself cause the resulting work to be covered
12 by the GNU General Public License.
14 However the source code for this file must still be made available
15 in accordance with section (3) of the GNU General Public License.
17 This exception does not invalidate any other reasons why a work based
18 on this file might be covered by the GNU General Public License.
22 * (c) Copyright 2007-2008 by Intra2net AG
30 #include <cmath> // for round()
38 #include <boost/numeric/conversion/cast.hpp>
39 #include <boost/foreach.hpp>
41 #include <boost/assert.hpp>
42 #include <boost/shared_ptr.hpp>
43 #include <openssl/bio.h>
44 #include <openssl/evp.h>
46 #include <stringfunc.hxx>
57 const std::string hexDigitsLower("0123456789abcdef");
58 const std::string hexDigitsUpper("0123456789ABCDEF");
63 char operator() (char c)
65 return std::toupper(c);
67 }; // eo struct UpperFunc
72 char operator() (char c)
74 return std::tolower(c);
76 }; // eo struct LowerFunc
79 } // eo namespace <anonymous>
84 * default list of Whitespaces (" \t\r\n");
86 const std::string Whitespaces = " \t\r\n";
89 * default list of lineendings ("\r\n");
91 const std::string LineEndings= "\r\n";
96 * @brief checks if a string begins with a given prefix.
97 * @param[in,out] str the string which is tested
98 * @param prefix the prefix which should be tested for.
99 * @return @a true iff the prefix is not empty and the string begins with that prefix.
101 bool has_prefix(const std::string& str, const std::string& prefix)
103 if (prefix.empty() || str.empty() || str.size() < prefix.size() )
107 return str.compare(0, prefix.size(), prefix) == 0;
108 } // eo has_prefix(const std::string&,const std::string&)
112 * @brief checks if a string ends with a given suffix.
113 * @param[in,out] str the string which is tested
114 * @param suffix the suffix which should be tested for.
115 * @return @a true iff the suffix is not empty and the string ends with that suffix.
117 bool has_suffix(const std::string& str, const std::string& suffix)
119 if (suffix.empty() || str.empty() || str.size() < suffix.size() )
123 return str.compare(str.size() - suffix.size(), suffix.size(), suffix) == 0;
124 } // eo has_suffix(const std::string&,const std::string&)
128 * cut off characters from a given list from front and end of a string.
129 * @param[in,out] str the string which should be trimmed.
130 * @param charlist the list of characters to remove from beginning and end of string
131 * @return the result string.
133 std::string trim_mod(std::string& str, const std::string& charlist)
135 // first: trim the beginning:
136 std::string::size_type pos= str.find_first_not_of (charlist);
137 if (pos == std::string::npos)
139 // whole string consists of charlist (or is already empty)
145 // str starts with charlist
148 // now let's look at the tail:
149 pos= str.find_last_not_of(charlist) +1; // note: we already know there is at least one other char!
150 if ( pos < str.size() )
152 str.erase(pos, str.size()-pos);
155 } // eo trim_mod(std::string&,const std::string&)
160 * removes last character from a string when it is in a list of chars to be removed.
161 * @param[in,out] str the string.
162 * @param what the list of chars which will be tested for.
163 * @return the resulting string with last char removed (if applicable)
165 std::string chomp_mod(std::string& str, const std::string& what)
167 if (str.empty() || what.empty() )
171 if (what.find(str.at (str.size()-1) ) != std::string::npos)
173 str.erase(str.size() - 1);
176 } // eo chomp_mod(std::string&,const std::string&)
180 * @brief converts a string to lower case.
181 * @param[in,out] str the string to modify.
184 std::string to_lower_mod(std::string& str)
186 std::transform(str.begin(), str.end(), str.begin(), LowerFunc() );
188 } // eo to_lower_mod(std::string&)
192 * @brief converts a string to upper case.
193 * @param[in,out] str the string to modify.
196 std::string to_upper_mod(std::string& str)
198 std::transform( str.begin(), str.end(), str.begin(), UpperFunc() );
200 } // eo to_upper_mod(std::string&)
205 * cut off characters from a given list from front and end of a string.
206 * @param str the string which should be trimmed.
207 * @param charlist the list of characters to remove from beginning and end of string
208 * @return the result string.
210 std::string trim (const std::string& str, const std::string& charlist)
212 // first: trim the beginning:
213 std::string::size_type pos0= str.find_first_not_of(charlist);
214 if (pos0 == std::string::npos)
216 // whole string consists of charlist (or is already empty)
217 return std::string();
219 // now let's look at the end:
220 std::string::size_type pos1= str.find_last_not_of(charlist);
221 return str.substr(pos0, pos1 - pos0 + 1);
222 } // eo trim(const std:.string&,const std::string&)
226 * removes last character from a string when it is in a list of chars to be removed.
227 * @param str the string.
228 * @param what the list of chars which will be tested for.
229 * @return the resulting string with last char removed (if applicable)
231 std::string chomp (const std::string& str, const std::string& what)
233 if (str.empty() || what.empty() )
237 if (what.find(str.at (str.size()-1) ) != std::string::npos)
239 return str.substr(0, str.size()-1);
242 } // eo chomp(const std:.string&,const std::string&)
246 * @brief returns a lower case version of a given string.
247 * @param str the string
248 * @return the lower case version of the string
250 std::string to_lower (const std::string& str)
252 std::string result(str);
253 return to_lower_mod(result);
254 } // eo to_lower(const std::string&)
258 * @brief returns a upper case version of a given string.
259 * @param str the string
260 * @return the upper case version of the string
262 std::string to_upper(const std::string& str)
264 std::string result(str);
265 return to_upper_mod(result);
266 } // eo to_upper(const std::string&)
271 * @brief removes a given suffix from a string.
272 * @param str the string.
273 * @param suffix the suffix which should be removed if the string ends with it.
274 * @return the string without the suffix.
276 * If the string ends with the suffix, it is removed. If the the string doesn't end
277 * with the suffix the original string is returned.
279 std::string remove_suffix(const std::string& str, const std::string& suffix)
281 if (has_suffix(str,suffix) )
283 return str.substr(0, str.size()-suffix.size() );
286 } // eo remove_suffix(const std::string&,const std::string&)
291 * @brief removes a given prefix from a string.
292 * @param str the string.
293 * @param prefix the prefix which should be removed if the string begins with it.
294 * @return the string without the prefix.
296 * If the string begins with the prefix, it is removed. If the the string doesn't begin
297 * with the prefix the original string is returned.
299 std::string remove_prefix(const std::string& str, const std::string& prefix)
301 if (has_prefix(str,prefix) )
303 return str.substr( prefix.size() );
306 } // eo remove_prefix(const std::string&,const std::string&)
310 * split a string to key and value delimited by a given delimiter.
311 * The resulting key and value strings are trimmed (Whitespaces removed at beginning and end).
312 * @param str the string which should be splitted.
313 * @param[out] key the resulting key
314 * @param[out] value the resulting value
315 * @param delimiter the delimiter between key and value; default is '='.
316 * @return @a true if the split was successful.
319 const std::string& str,
324 std::string::size_type pos = str.find (delimiter);
325 if (pos == std::string::npos) return false;
326 key= str.substr(0,pos);
327 value= str.substr(pos+1);
331 } // eo pair_split(const std::string&,std::string&,std::string&,char)
335 * splits a string by given delimiter
337 * @param[in] str the string which should be splitted.
338 * @param[out] result the list resulting from splitting @a str.
339 * @param[in] delimiter the delimiter (word/phrase) at which @a str should be splitted.
340 * @param[in] omit_empty should empty parts not be stored?
341 * @param[in] trim_list list of characters the parts should be trimmed by.
342 * (empty string results in no trim)
345 const std::string& str,
346 std::list<std::string>& result,
347 const std::string& delimiter,
349 const std::string& trim_list
352 std::string::size_type pos, last_pos=0;
353 bool delimiter_found= false;
354 while ( last_pos < str.size() && last_pos != std::string::npos)
356 pos= str.find(delimiter, last_pos);
358 if (pos == std::string::npos)
360 part= str.substr(last_pos);
361 delimiter_found= false;
365 part= str.substr(last_pos, pos-last_pos);
366 delimiter_found=true;
368 if (pos != std::string::npos)
370 last_pos= pos+ delimiter.size();
374 last_pos= std::string::npos;
376 if (!trim_list.empty() ) trim_mod (part, trim_list);
377 if (omit_empty && part.empty() ) continue;
378 result.push_back( part );
380 // if the string ends with a delimiter we need to append an empty string if no omit_empty
382 // (this way we keep the split result consistent to a join operation)
383 if (delimiter_found && !omit_empty)
385 result.push_back("");
387 } // eo split_string(const std::string&,std::list< std::string >&,const std::string&,bool,const std::string&)
390 /** call split_string with list<string>, converts result to vector; vector is clear()-ed first
392 * Note: Uses 3 O(n)-operations: list.size, vector.resize and std::swap_ranges;
393 * not sure whether there is a better way to do this
396 const std::string& str,
397 std::vector<std::string>& result,
398 const std::string& delimiter,
400 const std::string& trim_list
403 std::list<std::string> tmp;
404 split_string(str, tmp, delimiter, omit_empty, trim_list);
405 std::size_t size = tmp.size(); // this is O(n)
407 result.resize(size); // also O(n)
408 std::swap_ranges(tmp.begin(), tmp.end(), result.begin()); // also O(n)
412 * splits a string by a given delimiter
413 * @param str the string which should be splitted.
414 * @param delimiter delimiter the delimiter (word/phrase) at which @a str should be splitted.
415 * @param[in] omit_empty should empty parts not be stored?
416 * @param[in] trim_list list of characters the parts should be trimmed by.
417 * (empty string results in no trim)
418 * @return the list resulting from splitting @a str.
420 std::list<std::string> split_string(
421 const std::string& str,
422 const std::string& delimiter,
424 const std::string& trim_list
427 std::list<std::string> result;
428 split_string(str, result, delimiter, omit_empty, trim_list);
430 } // eo split_string(const std::string&,const std::string&,bool,const std::string&)
434 * @brief joins a list of strings into a single string.
436 * This funtion is (basically) the reverse operation of @a split_string.
438 * @param parts the list of strings.
439 * @param delimiter the delimiter which is inserted between the strings.
440 * @return the joined string.
442 std::string join_string(
443 const std::list< std::string >& parts,
444 const std::string& delimiter
448 if (! parts.empty() )
450 std::list< std::string >::const_iterator it= parts.begin();
452 while ( ++it != parts.end() )
459 } // eo join_string(const std::list< std::string >&,const std::string&)
462 /** @brief same as join_string for list, except uses a vector */
463 std::string join_string(
464 const std::vector< std::string >& parts,
465 const std::string& delimiter
469 if (! parts.empty() )
471 std::vector< std::string >::const_iterator it= parts.begin();
473 while ( ++it != parts.end() )
480 } // eo join_string(const std::vector< std::string >&,const std::string&)
490 * @brief returns a hex string from a binary string.
491 * @param str the (binary) string
492 * @param upper_case_digits determine whether to use upper case characters for digits A-F.
493 * @return the string in hex notation.
495 std::string convert_binary_to_hex(
496 const std::string& str,
497 bool upper_case_digits
501 std::string hexDigits(upper_case_digits ? hexDigitsUpper : hexDigitsLower);
502 for ( std::string::const_iterator it= str.begin();
506 result.push_back( hexDigits[ ( (*it) >> 4) & 0x0f ] );
507 result.push_back( hexDigits[ (*it) & 0x0f ] );
510 } // eo convert_binary_to_hex(const std::string&,bool)
514 * @brief converts a hex digit string to binary string.
515 * @param str hex digit string
516 * @return the binary string.
518 * The hex digit string may contains white spaces or colons which are treated
519 * as delimiters between hex digit groups.
521 * @todo rework the handling of half nibbles (consistency)!
523 std::string convert_hex_to_binary(
524 const std::string& str
526 throw (std::runtime_error)
530 bool hasNibble= false;
531 bool lastWasWS= true;
532 for ( std::string::const_iterator it= str.begin();
536 std::string::size_type p = hexDigitsLower.find( *it );
537 if (p== std::string::npos)
539 p= hexDigitsUpper.find( *it );
541 if (p == std::string::npos)
543 if ( ( Whitespaces.find( *it ) != std::string::npos) // is it a whitespace?
544 or ( *it == ':') // or a colon?
547 // we treat that as a valid delimiter:
550 // 1 nibble before WS is treate as lower part:
559 if (p == std::string::npos )
561 throw runtime_error("illegal character in hex digit string: " + str);
575 //we already had a nibble, so a char is complete now:
576 result.push_back( c );
581 // this is the first nibble of a new char:
587 //well, there is one nibble left
588 // let's do some heuristics:
591 // if the preceeding character was a white space (or a colon)
592 // we treat the nibble as lower part:
593 //( this is consistent with shortened hex notations where leading zeros are not noted)
594 result.push_back( c );
598 // if it was part of a hex digit chain, we treat it as UPPER part (!!)
599 result.push_back( c << 4 );
603 } // eo convert_hex_to_binary(const std::string&)
606 static list<string>& alloc_template_starts()
608 static list<string> result;
611 result.push_back("std::list");
612 result.push_back("std::vector");
617 string shorten_stl_types(const string &input)
619 string output = input;
621 // first: replace fixed string for std::string
622 replace_all(output, "std::basic_string<char, std::char_traits<char>, std::allocator<char> >",
625 // loop over list/vector/... that have an allocator, e.g.
626 // std::list< some_type_here, std::allocator<some_type_here> >
627 string::size_type start, comma, end, len, start_text_len;
629 string allocator_text;
630 BOOST_FOREACH(const string &start_text, alloc_template_starts())
635 start_text_len = start_text.length();
636 while( (start=output.find(start_text+"<", start)) != string::npos )
638 len = output.length();
639 start += start_text_len+1; // start next iter and tests here after opening bracket
641 // now comes the tricky part: find matching ',' and the closing '>' even if "subtype" is template again
643 n_open_brackets = 1; // the bracket right after start_text counts as first
644 while (comma < len && n_open_brackets > 0)
646 if (output[comma] == ',' && n_open_brackets == 1)
648 else if (output[comma] == '<')
650 else if (output[comma] == '>')
655 while (end < len && n_open_brackets > 0)
657 if (output[end] == '<')
659 else if (output[end] == '>')
662 if (n_open_brackets == 0)
663 break; // do not increment end
668 // check that start < comma < end < len && n_open_brackets == 0
669 if (start >= comma || comma >= end || end >= len || n_open_brackets != 0)
670 continue; // input seems to be of unexpected form
672 // check that type in allocator is same as until comma
673 string type = output.substr(start, comma-start);
674 if (type[type.length()-1] == '>')
675 allocator_text = string("std::allocator<") + type + " > ";
677 allocator_text = string("std::allocator<") + type + "> ";
678 if (output.substr(comma+2, end-comma-2) == allocator_text)
679 output.replace(comma+2, end-comma-2, "_alloc_");
686 typedef boost::shared_ptr<BIO> BIO_Ptr;
689 * @brief Converts openssl generic input/output to std::string
691 * Code adapted from keymakerd.
693 * @param bio Openssl's generic input/output
694 * @return :string STL string
696 static std::string _convert_BIO_to_string(BIO *input)
701 long written = BIO_get_mem_data(input, &output);
702 if (written <= 0 || output == NULL)
705 rtn.assign(output, written); //lint !e534 !e732
710 * @brief base64 encode a string using OpenSSL base64 functions
712 * Data size limit is 2GB on 32 bit (LONG_MAX)
714 * @param input String to encode
715 * @return base64 encoded string
717 std::string base64_encode(const std::string &input)
719 // check for empty buffer
723 // safety check to ensure our check afer BIO_write() works
724 if (input.size() >= LONG_MAX)
725 throw runtime_error("base64 encode: Too much data");
727 // setup encoder. Note: BIO_free_all frees both BIOs.
728 BIO_Ptr base64_encoder(BIO_new(BIO_f_base64()), BIO_free_all);
729 BIO *encoder_bio = base64_encoder.get();
730 BIO_set_flags(encoder_bio, BIO_FLAGS_BASE64_NO_NL);
732 // chain output buffer and encoder together
733 BIO *encoded_result = BIO_new(BIO_s_mem());
734 BIO_push(encoder_bio, encoded_result);
737 long written = BIO_write(encoder_bio, input.c_str(), input.size());
738 if ((unsigned)written != input.size())
741 out << "base64 encoding failed: input size: "
742 << input.size() << " vs. output size: " << written;
743 throw runtime_error(out.str());
745 if (BIO_flush(encoder_bio) != 1)
746 throw runtime_error("base64 encode: BIO_flush() failed");
748 return _convert_BIO_to_string(encoded_result);
752 * @brief base64 decode a string using OpenSSL base64 functions
754 * @param input String to decode
755 * @return base64 decoded string
757 std::string base64_decode(const std::string &input)
759 // check for empty buffer
763 // safety check for BIO_new_mem_buf()
764 if (input.size() >= INT_MAX)
765 throw runtime_error("base64 decode: Too much data");
767 // setup encoder. Note: BIO_free_all frees both BIOs.
768 BIO_Ptr base64_decoder(BIO_new(BIO_f_base64()), BIO_free_all);
769 BIO *bio_base64 = base64_decoder.get();
770 BIO_set_flags(bio_base64, BIO_FLAGS_BASE64_NO_NL);
772 // chain input buffer and decoder together
773 BIO *bio_input = BIO_new_mem_buf((void*)input.c_str(), input.size());
774 bio_input = BIO_push(bio_base64, bio_input);
776 BIO_Ptr decoded_result(BIO_new(BIO_s_mem()), BIO_free_all);
777 BIO *bio_decoded = decoded_result.get();
778 const int convbuf_size = 512;
779 char convbuf[convbuf_size];
782 while((read_bytes = BIO_read(bio_input, convbuf, convbuf_size)) > 0)
784 BOOST_ASSERT(read_bytes <= convbuf_size);
785 long written_bytes = BIO_write(bio_decoded, convbuf, read_bytes);
786 if (written_bytes != read_bytes)
789 out << "base64 decoding failed: read_bytes: "
790 << read_bytes << " vs. written_bytes: " << written_bytes;
791 throw runtime_error(out.str());
794 if (read_bytes == -2 || read_bytes == -1)
795 throw runtime_error("base64 decode: Error during decoding");
797 return _convert_BIO_to_string(bio_decoded);
800 } // eo namespace I2n
805 std::string iso_to_utf8(const std::string& isostring)
809 iconv_t i2utf8 = iconv_open("UTF-8", "ISO-8859-1");
811 if (iso_to_utf8 == (iconv_t)-1)
812 throw runtime_error("iconv can't convert from ISO-8859-1 to UTF-8");
814 size_t in_size=isostring.size();
815 size_t out_size=in_size*4;
817 char *buf = (char *)malloc(out_size+1);
819 throw runtime_error("out of memory for iconv buffer");
821 char *in = (char *)isostring.c_str();
823 iconv(i2utf8, &in, &in_size, &out, &out_size);
825 buf[isostring.size()*4-out_size]=0;
835 std::string utf8_to_iso(const std::string& utf8string)
839 iconv_t utf82iso = iconv_open("ISO-8859-1","UTF-8");
841 if (utf82iso == (iconv_t)-1)
842 throw runtime_error("iconv can't convert from UTF-8 to ISO-8859-1");
844 size_t in_size=utf8string.size();
845 size_t out_size=in_size;
847 char *buf = (char *)malloc(out_size+1);
849 throw runtime_error("out of memory for iconv buffer");
851 char *in = (char *)utf8string.c_str();
853 iconv(utf82iso, &in, &in_size, &out, &out_size);
855 buf[utf8string.size()-out_size]=0;
860 iconv_close(utf82iso);
865 wchar_t* utf8_to_wbuf(const std::string& utf8string)
867 iconv_t utf82wstr = iconv_open("UCS-4LE","UTF-8");
869 if (utf82wstr == (iconv_t)-1)
870 throw runtime_error("iconv can't convert from UTF-8 to UCS-4");
872 size_t in_size=utf8string.size();
873 size_t out_size= (in_size+1)*sizeof(wchar_t);
875 wchar_t *buf = (wchar_t *)malloc(out_size);
877 throw runtime_error("out of memory for iconv buffer");
879 char *in = (char *)utf8string.c_str();
880 char *out = (char*) buf;
881 if (iconv(utf82wstr, &in, &in_size, &out, &out_size) == (size_t)-1)
882 throw runtime_error("error converting char encodings");
884 buf[ ( (utf8string.size()+1)*sizeof(wchar_t)-out_size) /sizeof(wchar_t) ]=0;
886 iconv_close(utf82wstr);
891 std::string utf7imap_to_utf8(const std::string& utf7imapstring)
895 iconv_t utf7imap2utf8 = iconv_open("UTF-8","UTF-7-IMAP");
897 if (utf7imap2utf8 == (iconv_t)-1)
898 throw runtime_error("iconv can't convert from UTF-7-IMAP to UTF-8");
900 size_t in_size=utf7imapstring.size();
901 size_t out_size=in_size*4;
903 char *buf = (char *)malloc(out_size+1);
905 throw runtime_error("out of memory for iconv buffer");
907 char *in = (char *)utf7imapstring.c_str();
909 iconv(utf7imap2utf8, &in, &in_size, &out, &out_size);
911 buf[utf7imapstring.size()*4-out_size]=0;
916 iconv_close(utf7imap2utf8);
921 std::string utf8_to_utf7imap(const std::string& utf8string)
925 iconv_t utf82utf7imap = iconv_open("UTF-7-IMAP", "UTF-8");
927 if (utf82utf7imap == (iconv_t)-1)
928 throw runtime_error("iconv can't convert from UTF-7-IMAP to UTF-8");
930 // UTF-7 is base64 encoded, a buffer 10x as large
931 // as the utf-8 buffer should be enough. If not the string will be truncated.
932 size_t in_size=utf8string.size();
933 size_t out_size=in_size*10;
935 char *buf = (char *)malloc(out_size+1);
937 throw runtime_error("out of memory for iconv buffer");
939 char *in = (char *)utf8string.c_str();
941 iconv(utf82utf7imap, &in, &in_size, &out, &out_size);
943 buf[utf8string.size()*10-out_size]= 0;
948 iconv_close(utf82utf7imap);
953 // Tokenize string by (html) tags
954 void tokenize_by_tag(vector<pair<string,bool> > &tokenized, const std::string &input)
956 string::size_type pos, len = input.size();
957 bool inside_tag = false;
960 for (pos = 0; pos < len; pos++)
962 if (input[pos] == '<')
966 if (!current.empty() )
968 tokenized.push_back( make_pair(current, false) );
972 current += input[pos];
974 else if (input[pos] == '>' && inside_tag)
976 current += input[pos];
978 if (!current.empty() )
980 tokenized.push_back( make_pair(current, true) );
985 current += input[pos];
988 // String left over in buffer?
989 if (!current.empty() )
990 tokenized.push_back( make_pair(current, false) );
991 } // eo tokenize_by_tag
994 std::string strip_html_tags(const std::string &input)
996 // Pair first: string, second: isTag
997 vector<pair<string,bool> > tokenized;
998 tokenize_by_tag (tokenized, input);
1001 vector<pair<string,bool> >::const_iterator token, tokens_end = tokenized.end();
1002 for (token = tokenized.begin(); token != tokens_end; ++token)
1004 output += token->first;
1007 } // eo strip_html_tags
1010 // Smart-encode HTML en
1011 string smart_html_entities(const std::string &input)
1013 // Pair first: string, second: isTag
1014 vector<pair<string,bool> > tokenized;
1015 tokenize_by_tag (tokenized, input);
1018 vector<pair<string,bool> >::const_iterator token, tokens_end = tokenized.end();
1019 for (token = tokenized.begin(); token != tokens_end; ++token)
1021 // keep HTML tags as they are
1023 output += token->first;
1025 output += html_entities(token->first);
1032 string::size_type find_8bit(const std::string &str)
1034 string::size_type l=str.size();
1035 for (string::size_type p=0; p < l; p++)
1036 if (static_cast<unsigned char>(str[p]) > 127)
1039 return string::npos;
1042 // encoded UTF-8 chars into HTML entities
1043 string html_entities(std::string str)
1046 replace_all (str, "&", "&");
1047 replace_all (str, "<", "<");
1048 replace_all (str, ">", ">");
1049 replace_all (str, "\"", """);
1050 replace_all (str, "'", "'");
1051 replace_all (str, "/", "/");
1054 replace_all (str, "\xC3\xA4", "ä");
1055 replace_all (str, "\xC3\xB6", "ö");
1056 replace_all (str, "\xC3\xBC", "ü");
1057 replace_all (str, "\xC3\x84", "Ä");
1058 replace_all (str, "\xC3\x96", "Ö");
1059 replace_all (str, "\xC3\x9C", "Ü");
1062 replace_all (str, "\xC3\x9F", "ß");
1064 // conversion of remaining non-ASCII chars needed?
1065 // just do if needed because of performance
1066 if (find_8bit(str) != string::npos)
1068 // convert to fixed-size encoding UTF-32
1069 wchar_t* wbuf=utf8_to_wbuf(str);
1070 ostringstream target;
1072 // replace all non-ASCII chars with HTML representation
1073 for (int p=0; wbuf[p] != 0; p++)
1075 unsigned int c=wbuf[p];
1078 target << static_cast<unsigned char>(c);
1080 target << "&#" << c << ';';
1089 } // eo html_entities(std::string)
1091 // convert HTML entities to something that can be viewed on a basic text console (restricted to ASCII-7)
1092 string html_entities_to_console(std::string str)
1095 replace_all (str, "&", "&");
1096 replace_all (str, "<", "<");
1097 replace_all (str, ">", ">");
1098 replace_all (str, """, "\"");
1099 replace_all (str, "'", "'");
1100 replace_all (str, "/", "/");
1103 replace_all (str, "ä", "ae");
1104 replace_all (str, "ö", "oe");
1105 replace_all (str, "ü", "ue");
1106 replace_all (str, "Ä", "Ae");
1107 replace_all (str, "Ö", "Oe");
1108 replace_all (str, "Ü", "Ue");
1111 replace_all (str, "ß", "ss");
1116 // find_html_comments + remove_html_comments(str, comments)
1117 void remove_html_comments(string &str)
1119 vector<CommentZone> comments = find_html_comments(str);
1120 remove_html_comments(str, comments);
1123 // find all html comments, behaving correctly if they are nested; ignores comment tags ("<!--FOO .... BAR-->")
1124 // If there are invalid comments ("-->" before "<!--" or different number of closing and opening tags),
1125 // then the unknown index of corresponding start/end tag will be represented by a string::npos
1126 // Indices are from start of start tag until first index after closing tag
1127 vector<CommentZone> find_html_comments(const std::string &str)
1129 static const string START = "<!--";
1130 static const string CLOSE = "-->";
1131 static const string::size_type START_LEN = START.length();
1132 static const string::size_type CLOSE_LEN = CLOSE.length();
1134 vector<CommentZone> comments;
1136 // in order to find nested comments, need either recursion or a stack
1137 vector<string::size_type> starts; // stack of start tags
1139 string::size_type pos = 0;
1140 string::size_type len = str.length();
1141 string::size_type next_start, next_close;
1143 while (pos < len) // not really needed but just in case
1145 next_start = str.find(START, pos);
1146 next_close = str.find(CLOSE, pos);
1148 if ( (next_start == string::npos) && (next_close == string::npos) )
1149 break; // we are done
1151 else if ( (next_start == string::npos) || (next_close < next_start) ) // close one comment (pop)
1153 if (starts.empty()) // closing tag without a start
1154 comments.push_back(CommentZone(string::npos, next_close+CLOSE_LEN));
1157 comments.push_back(CommentZone(starts.back(), next_close+CLOSE_LEN));
1160 pos = next_close + CLOSE_LEN;
1163 else if ( (next_close == string::npos) || (next_start < next_close) ) // start a new comment (push)
1165 starts.push_back(next_start);
1166 pos = next_start + START_LEN;
1170 // add comments that have no closing tag from back to front (important for remove_html_comments!)
1171 while (!starts.empty())
1173 comments.push_back(CommentZone(starts.back(), string::npos));
1180 // remove all html comments foundby find_html_comments
1181 void remove_html_comments(std::string &str, const vector<CommentZone> &comments)
1183 // remember position where last removal started
1184 string::size_type last_removal_start = str.length();
1186 // Go from back to front to not mess up indices.
1187 // This requires that bigger comments, that contain smaller comments, come AFTER
1188 // the small contained comments in the comments vector (i.e. comments are ordered by
1189 // their closing tag, not their opening tag). This is true for results from find_html_comments
1190 BOOST_REVERSE_FOREACH(const CommentZone &comment, comments)
1192 if (comment.first == string::npos)
1194 str = str.replace(0, comment.second, ""); // comment starts "before" str --> delete from start
1195 break; // there can be no more
1197 else if (comment.first >= last_removal_start)
1199 continue; // this comment is inside another comment that we have removed already
1201 else if (comment.second == string::npos) // comment ends "after" str --> delete until end
1203 str = str.replace(comment.first, string::npos, "");
1204 last_removal_start = comment.first;
1208 str = str.replace(comment.first, comment.second-comment.first, "");
1209 last_removal_start = comment.first;
1214 bool replace_all(string &base, const char *ist, const char *soll)
1218 return replace_all(base,&i,&s);
1221 bool replace_all(string &base, const string &ist, const char *soll)
1224 return replace_all(base,&ist,&s);
1227 bool replace_all(string &base, const string *ist, const string *soll)
1229 return replace_all(base,*ist,*soll);
1232 bool replace_all(string &base, const char *ist, const string *soll)
1235 return replace_all(base,&i,soll);
1238 bool replace_all(string &base, const string &ist, const string &soll)
1240 bool found_ist = false;
1241 string::size_type a=0;
1244 throw runtime_error ("replace_all called with empty search string");
1246 while ( (a=base.find(ist,a) ) != string::npos)
1248 base.replace(a,ist.size(),soll);
1257 * @brief replaces all characters that could be problematic or impose a security risk when being logged
1258 * @param str the original string
1259 * @param replace_with the character to replace the unsafe chars with
1260 * @return a string that is safe to send to syslog or other logfiles
1262 * All chars between 0x20 (space) and 0x7E (~) (including) are considered safe for logging.
1263 * See e.g. RFC 5424, section 8.2 or the posix character class "printable".
1264 * This eliminates all possible problems with NUL, control characters, 8 bit chars, UTF8.
1267 std::string sanitize_for_logging(const std::string &str, const char replace_with)
1269 std::string output=str;
1271 const string::size_type len = output.size();
1272 for (std::string::size_type p=0; p < len; p++)
1273 if (output[p] < 0x20 || output[p] > 0x7E)
1274 output[p]=replace_with;
1280 string to_lower(const string &src)
1284 string::size_type pos, end = dst.size();
1285 for (pos = 0; pos < end; pos++)
1286 dst[pos] = tolower(dst[pos]);
1291 string to_upper(const string &src)
1295 string::size_type pos, end = dst.size();
1296 for (pos = 0; pos < end; pos++)
1297 dst[pos] = toupper(dst[pos]);
1303 const int MAX_UNIT_FORMAT_SYMBOLS = 6;
1305 const string shortUnitFormatSymbols[MAX_UNIT_FORMAT_SYMBOLS] = {
1314 const string longUnitFormatSymbols[MAX_UNIT_FORMAT_SYMBOLS] = {
1315 i18n_noop(" Bytes"),
1316 i18n_noop(" KBytes"),
1317 i18n_noop(" MBytes"),
1318 i18n_noop(" GBytes"),
1319 i18n_noop(" TBytes"),
1320 i18n_noop(" PBytes")
1324 static long double rounding_upwards(
1325 const long double number,
1326 const int rounding_multiplier
1329 long double rounded_number;
1330 rounded_number = number * rounding_multiplier;
1331 rounded_number += 0.5;
1332 rounded_number = (int64_t) (rounded_number);
1333 rounded_number = (long double) (rounded_number) / (long double) (rounding_multiplier);
1335 return rounded_number;
1339 string nice_unit_format(
1340 const int64_t input,
1341 const UnitFormat format,
1345 // select the system of units (decimal or binary)
1347 if (base == UnitBase1000)
1356 long double size = input;
1358 // check the size of the input number to fit in the appropriate symbol
1360 while (size > multiple)
1362 size = size / multiple;
1365 // rollback to the previous values and stop the loop when cannot
1366 // represent the number length.
1367 if (sizecount >= MAX_UNIT_FORMAT_SYMBOLS)
1369 size = size * multiple;
1375 // round the input number "half up" to multiples of 10
1376 const int rounding_multiplier = 10;
1377 size = rounding_upwards(size, rounding_multiplier);
1379 // format the input number, placing the appropriate symbol
1381 out.setf (ios::fixed);
1382 if (format == ShortUnitFormat)
1385 out << size << i18n( shortUnitFormatSymbols[sizecount].c_str() );
1390 out << size << i18n( longUnitFormatSymbols[sizecount].c_str() );
1394 } // eo nice_unit_format(int input)
1397 string nice_unit_format(
1399 const UnitFormat format,
1403 // round as double and cast to int64_t
1404 // cast raised overflow error near max val of int64_t (~9.2e18, see unittest)
1405 int64_t input_casted_and_rounded =
1406 boost::numeric_cast<int64_t>( round(input) );
1409 return nice_unit_format( input_casted_and_rounded, format, base );
1410 } // eo nice_unit_format(double input)
1413 string escape(const string &s)
1416 string::size_type p;
1419 while ( (p=out.find_first_of("\"\\",p) ) !=out.npos)
1421 out.insert (p,"\\");
1426 while ( (p=out.find_first_of("\r",p) ) !=out.npos)
1428 out.replace (p,1,"\\r");
1433 while ( (p=out.find_first_of("\n",p) ) !=out.npos)
1435 out.replace (p,1,"\\n");
1442 } // eo scape(const std::string&)
1445 string descape(const string &s, int startpos, int &endpos)
1449 if (s.at(startpos) != '"')
1450 throw out_of_range("value not type escaped string");
1452 out=s.substr(startpos+1);
1453 string::size_type p=0;
1455 // search for the end of the string
1456 while ( (p=out.find("\"",p) ) !=out.npos)
1461 // the " might be escaped with a backslash
1462 while (e>=0 && out.at (e) =='\\')
1464 if (escaped == false)
1478 // we now have the end of the string
1479 out=out.substr(0,p);
1481 // tell calling prog about the endposition
1482 endpos=startpos+p+1;
1484 // descape all \ stuff inside the string now
1486 while ( (p=out.find_first_of("\\",p) ) !=out.npos)
1488 switch (out.at(p+1) )
1491 out.replace(p,2,"\r");
1494 out.replace(p,2,"\n");
1503 } // eo descape(const std::string&,int,int&)
1506 string escape_shellarg(const string &input)
1508 string output = "'";
1509 string::const_iterator it, it_end = input.end();
1510 for (it = input.begin(); it != it_end; ++it)