Displaying 6 results from an estimated 6 matches for "issuccessor".
2004 Oct 12
1
[LLVMdev] std::remove
...================
RCS file: /var/cvs/llvm/llvm/include/llvm/Analysis/IntervalIterator.h,v
retrieving revision 1.18
diff -u -r1.18 IntervalIterator.h
--- IntervalIterator.h 3 Sep 2004 18:19:51 -0000 1.18
+++ IntervalIterator.h 12 Oct 2004 16:04:37 -0000
@@ -220,7 +220,7 @@
if (Int->isSuccessor(NodeHeader)) {
// If we were in the successor list from before... remove from
succ list
- Int->Successors.erase(remove(Int->Successors.begin(),
+ Int->Successors.erase(std::remove(Int->Successors.begin(),
Int->Successors.end()...
2014 Nov 06
2
[LLVMdev] Should the MachineVerifier accept a MBB with a single (landing pad) successor?
...(MBB->succ_size() != 1 || LandingPadSuccs.size() != 1 ||
+ *MBB->succ_begin() != *LandingPadSuccs.begin())) {
report("MBB exits via unconditional branch but doesn't have "
"exactly one CFG successor!", MBB);
} else if (!MBB->isSuccessor(TBB)) {
- Ahmed
-------------- next part --------------
A non-text attachment was scrubbed...
Name: br-simple.ll
Type: application/octet-stream
Size: 6466 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20141106/a7d178a6/attachment.obj>
2013 Aug 02
2
[LLVMdev] Missing optimization - constant parameter
...ediate predecessor. We don't want to increase register pressure and
// end up causing other computation to be spilled.
if (MI->isAsCheapAsAMove()) {
MachineBasicBlock *CSBB = CSMI->getParent();
MachineBasicBlock *BB = MI->getParent();
if (CSBB != BB && !CSBB->isSuccessor(BB))
return false;
}
This code is older than the greedy register allocator. We could delete it if somebody is willing to check for regressions in the test suite.
I thought we had a PR about this already, but I can’t find it now.
Thanks,
/jakob
2013 Aug 05
0
[LLVMdev] Missing optimization - constant parameter
...;t want to increase register pressure
> and
> // end up causing other computation to be spilled.
> if (MI->isAsCheapAsAMove()) {
> MachineBasicBlock *CSBB = CSMI->getParent();
> MachineBasicBlock *BB = MI->getParent();
> if (CSBB != BB && !CSBB->isSuccessor(BB))
> return false;
> }
>
> This code is older than the greedy register allocator. We could delete it
> if somebody is willing to check for regressions in the test suite.
>
> I thought we had a PR about this already, but I can’t find it now.
>
> Thanks,
> /jak...
2013 Aug 02
0
[LLVMdev] Missing optimization - constant parameter
> I expected that this optimization would be picked
> up in a cse, gvn, machine-cse or even peepholing pass.
>
> Comments?
At the LLVM IR level this is represented as
define i64 @caller() #0 {
entry:
store i64* @val, i64** @p, align 8, !tbaa !0
store i64 12345123400, i64* @val, align 8, !tbaa !3
%call = tail call i64 @xtr(i64 12345123400) #2
ret i64 %call
}
Which is
2013 Aug 02
2
[LLVMdev] Missing optimization - constant parameter
For the little C test program where a constant is stored in memory and
also
used as a parameter:
#include <stdint.h>
uint64_t val, *p;
extern uint64_t xtr( uint64_t);
uint64_t caller() {
uint64_t x;
p = &val;
x = 12345123400L;
*p = x;
return xtr(x);
}
clang (3.2, 3.3 and svn) generates the following X86 code (at -O3):
caller:
movq