search for: gray63

...="{ i32*: SMR\n|{<g0>|<g1>}}"]; Node0xe1f4d0:g0 -> Node0xe1f3a0; Node0xe20900 [shape=record,shape=Mrecord,label="{ i32: GR\n @global\n|{<g0>}}"]; Node0xe16530[ label =" %x_addr"]; Node0xe16530 -> Node0xe1f4d0[arrowtail=tee,color=gray63]; Node0xe162f0[ label =" %x"]; Node0xe162f0 -> Node0xe1f3a0[arrowtail=tee,color=gray63]; Node0xe16950[ label =" %tmp4"]; Node0xe16950 -> Node0xe1f3a0[arrowtail=tee,color=gray63]; Node0xe16730[ label =" %tmp"]; Node0xe16730 -> Node0xe...

...|{<g0>|<g1>}}"]; > Node0xe1f4d0:g0 -> Node0xe1f3a0; > Node0xe20900 [shape=record,shape=Mrecord,label="{ i32: GR\n @global\n|{<g0>}}"]; > Node0xe16530[ label =" %x_addr"]; > Node0xe16530 -> Node0xe1f4d0[arrowtail=tee,color=gray63]; > Node0xe162f0[ label =" %x"]; > Node0xe162f0 -> Node0xe1f3a0[arrowtail=tee,color=gray63]; > Node0xe16950[ label =" %tmp4"]; > Node0xe16950 -> Node0xe1f3a0[arrowtail=tee,color=gray63]; > Node0xe16730[ label =" %tmp"]; >...

..."]; > > Node0xe1f4d0:g0 -> Node0xe1f3a0; > > Node0xe20900 [shape=record,shape=Mrecord,label="{ i32: GR\n > @global\n|{<g0>}}"]; > > Node0xe16530[ label =" %x_addr"]; > > Node0xe16530 -> Node0xe1f4d0[arrowtail=tee,color=gray63]; > > Node0xe162f0[ label =" %x"]; > > Node0xe162f0 -> Node0xe1f3a0[arrowtail=tee,color=gray63]; > > Node0xe16950[ label =" %tmp4"]; > > Node0xe16950 -> Node0xe1f3a0[arrowtail=tee,color=gray63]; > > Node0xe16730[ label =...

...;g1>}}"]; >> Node0xe1f4d0:g0 -> Node0xe1f3a0; >> Node0xe20900 [shape=record,shape=Mrecord,label="{ i32: GR\n @global\n|{<g0>}}"]; >> Node0xe16530[ label =" %x_addr"]; >> Node0xe16530 -> Node0xe1f4d0[arrowtail=tee,color=gray63]; >> Node0xe162f0[ label =" %x"]; >> Node0xe162f0 -> Node0xe1f3a0[arrowtail=tee,color=gray63]; >> Node0xe16950[ label =" %tmp4"]; >> Node0xe16950 -> Node0xe1f3a0[arrowtail=tee,color=gray63]; >> Node0xe16730[ label =&quot...

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

...d: HI\n}"]; Node0x100ae1d20 [shape=record,shape=Mrecord,label="{ void: HI\n}"]; Node0x100ae1fc0 [shape=record,shape=Mrecord,label="{ void: HI\n}"]; Node0x100aebf90[ plaintext=circle, label =" %my"]; Node0x100aebf90 -> Node0x100ae1c40[arrowtail=tee,color=gray63]; If you look at it, you'll see each node has the InComplete Bit on. But when I use 'analyze -tddatastructure file.bc' I got the graph in which all the nodes don't have the bit on. So they are different. Could you tell me why the results from the analyze tool and from the dsg.dump(...

...8F8F8F", "gray57", "#919191", "gray58", "#949494", "gray59", "#969696", "gray60", "#999999", "gray61", "#9C9C9C", "gray62", "#9E9E9E", "gray63", "#A1A1A1", "gray64", "#A3A3A3", "gray65", "#A6A6A6", "gray66", "#A8A8A8", "gray67", "#ABABAB", "gray68", "#ADADAD", "gray69", "#B0B0B0&q...