Displaying 3 results from an estimated 3 matches for "n2176".
Did you mean:
32176
2011 May 12
0
[LLVMdev] formal representation of data dependence
...ads. Briefly, B is
dependent on A if the location of B uses data computed by A, so in
A = load X;
B = load A;
the load of B is guaranteed to happen after the load of A, for some
more or less formal definition of "happens after".
The point is, it is possible to construct cases (see N2176 for examples)
where a compiler, in the process of doing reasonable code simplifications,
may break a data-dependency chain that exists in the source code.
Somehow the compiler needs to preserve the information that one load is
formally (i.e. according to the syntactic rules of 1.10#9) data-dependen...
2011 Aug 22
0
[LLVMdev] Reviving the new LLVM concurrency model
On Mon, Aug 22, 2011 at 3:02 PM, Eli Friedman <eli.friedman at gmail.com> wrote:
> On Mon, Aug 22, 2011 at 11:17 AM, Jianzhou Zhao <jianzhou at seas.upenn.edu> wrote:
>> On Mon, Aug 22, 2011 at 1:02 PM, Eli Friedman <eli.friedman at gmail.com> wrote:
>>> On Mon, Aug 22, 2011 at 9:55 AM, Jianzhou Zhao <jianzhou at seas.upenn.edu> wrote:
>>>> In
2011 Aug 22
4
[LLVMdev] Reviving the new LLVM concurrency model
On Mon, Aug 22, 2011 at 11:17 AM, Jianzhou Zhao <jianzhou at seas.upenn.edu> wrote:
> On Mon, Aug 22, 2011 at 1:02 PM, Eli Friedman <eli.friedman at gmail.com> wrote:
>> On Mon, Aug 22, 2011 at 9:55 AM, Jianzhou Zhao <jianzhou at seas.upenn.edu> wrote:
>>> In the definition of 'monotonic' ordering,
>>> ... "If an address is written