Lines Matching refs:lim
21 #define BR_PC_GET (pc - (UInt32)(SizeT)(lim - p))
78 const Byte *lim;
83 lim = p + size;
93 if Z7_UNLIKELY(p == lim)
130 const Byte *lim;
132 lim = p + size;
142 if Z7_UNLIKELY(p >= lim) { return p; } p += 4; if Z7_UNLIKELY(p[-1] == 0xeb) break;
143 if Z7_UNLIKELY(p >= lim) { return p; } p += 4; if Z7_UNLIKELY(p[-1] == 0xeb) break;
161 const Byte *lim;
163 lim = p + size;
172 if Z7_UNLIKELY(p == lim)
205 const Byte *lim;
208 lim = p + size;
216 if Z7_UNLIKELY(p == lim)
263 Byte *lim;
268 lim = p + size;
287 // optimized version to reduce one (p >= lim) check:
298 // if (p >= lim) { ARMT_TAIL_PROC } b3 = b1 + 8; b1 = p[3]; p += 2; if ((b3 & b1) >= 0xf8) break;
299 if Z7_UNLIKELY(p >= lim) { ARMT_TAIL_PROC } b3 = p[3]; p += 2; if Z7_UNLIKELY((b3 & (b1 ^ 8)) >= 0xf8) break;
300 if Z7_UNLIKELY(p >= lim) { ARMT_TAIL_PROC } b1 = p[3]; p += 2; if Z7_UNLIKELY((b1 & (b3 ^ 8)) >= 0xf8) break;
330 while (p < lim);
333 // if ((Byte)((lim[1] & 0xf8)) != 0xf0) { lim += 2; } return lim;
334 // return (Byte *)(lim + ((Byte)((lim[1] ^ 0xf0) & 0xf8) == 0 ? 0 : 2));
335 // return (Byte *)(lim + (((lim[1] ^ ~0xfu) & ~7u) == 0 ? 0 : 2));
336 // return (Byte *)(lim + 2 - (((((unsigned)lim[1] ^ 8) + 8) >> 7) & 2));
346 const Byte *lim;
348 lim = p + size;
358 if Z7_UNLIKELY(p == lim)