/freebsd-11-stable/sys/net/ |
H A D | radix.c | 84 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf, 117 * a key satisfies a normal route, and also in remembering the unique leaf 256 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip) argument 258 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask; 303 * match and the leaf we have is the most specific one anyway; 339 * we may match if the leaf we wound up at is 385 * Whenever we add a new leaf to the tree, we also add a parent node, 387 * the leaf (see RNTORT() in route.c), the second one is the parent. 389 * the leaf i [all...] |
/freebsd-11-stable/contrib/ncurses/progs/ |
H A D | tic.c | 597 unsigned leaf = _nc_pathlast(result); local 600 if (leaf) { 601 char save = result[leaf]; 602 result[leaf] = 0; 606 result[leaf] = save;
|
H A D | tset.c | 1355 char *leaf; local 1361 && ((len = (int) strlen(leaf = _nc_basename(var))) >= 3) 1362 && !strcmp(leaf + len - 3, "csh"))
|
/freebsd-11-stable/contrib/dialog/ |
H A D | dialog.c | 1222 const char *leaf = strrchr(program, '/'); local 1225 if (leaf != 0) 1226 leaf++; 1228 leaf = program; 1231 fprintf(dialog_state.output, *list, n ? leaf : dialog_version());
|
H A D | inputstr.c | 107 if (which == postorder || which == leaf) {
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | internal_node.hpp | 93 typedef PB_DS_LEAF_C_DEC leaf; typedef in struct:pb_ds::detail::pat_trie_internal_node 94 typedef typename Allocator::template rebind<leaf>::other leaf_rebind;
|
H A D | insert_join_fn_imps.hpp | 400 new (p_new_lf) leaf(r_val);
|
/freebsd-11-stable/contrib/tcpdump/ |
H A D | print-slow.c | 160 uint8_t leaf[2]; member in struct:slow_oam_variablerequest_t 165 uint8_t leaf[2]; member in struct:slow_oam_variableresponse_t
|
/freebsd-11-stable/sys/dev/xen/blkback/ |
H A D | blkback.c | 3276 const char *leaf; local 3289 leaf = "sectors"; 3290 error = xs_printf(xst, our_path, leaf, 3296 leaf = "info"; 3297 error = xs_printf(xst, our_path, leaf, "%u", 3303 leaf = "sector-size"; 3304 error = xs_printf(xst, our_path, leaf, "%u", 3319 our_path, leaf);
|
/freebsd-11-stable/contrib/atf/atf-c/detail/ |
H A D | fs_test.c | 292 const char *leaf; member in struct:test 308 printf("Expected output: %s\n", t->leaf); 313 ATF_REQUIRE(atf_equal_dynstr_cstring(&ln, t->leaf));
|
/freebsd-11-stable/sbin/routed/ |
H A D | radix.c | 101 * a key satisfies a normal route, and also in remembering the unique leaf 187 struct radix_node *leaf, 190 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask; 233 * match and the leaf we have is the most specific one anyway; 282 * we may match if the leaf we wound up at is 836 /* Find the next *leaf* since next node might vanish, too */ 186 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip) argument
|
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/ |
H A D | divsi3.S | 329 retl ! leaf-routine return
|
H A D | modsi3.S | 329 retl ! leaf-routine return
|
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/ztest/ |
H A D | ztest.c | 2867 uint64_t leaf, top; local 2906 * Pick a random leaf within it. 2908 leaf = ztest_random(leaves); 2917 oldvd = oldvd->vdev_child[leaf / ztest_opts.zo_raidz]; 2922 oldvd = oldvd->vdev_child[leaf % ztest_opts.zo_raidz]; 2967 top * leaves + leaf); 3200 * leaf vdev we encounter. 3261 * Determine the size of the first leaf vdev associated with 4467 * 2050 entries we should see ptrtbl growth and leaf-block split. 5013 uint64_t top, leaf; local [all...] |
/freebsd-11-stable/contrib/binutils/include/opcode/ |
H A D | cgen.h | 647 const struct cgen_ifld * leaf; 637 const struct cgen_ifld * leaf; member in union:cgen_maybe_multi_ifield::__anon567
|
/freebsd-11-stable/crypto/heimdal/lib/hx509/ |
H A D | test_cms.in | 431 --embed-leaf-only \
|
/freebsd-11-stable/sys/conf/ |
H A D | kmod.mk | 144 CFLAGS+= -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer
|
/freebsd-11-stable/crypto/openssl/crypto/ |
H A D | sparccpuid.S | 146 be 1f ! could have been a leaf function...
|
/freebsd-11-stable/contrib/llvm-project/openmp/runtime/src/ |
H A D | kmp.h | 1177 static inline void __kmp_x86_cpuid(int leaf, int subleaf, struct kmp_cpuid *p) { argument 1180 : "a"(leaf), "c"(subleaf));
|
/freebsd-11-stable/gnu/lib/libstdc++/ |
H A D | Makefile | 409 pat_trie_/leaf.hpp \
|
/freebsd-11-stable/contrib/binutils/gas/config/ |
H A D | tc-score.c | 165 unsigned long leaf; member in struct:proc 6003 cur_proc_ptr->leaf = 0xdeafbeaf; 6061 cur_proc_ptr->leaf = val; 6125 (cur_proc_ptr->leaf == 0xdeafbeaf) || 6143 md_number_to_chars (fragp + 12, (valueT) cur_proc_ptr->leaf, 4);
|
/freebsd-11-stable/crypto/heimdal/lib/sqlite/ |
H A D | sqlite3.c | 47618 u8 leaf; /* True if leaf flag is set */ member in struct:MemPage [all...] |
/freebsd-11-stable/contrib/libstdc++/include/ |
H A D | Makefile.am | 426 ${pb_srcdir}/detail/pat_trie_/leaf.hpp \
|
H A D | Makefile.in | 650 ${pb_srcdir}/detail/pat_trie_/leaf.hpp \
|
/freebsd-11-stable/contrib/gcc/config/arm/ |
H A D | arm.c | 9302 even call clobbered ones. If this is a leaf function 9764 a leaf function. These function types will not contain a stack 10508 int leaf; 10514 /* We need to know if we are a leaf function. Unfortunately, it 10520 to know about leaf functions once reload has completed, and the 10531 leaf = leaf_function_p (); 10581 /* A leaf function does not need any stack alignment if it has nothing 10583 if (leaf && frame_size == 0) 13391 /* This test is only important for leaf functions. */ 10492 int leaf; local
|