search for: brct

...e induction variables to use an addition of -1 whenever possible (and not otherwise unprofitable). This is needed to utilize hardware loop instructions, which are present on SystemZ (branch on count). Later in the backend, an 'add -1; compare w/ 0; jne 0'-sequence can be replaced with a brct instruction. I could not find any way in the LSR pass to generate a formula for this (neither to express the lower target cost). I would like to generate a formula with a step of -1 and make the cost for it to be less than that of a similar formula with another constant. Could someone please g...

...quot; vifnum=2 netdev=eth2 bridge=xenbr2 "$dir/network-bridge" "$@" vifnum=3 netdev=eth3 bridge=xenbr3 "$dir/network-bridge" "$@" vifnum=4 netdev=eth4 bridge=xenbr4 "$dir/network-bridge" "$@" vifnum=5 netdev=eth5 bridge=xenbr5 When i done brct show i have this : bridge name bridge id STP enabled interfaces bridge name bridge id STP enabled interfaces xenbr0 8000.feffffffffff no vif0.0 peth0 xenbr1...

...> addition > of -1 whenever possible (and not otherwise unprofitable). This is > needed > to utilize hardware loop instructions, which are present on SystemZ > (branch on count). Later in the backend, an 'add -1; compare w/ 0; > jne > 0'-sequence can be replaced with a brct instruction. > > I could not find any way in the LSR pass to generate a formula for > this > (neither to express the lower target cost). I would like to generate > a > formula with a step of -1 and make the cost for it to be less than > that > of a similar formula with anot...

Hi all, I am working on modeling an instruction similar to SystemZ's 'BRCT', which takes a register, decrements it, and branches if the register is nonzero. I saw that the LLVM backend for SystemZ generates the instruction in a MachineFunctionPass as part of a pass intended to eliminate or combine compares. I then looked at ARM, where it uses the HardwareLoops pass f...

...a Core 4... >From dmesg: Linux version 2.6.11-1.1369_FC4 So I went to the website and downloaded the 1.1 source to build it. It needed libsysfs.h and it was not on my server. Went to the libsysfs website and downloaded 2.0 and built it with no obvious issues. The .h file is now there. Back to brctl and building it. ./configure --prefix=/usr Works like a champ. No errors. make (errors - looks like one big one) for x in libbridge brctl doc; do make -C $x ; done make[1]: Entering directory `/software/bridge/bridge-utils-1.1/libbridge' gcc -Wall -g -I/usr/src/linux/include -c libbridge_...

Hi Hal, yes, it's all about the induction variable. SystemZ has a late pass (pre-emit) that looks for MI sequences that can be rewritten to 'branch on count'. Currently only about half the number of BRCTs are output compared to gcc on the same benchmarks. One reason for this is that when a loop gets unrolled, the loop gets a greater increment / decrement than 1, which makes the late peephole transformation not work. Since LSR generates formula for induction variables and evaluates them, I thou...

...13, 8(%r4) lg %r13, 16(%r14) ng %r13, 16(%r5) stg %r13, 16(%r4) lg %r13, 24(%r14) ng %r13, 24(%r5) stg %r13, 24(%r4) la %r4, 32(%r4) la %r14, 32(%r14) la %r5, 32(%r5) brct %r0, .LBB0_152 j .LBB0_155