Home
last modified time | relevance | path

Searched full:depth (Results 1 – 25 of 1611) sorted by relevance

12345678910>>...65

/freebsd/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)) \
64 rte_panic("LPM: Invalid depth (%u) at line %d", \
65 (unsigned)(depth), __LINE__); \
68 #define VERIFY_DEPTH(depth) argument
72 * Converts a given depth value to its corresponding mask value.
74 * depth (IN) : range = 1 - 32
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()
[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
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) 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,
[all …]
/freebsd/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 …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DGISelKnownBits.cpp39 Align GISelKnownBits::computeKnownAlignment(Register R, unsigned Depth) { in computeKnownAlignment() argument
43 return computeKnownAlignment(MI->getOperand(1).getReg(), Depth); in computeKnownAlignment()
57 return TL.computeKnownAlignForTargetInstr(*this, R, MRI, Depth + 1); in computeKnownAlignment()
78 unsigned Depth) { in getKnownBits() argument
83 computeKnownBitsImpl(R, Known, DemandedElts, Depth); in getKnownBits()
101 dumpResult(const MachineInstr &MI, const KnownBits &Known, unsigned Depth) { in dumpResult() argument
102 dbgs() << "[" << Depth << "] Compute known bits: " << MI << "[" << Depth in dumpResult()
103 << "] Computed for: " << MI << "[" << Depth << "] Known: 0x" in dumpResult()
105 << "[" << Depth << "] Zero: 0x" << toString(Known.Zero, 16, false) in dumpResult()
107 << "[" << Depth << "] One: 0x" << toString(Known.One, 16, false) in dumpResult()
[all …]
/freebsd/contrib/bearssl/T0/
H A DCPU.cs86 * Get the current stack depth (number of elements).
88 internal int Depth { property in CPU
117 * Look at the value at depth 'depth' (0 is top of stack). The
120 internal TValue Peek(int depth) in Peek() argument
122 return stackBuf[stackPtr - depth]; in Peek()
126 * Rotate the stack at depth 'depth': the value at that depth
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()
[all …]
/freebsd/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()
150 printf("header %p => (entries %d max %d depth %d gen %d)\n", 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 in ext4_ext_print_path()
340 ext4_ext_max_entries(struct inode * ip,int depth) ext4_ext_max_entries() argument
404 ext4_validate_extent_entries(struct inode * ip,struct ext4_extent_header * eh,int depth) ext4_validate_extent_entries() argument
448 ext4_ext_check_header(struct inode * ip,struct ext4_extent_header * eh,int depth) ext4_ext_check_header() argument
575 int depth, i; ext4_ext_drop_refs() local
607 int error, depth, i, ppos, alloc; ext4_ext_find_extent() local
743 int depth; ext4_ext_blkpref() local
793 int depth = path->ep_depth; ext4_ext_next_leaf_block() local
929 int depth = ext4_ext_inode_depth(ip); ext4_ext_split() local
1147 int depth, i, error; ext4_ext_create_new_leaf() local
1202 int depth, k; ext4_ext_correct_indexes() local
1241 int depth, len, error, next; ext4_ext_insert_extent() local
1404 int error = 0, depth; ext4_ext_get_blocks() local
1556 int depth; ext4_ext_rm_leaf() local
1640 ext4_read_extent_tree_block(struct inode * ip,e4fs_daddr_t pblk,int depth,int flags) ext4_read_extent_tree_block() argument
1696 int depth; ext4_ext_remove_space() local
[all...]
/freebsd/sys/ddb/
H A Ddb_pprint.c44 u_int depth);
54 db_pprint_int(db_addr_t addr, struct ctf_type_v3 *type, u_int depth) in db_pprint_int() argument
80 * Pretty-prints a struct. Nested structs are pretty-printed up 'depth' nested
84 db_pprint_struct(db_addr_t addr, struct ctf_type_v3 *type, u_int depth) in db_pprint_struct() argument
104 if (depth > max_depth) { in db_pprint_struct()
123 db_indent = depth; in db_pprint_struct()
130 db_pprint_type(maddr, mtype, depth + 1); in db_pprint_struct()
146 db_indent = depth; in db_pprint_struct()
153 db_pprint_type(maddr, mtype, depth + 1); in db_pprint_struct()
157 db_indent = depth - 1; in db_pprint_struct()
[all …]
/freebsd/sys/contrib/device-tree/Bindings/net/can/
H A Dxilinx,can.yaml37 tx-fifo-depth:
39 description: CAN Tx fifo depth (Zynq, Axi CAN).
41 rx-fifo-depth:
43 description: CAN Rx fifo depth (Zynq, Axi CAN, CAN FD in sequential Rx mode)
81 - tx-fifo-depth
82 - rx-fifo-depth
98 - tx-fifo-depth
99 - rx-fifo-depth
117 - rx-fifo-depth
130 tx-fifo-depth = <0x40>;
[all …]
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>;
/freebsd/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 …]
/freebsd/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 …]
/freebsd/contrib/llvm-project/clang/include/clang/Sema/
H A DTemplate.h74 /// list will contain a template argument list (int) at depth 0 and a
75 /// template argument list (17) at depth 1.
77 /// The template argument list at a certain template depth
133 // Determine the number of substituted args at 'Depth'.
134 unsigned getNumSubsitutedArgs(unsigned Depth) const { in getNumSubsitutedArgs() argument
135 assert(NumRetainedOuterLevels <= Depth && Depth < getNumLevels()); in getNumSubsitutedArgs()
136 return TemplateArgumentLists[getNumLevels() - Depth - 1].Args.size(); in getNumSubsitutedArgs()
153 /// Retrieve the template argument at a given depth and index.
154 const TemplateArgument &operator()(unsigned Depth, unsigned Index) const { in operator()
155 assert(NumRetainedOuterLevels <= Depth && Depth < getNumLevels()); in operator()
[all …]
/freebsd/tests/sys/vm/
H A Dshared_shadow_inval_test.c80 #define DEPTH 5 macro
96 volatile bool exiting[DEPTH];
126 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()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DScoreboardHazardRecognizer.h45 size_t Depth = 0; variable
58 size_t getDepth() const { return Depth; } in getDepth()
61 // Depth is expected to be a power-of-2.
62 assert(Depth && !(Depth & (Depth - 1)) &&
65 return Data[(Head + idx) & (Depth-1)];
70 Depth = d;
71 Data = new InstrStage::FuncUnits[Depth];
74 memset(Data, 0, Depth * sizeof(Data[0]));
79 Head = (Head + 1) & (Depth-1); in advance()
83 Head = (Head - 1) & (Depth-1); in recede()
/freebsd/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
221 * With respect to the parent, the depth of the next subnode will be in fdt_next_subnode()
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_user/zfs_list/
H A Dzfs_list_008_neg.ksh36 # A negative depth or a non numeric depth should fail in 'zfs list -d <n>'
39 # 1. Run zfs list -d with negative depth or non numeric depth
45 log_assert "A negative depth or a non numeric depth should fail in 'zfs list -d <n>'"
56 log_pass "A negative depth or a non numeric depth should fail in 'zfs list -d <n>'"
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DValueTracking.cpp151 KnownBits &Known, unsigned Depth,
154 void llvm::computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth, in computeKnownBits() argument
162 ::computeKnownBits(V, DemandedElts, Known, Depth, Q); in computeKnownBits()
166 const DataLayout &DL, unsigned Depth, in computeKnownBits() argument
170 V, Known, Depth, in computeKnownBits()
175 unsigned Depth, AssumptionCache *AC, in computeKnownBits() argument
179 V, Depth, SimplifyQuery(DL, DT, AC, safeCxtI(V, CxtI), UseInstrInfo)); in computeKnownBits()
183 const DataLayout &DL, unsigned Depth, in computeKnownBits() argument
187 V, DemandedElts, Depth, in computeKnownBits()
269 static bool isKnownToBeAPowerOfTwo(const Value *V, bool OrZero, unsigned Depth,
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/
H A Dmodsi3.S36 * $1 -- the current depth, 1<=$1<=4
38 * 4 -- max depth
163 !depth 1, accumulated bits 0
168 !depth 2, accumulated bits 1
173 !depth 3, accumulated bits 3
178 !depth 4, accumulated bits 7
193 !depth 4, accumulated bits 5
208 !depth 3, accumulated bits 1
213 !depth 4, accumulated bits 3
228 !depth 4, accumulated bits 1
[all …]
H A Ddivsi3.S36 * $1 -- the current depth, 1<=$1<=4
38 * 4 -- max depth
163 !depth 1, accumulated bits 0
168 !depth 2, accumulated bits 1
173 !depth 3, accumulated bits 3
178 !depth 4, accumulated bits 7
193 !depth 4, accumulated bits 5
208 !depth 3, accumulated bits 1
213 !depth 4, accumulated bits 3
228 !depth 4, accumulated bits 1
[all …]
/freebsd/crypto/openssl/doc/man3/
H A DSSL_CTX_set_verify.pod24 void SSL_CTX_set_verify_depth(SSL_CTX *ctx, int depth);
25 void SSL_set_verify_depth(SSL *ssl, int depth);
60 callback (e.g., at a lower depth, or for a separate error condition) returns 0.
62 SSL_CTX_set_verify_depth() sets the maximum B<depth> for the certificate chain
65 SSL_set_verify_depth() sets the maximum B<depth> for the certificate chain
155 application provided procedure also has access to the verify depth information
162 end-entity nor the trust-anchor certificates count against B<depth>. If the
163 certificate chain needed to reach a trusted issuer is longer than B<depth+2>,
165 The depth count is "level 0:peer certificate", "level 1: CA certificate",
167 depth t
[all...]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_root/zfs_get/
H A Dzfs_get_010_neg.ksh37 # A negative depth or a non numeric depth should fail in 'zfs get -d <n>'
40 # 1. Run zfs get -d with negative depth or non numeric depth
46 log_assert "A negative depth or a non numeric depth should fail in 'zfs get -d <n>'"
57 log_pass "A negative depth or a non numeric depth should fail in 'zfs get -d <n>'"
/freebsd/usr.sbin/camdd/
H A Dcamdd.8166 .It depth=N
167 Specify a desired queue depth for the input or output path.
174 The queue depth is maintained on a best effort basis, and may not be
176 For writes, maintaining the queue depth also depends on a sufficiently
244 .Dl camdd -i pass=da8,bs=512k,depth=4 -o pass=da3,bs=512k,depth=4
247 and attempt to maintain a queue depth of 4 on both the input and output
251 .Dl camdd -i file=/dev/zero,bs=1M -o pass=da5,bs=1M,depth=4 -m 100M
254 desired queue depth of 4.
257 .Dl camdd -i pass=da8,bs=1M,depth=3 -o file=disk.img
259 Copy disk da8 using a 1MB blocksize and desired queue depth of 3 to the
[all …]
/freebsd/sys/contrib/device-tree/Bindings/spi/
H A Dspi-controller.yaml72 fifo-depth:
77 rx-fifo-depth:
82 tx-fifo-depth:
135 rx-fifo-depth: [ tx-fifo-depth ]
136 tx-fifo-depth: [ rx-fifo-depth ]
153 - fifo-depth
154 - rx-fifo-depth
157 - fifo-depth
158 - tx-fifo-depth
/freebsd/sys/contrib/device-tree/Bindings/net/
H A Daltr,tse.yaml28 rx-fifo-depth:
31 Depth in bytes of the RX FIFO
33 tx-fifo-depth:
36 Depth in bytes of the TX FIFO
65 - rx-fifo-depth
66 - tx-fifo-depth
127 rx-fifo-depth = <2048>;
128 tx-fifo-depth = <2048>;
150 rx-fifo-depth = <2048>;
151 tx-fifo-depth = <2048>;
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineSimplifyDemanded.cpp91 KnownBits &Known, unsigned Depth, in SimplifyDemandedBits() argument
96 llvm::computeKnownBits(V, Known, Depth, Q); in SimplifyDemandedBits()
107 if (Depth == MaxAnalysisRecursionDepth) in SimplifyDemandedBits()
112 llvm::computeKnownBits(V, Known, Depth, Q); in SimplifyDemandedBits()
119 NewVal = SimplifyDemandedUseBits(VInst, DemandedMask, Known, Depth, Q); in SimplifyDemandedBits()
124 SimplifyMultipleUseDemandedBits(VInst, DemandedMask, Known, Depth, Q); in SimplifyDemandedBits()
160 unsigned Depth, in SimplifyDemandedUseBits() argument
163 assert(Depth <= MaxAnalysisRecursionDepth && "Limit Search Depth"); in SimplifyDemandedUseBits()
195 SimplifyDemandedBits(I, 0, DemandedFromOps, LHSKnown, Depth + 1, Q) || in SimplifyDemandedUseBits()
197 SimplifyDemandedBits(I, 1, DemandedFromOps, RHSKnown, Depth + 1, Q)) { in SimplifyDemandedUseBits()
[all …]

12345678910>>...65