efriedma added a comment.

The general approach seems fine.  The multiplier for constexpr vs. constant 
folding can be left for a followup, and we can continue to consider other 
possible improvements elsewhere.

I guess I have one remaining question here: how does this interact with SFINAE? 
 In other words, if we hit the limit analyzing the signature of a function, do 
we print an error, or silently remove the function from the overload list?


Repository:
  rG LLVM Github Monorepo

CHANGES SINCE LAST ACTION
  https://reviews.llvm.org/D155955/new/

https://reviews.llvm.org/D155955

_______________________________________________
cfe-commits mailing list
cfe-commits@lists.llvm.org
https://lists.llvm.org/cgi-bin/mailman/listinfo/cfe-commits

Reply via email to