;; Function find_val (find_val)

find_val (c, v, e)
{
  int D.1557;

<bb 2>:
  if (c_3(D) < e_4(D))
    goto <bb 3>;
  else
    goto <bb 6>;

<bb 3>:
  D.1557_13 = c_3(D)->v;
  if (D.1557_13 == v_6(D))
    goto <bb 6>;
  else
    goto <bb 5>;

<bb 4>:
  D.1557_5 = c_8->v;
  if (D.1557_5 == v_6(D))
    goto <bb 6>;
  else
    goto <bb 5>;

<bb 5>:
  # c_14 = PHI <c_8(4), c_3(D)(3)>
  c_8 = c_14 + 16;
  if (e_4(D) > c_8)
    goto <bb 4>;
  else
    goto <bb 6>;

<bb 6>:
  # c_1 = PHI <c_8(4), 0B(5), 0B(2), c_3(D)(3)>
  return c_1;

}



;; Function find_prev (find_prev)

find_prev (c, w)
{
  struct list * o;

<bb 2>:
  if (c_3(D) != 0B)
    goto <bb 3>;
  else
    goto <bb 6>;

<bb 3>:
  c_12 = c_3(D)->n;
  if (c_12 == w_6(D))
    goto <bb 6>;
  else
    goto <bb 5>;

<bb 4>:
  c_5 = c_13->n;
  if (c_5 == w_6(D))
    goto <bb 6>;
  else
    goto <bb 5>;

<bb 5>:
  # c_13 = PHI <c_5(4), c_12(3)>
  if (c_13 != 0B)
    goto <bb 4>;
  else
    goto <bb 6>;

<bb 6>:
  # o_2 = PHI <c_13(4), 0B(5), 0B(2), c_3(D)(3)>
  return o_2;

}



;; Function check_arr (check_arr)

check_arr (c, e)
{
  struct list * D.1579;
  int D.1577;
  int D.1575;

<bb 2>:
  goto <bb 4>;

<bb 3>:
  D.1575_6 = c_1->v;
  c_7 = c_1 + 16;
  D.1577_8 = c_7->v;
  if (D.1575_6 > D.1577_8)
    goto <bb 5>;
  else
    goto <bb 4>;

<bb 4>:
  # c_1 = PHI <c_3(D)(2), c_7(3)>
  D.1579_5 = e_4(D) + -16;
  if (c_1 < D.1579_5)
    goto <bb 3>;
  else
    goto <bb 5>;

<bb 5>:
  # c_2 = PHI <c_1(3), 0B(4)>
  return c_2;

}



;; Function check_list (check_list)

check_list (c, t)
{
  struct list * n;
  int D.1589;
  int D.1588;

<bb 2>:
  if (c_3(D) != t_4(D))
    goto <bb 3>;
  else
    goto <bb 6>;

<bb 3>:
  n_13 = c_3(D)->n;
  D.1588_14 = c_3(D)->v;
  D.1589_16 = n_13->v;
  if (D.1588_14 > D.1589_16)
    goto <bb 6>;
  else
    goto <bb 5>;

<bb 4>:
  n_5 = n_17->n;
  D.1588_6 = n_17->v;
  D.1589_7 = n_5->v;
  if (D.1588_6 > D.1589_7)
    goto <bb 6>;
  else
    goto <bb 5>;

<bb 5>:
  # n_17 = PHI <n_5(4), n_13(3)>
  if (t_4(D) != n_17)
    goto <bb 4>;
  else
    goto <bb 6>;

<bb 6>:
  # c_1 = PHI <n_17(4), 0B(5), 0B(2), c_3(D)(3)>
  return c_1;

}



;; Function abs_find_val (abs_find_val)

abs_find_val (c)
{
<bb 2>:
  if (c_2(D) != 0B)
    goto <bb 3>;
  else
    goto <bb 4>;

<bb 3>:
  # c_5 = PHI <c_3(3), c_2(D)(2)>
  __asm__ __volatile__("# find_val"::"r" c_5, "r" c_5, "r" c_5);
  c_3 = c_5 + 16;
  if (c_3 != 0B)
    goto <bb 3>;
  else
    goto <bb 4>;

<bb 4>:
  return;

}



;; Function abs_check_arr (abs_check_arr)

abs_check_arr (c)
{
<bb 2>:
  if (c_2(D) != 0B)
    goto <bb 3>;
  else
    goto <bb 4>;

<bb 3>:
  # c_5 = PHI <c_3(3), c_2(D)(2)>
  c_3 = c_5 + 16;
  __asm__ __volatile__("# check_arr"::"r" c_5, "r" c_3, "r" c_5);
  if (c_3 != 0B)
    goto <bb 3>;
  else
    goto <bb 4>;

<bb 4>:
  return;

}



;; Function abs_check_list (abs_check_list)

abs_check_list (c)
{
  struct list * n;

<bb 2>:
  if (c_2(D) != 0B)
    goto <bb 3>;
  else
    goto <bb 4>;

<bb 3>:
  # c_8 = PHI <n_4(3), c_2(D)(2)>
  n_4 = c_8->n;
  __asm__ __volatile__("# check_list"::"r" c_8, "r" n_4, "r" c_8);
  if (n_4 != 0B)
    goto <bb 3>;
  else
    goto <bb 4>;

<bb 4>:
  return;

}



;; Function abs_find_prev (abs_find_prev)

abs_find_prev (c)
{
<bb 2>:
  if (c_2(D) != 0B)
    goto <bb 3>;
  else
    goto <bb 4>;

<bb 3>:
  # c_7 = PHI <c_4(3), c_2(D)(2)>
  c_4 = c_7->n;
  __asm__ __volatile__("# find_prev"::"r" c_4, "r" c_4, "r" c_7);
  if (c_4 != 0B)
    goto <bb 3>;
  else
    goto <bb 4>;

<bb 4>:
  return;

}



;; Function abs_all (abs_all)

abs_all (c)
{
<bb 2>:
  if (c_1(D) != 0B)
    goto <bb 3>;
  else
    goto <bb 4>;

<bb 3>:
  # c_21 = PHI <c_3(3), c_1(D)(2)>
  __asm__ __volatile__("# find_val"::"r" c_21, "r" c_21, "r" c_21);
  c_3 = c_21 + 16;
  if (c_3 != 0B)
    goto <bb 3>;
  else
    goto <bb 4>;

<bb 4>:
  # c_11 = PHI <c_1(D)(3), c_1(D)(2)>
  if (c_11 != 0B)
    goto <bb 5>;
  else
    goto <bb 6>;

<bb 5>:
  # c_19 = PHI <c_4(5), c_11(4)>
  c_4 = c_19 + 16;
  __asm__ __volatile__("# check_arr"::"r" c_19, "r" c_4, "r" c_19);
  if (c_4 != 0B)
    goto <bb 5>;
  else
    goto <bb 6>;

<bb 6>:
  # c_12 = PHI <c_1(D)(5), c_1(D)(4)>
  if (c_12 != 0B)
    goto <bb 7>;
  else
    goto <bb 8>;

<bb 7>:
  # c_16 = PHI <c_7(7), c_12(6)>
  c_7 = c_16->n;
  __asm__ __volatile__("# check_list"::"r" c_16, "r" c_7, "r" c_16);
  if (c_7 != 0B)
    goto <bb 7>;
  else
    goto <bb 8>;

<bb 8>:
  # c_13 = PHI <c_1(D)(7), c_1(D)(6)>
  if (c_13 != 0B)
    goto <bb 9>;
  else
    goto <bb 10>;

<bb 9>:
  # c_18 = PHI <c_9(9), c_13(8)>
  c_9 = c_18->n;
  __asm__ __volatile__("# find_prev"::"r" c_9, "r" c_9, "r" c_18);
  if (c_9 != 0B)
    goto <bb 9>;
  else
    goto <bb 10>;

<bb 10>:
  return;

}