File: consistenthash.h

package info (click to toggle)
trafficserver 9.2.5%2Bds-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 53,008 kB
  • sloc: cpp: 345,484; ansic: 31,134; python: 24,200; sh: 7,271; makefile: 3,045; perl: 2,261; java: 277; pascal: 119; sql: 94; xml: 2
file content (84 lines) | stat: -rw-r--r-- 3,305 bytes parent folder | download | duplicates (2)
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
/*
 * 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.
 */

#pragma once

#include "strategy.h"
#include "healthstatus.h"

class PLNextHopSelectionStrategy;

constexpr const unsigned int PL_NH_MAX_GROUP_RINGS = 5;

enum PLNHHashKeyType {
  PL_NH_URL_HASH_KEY = 0,
  PL_NH_HOSTNAME_HASH_KEY,
  PL_NH_PATH_HASH_KEY, // default, consistent hash uses the request url path
  PL_NH_PATH_QUERY_HASH_KEY,
  PL_NH_PATH_FRAGMENT_HASH_KEY,
  PL_NH_CACHE_HASH_KEY
};

// The transaction state needed by PLNextHopConsistentHash about the last parent found,
// which is needed to find the next parent.
// Does not include the data already in ResponseAction.
//
// TODO initialize? zero? -1?
struct PLNextHopConsistentHashTxn {
  PLNHParentResultType result            = PL_NH_PARENT_UNDEFINED;
  bool chash_init[PL_NH_MAX_GROUP_RINGS] = {false};
  TSHostStatus first_choice_status       = TSHostStatus::TS_HOST_STATUS_INIT;
  int line_number                        = -1;
  uint32_t last_parent;
  uint32_t start_parent;
  uint32_t last_group;
  bool wrap_around;
  bool mapWrapped[2];
  int last_lookup;
  ATSConsistentHashIter chashIter[PL_NH_MAX_GROUP_RINGS];
  const char *hostname = "";
  size_t hostname_len  = 0;
  in_port_t port       = 0;
  bool retry           = false;
  bool no_cache        = false;
};

class PLNextHopConsistentHash : public PLNextHopSelectionStrategy
{
  std::vector<std::shared_ptr<ATSConsistentHash>> rings;
  uint64_t getHashKey(uint64_t sm_id, TSMBuffer reqp, TSMLoc url, TSMLoc parent_selection_url, ATSHash64 *h);

  std::shared_ptr<PLHostRecord> chashLookup(const std::shared_ptr<ATSConsistentHash> &ring, uint32_t cur_ring,
                                            PLNextHopConsistentHashTxn *state, bool *wrapped, uint64_t sm_id, TSMBuffer reqp,
                                            TSMLoc url, TSMLoc parent_selection_url);

public:
  const uint32_t LineNumberPlaceholder = 99999;

  PLNHHashKeyType hash_key = PL_NH_PATH_HASH_KEY;

  PLNextHopConsistentHash() = delete;
  PLNextHopConsistentHash(const std::string_view name, const YAML::Node &n);
  ~PLNextHopConsistentHash();
  void next(TSHttpTxn txnp, void *strategyTxn, const char **out_hostname, size_t *out_hostname_len, in_port_t *out_port,
            bool *out_retry, bool *out_no_cache, time_t now = 0) override;
  void mark(TSHttpTxn txnp, void *strategyTxn, const char *hostname, const size_t hostname_len, const in_port_t port,
            const PLNHCmd status, const time_t now) override;
  void *newTxn() override;
  void deleteTxn(void *txn) override;
};