• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

PowerDNS / pdns / 14230500445

02 Apr 2025 01:53PM UTC coverage: 52.058% (-11.4%) from 63.455%
14230500445

push

github

web-flow
Merge pull request #15385 from rgacogne/ddist-enable-quiche-sni-tests

dnsdist: Enable the DoQ and DoH3 parts of the SNI tests in our CI

21502 of 68138 branches covered (31.56%)

Branch coverage included in aggregate %.

77059 of 121190 relevant lines covered (63.59%)

4345179.2 hits per line

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

0.0
/ext/yahttp/yahttp/router.cpp
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) {
×
12
    std::string method2 = method;
×
13
    bool isopen=false;
×
14
    // add into vector
15
    for(std::string::const_iterator i = url.begin(); i != url.end(); i++) {
×
16
       if (*i == '<' && isopen) throw Error("Invalid URL mask, cannot have < after <");
×
17
       if (*i == '<') isopen = true;
×
18
       if (*i == '>' && !isopen) throw Error("Invalid URL mask, cannot have > without < first");
×
19
       if (*i == '>') isopen = false;
×
20
    }
×
21
    std::transform(method2.begin(), method2.end(), method2.begin(), ::toupper); 
×
22
    routes.push_back(funcptr::make_tuple(method2, url, handler, name));
×
23
  };
×
24

25
  bool Router::match(const std::string& route, const URL& requrl, std::map<std::string, TDelim> &params) {
×
26
     size_t rpos = 0;
×
27
     size_t upos = 0;
×
28
     size_t npos = 0;
×
29
     size_t nstart = 0;
×
30
     size_t nend = 0;
×
31
     std::string pname;
×
32
     for(; rpos < route.size() && upos < requrl.path.size(); ) {
×
33
        if (route[rpos] == '<') {
×
34
          nstart = upos;
×
35
          npos = rpos+1;
×
36
          // start of parameter
37
          while(rpos < route.size() && route[rpos] != '>') {
×
38
            rpos++;
×
39
          }
×
40
          pname = std::string(route.begin()+static_cast<long>(npos), route.begin()+static_cast<long>(rpos));
×
41
          // then we also look it on the url
42
          if (pname[0] == '*') {
×
43
            pname = pname.substr(1);
×
44
            // this matches whatever comes after it, basically end of string
45
            nend = requrl.path.size();
×
46
            if (!pname.empty()) {
×
47
              params[pname] = funcptr::tie(nstart,nend);
×
48
            }
×
49
            rpos = route.size();
×
50
            upos = requrl.path.size();
×
51
            break;
×
52
          }
×
53
          // match until url[upos] or next / if pattern is at end
54
          while (upos < requrl.path.size()) {
×
55
            if (route[rpos+1] == '\0' && requrl.path[upos] == '/') {
×
56
              break;
×
57
            }
×
58
            if (requrl.path[upos] == route[rpos+1]) {
×
59
              break;
×
60
            }
×
61
            upos++;
×
62
          }
×
63
          nend = upos;
×
64
          params[pname] = funcptr::tie(nstart, nend);
×
65
          if (upos > 0) {
×
66
            upos--;
×
67
          }
×
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
71
            rpos++;
×
72
            continue;
×
73
          }
×
74
        }
×
75
        else if (route[rpos] != requrl.path[upos]) {
×
76
          break;
×
77
        }
×
78

79
        rpos++; upos++;
×
80
      }
×
81
      return route[rpos] == requrl.path[upos];
×
82
  }
×
83

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

90
    // iterate routes
91
    for (auto& route: routes) {
×
92
      std::string method;
×
93
      std::string url;
×
94
      funcptr::tie(method, url, handler, rname) = route;
×
95

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

101
      if (matched && !method.empty() && req->method != method) {
×
102
         // method did not match, record it though so we can return correct result
103
         matched = false;
×
104
         seen = true;
×
105
         continue;
×
106
      }
×
107
      if (matched) {
×
108
        break;
×
109
      }
×
110
    }
×
111

112
    if (!matched) {
×
113
      if (seen) {
×
114
        return RouteNoMethod;
×
115
      }
×
116
      // no route
117
      return RouteNotFound;
×
118
    }
×
119

120
    req->parameters.clear();
×
121

122
    for (const auto& param: params) {
×
123
      int nstart = 0;
×
124
      int nend = 0;
×
125
      funcptr::tie(nstart, nend) = param.second;
×
126
      std::string value(req->url.path.begin() + nstart, req->url.path.begin() + nend);
×
127
      value = Utility::decodeURL(value);
×
128
      req->parameters[param.first] = std::move(value);
×
129
    }
×
130

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

133
    return RouteFound;
×
134
  };
×
135

136
  void Router::printRoutes(std::ostream &os) {
×
137
    for(TRouteList::iterator i = routes.begin(); i != routes.end(); i++) {
×
138
#if __cplusplus >= 201103L
×
139
      std::streamsize ss = os.width();
×
140
      std::ios::fmtflags ff = os.setf(std::ios::left);
×
141
      os.width(10);
×
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

169
    if (!found)
×
170
      throw Error("Route not found");
×
171

172
    for(k1=0,k3=0;k1<static_cast<int>(mask.size());k1++) {
×
173
      if (mask[k1] == '<') {
×
174
        std::string pname;
×
175
        strstr_map_t::const_iterator pptr;
×
176
        k2=k1;
×
177
        while(k1<static_cast<int>(mask.size()) && mask[k1]!='>') k1++;
×
178
        path << mask.substr(k3,k2-k3);
×
179
        if (mask[k2+1] == '*')
×
180
          pname = std::string(mask.begin() + k2 + 2, mask.begin() + k1);
×
181
        else 
×
182
          pname = std::string(mask.begin() + k2 + 1, mask.begin() + k1);
×
183
        if ((pptr = arguments.find(pname)) != arguments.end()) 
×
184
          path << Utility::encodeURL(pptr->second);
×
185
        k3 = k1+1;
×
186
      }
×
187
      else if (mask[k1] == '*') {
×
188
        // ready 
189
        k3++;
×
190
        continue;
×
191
      }
×
192
    }
×
193
    path << mask.substr(k3);
×
194
    result = path.str();
×
195
    return std::make_pair(method, result);
×
196
  }
×
197
};
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2025 Coveralls, Inc