Register Spilling Heuristic ?

Hello all,

I am trying to implement Briggs register allocator. While doing that i
came across documents indicating how to choose nodes for spilling. The
documents says to avoid choosing nodes that are the tiny live ranges
resulting from the fetches of previously spilled registers.

What does this mean? Does it mean that the definition points of a
spilled live range that have been stored to memory in a previous
spilling iteration do not need to be stored again and the definition
points of a spilled live range that begin with spill loads that were
inserted in a previous spilling iteration do not need to be stored.

Any help is appreciated.

Regards,
Shafi.

.