m                 560 host/minilua.c #define resetbits(x,m)((x)&=cast(lu_byte,~(m)))
m                 561 host/minilua.c #define setbits(x,m)((x)|=(m))
m                 562 host/minilua.c #define testbits(x,m)((x)&(m))
m                 947 host/minilua.c #define getBMode(m)(cast(enum OpArgMask,(luaP_opmodes[m]>>4)&3))
m                 948 host/minilua.c #define getCMode(m)(cast(enum OpArgMask,(luaP_opmodes[m]>>2)&3))
m                 949 host/minilua.c #define testTMode(m)(luaP_opmodes[m]&(1<<7))
m                1698 host/minilua.c unsigned int m=(i+j)/2;
m                1699 host/minilua.c if(ttisnil(luaH_getnum(t,m)))j=m;
m                1700 host/minilua.c else i=m;
m                1709 host/minilua.c unsigned int m=(i+j)/2;
m                1710 host/minilua.c if(ttisnil(&t->array[m-1]))j=m;
m                1711 host/minilua.c else i=m;
m                1952 host/minilua.c size_t m=0;
m                1953 host/minilua.c while(g->gray)m+=propagatemark(g);
m                1954 host/minilua.c return m;
m                2619 host/minilua.c #define opmode(t,a,b,c,m)(((t)<<7)|((a)<<6)|((b)<<4)|((c)<<2)|(m))
m                3657 host/minilua.c #define luaY_checklimit(fs,v,l,m)if((v)>(l))errorlimit(fs,l,m)
m                7290 host/minilua.c int m=s<ms->src_end&&singlematch(uchar(*s),p,ep);
m                7294 host/minilua.c if(m&&((res=match(ms,s+1,ep+1))!=NULL))
m                7302 host/minilua.c return(m?max_expand(ms,s+1,p,ep):NULL);
m                7308 host/minilua.c if(!m)return NULL;
m                 145 lib_io.c         MSize m = LUAL_BUFFERSIZE, n = 0, ok = 0;
m                 148 lib_io.c           buf = lj_str_needbuf(L, &G(L)->tmpbuf, m);
m                 149 lib_io.c           if (fgets(buf+n, m-n, fp) == NULL) break;
m                 153 lib_io.c           if (n >= m - 64) m += m;
m                 162 lib_io.c         MSize m, n;
m                 163 lib_io.c         for (m = LUAL_BUFFERSIZE, n = 0; ; m += m) {
m                 164 lib_io.c           char *buf = lj_str_needbuf(L, &G(L)->tmpbuf, m);
m                 165 lib_io.c           n += (MSize)fread(buf+n, 1, m-n, fp);
m                 166 lib_io.c           if (n != m) {
m                 176 lib_io.c         if (m) {
m                 177 lib_io.c           char *buf = lj_str_needbuf(L, &G(L)->tmpbuf, m);
m                 178 lib_io.c           MSize n = (MSize)fread(buf, 1, m, fp);
m                 181 lib_io.c           return (n > 0 || m == 0);
m                 313 lib_jit.c          int32_t m = lj_ir_mode[ir->o];
m                 314 lib_jit.c          setintV(L->top-2, m);
m                 316 lib_jit.c          setintV(L->top++, (int32_t)ir->op1 - (irm_op1(m)==IRMref ? REF_BIAS : 0));
m                 317 lib_jit.c          setintV(L->top++, (int32_t)ir->op2 - (irm_op2(m)==IRMref ? REF_BIAS : 0));
m                 144 lib_math.c         uint32_t m = 1u << (r&255);
m                 147 lib_math.c         if (u.u64 < m) u.u64 += m;  /* Ensure k[i] MSB of gen[i] are non-zero. */
m                 421 lib_string.c       int m = s<ms->src_end && singlematch(uchar(*s), p, ep);
m                 425 lib_string.c         if (m && ((res=match(ms, s+1, ep+1)) != NULL)) {
m                 436 lib_string.c         s = (m ? max_expand(ms, s+1, p, ep) : NULL);
m                 442 lib_string.c         if (m) { s++; p=ep; goto init; }  /* else s = match(ms, s+1, ep); */
m                  76 lib_table.c      lua_Number m = 0;
m                  80 lib_table.c          m = (lua_Number)(int32_t)i;
m                  87 lib_table.c          if (n > m) m = n;
m                  89 lib_table.c      setnumV(L->top-1, m);
m                 492 lj_alloc.c       msegmentptr sp = &m->seg;
m                 504 lj_alloc.c       msegmentptr sp = &m->seg;
m                 800 lj_alloc.c       m->top = p;
m                 801 lj_alloc.c       m->topsize = psize;
m                 805 lj_alloc.c       m->trim_check = DEFAULT_TRIM_THRESHOLD; /* reset on each update */
m                 814 lj_alloc.c         sbinptr bin = smallbin_at(m,i);
m                 827 lj_alloc.c       set_size_and_pinuse_of_inuse_chunk(m, p, nb);
m                 830 lj_alloc.c       if (oldfirst == m->top) {
m                 831 lj_alloc.c         size_t tsize = m->topsize += qsize;
m                 832 lj_alloc.c         m->top = q;
m                 834 lj_alloc.c       } else if (oldfirst == m->dv) {
m                 835 lj_alloc.c         size_t dsize = m->dvsize += qsize;
m                 836 lj_alloc.c         m->dv = q;
m                 841 lj_alloc.c           unlink_chunk(m, oldfirst, nsize);
m                 846 lj_alloc.c         insert_chunk(m, q, qsize);
m                 856 lj_alloc.c       char *old_top = (char *)m->top;
m                 857 lj_alloc.c       msegmentptr oldsp = segment_holding(m, old_top);
m                 870 lj_alloc.c       init_top(m, (mchunkptr)tbase, tsize - TOP_FOOT_SIZE);
m                 873 lj_alloc.c       set_size_and_pinuse_of_inuse_chunk(m, sp, ssize);
m                 874 lj_alloc.c       *ss = m->seg; /* Push current record */
m                 875 lj_alloc.c       m->seg.base = tbase;
m                 876 lj_alloc.c       m->seg.size = tsize;
m                 877 lj_alloc.c       m->seg.next = ss;
m                 895 lj_alloc.c         insert_chunk(m, q, psize);
m                 926 lj_alloc.c         msegmentptr sp = &m->seg;
m                 930 lj_alloc.c         if (sp != 0 && segment_holds(sp, m->top)) { /* append */
m                 932 lj_alloc.c           init_top(m, m->top, m->topsize + tsize);
m                 934 lj_alloc.c           sp = &m->seg;
m                 941 lj_alloc.c     	return prepend_alloc(m, tbase, oldbase, nb);
m                 943 lj_alloc.c     	add_segment(m, tbase, tsize);
m                 947 lj_alloc.c         if (nb < m->topsize) { /* Allocate from new or extended top space */
m                 948 lj_alloc.c           size_t rsize = m->topsize -= nb;
m                 949 lj_alloc.c           mchunkptr p = m->top;
m                 950 lj_alloc.c           mchunkptr r = m->top = chunk_plus_offset(p, nb);
m                 952 lj_alloc.c           set_size_and_pinuse_of_inuse_chunk(m, p, nb);
m                 967 lj_alloc.c       msegmentptr pred = &m->seg;
m                 980 lj_alloc.c     	if (p == m->dv) {
m                 981 lj_alloc.c     	  m->dv = 0;
m                 982 lj_alloc.c     	  m->dvsize = 0;
m                 984 lj_alloc.c     	  unlink_large_chunk(m, tp);
m                 992 lj_alloc.c     	  insert_large_chunk(m, tp, psize);
m                1000 lj_alloc.c       m->release_checks = nsegs > MAX_RELEASE_CHECK_RATE ?
m                1008 lj_alloc.c       if (pad < MAX_REQUEST && is_initialized(m)) {
m                1011 lj_alloc.c         if (m->topsize > pad) {
m                1014 lj_alloc.c           size_t extra = ((m->topsize - pad + (unit - SIZE_T_ONE)) / unit -
m                1016 lj_alloc.c           msegmentptr sp = segment_holding(m, (char *)m->top);
m                1019 lj_alloc.c     	  !has_segment_link(m, sp)) { /* can't shrink if pinned */
m                1030 lj_alloc.c     	init_top(m, m->top, m->topsize - released);
m                1035 lj_alloc.c         released += release_unused_segments(m);
m                1038 lj_alloc.c         if (released == 0 && m->topsize > m->trim_check)
m                1039 lj_alloc.c           m->trim_check = MAX_SIZE_T;
m                1056 lj_alloc.c       if ((t = *treebin_at(m, idx)) != 0) {
m                1081 lj_alloc.c         binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap;
m                1083 lj_alloc.c           t = *treebin_at(m, lj_ffs(leftbits));
m                1096 lj_alloc.c       if (v != 0 && rsize < (size_t)(m->dvsize - nb)) {
m                1098 lj_alloc.c         unlink_large_chunk(m, v);
m                1100 lj_alloc.c           set_inuse_and_pinuse(m, v, (rsize + nb));
m                1102 lj_alloc.c           set_size_and_pinuse_of_inuse_chunk(m, v, nb);
m                1104 lj_alloc.c           insert_chunk(m, r, rsize);
m                1117 lj_alloc.c       bindex_t i = lj_ffs(m->treemap);
m                1119 lj_alloc.c       v = t = *treebin_at(m, i);
m                1131 lj_alloc.c       unlink_large_chunk(m, v);
m                1133 lj_alloc.c         set_inuse_and_pinuse(m, v, (rsize + nb));
m                1135 lj_alloc.c         set_size_and_pinuse_of_inuse_chunk(m, v, nb);
m                1137 lj_alloc.c         replace_dv(m, r, rsize);
m                1154 lj_alloc.c         mstate m = (mstate)(chunk2mem(msp));
m                1155 lj_alloc.c         memset(m, 0, msize);
m                1157 lj_alloc.c         m->seg.base = tbase;
m                1158 lj_alloc.c         m->seg.size = tsize;
m                1159 lj_alloc.c         m->release_checks = MAX_RELEASE_CHECK_RATE;
m                1160 lj_alloc.c         init_bins(m);
m                1161 lj_alloc.c         mn = next_chunk(mem2chunk(m));
m                1162 lj_alloc.c         init_top(m, mn, (size_t)((tbase + tsize) - (char *)mn) - TOP_FOOT_SIZE);
m                1163 lj_alloc.c         return m;
m                1339 lj_alloc.c         mstate m = (mstate)msp;
m                1354 lj_alloc.c     	set_inuse(m, newp, nb);
m                1355 lj_alloc.c     	set_inuse(m, rem, rsize);
m                1356 lj_alloc.c     	lj_alloc_free(m, chunk2mem(rem));
m                1358 lj_alloc.c         } else if (next == m->top && oldsize + m->topsize > nb) {
m                1360 lj_alloc.c           size_t newsize = oldsize + m->topsize;
m                1363 lj_alloc.c           set_inuse(m, oldp, nb);
m                1365 lj_alloc.c           m->top = newtop;
m                1366 lj_alloc.c           m->topsize = newtopsize;
m                1373 lj_alloc.c           void *newmem = lj_alloc_malloc(m, nsize);
m                1377 lj_alloc.c     	lj_alloc_free(m, ptr);
m                 207 lj_asm_arm.h         Reg m = ra_alloc1(as, ir->op1, allow);
m                 212 lj_asm_arm.h   	return m | ARMF_SH(sh, (IR(ir->op2)->i & 31));
m                 214 lj_asm_arm.h   	Reg s = ra_alloc1(as, ir->op2, rset_exclude(allow, m));
m                 215 lj_asm_arm.h   	return m | ARMF_RSH(sh, s);
m                 218 lj_asm_arm.h         Reg m = ra_alloc1(as, ir->op1, allow);
m                 219 lj_asm_arm.h         return m | ARMF_SH(ARMSH_LSL, 1);
m                 283 lj_asm_arm.h   	uint32_t m = asm_fuseopm(as, 0, ir->op2, rset_exclude(allow, rn));
m                 288 lj_asm_arm.h   	emit_dn(as, ARMI_ADD^m, rd, rn);
m                1015 lj_asm_arm.h       uint32_t k, m = ARMI_K12|sizeof(GCstr);
m                1025 lj_asm_arm.h         m = k;
m                1030 lj_asm_arm.h       emit_dn(as, ARMI_ADD^m, dest, dest);
m                1437 lj_asm_arm.h     uint32_t m;
m                1444 lj_asm_arm.h     m = asm_fuseopm(as, ai, rref, rset_exclude(RSET_GPR, left));
m                1449 lj_asm_arm.h     emit_dn(as, ai^m, dest, left);
m                1480 lj_asm_arm.h       uint32_t m = asm_fuseopm(as, ai, ir->op1, RSET_GPR);
m                1481 lj_asm_arm.h       emit_d(as, ai^m, dest);
m                1776 lj_asm_arm.h     uint32_t m;
m                1812 lj_asm_arm.h     m = asm_fuseopm(as, ARMI_CMP, rref, rset_exclude(RSET_GPR, left));
m                1814 lj_asm_arm.h     emit_n(as, ARMI_CMP^m, left);
m                  30 lj_emit_arm.h    uint32_t invai, i, m = (uint32_t)n;
m                  32 lj_emit_arm.h    for (i = 0; i < 4096; i += 256, m = lj_rol(m, 2))
m                  33 lj_emit_arm.h      if (m <= 255) return ARMI_K12|m|i;
m                  37 lj_emit_arm.h    m = ~(uint32_t)n;
m                  39 lj_emit_arm.h        invai == (ARMI_CMP^ARMI_CMN) >> 21) m++;
m                  40 lj_emit_arm.h    for (i = 0; i < 4096; i += 256, m = lj_rol(m, 2))
m                  41 lj_emit_arm.h      if (m <= 255) return ARMI_K12|(invai<<21)|m|i;
m                 197 lj_emit_arm.h        int32_t m = i & (255 << sh);
m                 200 lj_emit_arm.h  	emit_d(as, ARMI_MOV ^ emit_isk12(0, m), r);
m                 203 lj_emit_arm.h        emit_dn(as, ARMI_ORR ^ emit_isk12(0, m), r, r);
m                 872 lj_ffrecord.c    uint32_t m = recdef_lookup(J->fn);
m                 873 lj_ffrecord.c    rd.data = m & 0xff;
m                 877 lj_ffrecord.c    (recff_func[m >> 8])(J, &rd);  /* Call recff_* handler. */
m                 127 lj_gc.c          size_t m = 0;
m                 137 lj_gc.c              m += sizeudata(gco2ud(o));
m                 151 lj_gc.c          return m;
m                 350 lj_gc.c          size_t m = 0;
m                 352 lj_gc.c            m += propagatemark(g);
m                 353 lj_gc.c          return m;
m                 127 lj_gc.h          ((p) = (t *)lj_mem_grow(L, (p), &(n), (m), (MSize)sizeof(t)))
m                 427 lj_gdbjit.c      if (n >= 10) { uint32_t m = n / 10; n = n % 10; gdbjit_catnum(ctx, m); }
m                 268 lj_ir.h        #define irm_op1(m)		((IRMode)((m)&3))
m                 269 lj_ir.h        #define irm_op2(m)		((IRMode)(((m)>>2)&3))
m                 270 lj_ir.h        #define irm_iscomm(m)		((m) & IRM_C)
m                 271 lj_ir.h        #define irm_kind(m)		((m) & IRM_S)
m                 273 lj_ir.h        #define IRMODE(name, m, m1, m2)	(((IRM##m1)|((IRM##m2)<<2)|(IRM_##m))^IRM_W),
m                  26 lj_mcode.h     #define lj_mcode_commitbot(J, m)	(J->mcbot = (m))
m                 184 lj_parse.c     #define checklimit(fs, v, l, m)		if ((v) >= (l)) err_limit(fs, l, m)
m                 185 lj_parse.c     #define checklimitgt(fs, v, l, m)	if ((v) > (l)) err_limit(fs, l, m)
m                 281 lj_snap.c        MSize n, m, nlim, nent = snap->nent;
m                 289 lj_snap.c        for (n = m = 0; n < nent; n++) {  /* Remove unused slots from snapshot. */
m                 292 lj_snap.c            map[m++] = map[n];  /* Only copy used slots. */
m                 294 lj_snap.c        snap->nent = (uint8_t)m;
m                 296 lj_snap.c        while (n <= nlim) map[m++] = map[n++];  /* Move PC + frame links down. */
m                 297 lj_snap.c        J->cur.nsnapmap = (uint16_t)(snap->mapofs + m);  /* Free up space in map. */
m                 604 lj_tab.c           MSize m = (i+j)/2;
m                 605 lj_tab.c           cTValue *tvb = lj_tab_getint(t, (int32_t)m);
m                 606 lj_tab.c           if (tvb && !tvisnil(tvb)) i = m; else j = m;
m                 621 lj_tab.c             MSize m = (i+j)/2;
m                 622 lj_tab.c             if (tvisnil(arrayslot(t, m-1))) j = m; else i = m;