Lines Matching defs:node
991 // An enumeration listing possible node types, which are:
1030 LibNode node;
1035 node.Set(LibNode::NODE_ERROR, error);
1047 node.Set(LibNode::NODE_PATH, libpath);
1048 libfile.GetNeededLibs(&node.needed_libs);
1053 for (size_t n = 0; n < node.needed_libs.size(); ++n) {
1054 LOG(_T(" %s"), node.needed_libs[n].c_str());
1055 queue.push_back(node.needed_libs[n]);
1059 deps[soname] = node;
1099 LibNode node;
1100 node.Set(LibNode::NODE_SYSTEM, libname);
1101 deps[libname] = node;
1108 LibNode node;
1109 node.Set(LibNode::NODE_ERROR, _T("Could not find library"));
1110 deps[libname] = node;
1122 const LibNode& node = iter->second;
1124 switch (node.type) {
1141 node.value.c_str());
1143 if (node.type == LibNode::NODE_PATH) {
1144 for (size_t n = 0; n < node.needed_libs.size(); ++n) {
1145 _tprintf(_T(" %s\n"), node.needed_libs[n].c_str());
1199 // node in the cycle, i.e. the first one where a 'back' edge
1209 panic(_T("INTERNAL: Could not find minimum visited node!"));
1220 // Remove minimum node from the graph, and decrement the visitor
1224 const LibNode& node = deps[min_libname];
1225 const std::vector<String> needed_libs = node.needed_libs;
1442 LibNode& node = deps[lib];
1444 switch (node.type) {
