http://llvm.org/bugs/show_bug.cgi?id=3500
Douglas Gregor <[email protected]> changed: What |Removed |Added ---------------------------------------------------------------------------- Status|RESOLVED |REOPENED Resolution|FIXED | --- Comment #5 from Douglas Gregor <[email protected]> 2009-05-01 19:33:43 --- Thanks, Eli! Re-opening until I get *all* of the cases. The (x.x+=1)+1 case is interesting, and it makes me wonder: how hard are we supposed to try to determine whether an expression is a bit-field? We currently look through parentheses and implicit casts, but appears that we also have to look into binary operators that are assignments, too. Now I'm worried about, e.g., "true? x.x : 0". -- Configure bugmail: http://llvm.org/bugs/userprefs.cgi?tab=email ------- You are receiving this mail because: ------- You are on the CC list for the bug. _______________________________________________ LLVMbugs mailing list [email protected] http://lists.cs.uiuc.edu/mailman/listinfo/llvmbugs
