13111317048

Committed 03 Feb 2025 10:22AM UTC coverage: 64.724% (+9.5%) from 55.194%

Build # 13111317048

Build Type

Pull #14724

github

Committed by

web-flow

Commit Message

Merge cced151a0 into db18c3a17

Pull Request Pull Request #14724: dnsdist: Add meson support

Run Details

38354 of 90334 branches covered (42.46%)

Branch coverage included in aggregate %.

449 of 624 new or added lines in 40 files covered. (71.96%)

6809 existing lines in 147 files now uncovered.

128214 of 167016 relevant lines covered (76.77%)

4848378.55 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

58.37

/ext/yahttp/yahttp/router.cpp

/* @file
 * @brief Concrete implementation of Router 
 */
#include "yahttp.hpp"
#include "router.hpp"

namespace YaHTTP {
  // router is defined here.
  YaHTTP::Router Router::router;

  void Router::map(const std::string& method, const std::string& url, THandlerFunction handler, const std::string& name) {
    std::string method2 = method;
    bool isopen=false;
    // add into vector
    for(std::string::const_iterator i = url.begin(); i != url.end(); i++) {
       if (*i == '<' && isopen) throw Error("Invalid URL mask, cannot have < after <");
       if (*i == '<') isopen = true;
       if (*i == '>' && !isopen) throw Error("Invalid URL mask, cannot have > without < first");
       if (*i == '>') isopen = false;
    }
    std::transform(method2.begin(), method2.end(), method2.begin(), ::toupper); 
    routes.push_back(funcptr::make_tuple(method2, url, handler, name));
  };

  bool Router::match(const std::string& route, const URL& requrl, std::map<std::string, TDelim> &params) {
     size_t rpos = 0;
     size_t upos = 0;
     size_t npos = 0;
     size_t nstart = 0;
     size_t nend = 0;
     std::string pname;
     for(; rpos < route.size() && upos < requrl.path.size(); ) {
        if (route[rpos] == '<') {
          nstart = upos;
          npos = rpos+1;
          // start of parameter
          while(rpos < route.size() && route[rpos] != '>') {
            rpos++;
          }
          pname = std::string(route.begin()+static_cast<long>(npos), route.begin()+static_cast<long>(rpos));
          // then we also look it on the url
          if (pname[0] == '*') {
            pname = pname.substr(1);
            // this matches whatever comes after it, basically end of string
            nend = requrl.path.size();
            if (!pname.empty()) {
              params[pname] = funcptr::tie(nstart,nend);
            }
            rpos = route.size();
            upos = requrl.path.size();
            break;
          }
          // match until url[upos] or next / if pattern is at end
          while (upos < requrl.path.size()) {
            if (route[rpos+1] == '\0' && requrl.path[upos] == '/') {
              break;
            }
            if (requrl.path[upos] == route[rpos+1]) {
              break;
            }
            upos++;
          }
          nend = upos;
          params[pname] = funcptr::tie(nstart, nend);
          if (upos > 0) {
            upos--;
          }
          else {
            // If upos is zero, do not decrement it and then increment at bottom of loop, this disturbs Coverity.
            // Only increment rpos and continue loop
            rpos++;
            continue;
          }
        }
        else if (route[rpos] != requrl.path[upos]) {
          break;
        }

        rpos++; upos++;
      }
      return route[rpos] == requrl.path[upos];
  }

  RoutingResult Router::route(Request *req, THandlerFunction& handler) {
    std::map<std::string, TDelim> params;
    bool matched = false;
    bool seen = false;
    std::string rname;

    // iterate routes
    for (auto& route: routes) {
      std::string method;
      std::string url;
      funcptr::tie(method, url, handler, rname) = route;

      // see if we can't match the url
      params.clear();
      // simple matcher func
      matched = match(url, req->url, params);

      if (matched && !method.empty() && req->method != method) {
         // method did not match, record it though so we can return correct result
         matched = false;
         seen = true;
         continue;
      }
      if (matched) {
        break;
      }
    }

    if (!matched) {
      if (seen) {
        return RouteNoMethod;
      }
      // no route
      return RouteNotFound;
    }

    req->parameters.clear();

    for (const auto& param: params) {
      int nstart = 0;
      int nend = 0;
      funcptr::tie(nstart, nend) = param.second;
      std::string value(req->url.path.begin() + nstart, req->url.path.begin() + nend);
      value = Utility::decodeURL(value);
      req->parameters[param.first] = std::move(value);
    }

    req->routeName = std::move(rname);

    return RouteFound;
  };

  void Router::printRoutes(std::ostream &os) {
    for(TRouteList::iterator i = routes.begin(); i != routes.end(); i++) {
#if __cplusplus >= 201103L
      std::streamsize ss = os.width();
      std::ios::fmtflags ff = os.setf(std::ios::left);
      os.width(10);
      os << std::get<0>(*i);
      os.width(50);
      os << std::get<1>(*i);
      os.width(ss);
      os.setf(ff);
      os << "    " << std::get<3>(*i);
      os << std::endl;
#else
      os << i->get<0>() << "    " << i->get<1>() << "    " << i->get<3>() << std::endl;
#endif
    } 
  };

  std::pair<std::string,std::string> Router::urlFor(const std::string &name, const strstr_map_t& arguments) {
    std::ostringstream path;
    std::string mask,method,result;
    int k1,k2,k3;

    bool found = false;
    for(TRouteList::iterator i = routes.begin(); !found && i != routes.end(); i++) {
#if __cplusplus >= 201103L
      if (std::get<3>(*i) == name) { mask = std::get<1>(*i); method = std::get<0>(*i); found = true; }
#else
      if (i->get<3>() == name) { mask = i->get<1>(); method = i->get<0>(); found = true; }
#endif
    }

    if (!found)
      throw Error("Route not found");

    for(k1=0,k3=0;k1<static_cast<int>(mask.size());k1++) {
      if (mask[k1] == '<') {
        std::string pname;
        strstr_map_t::const_iterator pptr;
        k2=k1;
        while(k1<static_cast<int>(mask.size()) && mask[k1]!='>') k1++;
        path << mask.substr(k3,k2-k3);
        if (mask[k2+1] == '*')
          pname = std::string(mask.begin() + k2 + 2, mask.begin() + k1);
        else 
          pname = std::string(mask.begin() + k2 + 1, mask.begin() + k1);
        if ((pptr = arguments.find(pname)) != arguments.end()) 
          path << Utility::encodeURL(pptr->second);
        k3 = k1+1;
      }
      else if (mask[k1] == '*') {
        // ready 
        k3++;
        continue;
      }
    }
    path << mask.substr(k3);
    result = path.str();
    return std::make_pair(method, result);
  }
};

1	/* @file
2	* @brief Concrete implementation of Router
3	*/
4	#include "yahttp.hpp"
5	#include "router.hpp"
6
7	namespace YaHTTP {
8	// router is defined here.
9	YaHTTP::Router Router::router;
10
11	void Router::map(const std::string& method, const std::string& url, THandlerFunction handler, const std::string& name) {	1,028✔
12	std::string method2 = method;	1,028✔
13	bool isopen=false;	1,028✔
14	// add into vector
15	for(std::string::const_iterator i = url.begin(); i != url.end(); i++) {	31,634✔
16	if (*i == '<' && isopen) throw Error("Invalid URL mask, cannot have < after <");	30,606!
17	if (*i == '<') isopen = true;	30,606✔
18	if (*i == '>' && !isopen) throw Error("Invalid URL mask, cannot have > without < first");	30,606!
19	if (*i == '>') isopen = false;	30,606✔
20	}	30,606✔
21	std::transform(method2.begin(), method2.end(), method2.begin(), ::toupper);	1,028✔
22	routes.push_back(funcptr::make_tuple(method2, url, handler, name));	1,028✔
23	};	1,028✔
24
25	bool Router::match(const std::string& route, const URL& requrl, std::map<std::string, TDelim> &params) {	42,706✔
26	size_t rpos = 0;	42,706✔
27	size_t upos = 0;	42,706✔
28	size_t npos = 0;	42,706✔
29	size_t nstart = 0;	42,706✔
30	size_t nend = 0;	42,706✔
31	std::string pname;	42,706✔
32	for(; rpos < route.size() && upos < requrl.path.size(); ) {	1,223,807✔
33	if (route[rpos] == '<') {	1,200,716✔
34	nstart = upos;	11,190✔
35	npos = rpos+1;	11,190✔
36	// start of parameter
37	while(rpos < route.size() && route[rpos] != '>') {	48,796!
38	rpos++;	37,606✔
39	}	37,606✔
40	pname = std::string(route.begin()+static_cast<long>(npos), route.begin()+static_cast<long>(rpos));	11,190✔
41	// then we also look it on the url
42	if (pname[0] == '*') {	11,190✔
43	pname = pname.substr(1);	1,594✔
44	// this matches whatever comes after it, basically end of string
45	nend = requrl.path.size();	1,594✔
46	if (!pname.empty()) {	1,594!
47	params[pname] = funcptr::tie(nstart,nend);	1,594✔
48	}	1,594✔
49	rpos = route.size();	1,594✔
50	upos = requrl.path.size();	1,594✔
51	break;	1,594✔
52	}	1,594✔
53	// match until url[upos] or next / if pattern is at end
54	while (upos < requrl.path.size()) {	214,392✔
55	if (route[rpos+1] == '\0' && requrl.path[upos] == '/') {	206,424!
56	break;	×
57	}	×
58	if (requrl.path[upos] == route[rpos+1]) {	206,424✔
59	break;	1,628✔
60	}	1,628✔
61	upos++;	204,796✔
62	}	204,796✔
63	nend = upos;	9,596✔
64	params[pname] = funcptr::tie(nstart, nend);	9,596✔
65	if (upos > 0) {	9,596!
66	upos--;	9,596✔
67	}	9,596✔
68	else {	×
69	// If upos is zero, do not decrement it and then increment at bottom of loop, this disturbs Coverity.
70	// Only increment rpos and continue loop
UNCOV 71	rpos++;	×
72	continue;	×
73	}	×
74	}	9,596✔
75	else if (route[rpos] != requrl.path[upos]) {	1,189,526✔
76	break;	18,021✔
77	}	18,021✔
78
79	rpos++; upos++;	1,181,101✔
80	}	1,181,101✔
81	return route[rpos] == requrl.path[upos];	42,706✔
82	}	42,706✔
83
84	RoutingResult Router::route(Request *req, THandlerFunction& handler) {	1,609✔
85	std::map<std::string, TDelim> params;	1,609✔
86	bool matched = false;	1,609✔
87	bool seen = false;	1,609✔
88	std::string rname;	1,609✔
89
90	// iterate routes
91	for (auto& route: routes) {	42,115!
92	std::string method;	42,115✔
93	std::string url;	42,115✔
94	funcptr::tie(method, url, handler, rname) = route;	42,115✔
95
96	// see if we can't match the url
97	params.clear();	42,115✔
98	// simple matcher func
99	matched = match(url, req->url, params);	42,115✔
100
101	if (matched && !method.empty() && req->method != method) {	42,115✔
102	// method did not match, record it though so we can return correct result
103	matched = false;	2,877✔
104	seen = true;	2,877✔
105	continue;	2,877✔
106	}	2,877✔
107	if (matched) {	39,238✔
108	break;	1,609✔
109	}	1,609✔
110	}	39,238✔
111
112	if (!matched) {	1,609!
113	if (seen) {	×
114	return RouteNoMethod;	×
115	}	×
116	// no route
117	return RouteNotFound;	×
118	}	×
119
120	req->parameters.clear();	1,609✔
121
122	for (const auto& param: params) {	1,609✔
123	int nstart = 0;	813✔
124	int nend = 0;	813✔
125	funcptr::tie(nstart, nend) = param.second;	813✔
126	std::string value(req->url.path.begin() + nstart, req->url.path.begin() + nend);	813✔
127	value = Utility::decodeURL(value);	813✔
128	req->parameters[param.first] = std::move(value);	813✔
129	}	813✔
130
131	req->routeName = std::move(rname);	1,609✔
132
133	return RouteFound;	1,609✔
134	};	1,609✔
135
UNCOV 136	void Router::printRoutes(std::ostream &os) {	×
UNCOV 137	for(TRouteList::iterator i = routes.begin(); i != routes.end(); i++) {	×
138	#if __cplusplus >= 201103L	×
UNCOV 139	std::streamsize ss = os.width();	×
140	std::ios::fmtflags ff = os.setf(std::ios::left);	×
141	os.width(10);	×
UNCOV 142	os << std::get<0>(*i);	×
143	os.width(50);	×
144	os << std::get<1>(*i);	×
145	os.width(ss);	×
146	os.setf(ff);	×
147	os << " " << std::get<3>(*i);	×
148	os << std::endl;	×
149	#else
150	os << i->get<0>() << " " << i->get<1>() << " " << i->get<3>() << std::endl;
151	#endif
152	}	×
153	};	×
154
155	std::pair<std::string,std::string> Router::urlFor(const std::string &name, const strstr_map_t& arguments) {	×
156	std::ostringstream path;	×
157	std::string mask,method,result;	×
158	int k1,k2,k3;	×
159
160	bool found = false;	×
161	for(TRouteList::iterator i = routes.begin(); !found && i != routes.end(); i++) {	×
162	#if __cplusplus >= 201103L	×
163	if (std::get<3>(i) == name) { mask = std::get<1>(i); method = std::get<0>(*i); found = true; }	×
164	#else
165	if (i->get<3>() == name) { mask = i->get<1>(); method = i->get<0>(); found = true; }
166	#endif
167	}	×
168
UNCOV 169	if (!found)	×
UNCOV 170	throw Error("Route not found");	×
171
UNCOV 172	for(k1=0,k3=0;k1<static_cast<int>(mask.size());k1++) {	×
UNCOV 173	if (mask[k1] == '<') {	×
UNCOV 174	std::string pname;	×
UNCOV 175	strstr_map_t::const_iterator pptr;	×
UNCOV 176	k2=k1;	×
UNCOV 177	while(k1<static_cast<int>(mask.size()) && mask[k1]!='>') k1++;	×
UNCOV 178	path << mask.substr(k3,k2-k3);	×
UNCOV 179	if (mask[k2+1] == '*')	×
UNCOV 180	pname = std::string(mask.begin() + k2 + 2, mask.begin() + k1);	×
UNCOV 181	else	×
UNCOV 182	pname = std::string(mask.begin() + k2 + 1, mask.begin() + k1);	×
UNCOV 183	if ((pptr = arguments.find(pname)) != arguments.end())	×
UNCOV 184	path << Utility::encodeURL(pptr->second);	×
UNCOV 185	k3 = k1+1;	×
UNCOV 186	}	×
UNCOV 187	else if (mask[k1] == '*') {	×
188	// ready
UNCOV 189	k3++;	×
UNCOV 190	continue;	×
UNCOV 191	}	×
UNCOV 192	}	×
UNCOV 193	path << mask.substr(k3);	×
UNCOV 194	result = path.str();	×
UNCOV 195	return std::make_pair(method, result);	×
UNCOV 196	}	×
197	};

PowerDNS / pdns / 13111317048

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous