/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 358 size_type NewVertexSize = G.nodes_size() - TrimNodes.count(); in trim() local 361 std::make_unique<Node[]>(NewVertexSize + 1 /* terminator node */); in trim() 372 assert(NewNodeIndex == NewVertexSize && in trim() 387 assert(NewIdx < NewVertexSize); in trim() 393 assert(VertexI == NewVertexSize && EdgeI == NewEdgeSize && in trim() 397 std::move(NewEdgeArray), NewVertexSize, in trim()
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 357 size_type NewVertexSize = G.nodes_size() - TrimNodes.count(); in trim() local 360 std::make_unique<Node[]>(NewVertexSize + 1 /* terminator node */); in trim() 371 assert(NewNodeIndex == NewVertexSize && in trim() 386 assert(NewIdx < NewVertexSize); in trim() 392 assert(VertexI == NewVertexSize && EdgeI == NewEdgeSize && in trim() 396 std::move(NewEdgeArray), NewVertexSize, in trim()
|
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 357 size_type NewVertexSize = G.nodes_size() - TrimNodes.count(); in trim() local 360 std::make_unique<Node[]>(NewVertexSize + 1 /* terminator node */); in trim() 371 assert(NewNodeIndex == NewVertexSize && in trim() 386 assert(NewIdx < NewVertexSize); in trim() 392 assert(VertexI == NewVertexSize && EdgeI == NewEdgeSize && in trim() 396 std::move(NewEdgeArray), NewVertexSize, in trim()
|
/dports/devel/llvm10/llvm-10.0.1.src/lib/Target/X86/ |
H A D | ImmutableGraph.h | 358 size_type NewVertexSize = G.nodes_size() - TrimNodes.count(); in trim() local 361 std::make_unique<Node[]>(NewVertexSize + 1 /* terminator node */); in trim() 372 assert(NewNodeIndex == NewVertexSize && in trim() 387 assert(NewIdx < NewVertexSize); in trim() 393 assert(VertexI == NewVertexSize && EdgeI == NewEdgeSize && in trim() 397 std::move(NewEdgeArray), NewVertexSize, in trim()
|
/dports/graphics/llvm-mesa/llvm-13.0.1.src/lib/Target/X86/ |
H A D | ImmutableGraph.h | 357 size_type NewVertexSize = G.nodes_size() - TrimNodes.count(); in trim() local 360 std::make_unique<Node[]>(NewVertexSize + 1 /* terminator node */); in trim() 371 assert(NewNodeIndex == NewVertexSize && in trim() 386 assert(NewIdx < NewVertexSize); in trim() 392 assert(VertexI == NewVertexSize && EdgeI == NewEdgeSize && in trim() 396 std::move(NewEdgeArray), NewVertexSize, in trim()
|
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 357 size_type NewVertexSize = G.nodes_size() - TrimNodes.count(); in trim() local 360 std::make_unique<Node[]>(NewVertexSize + 1 /* terminator node */); in trim() 371 assert(NewNodeIndex == NewVertexSize && in trim() 386 assert(NewIdx < NewVertexSize); in trim() 392 assert(VertexI == NewVertexSize && EdgeI == NewEdgeSize && in trim() 396 std::move(NewEdgeArray), NewVertexSize, in trim()
|
/dports/devel/llvm11/llvm-11.0.1.src/lib/Target/X86/ |
H A D | ImmutableGraph.h | 357 size_type NewVertexSize = G.nodes_size() - TrimNodes.count(); in trim() local 360 std::make_unique<Node[]>(NewVertexSize + 1 /* terminator node */); in trim() 371 assert(NewNodeIndex == NewVertexSize && in trim() 386 assert(NewIdx < NewVertexSize); in trim() 392 assert(VertexI == NewVertexSize && EdgeI == NewEdgeSize && in trim() 396 std::move(NewEdgeArray), NewVertexSize, in trim()
|
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 357 size_type NewVertexSize = G.nodes_size() - TrimNodes.count(); in trim() local 360 std::make_unique<Node[]>(NewVertexSize + 1 /* terminator node */); in trim() 371 assert(NewNodeIndex == NewVertexSize && in trim() 386 assert(NewIdx < NewVertexSize); in trim() 392 assert(VertexI == NewVertexSize && EdgeI == NewEdgeSize && in trim() 396 std::move(NewEdgeArray), NewVertexSize, in trim()
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 357 size_type NewVertexSize = G.nodes_size() - TrimNodes.count(); in trim() local 360 std::make_unique<Node[]>(NewVertexSize + 1 /* terminator node */); in trim() 371 assert(NewNodeIndex == NewVertexSize && in trim() 386 assert(NewIdx < NewVertexSize); in trim() 392 assert(VertexI == NewVertexSize && EdgeI == NewEdgeSize && in trim() 396 std::move(NewEdgeArray), NewVertexSize, in trim()
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 357 size_type NewVertexSize = G.nodes_size() - TrimNodes.count(); in trim() local 360 std::make_unique<Node[]>(NewVertexSize + 1 /* terminator node */); in trim() 371 assert(NewNodeIndex == NewVertexSize && in trim() 386 assert(NewIdx < NewVertexSize); in trim() 392 assert(VertexI == NewVertexSize && EdgeI == NewEdgeSize && in trim() 396 std::move(NewEdgeArray), NewVertexSize, in trim()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 357 size_type NewVertexSize = G.nodes_size() - TrimNodes.count(); in trim() local 360 std::make_unique<Node[]>(NewVertexSize + 1 /* terminator node */); in trim() 371 assert(NewNodeIndex == NewVertexSize && in trim() 386 assert(NewIdx < NewVertexSize); in trim() 392 assert(VertexI == NewVertexSize && EdgeI == NewEdgeSize && in trim() 396 std::move(NewEdgeArray), NewVertexSize, in trim()
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 357 size_type NewVertexSize = G.nodes_size() - TrimNodes.count(); in trim() local 360 std::make_unique<Node[]>(NewVertexSize + 1 /* terminator node */); in trim() 371 assert(NewNodeIndex == NewVertexSize && in trim() 386 assert(NewIdx < NewVertexSize); in trim() 392 assert(VertexI == NewVertexSize && EdgeI == NewEdgeSize && in trim() 396 std::move(NewEdgeArray), NewVertexSize, in trim()
|
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 357 size_type NewVertexSize = G.nodes_size() - TrimNodes.count(); in trim() local 360 std::make_unique<Node[]>(NewVertexSize + 1 /* terminator node */); in trim() 371 assert(NewNodeIndex == NewVertexSize && in trim() 386 assert(NewIdx < NewVertexSize); in trim() 392 assert(VertexI == NewVertexSize && EdgeI == NewEdgeSize && in trim() 396 std::move(NewEdgeArray), NewVertexSize, in trim()
|