Home
last modified time | relevance | path

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

12345678910>>...24

/f-stack/freebsd/crypto/des/
H A Ddes_enc.c82 l=data[1]; in des_encrypt1()
84 IP(r,l); in des_encrypt1()
94 l=ROTATE(l,29)&0xffffffffL; in des_encrypt1()
159 l=ROTATE(l,3)&0xffffffffL; in des_encrypt1()
162 FP(r,l); in des_encrypt1()
163 data[0]=l; in des_encrypt1()
190 l=ROTATE(l,29)&0xffffffffL; in des_encrypt2()
266 IP(l,r); in des_encrypt3()
274 FP(r,l); in des_encrypt3()
286 IP(l,r); in des_decrypt3()
[all …]
H A Ddes_locl.h69 #define c2l(c,l) (l =((DES_LONG)(*((c)++))) , \ argument
72 l|=((DES_LONG)(*((c)++)))<<24L)
90 #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ argument
99 #define n2l(c,l) (l =((DES_LONG)(*((c)++)))<<24L, \ argument
102 l|=((DES_LONG)(*((c)++))))
104 #define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \ argument
345 #define IP(l,r) \ argument
348 PERM_OP(r,l,tt, 4,0x0f0f0f0fL); \
349 PERM_OP(l,r,tt,16,0x0000ffffL); \
350 PERM_OP(r,l,tt, 2,0x33333333L); \
[all …]
/f-stack/app/redis-5.0.5/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 …]
/f-stack/app/redis-5.0.5/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 …]
/f-stack/freebsd/net/
H A Dmppcc.c62 *l = (*l) - n; in putbits8()
63 val <<= *l; in putbits8()
66 *l = 8; in putbits8()
72 *l = 8 - n + (*l); in putbits8()
86 *l = 8 - n + (*l); in putbits16()
97 *l = 16 - n + (*l); in putbits16()
112 *l = 16 - n + (*l); in putbits24()
124 *l = 24 - n + (*l); in putbits24()
188 l = 8; in MPPC_Compress()
282 if ((l != 0) && (l != 8)) { in MPPC_Compress()
[all …]
H A Dmppcd.c59 ol = *l; in getbits()
60 if (*l >= n) { in getbits()
61 *l = (*l) - n; in getbits()
63 if (*l == 0) { in getbits()
64 *l = 8; in getbits()
68 *l = 8 - n + (*l); in getbits()
79 if (l == 8) { in getbyte()
121 l = 8; in MPPC_Decompress()
180 val = getbyte(isrc, i, l); in MPPC_Decompress()
203 getbits(isrc, 2 , &i ,&l); in MPPC_Decompress()
[all …]
/f-stack/dpdk/app/test/
H A Dtest_lcores.c133 if (l->init > l->max) in limit_lcores_init()
153 memset(&l, 0, sizeof(l)); in test_lcores_callback()
177 memset(&l, 0, sizeof(l)); in test_lcores_callback()
252 l[0].init, l[1].init); in test_non_eal_lcores_callback()
255 if (l[0].uninit != 0 || l[1].uninit != 0) { in test_non_eal_lcores_callback()
257 l[0].uninit, l[1].uninit); in test_non_eal_lcores_callback()
275 l[0].init, l[1].init); in test_non_eal_lcores_callback()
280 l[0].uninit, l[1].uninit); in test_non_eal_lcores_callback()
298 l[0].init, l[1].init); in test_non_eal_lcores_callback()
303 l[0].uninit, l[1].uninit); in test_non_eal_lcores_callback()
[all …]
/f-stack/freebsd/contrib/openzfs/module/zfs/
H A Dzap_leaf.c48 #define LEAF_HASH(l, h) \ argument
51 (64 - ZAP_LEAF_HASH_SHIFT(l) - zap_leaf_phys(l)->l_hdr.lh_prefix_len)))
53 #define LEAF_HASH_ENTPTR(l, h) (&zap_leaf_phys(l)->l_hash[LEAF_HASH(l, h)]) argument
109 zap_leaf_t l; in zap_leaf_byteswap() local
114 l.l_dbuf = &l_dbuf; in zap_leaf_byteswap()
164 l->l_bs = highbit64(l->l_dbuf->db_size) - 1; in zap_leaf_init()
173 ZAP_LEAF_CHUNK(l, ZAP_LEAF_NUMCHUNKS(l)-1).l_free.lf_next = CHAIN_END; in zap_leaf_init()
176 zap_leaf_phys(l)->l_hdr.lh_nfree = ZAP_LEAF_NUMCHUNKS(l); in zap_leaf_init()
206 ASSERT3U(zap_leaf_phys(l)->l_hdr.lh_nfree, <, ZAP_LEAF_NUMCHUNKS(l)); in zap_leaf_chunk_free()
421 zeh->zeh_leaf = l; in zap_leaf_lookup()
[all …]
H A Dzap.c143 l->l_dbuf = db; in fzap_upgrade()
437 l->l_blkid << FZAP_BLOCK_SHIFT(zap), NULL, &l->l_dbuf, in zap_create_leaf()
447 return (l); in zap_create_leaf()
490 l = winner; in zap_open_leaf()
512 (uintptr_t)zap_leaf_phys(l), ==, l->l_dbuf->db_size); in zap_open_leaf()
514 return (l); in zap_open_leaf()
565 *lp = l; in zap_get_leaf_byblk()
670 *lp = l; in zap_expand_leaf()
710 *lp = l; in zap_expand_leaf()
856 err = zap_expand_leaf(zn, l, tag, tx, &l); in fzap_add_cd()
[all …]
/f-stack/freebsd/crypto/openssl/
H A Dossl_hash.h21 # define HOST_c2l(c,l) (l =(((unsigned long)(*((c)++)))<<24), \ argument
22 l|=(((unsigned long)(*((c)++)))<<16), \
25 # define HOST_l2c(l,c) (*((c)++)=(unsigned char)(((l)>>24)&0xff), \ argument
29 l)
33 # define HOST_c2l(c,l) (l =(((unsigned long)(*((c)++))) ), \ argument
37 # define HOST_l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ argument
41 l)
55 HASH_LONG l; in HASH_UPDATE() local
61 l = (c->Nl + (((HASH_LONG) len) << 3)) & 0xffffffffUL; in HASH_UPDATE()
62 if (l < c->Nl) /* overflow */ in HASH_UPDATE()
[all …]
/f-stack/app/redis-5.0.5/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 …]
/f-stack/app/redis-5.0.5/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
89 void listJoin(list *l, list *o);
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 …]
/f-stack/freebsd/kern/
H A Dsubr_lock.c420 if (l->file != match->file || l->line != match->line || in lock_prof_sum()
423 l->ticks = t; in lock_prof_sum()
576 if (l->lpo_obj == lo && l->lpo_file == file && in lock_profile_object_lookup()
578 return (l); in lock_profile_object_lookup()
592 return (l); in lock_profile_object_lookup()
620 if (l == NULL) in lock_profile_obtain_lock_success()
622 l->lpo_cnt++; in lock_profile_obtain_lock_success()
628 l->lpo_waittime = l->lpo_acqtime - waittime; in lock_profile_obtain_lock_success()
655 l->lpo_file, l->lpo_line); in lock_profile_thread_exit()
658 l->lpo_file, l->lpo_line); in lock_profile_thread_exit()
[all …]
/f-stack/freebsd/contrib/ipfilter/netinet/
H A Dip_lookup.c112 for (i = 0, l = backends; i < MAX_BACKENDS; i++, l++) {
353 for (i = 0, l = backends; i < MAX_BACKENDS; i++, l++) {
406 for (i = 0, l = backends; i < MAX_BACKENDS; i++, l++) {
455 for (i = 0, l = backends; i < MAX_BACKENDS; i++, l++) {
518 for (i = 0, l = backends; i < MAX_BACKENDS; i++, l++) {
566 for (i = 0, l = backends; i < MAX_BACKENDS; i++, l++) {
622 for (i = 0, l = backends; i < MAX_BACKENDS; i++, l++) {
935 for (i = 0, l = backends; i < MAX_BACKENDS; i++, l++)
968 for (i = 0, l = backends; i < MAX_BACKENDS; i++, l++)
986 for (i = 0, l = backends; i < MAX_BACKENDS; i++, l++)
[all …]
/f-stack/freebsd/contrib/openzfs/include/sys/
H A Dzap_leaf.h53 #define ZAP_LEAF_NUMCHUNKS(l) (ZAP_LEAF_NUMCHUNKS_BS(((l)->l_bs))) argument
84 #define ZAP_LEAF_HASH_SHIFT(l) (ZAP_LEAF_HASH_SHIFT_BS(((l)->l_bs))) argument
85 #define ZAP_LEAF_HASH_NUMENTRIES(l) (ZAP_LEAF_HASH_NUMENTRIES_BS(((l)->l_bs))) argument
92 #define ZAP_LEAF_CHUNK(l, idx) \ argument
94 (zap_leaf_phys(l)->l_hash + ZAP_LEAF_HASH_NUMENTRIES(l)))[idx]
95 #define ZAP_LEAF_ENTRY(l, idx) (&ZAP_LEAF_CHUNK(l, idx).l_entry) argument
171 zap_leaf_phys(zap_leaf_t *l) in zap_leaf_phys() argument
173 return (l->l_dbuf->db_data); in zap_leaf_phys()
193 extern int zap_leaf_lookup(zap_leaf_t *l,
200 extern int zap_leaf_lookup_closest(zap_leaf_t *l,
[all …]
/f-stack/freebsd/contrib/zstd/lib/common/
H A Dzstd_deps.h32 # define ZSTD_memcpy(d,s,l) __builtin_memcpy((d),(s),(l)) argument
33 # define ZSTD_memmove(d,s,l) __builtin_memmove((d),(s),(l)) argument
34 # define ZSTD_memset(p,v,l) __builtin_memset((p),(v),(l)) argument
36 # define ZSTD_memcpy(d,s,l) memcpy((d),(s),(l)) argument
37 # define ZSTD_memmove(d,s,l) memmove((d),(s),(l)) argument
38 # define ZSTD_memset(p,v,l) memset((p),(v),(l)) argument
/f-stack/dpdk/drivers/common/dpaax/
H A Ddpaa_list.h38 #define list_add(p, l) \ argument
41 struct list_head *__l298 = (l); \
47 #define list_add_tail(p, l) \ argument
50 struct list_head *__l298 = (l); \
56 #define list_for_each(i, l) \ argument
57 for (i = (l)->next; i != (l); i = i->next)
58 #define list_for_each_safe(i, j, l) \ argument
59 for (i = (l)->next, j = i->next; i != (l); \
61 #define list_for_each_entry(i, l, name) \ argument
62 for (i = list_entry((l)->next, typeof(*i), name); &i->name != (l); \
[all …]
/f-stack/freebsd/contrib/openzfs/module/lua/
H A Dlstrlib.c48 size_t l; in str_len() local
64 size_t l; in str_sub() local
69 if (end > l) end = l; in str_sub()
90 size_t l; in str_lower() local
103 size_t l; in str_upper() local
124 else if (l + lsep < l || l + lsep >= MAXSIZE / n) /* may overflow? */ in str_rep()
131 memcpy(p, s, l * sizeof(char)); p += l; in str_rep()
144 size_t l; in str_byte() local
150 if (pose > l) pose = l; in str_byte()
239 if (l < 0 || l >= ms->level || ms->capture[l].len == CAP_UNFINISHED) in check_capture()
[all …]
H A Dlfunc.c31 c->l.p = NULL; in luaF_newLclosure()
32 c->l.nupvalues = cast_byte(n); in luaF_newLclosure()
33 while (n--) c->l.upvals[n] = NULL; in luaF_newLclosure()
65 uv->u.l.prev = &g->uvhead; /* double link it in `uvhead' list */ in luaF_findupval()
66 uv->u.l.next = g->uvhead.u.l.next; in luaF_findupval()
67 uv->u.l.next->u.l.prev = uv; in luaF_findupval()
68 g->uvhead.u.l.next = uv; in luaF_findupval()
69 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); in luaF_findupval()
75 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); in unlinkupval()
76 uv->u.l.next->u.l.prev = uv->u.l.prev; /* remove from `uvhead' list */ in unlinkupval()
[all …]
H A Dlobject.c62 int l = 0; in luaO_ceillog2() local
64 while (x >= 256) { l += 8; x >>= 8; } in luaO_ceillog2()
65 return l + log_2[x]; in luaO_ceillog2()
205 pushstr(L, buff, l); in luaO_pushvfstring()
245 #define addstr(a,b,l) ( memcpy(a,b,(l) * sizeof(char)), a += (l) ) argument
248 size_t l = strlen(source); in luaO_chunkid() local
250 if (l <= bufflen) /* small enough? */ in luaO_chunkid()
258 if (l <= bufflen) /* small enough? */ in luaO_chunkid()
271 addstr(out, source, l); /* keep it */ in luaO_chunkid()
275 if (l > bufflen) l = bufflen; in luaO_chunkid()
[all …]
/f-stack/freebsd/sys/
H A Drwlock.h169 #define _rw_wlock(rw, f, l) \ argument
172 __rw_try_wlock(&(rw)->rw_lock, f, l)
173 #define _rw_wunlock(rw, f, l) \ argument
176 __rw_try_rlock(&(rw)->rw_lock, f, l)
178 #define _rw_rlock(rw, f, l) \ argument
179 __rw_rlock(&(rw)->rw_lock, f, l)
180 #define _rw_runlock(rw, f, l) \ argument
183 #define _rw_rlock(rw, f, l) \ argument
185 #define _rw_runlock(rw, f, l) \ argument
196 __rw_downgrade(&(rw)->rw_lock, f, l)
[all …]
/f-stack/freebsd/contrib/alpine-hal/
H A Dal_hal_plat_services.h215 #define al_reg_read32_relaxed(l) generic_bs_r_4(NULL, (bus_space_handle_t)l, 0) argument
229 #define al_reg_write32_relaxed(l,v) generic_bs_w_4(NULL, (bus_space_handle_t)l, 0, v) argument
236 #define al_reg_write8(l, v) do { \ argument
238 generic_bs_w_1(NULL, (bus_space_handle_t)l, 0, v); \
247 #define al_reg_write16(l, v) do { \ argument
249 generic_bs_w_2(NULL, (bus_space_handle_t)l, 0, v); \
258 #define al_reg_write32(l, v) do { \ argument
269 #define al_reg_write64(l, v) do { \ argument
276 al_reg_read8(uint8_t *l) in al_reg_read8() argument
284 al_reg_read16(uint16_t *l) in al_reg_read16() argument
[all …]
/f-stack/app/nginx-1.16.1/src/core/
H A Dngx_list.c31 ngx_list_push(ngx_list_t *l) in ngx_list_push() argument
36 last = l->last; in ngx_list_push()
38 if (last->nelts == l->nalloc) { in ngx_list_push()
42 last = ngx_palloc(l->pool, sizeof(ngx_list_part_t)); in ngx_list_push()
47 last->elts = ngx_palloc(l->pool, l->nalloc * l->size); in ngx_list_push()
55 l->last->next = last; in ngx_list_push()
56 l->last = last; in ngx_list_push()
59 elt = (char *) last->elts + l->size * last->nelts; in ngx_list_push()

12345678910>>...24