/freebsd-current/sys/sys/ |
H A D | _stack.h | 35 int depth; member in struct:stack
|
H A D | stack.h | 63 #define CTRSTACK(m, st, depth) do { \ 65 stack_ktr((m), __FILE__, __LINE__, st, depth); \ 68 #define CTRSTACK(m, st, depth)
|
/freebsd-current/contrib/bearssl/T0/ |
H A D | CPU.cs | 86 * Get the current stack depth (number of elements). 117 * Look at the value at depth 'depth' (0 is top of stack). The 120 internal TValue Peek(int depth) argument 122 return stackBuf[stackPtr - depth]; 126 * Rotate the stack at depth 'depth': the value at that depth 129 internal void Rot(int depth) argument 131 TValue v = stackBuf[stackPtr - depth]; 141 NRot(int depth) argument [all...] |
/freebsd-current/tests/sys/cddl/zfs/tests/cli_root/zfs_mount/ |
H A D | zfs_mount_006_pos.ksh | 91 typeset -i depth=0 94 while (( depth < MAXDEPTH )); do 95 mtpt=$mtpt/$depth 96 (( depth = depth + 1)) 111 (( depth == MAXDEPTH )) && \ 124 (( depth == MAXDEPTH )) && \ 128 (( depth = depth - 1 ))
|
/freebsd-current/sys/contrib/dpdk_rte_lpm/ |
H A D | rte_lpm.c | 62 #define VERIFY_DEPTH(depth) do { \ 63 if ((depth == 0) || (depth > RTE_LPM_MAX_DEPTH)) \ 64 rte_panic("LPM: Invalid depth (%u) at line %d", \ 65 (unsigned)(depth), __LINE__); \ 68 #define VERIFY_DEPTH(depth) 72 * Converts a given depth value to its corresponding mask value. 74 * depth (IN) : range = 1 - 32 78 depth_to_mask(uint8_t depth) argument 80 VERIFY_DEPTH(depth); 92 depth_to_range(uint8_t depth) argument 466 add_depth_small(struct rte_lpm *lpm, uint32_t ip, uint8_t depth, uint32_t next_hop) argument 538 add_depth_big(struct rte_lpm *lpm, uint32_t ip_masked, uint8_t depth, uint32_t next_hop) argument 691 rte_lpm_add(struct rte_lpm *lpm, uint32_t ip, uint8_t depth, uint32_t next_hop) argument 792 delete_depth_small(struct rte_lpm *lpm, uint32_t ip_masked, uint8_t depth, uint32_t sub_rule_nhop, uint8_t sub_rule_depth) argument 945 delete_depth_big(struct rte_lpm *lpm, uint32_t ip_masked, uint8_t depth, uint32_t sub_rule_nhop, uint8_t sub_rule_depth) argument 1034 rte_lpm_delete(struct rte_lpm *lpm, uint32_t ip, uint8_t depth, uint8_t sub_rule_depth, uint32_t sub_rule_nhop) argument [all...] |
H A D | rte_lpm6.c | 57 uint32_t depth :8; /**< Rule depth. */ member in struct:rte_lpm6_tbl_entry 69 uint8_t depth; /**< Rule depth. */ member in struct:rte_lpm6_rule 75 uint8_t depth; /**< Rule depth. */ member in struct:rte_lpm6_rule_key 113 * Takes an array of uint8_t (IPv6 address) and masks it using the depth. 114 * It leaves untouched one bit per unit in the depth variable 118 ip6_mask_addr(uint8_t *ip, uint8_t depth) argument 123 part_depth = depth; 607 simulate_add_step(struct rte_lpm6 *lpm, struct rte_lpm6_tbl_entry *tbl, struct rte_lpm6_tbl_entry **next_tbl, const uint8_t *ip, uint8_t bytes, uint8_t first_byte, uint8_t depth, uint32_t *need_tbl_nb) argument 659 add_step(struct rte_lpm6 *lpm, struct rte_lpm6_tbl_entry *tbl, uint32_t tbl_ind, struct rte_lpm6_tbl_entry **next_tbl, uint32_t *next_tbl_ind, uint8_t *ip, uint8_t bytes, uint8_t first_byte, uint8_t depth, uint32_t next_hop, uint8_t is_new_rule) argument 826 simulate_add(struct rte_lpm6 *lpm, const uint8_t *masked_ip, uint8_t depth) argument 863 rte_lpm6_add(struct rte_lpm6 *lpm, const uint8_t *ip, uint8_t depth, uint32_t next_hop, int is_new_rule) argument 1028 fill_rule6(char *buffer, const uint8_t *ip, uint8_t depth, uint32_t next_hop) argument 1157 depth_to_mask_1b(uint8_t depth) argument 1211 rule_find_range(struct rte_lpm6 *lpm, const uint8_t *ip, uint8_t depth, struct rte_lpm6_tbl_entry **from, struct rte_lpm6_tbl_entry **to, uint32_t *out_tbl_ind) argument 1318 rte_lpm6_delete(struct rte_lpm6 *lpm, const uint8_t *ip, uint8_t depth, struct rte_lpm6_rule *lsp_rule) argument [all...] |
H A D | rte_lpm6.h | 41 uint8_t depth, uint32_t next_hop); 96 * @param depth 104 rte_lpm6_add(struct rte_lpm6 *lpm, const uint8_t *ip, uint8_t depth, 115 * @param depth 123 rte_lpm6_is_rule_present(struct rte_lpm6 *lpm, const uint8_t *ip, uint8_t depth, 133 * @param depth 139 rte_lpm6_delete(struct rte_lpm6 *lpm, const uint8_t *ip, uint8_t depth,
|
H A D | dpdk_lpm6.h | 54 rte_lpm6_add(struct rte_lpm6 *lpm, const uint8_t *ip, uint8_t depth,
|
/freebsd-current/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_root/zfs_mount/ |
H A D | zfs_mount_006_pos.ksh | 88 typeset -i depth=0 91 while (( depth < MAXDEPTH )); do 92 mtpt=$mtpt/$depth 93 (( depth = depth + 1)) 113 while [[ $depth -gt 0 ]] ; do 114 (( depth == MAXDEPTH )) && \ 138 (( depth == MAXDEPTH )) && \ 142 (( depth = depth [all...] |
/freebsd-current/sys/kern/ |
H A D | subr_stack.c | 71 if (st->depth < STACK_MAX) { 72 st->pcs[st->depth++] = pc; 99 KASSERT(st->depth <= STACK_MAX, ("bogus stack")); 100 for (i = 0; i < st->depth; i++) { 115 KASSERT(st->depth <= STACK_MAX, ("bogus stack")); 116 for (i = 0; i < st->depth; i++) { 135 KASSERT(st->depth <= STACK_MAX, ("bogus stack")); 136 for (i = 0; i < st->depth; i++) { 151 KASSERT(st->depth <= STACK_MAX, ("bogus stack")); 152 for (i = 0; i < st->depth; 225 stack_ktr(u_int mask, const char *file, int line, const struct stack *st, u_int depth) argument [all...] |
/freebsd-current/contrib/llvm-project/compiler-rt/lib/dfsan/ |
H A D | dfsan_origin.h | 74 int depth = prev.isChainedOrigin() ? prev.depth() : -1; local 75 // depth is the length of the chain minus 1. 76 // origin_history_size of 0 means unlimited depth. 78 ++depth; 79 if (depth >= flags().origin_history_size || depth > kMaxDepth) 101 return Origin((depth << kDepthShift) | chained_id); 116 int depth() const { function in class:__dfsan::Origin
|
/freebsd-current/sys/contrib/libfdt/ |
H A D | fdt.c | 165 int fdt_next_node(const void *fdt, int offset, int *depth) argument 184 if (depth) 185 (*depth)++; 189 if (depth && ((--(*depth)) < 0)) 195 || ((nextoffset == -FDT_ERR_TRUNCATED) && !depth)) 207 int depth = 0; local 209 offset = fdt_next_node(fdt, offset, &depth); 210 if (offset < 0 || depth != 1) 218 int depth local [all...] |
H A D | fdt_wip.c | 120 int depth = 0; local 122 while ((offset >= 0) && (depth >= 0)) 123 offset = fdt_next_node(fdt, offset, &depth);
|
/freebsd-current/sys/ddb/ |
H A D | db_pprint.c | 44 u_int depth); 53 db_pprint_int(db_addr_t addr, struct ctf_type_v3 *type, u_int depth) argument 79 * Pretty-prints a struct. Nested structs are pretty-printed up 'depth' nested 83 db_pprint_struct(db_addr_t addr, struct ctf_type_v3 *type, u_int depth) argument 103 if (depth > max_depth) { 122 db_indent = depth; 129 db_pprint_type(maddr, mtype, depth + 1); 145 db_indent = depth; 152 db_pprint_type(maddr, mtype, depth + 1); 156 db_indent = depth 165 db_pprint_arr(db_addr_t addr, struct ctf_type_v3 *type, u_int depth) argument 206 db_pprint_enum(db_addr_t addr, struct ctf_type_v3 *type, u_int depth) argument 245 db_pprint_ptr(db_addr_t addr, struct ctf_type_v3 *type, u_int depth) argument 287 db_pprint_type(db_addr_t addr, struct ctf_type_v3 *type, u_int depth) argument [all...] |
/freebsd-current/contrib/libxo/tests/xo/ |
H A D | xo_02.sh | 27 ${XOP} --depth 4 --not-first --wrap d/e/f "$@" 42 ${XOP} --depth 2 'First {:tag} ' value1 43 ${XOP} --depth 2 --continuation 'and then {:tag}\n' value2 52 ${XOP} --depth 1 $NF --open-instance machine 53 ${XOP} --depth 2 "Machine {k:name} has {:memory}\n" $name 55 54 ${XOP} --depth 1 --close-instance machine
|
/freebsd-current/sys/fs/ext2fs/ |
H A D | ext2_extents.c | 83 ext4_ext_walk_index(struct inode *ip, struct ext4_extent_index *ex, int depth, argument 114 (struct ext4_extent_header *)bp->b_data, depth); 141 ext4_ext_walk_header(struct inode *ip, struct ext4_extent_header *eh, int depth) argument 145 error = ext4_ext_check_header(ip, eh, depth); 150 printf("header %p => (entries %d max %d depth %d gen %d)\n", 158 (struct ext4_extent_index *)(eh + 1 + i), depth - 1, 186 int k, depth, error = 0; local 188 depth = path->ep_depth; 193 for (k = 0; k <= depth && error == 0; k++, path++) { 196 depth 340 ext4_ext_max_entries(struct inode *ip, int depth) argument 403 ext4_validate_extent_entries(struct inode *ip, struct ext4_extent_header *eh, int depth) argument 447 ext4_ext_check_header(struct inode *ip, struct ext4_extent_header *eh, int depth) argument 575 int depth, i; local 607 int error, depth, i, ppos, alloc; local 743 int depth; local 793 int depth = path->ep_depth; local 929 int depth = ext4_ext_inode_depth(ip); local 1147 int depth, i, error; local 1202 int depth, k; local 1241 int depth, len, error, next; local 1404 int error = 0, depth; local 1556 int depth; local 1639 ext4_read_extent_tree_block(struct inode *ip, e4fs_daddr_t pblk, int depth, int flags) argument 1696 int depth; local [all...] |
/freebsd-current/cddl/usr.sbin/dtrace/tests/common/ustack/ |
H A D | Makefile | 10 tst.depth.ksh \
|
/freebsd-current/contrib/xz/src/liblzma/lzma/ |
H A D | lzma_encoder_presets.c | 43 options->depth = depths[level]; 48 options->depth = 0; 56 options->depth = 0; 59 options->depth = 512;
|
/freebsd-current/contrib/llvm-project/compiler-rt/lib/msan/ |
H A D | msan_origin.h | 51 // The "zzz" bits of chained origin id are used to store the length (or depth) 110 int depth = prev.isChainedOrigin() ? prev.depth() : 0; local 111 // depth is the length of the chain minus 1. 112 // origin_history_size of 0 means unlimited depth. 114 if (depth + 1 >= flags()->origin_history_size) { 117 ++depth; 118 CHECK(depth < (1 << kDepthBits)); 137 return Origin((1 << kHeapShift) | (depth << kDepthShift) | chained_id); 157 int depth() cons function [all...] |
/freebsd-current/contrib/libdivsufsort/lib/ |
H A D | sssort.c | 143 saidx_t depth) { 146 for(U1 = T + depth + *p1, 147 U2 = T + depth + *p2, 168 saidx_t *first, saidx_t *last, saidx_t depth) { 174 for(t = *i, j = i + 1; 0 < (r = ss_compare(T, PA + t, PA + *j, depth));) { 292 saidx_t *first, saidx_t *last, saidx_t depth) { 296 for(; (++a < b) && ((PA[*a] + depth) >= (PA[*a + 1] + 1));) { *a = ~*a; } 297 for(; (a < --b) && ((PA[*b] + depth) < (PA[*b + 1] + 1));) { } 312 saidx_t depth) { 326 if(1 < (last - first)) { ss_insertionsort(T, PA, first, last, depth); } 141 ss_compare(const sauchar_t *T, const saidx_t *p1, const saidx_t *p2, saidx_t depth) argument 167 ss_insertionsort(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t depth) argument 291 ss_partition(const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t depth) argument 310 ss_mintrosort(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t depth) argument 502 ss_inplacemerge(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t depth) argument 545 ss_mergeforward(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t *buf, saidx_t depth) argument 595 ss_mergebackward(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t *buf, saidx_t depth) argument 654 ss_swapmerge(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t *buf, saidx_t bufsize, saidx_t depth) argument 747 sssort(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t *buf, saidx_t bufsize, saidx_t depth, saidx_t n, saint_t lastsuffix) argument [all...] |
/freebsd-current/tests/sys/vm/ |
H A D | shared_shadow_inval_test.c | 126 static void child(struct shared_state *ss, int depth); 129 child_fork(struct shared_state *ss, int depth) argument 135 child(ss, depth); 170 child_verify(struct shared_state *ss, int depth, int newval, int oldval) argument 181 depth, foundval, expectval, oldval); 186 child(struct shared_state *ss, int depth) argument 190 if (depth < 1 || depth >= DEPTH) 191 child_errx("Bad depth %d", depth); [all...] |
/freebsd-current/contrib/bc/src/ |
H A D | dc_lex.c | 103 size_t depth, nls, i; local 113 depth = 1; 120 // have "depth", which means we haven't completely balanced brackets 122 for (i = l->i; (c = l->buf[i]) && depth; ++i) 132 depth += (c == '['); 133 depth -= (c == ']'); 139 if (depth) bc_vec_push(&l->str, &c); 142 if (BC_ERR(c == '\0' && depth)) 155 while (got_more && depth); 158 if (BC_ERR(c == '\0' && depth)) [all...] |
/freebsd-current/sbin/hastd/ |
H A D | token.l | 41 int depth; 81 \{ { DP; depth++; return OB; } 82 \} { DP; depth--; return CB; }
|
/freebsd-current/sys/cddl/dev/dtrace/aarch64/ |
H A D | dtrace_isa.c | 64 int depth; local 66 depth = 0; 69 pcstack[depth++] = (pc_t) intrpc; 77 while (depth < pcstack_limit) { 91 pcstack[depth++] = state.pc; 96 for (; depth < pcstack_limit; depth++) { 97 pcstack[depth] = 0; 256 int depth; local 259 depth [all...] |
/freebsd-current/tools/tools/net80211/wlanstats/ |
H A D | Makefile | 12 CFLAGS.clang+= -fbracket-depth=512 -Wno-cast-align
|