LEN
#define PREP_BUF(BUF, LEN) \
(BUF)->len = (LEN); \
EXP_TID_SET(LEN, npages);
EXP_TID_SET(LEN, npages);
tlen = EXP_TID_GET(flow->tid_entry[i], LEN);
u32 tidlen = EXP_TID_GET(tidentry, LEN) << PAGE_SHIFT;
tidlen = EXP_TID_GET(tidentry, LEN) * PAGE_SIZE;
EXP_TID_GET(flow->tid_entry[tididx], LEN) * PAGE_SIZE) {
if (!EXP_TID_GET(flow->tid_entry[i], LEN)) {
tidlen += EXP_TID_GET(flow->tid_entry[i], LEN);
u32 tidlen = EXP_TID_GET(tidentry, LEN) << PAGE_SHIFT;
return EXP_TID_GET(ent, LEN);
if ((req->tidoffset) == (EXP_TID_GET(tidval, LEN) *
omfactor = ((EXP_TID_GET(tidval, LEN) *
u32 tidlen = EXP_TID_GET(req->tids[req->tididx], LEN) *
LEN) * PAGE_SIZE;
tidlen = EXP_TID_GET(tidval, LEN) * PAGE_SIZE,
if ((req->tidoffset) == (EXP_TID_GET(tidval, LEN) *
omfactor = EXP_TID_GET(tidval, LEN) * PAGE_SIZE >=
val = LEN;
ret = tw9910_mask_set(client, OPFORM, LEN, val);
val = HINIC_AEQ_CTRL_1_CLEAR(val, LEN) &
ctrl1 = HINIC_AEQ_CTRL_1_SET(eq->q_len, LEN) |
val = HINIC_CEQ_CTRL_1_CLEAR(val, LEN) &
ctrl1 = HINIC_CEQ_CTRL_1_SET(eq->q_len, LEN) |
HINIC_SQ_CTRL_SET(ctrl_size, LEN);
sge->len = HINIC_RQ_CQE_SGE_GET(len, LEN);
HINIC_RQ_CTRL_SET(SIZE_8BYTES(sizeof(*ctrl)), LEN) |
ctrl1 = AEQ_CTRL_1_SET(eq->eq_len, LEN) |
ctrl1 = CEQ_CTRL_1_SET(eq->eq_len, LEN);
pkt_len = RQ_CQE_SGE_GET(vlan_len, LEN);
rc = ef100_pci_get_config_bits(efx, vndr_cap, LEN, &vsec_len);
#define XT_PUTENTRY(XAD, FLAG, OFF, LEN, ADDR)\
XADlength((XAD), (LEN));\
#define BPF_ENDIAN(TYPE, DST, LEN) \
.imm = LEN })
#define BPF_BSWAP(DST, LEN) \
.imm = LEN })
state->mode = LEN; /* decode codes */
state->mode = LEN;
case LEN:
if (state->length == 0) state->mode = LEN;
state->mode = LEN;
#define UNPACK_ARRAY(TABLE, BLOB, LEN, TTYPE, BTYPE, NTOHX) \
typeof(LEN) __i; \
memcpy(__t, __b, (LEN) * sizeof(BTYPE)); \
for (__i = 0; __i < LEN; __i++) { \
#define BPF_ENDIAN(TYPE, DST, LEN) \
.imm = LEN })
for (p = mem; p - mem < LEN; p+=16) {
munmap(mem, LEN);
fast += LEN(regions[i]);
slow += LEN(regions[i]);
ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)mem && LEN(vec[0]) == vec_size &&
ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)mem && LEN(vec[0]) == vec_size &&
ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)mem && LEN(vec[0]) == vec_size &&
ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)mem && LEN(vec[0]) == vec_size &&
LEN(vec[0]) == nr_pages &&
LEN(vec[0]) == (buf_size/page_size) &&
ksft_test_result(ret == 1 && LEN(vec) == 2, "%s Both pages written\n", __func__);
ksft_test_result(ret == 1 && LEN(vec) == 2,
ksft_test_result(ret == 1 && LEN(vec) == 2,
for (j = 0; j < LEN(rgns[i]); ++j)
ksft_test_result(ret == 1 && LEN(vec) == (mem_size / page_size),
ksft_test_result(ret == 1 && LEN(vec) == (hpage_size / page_size),
sum += LEN(vec[i]);
ksft_test_result(ret == 1 && LEN(vec[0]) == 2 &&
ret2 == 2 && LEN(vec2[0]) == 1 && vec2[0].start == (uintptr_t)mem &&
LEN(vec2[1]) == vec_size - 3 &&
ksft_test_result(ret == 1 && LEN(vec[0]) == mem_size/page_size,
ksft_test_result(written == 1 && LEN(vec[0]) == mem_size/page_size,
ksft_test_result(written == 1 && LEN(vec[0]) >= vec_size - 2 && LEN(vec[0]) <= vec_size,
ksft_test_result(written == 1 && LEN(vec[0]) >= 1,
&& LEN(vec[0]) == 2,
LEN(vec[0]) == vec_size && vec[0].categories == PAGE_IS_WRITTEN,
ksft_test_result(ret == 1 && LEN(vec[0]) > 0,
ksft_test_result(ret == 1 && LEN(vec[0]) == vec_size/2 &&
ksft_test_result(ret == 1 && LEN(vec[0]) == vec_size/2 &&
ksft_test_result(ret == 1 && LEN(vec[0]) == vec_size/2,
ksft_test_result(ret == 1 && LEN(vec[0]) == hpage_size/(2*page_size),
ksft_test_result(ret2 == 1 && LEN(vec[0]) == (map_size - hpage_size/2)/page_size,
if (sendto(s1, buf, LEN, 0, (struct sockaddr *)&sa2, sizeof(sa2)) != LEN)
if (recvfrom(s2, buf, LEN, 0, (struct sockaddr *)&peer, &plen) < 0)
if (sendto(s2, buf, LEN, 0, (struct sockaddr *)&sa1, sizeof(sa1)) != LEN)
if (recvfrom(s1, buf, LEN, 0, (struct sockaddr *)&peer, &plen) < 0)
char buf[LEN];