blob: 0538afc75b1d88a9b3a04ea598c870dc573c48a1 [file] [log] [blame]
/**
* 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 "cli/InputParserUtil.hpp"
#include <cstddef>
#include <iostream>
#include <ostream>
#include <string>
#include <utility>
#include <vector>
#include "catalog/CatalogConfig.h"
#include "storage/StorageConfig.h"
#include "utility/StringUtil.hpp"
#include "glog/logging.h"
#ifdef QUICKSTEP_HAVE_LIBNUMA
#include <numa.h>
#endif
using std::string;
namespace quickstep {
std::vector<int> InputParserUtil::ParseWorkerAffinities(
const int num_workers,
const string &affinity_string) {
std::vector<int> affinities;
if (affinity_string.empty()) {
affinities.resize(num_workers, -1);
return affinities;
}
if (!ParseIntString(affinity_string, ',', &affinities)) {
LOG(FATAL) << "--worker_affinities must be a comma-separated list of "
<< "integer CPU ids.\n";
}
for (const int affinity : affinities) {
if (affinity < -1) {
LOG(FATAL) << "CPU affinities specified by --worker_affinities must be "
<< "non-negative, or -1 to specify no affinity.\n";
}
}
if (affinities.size() < static_cast<std::size_t>(num_workers)) {
std::cout << "--num_workers is " << num_workers << ", but only "
<< "specified " << affinities.size() << " CPU affinities "
<< "with --worker_affinities. "
<< (num_workers - affinities.size()) << " workers will be "
<< "unaffinitized.\n";
affinities.resize(num_workers, -1);
} else if (affinities.size() > static_cast<std::size_t>(num_workers)) {
std::cout << "--num_workers is " << num_workers << ", but specified "
<< affinities.size() << " CPU affinities with "
<< "--worker_affinities. Extra affinities will be ignored.\n";
affinities.resize(num_workers);
}
return affinities;
}
std::vector<int> InputParserUtil::GetNUMANodesForCPUs() {
std::vector<int> numa_nodes_of_cpus;
#ifdef QUICKSTEP_HAVE_LIBNUMA
const int num_cpus = numa_num_configured_cpus();
numa_nodes_of_cpus.reserve(num_cpus);
for (int curr_cpu = 0; curr_cpu < num_cpus; ++curr_cpu) {
numa_nodes_of_cpus.push_back(numa_node_of_cpu(curr_cpu));
}
#endif
return numa_nodes_of_cpus;
}
} // namespace quickstep