common/lib/libc/gen/radixtree.c

1003

void **results, unsigned int maxresults, bool dense, unsigned int tagmask)

common/lib/libc/gen/radixtree.c

1009

return gang_lookup_scan(t, &path, results, maxresults, tagmask, true,

common/lib/libc/gen/radixtree.c

1191

void *results[3];

common/lib/libc/gen/radixtree.c

1197

assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 0);

common/lib/libc/gen/radixtree.c

1198

assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 0);

common/lib/libc/gen/radixtree.c

1199

assert(radix_tree_gang_lookup_node(t, 1000, results, 3, false) == 0);

common/lib/libc/gen/radixtree.c

1200

assert(radix_tree_gang_lookup_node(t, 1000, results, 3, true) == 0);

common/lib/libc/gen/radixtree.c

1201

assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, false) ==

common/lib/libc/gen/radixtree.c

1203

assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, true) ==

common/lib/libc/gen/radixtree.c

1205

assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, false)

common/lib/libc/gen/radixtree.c

1207

assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, true)

common/lib/libc/gen/radixtree.c

1209

assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, false, 1)

common/lib/libc/gen/radixtree.c

1211

assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, true, 1)

common/lib/libc/gen/radixtree.c

1213

assert(radix_tree_gang_lookup_tagged_node(t, 1000, results, 3, false, 1)

common/lib/libc/gen/radixtree.c

1215

assert(radix_tree_gang_lookup_tagged_node(t, 1000, results, 3, true, 1)

common/lib/libc/gen/radixtree.c

1217

assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3,

common/lib/libc/gen/radixtree.c

1219

assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3,

common/lib/libc/gen/radixtree.c

1221

assert(radix_tree_gang_lookup_tagged_node_reverse(t, 1000, results, 3,

common/lib/libc/gen/radixtree.c

1223

assert(radix_tree_gang_lookup_tagged_node_reverse(t, 1000, results, 3,

common/lib/libc/gen/radixtree.c

1234

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1235

assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 1);

common/lib/libc/gen/radixtree.c

1236

assert(results[0] == (void *)0xdeadbea0);

common/lib/libc/gen/radixtree.c

1237

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1238

assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 1);

common/lib/libc/gen/radixtree.c

1239

assert(results[0] == (void *)0xdeadbea0);

common/lib/libc/gen/radixtree.c

1240

assert(radix_tree_gang_lookup_node(t, 1000, results, 3, false) == 0);

common/lib/libc/gen/radixtree.c

1241

assert(radix_tree_gang_lookup_node(t, 1000, results, 3, true) == 0);

common/lib/libc/gen/radixtree.c

1242

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1243

assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, false) ==

common/lib/libc/gen/radixtree.c

1245

assert(results[0] == (void *)0xdeadbea0);

common/lib/libc/gen/radixtree.c

1246

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1247

assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, true) ==

common/lib/libc/gen/radixtree.c

1249

assert(results[0] == (void *)0xdeadbea0);

common/lib/libc/gen/radixtree.c

1250

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1251

assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, false)

common/lib/libc/gen/radixtree.c

1253

assert(results[0] == (void *)0xdeadbea0);

common/lib/libc/gen/radixtree.c

1254

assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, true)

common/lib/libc/gen/radixtree.c

1256

assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, false, 1)

common/lib/libc/gen/radixtree.c

1258

assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, true, 1)

common/lib/libc/gen/radixtree.c

1260

assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3,

common/lib/libc/gen/radixtree.c

1262

assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3,

common/lib/libc/gen/radixtree.c

1270

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1271

assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 1);

common/lib/libc/gen/radixtree.c

1272

assert(results[0] == (void *)0xdeadbea0);

common/lib/libc/gen/radixtree.c

1273

assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 0);

common/lib/libc/gen/radixtree.c

1274

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1275

assert(radix_tree_gang_lookup_node(t, 1000, results, 3, false) == 1);

common/lib/libc/gen/radixtree.c

1276

assert(results[0] == (void *)0xdeadbea0);

common/lib/libc/gen/radixtree.c

1277

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1278

assert(radix_tree_gang_lookup_node(t, 1000, results, 3, true) == 1);

common/lib/libc/gen/radixtree.c

1279

assert(results[0] == (void *)0xdeadbea0);

common/lib/libc/gen/radixtree.c

1280

assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, false)

common/lib/libc/gen/radixtree.c

1282

assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, true)

common/lib/libc/gen/radixtree.c

1284

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1285

assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, false)

common/lib/libc/gen/radixtree.c

1287

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1288

assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, true)

common/lib/libc/gen/radixtree.c

1290

assert(results[0] == (void *)0xdeadbea0);

common/lib/libc/gen/radixtree.c

1291

assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, false, 1)

common/lib/libc/gen/radixtree.c

1293

assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, true, 1)

common/lib/libc/gen/radixtree.c

1295

assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3,

common/lib/libc/gen/radixtree.c

1297

assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3,

common/lib/libc/gen/radixtree.c

1345

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1346

assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 3);

common/lib/libc/gen/radixtree.c

1347

assert(results[0] == (void *)0xbea0);

common/lib/libc/gen/radixtree.c

1348

assert(results[1] == (void *)0x12345678);

common/lib/libc/gen/radixtree.c

1349

assert(results[2] == (void *)0xdea0);

common/lib/libc/gen/radixtree.c

1350

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1351

assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 1);

common/lib/libc/gen/radixtree.c

1352

assert(results[0] == (void *)0xbea0);

common/lib/libc/gen/radixtree.c

1353

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1354

assert(radix_tree_gang_lookup_node(t, 1, results, 3, false) == 2);

common/lib/libc/gen/radixtree.c

1355

assert(results[0] == (void *)0x12345678);

common/lib/libc/gen/radixtree.c

1356

assert(results[1] == (void *)0xdea0);

common/lib/libc/gen/radixtree.c

1357

assert(radix_tree_gang_lookup_node(t, 1, results, 3, true) == 0);

common/lib/libc/gen/radixtree.c

1358

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1359

assert(radix_tree_gang_lookup_node(t, 1001, results, 3, false) == 1);

common/lib/libc/gen/radixtree.c

1360

assert(results[0] == (void *)0xdea0);

common/lib/libc/gen/radixtree.c

1361

assert(radix_tree_gang_lookup_node(t, 1001, results, 3, true) == 0);

common/lib/libc/gen/radixtree.c

1362

assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000001), results, 3,

common/lib/libc/gen/radixtree.c

1364

assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000001), results, 3,

common/lib/libc/gen/radixtree.c

1366

assert(radix_tree_gang_lookup_node(t, UINT64_C(1000000000000), results,

common/lib/libc/gen/radixtree.c

1368

assert(radix_tree_gang_lookup_node(t, UINT64_C(1000000000000), results,

common/lib/libc/gen/radixtree.c

1370

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1371

assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 100, false, 2)

common/lib/libc/gen/radixtree.c

1373

assert(results[0] == (void *)0x12345678);

common/lib/libc/gen/radixtree.c

1374

assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 100, true, 2)

common/lib/libc/gen/radixtree.c

1382

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1383

assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000000), results, 3,

common/lib/libc/gen/radixtree.c

1385

assert(results[0] == (void *)0xdea0);

common/lib/libc/gen/radixtree.c

1386

assert(results[1] == (void *)0xfff0);

common/lib/libc/gen/radixtree.c

1387

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1388

assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000000), results, 3,

common/lib/libc/gen/radixtree.c

1390

assert(results[0] == (void *)0xdea0);

common/lib/libc/gen/radixtree.c

1391

assert(results[1] == (void *)0xfff0);

common/lib/libc/gen/radixtree.c

1392

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1394

results, 3, false) == 3);

common/lib/libc/gen/radixtree.c

1395

assert(results[0] == (void *)0xfff0);

common/lib/libc/gen/radixtree.c

1396

assert(results[1] == (void *)0xdea0);

common/lib/libc/gen/radixtree.c

1397

assert(results[2] == (void *)0xbea0);

common/lib/libc/gen/radixtree.c

1398

memset(results, 0, sizeof(results));

common/lib/libc/gen/radixtree.c

1400

results, 3, true) == 2);

common/lib/libc/gen/radixtree.c

1401

assert(results[0] == (void *)0xfff0);

common/lib/libc/gen/radixtree.c

1402

assert(results[1] == (void *)0xdea0);

common/lib/libc/gen/radixtree.c

1576

struct testnode *results[TEST2_GANG_LOOKUP_NODES];

common/lib/libc/gen/radixtree.c

1584

(void *)results, __arraycount(results), false)) > 0) {

common/lib/libc/gen/radixtree.c

1585

nextidx = results[nfound - 1]->idx + 1;

common/lib/libc/gen/radixtree.c

1598

struct testnode *results[TEST2_GANG_LOOKUP_NODES];

common/lib/libc/gen/radixtree.c

1606

(void *)results, __arraycount(results), false)) > 0) {

common/lib/libc/gen/radixtree.c

1607

nextidx = results[nfound - 1]->idx - 1;

common/lib/libc/gen/radixtree.c

1623

struct testnode *results[TEST2_GANG_LOOKUP_NODES];

common/lib/libc/gen/radixtree.c

1629

nextidx, (void *)results, __arraycount(results),

common/lib/libc/gen/radixtree.c

1631

nextidx = results[nfound - 1]->idx + 1;

common/lib/libc/gen/radixtree.c

1646

struct testnode *results[TEST2_GANG_LOOKUP_NODES];

common/lib/libc/gen/radixtree.c

1653

nextidx, (void *)results, __arraycount(results),

common/lib/libc/gen/radixtree.c

1655

nextidx = results[nfound - 1]->idx - 1;

common/lib/libc/gen/radixtree.c

1677

struct testnode *results[TEST2_GANG_LOOKUP_NODES];

common/lib/libc/gen/radixtree.c

1683

nextidx, (void *)results, __arraycount(results),

common/lib/libc/gen/radixtree.c

1687

results[i]->idx);

common/lib/libc/gen/radixtree.c

1689

nextidx = results[nfound - 1]->idx + 1;

common/lib/libc/gen/radixtree.c

1709

struct testnode *results[TEST2_GANG_LOOKUP_NODES];

common/lib/libc/gen/radixtree.c

1717

(void *)results, __arraycount(results), false)) > 0) {

common/lib/libc/gen/radixtree.c

1719

assert(results[i] == radix_tree_remove_node(t,

common/lib/libc/gen/radixtree.c

1720

results[i]->idx));

common/lib/libc/gen/radixtree.c

1722

nextidx = results[nfound - 1]->idx + 1;

common/lib/libc/gen/radixtree.c

807

void **results, const unsigned int maxresults, const unsigned int tagmask,

common/lib/libc/gen/radixtree.c

858

results[nfound] = entry_ptr(*vpp);

common/lib/libc/gen/radixtree.c

948

void **results, unsigned int maxresults, bool dense)

common/lib/libc/gen/radixtree.c

953

return gang_lookup_scan(t, &path, results, maxresults, 0, false, dense);

common/lib/libc/gen/radixtree.c

965

void **results, unsigned int maxresults, bool dense)

common/lib/libc/gen/radixtree.c

970

return gang_lookup_scan(t, &path, results, maxresults, 0, true, dense);

common/lib/libc/gen/radixtree.c

984

void **results, unsigned int maxresults, bool dense, unsigned int tagmask)

common/lib/libc/gen/radixtree.c

990

return gang_lookup_scan(t, &path, results, maxresults, tagmask, false,

games/boggle/boggle/bog.c

414

results();

games/boggle/boggle/extern.h

56

void results(void);

games/phantasia/misc.c

467

static const char *const results[] =/* description table */

games/phantasia/misc.c

518

strcpy(Databuf, results[type]);

games/phantasia/misc.c

522

return (results[type]);

lib/libc/rpc/clnt_bcast.c

404

bres.results.results_val = resultsp;

lib/libc/rpc/rpcb_clnt.c

1095

r.results.results_val = resp;

lib/libc/rpc/rpcb_prot.c

336

if (!xdr_u_int(xdrs, &objp->results.results_len)) {

lib/libc/rpc/rpcb_prot.c

339

dummy = (*(objp->xdr_res))(xdrs, objp->results.results_val);

lib/libskey/skeysubr.c

111

u_int32_t results[4];

lib/libskey/skeysubr.c

119

MD4Final((unsigned char *) (void *) results, &md);

lib/libskey/skeysubr.c

123

results[0] ^= results[2];

lib/libskey/skeysubr.c

124

results[1] ^= results[3];

lib/libskey/skeysubr.c

126

(void)memcpy(result, results, SKEY_BINKEY_SIZE);

lib/libskey/skeysubr.c

137

u_int32_t results[4];

lib/libskey/skeysubr.c

146

MD5Final((unsigned char *) (void *)results, &md);

lib/libskey/skeysubr.c

150

results[0] ^= results[2];

lib/libskey/skeysubr.c

151

results[1] ^= results[3];

lib/libskey/skeysubr.c

153

(void)memcpy((void *)result, (void *)results, SKEY_BINKEY_SIZE);

lib/libskey/skeysubr.c

204

u_int32_t results[5];

lib/libskey/skeysubr.c

213

RMD160Final((unsigned char *)(void *)results, &rmd);

lib/libskey/skeysubr.c

217

results[0] ^= results[2];

lib/libskey/skeysubr.c

218

results[1] ^= results[3];

lib/libskey/skeysubr.c

219

results[0] ^= results[4];

lib/libskey/skeysubr.c

221

(void)memcpy((void *)result, (void *)results, SKEY_BINKEY_SIZE);

lib/libskey/skeysubr.c

236

u_int32_t results[4];

lib/libskey/skeysubr.c

240

MD4Final((unsigned char *) (void *) results, &md);

lib/libskey/skeysubr.c

243

results[0] ^= results[2];

lib/libskey/skeysubr.c

244

results[1] ^= results[3];

lib/libskey/skeysubr.c

246

(void)memcpy(x, results, SKEY_BINKEY_SIZE);

lib/libskey/skeysubr.c

252

u_int32_t results[4];

lib/libskey/skeysubr.c

256

MD5Final((unsigned char *) (void *)results, &md);

lib/libskey/skeysubr.c

259

results[0] ^= results[2];

lib/libskey/skeysubr.c

260

results[1] ^= results[3];

lib/libskey/skeysubr.c

262

(void)memcpy((void *)x, (void *)results, SKEY_BINKEY_SIZE);

lib/libskey/skeysubr.c

291

u_int32_t results[5];

lib/libskey/skeysubr.c

295

RMD160Final((unsigned char *)(void *)results, &rmd);

lib/libskey/skeysubr.c

298

results[0] ^= results[2];

lib/libskey/skeysubr.c

299

results[1] ^= results[3];

lib/libskey/skeysubr.c

300

results[0] ^= results[4];

lib/libskey/skeysubr.c

302

(void)memcpy((void *)x, (void *)results, SKEY_BINKEY_SIZE);

sys/dev/ic/malo.c

1929

} results[] = {

sys/dev/ic/malo.c

1938

for (i = 0; i < sizeof(results) / sizeof(results[0]); i++)

sys/dev/ic/malo.c

1939

if (le16toh(result) == results[i].result_code)

sys/dev/ic/malo.c

1940

return (results[i].result_string);

sys/dev/pci/if_iwmreg.h

5646

struct iwm_scan_results_notif results[IWM_MAX_NUM_SCAN_CHANNELS];

sys/dev/pci/if_iwmreg.h

5861

struct iwm_scan_results_notif results[];

sys/dev/pci/if_iwmreg.h

6323

struct iwm_scan_results_notif results[];

sys/dev/raidframe/rf_dag.h

114

void **results; /* array of results produced by *funcPtr */

sys/dev/raidframe/rf_dagdegrd.c

1171

recoveryNode->results[0] = failedPDA;

sys/dev/raidframe/rf_dagdegrd.c

1173

recoveryNode->results[1] = failedPDAtwo;

sys/dev/raidframe/rf_dagdegrd.c

485

xorNode->results[0] = failedPDA->bufPtr;

sys/dev/raidframe/rf_dagdegwr.c

394

xorNode->results[1] = BUF_ALLOC(failedPDA->numSector);

sys/dev/raidframe/rf_dagdegwr.c

395

wnqNode->params[1].p = xorNode->results[1];

sys/dev/raidframe/rf_dagdegwr.c

419

xorNode->results[0] = xorTargetBuf;

sys/dev/raidframe/rf_dagdegwr.c

851

recoveryNode->results[0] = pda;

sys/dev/raidframe/rf_dagdegwr.c

853

recoveryNode->results[1] = pda;

sys/dev/raidframe/rf_dagdegwr.c

856

recoveryNode->results[2] = pda;

sys/dev/raidframe/rf_dagdegwr.c

858

recoveryNode->results[3] = pda;

sys/dev/raidframe/rf_dagffwr.c

357

xorNode->results[0] = rf_AllocBuffer(raidPtr, dag_h, rf_RaidAddressToByte(raidPtr, raidPtr->Layout.sectorsPerStripeUnit));

sys/dev/raidframe/rf_dagffwr.c

365

xorNode->results[0] = tmpNode->params[1].p;

sys/dev/raidframe/rf_dagffwr.c

373

wnpNode->params[1].p = xorNode->results[0];

sys/dev/raidframe/rf_dagffwr.c

387

xorNode->results[1] =

sys/dev/raidframe/rf_dagffwr.c

393

wnqNode->params[1].p = xorNode->results[1];

sys/dev/raidframe/rf_dagffwr.c

843

tmpxorNode->results[0] = tmpreadParityNode->params[1].p;

sys/dev/raidframe/rf_dagffwr.c

859

tmpqNode->results[0] = tmpreadQNode->params[1].p;

sys/dev/raidframe/rf_dagffwr.c

899

xorNodes->results[0] = readParityNodes->params[1].p;

sys/dev/raidframe/rf_dagffwr.c

930

qNodes->results[0] = readQNodes->params[1].p;

sys/dev/raidframe/rf_dagffwr.c

947

tmpwriteParityNode->params[1].p = tmpxorNode->results[0]; /* buffer pointer for

sys/dev/raidframe/rf_dagffwr.c

972

tmpwriteQNode->params[1].p = tmpqNode->results[0]; /* buffer pointer for

sys/dev/raidframe/rf_dagfuncs.c

424

if (node->params[i + 1].p != node->results[0]) {

sys/dev/raidframe/rf_dagfuncs.c

426

(char *) node->params[i + 1].p, (char *) node->results[0]);

sys/dev/raidframe/rf_dagfuncs.c

455

if (node->params[i + 1].p != node->results[0]) {

sys/dev/raidframe/rf_dagfuncs.c

456

retcode = rf_bxor((char *) node->params[i + 1].p, (char *) node->results[0],

sys/dev/raidframe/rf_dagfuncs.c

496

if (node->params[i + 1].p != node->results[0]) {

sys/dev/raidframe/rf_dagfuncs.c

500

destbuf = ((char *) node->results[0]) + rf_RaidAddressToByte(raidPtr, suoffset - failedSUOffset);

sys/dev/raidframe/rf_dagutils.c

153

node->results = (nResult) ? (void **) (ptrs + nSucc + nAnte) : NULL;

sys/dev/raidframe/rf_dagutils.c

520

printf("result buf 0x%lx\n", (long) node->results[0]);

sys/dev/raidframe/rf_evenodd_dagfuncs.c

130

if (node->params[i + 1].p != node->results[0]) { /* results[0] is buf ptr

sys/dev/raidframe/rf_evenodd_dagfuncs.c

136

destbuf = ((char *) node->results[0]) + rf_RaidAddressToByte(raidPtr, suoffset);

sys/dev/raidframe/rf_evenodd_dagfuncs.c

225

rf_RegularESubroutine(node, node->results[0]);

sys/dev/raidframe/rf_evenodd_dagfuncs.c

280

rf_DegrESubroutine(node, node->results[1]);

sys/dev/raidframe/rf_evenodd_dagfuncs.c

401

memset(node->results[0], 0,

sys/dev/raidframe/rf_evenodd_dagfuncs.c

406

if (node->params[i + 1].p != node->results[0]) {

sys/dev/raidframe/rf_evenodd_dagfuncs.c

415

destbuf = ((char *) node->results[0]) + rf_RaidAddressToByte(raidPtr, suoffset - failedSUOffset);

sys/dev/raidframe/rf_evenodd_dagfuncs.c

431

rf_DegrESubroutine(node, node->results[0]);

sys/dev/raidframe/rf_evenodd_dagfuncs.c

693

pda = node->results[0];

sys/dev/raidframe/rf_evenodd_dagfuncs.c

719

pda0 = node->results[0];

sys/dev/raidframe/rf_evenodd_dagfuncs.c

72

rf_RegularESubroutine(node, node->results[1]);

sys/dev/raidframe/rf_evenodd_dagfuncs.c

721

pda1 = node->results[1];

sys/dev/raidframe/rf_evenodd_dagfuncs.c

769

dest[0] = (char *)((RF_PhysDiskAddr_t *) node->results[0])->bufPtr + rf_RaidAddressToByte(raidPtr, sector - fsuoff[0]);

sys/dev/raidframe/rf_evenodd_dagfuncs.c

775

dest[0] = (char *)((RF_PhysDiskAddr_t *) node->results[0])->bufPtr + rf_RaidAddressToByte(raidPtr, sector - fsuoff[0]);

sys/dev/raidframe/rf_evenodd_dagfuncs.c

781

dest[1] = (char *)((RF_PhysDiskAddr_t *) node->results[1])->bufPtr + rf_RaidAddressToByte(raidPtr, sector - fsuoff[1]);

sys/dev/raidframe/rf_evenodd_dagfuncs.c

853

ppda = node->results[0];/* Instead of being buffers, node->results[0]

sys/dev/raidframe/rf_evenodd_dagfuncs.c

855

epda = node->results[1];

sys/dev/raidframe/rf_parityloggingdags.c

188

xorNode->results[0] = RF_MallocAndAdd(rf_RaidAddressToByte(

sys/dev/raidframe/rf_parityloggingdags.c

191

xorNode->results[0] = rodNodes[i].params[1].p;

sys/dev/raidframe/rf_parityloggingdags.c

198

lpoNode->params[1].p = xorNode->results[0];

sys/dev/raidframe/rf_parityloggingdags.c

476

xorNodes[i].results[0] = readParityNodes[i].params[1].p; /* use old parity buf as

sys/dev/raidframe/rf_parityloggingdags.c

495

xorNodes[0].results[0] = readParityNodes[0].params[1].p;

sys/dev/raidframe/rf_parityloggingdags.c

504

lpuNodes[i].params[1].p = xorNodes[i].results[0]; /* buffer pointer to

sys/dev/raidframe/rf_pq.c

403

char *qbuf = node->results[1];

sys/dev/raidframe/rf_pq.c

457

RegularQSubr(node, node->results[1]);

sys/dev/raidframe/rf_pq.c

465

RegularQSubr(node, node->results[0]);

sys/dev/raidframe/rf_pq.c

546

memcpy(node->results[0], node->params[node->numParams - 3].p,

sys/dev/raidframe/rf_pq.c

549

RF_ASSERT(node->params[i + 1].p != node->results[0]);

sys/dev/raidframe/rf_pq.c

553

destbuf = ((char *) node->results[0]) + rf_RaidAddressToByte(raidPtr, suoffset - failedSUOffset);

sys/dev/raidframe/rf_pq.c

561

rf_InvertQ(node->results[0], node->results[0], rf_RaidAddressToByte(raidPtr, pda->numSector), coeff);

sys/dev/raidframe/rf_pq.c

599

char *qbuf = node->results[0];

sys/dev/raidframe/rf_pqdegdags.c

315

ppda = node->results[0];

sys/dev/raidframe/rf_pqdegdags.c

316

qpda = node->results[1];

sys/lib/libunwind/DwarfParser.hpp

286

pint_t upToPC, PrologInfo *results,

sys/lib/libunwind/DwarfParser.hpp

289

memset(results, 0, sizeof(*results));

sys/lib/libunwind/DwarfParser.hpp

295

(pint_t)(-1), rememberStack, results, ctx))

sys/lib/libunwind/DwarfParser.hpp

299

upToPC - fdeInfo.pcStart, rememberStack, results,

sys/lib/libunwind/DwarfParser.hpp

310

PrologInfo *results, unw_proc_info_t *ctx) {

sys/lib/libunwind/DwarfParser.hpp

313

PrologInfo initialState = *results;

sys/lib/libunwind/DwarfParser.hpp

350

results->savedRegisters[reg].location = kRegisterInCFA;

sys/lib/libunwind/DwarfParser.hpp

351

results->savedRegisters[reg].value = offset;

sys/lib/libunwind/DwarfParser.hpp

357

results->savedRegisters[reg] = initialState.savedRegisters[reg];

sys/lib/libunwind/DwarfParser.hpp

363

results->savedRegisters[reg].location = kRegisterUnused;

sys/lib/libunwind/DwarfParser.hpp

372

results->savedRegisters[reg].location = kRegisterUnused;

sys/lib/libunwind/DwarfParser.hpp

381

results->savedRegisters[reg].location = kRegisterInRegister;

sys/lib/libunwind/DwarfParser.hpp

382

results->savedRegisters[reg].value = reg2;

sys/lib/libunwind/DwarfParser.hpp

391

entry->info = *results;

sys/lib/libunwind/DwarfParser.hpp

399

*results = top->info;

sys/lib/libunwind/DwarfParser.hpp

409

results->cfaRegister = reg;

sys/lib/libunwind/DwarfParser.hpp

410

results->cfaRegisterOffset = offset;

sys/lib/libunwind/DwarfParser.hpp

416

results->cfaRegister = reg;

sys/lib/libunwind/DwarfParser.hpp

419

results->cfaRegisterOffset = addressSpace.getULEB128(p, instructionsEnd);

sys/lib/libunwind/DwarfParser.hpp

420

results->codeOffsetAtStackDecrement = codeOffset;

sys/lib/libunwind/DwarfParser.hpp

423

results->cfaRegister = 0;

sys/lib/libunwind/DwarfParser.hpp

424

results->cfaExpression = p;

sys/lib/libunwind/DwarfParser.hpp

432

results->savedRegisters[reg].location = kRegisterAtExpression;

sys/lib/libunwind/DwarfParser.hpp

433

results->savedRegisters[reg].value = p;

sys/lib/libunwind/DwarfParser.hpp

443

results->savedRegisters[reg].location = kRegisterInCFA;

sys/lib/libunwind/DwarfParser.hpp

444

results->savedRegisters[reg].value = offset;

sys/lib/libunwind/DwarfParser.hpp

452

results->cfaRegister = reg;

sys/lib/libunwind/DwarfParser.hpp

453

results->cfaRegisterOffset = offset;

sys/lib/libunwind/DwarfParser.hpp

456

results->cfaRegisterOffset =

sys/lib/libunwind/DwarfParser.hpp

458

results->codeOffsetAtStackDecrement = codeOffset;

sys/lib/libunwind/DwarfParser.hpp

466

results->savedRegisters[reg].location = kRegisterOffsetFromCFA;

sys/lib/libunwind/DwarfParser.hpp

467

results->savedRegisters[reg].value = offset;

sys/lib/libunwind/DwarfParser.hpp

475

results->savedRegisters[reg].location = kRegisterOffsetFromCFA;

sys/lib/libunwind/DwarfParser.hpp

476

results->savedRegisters[reg].value = offset;

sys/lib/libunwind/DwarfParser.hpp

482

results->savedRegisters[reg].location = kRegisterIsExpression;

sys/lib/libunwind/DwarfParser.hpp

483

results->savedRegisters[reg].value = p;

sys/lib/libunwind/DwarfParser.hpp

490

results->savedRegisters[reg].location = kRegisterInRegister;

sys/lib/libunwind/DwarfParser.hpp

491

results->savedRegisters[reg].value = reg + 16;

sys/lib/libunwind/DwarfParser.hpp

494

results->savedRegisters[reg].location = kRegisterInCFA;

sys/lib/libunwind/DwarfParser.hpp

495

results->savedRegisters[reg].value = (reg - 16) * sizeof(typename R::reg_t);

sys/lib/libunwind/DwarfParser.hpp

503

results->spExtraArgSize = offset;

sys/lib/libunwind/DwarfParser.hpp

511

results->savedRegisters[reg].location = kRegisterInCFA;

sys/lib/libunwind/DwarfParser.hpp

512

results->savedRegisters[reg].value = -offset;

sys/lib/libunwind/DwarfParser.hpp

523

results->savedRegisters[reg].location = kRegisterInCFA;

sys/lib/libunwind/DwarfParser.hpp

524

results->savedRegisters[reg].value = offset;

sys/lib/libunwind/DwarfParser.hpp

533

results->savedRegisters[reg] = initialState.savedRegisters[reg];

sys/opencrypto/cryptodev.c

494

error = copyin(crypt_ret->results, crypt_res, len);

sys/opencrypto/cryptodev.c

508

error = copyout(crypt_res, crypt_ret->results, len);

sys/opencrypto/cryptodev.h

324

struct crypt_result * results; /* where to put them */

sys/ufs/ext2fs/ext2fs_lookup.c

307

struct ufs_lookup_results *results;

sys/ufs/ext2fs/ext2fs_lookup.c

346

results = &dp->i_crap;

sys/ufs/ext2fs/ext2fs_lookup.c

375

if (nameiop != LOOKUP || results->ulr_diroff == 0 ||

sys/ufs/ext2fs/ext2fs_lookup.c

376

results->ulr_diroff >= ext2fs_size(dp)) {

sys/ufs/ext2fs/ext2fs_lookup.c

378

results->ulr_offset = 0;

sys/ufs/ext2fs/ext2fs_lookup.c

381

results->ulr_offset = results->ulr_diroff;

sys/ufs/ext2fs/ext2fs_lookup.c

382

if ((entryoffsetinblock = results->ulr_offset & bmask) &&

sys/ufs/ext2fs/ext2fs_lookup.c

383

(error = ext2fs_blkatoff(vdp, (off_t)results->ulr_offset, NULL, &bp)))

sys/ufs/ext2fs/ext2fs_lookup.c

388

prevoff = results->ulr_offset;

sys/ufs/ext2fs/ext2fs_lookup.c

424

while (results->ulr_offset < endsearch) {

sys/ufs/ext2fs/ext2fs_lookup.c

430

if ((results->ulr_offset & bmask) == 0) {

sys/ufs/ext2fs/ext2fs_lookup.c

433

error = ext2fs_blkatoff(vdp, (off_t)results->ulr_offset,

sys/ufs/ext2fs/ext2fs_lookup.c

463

ufs_dirbad(dp, results->ulr_offset, "mangled entry");

sys/ufs/ext2fs/ext2fs_lookup.c

465

results->ulr_offset += i;

sys/ufs/ext2fs/ext2fs_lookup.c

484

slotoffset = results->ulr_offset;

sys/ufs/ext2fs/ext2fs_lookup.c

489

slotoffset = results->ulr_offset;

sys/ufs/ext2fs/ext2fs_lookup.c

492

slotsize = results->ulr_offset +

sys/ufs/ext2fs/ext2fs_lookup.c

514

results->ulr_reclen = fs2h16(ep->e2d_reclen);

sys/ufs/ext2fs/ext2fs_lookup.c

518

prevoff = results->ulr_offset;

sys/ufs/ext2fs/ext2fs_lookup.c

519

results->ulr_offset += fs2h16(ep->e2d_reclen);

sys/ufs/ext2fs/ext2fs_lookup.c

522

enduseful = results->ulr_offset;

sys/ufs/ext2fs/ext2fs_lookup.c

531

results->ulr_offset = 0;

sys/ufs/ext2fs/ext2fs_lookup.c

532

endsearch = results->ulr_diroff;

sys/ufs/ext2fs/ext2fs_lookup.c

561

results->ulr_offset = roundup(ext2fs_size(dp), dirblksiz);

sys/ufs/ext2fs/ext2fs_lookup.c

562

results->ulr_count = 0;

sys/ufs/ext2fs/ext2fs_lookup.c

563

enduseful = results->ulr_offset;

sys/ufs/ext2fs/ext2fs_lookup.c

565

results->ulr_offset = slotoffset;

sys/ufs/ext2fs/ext2fs_lookup.c

566

results->ulr_count = slotsize;

sys/ufs/ext2fs/ext2fs_lookup.c

570

results->ulr_endoff = roundup(enduseful, dirblksiz);

sys/ufs/ext2fs/ext2fs_lookup.c

603

if (results->ulr_offset + EXT2FS_DIRSIZ(ep->e2d_namlen) > ext2fs_size(dp)) {

sys/ufs/ext2fs/ext2fs_lookup.c

604

ufs_dirbad(dp, results->ulr_offset, "i_size too small");

sys/ufs/ext2fs/ext2fs_lookup.c

606

results->ulr_offset + EXT2FS_DIRSIZ(ep->e2d_namlen));

sys/ufs/ext2fs/ext2fs_lookup.c

622

results->ulr_diroff = results->ulr_offset &~ (dirblksiz - 1);

sys/ufs/ext2fs/ext2fs_lookup.c

636

if ((results->ulr_offset & (dirblksiz - 1)) == 0)

sys/ufs/ext2fs/ext2fs_lookup.c

637

results->ulr_count = 0;

sys/ufs/ext2fs/ext2fs_lookup.c

639

results->ulr_count = results->ulr_offset - prevoff;

sys/ufs/lfs/ulfs_lookup.c

154

struct ulfs_lookup_results *results;

sys/ufs/lfs/ulfs_lookup.c

198

results = &dp->i_crap;

sys/ufs/lfs/ulfs_lookup.c

265

&results->ulr_offset, &bp, nameiop == DELETE ? &prevoff : NULL)) {

sys/ufs/lfs/ulfs_lookup.c

268

(results->ulr_offset & bmask));

sys/ufs/lfs/ulfs_lookup.c

271

results->ulr_offset = roundup(dp->i_size, dirblksiz);

sys/ufs/lfs/ulfs_lookup.c

280

if (nameiop != LOOKUP || results->ulr_diroff == 0 ||

sys/ufs/lfs/ulfs_lookup.c

281

results->ulr_diroff >= dp->i_size) {

sys/ufs/lfs/ulfs_lookup.c

283

results->ulr_offset = 0;

sys/ufs/lfs/ulfs_lookup.c

286

results->ulr_offset = results->ulr_diroff;

sys/ufs/lfs/ulfs_lookup.c

287

if ((entryoffsetinblock = results->ulr_offset & bmask) &&

sys/ufs/lfs/ulfs_lookup.c

288

(error = ulfs_blkatoff(vdp, (off_t)results->ulr_offset,

sys/ufs/lfs/ulfs_lookup.c

294

prevoff = results->ulr_offset;

sys/ufs/lfs/ulfs_lookup.c

299

while (results->ulr_offset < endsearch) {

sys/ufs/lfs/ulfs_lookup.c

305

if ((results->ulr_offset & bmask) == 0) {

sys/ufs/lfs/ulfs_lookup.c

308

error = ulfs_blkatoff(vdp, (off_t)results->ulr_offset,

sys/ufs/lfs/ulfs_lookup.c

336

ulfs_dirbad(dp, results->ulr_offset, "mangled entry");

sys/ufs/lfs/ulfs_lookup.c

338

results->ulr_offset += i;

sys/ufs/lfs/ulfs_lookup.c

357

slotoffset = results->ulr_offset;

sys/ufs/lfs/ulfs_lookup.c

362

slotoffset = results->ulr_offset;

sys/ufs/lfs/ulfs_lookup.c

365

slotsize = results->ulr_offset +

sys/ufs/lfs/ulfs_lookup.c

392

slotoffset = results->ulr_offset;

sys/ufs/lfs/ulfs_lookup.c

394

results->ulr_reclen = slotsize;

sys/ufs/lfs/ulfs_lookup.c

418

results->ulr_reclen = lfs_dir_getreclen(fs, ep);

sys/ufs/lfs/ulfs_lookup.c

422

prevoff = results->ulr_offset;

sys/ufs/lfs/ulfs_lookup.c

423

results->ulr_offset += lfs_dir_getreclen(fs, ep);

sys/ufs/lfs/ulfs_lookup.c

426

enduseful = results->ulr_offset;

sys/ufs/lfs/ulfs_lookup.c

435

results->ulr_offset = 0;

sys/ufs/lfs/ulfs_lookup.c

436

endsearch = results->ulr_diroff;

sys/ufs/lfs/ulfs_lookup.c

468

results->ulr_offset = roundup(dp->i_size, dirblksiz);

sys/ufs/lfs/ulfs_lookup.c

469

results->ulr_count = 0;

sys/ufs/lfs/ulfs_lookup.c

470

enduseful = results->ulr_offset;

sys/ufs/lfs/ulfs_lookup.c

472

results->ulr_offset = slotoffset;

sys/ufs/lfs/ulfs_lookup.c

473

if ((results->ulr_offset & (dirblksiz - 1)) == 0)

sys/ufs/lfs/ulfs_lookup.c

474

results->ulr_count = 0;

sys/ufs/lfs/ulfs_lookup.c

476

results->ulr_count =

sys/ufs/lfs/ulfs_lookup.c

477

results->ulr_offset - prevoff;

sys/ufs/lfs/ulfs_lookup.c

479

results->ulr_offset = slotoffset;

sys/ufs/lfs/ulfs_lookup.c

480

results->ulr_count = slotsize;

sys/ufs/lfs/ulfs_lookup.c

484

results->ulr_endoff = roundup(enduseful, dirblksiz);

sys/ufs/lfs/ulfs_lookup.c

519

if (results->ulr_offset + LFS_DIRSIZ(fs, ep) > dp->i_size) {

sys/ufs/lfs/ulfs_lookup.c

520

ulfs_dirbad(dp, results->ulr_offset, "i_size too small");

sys/ufs/lfs/ulfs_lookup.c

522

results->ulr_offset + LFS_DIRSIZ(fs, ep);

sys/ufs/lfs/ulfs_lookup.c

534

results->ulr_diroff = results->ulr_offset &~ (dirblksiz - 1);

sys/ufs/lfs/ulfs_lookup.c

548

if ((results->ulr_offset & (dirblksiz - 1)) == 0)

sys/ufs/lfs/ulfs_lookup.c

549

results->ulr_count = 0;

sys/ufs/lfs/ulfs_lookup.c

551

results->ulr_count = results->ulr_offset - prevoff;

sys/ufs/ufs/ufs_lookup.c

114

calc_count(struct ufs_lookup_results *results, int dirblksiz, doff_t prevoff)

sys/ufs/ufs/ufs_lookup.c

116

if ((results->ulr_offset & (dirblksiz - 1)) == 0)

sys/ufs/ufs/ufs_lookup.c

117

results->ulr_count = 0;

sys/ufs/ufs/ufs_lookup.c

119

results->ulr_count = results->ulr_offset - prevoff;

sys/ufs/ufs/ufs_lookup.c

151

struct ufs_lookup_results *results)

sys/ufs/ufs/ufs_lookup.c

154

slot->offset = results->ulr_offset;

sys/ufs/ufs/ufs_lookup.c

156

results->ulr_reclen = slot->size;

sys/ufs/ufs/ufs_lookup.c

187

struct ufs_lookup_results *results)

sys/ufs/ufs/ufs_lookup.c

190

results->ulr_offset = roundup(ip->i_size, dirblksiz);

sys/ufs/ufs/ufs_lookup.c

191

results->ulr_count = 0;

sys/ufs/ufs/ufs_lookup.c

192

enduseful = results->ulr_offset;

sys/ufs/ufs/ufs_lookup.c

194

results->ulr_offset = slot->offset;

sys/ufs/ufs/ufs_lookup.c

195

calc_count(results, dirblksiz, prevoff);

sys/ufs/ufs/ufs_lookup.c

197

results->ulr_offset = slot->offset;

sys/ufs/ufs/ufs_lookup.c

198

results->ulr_count = slot->size;

sys/ufs/ufs/ufs_lookup.c

202

results->ulr_endoff = roundup(enduseful, dirblksiz);

sys/ufs/ufs/ufs_lookup.c

356

struct ufs_lookup_results *results;

sys/ufs/ufs/ufs_lookup.c

402

results = &dp->i_crap;

sys/ufs/ufs/ufs_lookup.c

459

&results->ulr_offset, &bp,

sys/ufs/ufs/ufs_lookup.c

463

(results->ulr_offset & bmask));

sys/ufs/ufs/ufs_lookup.c

467

results->ulr_offset = roundup(dp->i_size, dirblksiz);

sys/ufs/ufs/ufs_lookup.c

476

if (nameiop != LOOKUP || results->ulr_diroff == 0 ||

sys/ufs/ufs/ufs_lookup.c

477

results->ulr_diroff >= dp->i_size) {

sys/ufs/ufs/ufs_lookup.c

479

results->ulr_offset = 0;

sys/ufs/ufs/ufs_lookup.c

482

results->ulr_offset = results->ulr_diroff;

sys/ufs/ufs/ufs_lookup.c

483

entryoffsetinblock = results->ulr_offset & bmask;

sys/ufs/ufs/ufs_lookup.c

485

(error = ufs_blkatoff(vdp, (off_t)results->ulr_offset,

sys/ufs/ufs/ufs_lookup.c

491

prevoff = results->ulr_offset;

sys/ufs/ufs/ufs_lookup.c

496

while (results->ulr_offset < endsearch) {

sys/ufs/ufs/ufs_lookup.c

502

if ((results->ulr_offset & bmask) == 0) {

sys/ufs/ufs/ufs_lookup.c

505

error = ufs_blkatoff(vdp, (off_t)results->ulr_offset,

sys/ufs/ufs/ufs_lookup.c

533

ufs_dirbad(dp, results->ulr_offset, msg);

sys/ufs/ufs/ufs_lookup.c

551

results->ulr_offset);

sys/ufs/ufs/ufs_lookup.c

573

slot_white(&slot, reclen, results);

sys/ufs/ufs/ufs_lookup.c

592

results->ulr_reclen = reclen;

sys/ufs/ufs/ufs_lookup.c

595

prevoff = results->ulr_offset;

sys/ufs/ufs/ufs_lookup.c

596

results->ulr_offset += reclen;

sys/ufs/ufs/ufs_lookup.c

599

enduseful = results->ulr_offset;

sys/ufs/ufs/ufs_lookup.c

608

results->ulr_offset = 0;

sys/ufs/ufs/ufs_lookup.c

609

endsearch = results->ulr_diroff;

sys/ufs/ufs/ufs_lookup.c

635

prevoff, enduseful, dp, results);

sys/ufs/ufs/ufs_lookup.c

667

results->ulr_offset + UFS_DIRSIZ(fsfmt, ep, needswap);

sys/ufs/ufs/ufs_lookup.c

669

ufs_dirbad(dp, results->ulr_offset, "i_size too small");

sys/ufs/ufs/ufs_lookup.c

683

results->ulr_diroff = results->ulr_offset & ~(dirblksiz - 1);

sys/ufs/ufs/ufs_lookup.c

697

calc_count(results, dirblksiz, prevoff);

tests/crypto/opencrypto/h_ioctl.c

233

cret.results = crs;

tests/crypto/opencrypto/h_ioctl.c

246

cret.results = crs;

tests/lib/libc/membar/t_seqlock.c

134

results[result]++;

tests/lib/libc/membar/t_seqlock.c

178

ATF_REQUIRE(results[0] != 0);

tests/lib/libc/membar/t_seqlock.c

179

ATF_REQUIRE_MSG(results[1] == 0,

tests/lib/libc/membar/t_seqlock.c

181

results[0], results[1]);

tests/lib/libc/membar/t_seqlock.c

64

uint64_t results[2];

tests/modules/x86_pte_tester/x86_pte_tester.c

212

tester_ctx.results.n_rwx += (NBPD_L4 / PAGE_SIZE);

tests/modules/x86_pte_tester/x86_pte_tester.c

214

tester_ctx.results.n_rwx += (NBPD_L3 / PAGE_SIZE);

tests/modules/x86_pte_tester/x86_pte_tester.c

216

tester_ctx.results.n_rwx += (NBPD_L2 / PAGE_SIZE);

tests/modules/x86_pte_tester/x86_pte_tester.c

218

tester_ctx.results.n_rwx += (NBPD_L1 / PAGE_SIZE);

tests/modules/x86_pte_tester/x86_pte_tester.c

237

tester_ctx.results.n_shstk += (NBPD_L4 / PAGE_SIZE);

tests/modules/x86_pte_tester/x86_pte_tester.c

239

tester_ctx.results.n_shstk += (NBPD_L3 / PAGE_SIZE);

tests/modules/x86_pte_tester/x86_pte_tester.c

241

tester_ctx.results.n_shstk += (NBPD_L2 / PAGE_SIZE);

tests/modules/x86_pte_tester/x86_pte_tester.c

243

tester_ctx.results.n_shstk += (NBPD_L1 / PAGE_SIZE);

tests/modules/x86_pte_tester/x86_pte_tester.c

269

tester_ctx.results.kernel_map_with_low_ptes |= true;

tests/modules/x86_pte_tester/x86_pte_tester.c

287

tester_ctx.results.pte_is_user_accessible |= true;

tests/modules/x86_pte_tester/x86_pte_tester.c

302

tester_ctx.results.n_user_space_is_kernel += 1;

tests/modules/x86_pte_tester/x86_pte_tester.c

321

tester_ctx.results.n_kernel_space_is_user += 1;

tests/modules/x86_pte_tester/x86_pte_tester.c

337

tester_ctx.results.n_svs_g_bit_set += 1;

tests/modules/x86_pte_tester/x86_pte_tester.c

352

tester_ctx.results.n_svs_g_bit_set = -1;

tests/modules/x86_pte_tester/x86_pte_tester.c

388

memset(&tester_ctx.results, 0, sizeof(tester_ctx.results));

tests/modules/x86_pte_tester/x86_pte_tester.c

434

*oldlenp = sizeof(tester_ctx.results);

tests/modules/x86_pte_tester/x86_pte_tester.c

438

if (*oldlenp < sizeof(tester_ctx.results))

tests/modules/x86_pte_tester/x86_pte_tester.c

441

return copyout(&tester_ctx.results, oldp, sizeof(tester_ctx.results));

tests/modules/x86_pte_tester/x86_pte_tester.c

66

} results;

usr.sbin/inetd/parse.c

1263

glob_t results;

usr.sbin/inetd/parse.c

1270

glob_result = glob(full_pattern, GLOB_NOSORT, glob_error, &results);

usr.sbin/inetd/parse.c

1292

for (size_t i = 0; i < results.gl_pathc; i++) {

usr.sbin/inetd/parse.c

1293

include_matched_path(results.gl_pathv[i]);

usr.sbin/inetd/parse.c

1296

globfree(&results);