mirror of
https://github.com/freebsd/freebsd-src.git
synced 2026-10-28 11:25:21 +01:00
View is a class for building PMC log processing tools it is designed to work with the new PMC record command that adds a header with additional CPU information. The new framework processes PMC logs about 2.5 times faster and in about half the code as libpmcstat. Sponsored by: Netflix Reviewed by: adrian Differential Revision: https://reviews.freebsd.org/D57776
83 lines
2.3 KiB
C++
83 lines
2.3 KiB
C++
/*-
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*
|
|
* Copyright (c) 2026, Netflix, Inc.
|
|
*
|
|
* This software was developed by Ali Mashtizadeh under the sponsorship from
|
|
* Netflix, Inc.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
*/
|
|
|
|
#include <string>
|
|
#include <unordered_set>
|
|
|
|
#include "util.hh"
|
|
|
|
std::string
|
|
basename(const std::string &path)
|
|
{
|
|
size_t s;
|
|
|
|
s = path.rfind("/");
|
|
if (s == std::string::npos)
|
|
return (path);
|
|
else
|
|
return (path.substr(s + 1));
|
|
}
|
|
|
|
void
|
|
split_and_insert(std::unordered_set<int> *set, const std::string &str)
|
|
{
|
|
size_t pos = 0;
|
|
|
|
while (pos < str.length()) {
|
|
size_t end = str.find(",", pos);
|
|
if (end == str.npos) {
|
|
set->insert(std::stoi(str.substr(pos)));
|
|
break;
|
|
}
|
|
|
|
set->insert(std::stoi(str.substr(pos, end - pos)));
|
|
pos = end + 1;
|
|
}
|
|
}
|
|
|
|
void
|
|
split_and_insert(std::unordered_set<std::string> *set, const std::string &str)
|
|
{
|
|
size_t pos = 0;
|
|
|
|
while (pos < str.length()) {
|
|
size_t end = str.find(",", pos);
|
|
if (end == str.npos) {
|
|
set->insert(str.substr(pos));
|
|
break;
|
|
}
|
|
|
|
set->insert(str.substr(pos, end - pos));
|
|
pos = end + 1;
|
|
}
|
|
}
|
|
|