Lines Matching refs:needed_libs
1001 std::vector<String> needed_libs; member
1003 LibNode() : type(NODE_NONE), value(), needed_libs() {} in LibNode()
1006 : type(NODE_PATH), value(path), needed_libs() {} in LibNode()
1048 libfile.GetNeededLibs(&node.needed_libs); in UpdateDependencies()
1053 for (size_t n = 0; n < node.needed_libs.size(); ++n) { in UpdateDependencies()
1054 LOG(_T(" %s"), node.needed_libs[n].c_str()); in UpdateDependencies()
1055 queue.push_back(node.needed_libs[n]); in UpdateDependencies()
1144 for (size_t n = 0; n < node.needed_libs.size(); ++n) { in DumpDependencyGraph()
1145 _tprintf(_T(" %s\n"), node.needed_libs[n].c_str()); in DumpDependencyGraph()
1168 const std::vector<String>& needed_libs = iter->second.needed_libs; in GetTopologicalSortedLibraries() local
1169 for (size_t n = 0; n < needed_libs.size(); ++n) { in GetTopologicalSortedLibraries()
1170 const String& libname = needed_libs[n]; in GetTopologicalSortedLibraries()
1225 const std::vector<String> needed_libs = node.needed_libs; in GetTopologicalSortedLibraries() local
1228 for (size_t n = 0; n < needed_libs.size(); ++n) in GetTopologicalSortedLibraries()
1229 visitors[needed_libs[n]]--; in GetTopologicalSortedLibraries()
1378 std::vector<String> needed_libs; local
1379 libfile.GetNeededLibs(&needed_libs);
1381 for (size_t i = 0; i < needed_libs.size(); ++i)
1382 _tprintf(_T("%s\n"), needed_libs[i].c_str());
1396 std::vector<String> needed_libs; local
1397 GetTopologicalSortedLibraries(deps, &needed_libs);
1401 std::reverse(needed_libs.begin(), needed_libs.end());
1402 for (size_t i = 0; i < needed_libs.size(); ++i) {
1403 const String& lib = needed_libs[i];
1425 for (size_t i = 0; i < needed_libs.size(); ++i) {
1426 const String& libname = needed_libs[i];
1427 const std::vector<String>& libdeps = deps[libname].needed_libs;
1440 for (size_t i = 0; i < needed_libs.size(); ++i) {
1441 const String& lib = needed_libs[i];
1460 for (size_t i = 0; i < needed_libs.size(); ++i) {
1461 const String& lib = needed_libs[i];