blob: 146464bbe774869be307318f2d0a6587fc58c3cb [file] [log] [blame]
/*
* Copyright (C) 2019 The Android Open Source Project
*
* 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.
*/
#define DEBUG false // STOPSHIP if true
#include "Log.h"
#include "LogEventQueue.h"
namespace android {
namespace os {
namespace statsd {
using std::unique_lock;
using std::unique_ptr;
unique_ptr<LogEvent> LogEventQueue::waitPop() {
std::unique_lock<std::mutex> lock(mMutex);
if (mQueue.empty()) {
mCondition.wait(lock, [this] { return !this->mQueue.empty(); });
}
unique_ptr<LogEvent> item = std::move(mQueue.front());
mQueue.pop();
return item;
}
bool LogEventQueue::push(unique_ptr<LogEvent> item, int64_t* oldestTimestampNs) {
bool success;
{
std::unique_lock<std::mutex> lock(mMutex);
if (mQueue.size() < mQueueLimit) {
mQueue.push(std::move(item));
success = true;
} else {
// safe operation as queue must not be empty.
*oldestTimestampNs = mQueue.front()->GetElapsedTimestampNs();
success = false;
}
}
mCondition.notify_one();
return success;
}
} // namespace statsd
} // namespace os
} // namespace android