digraph G {
rankdir=LR;
size="10,8";
orientation=landscape;
subgraph cluster_13 {
label="FILE source.c"
source13 [label="#include ''header.h''nmain(){ return 1;}n",shape=box]
53 [label="main"];
source13 -> 53 [label="contains",weight=100,color=orange,constraint=false ]
}
subgraph cluster_14 {
label="FILE header.h"
source14 [label="#ifndef __HEADER n#define __HEADER ntypedef int type; n#include ''header1.h'' ntypedef type_x * p_type_x;n#endif n",shape=box]
44 [label="__HEADER"];
source14 -> 44 [label="contains",weight=100,color=orange,constraint=false ]
47 [label="type"];
source14 -> 47 [label="contains",weight=100,color=orange,constraint=false ]
52 [label="p_type_x"];
source14 -> 52 [label="contains",weight=100,color=orange,constraint=false ]
}
subgraph cluster_15 {
label="FILE header1.h"
source15 [label="#ifndef __HEADER1 n#define __HEADER1 n#include ''header2.h''n#endif n",shape=box]
45 [label="__HEADER1"];
source15 -> 45 [label="contains",weight=100,color=orange,constraint=false ]
}
subgraph cluster_16 {
label="FILE header2.h"
source16 [label="#ifndef __HEADER2 n#define __HEADER2 n#include ''header.h''ntypedef struct x {n type a; n int b; n} type_x; n#endif n",shape=box]
46 [label="__HEADER2"];
source16 -> 46 [label="contains",weight=100,color=orange,constraint=false ]
48 [label="type_x"];
source16 -> 48 [label="contains",weight=100,color=orange,constraint=false ]
50 [label="a"];
49 -> 50 [label="contains",weight=100,color=orange,constraint=false ]
51 [label="b"];
49 -> 51 [label="contains",weight=100,color=orange,constraint=false ]
49 [label="x"];
source16 -> 49 [label="contains",weight=100,color=orange,constraint=false ]
}
3 [label="@__UNDEFINED__@"];
source13 -> source14 [label="includes" ]
source14 -> source15 [label="includes" ]
source15 -> source16 [label="includes" ]
source16 -> source14 [label="includes" ]
source14 -> 44 [label="reads" ]
50 -> 47 [label="uses" ]
48 -> 49 [label="uses" ]
52 -> 48 [label="uses" ]
}