gistfile1.txt

Breaking the 1 edges for void ProtoTypeTakingBoth(TheStruct s);

Breaking edge from 3 to 2
Breaking this particular connection
Node 2 now has 1 non-breakable incoming edges.
Also redirecting connection from 3 to 4 to come from 0 instead.
Node 4 now has 1 non-breakable incoming edges.
*** Free Node:
        struct TheStruct;

 This Free Node has an edge to void ProtoTypeTakingBoth(TheStruct s);

... which we think is in input
Reducing nbIncoming...
Last edge to this node taken out, moving to S...
 This Free Node has an edge to struct OtherStruct
{
   int a;
   TheStruct * b;
};

... which we think is in input
Reducing nbIncoming...
Last edge to this node taken out, moving to S...
*** Free Node:
        void ProtoTypeTakingBoth(TheStruct s);

 This Free Node has an edge to void OtherFunctionTakingAnotherStruct(OtherStruct s)
{
   s.b->a.a = 1;

   ProtoTypeTakingBoth(s.b);
   FunctionTakingAStruct(s.b);
}

... which we think is in input
Reducing nbIncoming...
*** Free Node:
        struct OtherStruct
{
   int a;
   TheStruct * b;
};

 This Free Node has an edge to void FunctionTakingAStruct(TheStruct s)
{
   s.a.a = 1;
   OtherFunctionTakingAnotherStruct(s.a);
}

... which we think is in input
Reducing nbIncoming...
 This Free Node has an edge to void OtherFunctionTakingAnotherStruct(OtherStruct s)
{
   s.b->a.a = 1;

   ProtoTypeTakingBoth(s.b);
   FunctionTakingAStruct(s.b);
}

... which we think is in input
Reducing nbIncoming...
 This Free Node has an edge to struct TheStruct
{
   OtherStruct a;
};

... which we think is in input
Reducing nbIncoming...
Last edge to this node taken out, moving to S...
*** Free Node:
        struct TheStruct
{
   OtherStruct a;
};

 This Free Node has an edge to void FunctionTakingAStruct(TheStruct s)
{
   s.a.a = 1;
   OtherFunctionTakingAnotherStruct(s.a);
}

... which we think is in input
!!! Something's wrong !!!Reducing nbIncoming...
Last edge to this node taken out, moving to B...
 This Free Node has an edge to void OtherFunctionTakingAnotherStruct(OtherStruct s)
{
   s.b->a.a = 1;

   ProtoTypeTakingBoth(s.b);
   FunctionTakingAStruct(s.b);
}

... which we think is in input
Reducing nbIncoming...
Last edge to this node taken out, moving to B...
Breaking the 0 edges for struct OtherStruct
{
   int a;
   TheStruct * b;
};

Breaking the 1 edges for void FunctionTakingAStruct(TheStruct s)
{
   s.a.a = 1;
   OtherFunctionTakingAnotherStruct(s.a);
}

Breaking edge from 1 to 0
Breaking this particular connection
Node 0 now has 1 non-breakable incoming edges.
*** Free Node:
        void OtherFunctionTakingAnotherStruct(OtherStruct s);

 This Free Node has an edge to void FunctionTakingAStruct(TheStruct s)
{
   s.a.a = 1;
   OtherFunctionTakingAnotherStruct(s.a);
}

... which we think is in input
Reducing nbIncoming...
Last edge to this node taken out, moving to S...
*** Free Node:
        void FunctionTakingAStruct(TheStruct s)
{
   s.a.a = 1;
   OtherFunctionTakingAnotherStruct(s.a);
}

 This Free Node has an edge to void OtherFunctionTakingAnotherStruct(OtherStruct s)
{
   s.b->a.a = 1;

   ProtoTypeTakingBoth(s.b);
   FunctionTakingAStruct(s.b);
}

... which we think this node is in B (
Last edge to this node taken out, moving to S...
*** Free Node:
        void OtherFunctionTakingAnotherStruct(OtherStruct s)
{
   s.b->a.a = 1;

   ProtoTypeTakingBoth(s.b);
   FunctionTakingAStruct(s.b);
}

Error: Graph has cycles!
Press any key to continue . . .