LEFT_TOTAL_LENGTH  264 src/intervals.c       position += LEFT_TOTAL_LENGTH (tree);
LEFT_TOTAL_LENGTH  386 src/intervals.c       old_diff = LEFT_TOTAL_LENGTH (i) - RIGHT_TOTAL_LENGTH (i);
LEFT_TOTAL_LENGTH  391 src/intervals.c 	    + RIGHT_TOTAL_LENGTH (i->left) - LEFT_TOTAL_LENGTH (i->left);
LEFT_TOTAL_LENGTH  401 src/intervals.c 	    + LEFT_TOTAL_LENGTH (i->right) - RIGHT_TOTAL_LENGTH (i->right);
LEFT_TOTAL_LENGTH  626 src/intervals.c       if (relative_position < LEFT_TOTAL_LENGTH (tree))
LEFT_TOTAL_LENGTH  642 src/intervals.c 	       + LEFT_TOTAL_LENGTH (tree)); /* left edge of this interval.  */
LEFT_TOTAL_LENGTH  730 src/intervals.c       i->position + TOTAL_LENGTH (i) - LEFT_TOTAL_LENGTH (i);   \
LEFT_TOTAL_LENGTH  733 src/intervals.c       i->position - LEFT_TOTAL_LENGTH (i)                       \
LEFT_TOTAL_LENGTH  752 src/intervals.c 	  if (pos >= i->position - LEFT_TOTAL_LENGTH (i))
LEFT_TOTAL_LENGTH  755 src/intervals.c 		+ LEFT_TOTAL_LENGTH (i->left);
LEFT_TOTAL_LENGTH  773 src/intervals.c 	        + LEFT_TOTAL_LENGTH (i->right);
LEFT_TOTAL_LENGTH 1257 src/intervals.c   if (relative_position < LEFT_TOTAL_LENGTH (tree))
LEFT_TOTAL_LENGTH 2351 src/intervals.c             = advance_to_char_boundary (start_byte + LEFT_TOTAL_LENGTH (i));
LEFT_TOTAL_LENGTH 2357 src/intervals.c 	  left_end = start + LEFT_TOTAL_LENGTH (i);
LEFT_TOTAL_LENGTH 2389 src/intervals.c   if (LEFT_TOTAL_LENGTH (i) + RIGHT_TOTAL_LENGTH (i) >= TOTAL_LENGTH (i))
LEFT_TOTAL_LENGTH  109 src/intervals.h 		   - LEFT_TOTAL_LENGTH (i))