aboutsummaryrefslogtreecommitdiff
path: root/fonts
ModeNameSize
-rw-r--r--DroidSansFallbackFull.ttf4529044logplain
-rw-r--r--liberationmono.ttf333636logplain
-rw-r--r--liberationsans.ttf133828logplain
-rwxr-xr-xlucida_sans_10.xml156248logplain
-rwxr-xr-xlucida_sans_100.png12245logplain
-rwxr-xr-xlucida_sans_11.xml157272logplain
-rwxr-xr-xlucida_sans_110.png15193logplain
-rwxr-xr-xlucida_sans_12.xml157058logplain
-rwxr-xr-xlucida_sans_120.png16596logplain
-rwxr-xr-xlucida_sans_14.xml159272logplain
-rwxr-xr-xlucida_sans_140.png47080logplain
-rwxr-xr-xlucida_sans_16.xml160744logplain
-rwxr-xr-xlucida_sans_160.png53771logplain
-rwxr-xr-xlucida_sans_18.xml162284logplain
-rwxr-xr-xlucida_sans_180.png63899logplain
-rwxr-xr-xlucida_sans_20.xml162438logplain
-rwxr-xr-xlucida_sans_200.png76914logplain
-rwxr-xr-xlucida_sans_22.xml162936logplain
-rwxr-xr-xlucida_sans_220.png82941logplain
-rwxr-xr-xlucida_sans_24.xml166358logplain
-rwxr-xr-xlucida_sans_240.png94928logplain
-rwxr-xr-xlucida_sans_26.xml167054logplain
-rwxr-xr-xlucida_sans_260.png105072logplain
-rwxr-xr-xlucida_sans_28.xml167156logplain
-rwxr-xr-xlucida_sans_280.png114619logplain
-rwxr-xr-xlucida_sans_36.xml169606logplain
-rwxr-xr-xlucida_sans_360.png162310logplain
-rwxr-xr-xlucida_sans_4.xml136910logplain
-rwxr-xr-xlucida_sans_40.png8487logplain
-rwxr-xr-xlucida_sans_48.xml171972logplain
-rwxr-xr-xlucida_sans_480.png231593logplain
-rwxr-xr-xlucida_sans_56.xml174174logplain
-rwxr-xr-xlucida_sans_560.png278999logplain
-rwxr-xr-xlucida_sans_6.xml140552logplain
-rwxr-xr-xlucida_sans_60.png15405logplain
-rwxr-xr-xlucida_sans_8.xml154564logplain
-rwxr-xr-xlucida_sans_80.png10040logplain
-rwxr-xr-xlucida_sans_9.xml154830logplain
-rwxr-xr-xlucida_sans_90.png10974logplain
-rwxr-xr-xmono_dejavu_sans_10.xml257014logplain
-rwxr-xr-xmono_dejavu_sans_100.png61308logplain
-rwxr-xr-xmono_dejavu_sans_11.xml263644logplain
-rwxr-xr-xmono_dejavu_sans_110.png74668logplain
-rwxr-xr-xmono_dejavu_sans_12.xml268932logplain
-rwxr-xr-xmono_dejavu_sans_120.png80486logplain
-rwxr-xr-xmono_dejavu_sans_14.xml269188logplain
-rwxr-xr-xmono_dejavu_sans_140.png98222logplain
-rwxr-xr-xmono_dejavu_sans_16.xml275642logplain
-rwxr-xr-xmono_dejavu_sans_160.png111526logplain
-rwxr-xr-xmono_dejavu_sans_18.xml279962logplain
-rwxr-xr-xmono_dejavu_sans_180.png134816logplain
-rwxr-xr-xmono_dejavu_sans_20.xml282588logplain
-rwxr-xr-xmono_dejavu_sans_200.png152413logplain
-rwxr-xr-xmono_dejavu_sans_22.xml283950logplain
-rwxr-xr-xmono_dejavu_sans_220.png168185logplain
-rwxr-xr-xmono_dejavu_sans_24.xml286626logplain
-rwxr-xr-xmono_dejavu_sans_240.png187484logplain
-rwxr-xr-xmono_dejavu_sans_26.xml289710logplain
-rwxr-xr-xmono_dejavu_sans_260.png210322logplain
-rwxr-xr-xmono_dejavu_sans_28.xml292596logplain
-rwxr-xr-xmono_dejavu_sans_280.png223051logplain
-rwxr-xr-xmono_dejavu_sans_4.xml237740logplain
-rwxr-xr-xmono_dejavu_sans_40.png17182logplain
-rwxr-xr-xmono_dejavu_sans_6.xml245472logplain
-rwxr-xr-xmono_dejavu_sans_60.png31749logplain
-rwxr-xr-xmono_dejavu_sans_8.xml251876logplain
-rwxr-xr-xmono_dejavu_sans_80.png49875logplain
-rwxr-xr-xmono_dejavu_sans_9.xml254016logplain
-rwxr-xr-xmono_dejavu_sans_90.png55338logplain
generated by cgit v1.2.3 (git 2.39.1) at 2025-02-07 07:58:40 +0000
hl opt">) { Instruction *jmp = &fs->f->code[pc]; int offset = dest-(pc+1); lua_assert(dest != NO_JUMP); if (abs(offset) > MAXARG_sBx) luaX_syntaxerror(fs->ls, "control structure too long"); SETARG_sBx(*jmp, offset); } /* ** returns current `pc' and marks it as a jump target (to avoid wrong ** optimizations with consecutive instructions not in the same basic block). */ int luaK_getlabel (FuncState *fs) { fs->lasttarget = fs->pc; return fs->pc; } static int getjump (FuncState *fs, int pc) { int offset = GETARG_sBx(fs->f->code[pc]); if (offset == NO_JUMP) /* point to itself represents end of list */ return NO_JUMP; /* end of list */ else return (pc+1)+offset; /* turn offset into absolute position */ } static Instruction *getjumpcontrol (FuncState *fs, int pc) { Instruction *pi = &fs->f->code[pc]; if (pc >= 1 && testTMode(GET_OPCODE(*(pi-1)))) return pi-1; else return pi; } /* ** check whether list has any jump that do not produce a value ** (or produce an inverted value) */ static int need_value (FuncState *fs, int list) { for (; list != NO_JUMP; list = getjump(fs, list)) { Instruction i = *getjumpcontrol(fs, list); if (GET_OPCODE(i) != OP_TESTSET) return 1; } return 0; /* not found */ } static int patchtestreg (FuncState *fs, int node, int reg) { Instruction *i = getjumpcontrol(fs, node); if (GET_OPCODE(*i) != OP_TESTSET) return 0; /* cannot patch other instructions */ if (reg != NO_REG && reg != GETARG_B(*i)) SETARG_A(*i, reg); else /* no register to put value or register already has the value */ *i = CREATE_ABC(OP_TEST, GETARG_B(*i), 0, GETARG_C(*i)); return 1; } static void removevalues (FuncState *fs, int list) { for (; list != NO_JUMP; list = getjump(fs, list)) patchtestreg(fs, list, NO_REG); } static void patchlistaux (FuncState *fs, int list, int vtarget, int reg, int dtarget) { while (list != NO_JUMP) { int next = getjump(fs, list); if (patchtestreg(fs, list, reg)) fixjump(fs, list, vtarget); else fixjump(fs, list, dtarget); /* jump to default target */ list = next; } } static void dischargejpc (FuncState *fs) { patchlistaux(fs, fs->jpc, fs->pc, NO_REG, fs->pc); fs->jpc = NO_JUMP; } void luaK_patchlist (FuncState *fs, int list, int target) { if (target == fs->pc) luaK_patchtohere(fs, list); else { lua_assert(target < fs->pc); patchlistaux(fs, list, target, NO_REG, target); } } void luaK_patchtohere (FuncState *fs, int list) { luaK_getlabel(fs); luaK_concat(fs, &fs->jpc, list); } void luaK_concat (FuncState *fs, int *l1, int l2) { if (l2 == NO_JUMP) return; else if (*l1 == NO_JUMP) *l1 = l2; else { int list = *l1; int next; while ((next = getjump(fs, list)) != NO_JUMP) /* find last element */ list = next; fixjump(fs, list, l2); } } void luaK_checkstack (FuncState *fs, int n) { int newstack = fs->freereg + n; if (newstack > fs->f->maxstacksize) { if (newstack >= MAXSTACK) luaX_syntaxerror(fs->ls, "function or expression too complex"); fs->f->maxstacksize = cast_byte(newstack); } } void luaK_reserveregs (FuncState *fs, int n) { luaK_checkstack(fs, n); fs->freereg += n; } static void freereg (FuncState *fs, int reg) { if (!ISK(reg) && reg >= fs->nactvar) { fs->freereg--; lua_assert(reg == fs->freereg); } } static void freeexp (FuncState *fs, expdesc *e) { if (e->k == VNONRELOC) freereg(fs, e->u.s.info); } static int addk (FuncState *fs, TValue *k, TValue *v) { lua_State *L = fs->L; TValue *idx = luaH_set(L, fs->h, k); Proto *f = fs->f; int oldsize = f->sizek; if (ttisnumber(idx)) { lua_assert(luaO_rawequalObj(&fs->f->k[cast_int(nvalue(idx))], v)); return cast_int(nvalue(idx)); } else { /* constant not found; create a new entry */ setnvalue(idx, cast_num(fs->nk)); luaM_growvector(L, f->k, fs->nk, f->sizek, TValue, MAXARG_Bx, "constant table overflow"); while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]); setobj(L, &f->k[fs->nk], v); luaC_barrier(L, f, v); return fs->nk++; } } int luaK_stringK (FuncState *fs, TString *s) { TValue o; setsvalue(fs->L, &o, s); return addk(fs, &o, &o); } int luaK_numberK (FuncState *fs, lua_Number r) { TValue o; setnvalue(&o, r); return addk(fs, &o, &o); } static int boolK (FuncState *fs, int b) { TValue o; setbvalue(&o, b); return addk(fs, &o, &o); } static int nilK (FuncState *fs) { TValue k, v; setnilvalue(&v); /* cannot use nil as key; instead use table itself to represent nil */ sethvalue(fs->L, &k, fs->h); return addk(fs, &k, &v); } void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) { if (e->k == VCALL) { /* expression is an open function call? */ SETARG_C(getcode(fs, e), nresults+1); } else if (e->k == VVARARG) { SETARG_B(getcode(fs, e), nresults+1); SETARG_A(getcode(fs, e), fs->freereg); luaK_reserveregs(fs, 1); } } void luaK_setoneret (FuncState *fs, expdesc *e) { if (e->k == VCALL) { /* expression is an open function call? */ e->k = VNONRELOC; e->u.s.info = GETARG_A(getcode(fs, e)); } else if (e->k == VVARARG) { SETARG_B(getcode(fs, e), 2); e->k = VRELOCABLE; /* can relocate its simple result */ } } void luaK_dischargevars (FuncState *fs, expdesc *e) { switch (e->k) { case VLOCAL: { e->k = VNONRELOC; break; } case VUPVAL: { e->u.s.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.s.info, 0); e->k = VRELOCABLE; break; } case VGLOBAL: { e->u.s.info = luaK_codeABx(fs, OP_GETGLOBAL, 0, e->u.s.info); e->k = VRELOCABLE; break; } case VINDEXED: { freereg(fs, e->u.s.aux); freereg(fs, e->u.s.info); e->u.s.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.s.info, e->u.s.aux); e->k = VRELOCABLE; break; } case VVARARG: case VCALL: { luaK_setoneret(fs, e); break; } default: break; /* there is one value available (somewhere) */ } } static int code_label (FuncState *fs, int A, int b, int jump) { luaK_getlabel(fs); /* those instructions may be jump targets */ return luaK_codeABC(fs, OP_LOADBOOL, A, b, jump); } static void discharge2reg (FuncState *fs, expdesc *e, int reg) { luaK_dischargevars(fs, e); switch (e->k) { case VNIL: { luaK_nil(fs, reg, 1); break; } case VFALSE: case VTRUE: { luaK_codeABC(fs, OP_LOADBOOL, reg, e->k == VTRUE, 0); break; } case VK: { luaK_codeABx(fs, OP_LOADK, reg, e->u.s.info); break; } case VKNUM: { luaK_codeABx(fs, OP_LOADK, reg, luaK_numberK(fs, e->u.nval)); break; } case VRELOCABLE: { Instruction *pc = &getcode(fs, e); SETARG_A(*pc, reg); break; } case VNONRELOC: { if (reg != e->u.s.info) luaK_codeABC(fs, OP_MOVE, reg, e->u.s.info, 0); break; } default: { lua_assert(e->k == VVOID || e->k == VJMP); return; /* nothing to do... */ } } e->u.s.info = reg; e->k = VNONRELOC; } static void discharge2anyreg (FuncState *fs, expdesc *e) { if (e->k != VNONRELOC) { luaK_reserveregs(fs, 1); discharge2reg(fs, e, fs->freereg-1); } } static void exp2reg (FuncState *fs, expdesc *e, int reg) { discharge2reg(fs, e, reg); if (e->k == VJMP) luaK_concat(fs, &e->t, e->u.s.info); /* put this jump in `t' list */ if (hasjumps(e)) { int final; /* position after whole expression */