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 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 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453
|
/** @file
Implementation of nexthop consistent hash selections strategies.
@section license License
Licensed to the Apache Software Foundation (ASF) under one
or more contributor license agreements. See the NOTICE file
distributed with this work for additional information
regarding copyright ownership. The ASF licenses this file
to you under the Apache License, Version 2.0 (the
"License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
#include <yaml-cpp/yaml.h>
#include "HttpSM.h"
#include "I_Machine.h"
#include "YamlCfg.h"
#include "NextHopConsistentHash.h"
// hash_key strings.
constexpr std::string_view hash_key_url = "url";
constexpr std::string_view hash_key_hostname = "hostname";
constexpr std::string_view hash_key_path = "path";
constexpr std::string_view hash_key_path_query = "path+query";
constexpr std::string_view hash_key_path_fragment = "path+fragment";
constexpr std::string_view hash_key_cache = "cache_key";
static bool
isWrapped(std::vector<bool> &wrap_around, uint32_t groups)
{
bool all_wrapped = true;
for (uint32_t c = 0; c < groups; c++) {
if (wrap_around[c] == false) {
all_wrapped = false;
}
}
return all_wrapped;
}
std::shared_ptr<HostRecord>
NextHopConsistentHash::chashLookup(const std::shared_ptr<ATSConsistentHash> &ring, uint32_t cur_ring, ParentResult &result,
HttpRequestData &request_info, bool *wrapped, uint64_t sm_id)
{
uint64_t hash_key = 0;
ATSHash64Sip24 hash;
HostRecord *host_rec = nullptr;
ATSConsistentHashIter *iter = &result.chashIter[cur_ring];
if (result.chash_init[cur_ring] == false) {
hash_key = getHashKey(sm_id, request_info, &hash);
host_rec = static_cast<HostRecord *>(ring->lookup_by_hashval(hash_key, iter, wrapped));
result.chash_init[cur_ring] = true;
} else {
host_rec = static_cast<HostRecord *>(ring->lookup(nullptr, iter, wrapped, &hash));
}
bool wrap_around = *wrapped;
*wrapped = (result.mapWrapped[cur_ring] && *wrapped) ? true : false;
if (!result.mapWrapped[cur_ring] && wrap_around) {
result.mapWrapped[cur_ring] = true;
}
if (host_rec == nullptr) {
return nullptr;
} else {
std::shared_ptr<HostRecord> h = host_groups[host_rec->group_index][host_rec->host_index];
return h;
}
}
NextHopConsistentHash::~NextHopConsistentHash()
{
NH_Debug(NH_DEBUG_TAG, "destructor called for strategy named: %s", strategy_name.c_str());
}
NextHopConsistentHash::NextHopConsistentHash(const std::string_view name, const NHPolicyType &policy, ts::Yaml::Map &n)
: NextHopSelectionStrategy(name, policy, n)
{
ATSHash64Sip24 hash;
try {
if (n["hash_key"]) {
auto hash_key_val = n["hash_key"].Scalar();
if (hash_key_val == hash_key_url) {
hash_key = NH_URL_HASH_KEY;
} else if (hash_key_val == hash_key_hostname) {
hash_key = NH_HOSTNAME_HASH_KEY;
} else if (hash_key_val == hash_key_path) {
hash_key = NH_PATH_HASH_KEY;
} else if (hash_key_val == hash_key_path_query) {
hash_key = NH_PATH_QUERY_HASH_KEY;
} else if (hash_key_val == hash_key_path_fragment) {
hash_key = NH_PATH_FRAGMENT_HASH_KEY;
} else if (hash_key_val == hash_key_cache) {
hash_key = NH_CACHE_HASH_KEY;
} else {
hash_key = NH_PATH_HASH_KEY;
NH_Note("Invalid 'hash_key' value, '%s', for the strategy named '%s', using default '%s'.", hash_key_val.c_str(),
strategy_name.c_str(), hash_key_path.data());
}
}
} catch (std::exception &ex) {
throw std::invalid_argument("Error parsing the strategy named '" + strategy_name + "' due to '" + ex.what() +
"', this strategy will be ignored.");
}
// load up the hash rings.
for (uint32_t i = 0; i < groups; i++) {
std::shared_ptr<ATSConsistentHash> hash_ring = std::make_shared<ATSConsistentHash>();
for (uint32_t j = 0; j < host_groups[i].size(); j++) {
// ATSConsistentHash needs the raw pointer.
HostRecord *p = host_groups[i][j].get();
// need to copy the 'hash_string' or 'hostname' cstring to 'name' for insertion into ATSConsistentHash.
if (!p->hash_string.empty()) {
p->name = const_cast<char *>(p->hash_string.c_str());
} else {
p->name = const_cast<char *>(p->hostname.c_str());
}
p->group_index = host_groups[i][j]->group_index;
p->host_index = host_groups[i][j]->host_index;
hash_ring->insert(p, p->weight, &hash);
NH_Debug(NH_DEBUG_TAG, "Loading hash rings - ring: %d, host record: %d, name: %s, hostname: %s, strategy: %s", i, j, p->name,
p->hostname.c_str(), strategy_name.c_str());
}
hash.clear();
rings.push_back(std::move(hash_ring));
}
}
// returns a hash key calculated from the request and 'hash_key' configuration
// parameter.
uint64_t
NextHopConsistentHash::getHashKey(uint64_t sm_id, const HttpRequestData &hrdata, ATSHash64 *h)
{
URL *url = hrdata.hdr->url_get();
URL *ps_url = nullptr;
int len = 0;
const char *url_string_ref = nullptr;
// calculate a hash using the selected config.
switch (hash_key) {
case NH_URL_HASH_KEY:
url_string_ref = url->string_get_ref(&len, URLNormalize::LC_SCHEME_HOST);
if (url_string_ref && len > 0) {
h->update(url_string_ref, len);
NH_Debug(NH_DEBUG_TAG, "[%" PRIu64 "] url hash string: %s", sm_id, url_string_ref);
}
break;
// hostname hash
case NH_HOSTNAME_HASH_KEY:
url_string_ref = url->host_get(&len);
if (url_string_ref && len > 0) {
h->update(url_string_ref, len);
}
break;
// path + query string
case NH_PATH_QUERY_HASH_KEY:
url_string_ref = url->path_get(&len);
h->update("/", 1);
if (url_string_ref && len > 0) {
h->update(url_string_ref, len);
}
url_string_ref = url->query_get(&len);
if (url_string_ref && len > 0) {
h->update("?", 1);
h->update(url_string_ref, len);
}
break;
// path + fragment hash
case NH_PATH_FRAGMENT_HASH_KEY:
url_string_ref = url->path_get(&len);
h->update("/", 1);
if (url_string_ref && len > 0) {
h->update(url_string_ref, len);
}
url_string_ref = url->fragment_get(&len);
if (url_string_ref && len > 0) {
h->update("?", 1);
h->update(url_string_ref, len);
}
break;
// use the cache key created by the cache-key plugin.
case NH_CACHE_HASH_KEY:
ps_url = *(hrdata.cache_info_parent_selection_url);
if (ps_url) {
url_string_ref = ps_url->string_get_ref(&len);
if (url_string_ref && len > 0) {
NH_Debug(NH_DEBUG_TAG, "[%" PRIu64 "] using parent selection over-ride string:'%.*s'.", sm_id, len, url_string_ref);
h->update(url_string_ref, len);
}
} else {
url_string_ref = url->path_get(&len);
h->update("/", 1);
if (url_string_ref && len > 0) {
NH_Debug(NH_DEBUG_TAG, "[%" PRIu64 "] the parent selection over-ride url is not set, using default path: %s.", sm_id,
url_string_ref);
h->update(url_string_ref, len);
}
}
break;
// use the path as the hash, default.
case NH_PATH_HASH_KEY:
default:
url_string_ref = url->path_get(&len);
h->update("/", 1);
if (url_string_ref && len > 0) {
h->update(url_string_ref, len);
}
break;
}
h->final();
return h->get();
}
void
NextHopConsistentHash::findNextHop(TSHttpTxn txnp, void *ih, time_t now)
{
uint32_t const NO_RING_USE_POST_REMAP = uint32_t(0) - 1;
HttpSM *sm = reinterpret_cast<HttpSM *>(txnp);
ParentResult &result = sm->t_state.parent_result;
HttpRequestData &request_info = sm->t_state.request_data;
int64_t sm_id = sm->sm_id;
int64_t retry_time = sm->t_state.txn_conf->parent_retry_time;
time_t _now = now;
bool firstcall = false;
bool nextHopRetry = false;
bool wrapped = false;
std::vector<bool> wrap_around(groups, false);
uint32_t cur_ring = 0; // there is a hash ring for each host group
uint32_t lookups = 0;
std::shared_ptr<HostRecord> pRec = nullptr;
HostStatus &pStatus = HostStatus::instance();
TSHostStatus host_stat = TSHostStatus::TS_HOST_STATUS_INIT;
HostStatRec *hst = nullptr;
Machine *machine = Machine::instance();
std::string_view first_call_host;
int first_call_port = 0;
if (result.line_number == -1 && result.result == PARENT_UNDEFINED) {
firstcall = true;
}
// firstcall indicates that this is the first time the state machine has called findNextHop() for this
// particular transaction so, a parent will be looked up using a hash from the request to locate a
// parent on the consistent hash ring. If not first call, then the transaction was unable to use the parent
// returned from the "firstcall" due to some error so, subsequent calls will not search using a hash but,
// will instead just increment the hash table iterator to find the next parent on the ring
if (firstcall) {
NH_Debug(NH_DEBUG_TAG, "[%" PRIu64 "] firstcall, line_number: %d, result: %s", sm_id, result.line_number,
ParentResultStr[result.result]);
result.line_number = distance;
cur_ring = 0;
for (uint32_t i = 0; i < groups; i++) {
result.chash_init[i] = false;
wrap_around[i] = false;
}
} else {
// not first call, save the previously tried parent.
if (result.hostname) {
first_call_host = result.hostname;
first_call_port = result.port;
}
NH_Debug(NH_DEBUG_TAG, "[%" PRIu64 "] not firstcall, line_number: %d, result: %s", sm_id, result.line_number,
ParentResultStr[result.result]);
switch (ring_mode) {
case NH_ALTERNATE_RING:
if (groups > 1) {
cur_ring = (result.last_group + 1) % groups;
} else {
cur_ring = result.last_group;
}
break;
case NH_PEERING_RING:
if (groups == 1) {
result.last_group = cur_ring = NO_RING_USE_POST_REMAP;
} else {
ink_assert(groups == 2);
// look for the next parent on the
// upstream ring.
result.last_group = cur_ring = 1;
}
break;
case NH_EXHAUST_RING:
default:
if (!wrapped) {
cur_ring = result.last_group;
} else if (groups > 1) {
cur_ring = (result.last_group + 1) % groups;
}
break;
}
}
if (cur_ring != NO_RING_USE_POST_REMAP) {
do {
// all host groups have been searched and there are no available parents found
if (isWrapped(wrap_around, groups)) {
NH_Debug(NH_DEBUG_TAG, "[%" PRIu64 "] No available parents.", sm_id);
pRec = nullptr;
break;
}
// search for available parent
std::shared_ptr<ATSConsistentHash> r = rings[cur_ring];
pRec = chashLookup(r, cur_ring, result, request_info, &wrapped, sm_id);
hst = (pRec) ? pStatus.getHostStatus(pRec->hostname.c_str()) : nullptr;
wrap_around[cur_ring] = wrapped;
lookups++;
// found a parent
if (pRec) {
bool is_self = machine->is_self(pRec->hostname.c_str());
host_stat = (hst) ? hst->status : TSHostStatus::TS_HOST_STATUS_UP;
// if the config ignore_self_detect is set to true and the host is down due to SELF_DETECT reason
// ignore the down status and mark it as available
if ((host_stat == TS_HOST_STATUS_DOWN && is_self && ignore_self_detect)) {
if (hst->reasons == Reason::SELF_DETECT) {
host_stat = TS_HOST_STATUS_UP;
}
}
if (firstcall) {
result.first_choice_status = (hst) ? hst->status : TSHostStatus::TS_HOST_STATUS_UP;
// if peering and the selected host is myself, change rings and search for an upstream parent.
if (ring_mode == NH_PEERING_RING && (pRec->self || is_self)) {
if (groups == 1) {
// use host from post-remap URL
cur_ring = NO_RING_USE_POST_REMAP;
pRec = nullptr;
break;
} else {
// switch to and search the upstream ring.
cur_ring = 1;
pRec = nullptr;
continue;
}
}
} else {
// not first call, make sure we're not re-using the same parent, search again if we are.
if (first_call_host.size() > 0 && first_call_host == pRec->hostname && first_call_port == pRec->getPort(scheme)) {
pRec = nullptr;
continue;
}
}
// if the parent is not available check to see if the retry window has expired making it available
// for retry.
if (!pRec->available.load() && host_stat == TS_HOST_STATUS_UP) {
_now == 0 ? _now = time(nullptr) : _now = now;
if ((pRec->failedAt.load() + retry_time) < static_cast<unsigned>(_now)) {
nextHopRetry = true;
result.last_parent = pRec->host_index;
result.last_lookup = pRec->group_index;
result.retry = nextHopRetry;
result.result = PARENT_SPECIFIED;
NH_Debug(NH_DEBUG_TAG, "[%" PRIu64 "] next hop %s is now retryable", sm_id, pRec->hostname.c_str());
break;
}
}
// use the available selected parent
if (pRec->available.load() && host_stat == TS_HOST_STATUS_UP) {
break;
}
}
// try other rings per the ring mode
switch (ring_mode) {
case NH_ALTERNATE_RING:
if (pRec && groups > 0) {
cur_ring = (pRec->group_index + 1) % groups;
} else {
cur_ring = 0;
}
break;
case NH_EXHAUST_RING:
default:
if (wrap_around[cur_ring] && groups > 1) {
cur_ring = (cur_ring + 1) % groups;
}
break;
}
if (pRec) {
// if the selected host is down, search again.
if (!pRec->available || host_stat == TS_HOST_STATUS_DOWN) {
NH_Debug(NH_DEBUG_TAG, "[%" PRIu64 "] hostname: %s, available: %s, host_stat: %s", sm_id, pRec->hostname.c_str(),
pRec->available ? "true" : "false", HostStatusNames[host_stat]);
pRec = nullptr;
continue;
}
}
} while (!pRec);
NH_Debug(NH_DEBUG_TAG, "[%" PRIu64 "] Initial parent lookups: %d", sm_id, lookups);
}
// ----------------------------------------------------------------------------------------------------
// Validate and return the final result.
// ----------------------------------------------------------------------------------------------------
if (pRec && host_stat == TS_HOST_STATUS_UP && (pRec->available.load() || result.retry)) {
result.result = PARENT_SPECIFIED;
result.hostname = pRec->hostname.c_str();
result.last_parent = pRec->host_index;
result.last_lookup = result.last_group = cur_ring;
switch (scheme) {
case NH_SCHEME_NONE:
case NH_SCHEME_HTTP:
result.port = pRec->getPort(scheme);
break;
case NH_SCHEME_HTTPS:
result.port = pRec->getPort(scheme);
break;
}
result.retry = nextHopRetry;
// if using a peering ring mode and the parent selected came from the 'peering' group,
// cur_ring == 0, then if the config allows it, set the flag to not cache the result.
if (ring_mode == NH_PEERING_RING && !cache_peer_result && cur_ring == 0) {
result.do_not_cache_response = true;
NH_Debug(NH_DEBUG_TAG, "[%" PRIu64 "] setting do not cache response from a peer per config: %s", sm_id,
(result.do_not_cache_response) ? "true" : "false");
}
ink_assert(result.hostname != nullptr);
ink_assert(result.port != 0);
NH_Debug(NH_DEBUG_TAG, "[%" PRIu64 "] result->result: %s Chosen parent: %s.%d", sm_id, ParentResultStr[result.result],
result.hostname, result.port);
} else {
if (go_direct == true) {
result.result = PARENT_DIRECT;
} else {
result.result = PARENT_FAIL;
}
result.hostname = nullptr;
result.port = 0;
result.retry = false;
NH_Debug(NH_DEBUG_TAG, "[%" PRIu64 "] result.result: %s set hostname null port 0 retry false", sm_id,
ParentResultStr[result.result]);
}
return;
}
|