crypto/heimdal/lib/roken/tsearch.c

82

(*action)(root, leaf, level);

crypto/openssh/xmss_fast.c

111

static void l_tree(unsigned char *leaf, unsigned char *wots_pk, const xmss_params *params, const unsigned char *pub_seed, uint32_t addr[8])

crypto/openssh/xmss_fast.c

146

memcpy(leaf, wots_pk, n);

crypto/openssh/xmss_fast.c

152

static void gen_leaf_wots(unsigned char *leaf, const unsigned char *sk_seed, const xmss_params *params, const unsigned char *pub_seed, uint32_t ltree_addr[8], uint32_t ots_addr[8])

crypto/openssh/xmss_fast.c

160

l_tree(leaf, pk, params, pub_seed, ltree_addr);

crypto/openssh/xmss_fast.c

296

static void validate_authpath(unsigned char *root, const unsigned char *leaf, unsigned long leafidx, const unsigned char *authpath, const xmss_params *params, const unsigned char *pub_seed, uint32_t addr[8])

crypto/openssh/xmss_fast.c

307

buffer[n+j] = leaf[j];

crypto/openssh/xmss_fast.c

313

buffer[j] = leaf[j];

crypto/openssl/crypto/sparse_array.c

134

void ossl_sa_doall(const OPENSSL_SA *sa, void (*leaf)(ossl_uintmax_t, void *))

crypto/openssl/crypto/sparse_array.c

138

tramp.func = leaf;

crypto/openssl/crypto/sparse_array.c

144

void (*leaf)(ossl_uintmax_t, void *, void *),

crypto/openssl/crypto/sparse_array.c

148

sa_doall(sa, NULL, leaf, arg);

crypto/openssl/crypto/sparse_array.c

66

void (*leaf)(ossl_uintmax_t, void *, void *), void *arg)

crypto/openssl/crypto/sparse_array.c

92

} else if (leaf != NULL) {

crypto/openssl/crypto/sparse_array.c

93

(*leaf)(idx, p[n], arg);

crypto/openssl/include/crypto/sparse_array.h

46

void (*leaf)(ossl_uintmax_t, type *)) \

crypto/openssl/include/crypto/sparse_array.h

49

(void (*)(ossl_uintmax_t, void *))leaf); \

crypto/openssl/include/crypto/sparse_array.h

53

void (*leaf)(ossl_uintmax_t, type *, void *), \

crypto/openssl/include/crypto/sparse_array.h

57

(void (*)(ossl_uintmax_t, void *, void *))leaf, arg); \

crypto/openssl/include/crypto/sparse_array.h

81

void ossl_sa_doall(const OPENSSL_SA *sa, void (*leaf)(ossl_uintmax_t, void *));

crypto/openssl/include/crypto/sparse_array.h

83

void (*leaf)(ossl_uintmax_t, void *, void *), void *);

crypto/openssl/test/crltest.c

338

static int verify(X509 *leaf, X509 *root, STACK_OF(X509_CRL) *crls,

crypto/openssl/test/crltest.c

360

if (!TEST_true(X509_STORE_CTX_init(ctx, store, leaf, NULL)))

crypto/openssl/test/sslapitest.c

577

char *leaf = test_mk_file_path(certsdir, "leaf.pem");

crypto/openssl/test/sslapitest.c

591

if (!TEST_int_eq(SSL_CTX_use_certificate_chain_file(sctx, leaf), 1)

crypto/openssl/test/sslapitest.c

645

OPENSSL_free(leaf);

lib/libc/stdlib/tdelete.c

103

if ((*leaf)->llink == NULL) {

lib/libc/stdlib/tdelete.c

105

old = *leaf;

lib/libc/stdlib/tdelete.c

106

*leaf = old->rlink;

lib/libc/stdlib/tdelete.c

113

void **keyp = &(*leaf)->key;

lib/libc/stdlib/tdelete.c

115

while ((*leaf)->rlink != NULL)

lib/libc/stdlib/tdelete.c

117

old = *leaf;

lib/libc/stdlib/tdelete.c

119

*leaf = old->llink;

lib/libc/stdlib/tdelete.c

131

for (n = rootp; n != leaf;) {

lib/libc/stdlib/tdelete.c

38

if ((*leaf)->balance == 0 || \

lib/libc/stdlib/tdelete.c

39

((*leaf)->balance < 0 && (*leaf)->rlink->balance == 0)) { \

lib/libc/stdlib/tdelete.c

48

rootp = leaf; \

lib/libc/stdlib/tdelete.c

52

leaf = &(*leaf)->llink; \

lib/libc/stdlib/tdelete.c

57

if ((*leaf)->balance == 0 || \

lib/libc/stdlib/tdelete.c

58

((*leaf)->balance > 0 && (*leaf)->llink->balance == 0)) { \

lib/libc/stdlib/tdelete.c

59

rootp = leaf; \

lib/libc/stdlib/tdelete.c

63

leaf = &(*leaf)->rlink; \

lib/libc/stdlib/tdelete.c

71

posix_tnode **leaf, *old, **n, *x, *y, *z, *result;

lib/libc/stdlib/tdelete.c

86

leaf = rootp;

lib/libc/stdlib/tdelete.c

88

if (*leaf == NULL)

lib/libc/stdlib/tdelete.c

90

cmp = compar(key, (*leaf)->key);

lib/libc/stdlib/tdelete.c

92

result = *leaf;

lib/libc/stdlib/tdelete.c

95

result = *leaf;

lib/libc/stdlib/tsearch.c

37

posix_tnode **leaf, *result, *n, *x, *y, *z;

lib/libc/stdlib/tsearch.c

51

leaf = rootp;

lib/libc/stdlib/tsearch.c

52

while (*leaf != NULL) {

lib/libc/stdlib/tsearch.c

53

if ((*leaf)->balance != 0) {

lib/libc/stdlib/tsearch.c

62

rootp = leaf;

lib/libc/stdlib/tsearch.c

65

cmp = compar(key, (*leaf)->key);

lib/libc/stdlib/tsearch.c

68

leaf = &(*leaf)->llink;

lib/libc/stdlib/tsearch.c

71

leaf = &(*leaf)->rlink;

lib/libc/stdlib/tsearch.c

73

return (*leaf);

lib/libc/stdlib/tsearch.c

78

result = *leaf = malloc(sizeof(**leaf));

lib/libc/stdlib/tsearch.c

92

for (n = *rootp; n != *leaf;) {

lib/libc/stdlib/twalk.c

30

(*action)(root, leaf, level);

lib/libc/tests/stdlib/tsearch_test.c

65

if (v == postorder || v == leaf)

sbin/routed/radix.c

175

struct radix_node *leaf,

sbin/routed/radix.c

178

char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;

stand/libsa/zfs/zfsimpl.c

2692

zap_leaf_free(zap_leaf_t *leaf)

stand/libsa/zfs/zfsimpl.c

2694

free(leaf->l_phys);

stand/libsa/zfs/zfsimpl.c

2695

free(leaf);

sys/arm64/iommu/smmu.c

488

if (entry->tlbi.leaf) {

sys/arm64/iommu/smmu.c

509

cmd[1] |= ((uint64_t)entry->cfgi.leaf << CFGI_1_LEAF_S);

sys/arm64/iommu/smmu.c

612

smmu_sync_cd(struct smmu_softc *sc, int sid, int ssid, bool leaf)

sys/arm64/iommu/smmu.c

619

cmd.cfgi.leaf = leaf;

sys/arm64/iommu/smmu.c

668

cmd.tlbi.leaf = true; /* We change only L3. */

sys/arm64/iommu/smmuvar.h

105

bool leaf;

sys/arm64/iommu/smmuvar.h

110

bool leaf;

sys/crypto/skein/skein.h

215

#define SKEIN_CFG_TREE_INFO(leaf,node,maxLvl) \

sys/crypto/skein/skein.h

216

( (((u64b_t)(leaf )) << SKEIN_CFG_TREE_LEAF_SIZE_POS) | \

sys/dev/irdma/irdma_kcompat.c

1184

pinfo = (level == PBLE_LEVEL_1) ? NULL : palloc->level2.leaf;

sys/dev/irdma/irdma_pble.c

354

struct irdma_pble_info *leaf = lvl2->leaf;

sys/dev/irdma/irdma_pble.c

356

for (i = 0; i < lvl2->leaf_cnt; i++, leaf++) {

sys/dev/irdma/irdma_pble.c

357

if (leaf->addr)

sys/dev/irdma/irdma_pble.c

359

&leaf->chunkinfo);

sys/dev/irdma/irdma_pble.c

368

lvl2->leaf = NULL;

sys/dev/irdma/irdma_pble.c

385

struct irdma_pble_info *leaf;

sys/dev/irdma/irdma_pble.c

395

lvl2->leafmem.size = (sizeof(*leaf) * total);

sys/dev/irdma/irdma_pble.c

400

lvl2->leaf = lvl2->leafmem.va;

sys/dev/irdma/irdma_pble.c

401

leaf = lvl2->leaf;

sys/dev/irdma/irdma_pble.c

406

lvl2->leaf = NULL;

sys/dev/irdma/irdma_pble.c

413

for (i = 0; i < total; i++, leaf++) {

sys/dev/irdma/irdma_pble.c

417

&leaf->chunkinfo, pblcnt << 3,

sys/dev/irdma/irdma_pble.c

418

&leaf->addr, &fpm_addr);

sys/dev/irdma/irdma_pble.c

422

leaf->idx = fpm_to_idx(pble_rsrc, fpm_addr);

sys/dev/irdma/irdma_pble.c

424

leaf->cnt = pblcnt;

sys/dev/irdma/irdma_pble.c

425

*addr = (u64)leaf->idx;

sys/dev/irdma/irdma_pble.h

73

struct irdma_pble_info *leaf;

sys/dev/irdma/irdma_verbs.c

1714

struct irdma_pble_info *leaf = lvl2->leaf;

sys/dev/irdma/irdma_verbs.c

1727

start_addr = leaf->addr;

sys/dev/irdma/irdma_verbs.c

1729

for (i = 0; i < lvl2->leaf_cnt; i++, leaf++) {

sys/dev/irdma/irdma_verbs.c

1730

arr = leaf->addr;

sys/dev/irdma/irdma_verbs.c

1733

ret = irdma_check_mem_contiguous(arr, leaf->cnt, pg_size);

sys/dev/irdma/irdma_verbs.c

1767

palloc->level2.leaf;

sys/dev/irdma/irdma_verbs.c

1960

palloc->level2.leaf + (iwmr->npages >> PBLE_512_SHIFT);

sys/dev/xen/blkback/blkback.c

3080

const char *leaf;

sys/dev/xen/blkback/blkback.c

3097

leaf = "sectors";

sys/dev/xen/blkback/blkback.c

3098

error = xs_printf(xst, our_path, leaf, "%ju",

sys/dev/xen/blkback/blkback.c

3104

leaf = "info";

sys/dev/xen/blkback/blkback.c

3105

error = xs_printf(xst, our_path, leaf, "%u",

sys/dev/xen/blkback/blkback.c

3111

leaf = "sector-size";

sys/dev/xen/blkback/blkback.c

3112

error = xs_printf(xst, our_path, leaf, "%u",

sys/dev/xen/blkback/blkback.c

3127

our_path, leaf);

sys/fs/ext2fs/ext2_extents.c

1529

e4fs_daddr_t leaf;

sys/fs/ext2fs/ext2_extents.c

1533

leaf = ext4_ext_index_pblock(path->ep_index);

sys/fs/ext2fs/ext2_extents.c

1539

ext4_ext_blkfree(ip, leaf, 1, 0);

sys/geom/union/g_union.c

1079

uint64_t **leaf;

sys/geom/union/g_union.c

1094

leaf = &sc->sc_writemap_root[root_idx];

sys/geom/union/g_union.c

1095

wordp = &(*leaf)

sys/geom/union/g_union.c

1117

uint64_t *leaf, word;

sys/geom/union/g_union.c

1151

leaf = sc->sc_writemap_root[root_idx];

sys/geom/union/g_union.c

1152

word = leaf[(start % sc->sc_bits_per_leaf) / BITS_PER_ENTRY];

sys/kern/kern_sysctl.c

404

sysctl_warn_reuse(const char *func, struct sysctl_oid *leaf)

sys/kern/kern_sysctl.c

416

rc = sysctl_search_oid(nodes, leaf);

sys/kern/kern_sysctl.c

422

sbuf_cat(&sb, leaf->oid_name);

sys/net/radix.c

250

rn_satisfies_leaf(const char *trial, struct radix_node *leaf, int skip)

sys/net/radix.c

252

const char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;

sys/net/radix.c

78

static int rn_satisfies_leaf(const char *trial, struct radix_node *leaf,

sys/netpfil/pf/pf_ruleset.c

193

char *leaf, *p;

sys/netpfil/pf/pf_ruleset.c

201

leaf = p;

sys/netpfil/pf/pf_ruleset.c

203

leaf = strrchr(p, '/');

sys/netpfil/pf/pf_ruleset.c

204

if (leaf != NULL) {

sys/netpfil/pf/pf_ruleset.c

205

*leaf = '\0';

sys/netpfil/pf/pf_ruleset.c

209

leaf = path;

sys/netpfil/pf/pf_ruleset.c

219

*path_remainder = leaf;

sys/netpfil/pf/pf_ruleset.c

223

while (*leaf != '\0')

sys/netpfil/pf/pf_ruleset.c

224

leaf++;

sys/netpfil/pf/pf_ruleset.c

225

*leaf = '/';

sys/x86/iommu/intel_idpgtbl.c

129

if (lvl != tbl->leaf) {

sys/x86/iommu/intel_idpgtbl.c

135

if (lvl == tbl->leaf) {

sys/x86/iommu/intel_idpgtbl.c

174

int leaf, i;

sys/x86/iommu/intel_idpgtbl.c

176

leaf = 0; /* silence gcc */

sys/x86/iommu/intel_idpgtbl.c

183

leaf = i;

sys/x86/iommu/intel_idpgtbl.c

200

tbl->leaf == leaf) {

sys/x86/iommu/intel_idpgtbl.c

219

tbl->leaf == leaf) {

sys/x86/iommu/intel_idpgtbl.c

233

tbl->leaf = leaf;

sys/x86/iommu/intel_idpgtbl.c

90

int leaf; /* The last materialized page table

sys/x86/x86/identcpu.c

1397

u_int leaf, regs[4];

sys/x86/x86/identcpu.c

1412

for (leaf = 0x40000000; leaf < 0x40010000; leaf += 0x100) {

sys/x86/x86/identcpu.c

1413

do_cpuid(leaf, regs);

sys/x86/x86/identcpu.c

1424

regs[0] = leaf + 1;

sys/x86/x86/identcpu.c

1426

if (regs[0] >= leaf) {

sys/x86/x86/identcpu.c

1442

if (vm_guest != prev_vm_guest || leaf == 0x40000000) {

sys/x86/x86/identcpu.c

1443

hv_base = leaf;

sys/x86/x86/mp_x86.c

403

u_int leaf;

sys/x86/x86/mp_x86.c

411

leaf = 0x1f;

sys/x86/x86/mp_x86.c

412

cpuid_count(leaf, 0, p);

sys/x86/x86/mp_x86.c

416

leaf = 0x0b;

sys/x86/x86/mp_x86.c

417

cpuid_count(leaf, 0, p);

sys/x86/x86/mp_x86.c

427

cpuid_count(leaf, i, p);

usr.sbin/makefs/zfs/zap.c

327

zap_leaf_phys_t *leaf;

usr.sbin/makefs/zfs/zap.c

329

leaf = l->l_phys;

usr.sbin/makefs/zfs/zap.c

331

leaf->l_hdr.lh_block_type = ZBT_LEAF;

usr.sbin/makefs/zfs/zap.c

332

leaf->l_hdr.lh_magic = ZAP_LEAF_MAGIC;

usr.sbin/makefs/zfs/zap.c

333

leaf->l_hdr.lh_nfree = ZAP_LEAF_NUMCHUNKS(l);

usr.sbin/makefs/zfs/zap.c

334

leaf->l_hdr.lh_prefix = prefix;

usr.sbin/makefs/zfs/zap.c

335

leaf->l_hdr.lh_prefix_len = prefixlen;

usr.sbin/makefs/zfs/zap.c

338

assert(leaf->l_hdr.lh_nfree < 0xffff);

usr.sbin/makefs/zfs/zap.c

339

memset(leaf->l_hash, 0xff,

usr.sbin/makefs/zfs/zap.c

340

ZAP_LEAF_HASH_NUMENTRIES(l) * sizeof(*leaf->l_hash));