Slow static reconfigure

Hi all, Loading a large set of prefixes into the static protocol is pretty quick, but reconfiguring is really slow. The current implementation uses linked lists which are traversed lots of times during the reconfiguration. I was wondering if these could be indexed and sorted in some way with one of the existing bird data structures - perhaps with a FIB - which would allow the use of a faster merge algorithm. Any other suggestions as to how the static reconfigure could be made faster? Rgs Neil