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
|
/* Copyright 2015 Google Inc. All Rights Reserved.
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 "tensorflow/core/util/util.h"
#include "tensorflow/core/platform/logging.h"
namespace tensorflow {
StringPiece NodeNamePrefix(const StringPiece& op_name) {
StringPiece sp(op_name);
auto p = sp.find('/');
if (p == StringPiece::npos || p == 0) {
return "";
} else {
return StringPiece(sp.data(), p);
}
}
StringPiece NodeNameFullPrefix(const StringPiece& op_name) {
StringPiece sp(op_name);
auto p = sp.rfind('/');
if (p == StringPiece::npos || p == 0) {
return "";
} else {
return StringPiece(sp.data(), p);
}
}
MovingAverage::MovingAverage(int window)
: window_(window),
sum_(0.0),
data_(new double[window_]),
head_(0),
count_(0) {
CHECK_GE(window, 1);
}
MovingAverage::~MovingAverage() { delete[] data_; }
void MovingAverage::Clear() {
count_ = 0;
head_ = 0;
sum_ = 0;
}
double MovingAverage::GetAverage() const {
if (count_ == 0) {
return 0;
} else {
return static_cast<double>(sum_) / count_;
}
}
void MovingAverage::AddValue(double v) {
if (count_ < window_) {
// This is the warmup phase. We don't have a full window's worth of data.
head_ = count_;
data_[count_++] = v;
} else {
if (window_ == ++head_) {
head_ = 0;
}
// Toss the oldest element
sum_ -= data_[head_];
// Add the newest element
data_[head_] = v;
}
sum_ += v;
}
static char hex_char[] = "0123456789abcdef";
string PrintMemory(const char* ptr, int n) {
string ret;
ret.resize(n * 3);
for (int i = 0; i < n; ++i) {
ret[i * 3] = ' ';
ret[i * 3 + 1] = hex_char[ptr[i] >> 4];
ret[i * 3 + 2] = hex_char[ptr[i] & 0xf];
}
return ret;
}
} // namespace tensorflow
|
