Searched refs:edges_size (Results 1 – 6 of 6) sorted by relevance
103 assert(GOTEntryBlock.edges_size() == 1 && in optimizeGOTAndStubAccesses()166 assert(StubBlock.edges_size() == 1 && in optimizeGOTAndStubAccesses()172 assert(GOTBlock.edges_size() == 1 && in optimizeGOTAndStubAccesses()
62 assert(StubBlock.edges_size() == 1 && in optimizeGOTAndStubAccesses()68 assert(GOTBlock.edges_size() == 1 && in optimizeGOTAndStubAccesses()
662 if (B.edges_size() == 1) in deregisterEHFrames()
626 auto Edges = std::make_unique<unsigned int[]>(Graph->edges_size()); in hardenLoadsWithPlugin()627 auto EdgeCuts = std::make_unique<int[]>(Graph->edges_size()); in hardenLoadsWithPlugin()628 auto EdgeValues = std::make_unique<int[]>(Graph->edges_size()); in hardenLoadsWithPlugin()632 Nodes[Graph->nodes_size()] = Graph->edges_size(); // terminator node in hardenLoadsWithPlugin()638 EdgeCuts.get(), Graph->edges_size()); in hardenLoadsWithPlugin()639 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()
334 size_t edges_size() const { return Edges.size(); } in edges_size() function