mono_binary_search (const void * key, const void * array, size_t array_length, size_t member_size, int (*BinarySearchComparer) (const void *, const void *) comparer)
{
  unsigned int D.2212;
  unsigned int D.2213;
  void * D.2216;
  const char * base;
  size_t lim;
  int cmp;
  const void * p;

  base = array;
  lim = array_length;
  goto <D.2209>;
  <D.2208>:
  D.2212 = lim >> 1;
  D.2213 = D.2212 * member_size;
  p = base + D.2213;
  cmp = comparer (key, p);
  if (cmp == 0) goto <D.2214>; else goto <D.2215>;
  <D.2214>:
  D.2216 = p;
  return D.2216;
  <D.2215>:
  if (cmp > 0) goto <D.2217>; else goto <D.2218>;
  <D.2217>:
  base = p + member_size;
  lim = lim + 4294967295;
  <D.2218>:
  lim = lim >> 1;
  <D.2209>:
  if (lim != 0) goto <D.2208>; else goto <D.2210>;
  <D.2210>:
  D.2216 = 0B;
  return D.2216;
}