mono_binary_search (const void * key, const void * array, size_t array_length, size_t member_size, int (*BinarySearchComparer) (const void *, const void *) comparer)
{
  long unsigned int D.2806;
  long unsigned int D.2807;
  void * D.2810;
  const char * base;
  size_t lim;
  int cmp;
  const void * p;

  base = array;
  lim = array_length;
  goto <D.2803>;
  <D.2802>:
  D.2806 = lim >> 1;
  D.2807 = D.2806 * member_size;
  p = base + D.2807;
  cmp = comparer (key, p);
  if (cmp == 0) goto <D.2808>; else goto <D.2809>;
  <D.2808>:
  D.2810 = p;
  return D.2810;
  <D.2809>:
  if (cmp > 0) goto <D.2811>; else goto <D.2812>;
  <D.2811>:
  base = p + member_size;
  lim = lim + 18446744073709551615;
  <D.2812>:
  lim = lim >> 1;
  <D.2803>:
  if (lim != 0) goto <D.2802>; else goto <D.2804>;
  <D.2804>:
  D.2810 = 0B;
  return D.2810;
}