Split rtree_elm_lookup_hard() out of rtree_elm_lookup().

Anything but a hit in the first element of the lookup cache is
expensive enough to negate the benefits of inlining.