1021     DependencyGraph& deps,  in UpdateDependencies()  argument
1025   if (!libname.empty() && deps.find(libname) != deps.end()) {  in UpdateDependencies()
1059   deps[soname] = node;  in UpdateDependencies()
1069   DependencyGraph deps;  in BuildDependencyGraph()  local
1076                      deps, queue);  in BuildDependencyGraph()
1084     DependencyGraph::iterator iter = deps.find(libname);  in BuildDependencyGraph()
1085     if (iter != deps.end()) {  in BuildDependencyGraph()
1093       UpdateDependencies(libname, libpath, deps, queue);  in BuildDependencyGraph()
1101       deps[libname] = node;  in BuildDependencyGraph()
1110     deps[libname] = node;  in BuildDependencyGraph()
1113   return deps;  in BuildDependencyGraph()
1117 void DumpDependencyGraph(const DependencyGraph& deps) {  in DumpDependencyGraph()  argument
1119   DependencyGraph::const_iterator iter = deps.begin();  in DumpDependencyGraph()
1120   for ( ; iter != deps.end(); ++iter ) {  in DumpDependencyGraph()
1155     DependencyGraph& deps,  in GetTopologicalSortedLibraries()  argument
1161   for (DependencyGraph::const_iterator iter = deps.begin();  in GetTopologicalSortedLibraries()
1162       iter != deps.end();  in GetTopologicalSortedLibraries()
1224     const LibNode& node = deps[min_libname];  in GetTopologicalSortedLibraries()
1389   DependencyGraph deps = BuildDependencyGraph(  local
1393     DumpDependencyGraph(deps);
1397   GetTopologicalSortedLibraries(deps, &needed_libs);
1427       const std::vector<String>& libdeps = deps[libname].needed_libs;
1442       LibNode& node = deps[lib];
1454       _tprintf(format, lib.c_str(), deps[lib].value.c_str());