Home
last modified time | relevance | path

Searched refs:l (Results 1 – 25 of 86) sorted by relevance

1234

/redis-3.2.3/deps/linenoise/
H A Dlinenoise.c620 l->oldpos = l->pos; in refreshMultiLine()
653 memmove(l->buf+l->pos+1,l->buf+l->pos,l->len-l->pos); in linenoiseEditInsert()
717 l->len = l->pos = strlen(l->buf); in linenoiseEditHistoryNext()
725 if (l->len > 0 && l->pos < l->len) { in linenoiseEditDelete()
726 memmove(l->buf+l->pos,l->buf+l->pos+1,l->len-l->pos-1); in linenoiseEditDelete()
736 memmove(l->buf+l->pos-1,l->buf+l->pos,l->len-l->pos); in linenoiseEditBackspace()
750 while (l->pos > 0 && l->buf[l->pos-1] == ' ') in linenoiseEditDeletePrevWord()
752 while (l->pos > 0 && l->buf[l->pos-1] != ' ') in linenoiseEditDeletePrevWord()
755 memmove(l->buf+l->pos,l->buf+old_pos,l->len-old_pos+1); in linenoiseEditDeletePrevWord()
846 if (l.pos > 0 && l.pos < l.len) { in linenoiseEdit()
[all …]
/redis-3.2.3/deps/lua/src/
H A Dlua_cjson.c210 luaL_argcheck(l, lua_gettop(l) <= args, args + 1, in json_arg_init()
381 lua_newtable(l); in json_create_config()
454 lua_typename(l, lua_type(l, lindex)), reason); in json_encode_exception()
502 lua_pushnil(l); in lua_array_length()
626 lua_pushnil(l); in json_append_object()
711 luaL_argcheck(l, lua_gettop(l) == 1, 1, "expected 1 argument"); in json_encode()
1143 lua_newtable(l); in json_parse_object_context()
1195 lua_newtable(l); in json_parse_array_context()
1259 luaL_argcheck(l, lua_gettop(l) == 1, 1, "expected 1 argument"); in json_decode()
1323 luaL_argcheck(l, lua_gettop(l) == 1, 1, "expected 1 argument"); in json_protect_conversion()
[all …]
H A Dlfunc.c36 c->l.isC = 0; in luaF_newLclosure()
37 c->l.env = e; in luaF_newLclosure()
38 c->l.nupvalues = cast_byte(nelems); in luaF_newLclosure()
39 while (nelems--) c->l.upvals[nelems] = NULL; in luaF_newLclosure()
74 uv->u.l.next = g->uvhead.u.l.next; in luaF_findupval()
75 uv->u.l.next->u.l.prev = uv; in luaF_findupval()
76 g->uvhead.u.l.next = uv; in luaF_findupval()
77 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); in luaF_findupval()
83 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); in unlinkupval()
84 uv->u.l.next->u.l.prev = uv->u.l.prev; /* remove from `uvhead' list */ in unlinkupval()
[all …]
H A Dlstrlib.c29 size_t l; in str_len() local
44 size_t l; in str_sub() local
49 if (end > (ptrdiff_t)l) end = (ptrdiff_t)l; in str_sub()
58 size_t l; in str_reverse() local
62 while (l--) luaL_addchar(&b, s[l]); in str_reverse()
69 size_t l; in str_lower() local
82 size_t l; in str_upper() local
94 size_t l; in str_rep() local
113 if ((size_t)pose > l) pose = l; in str_byte()
188 if (l < 0 || l >= ms->level || ms->capture[l].len == CAP_UNFINISHED) in check_capture()
[all …]
H A Dlstring.c50 static TString *newlstr (lua_State *L, const char *str, size_t l, in newlstr() argument
54 if (l+1 > (MAX_SIZET - sizeof(TString))/sizeof(char)) in newlstr()
56 ts = cast(TString *, luaM_malloc(L, (l+1)*sizeof(char)+sizeof(TString))); in newlstr()
57 ts->tsv.len = l; in newlstr()
62 memcpy(ts+1, str, l*sizeof(char)); in newlstr()
63 ((char *)(ts+1))[l] = '\0'; /* ending 0 */ in newlstr()
75 TString *luaS_newlstr (lua_State *L, const char *str, size_t l) { in luaS_newlstr() argument
77 unsigned int h = cast(unsigned int, l); /* seed */ in luaS_newlstr()
80 for (l1=l; l1>=step; l1-=step) /* compute hash */ in luaS_newlstr()
86 if (ts->tsv.len == l && (memcmp(str, getstr(ts), l) == 0)) { in luaS_newlstr()
[all …]
H A Dltablib.c194 while (l < u) { /* for tail recursion */ in auxsort()
197 lua_rawgeti(L, 1, l); in auxsort()
200 set2(L, l, u); /* swap a[l] - a[u] */ in auxsort()
203 if (u-l == 1) break; /* only 2 elements */ in auxsort()
204 i = (l+u)/2; in auxsort()
206 lua_rawgeti(L, 1, l); in auxsort()
208 set2(L, i, l); in auxsort()
217 if (u-l == 2) break; /* only 3 elements */ in auxsort()
223 i = l; j = u-1; in auxsort()
246 if (i-l < u-i) { in auxsort()
[all …]
H A Dlua_struct.c246 size_t l; in b_pack() local
248 if (size == 0) size = l; in b_pack()
268 Uinttype l = 0; in getinteger() local
272 l <<= 8; in getinteger()
273 l |= (Uinttype)(unsigned char)buff[i]; in getinteger()
278 l <<= 8; in getinteger()
279 l |= (Uinttype)(unsigned char)buff[i]; in getinteger()
283 return (lua_Number)l; in getinteger()
286 if (l & mask) /* negative value? */ in getinteger()
287 l |= mask; /* signal extension */ in getinteger()
[all …]
H A Dlvm.c204 const char *l = getstr(ls); in l_strcmp() local
209 int temp = strcoll(l, r); in l_strcmp()
227 if (ttype(l) != ttype(r)) in luaV_lessthan()
229 else if (ttisnumber(l)) in luaV_lessthan()
231 else if (ttisstring(l)) in luaV_lessthan()
241 if (ttype(l) != ttype(r)) in lessequal()
243 else if (ttisnumber(l)) in lessequal()
245 else if (ttisstring(l)) in lessequal()
300 tl += l; in luaV_concat()
307 tl += l; in luaV_concat()
[all …]
H A Dlua_cmsgpack.c694 size_t l = c->p[1]; in mp_decode_to_lua_type() local
695 mp_cur_need(c,2+l); in mp_decode_to_lua_type()
697 mp_cur_consume(c,2+l); in mp_decode_to_lua_type()
704 mp_cur_need(c,3+l); in mp_decode_to_lua_type()
706 mp_cur_consume(c,3+l); in mp_decode_to_lua_type()
717 mp_cur_need(c,l); in mp_decode_to_lua_type()
719 mp_cur_consume(c,l); in mp_decode_to_lua_type()
769 mp_cur_need(c,1+l); in mp_decode_to_lua_type()
771 mp_cur_consume(c,1+l); in mp_decode_to_lua_type()
773 size_t l = c->p[0] & 0xf; in mp_decode_to_lua_type() local
[all …]
H A Dlauxlib.c231 luaI_openlib(L, libname, l, 0);
235 static int libsize (const luaL_Reg *l) { in libsize() argument
237 for (; l->name; l++) size++; in libsize()
245 int size = libsize(l); in luaI_openlib()
260 for (; l->name; l++) { in luaI_openlib()
264 lua_pushcclosure(L, l->func, nup); in luaI_openlib()
265 lua_setfield(L, -(nup+2), l->name); in luaI_openlib()
343 size_t l = strlen(p); in luaL_gsub() local
399 size_t l = bufflen(B); in emptybuffer() local
418 toplen += l; in adjuststack()
[all …]
H A Dlobject.c65 int l = -1; in luaO_log2() local
66 while (x >= 256) { l += 8; x >>= 8; } in luaO_log2()
67 return l + log_2[x]; in luaO_log2()
189 size_t l; in luaO_chunkid() local
192 l = strlen(source); in luaO_chunkid()
194 if (l > bufflen) { in luaO_chunkid()
195 source += (l-bufflen); /* get last part of file name */ in luaO_chunkid()
H A Dlstate.c28 #define fromstate(l) (cast(lu_byte *, (l)) - LUAI_EXTRASPACE) argument
29 #define tostate(l) (cast(lua_State *, cast(lu_byte *, l) + LUAI_EXTRASPACE)) argument
36 lua_State l; member
147 void *l = (*f)(ud, NULL, 0, state_size(LG)); in lua_newstate() local
148 if (l == NULL) return NULL; in lua_newstate()
149 L = tostate(l); in lua_newstate()
160 g->uvhead.u.l.prev = &g->uvhead; in lua_newstate()
161 g->uvhead.u.l.next = &g->uvhead; in lua_newstate()
H A Dlgc.c233 lua_assert(cl->l.nupvalues == cl->l.p->nups); in traverseclosure()
259 markvalue(g, gt(l)); in traversestack()
260 lim = l->top; in traversestack()
261 for (ci = l->base_ci; ci <= l->ci; ci++) { in traversestack()
265 for (o = l->stack; o < l->top; o++) in traversestack()
269 checkstacksizes(l, lim); in traversestack()
352 while (l) { in cleartable()
353 Table *h = gco2h(l); in cleartable()
373 l = h->gclist; in cleartable()
517 for (uv = g->uvhead.u.l.next; uv != &g->uvhead; uv = uv->u.l.next) { in remarkupvals()
[all …]
H A Dliolib.c298 size_t l; in read_line() local
304 l = strlen(p); in read_line()
305 if (l == 0 || p[l-1] != '\n') in read_line()
306 luaL_addsize(&b, l); in read_line()
308 luaL_addsize(&b, l - 1); /* do not include `eol' */ in read_line()
348 size_t l = (size_t)lua_tointeger(L, n); in g_read() local
349 success = (l == 0) ? test_eof(L, f) : read_chars(L, f, l); in g_read()
423 size_t l; in g_write() local
424 const char *s = luaL_checklstring(L, arg, &l); in g_write()
425 status = status && (fwrite(s, sizeof(char), l, f) == l); in g_write()
/redis-3.2.3/tests/unit/type/
H A Dlist-3.tcl9 r del l
64 r del l
65 set l {}
88 assert_equal [llength $l] [r llen l]
91 if {[lindex $l $i] ne [r lindex l $i]} {
92 assert_equal [lindex $l $i] [r lindex l $i]
100 r del l
109 set l [concat [list $rv] $l]
113 assert_equal [llength $l] [r llen l]
115 if {[lindex $l $i] ne [r lindex l $i]} {
[all …]
/redis-3.2.3/src/
H A Dadlist.h57 #define listLength(l) ((l)->len) argument
58 #define listFirst(l) ((l)->head) argument
59 #define listLast(l) ((l)->tail) argument
64 #define listSetDupMethod(l,m) ((l)->dup = (m)) argument
65 #define listSetFreeMethod(l,m) ((l)->free = (m)) argument
66 #define listSetMatchMethod(l,m) ((l)->match = (m)) argument
68 #define listGetDupMethod(l) ((l)->dup) argument
69 #define listGetFree(l) ((l)->free) argument
70 #define listGetMatchMethod(l) ((l)->match) argument
H A Dzipmap.c157 p += llen+l; in zipmapLookupRaw()
169 unsigned int l; in zipmapRequiredLength() local
171 l = klen+vlen+3; in zipmapRequiredLength()
174 return l; in zipmapRequiredLength()
180 return zipmapEncodeLength(NULL,l) + l; in zipmapRawKeyLength()
199 return l + zipmapRawValueLength(p+l); in zipmapRawEntryLength()
375 unsigned int l; in zipmapRepr() local
388 if (l != 0 && fwrite(p,l,1,stdout) == 0) perror("fwrite"); in zipmapRepr()
389 p += l; in zipmapRepr()
395 if (l != 0 && fwrite(p,l,1,stdout) == 0) perror("fwrite"); in zipmapRepr()
[all …]
H A Dsds.c432 size_t l; in sdsll2str() local
445 l = p-s; in sdsll2str()
457 return l; in sdsll2str()
463 size_t l; in sdsull2str() local
474 l = p-s; in sdsull2str()
486 return l; in sdsull2str()
590 size_t l; in sdscatfmt() local
613 i += l; in sdscatfmt()
629 i += l; in sdscatfmt()
646 i += l; in sdscatfmt()
[all …]
H A Dmemtest.c93 int memtest_addressing(unsigned long *l, size_t bytes, int interactive) { in memtest_addressing() argument
98 p = l; in memtest_addressing()
106 p = l; in memtest_addressing()
138 void memtest_fill_random(unsigned long *l, size_t bytes, int interactive) { in memtest_fill_random() argument
148 l1 = l+off; in memtest_fill_random()
163 void memtest_fill_value(unsigned long *l, size_t bytes, unsigned long v1, in memtest_fill_value() argument
173 l1 = l+off; in memtest_fill_value()
194 int memtest_compare(unsigned long *l, size_t bytes, int interactive) { in memtest_compare() argument
199 l1 = l; in memtest_compare()
H A Dsha1.c36 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
37 |(rol(block->l[i],8)&0x00FF00FF))
39 #define blk0(i) block->l[i]
43 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
44 ^block->l[(i+2)&15]^block->l[i&15],1))
61 uint32_t l[16]; in SHA1Transform() member
/redis-3.2.3/deps/lua/test/
H A Dsort.lua5 function qsort(x,l,u,f)
6 if l<u then
7 local m=math.random(u-(l-1))+l-1 -- choose a random pivot in range l..u
8 x[l],x[m]=x[m],x[l] -- swap pivot to first position
9 local t=x[l] -- pivot value
10 m=l
11 local i=l+1
20 x[l],x[m]=x[m],x[l] -- swap pivot to a valid place
22 qsort(x,l,m-1,f)
H A Dtable.lua6 local l=io.read()
7 if l==nil then break end
8 local _,_,a,b=string.find(l,'"?([_%w]+)"?%s*(.*)$')
H A Dglobals.lua8 local ok,_,l,op,g=string.find(s,"%[%-?(%d*)%]%s*([GS])ETGLOBAL.-;%s+(.*)$")
11 io.write(g,"\t",l,op,"\n")
/redis-3.2.3/deps/hiredis/
H A Dsds.c432 size_t l; in sdsll2str() local
445 l = p-s; in sdsll2str()
457 return l; in sdsll2str()
463 size_t l; in sdsull2str() local
474 l = p-s; in sdsull2str()
486 return l; in sdsull2str()
590 size_t l; in sdscatfmt() local
613 i += l; in sdscatfmt()
629 i += l; in sdscatfmt()
646 i += l; in sdscatfmt()
[all …]
/redis-3.2.3/tests/cluster/
H A Dcluster.tcl11 foreach l $lines {
12 set l [string trim $l]
13 if {$l eq {}} continue
14 set args [split $l]

1234