code: def _quotient_exponent(x, y):
      
      assert mpfr.mpfr_regular_p(x)
      assert mpfr.mpfr_regular_p(y)
  
      # Make copy of x with the exponent of y.
      x2 = mpfr.Mpfr_t()
      mpfr.mpfr_init2(x2, mpfr.mpfr_get_prec(x))
      mpfr.mpfr_set(x2, x, mpfr.MPFR_RNDN)
      mpfr.mpfr_set_exp(x2, mpfr.mpfr_get_exp(y))
  
      # Compare x2 and y, disregarding the sign.
      extra = mpfr.mpfr_cmpabs(x2, y) >= 0
      return extra + mpfr.mpfr_get_exp(x) - mpfr.mpfr_get_exp(y)
docs: Given two positive finite MPFR instances x and y,
      find the exponent of x / y; that is, the unique
      integer e such that 2**(e-1) <= x / y < 2**e.