Home
last modified time | relevance | path

Searched refs:edges_size (Results 1 – 5 of 5) sorted by relevance

/openbsd/src/gnu/llvm/llvm/lib/ExecutionEngine/JITLink/
Dx86_64.cpp99 assert(GOTEntryBlock.edges_size() == 1 && in optimizeGOTAndStubAccesses()
162 assert(StubBlock.edges_size() == 1 && in optimizeGOTAndStubAccesses()
168 assert(GOTBlock.edges_size() == 1 && in optimizeGOTAndStubAccesses()
DEHFrameSupport.cpp669 if (B.edges_size() == 1) in FromEdgeScan()
/openbsd/src/gnu/llvm/llvm/lib/Target/X86/
DX86LoadValueInjectionLoadHardening.cpp628 auto Edges = std::make_unique<unsigned int[]>(Graph->edges_size()); in hardenLoadsWithPlugin()
629 auto EdgeCuts = std::make_unique<int[]>(Graph->edges_size()); in hardenLoadsWithPlugin()
630 auto EdgeValues = std::make_unique<int[]>(Graph->edges_size()); in hardenLoadsWithPlugin()
634 Nodes[Graph->nodes_size()] = Graph->edges_size(); // terminator node in hardenLoadsWithPlugin()
640 EdgeCuts.get(), Graph->edges_size()); in hardenLoadsWithPlugin()
641 for (int I = 0; I < Graph->edges_size(); ++I) in hardenLoadsWithPlugin()
DImmutableGraph.h99 size_type edges_size() const { return EdgesSize; } in edges_size() function
205 : G{G}, V{static_cast<unsigned>(G.edges_size()), ContainsAll} {}
358 size_type NewEdgeSize = G.edges_size() - TrimEdges.count(); in trim()
/openbsd/src/gnu/llvm/llvm/include/llvm/ExecutionEngine/JITLink/
DJITLink.h328 size_t edges_size() const { return Edges.size(); } in edges_size() function