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
|
/*
* 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 "FacebookBase.h"
using namespace facebook::fb303;
using apache::thrift::concurrency::Guard;
FacebookBase::FacebookBase(std::string name) :
name_(name) {
aliveSince_ = (int64_t) time(nullptr);
}
inline void FacebookBase::getName(std::string& _return) {
_return = name_;
}
void FacebookBase::setOption(const std::string& key, const std::string& value) {
Guard g(optionsLock_);
options_[key] = value;
}
void FacebookBase::getOption(std::string& _return, const std::string& key) {
Guard g(optionsLock_);
_return = options_[key];
}
void FacebookBase::getOptions(std::map<std::string, std::string> & _return) {
Guard g(optionsLock_);
_return = options_;
}
int64_t FacebookBase::incrementCounter(const std::string& key, int64_t amount) {
counters_.lock();
// if we didn't find the key, we need to write lock the whole map to create it
ReadWriteCounterMap::iterator it = counters_.find(key);
if (it == counters_.end()) {
// we need to check again to make sure someone didn't create this key
// already while we released the lock
it = counters_.find(key);
if(it == counters_.end()){
counters_[key].value = amount;
counters_.unlock();
return amount;
}
}
it->second.lock();
int64_t count = it->second.value + amount;
it->second.value = count;
it->second.unlock();
counters_.unlock();
return count;
}
int64_t FacebookBase::setCounter(const std::string& key, int64_t value) {
counters_.lock();
// if we didn't find the key, we need to write lock the whole map to create it
ReadWriteCounterMap::iterator it = counters_.find(key);
if (it == counters_.end()) {
counters_[key].value = value;
counters_.unlock();
return value;
}
it->second.lock();
it->second.value = value;
it->second.unlock();
counters_.unlock();
return value;
}
void FacebookBase::getCounters(std::map<std::string, int64_t>& _return) {
// we need to lock the whole thing and actually build the map since we don't
// want our read/write structure to go over the wire
counters_.lock();
for(ReadWriteCounterMap::iterator it = counters_.begin();
it != counters_.end(); ++it)
{
_return[it->first] = it->second.value;
}
counters_.unlock();
}
int64_t FacebookBase::getCounter(const std::string& key) {
int64_t rv = 0;
counters_.lock();
ReadWriteCounterMap::iterator it = counters_.find(key);
if (it != counters_.end()) {
it->second.lock();
rv = it->second.value;
it->second.unlock();
}
counters_.unlock();
return rv;
}
inline int64_t FacebookBase::aliveSince() {
return aliveSince_;
}
|
