Displaying 6 results from an estimated 6 matches for "memdefs".
2007 Aug 10
1
[LLVMdev] inline assembly
hi,
i'm writing a target dependent analysis on machine instruction level in
llvm 2.0. the analysis needs to know if an inline assembly block reads
from memory. the programmer is responsible to add 'm' constraints
accordingly.
i've seen the operand flags of the inline assembly SDNode and the
machine instructions. but it seems that there is no difference between
input and output
2014 Dec 19
2
[LLVMdev] ScheduleDAGInstrs.cpp
...e() returns false between SU(2) and SU(1)? The dependency against SU(0) will not be checked, because it is not in RejectMemNodes, nor in the MemUses SU list.
2)
SU(2) Load "Value A"
SU(1) Store "Value A"
SU(0) Store "Value A"
If not using alias analysis, then the MemDefs list is cleared after *maybe* having inserted an edge from SU(0) to SU(1) with addChainDependency(). If there was not an edge inserted, then SU(2) must get a chance to check its deps against SU(0) by use of adjustChainDeps(). Again, this is only done if MayAlias is true.
I suspect therefore that a...
2015 Jan 30
2
[LLVMdev] [PATCH] Bugfix for missed dependency from store to load in buildSchedGraph().
...y against SU(0) will not be checked, because it is not in
> RejectMemNodes, nor in the MemUses SU list.
>
> 2)
>
> SU(2) Load "Value A"
>
> SU(1) Store "Value A"
>
> SU(0) Store "Value A"
>
> If not using alias analysis, then the MemDefs list is cleared after
> *maybe* having inserted an edge from SU(0) to SU(1) with
> addChainDependency(). If there was not an edge inserted, then SU(2)
> must get a chance to check its deps against SU(0) by use of
> adjustChainDeps(). Again, this is only done if MayAlias is true.
>...
2015 Feb 10
2
[LLVMdev] [PATCH] Bugfix for missed dependency from store to load in buildSchedGraph().
...in
> > RejectMemNodes, nor in the MemUses SU list.
> >
> > 2)
> >
> > SU(2) Load "Value A"
> >
> > SU(1) Store "Value A"
> >
> > SU(0) Store "Value A"
> >
> > If not using alias analysis, then the MemDefs list is cleared after
> > *maybe* having inserted an edge from SU(0) to SU(1) with
> > addChainDependency(). If there was not an edge inserted, then SU(2)
> > must get a chance to check its deps against SU(0) by use of
> > adjustChainDeps(). Again, this is only done if Ma...
2014 Dec 16
3
[LLVMdev] ScheduleDAGInstrs.cpp
Hi,
Thank you for the reply.
>It looks to me like we can choose any subset of edges here and be correct. We're basically trying to prune/pinch the DAG edges here. They can easily blow up with AA sched. I would guess that isCtrl() edges are good ones to bypass because they could be a low-latecy edges, whereas true data dependencies from a load are expected to be >higher latency, so they
2019 Apr 30
6
Disk space and RAM requirements in docs
Hi,
Have anybody recently built LLVM in Debug mode /within/ space
requirements from the Getting Started doc?
https://llvm.org/docs/GettingStarted.html#hardware
> An LLVM-only build will need about 1-3 GB of space. A full build of
LLVM and Clang will need around 15-20 GB of disk space.
From my experience this numbers looks drastically low. On FreeBSD my
recent builds consumed more than