bananabread-asm.js

function Vb(d) {
	d = d | 0;
	var e = 0, f = 0, h = 0, j = 0, k = 0, l = 0, m = 0, n = 0,
		o = 0, p = 0, q = 0, r = 0, s = 0;
	e = i;
	i = i + 12 | 0;
	f = e | 0;
	h = d + 12 | 0;
	j = c[h >> 2] | 0;
	if ((j | 0) > 0) {
		c[h >> 2] = 0;
		k = 0
	} else {
		k = j
	}
	j = d + 24 | 0;
	if ((c[j >> 2] | 0) > 0) {
		c[j >> 2] = 0
	}
	l = d + 28 | 0;
	c[l >> 2] = 0;
	c[l + 4 >> 2] = 0;
	l = (c[1384465] | 0) + 3 | 0;
	do {
		if (l >>> 0 < 26) {
			if ((4980736 >>> (l >>> 0) & 1 | 0) == 0) {
				break
			}
			if ((c[1356579] | 0) > 0) {
				m = d + 4 | 0;
				n = 0;
				while (1) {
					o = c[(c[1356577] | 0) + (n << 2) >> 2] | 0;
					do {
						if (a[o + 22 | 0] << 24 >> 24 == 24) {
							if (!(Vp(d, o | 0) | 0)) {
								break
							}
							p = (c[m >> 2] | 0) + (((c[h >> 2] | 0) - 1 | 0) * 40 & -1) + 12 | 0;
							q = o + 28 | 0;
							c[p >> 2] = c[q >> 2] | 0;
							c[p + 4 >> 2] = c[q + 4 >> 2] | 0;
							c[p + 8 >> 2] = c[q + 8 >> 2] | 0;
							c[p + 12 >> 2] = c[q + 12 >> 2] | 0;
							c[p + 16 >> 2] = c[q + 16 >> 2] | 0;
							c[p + 20 >> 2] = c[q + 20 >> 2] | 0;
							c[p + 24 >> 2] = c[q + 24 >> 2] | 0
						}
					} while (0);
					o = n + 1 | 0;
					if ((o | 0) < (c[1356579] | 0)) {
						n = o
					} else {
						break
					}
				}
				r = c[h >> 2] | 0
			} else {
				r = k
			} if ((r | 0) == 0) {
				i = e;
				return
			}
			n = c[j >> 2] | 0;
			if ((n | 0) >= 1) {
				i = e;
				return
			}
			m = f | 0;
			o = f + 4 | 0;
			q = f + 8 | 0;
			p = n;
			while (1) {
				g[m >> 2] = 0.0;
				g[o >> 2] = 0.0;
				g[q >> 2] = 0.0;
				Vq(d, p, f, 0, -1e3);
				n = c[j >> 2] | 0;
				if ((n | 0) < 1) {
					p = n
				} else {
					break
				}
			}
			i = e;
			return
		}
	} while (0);
	if ((c[1356579] | 0) <= 0) {
		i = e;
		return
	}
	f = d + 16 | 0;
	r = 0;
	while (1) {
		k = c[(c[1356577] | 0) + (r << 2) >> 2] | 0;
		do {
			if (a[k + 22 | 0] << 24 >> 24 == 30) {
				h = b[k + 14 >> 1] | 0;
				if ((h - 1 & 65535) > 1) {
					break
				}
				l = c[j >> 2] | 0;
				p = (c[1384465] | 0) + 3 | 0;
				if (p >>> 0 < 26) {
					s = (2293760 >>> (p >>> 0) & 1 | 0) != 0 ? 0 : -1e3
				} else {
					s = -1e3
				} if (!(Vq(d, l, k | 0, h << 16 >> 16, s) | 0)) {
					break
				}
				g[(c[f >> 2] | 0) + (l * 112 & -1) + 56 >> 2] = +(b[k + 12 >> 1] << 16 >> 16 | 0);
				h = (c[f >> 2] | 0) + (l * 112 & -1) + 60 | 0;
				l = k + 28 | 0;
				c[h >> 2] = c[l >> 2] | 0;
				c[h + 4 >> 2] = c[l + 4 >> 2] | 0;
				c[h + 8 >> 2] = c[l + 8 >> 2] | 0;
				c[h + 12 >> 2] = c[l + 12 >> 2] | 0;
				c[h + 16 >> 2] = c[l + 16 >> 2] | 0;
				c[h + 20 >> 2] = c[l + 20 >> 2] | 0;
				c[h + 24 >> 2] = c[l + 24 >> 2] | 0
			}
		} while (0);
		k = r + 1 | 0;
		if ((k | 0) < (c[1356579] | 0)) {
			r = k
		} else {
			break
		}
	}
	i = e;
	return
}