Searched refs:edges_size (Results 1 – 7 of 7) sorted by relevance
94 assert(EntrySym->getBlock().edges_size() == 1 && in registerExistingEntries()103 assert(EntrySym->getBlock().edges_size() == 1 && in registerExistingEntries()106 assert(GOTSym.getBlock().edges_size() == 1 && "GOT block edge count != 1"); in registerExistingEntries()133 assert(GOTEntryBlock.edges_size() == 1 && in optimizeGOTAndStubAccesses()196 assert(StubBlock.edges_size() == 1 && in optimizeGOTAndStubAccesses()202 assert(GOTBlock.edges_size() == 1 && in optimizeGOTAndStubAccesses()
60 assert(StubBlock.edges_size() == 1 && in optimizeGOTAndStubAccesses()66 assert(GOTBlock.edges_size() == 1 && in optimizeGOTAndStubAccesses()
209 assert(EntrySym->getBlock().edges_size() == 1 && in registerExistingEntries()218 assert(EntrySym->getBlock().edges_size() == 2 && in registerExistingEntries()221 assert(GOTSym.getBlock().edges_size() == 1 && "GOT block edge count != 1"); in registerExistingEntries()
644 if (B.edges_size() == 1) in FromEdgeScan()
624 auto Edges = std::make_unique<unsigned int[]>(Graph->edges_size()); in hardenLoadsWithPlugin()625 auto EdgeCuts = std::make_unique<int[]>(Graph->edges_size()); in hardenLoadsWithPlugin()626 auto EdgeValues = std::make_unique<int[]>(Graph->edges_size()); in hardenLoadsWithPlugin()630 Nodes[Graph->nodes_size()] = Graph->edges_size(); // terminator node in hardenLoadsWithPlugin()636 EdgeCuts.get(), Graph->edges_size()); in hardenLoadsWithPlugin()637 for (int I = 0; I < Graph->edges_size(); ++I) in hardenLoadsWithPlugin()
99 size_type edges_size() const { return EdgesSize; } in edges_size() function205 : G{G}, V{static_cast<unsigned>(G.edges_size()), ContainsAll} {}358 size_type NewEdgeSize = G.edges_size() - TrimEdges.count(); in trim()
353 size_t edges_size() const { return Edges.size(); } in edges_size() function