93 lines
3.4 KiB
C++
93 lines
3.4 KiB
C++
/*
|
|
* TransactionTagCounter.cpp
|
|
*
|
|
* This source file is part of the FoundationDB open source project
|
|
*
|
|
* Copyright 2013-2022 Apple Inc. and the FoundationDB project authors
|
|
*
|
|
* Licensed 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 "fdbserver/TransactionTagCounter.h"
|
|
#include "flow/Trace.h"
|
|
|
|
void TopKTags::incrementTagCount(TransactionTag tag, int previousCount, int increase) {
|
|
auto iter = std::find_if(topTags.begin(), topTags.end(), [tag](const auto& tc) { return tc.tag == tag; });
|
|
if (iter != topTags.end()) {
|
|
ASSERT_EQ(previousCount, iter->count);
|
|
iter->count += increase;
|
|
} else if (topTags.size() < limit) {
|
|
ASSERT_EQ(previousCount, 0);
|
|
topTags.emplace_back(tag, increase);
|
|
} else {
|
|
auto toReplace = std::min_element(topTags.begin(), topTags.end());
|
|
ASSERT_GE(toReplace->count, previousCount);
|
|
if (toReplace->count < previousCount + increase) {
|
|
toReplace->tag = tag;
|
|
toReplace->count = previousCount + increase;
|
|
}
|
|
}
|
|
}
|
|
|
|
std::vector<StorageQueuingMetricsReply::TagInfo> TopKTags::getBusiestTags(double elapsed,
|
|
double totalSampleCount) const {
|
|
std::vector<StorageQueuingMetricsReply::TagInfo> result;
|
|
for (auto const& tagAndCounter : topTags) {
|
|
// FIXME: Confusing operator precedence
|
|
auto rate = tagAndCounter.count / CLIENT_KNOBS->READ_TAG_SAMPLE_RATE / elapsed;
|
|
if (rate > SERVER_KNOBS->MIN_TAG_READ_PAGES_RATE) {
|
|
result.emplace_back(tagAndCounter.tag, rate, tagAndCounter.count / totalSampleCount);
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
TransactionTagCounter::TransactionTagCounter(UID thisServerID)
|
|
: thisServerID(thisServerID), topTags(1), // TODO: Make this a knob
|
|
busiestReadTagEventHolder(makeReference<EventCacheHolder>(thisServerID.toString() + "/BusiestReadTag")) {}
|
|
|
|
void TransactionTagCounter::addRequest(Optional<TagSet> const& tags, int64_t bytes) {
|
|
if (tags.present()) {
|
|
TEST(true); // Tracking transaction tag in counter
|
|
double cost = costFunction(bytes);
|
|
for (auto& tag : tags.get()) {
|
|
int64_t& count = intervalCounts[TransactionTag(tag, tags.get().getArena())];
|
|
topTags.incrementTagCount(tag, count, cost);
|
|
count += cost;
|
|
}
|
|
|
|
intervalTotalSampledCount += cost;
|
|
}
|
|
}
|
|
|
|
void TransactionTagCounter::startNewInterval() {
|
|
double elapsed = now() - intervalStart;
|
|
previousBusiestTags.clear();
|
|
if (intervalStart > 0 && CLIENT_KNOBS->READ_TAG_SAMPLE_RATE > 0 && elapsed > 0) {
|
|
previousBusiestTags = topTags.getBusiestTags(elapsed, intervalTotalSampledCount);
|
|
|
|
TraceEvent("BusiestReadTag", thisServerID)
|
|
.detail("Elapsed", elapsed)
|
|
//.detail("Tag", printable(busiestTag))
|
|
//.detail("TagCost", busiestTagCount)
|
|
.detail("TotalSampledCost", intervalTotalSampledCount)
|
|
.detail("Reported", previousBusiestTags.size())
|
|
.trackLatest(busiestReadTagEventHolder->trackingKey);
|
|
}
|
|
|
|
intervalCounts.clear();
|
|
intervalTotalSampledCount = 0;
|
|
topTags.clear();
|
|
intervalStart = now();
|
|
}
|