[r6689]

[r6688]

[r6687]

[r6686]

[r6685]

endless loops else :-(

[r6684]

added better support for ia32/x86_64

[r6683]

[r6682]

[r6681]

[r6680]

[r6679]

[r6678]

[r6677]

Tail-recursion removement can only be done in it can be prove that
all lifetimes of locals can be ended before the recursion. We do that by simply
checking that there addresses are not stored. This sorryly
reduces the possibility of this optimization.

[r6676]

contain the initialization code as default

[r6675]

[r6674]

[r6673]

Confirm: optimize two identical Confirms
gigo(): handles Unknowns

[r6671]

[r6668]

[r6667]

[r6666]

into live blocks ...

[r6665]

dumped dead blocks in orange
add attribute info to blocks

[r6664]

[r6663]

ALL data from all graphs are deleted!

[r6660]

[r6659]

is availabe even if the grph is floating (but then may be invalid)

[r6658]

nodes outgoing edges, which is safe against alteration of an edge while
iterating.

[r6656]

[r6655]

[r6654]

[r6650]

[r6647]

now honors the additional entity/graph properties

[r6646]

[r6645]

[r6644]

[r6638]

[r6632]

[r6626]

[r6625]

[r6624]