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.2562;
  long unsigned int D.2563;
  void * D.2566;
  const char * base;
  size_t lim;
  int cmp;
  const void * p;

  base = array;
  lim = array_length;
  goto <D.2559>;
  <D.2558>:
  D.2562 = lim >> 1;
  D.2563 = D.2562 * member_size;
  p = base + D.2563;
  cmp = comparer (key, p);
  if (cmp == 0) goto <D.2564>; else goto <D.2565>;
  <D.2564>:
  D.2566 = p;
  return D.2566;
  <D.2565>:
  if (cmp > 0) goto <D.2567>; else goto <D.2568>;
  <D.2567>:
  base = p + member_size;
  lim = lim + 18446744073709551615;
  <D.2568>:
  lim = lim >> 1;
  <D.2559>:
  if (lim != 0) goto <D.2558>; else goto <D.2560>;
  <D.2560>:
  D.2566 = 0B;
  return D.2566;
}