search for: mrecord

Hello, Tim, Thank you for your advice. Indeed, the problem with "LLVM ERROR: Cannot select" was a false predicate that should have been true. I solved the problem by simply making the C++ function implementing the TableGen predicate used in my store instruction (very similar to the selectIntAddrMSA predicate from the Mips back end) return true instead of false. But

Hi, all: Recently I am debugging the DSA and want to learn how it work, and now I am checking the local datastructure analysis. I use the following command to print the graph: (gdb) p g.dump() digraph DataStructures { label="Function addG"; Node0xe1f3a0 [shape=record,shape=Mrecord,label="{ i32: MRE\n|{<g0>}}"]; Node0xe1f4d0 [shape=record,shape=Mrecord,label="{ i32*: SMR\n|{<g0>|<g1>}}"]; Node0xe1f4d0:g0 -> Node0xe1f3a0; Node0xe20900 [shape=record,shape=Mrecord,label="{ i32: GR\n @global\n|{<g0>}}"]; Nod...

Dear LLVM, I was wondering if this is the right way to get TopDown DSGraph? TDDataStructures &TD = getAnalysis<TDDataStructures>(); F is some function DSGraph &dsg = TD.getDSGraph(F); I found out the DSGraph I got using this method is actually bottom up DSGraph, can you let me know why? Thanks, xiaodong

Thanks, Chris. Actually I got the following graph from my program: digraph DataStructures { label="Function fini"; edge [arrowtail="dot"]; size="10,7.5"; rotate="90"; Node0x100ae1c40 [shape=record,shape=Mrecord,label="{ %struct.a: HIMR\n|{<g0>|<g1>|<g2>}}"]; Node0x100ae1c40:g1 -> Node0x100ae1e00; Node0x100ae1c40:g2 -> Node0x100ae1fc0; Node0x100ae1e00 [shape=record,shape=Mrecord,label="{ %struct.a: HIMR\n|{<g0>|<g1>|<g2>}}"]; Node0x100ae...

...debugging the DSA and want to learn how it work, and now I am checking the local datastructure analysis. > I use the following command to print the graph: > (gdb) p g.dump() > digraph DataStructures { > label="Function addG"; > > Node0xe1f3a0 [shape=record,shape=Mrecord,label="{ i32: MRE\n|{<g0>}}"]; > Node0xe1f4d0 [shape=record,shape=Mrecord,label="{ i32*: SMR\n|{<g0>|<g1>}}"]; > Node0xe1f4d0:g0 -> Node0xe1f3a0; > Node0xe20900 [shape=record,shape=Mrecord,label="{ i32: GR\n @global\n|{<g0>}}&...

...n how it work, and > now I am checking the local datastructure analysis. > > I use the following command to print the graph: > > (gdb) p g.dump() > > digraph DataStructures { > > label="Function addG"; > > > > Node0xe1f3a0 [shape=record,shape=Mrecord,label="{ i32: > MRE\n|{<g0>}}"]; > > Node0xe1f4d0 [shape=record,shape=Mrecord,label="{ i32*: > SMR\n|{<g0>|<g1>}}"]; > > Node0xe1f4d0:g0 -> Node0xe1f3a0; > > Node0xe20900 [shape=record,shape=Mrecord,label="{ i32: GR\n...

...ant to learn how it work, and now I am checking the local datastructure analysis. >> I use the following command to print the graph: >> (gdb) p g.dump() >> digraph DataStructures { >> label="Function addG"; >> >> Node0xe1f3a0 [shape=record,shape=Mrecord,label="{ i32: MRE\n|{<g0>}}"]; >> Node0xe1f4d0 [shape=record,shape=Mrecord,label="{ i32*: SMR\n|{<g0>|<g1>}}"]; >> Node0xe1f4d0:g0 -> Node0xe1f3a0; >> Node0xe20900 [shape=record,shape=Mrecord,label="{ i32: GR\n @global\n|{&...

...elected. So if this is not correct, you have indeed a problem in the selection problem. > If that is the case, you can use -debug-only=isel to help you figuring out what is the problem. This is the add node (sum + v3) from the dot file (-view-isel-dags): Node0x7fef2a033610 [shape=record,shape=Mrecord,label="{{<s0>0|<s1>1}|add [ORD=21] [ID=29]|0x7fef2a033610|{<d0>i32}}"]; The debug output (-debug-only=isel) is: ISEL: Starting pattern match on root node: 0x7fef2a033610: i32 = add 0x7fef2a033410, 0x7fef2a032f10 [ORD=21] [ID=29] Skipped scope entry (due to false pre...

Hi Quentin, Am 01.11.2014 um 00:39 schrieb Quentin Colombet <qcolombet at apple.com>: > > On Oct 31, 2014, at 11:00 AM, Boris Boesler <baembel at gmx.de> wrote: > >> Hi Quentin, >> >> I added some debug output (N->dump()) in ::Select(SDNode*N) and compared it to the dot/Graphviz output (-view-legalize-types-dags; the last one with correct code). I