Lines Matching full:second
66 // We could avoid second lookup, but it would make the code ultra ugly. in recordInline()
121 assert(Node->second->NumberOfInlines >= Node->second->NumberOfRealInlines); in dump()
122 if (Node->second->NumberOfInlines == 0) in dump()
125 if (Node->second->Imported) { in dump()
128 int(Node->second->NumberOfRealInlines > 0); in dump()
132 int(Node->second->NumberOfRealInlines > 0); in dump()
137 << (Node->second->Imported ? "imported " : "not imported ") in dump()
139 << ": #inlines = " << Node->second->NumberOfInlines in dump()
141 << Node->second->NumberOfRealInlines << "\n"; in dump()
207 if (Lhs->second->NumberOfInlines != Rhs->second->NumberOfInlines) in getSortedNodes()
208 return Lhs->second->NumberOfInlines > Rhs->second->NumberOfInlines; in getSortedNodes()
209 if (Lhs->second->NumberOfRealInlines != Rhs->second->NumberOfRealInlines) in getSortedNodes()
210 return Lhs->second->NumberOfRealInlines > in getSortedNodes()
211 Rhs->second->NumberOfRealInlines; in getSortedNodes()