__rb_deepest_left
return __rb_deepest_left(RB_RIGHT(parent, __entry));
for ((x) = rb_entry_safe(__rb_deepest_left((head)->rb_node), \
