leaf
(*action)(root, leaf, level);
x509_verify(struct x509_verify_ctx *ctx, X509 *leaf, char *name)
if (leaf != NULL || name != NULL) {
leaf = ctx->xsc->cert;
if (!X509_up_ref(leaf)) {
if (!sk_X509_push(ctx->xsc->chain, leaf)) {
X509_free(leaf);
ctx->xsc->current_cert = leaf;
if (!x509_verify_chain_append(current_chain, leaf, &ctx->error)) {
if (x509_verify_ctx_cert_is_root(ctx, leaf, full_chain)) {
x509_verify_build_chains(ctx, leaf, current_chain,
X509 *leaf = x509_verify_chain_leaf(chain);
if (!x509_verify_cert_valid(ctx, leaf, NULL))
if (!x509_verify_cert_hostname(ctx, leaf, name))
size_t x509_verify(X509_VERIFY_CTX *ctx, X509 *leaf, char *name);
X509_STORE_CTX_init(X509_STORE_CTX *ctx, X509_STORE *store, X509 *leaf,
ctx->cert = leaf;
char *leaf;
leaf = _nc_basename(head);
if (leaf == 0)
leaf = head;
*leaf = '\0';
if (head == leaf)
if (which == preorder || which == leaf) {
X509 *leaf = NULL;
leaf = sk_X509_shift(cert);
if (!X509_STORE_CTX_init(xsc, store, leaf, bundle)) {
if (!X509_STORE_CTX_init(xscip, store, leaf, bundle)) {
X509_free(leaf);
X509 *leaf = NULL;
leaf = sk_X509_shift(bundle);
if (!X509_STORE_CTX_init(xsc, store, leaf, bundle)) {
X509_free(leaf);
X509 *leaf = NULL;
leaf = sk_X509_shift(bundle);
if (!X509_STORE_CTX_init(xsc, store, leaf, bundle)) {
X509_free(leaf);
X509 *leaf = NULL;
leaf = sk_X509_shift(bundle);
if (!X509_STORE_CTX_init(xsc, store, leaf, bundle)) {
X509_free(leaf);
X509 *leaf = NULL;
leaf = sk_X509_shift(bundle);
if (!X509_STORE_CTX_init(xsc, store, leaf, bundle)) {
X509_free(leaf);
X509 *leaf = NULL;
leaf = sk_X509_shift(bundle);
if (!X509_STORE_CTX_init(xsc, store, leaf, bundle)) {
X509_free(leaf);
X509 *leaf = NULL;
leaf = sk_X509_shift(bundle);
if (!X509_STORE_CTX_init(xsc, NULL, leaf, bundle)) {
if ((*chains = x509_verify(ctx, leaf, NULL)) == 0) {
X509_free(leaf);
cpuid(uint32_t leaf, uint32_t subleaf, struct cpuid *out)
: "a" (leaf), "c" (subleaf));
struct cpuid leaf;
cpuid(0x1, 0, &leaf);
if ((leaf.c & CPUID_01_C_XSAVE_MASK) == 0) {
cpuid(0xd, XSTATE_COMPONENT_AVX, &leaf);
xstate->components[XSTATE_COMPONENT_AVX].offset = leaf.b;
xstate->components[XSTATE_COMPONENT_AVX].size = leaf.a;
intel_print_one_cache(struct cpu_info *ci, int leaf, u_int eax, u_int ebx,
if (leaf == 0)
int leaf;
leaf = 0;
for (; leaf < MAX_CACHE_LEAF; leaf++) {
CPUID_LEAF(fn, leaf, eax, ebx, ecx, dummy);
if (PREV_SAME(prev_cache[leaf][0], eax) &&
PREV_SAME(prev_cache[leaf][1], ebx) &&
PREV_SAME(prev_cache[leaf][2], ecx)) {
for (i = 0; i < leaf; i++)
for (; leaf < MAX_CACHE_LEAF; leaf++) {
CPUID_LEAF(fn, leaf, eax, ebx, ecx, dummy);
PREV_SET(prev_cache[leaf][0], eax);
PREV_SET(prev_cache[leaf][1], ebx);
PREV_SET(prev_cache[leaf][2], ecx);
if (intel_print_one_cache(ci, leaf, eax, ebx, ecx))
uint32_t leaf, subleaf, eax, ebx, ecx, edx;
leaf = *rax;
if ((leaf > vmm_cpuid_level && leaf < 0x40000000) ||
(leaf > curcpu()->ci_pnfeatset)) {
"0x%llx - resetting to 0x%x\n", __func__, leaf,
leaf = vmm_cpuid_level;
if (leaf <= cpuid_level || leaf > 0x80000000)
CPUID_LEAF(leaf, subleaf, eax, ebx, ecx, edx);
switch (leaf) {
#define CPUID_LEAF(code, leaf, eax, ebx, ecx, edx) \
: "a" (code), "c" (leaf))
#define CPUID_LEAF(code, leaf, eax, ebx, ecx, edx) \
: "a" (code), "c" (leaf))
static int check_seqno(struct i915_syncmap *leaf, unsigned int idx, u32 seqno)
if (leaf->height) {
__func__, leaf->height);
if (__sync_seqno(leaf)[idx] != seqno) {
__func__, idx, __sync_seqno(leaf)[idx], seqno);
struct i915_syncmap *leaf = __sync_child(sync)[idx];
if (leaf->height) {
if (leaf->parent != sync) {
if (!is_power_of_2(leaf->bitmap)) {
idx, leaf->bitmap, hweight32(leaf->bitmap));
if (leaf->bitmap != BIT(idx)) {
idx, ilog2(leaf->bitmap), idx);
char *leaf, *p;
leaf = p;
leaf = strrchr(p, '/');
if (leaf != NULL) {
*leaf = '\0';
leaf = path;
*path_remainder = leaf;
while (*leaf != '\0')
leaf++;
*leaf = '/';
rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip)
char *cp2 = leaf->rn_key;
char *cp3 = leaf->rn_mask;
unsigned leaf = _nc_pathlast(result);
if (leaf) {
char save = result[leaf];
result[leaf] = 0;
result[leaf] = save;
char *leaf;
&& ((len = (int) strlen(leaf = _nc_basename(var))) >= 3)
&& !strcmp(leaf + len - 3, "csh"))
btree_read_data(struct btree *bt, struct mpage *mp, struct node *leaf,
if (!F_ISSET(leaf->flags, F_BIGDATA)) {
data->size = leaf->n_dsize;
bcopy(NODEDATA(leaf), data->data, data->size);
data->data = NODEDATA(leaf);
DPRINTF("allocating %u byte for overflow data", leaf->n_dsize);
if ((data->data = malloc(leaf->n_dsize)) == NULL)
data->size = leaf->n_dsize;
bcopy(NODEDATA(leaf), &pgno, sizeof(pgno));
struct node *leaf;
leaf = btree_search_node(bt, mp, key, &exact, NULL);
if (leaf && exact)
rc = btree_read_data(bt, mp, leaf, data);
struct node *leaf;
leaf = NODEPTR(mp, top->ki);
if (data && btree_read_data(cursor->bt, mp, leaf, data) != BT_SUCCESS)
if (bt_set_key(cursor->bt, mp, leaf, key) != 0)
struct node *leaf;
leaf = btree_search_node(cursor->bt, mp, key, exactp, &top->ki);
if (leaf == NULL) {
leaf = NODEPTR(mp, 0);
if (data && btree_read_data(cursor->bt, mp, leaf, data) != BT_SUCCESS)
if (bt_set_key(cursor->bt, mp, leaf, key) != 0)
struct node *leaf;
leaf = NODEPTR(mp, 0);
if (data && btree_read_data(cursor->bt, mp, leaf, data) != BT_SUCCESS)
if (bt_set_key(cursor->bt, mp, leaf, key) != 0)
struct node *leaf;
struct node *leaf, struct btval *data);
leaf = btree_search_node(bt, mp, key, &exact, &ki);
if (leaf == NULL || !exact) {
if (data && (rc = btree_read_data(bt, NULL, leaf, data)) != BT_SUCCESS)
struct node *leaf;
leaf = btree_search_node(bt, mp, key, &exact, &ki);
if (leaf && exact) {
if (leaf == NULL) { /* append if not found */