Home
last modified time | relevance | path

Searched refs:depth (Results 1 – 25 of 763) sorted by relevance

12345678910>>...31

/src/sys/contrib/dpdk_rte_lpm/
H A Drte_lpm.c62 #define VERIFY_DEPTH(depth) do { \ argument
63 if ((depth == 0) || (depth > RTE_LPM_MAX_DEPTH)) \
65 (unsigned)(depth), __LINE__); \
68 #define VERIFY_DEPTH(depth) argument
78 depth_to_mask(uint8_t depth) in depth_to_mask() argument
80 VERIFY_DEPTH(depth); in depth_to_mask()
85 return (int)0x80000000 >> (depth - 1); in depth_to_mask()
92 depth_to_range(uint8_t depth) in depth_to_range() argument
94 VERIFY_DEPTH(depth); in depth_to_range()
99 if (depth <= MAX_DEPTH_TBL24) in depth_to_range()
[all …]
H A Drte_lpm6.c57 uint32_t depth :8; /**< Rule depth. */ member
69 uint8_t depth; /**< Rule depth. */ member
75 uint8_t depth; /**< Rule depth. */ member
118 ip6_mask_addr(uint8_t *ip, uint8_t depth) in ip6_mask_addr() argument
123 part_depth = depth; in ip6_mask_addr()
217 rule_key_init(struct rte_lpm6_rule_key *key, uint8_t *ip, uint8_t depth)
220 key->depth = depth;
235 rte_lpm6_add(lpm, rule_key->ip, rule_key->depth,
471 rule_find(struct rte_lpm6 *lpm, uint8_t *ip, uint8_t depth,
477 rule_key_init(&rule_key, ip, depth);
[all …]
/src/sys/fs/ext2fs/
H A Dext2_extents.c83 ext4_ext_walk_index(struct inode *ip, struct ext4_extent_index *ex, int depth, in ext4_ext_walk_index() argument
114 (struct ext4_extent_header *)bp->b_data, depth); in ext4_ext_walk_index()
141 ext4_ext_walk_header(struct inode *ip, struct ext4_extent_header *eh, int depth) in ext4_ext_walk_header() argument
145 error = ext4_ext_check_header(ip, eh, depth); in ext4_ext_walk_header()
158 (struct ext4_extent_index *)(eh + 1 + i), depth - 1, in ext4_ext_walk_header()
186 int k, depth, error = 0; in ext4_ext_print_path() local
188 depth = path->ep_depth; in ext4_ext_print_path()
193 for (k = 0; k <= depth && error == 0; k++, path++) { in ext4_ext_print_path()
196 depth - 1, false); in ext4_ext_print_path()
340 ext4_ext_max_entries(struct inode *ip, int depth) in ext4_ext_max_entries() argument
[all …]
/src/sys/kern/
H A Dsubr_stack.c71 if (st->depth < STACK_MAX) { in stack_put()
72 st->pcs[st->depth++] = pc; in stack_put()
99 KASSERT(st->depth <= STACK_MAX, ("bogus stack")); in stack_print()
100 for (i = 0; i < st->depth; i++) { in stack_print()
115 KASSERT(st->depth <= STACK_MAX, ("bogus stack")); in stack_print_short()
116 for (i = 0; i < st->depth; i++) { in stack_print_short()
135 KASSERT(st->depth <= STACK_MAX, ("bogus stack")); in stack_print_ddb()
136 for (i = 0; i < st->depth; i++) { in stack_print_ddb()
151 KASSERT(st->depth <= STACK_MAX, ("bogus stack")); in stack_print_short_ddb()
152 for (i = 0; i < st->depth; i++) { in stack_print_short_ddb()
[all …]
/src/contrib/unifdef/tests/
H A Drecursive.experr24 unifdef: process line 1 PLAIN -> OUTSIDE depth 0
26 unifdef: process line 2 PLAIN -> OUTSIDE depth 0
28 unifdef: process line 3 PLAIN -> OUTSIDE depth 0
30 unifdef: process line 4 PLAIN -> OUTSIDE depth 0
32 unifdef: process line 5 PLAIN -> OUTSIDE depth 0
34 unifdef: process line 6 PLAIN -> OUTSIDE depth 0
36 unifdef: process line 7 PLAIN -> OUTSIDE depth 0
53 unifdef: process line 8 IF -> PASS_MIDDLE depth 1
55 unifdef: process line 9 PLAIN -> PASS_MIDDLE depth 1
57 unifdef: process line 10 ELSE -> PASS_ELSE depth 1
[all …]
/src/sys/ddb/
H A Ddb_pprint.c43 u_int depth);
53 db_pprint_int(db_addr_t addr, struct ctf_type_v3 *type, u_int depth) in db_pprint_int() argument
83 db_pprint_struct(db_addr_t addr, struct ctf_type_v3 *type, u_int depth) in db_pprint_struct() argument
103 if (depth > max_depth) { in db_pprint_struct()
122 db_indent = depth; in db_pprint_struct()
129 db_pprint_type(maddr, mtype, depth + 1); in db_pprint_struct()
145 db_indent = depth; in db_pprint_struct()
152 db_pprint_type(maddr, mtype, depth + 1); in db_pprint_struct()
156 db_indent = depth - 1; in db_pprint_struct()
165 db_pprint_arr(db_addr_t addr, struct ctf_type_v3 *type, u_int depth) in db_pprint_arr() argument
[all …]
/src/contrib/bearssl/T0/
H A DCPU.cs120 internal TValue Peek(int depth) in Peek() argument
122 return stackBuf[stackPtr - depth]; in Peek()
129 internal void Rot(int depth) in Rot() argument
131 TValue v = stackBuf[stackPtr - depth]; in Rot()
132 Array.Copy(stackBuf, stackPtr - (depth - 1), in Rot()
133 stackBuf, stackPtr - depth, depth); in Rot()
141 internal void NRot(int depth) in NRot() argument
144 Array.Copy(stackBuf, stackPtr - depth, in NRot()
145 stackBuf, stackPtr - (depth - 1), depth); in NRot()
146 stackBuf[stackPtr - depth] = v; in NRot()
/src/contrib/libdivsufsort/lib/
H A Dsssort.c143 saidx_t depth) { in ss_compare() argument
146 for(U1 = T + depth + *p1, in ss_compare()
147 U2 = T + depth + *p2, in ss_compare()
168 saidx_t *first, saidx_t *last, saidx_t depth) { in ss_insertionsort() argument
174 for(t = *i, j = i + 1; 0 < (r = ss_compare(T, PA + t, PA + *j, depth));) { in ss_insertionsort()
292 saidx_t *first, saidx_t *last, saidx_t depth) { in ss_partition() argument
296 for(; (++a < b) && ((PA[*a] + depth) >= (PA[*a + 1] + 1));) { *a = ~*a; } in ss_partition()
297 for(; (a < --b) && ((PA[*b] + depth) < (PA[*b + 1] + 1));) { } in ss_partition()
312 saidx_t depth) { in ss_mintrosort() argument
326 if(1 < (last - first)) { ss_insertionsort(T, PA, first, last, depth); } in ss_mintrosort()
[all …]
/src/tests/sys/vm/
H A Dshared_shadow_inval_test.c126 static void child(struct shared_state *ss, int depth);
129 child_fork(struct shared_state *ss, int depth) in child_fork() argument
135 child(ss, depth); in child_fork()
170 child_verify(struct shared_state *ss, int depth, int newval, int oldval) in child_verify() argument
181 depth, foundval, expectval, oldval); in child_verify()
186 child(struct shared_state *ss, int depth) in child() argument
190 if (depth < 1 || depth >= DEPTH) in child()
191 child_errx("Bad depth %d", depth); in child()
193 dprintf("P%d (pid %d) started\n", depth, mypid); in child()
194 switch (depth) { in child()
[all …]
/src/sys/contrib/libfdt/
H A Dfdt.c165 int fdt_next_node(const void *fdt, int offset, int *depth) in fdt_next_node() argument
184 if (depth) in fdt_next_node()
185 (*depth)++; in fdt_next_node()
189 if (depth && ((--(*depth)) < 0)) in fdt_next_node()
195 || ((nextoffset == -FDT_ERR_TRUNCATED) && !depth)) in fdt_next_node()
207 int depth = 0; in fdt_first_subnode() local
209 offset = fdt_next_node(fdt, offset, &depth); in fdt_first_subnode()
210 if (offset < 0 || depth != 1) in fdt_first_subnode()
218 int depth = 1; in fdt_next_subnode() local
225 offset = fdt_next_node(fdt, offset, &depth); in fdt_next_subnode()
[all …]
/src/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_root/zfs_mount/
H A Dzfs_mount_006_pos.ksh89 typeset -i depth=0
92 while (( depth < MAXDEPTH )); do
93 mtpt=$mtpt/$depth
94 (( depth = depth + 1))
114 while [[ $depth -gt 0 ]] ; do
115 (( depth == MAXDEPTH )) && \
139 (( depth == MAXDEPTH )) && \
143 (( depth = depth - 1 ))
/src/tests/sys/cddl/zfs/tests/cli_root/zfs_mount/
H A Dzfs_mount_006_pos.ksh91 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 ))
/src/sys/contrib/dev/broadcom/brcm80211/brcmfmac/
H A Dcommonring.c31 void brcmf_commonring_config(struct brcmf_commonring *commonring, u16 depth, in brcmf_commonring_config() argument
34 commonring->depth = depth; in brcmf_commonring_config()
75 available = commonring->depth - commonring->w_ptr + in brcmf_commonring_write_available()
83 if (available > commonring->depth / 8) { in brcmf_commonring_write_available()
116 available = commonring->depth - commonring->w_ptr + in brcmf_commonring_reserve_for_write()
130 if (commonring->w_ptr == commonring->depth) in brcmf_commonring_reserve_for_write()
157 available = commonring->depth - commonring->w_ptr + in brcmf_commonring_reserve_for_write_multiple()
171 if (*alloced + commonring->w_ptr > commonring->depth) in brcmf_commonring_reserve_for_write_multiple()
172 *alloced = commonring->depth - commonring->w_ptr; in brcmf_commonring_reserve_for_write_multiple()
174 if (commonring->w_ptr == commonring->depth) in brcmf_commonring_reserve_for_write_multiple()
[all …]
/src/sys/cddl/dev/dtrace/arm/
H A Ddtrace_isa.c64 int depth = 0; in dtrace_getpcstack() local
67 pcstack[depth++] = (pc_t) intrpc; in dtrace_getpcstack()
78 while (depth < pcstack_limit) { in dtrace_getpcstack()
91 pcstack[depth++] = state.registers[PC]; in dtrace_getpcstack()
98 for (; depth < pcstack_limit; depth++) { in dtrace_getpcstack()
99 pcstack[depth] = 0; in dtrace_getpcstack()
138 int depth = 1; in dtrace_getstackdepth() local
149 depth++; in dtrace_getstackdepth()
152 if (depth < aframes) in dtrace_getstackdepth()
155 return depth - aframes; in dtrace_getstackdepth()
/src/sys/contrib/device-tree/Bindings/net/can/
H A Dxilinx_can.txt19 - tx-fifo-depth : Can Tx fifo depth (Zynq, Axi CAN).
20 - rx-fifo-depth : Can Rx fifo depth (Zynq, Axi CAN, CAN FD in
37 tx-fifo-depth = <0x40>;
38 rx-fifo-depth = <0x40>;
48 tx-fifo-depth = <0x40>;
49 rx-fifo-depth = <0x40>;
60 rx-fifo-depth = <0x20>;
/src/contrib/llvm-project/compiler-rt/lib/dfsan/
H A Ddfsan_origin.h74 int depth = prev.isChainedOrigin() ? prev.depth() : -1; in CreateChainedOrigin() local
78 ++depth; in CreateChainedOrigin()
79 if (depth >= flags().origin_history_size || depth > kMaxDepth) in CreateChainedOrigin()
101 return Origin((depth << kDepthShift) | chained_id); in CreateChainedOrigin()
116 int depth() const { in depth() function
/src/contrib/bc/src/
H A Ddc_lex.c103 size_t depth, nls, i; in dc_lex_string() local
113 depth = 1; in dc_lex_string()
124 for (i = l->i; (c = l->buf[i]) && depth; ++i) in dc_lex_string()
134 depth += (c == '['); in dc_lex_string()
135 depth -= (c == ']'); in dc_lex_string()
141 if (depth) bc_vec_push(&l->str, &c); in dc_lex_string()
144 if (BC_ERR(c == '\0' && depth)) in dc_lex_string()
157 while (got_more && depth); in dc_lex_string()
160 if (BC_ERR(c == '\0' && depth)) in dc_lex_string()
/src/sys/cddl/dev/dtrace/aarch64/
H A Ddtrace_isa.c67 int depth; in dtrace_getpcstack() local
69 depth = 0; in dtrace_getpcstack()
72 pcstack[depth++] = (pc_t) intrpc; in dtrace_getpcstack()
80 while (depth < pcstack_limit) { in dtrace_getpcstack()
94 pcstack[depth++] = state.pc; in dtrace_getpcstack()
99 for (; depth < pcstack_limit; depth++) { in dtrace_getpcstack()
100 pcstack[depth] = 0; in dtrace_getpcstack()
294 int depth; in dtrace_getstackdepth() local
297 depth = 1; in dtrace_getstackdepth()
307 depth++; in dtrace_getstackdepth()
[all …]
/src/sys/cddl/dev/dtrace/riscv/
H A Ddtrace_isa.c77 int depth; in dtrace_getpcstack() local
79 depth = 0; in dtrace_getpcstack()
83 pcstack[depth++] = (pc_t)intrpc; in dtrace_getpcstack()
96 while (depth < pcstack_limit) { in dtrace_getpcstack()
114 pcstack[depth++] = caller; in dtrace_getpcstack()
116 pcstack[depth++] = state.pc; in dtrace_getpcstack()
120 for (; depth < pcstack_limit; depth++) { in dtrace_getpcstack()
121 pcstack[depth] = 0; in dtrace_getpcstack()
293 int depth; in dtrace_getstackdepth() local
296 depth = 1; in dtrace_getstackdepth()
[all …]
/src/contrib/ofed/libbnxtre/
H A Dmemory.h70 uint32_t depth; /* no of entries */ member
113 if (idx >= que->depth) in bnxt_re_get_hwqe()
114 idx -= que->depth; in bnxt_re_get_hwqe()
132 avail += que->depth; in bnxt_re_is_que_full()
144 if (que->tail >= que->depth) { in bnxt_re_incr_tail()
145 que->tail %= que->depth; in bnxt_re_incr_tail()
154 if (que->head >= que->depth) { in bnxt_re_incr_head()
155 que->head %= que->depth; in bnxt_re_incr_head()
/src/contrib/openbsm/bin/auditdistd/
H A Dparse.y52 extern int depth;
128 PJDLOG_RASSERT(depth == 0,
149 PJDLOG_RASSERT(depth == 0,
175 PJDLOG_ASSERT(depth == 0);
183 PJDLOG_ASSERT(depth == 0);
220 PJDLOG_ASSERT(depth == 1);
257 PJDLOG_ASSERT(depth == 0);
325 PJDLOG_ASSERT(depth == 1);
407 switch (depth) {
456 switch (depth) {
[all …]
/src/contrib/libxo/tests/xo/
H A Dxo_02.sh27 ${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
/src/contrib/llvm-project/compiler-rt/lib/msan/
H A Dmsan_origin.h110 int depth = prev.isChainedOrigin() ? prev.depth() : 0; in CreateChainedOrigin() local
114 if (depth + 1 >= flags()->origin_history_size) { in CreateChainedOrigin()
117 ++depth; in CreateChainedOrigin()
118 CHECK(depth < (1 << kDepthBits)); in CreateChainedOrigin()
137 return Origin((1 << kHeapShift) | (depth << kDepthShift) | chained_id); in CreateChainedOrigin()
157 int depth() const { in depth() function
/src/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_affinity.h867 int depth; variable
1014 KMP_DEBUG_ASSERT(level1 >= 0 && level1 < depth); in calculate_ratio()
1015 KMP_DEBUG_ASSERT(level2 >= 0 && level2 < depth); in calculate_ratio()
1022 KMP_DEBUG_ASSERT(level >= 0 && level < depth); in get_ratio()
1025 int get_depth() const { return depth; }; in get_depth()
1027 KMP_DEBUG_ASSERT(level >= 0 && level < depth); in get_type()
1035 for (int i = 0; i < depth; ++i) in get_level()
1041 KMP_DEBUG_ASSERT(level >= 0 && level < depth); in get_count()
1083 int depth;
1112 retval->depth = 0; in allocate()
[all …]
/src/contrib/llvm-project/llvm/lib/Analysis/
H A DRegionPrinter.cpp90 unsigned depth = 0) { in printRegionCluster()
92 O.indent(2 * depth) << "subgraph cluster_" << static_cast<const void*>(&R) in printRegionCluster()
94 O.indent(2 * (depth + 1)) << "label = \"\";\n"; in printRegionCluster()
97 O.indent(2 * (depth + 1)) << "style = filled;\n"; in printRegionCluster()
98 O.indent(2 * (depth + 1)) << "color = " in printRegionCluster()
102 O.indent(2 * (depth + 1)) << "style = solid;\n"; in printRegionCluster()
103 O.indent(2 * (depth + 1)) << "color = " in printRegionCluster()
108 printRegionCluster(*RI, GW, depth + 1); in printRegionCluster()
114 O.indent(2 * (depth + 1)) << "Node" in printRegionCluster()
118 O.indent(2 * depth) << "}\n"; in printRegionCluster()

12345678910>>...31