1 /** 2 * Copyright © 2017 IBM Corporation 3 * 4 * Licensed under the Apache License, Version 2.0 (the "License"); 5 * you may not use this file except in compliance with the License. 6 * You may obtain a copy of the License at 7 * 8 * http://www.apache.org/licenses/LICENSE-2.0 9 * 10 * Unless required by applicable law or agreed to in writing, software 11 * distributed under the License is distributed on an "AS IS" BASIS, 12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 * See the License for the specific language governing permissions and 14 * limitations under the License. 15 */ 16 #include <experimental/filesystem> 17 #include <phosphor-logging/log.hpp> 18 #include <regex> 19 #include "targeting.hpp" 20 21 namespace openpower 22 { 23 namespace targeting 24 { 25 26 using namespace phosphor::logging; 27 namespace fs = std::experimental::filesystem; 28 29 int Target::getCFAMFD() 30 { 31 if (cfamFD.get() == nullptr) 32 { 33 cfamFD = std::make_unique< 34 openpower::util::FileDescriptor>(getCFAMPath()); 35 } 36 37 return cfamFD->get(); 38 } 39 40 41 Targeting::Targeting(const std::string& fsiMasterDev, 42 const std::string& fsiSlaveDir) : 43 fsiMasterPath(fsiMasterDev), 44 fsiSlaveBasePath(fsiSlaveDir) 45 { 46 //Always create P0, the FSI master. 47 targets.push_back(std::make_unique<Target>(0, fsiMasterPath)); 48 49 //Find the the remaining P9s dynamically based on which files show up 50 std::regex exp{"slave@([0-9]{2}):00", std::regex::extended}; 51 52 for (auto& file : fs::directory_iterator(fsiSlaveBasePath)) 53 { 54 std::smatch match; 55 std::string path = file.path(); 56 if (std::regex_search(path, match, exp)) 57 { 58 auto pos = atoi(match[1].str().c_str()); 59 if (pos == 0) 60 { 61 log<level::ERR>("Unexpected FSI slave device name found", 62 entry("DEVICE_NAME=%d", path.c_str())); 63 continue; 64 } 65 66 path += "/raw"; 67 68 targets.push_back(std::make_unique<Target>(pos, path)); 69 } 70 } 71 72 auto sortTargets = [](const std::unique_ptr<Target>& left, 73 const std::unique_ptr<Target>& right) 74 { 75 return left->getPos() < right->getPos(); 76 }; 77 std::sort(targets.begin(), targets.end(), sortTargets); 78 } 79 80 } 81 } 82