<div dir="ltr">Jeroen, thank you for very useful link with the context. Indeed union cases are very complicated and I see places in code when TBAA gives up.<br><div><br></div><div>Daniel, I completely agree that TBAA has limited power and can solve relatively simple cases only. So anything more complicated that involves intermediate variables that points to struct or array elements cannot be solved by TBAA alone. Differentiating array subscripts also seems like out of the scope of TBAA but adding type information that this memory assess accessing array not a random object of given type could be useful. Therefore TBAA can compliment points-to analysis and sometimes help in cases when points-to may not have enough information.</div></div><div class="gmail_extra"><br><div class="gmail_quote">On Mon, Dec 7, 2015 at 7:43 PM, Daniel Berlin <span dir="ltr"><<a href="mailto:dberlin@dberlin.org" target="_blank">dberlin@dberlin.org</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr">TBAA is about types, not accesses.<div>TBAA "struct path data" is about access paths and types that are the end of access paths, for the most part.</div><div><br></div><div>It has no notion of access size, etc, only offset.</div><div><br></div><div>It is possible to extend it and handle *very basic* cases in the frontend (IE structs not containing unions anywhere, with constant accesses, etc)</div><div>But it would degrade quite quickly (you would likely need a sane way to say "this is an access to an unknown offset into this type")</div><div><br></div><div>Generally, rather than just try to produce metadata in the frontend, most compilers perform field-sensitive points-to or something similar for fields, and then rely on data dependence for differentiating array subscripts.</div><div><br></div><div>(This is what GCC does, LLVM has CFL-AA, but it's not field sensitive yet)</div><div><br></div><div>So handling .size vs .a[] is probably possible in the frontend.</div><div><br></div><div>Doing array subscript analysis in general, probably not something you want in the frontend.</div><div>Handling tricky cases of what pointers to structs point to, probably the domain of field-sensitive points-to </div></div><div class="HOEnZb"><div class="h5"><div class="gmail_extra"><br><div class="gmail_quote">On Mon, Dec 7, 2015 at 7:13 AM, Dmitry Polukhin via llvm-dev <span dir="ltr"><<a href="mailto:llvm-dev@lists.llvm.org" target="_blank">llvm-dev@lists.llvm.org</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr">BTW, I have found why it doesn't work for arrays. TBAA information propagation is not implemented in CodeGenFunction::EmitArraySubscriptExpr with "TODO: Preserve/extend path TBAA metadata?".</div><div><div><div class="gmail_extra"><br><div class="gmail_quote">On Fri, Dec 4, 2015 at 1:38 PM, Dmitry Polukhin <span dir="ltr"><<a href="mailto:dmitry.polukhin@gmail.com" target="_blank">dmitry.polukhin@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr">As far as I can see it is specifics of arrays inside structs. Current TBAA does distinguish non-array members with path sensitive TBAA (see !1 and !6 in my example below, TBAA has reference to struct !2 and offset). As for arrays information that it was member of some struct get lost completely (!7 has nothing about struct !2).<div><br></div><div><div>struct S {</div><div> int a;</div><div> int b;</div><div> int c[3];</div><div>};</div><div><br></div><div>void foo(struct S* p) {</div><div> p->a = 1;</div><div> p->b = 2;</div><div> p->c[0] = 3;</div><div> p->c[1] = 4;</div><div>}</div></div><div><br></div><div><div>define void @foo(%struct.S* nocapture %p) #0 {</div><div>entry:</div><div> %a = getelementptr inbounds %struct.S, %struct.S* %p, i64 0, i32 0</div><div> store i32 1, i32* %a, align 4, !tbaa !1</div><div> %b = getelementptr inbounds %struct.S, %struct.S* %p, i64 0, i32 1</div><div> store i32 2, i32* %b, align 4, !tbaa !6</div><div> %arrayidx = getelementptr inbounds %struct.S, %struct.S* %p, i64 0, i32 2, i64 0</div><div> store i32 3, i32* %arrayidx, align 4, !tbaa !7</div><div> %arrayidx2 = getelementptr inbounds %struct.S, %struct.S* %p, i64 0, i32 2, i64 1</div><div> store i32 4, i32* %arrayidx2, align 4, !tbaa !7</div><div> ret void</div><div>}</div><div><br></div><div>!0 = !{!"clang version 3.8.0 "}<br></div><div>!1 = !{!2, !3, i64 0}</div><div>!2 = !{!"S", !3, i64 0, !3, i64 4, !4, i64 8}</div><div>!3 = !{!"int", !4, i64 0}</div><div>!4 = !{!"omnipotent char", !5, i64 0}</div><div>!5 = !{!"Simple C/C++ TBAA"}</div><div>!6 = !{!2, !3, i64 4}</div><div>!7 = !{!3, !3, i64 0}</div></div><div><br></div><div>I'm just start learning how TBAA in clang works so I don't know why it was implemented this way.</div></div><div class="gmail_extra"><br><div class="gmail_quote"><div><div>On Fri, Dec 4, 2015 at 11:06 AM, Vaivaswatha Nagaraj via llvm-dev <span dir="ltr"><<a href="mailto:llvm-dev@lists.llvm.org" target="_blank">llvm-dev@lists.llvm.org</a>></span> wrote:<br></div></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div><div><div dir="ltr"><div><div><div>Hi, <br><br></div>I'm trying to optimize a simple C code and came across a situation where invariant code is not being moved out:<br><br></div>On an -O3 compilation, I noticed that the "load" for the loop bounds (which remain invariant throughout) happens on each iteration of both the loops, even though it is not modified anywhere in the function "bigLoop". It seems that alias analysis is not able to say that the writes to one field in the structure does not impact the other field, leading to LICM being ineffective.<br><br></div>Do any of the alias analyses currently have some kind of field sensitivity that can help in this case?<br><div><div><div><div><div><br></div><div>------------------------- test case ------------------------------------<br></div><div>#include <stdlib.h><br>#include <stdio.h><br><br>#define SIZE 100<br><br>struct AS {<br> int a[SIZE+4];<br> int size;<br>} A;<br><br>void bigLoop(void)<br>{<br> unsigned i, j;<br><br> for (i = 0; i < A.size; i++) {<br> A.a[i+2] += A.a[i];<br> }<br> for (i = 0; i < A.size; i++) {<br> A.a[i+2] *= A.a[i];<br> }<br>}<br><br>int main()<br>{<br> A.size = random()%SIZE;<br> for (unsigned i = 0; i < A.size; i++) {<br> A.a[i] = random()%23;<br> }<br> bigLoop();<br> return 0;<br>}<br><br></div><div>Thanks,<br></div><div><br clear="all"><div><div><div dir="ltr"> - Vaivaswatha<br></div></div></div>
</div></div></div></div></div></div>
<br></div></div>_______________________________________________<br>
LLVM Developers mailing list<br>
<a href="mailto:llvm-dev@lists.llvm.org" target="_blank">llvm-dev@lists.llvm.org</a><br>
<a href="http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev" rel="noreferrer" target="_blank">http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev</a><br>
<br></blockquote></div><br></div>
</blockquote></div><br></div>
</div></div><br>_______________________________________________<br>
LLVM Developers mailing list<br>
<a href="mailto:llvm-dev@lists.llvm.org" target="_blank">llvm-dev@lists.llvm.org</a><br>
<a href="http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev" rel="noreferrer" target="_blank">http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev</a><br>
<br></blockquote></div><br></div>
</div></div></blockquote></div><br></div>