2012-01-29 16:34:10 +01:00
|
|
|
/*
|
2014-03-30 12:09:21 +02:00
|
|
|
* nghttp2 - HTTP/2 C Library
|
2012-01-29 16:34:10 +01:00
|
|
|
*
|
|
|
|
* Copyright (c) 2012 Tatsuhiro Tsujikawa
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining
|
|
|
|
* a copy of this software and associated documentation files (the
|
|
|
|
* "Software"), to deal in the Software without restriction, including
|
|
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
|
|
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
|
|
* permit persons to whom the Software is furnished to do so, subject to
|
|
|
|
* the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be
|
|
|
|
* included in all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
|
|
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
|
|
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
|
|
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
#ifndef UTIL_H
|
|
|
|
#define UTIL_H
|
|
|
|
|
2013-07-12 17:19:03 +02:00
|
|
|
#include "nghttp2_config.h"
|
2012-07-27 15:11:13 +02:00
|
|
|
|
2014-01-08 17:27:56 +01:00
|
|
|
#include <unistd.h>
|
|
|
|
#include <getopt.h>
|
|
|
|
|
2012-11-23 13:14:39 +01:00
|
|
|
#include <cstring>
|
2012-01-29 16:34:10 +01:00
|
|
|
#include <vector>
|
|
|
|
#include <string>
|
|
|
|
#include <algorithm>
|
2012-02-07 17:50:58 +01:00
|
|
|
#include <sstream>
|
2013-07-21 16:49:12 +02:00
|
|
|
#include <memory>
|
2012-01-29 16:34:10 +01:00
|
|
|
|
2014-03-04 16:23:33 +01:00
|
|
|
#include <event2/buffer.h>
|
|
|
|
|
2014-02-27 13:47:04 +01:00
|
|
|
#include "http-parser/http_parser.h"
|
|
|
|
|
2013-07-12 17:19:03 +02:00
|
|
|
namespace nghttp2 {
|
2012-01-29 16:34:10 +01:00
|
|
|
|
|
|
|
namespace util {
|
|
|
|
|
2012-11-22 13:46:15 +01:00
|
|
|
template<typename T>
|
|
|
|
class auto_delete {
|
|
|
|
private:
|
|
|
|
T obj_;
|
|
|
|
void (*deleter_)(T);
|
|
|
|
public:
|
|
|
|
auto_delete(T obj, void (*deleter)(T)):obj_(obj), deleter_(deleter) {}
|
|
|
|
|
|
|
|
~auto_delete()
|
|
|
|
{
|
|
|
|
deleter_(obj_);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
class auto_delete_d {
|
|
|
|
private:
|
|
|
|
T obj_;
|
|
|
|
public:
|
|
|
|
auto_delete_d(T obj):obj_(obj) {}
|
|
|
|
|
|
|
|
~auto_delete_d()
|
|
|
|
{
|
|
|
|
delete obj_;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template<typename T, typename R>
|
|
|
|
class auto_delete_r {
|
|
|
|
private:
|
|
|
|
T obj_;
|
|
|
|
R (*deleter_)(T);
|
|
|
|
public:
|
|
|
|
auto_delete_r(T obj, R (*deleter)(T)):obj_(obj), deleter_(deleter) {}
|
|
|
|
|
|
|
|
~auto_delete_r()
|
|
|
|
{
|
|
|
|
(void)deleter_(obj_);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2012-11-23 13:14:39 +01:00
|
|
|
extern const char DEFAULT_STRIP_CHARSET[];
|
2012-01-29 16:34:10 +01:00
|
|
|
|
|
|
|
template<typename InputIterator>
|
|
|
|
std::pair<InputIterator, InputIterator> stripIter
|
|
|
|
(InputIterator first, InputIterator last,
|
2012-11-23 13:14:39 +01:00
|
|
|
const char* chars = DEFAULT_STRIP_CHARSET)
|
2012-01-29 16:34:10 +01:00
|
|
|
{
|
2012-11-23 13:14:39 +01:00
|
|
|
for(; first != last && strchr(chars, *first) != 0; ++first);
|
2012-01-29 16:34:10 +01:00
|
|
|
if(first == last) {
|
|
|
|
return std::make_pair(first, last);
|
|
|
|
}
|
|
|
|
InputIterator left = last-1;
|
2012-11-23 13:14:39 +01:00
|
|
|
for(; left != first && strchr(chars, *left) != 0; --left);
|
2012-01-29 16:34:10 +01:00
|
|
|
return std::make_pair(first, left+1);
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename InputIterator, typename OutputIterator>
|
|
|
|
OutputIterator splitIter
|
|
|
|
(InputIterator first,
|
|
|
|
InputIterator last,
|
|
|
|
OutputIterator out,
|
|
|
|
char delim,
|
|
|
|
bool doStrip = false,
|
|
|
|
bool allowEmpty = false)
|
|
|
|
{
|
|
|
|
for(InputIterator i = first; i != last;) {
|
|
|
|
InputIterator j = std::find(i, last, delim);
|
|
|
|
std::pair<InputIterator, InputIterator> p(i, j);
|
|
|
|
if(doStrip) {
|
|
|
|
p = stripIter(i, j);
|
|
|
|
}
|
|
|
|
if(allowEmpty || p.first != p.second) {
|
|
|
|
*out++ = p;
|
|
|
|
}
|
|
|
|
i = j;
|
|
|
|
if(j != last) {
|
|
|
|
++i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if(allowEmpty &&
|
|
|
|
(first == last || *(last-1) == delim)) {
|
|
|
|
*out++ = std::make_pair(last, last);
|
|
|
|
}
|
|
|
|
return out;
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename InputIterator, typename OutputIterator>
|
|
|
|
OutputIterator split
|
|
|
|
(InputIterator first,
|
|
|
|
InputIterator last,
|
|
|
|
OutputIterator out,
|
|
|
|
char delim,
|
|
|
|
bool doStrip = false,
|
|
|
|
bool allowEmpty = false)
|
|
|
|
{
|
|
|
|
for(InputIterator i = first; i != last;) {
|
|
|
|
InputIterator j = std::find(i, last, delim);
|
|
|
|
std::pair<InputIterator, InputIterator> p(i, j);
|
|
|
|
if(doStrip) {
|
|
|
|
p = stripIter(i, j);
|
|
|
|
}
|
|
|
|
if(allowEmpty || p.first != p.second) {
|
|
|
|
*out++ = std::string(p.first, p.second);
|
|
|
|
}
|
|
|
|
i = j;
|
|
|
|
if(j != last) {
|
|
|
|
++i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if(allowEmpty &&
|
|
|
|
(first == last || *(last-1) == delim)) {
|
|
|
|
*out++ = std::string(last, last);
|
|
|
|
}
|
|
|
|
return out;
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename InputIterator, typename DelimiterType>
|
|
|
|
std::string strjoin(InputIterator first, InputIterator last,
|
|
|
|
const DelimiterType& delim)
|
|
|
|
{
|
|
|
|
std::string result;
|
|
|
|
if(first == last) {
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
InputIterator beforeLast = last-1;
|
|
|
|
for(; first != beforeLast; ++first) {
|
|
|
|
result += *first;
|
|
|
|
result += delim;
|
|
|
|
}
|
|
|
|
result += *beforeLast;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename InputIterator>
|
|
|
|
std::string joinPath(InputIterator first, InputIterator last)
|
|
|
|
{
|
|
|
|
std::vector<std::string> elements;
|
|
|
|
for(;first != last; ++first) {
|
|
|
|
if(*first == "..") {
|
|
|
|
if(!elements.empty()) {
|
|
|
|
elements.pop_back();
|
|
|
|
}
|
|
|
|
} else if(*first == ".") {
|
|
|
|
// do nothing
|
|
|
|
} else {
|
|
|
|
elements.push_back(*first);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return strjoin(elements.begin(), elements.end(), "/");
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isAlpha(const char c);
|
|
|
|
|
|
|
|
bool isDigit(const char c);
|
|
|
|
|
|
|
|
bool isHexDigit(const char c);
|
|
|
|
|
|
|
|
bool inRFC3986UnreservedChars(const char c);
|
|
|
|
|
2014-04-03 06:20:50 +02:00
|
|
|
// Returns true if |c| is in token (HTTP-p1, Section 3.2.6)
|
|
|
|
bool in_token(char c);
|
|
|
|
|
2012-01-29 16:34:10 +01:00
|
|
|
std::string percentEncode(const unsigned char* target, size_t len);
|
|
|
|
|
|
|
|
std::string percentEncode(const std::string& target);
|
|
|
|
|
|
|
|
std::string percentDecode
|
|
|
|
(std::string::const_iterator first, std::string::const_iterator last);
|
|
|
|
|
2014-04-03 06:20:50 +02:00
|
|
|
// Percent encode |target| if character is not in token or '%'.
|
|
|
|
std::string percent_encode_token(const std::string& target);
|
|
|
|
|
2013-07-15 17:15:04 +02:00
|
|
|
std::string format_hex(const unsigned char *s, size_t len);
|
|
|
|
|
2012-02-07 17:50:58 +01:00
|
|
|
std::string http_date(time_t t);
|
|
|
|
|
|
|
|
time_t parse_http_date(const std::string& s);
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
std::string to_str(T value)
|
|
|
|
{
|
|
|
|
std::stringstream ss;
|
|
|
|
ss << value;
|
|
|
|
return ss.str();
|
|
|
|
}
|
|
|
|
|
2012-05-19 10:05:12 +02:00
|
|
|
template<typename InputIterator1, typename InputIterator2>
|
|
|
|
bool startsWith
|
|
|
|
(InputIterator1 first1,
|
|
|
|
InputIterator1 last1,
|
|
|
|
InputIterator2 first2,
|
|
|
|
InputIterator2 last2)
|
|
|
|
{
|
|
|
|
if(last1-first1 < last2-first2) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return std::equal(first2, last2, first1);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool startsWith(const std::string& a, const std::string& b);
|
|
|
|
|
|
|
|
struct CaseCmp {
|
|
|
|
bool operator()(char lhs, char rhs) const
|
|
|
|
{
|
|
|
|
if('A' <= lhs && lhs <= 'Z') {
|
|
|
|
lhs += 'a'-'A';
|
|
|
|
}
|
|
|
|
if('A' <= rhs && rhs <= 'Z') {
|
|
|
|
rhs += 'a'-'A';
|
|
|
|
}
|
|
|
|
return lhs == rhs;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template<typename InputIterator1, typename InputIterator2>
|
|
|
|
bool istartsWith
|
|
|
|
(InputIterator1 first1,
|
|
|
|
InputIterator1 last1,
|
|
|
|
InputIterator2 first2,
|
|
|
|
InputIterator2 last2)
|
|
|
|
{
|
|
|
|
if(last1-first1 < last2-first2) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return std::equal(first2, last2, first1, CaseCmp());
|
|
|
|
}
|
|
|
|
|
|
|
|
bool istartsWith(const std::string& a, const std::string& b);
|
|
|
|
bool istartsWith(const char *a, const char* b);
|
|
|
|
|
2012-02-07 17:50:58 +01:00
|
|
|
template<typename InputIterator1, typename InputIterator2>
|
|
|
|
bool endsWith
|
|
|
|
(InputIterator1 first1,
|
|
|
|
InputIterator1 last1,
|
|
|
|
InputIterator2 first2,
|
|
|
|
InputIterator2 last2)
|
|
|
|
{
|
|
|
|
if(last1-first1 < last2-first2) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return std::equal(first2, last2, last1-(last2-first2));
|
|
|
|
}
|
|
|
|
|
2012-11-22 13:46:15 +01:00
|
|
|
template<typename InputIterator1, typename InputIterator2>
|
|
|
|
bool iendsWith
|
|
|
|
(InputIterator1 first1,
|
|
|
|
InputIterator1 last1,
|
|
|
|
InputIterator2 first2,
|
|
|
|
InputIterator2 last2)
|
|
|
|
{
|
|
|
|
if(last1-first1 < last2-first2) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return std::equal(first2, last2, last1-(last2-first2), CaseCmp());
|
|
|
|
}
|
|
|
|
|
2012-02-07 17:50:58 +01:00
|
|
|
bool endsWith(const std::string& a, const std::string& b);
|
|
|
|
|
2013-08-10 17:08:44 +02:00
|
|
|
int strcompare(const char *a, const uint8_t *b, size_t n);
|
|
|
|
|
2012-11-22 13:46:15 +01:00
|
|
|
bool strieq(const std::string& a, const std::string& b);
|
|
|
|
|
2012-05-19 10:05:12 +02:00
|
|
|
bool strieq(const char *a, const char *b);
|
|
|
|
|
2013-07-19 17:08:14 +02:00
|
|
|
bool strieq(const char *a, const uint8_t *b, size_t n);
|
|
|
|
|
2013-12-21 09:49:31 +01:00
|
|
|
template<typename A, typename B>
|
|
|
|
bool streq(const A *a, const B *b, size_t bn)
|
|
|
|
{
|
|
|
|
if(!a || !b) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
auto blast = b + bn;
|
|
|
|
for(; *a && b != blast && *a == *b; ++a, ++b);
|
|
|
|
return !*a && b == blast;
|
|
|
|
}
|
2013-08-27 17:09:46 +02:00
|
|
|
|
2013-12-21 09:49:31 +01:00
|
|
|
template<typename A, typename B>
|
|
|
|
bool streq(const A *a, size_t alen, const B *b, size_t blen)
|
|
|
|
{
|
|
|
|
if(alen != blen) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return memcmp(a, b, alen) == 0;
|
|
|
|
}
|
2013-08-27 17:09:46 +02:00
|
|
|
|
2012-06-04 16:48:31 +02:00
|
|
|
bool strifind(const char *a, const char *b);
|
|
|
|
|
2012-11-18 13:23:13 +01:00
|
|
|
char upcase(char c);
|
|
|
|
|
|
|
|
char lowcase(char c);
|
|
|
|
|
2013-02-06 15:27:05 +01:00
|
|
|
inline char lowcase(char c)
|
|
|
|
{
|
2013-02-13 16:28:55 +01:00
|
|
|
static unsigned char tbl[] = {
|
|
|
|
0, 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, 'a', 'b', 'c', 'd', 'e', 'f', 'g',
|
|
|
|
'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o',
|
|
|
|
'p', 'q', 'r', 's', 't', 'u', 'v', 'w',
|
|
|
|
'x', 'y', 'z', 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, 245, 246, 247,
|
|
|
|
248, 249, 250, 251, 252, 253, 254, 255,
|
|
|
|
};
|
|
|
|
return tbl[static_cast<unsigned char>(c)];
|
2013-02-06 15:27:05 +01:00
|
|
|
}
|
|
|
|
|
2013-08-27 17:09:46 +02:00
|
|
|
// Lowercase |s| in place.
|
|
|
|
void inp_strlower(std::string& s);
|
|
|
|
|
2013-01-16 14:43:11 +01:00
|
|
|
template<typename T>
|
|
|
|
std::string utos(T n)
|
|
|
|
{
|
|
|
|
std::string res;
|
|
|
|
if(n == 0) {
|
|
|
|
res = "0";
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
int i = 0;
|
|
|
|
T t = n;
|
|
|
|
for(; t; t /= 10, ++i);
|
|
|
|
res.resize(i);
|
|
|
|
--i;
|
|
|
|
for(; n; --i, n /= 10) {
|
|
|
|
res[i] = (n%10) + '0';
|
|
|
|
}
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2014-05-14 15:39:28 +02:00
|
|
|
extern const char UPPER_XDIGITS[];
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
std::string utox(T n)
|
|
|
|
{
|
|
|
|
std::string res;
|
|
|
|
if(n == 0) {
|
|
|
|
res = "0";
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
int i = 0;
|
|
|
|
T t = n;
|
|
|
|
for(; t; t /= 16, ++i);
|
|
|
|
res.resize(i);
|
|
|
|
--i;
|
|
|
|
for(; n; --i, n /= 16) {
|
|
|
|
res[i] = UPPER_XDIGITS[(n & 0x0f)];
|
|
|
|
}
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2013-07-21 16:49:12 +02:00
|
|
|
template<typename T, typename... U>
|
|
|
|
typename std::enable_if<!std::is_array<T>::value, std::unique_ptr<T>>::type
|
|
|
|
make_unique(U&&... u)
|
|
|
|
{
|
|
|
|
return std::unique_ptr<T>(new T(std::forward<U>(u)...));
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
typename std::enable_if<std::is_array<T>::value, std::unique_ptr<T>>::type
|
|
|
|
make_unique(size_t size)
|
|
|
|
{
|
|
|
|
return std::unique_ptr<T>(new typename std::remove_extent<T>::type[size]());
|
|
|
|
}
|
|
|
|
|
2013-08-03 11:51:01 +02:00
|
|
|
void to_token68(std::string& base64str);
|
|
|
|
void to_base64(std::string& token68str);
|
|
|
|
|
2014-01-08 17:27:56 +01:00
|
|
|
void show_candidates(const char *unkopt, option *options);
|
|
|
|
|
2014-02-27 13:47:04 +01:00
|
|
|
bool has_uri_field(const http_parser_url &u, http_parser_url_fields field);
|
|
|
|
|
|
|
|
bool fieldeq(const char *uri1, const http_parser_url &u1,
|
|
|
|
const char *uri2, const http_parser_url &u2,
|
|
|
|
http_parser_url_fields field);
|
|
|
|
|
|
|
|
bool fieldeq(const char *uri, const http_parser_url &u,
|
|
|
|
http_parser_url_fields field,
|
|
|
|
const char *t);
|
|
|
|
|
|
|
|
std::string get_uri_field(const char *uri, const http_parser_url &u,
|
|
|
|
http_parser_url_fields field);
|
|
|
|
|
|
|
|
uint16_t get_default_port(const char *uri, const http_parser_url &u);
|
|
|
|
|
|
|
|
bool porteq(const char *uri1, const http_parser_url &u1,
|
|
|
|
const char *uri2, const http_parser_url &u2);
|
|
|
|
|
|
|
|
void write_uri_field(std::ostream& o,
|
|
|
|
const char *uri, const http_parser_url &u,
|
|
|
|
http_parser_url_fields field);
|
|
|
|
|
2014-03-04 16:23:33 +01:00
|
|
|
class EvbufferBuffer {
|
|
|
|
public:
|
|
|
|
EvbufferBuffer();
|
|
|
|
EvbufferBuffer(evbuffer *evbuffer, uint8_t *buf, size_t bufmax);
|
|
|
|
void reset(evbuffer *evbuffer, uint8_t *buf, size_t bufmax);
|
|
|
|
int flush();
|
|
|
|
int add(const uint8_t *data, size_t datalen);
|
|
|
|
size_t get_buflen() const;
|
|
|
|
private:
|
|
|
|
evbuffer *evbuffer_;
|
|
|
|
uint8_t *buf_;
|
|
|
|
size_t bufmax_;
|
|
|
|
size_t buflen_;
|
|
|
|
};
|
|
|
|
|
2014-03-15 07:32:38 +01:00
|
|
|
bool numeric_host(const char *hostname);
|
|
|
|
|
2014-07-05 11:22:40 +02:00
|
|
|
// Opens |path| with O_APPEND enabled. If file does not exist, it is
|
|
|
|
// created first. This function returns file descriptor referring the
|
|
|
|
// opened file if it succeeds, or -1.
|
|
|
|
int reopen_log_file(const char *path);
|
|
|
|
|
2014-07-12 16:30:13 +02:00
|
|
|
// Returns ASCII dump of |data| of length |len|. Only ASCII printable
|
|
|
|
// characters are preserved. Other characters are replaced with ".".
|
|
|
|
std::string ascii_dump(const uint8_t *data, size_t len);
|
|
|
|
|
2014-08-12 15:22:02 +02:00
|
|
|
// Returns absolute path of executable path. If argc == 0 or |cwd| is
|
|
|
|
// nullptr, this function returns nullptr. If argv[0] starts with
|
|
|
|
// '/', this function returns argv[0]. Oterwise return cwd + "/" +
|
|
|
|
// argv[0]. If non-null is returned, it is NULL-terminated string and
|
|
|
|
// dynamically allocated by malloc. The caller is responsible to free
|
|
|
|
// it.
|
|
|
|
char* get_exec_path(int argc, char **const argv, const char *cwd);
|
|
|
|
|
2012-01-29 16:34:10 +01:00
|
|
|
} // namespace util
|
|
|
|
|
2013-07-12 17:19:03 +02:00
|
|
|
} // namespace nghttp2
|
2012-01-29 16:34:10 +01:00
|
|
|
|
|
|
|
#endif // UTIL_H
|