Displaying 3 results from an estimated 3 matches for "stackt".
Did you mean:
stack
2015 Jan 29
0
[LLVMdev] PBQP crash
...GPR64common) moved to conservatively-allocatables.
...
Popped NId 2(%vreg4, GPR64common) , all edge costs added:
2.002748e+01 inf inf inf inf inf inf inf inf inf inf ** selection: 0
llc: ../include/llvm/CodeGen/PBQP/ReductionRules.h:214: llvm::PBQP::Solution llvm::PBQP::backpropagate(GraphT&, StackT, llvm::PBQP::NodeSet&) [with GraphT = llvm::PBQP::Gra
ph<llvm::PBQP::RegAlloc::RegAllocSolverImpl>; StackT = std::vector<unsigned int>; llvm::PBQP::NodeSet = std::set<unsigned int>]: Assertion `PushedAsConservativelyAllocatabl
eNodes.find(NId) == PushedAsConservativelyAllocata...
2015 Jan 30
0
[LLVMdev] PBQP crash
...tables.
>
> ...
>
> Popped NId 2(%vreg4, GPR64common) , all edge costs added:
>
> 2.002748e+01 inf inf inf inf inf inf inf inf inf inf ** selection: 0
>
> llc: ../include/llvm/CodeGen/PBQP/ReductionRules.h:214:
> llvm::PBQP::Solution llvm::PBQP::backpropagate(GraphT&, StackT,
> llvm::PBQP::NodeSet&) [with GraphT = llvm::PBQP::Gra
>
> ph<llvm::PBQP::RegAlloc::RegAllocSolverImpl>; StackT =
> std::vector<unsigned int>; llvm::PBQP::NodeSet = std::set<unsigned int>]:
> Assertion `PushedAsConservativelyAllocatabl
>
> eNodes.find(NId...
2015 Jan 27
5
[LLVMdev] PBQP crash
> A node should never be put into the conservatively allocatable list if there is a chance of it spilling.
I can understand why the logic of NodeMetadata::isConservativelyAllocatable is necessary for the node to be allocatable, but I have not been able to convince myself this is sufficient, especially when the node degree > available registers.
Cheers,
Arnaud
From: