Home
last modified time | relevance | path

Searched refs:u (Results 1 – 25 of 38) sorted by relevance

12

/redis-3.2.3/deps/jemalloc/test/src/
H A DSFMT.c166 th = ((uint64_t)in->u[2] << 32) | ((uint64_t)in->u[3]); in rshift128()
251 r->u[0] = a->u[0] ^ x.u[0] ^ ((b->u[0] >> SR1) & MSK2) ^ y.u[0] in do_recursion()
253 r->u[1] = a->u[1] ^ x.u[1] ^ ((b->u[1] >> SR1) & MSK1) ^ y.u[1] in do_recursion()
255 r->u[2] = a->u[2] ^ x.u[2] ^ ((b->u[2] >> SR1) & MSK4) ^ y.u[2] in do_recursion()
257 r->u[3] = a->u[3] ^ x.u[3] ^ ((b->u[3] >> SR1) & MSK3) ^ y.u[3] in do_recursion()
268 r->u[0] = a->u[0] ^ x.u[0] ^ ((b->u[0] >> SR1) & MSK1) ^ y.u[0] in do_recursion()
270 r->u[1] = a->u[1] ^ x.u[1] ^ ((b->u[1] >> SR1) & MSK2) ^ y.u[1] in do_recursion()
272 r->u[2] = a->u[2] ^ x.u[2] ^ ((b->u[2] >> SR1) & MSK3) ^ y.u[2] in do_recursion()
274 r->u[3] = a->u[3] ^ x.u[3] ^ ((b->u[3] >> SR1) & MSK4) ^ y.u[3] in do_recursion()
353 array[i].u[0] = array[i].u[1]; in swap()
[all …]
/redis-3.2.3/deps/lua/src/
H A Dlfunc.c47 uv->v = &uv->u.value; in luaF_newupval()
59 lua_assert(p->v != &p->u.value); in luaF_findupval()
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()
85 uv->u.l.prev->u.l.next = uv->u.l.next; in unlinkupval()
90 if (uv->v != &uv->u.value) /* is it open? */ in luaF_freeupval()
[all …]
H A Dltablib.c194 while (l < u) { /* for tail recursion */ in auxsort()
198 lua_rawgeti(L, 1, u); in auxsort()
204 i = (l+u)/2; in auxsort()
211 lua_rawgeti(L, 1, u); in auxsort()
213 set2(L, i, u); in auxsort()
220 lua_rawgeti(L, 1, u-1); in auxsort()
221 set2(L, i, u-1); in auxsort()
223 i = l; j = u-1; in auxsort()
241 lua_rawgeti(L, 1, u-1); in auxsort()
246 if (i-l < u-i) { in auxsort()
[all …]
H A Dlcode.c311 e->u.s.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.s.info, 0); in luaK_dischargevars()
316 e->u.s.info = luaK_codeABx(fs, OP_GETGLOBAL, 0, e->u.s.info); in luaK_dischargevars()
323 e->u.s.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.s.info, e->u.s.aux); in luaK_dischargevars()
377 e->u.s.info = reg; in discharge2reg()
409 e->u.s.info = reg; in exp2reg()
491 luaK_codeABC(fs, OP_SETTABLE, var->u.s.info, var->u.s.aux, e); in luaK_storevar()
605 e->u.s.info = luaK_codeABC(fs, OP_NOT, 0, e->u.s.info, 0); in codenot()
630 v1 = e1->u.nval; in constfolding()
631 v2 = e2->u.nval; in constfolding()
648 e1->u.nval = r; in constfolding()
[all …]
H A Dlstring.c97 Udata *u; in luaS_newudata() local
100 u = cast(Udata *, luaM_malloc(L, s + sizeof(Udata))); in luaS_newudata()
101 u->uv.marked = luaC_white(G(L)); /* is not finalized */ in luaS_newudata()
102 u->uv.tt = LUA_TUSERDATA; in luaS_newudata()
103 u->uv.len = s; in luaS_newudata()
104 u->uv.metatable = NULL; in luaS_newudata()
105 u->uv.env = e; in luaS_newudata()
107 u->uv.next = G(L)->mainthread->next; in luaS_newudata()
108 G(L)->mainthread->next = obj2gco(u); in luaS_newudata()
109 return u; in luaS_newudata()
H A Dlmathlib.c191 int u = luaL_checkint(L, 1); in math_random() local
192 luaL_argcheck(L, 1<=u, 1, "interval is empty"); in math_random()
193 lua_pushnumber(L, floor(r*u)+1); /* int between 1 and `u' */ in math_random()
198 int u = luaL_checkint(L, 2); in math_random() local
199 luaL_argcheck(L, l<=u, 2, "interval is empty"); in math_random()
200 lua_pushnumber(L, floor(r*(u-l+1))+l); /* int between `l' and `u' */ in math_random()
H A Dlgc.c43 #define isfinalized(u) testbit((u)->marked, FINALIZEDBIT) argument
44 #define markfinalized(u) l_setbit((u)->marked, FINALIZEDBIT) argument
86 if (uv->v == &uv->u.value) /* closed? */ in reallymarkobject()
116 GCObject *u = g->tmudata; in marktmu() local
117 if (u) { in marktmu()
119 u = u->gch.next; in marktmu()
120 makewhite(g, u); /* may be marked, if left from previous GC */ in marktmu()
121 reallymarkobject(g, u); in marktmu()
122 } while (u != g->tmudata); in marktmu()
517 for (uv = g->uvhead.u.l.next; uv != &g->uvhead; uv = uv->u.l.next) { in remarkupvals()
[all …]
H A Dlstring.h18 #define sizeudata(u) (sizeof(union Udata)+(u)->len) argument
H A Dlparser.c129 e->u.s.info = i; in init_exp()
188 if (fs->upvalues[i].k == v->k && fs->upvalues[i].info == v->u.s.info) { in indexupvalue()
202 fs->upvalues[f->nups].info = cast_byte(v->u.s.info); in indexupvalue()
240 var->u.s.info = indexupvalue(fs, n, var); /* else was LOCAL or UPVAL */ in singlevaraux()
469 luaK_setlist(fs, cc->t->u.s.info, cc->na, cc->tostore); /* flush */ in closelistfield()
479 luaK_setlist(fs, cc->t->u.s.info, cc->na, LUA_MULTRET); in lastlistfield()
485 luaK_setlist(fs, cc->t->u.s.info, cc->na, cc->tostore); in lastlistfield()
643 base = f->u.s.info; /* base register for call */ in funcargs()
733 v->u.nval = ls->t.seminfo.r; in simpleexp()
914 if (lh->v.u.s.info == v->u.s.info) { /* conflict? */ in check_conflict()
[all …]
H A Dluaconf.h572 { volatile union luai_Cast u; u.l_d = (d) + 6755399441055744.0; (i) = u.l_l; }
595 #define LUAI_USER_ALIGNMENT_T union { double u; void *s; long l; }
H A Dlstate.h139 union Udata u; member
151 #define rawgco2u(o) check_exp((o)->gch.tt == LUA_TUSERDATA, &((o)->u))
H A Dluac.c147 static int writer(lua_State* L, const void* p, size_t size, void* u) in writer() argument
150 return (fwrite(p,size,1,(FILE*)u)!=1) && (size!=0); in writer()
H A Dlopcodes.h85 #define SETARG_A(i,u) ((i) = (((i)&MASK0(SIZE_A,POS_A)) | \ argument
86 ((cast(Instruction, u)<<POS_A)&MASK1(SIZE_A,POS_A))))
H A Dlparser.h42 } u; member
H A Dldo.h44 LUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u,
H A Dlstate.c160 g->uvhead.u.l.prev = &g->uvhead; in lua_newstate()
161 g->uvhead.u.l.next = &g->uvhead; in lua_newstate()
/redis-3.2.3/src/
H A Dsort.c144 if (so1->u.score > so2->u.score) { in sortCompare()
146 } else if (so1->u.score < so2->u.score) { in sortCompare()
157 if (!so1->u.cmpobj || !so2->u.cmpobj) { in sortCompare()
159 if (so1->u.cmpobj == so2->u.cmpobj) in sortCompare()
168 cmp = compareStringObjects(so1->u.cmpobj,so2->u.cmpobj); in sortCompare()
172 cmp = strcoll(so1->u.cmpobj->ptr,so2->u.cmpobj->ptr); in sortCompare()
362 vector[j].u.score = 0; in sortCommand()
376 vector[j].u.score = 0; in sortCommand()
386 vector[j].u.score = 0; in sortCommand()
422 vector[j].u.score = 0; in sortCommand()
[all …]
H A Dutil.c181 const char *u; in memtoll() local
190 u = p; in memtoll()
191 if (*u == '-') u++; in memtoll()
192 while(*u && isdigit(*u)) u++; in memtoll()
193 if (*u == '\0' || !strcasecmp(u,"b")) { in memtoll()
195 } else if (!strcasecmp(u,"k")) { in memtoll()
197 } else if (!strcasecmp(u,"kb")) { in memtoll()
199 } else if (!strcasecmp(u,"m")) { in memtoll()
201 } else if (!strcasecmp(u,"mb")) { in memtoll()
203 } else if (!strcasecmp(u,"g")) { in memtoll()
[all …]
H A Dgeo.c128 char *u = unit->ptr; in extractUnitOrReply() local
130 if (!strcmp(u, "m")) { in extractUnitOrReply()
132 } else if (!strcmp(u, "km")) { in extractUnitOrReply()
134 } else if (!strcmp(u, "ft")) { in extractUnitOrReply()
136 } else if (!strcmp(u, "mi")) { in extractUnitOrReply()
/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
12 while i<=u do
23 qsort(x,m+1,u,f)
/redis-3.2.3/deps/geohash-int/
H A Dgeohash_helper.c211 double lat1r, lon1r, lat2r, lon2r, u, v; in geohashGetDistance() local
216 u = sin((lat2r - lat1r) / 2); in geohashGetDistance()
219 asin(sqrt(u * u + cos(lat1r) * cos(lat2r) * v * v)); in geohashGetDistance()
/redis-3.2.3/deps/jemalloc/test/unit/
H A Datomic.c104 TEST_STRUCT(u, unsigned) in TEST_STRUCT() argument
108 TEST_BODY(u, unsigned, unsigned, u, "#x"); in TEST_STRUCT()
/redis-3.2.3/deps/jemalloc/src/
H A Dckh.c556 } u; in ckh_pointer_hash() local
558 assert(sizeof(u.v) == sizeof(u.i)); in ckh_pointer_hash()
559 u.v = key; in ckh_pointer_hash()
560 hash(&u.i, sizeof(u.i), 0xd983396eU, r_hash); in ckh_pointer_hash()
/redis-3.2.3/tests/unit/
H A Dsort.tcl210 r sadd myset a b c d e f g h i l m n o p q r s t u v z aa aaa azz
213 } {a aa aaa azz b c d e f g h i l m n o p q r s t u v z}
234 r sadd myset a b c d e f g h i l m n o p q r s t u v z aa aaa azz
235 foreach ele {a aa aaa azz b c d e f g h i l m n o p q r s t u v z} {
239 } {a aa aaa azz b c d e f g h i l m n o p q r s t u v z}
H A Dgeo.tcl11 set u [expr {sin(($lat2r - $lat1r) / 2)}]
13 asin(sqrt($u * $u + cos($lat1r) * cos($lat2r) * $v * $v))}

12