@thorham Thanks for your analysis. I don't understand all what you write.
Code:
cmp.l #bla.a2,d0
bne .l2
move.l d1,bla.a2(a0)
But I can't remember to have such a code and I use almost everywhere the Exec-Lists, where the pointer to the last node is in the list-header.
However I found out that i can really speed up the whole thing by maintaining a chain of objects that want refresh instead of traversing the whole object-tree to find them.
