Depth (full) in projects: freebsd-src - OpenGrok search results

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

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

12 3 4 5 6 7 8 9 10 >>...65

/freebsd-src/sys/contrib/dpdk_rte_lpm/
H A D	rte_lpm.c	62 #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 D	rte_lpm6.c	57 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-src/contrib/unifdef/tests/
H A D	recursive.experr	24 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-src/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A D	GISelKnownBits.cpp	39 Align GISelKnownBits::computeKnownAlignment(Register R, unsigned Depth) { in computeKnownAlignment() 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() 83 computeKnownBitsImpl(R, Known, DemandedElts, Depth); in signBitIsZero() 101 dumpResult(const MachineInstr &MI, const KnownBits &Known, unsigned Depth) { in dumpResult() 102 dbgs() << "[" << Depth << "] Compute known bits: " << MI << "[" << Depth in dumpResult() 103 << "] Computed for: " << MI << "[" << Depth << "] Known: 0x" in dumpResult() 105 << "[" << Depth << "] Zer in dumpResult() 37 computeKnownAlignment(Register R,unsigned Depth) computeKnownAlignment() argument 73 getKnownBits(Register R,const APInt & DemandedElts,unsigned Depth) getKnownBits() argument 96 dumpResult(const MachineInstr & MI,const KnownBits & Known,unsigned Depth) dumpResult() argument 110 computeKnownBitsMin(Register Src0,Register Src1,KnownBits & Known,const APInt & DemandedElts,unsigned Depth) computeKnownBitsMin() argument 141 computeKnownBitsImpl(Register R,KnownBits & Known,const APInt & DemandedElts,unsigned Depth) computeKnownBitsImpl() argument 603 computeNumSignBitsMin(Register Src0,Register Src1,const APInt & DemandedElts,unsigned Depth) computeNumSignBitsMin() argument 613 computeNumSignBits(Register R,const APInt & DemandedElts,unsigned Depth) computeNumSignBits() argument 762 computeNumSignBits(Register R,unsigned Depth) computeNumSignBits() argument [all...]
/freebsd-src/contrib/bearssl/T0/
H A D	CPU.cs	86 * 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-src/sys/fs/ext2fs/
H A D	ext2_extents.c	83 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 - 1, false); in ext4_ext_print_path() [all …]
/freebsd-src/sys/ddb/
H A D	db_pprint.c	44 u_int depth); 54 db_pprint_int(db_addr_t addr, struct ctf_type_v3 type, u_int depth) in db_pprint_int() 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() 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 in db_pprint_struct() 53 db_pprint_int(db_addr_t addr,struct ctf_type_v3 type,u_int depth) db_pprint_int() argument 83 db_pprint_struct(db_addr_t addr,struct ctf_type_v3 * type,u_int depth) db_pprint_struct() argument 165 db_pprint_arr(db_addr_t addr,struct ctf_type_v3 * type,u_int depth) db_pprint_arr() argument 206 db_pprint_enum(db_addr_t addr,struct ctf_type_v3 * type,u_int depth) db_pprint_enum() argument 245 db_pprint_ptr(db_addr_t addr,struct ctf_type_v3 * type,u_int depth) db_pprint_ptr() argument 287 db_pprint_type(db_addr_t addr,struct ctf_type_v3 * type,u_int depth) db_pprint_type() argument [all...]
/freebsd-src/sys/contrib/device-tree/Bindings/net/can/
H A D	xilinx,can.yaml	`37 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 [all...]`
H A D	xilinx_can.txt	`19 - 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-src/sys/kern/
H A D	subr_stack.c	71 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-src/contrib/llvm-project/clang/include/clang/Sema/
H A D	Template.h	74 /// 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, unsigne 164 getAssociatedDecl(unsigned Depth) getAssociatedDecl() argument 175 hasTemplateArgument(unsigned Depth,unsigned Index) hasTemplateArgument() argument 197 setArgument(unsigned Depth,unsigned Index,TemplateArgument Arg) setArgument() argument 286 for (unsigned Depth = NumRetainedOuterLevels; Depth < getNumLevels(); dump() local [all...]
/freebsd-src/contrib/libdivsufsort/lib/
H A D	sssort.c	143 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-src/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A D	ScoreboardHazardRecognizer.h	`45 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-src/tests/sys/vm/
H A D	shared_shadow_inval_test.c	80 #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-src/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_user/zfs_list/
H A D	zfs_list_008_neg.ksh	`36 # 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-src/contrib/llvm-project/llvm/lib/Analysis/
H A D	ValueTracking.cpp	151 KnownBits &Known, unsigned Depth, 154 void llvm::computeKnownBits(const Value V, KnownBits &Known, unsigned Depth, in computeKnownBits() 162 ::computeKnownBits(V, DemandedElts, Known, Depth, Q); in computeKnownBits() 166 const DataLayout &DL, unsigned Depth, in computeKnownBits() 170 V, Known, Depth, in computeKnownBits() 175 unsigned Depth, AssumptionCache AC, in computeKnownBits() 179 V, Depth, SimplifyQuery(DL, DT, AC, safeCxtI(V, CxtI), UseInstrInfo)); in computeKnownBits() 183 const DataLayout &DL, unsigned Depth, in computeKnownBits() 187 V, DemandedElts, Depth, in computeKnownBits() 269 static bool isKnownToBeAPowerOfTwo(const Value V, bool OrZero, unsigned Depth, in isKnownToBeAPowerOfTwo() 153 computeKnownBits(const Value V,KnownBits & Known,unsigned Depth,const SimplifyQuery & Q) computeKnownBits() argument 165 computeKnownBits(const Value * V,KnownBits & Known,const DataLayout & DL,unsigned Depth,AssumptionCache * AC,const Instruction * CxtI,const DominatorTree * DT,bool UseInstrInfo) computeKnownBits() argument 174 computeKnownBits(const Value * V,const DataLayout & DL,unsigned Depth,AssumptionCache * AC,const Instruction * CxtI,const DominatorTree * DT,bool UseInstrInfo) computeKnownBits() argument 182 computeKnownBits(const Value * V,const APInt & DemandedElts,const DataLayout & DL,unsigned Depth,AssumptionCache * AC,const Instruction * CxtI,const DominatorTree * DT,bool UseInstrInfo) computeKnownBits() argument 265 isKnownToBeAPowerOfTwo(const Value * V,const DataLayout & DL,bool OrZero,unsigned Depth,AssumptionCache * AC,const Instruction * CxtI,const DominatorTree * DT,bool UseInstrInfo) isKnownToBeAPowerOfTwo() argument 279 isKnownNonZero(const Value * V,const DataLayout & DL,unsigned Depth,AssumptionCache * AC,const Instruction * CxtI,const DominatorTree * DT,bool UseInstrInfo) isKnownNonZero() argument 287 isKnownNonNegative(const Value * V,const SimplifyQuery & SQ,unsigned Depth) isKnownNonNegative() argument 292 isKnownPositive(const Value * V,const SimplifyQuery & SQ,unsigned Depth) isKnownPositive() argument 302 isKnownNegative(const Value * V,const SimplifyQuery & SQ,unsigned Depth) isKnownNegative() argument 319 MaskedValueIsZero(const Value * V,const APInt & Mask,const SimplifyQuery & SQ,unsigned Depth) MaskedValueIsZero() argument 328 ComputeNumSignBits(const Value * V,unsigned Depth,const SimplifyQuery & Q) ComputeNumSignBits() argument 337 ComputeNumSignBits(const Value * V,const DataLayout & DL,unsigned Depth,AssumptionCache * AC,const Instruction * CxtI,const DominatorTree * DT,bool UseInstrInfo) ComputeNumSignBits() argument 345 ComputeMaxSignificantBits(const Value * V,const DataLayout & DL,unsigned Depth,AssumptionCache * AC,const Instruction * CxtI,const DominatorTree * DT) ComputeMaxSignificantBits() argument 355 computeKnownBitsAddSub(bool Add,const Value * Op0,const Value * Op1,bool NSW,const APInt & DemandedElts,KnownBits & KnownOut,KnownBits & Known2,unsigned Depth,const SimplifyQuery & Q) computeKnownBitsAddSub() argument 369 computeKnownBitsMul(const Value * Op0,const Value * Op1,bool NSW,const APInt & DemandedElts,KnownBits & Known,KnownBits & Known2,unsigned Depth,const SimplifyQuery & Q) computeKnownBitsMul() argument 710 computeKnownBitsFromContext(const Value * V,KnownBits & Known,unsigned Depth,const SimplifyQuery & Q) computeKnownBitsFromContext() argument 817 computeKnownBitsFromShiftOperator(const Operator * I,const APInt & DemandedElts,KnownBits & Known,KnownBits & Known2,unsigned Depth,const SimplifyQuery & Q,function_ref<KnownBits (const KnownBits &,const KnownBits &,bool)> KF) computeKnownBitsFromShiftOperator() argument 833 getKnownBitsFromAndXorOr(const Operator * I,const APInt & DemandedElts,const KnownBits & KnownLHS,const KnownBits & KnownRHS,unsigned Depth,const SimplifyQuery & Q) getKnownBitsFromAndXorOr() argument 905 analyzeKnownBitsFromAndXorOr(const Operator * I,const KnownBits & KnownLHS,const KnownBits & KnownRHS,unsigned Depth,const SimplifyQuery & SQ) analyzeKnownBitsFromAndXorOr() argument 936 computeKnownBitsFromOperator(const Operator * I,const APInt & DemandedElts,KnownBits & Known,unsigned Depth,const SimplifyQuery & Q) computeKnownBitsFromOperator() argument 1703 computeKnownBits(const Value * V,const APInt & DemandedElts,unsigned Depth,const SimplifyQuery & Q) computeKnownBits() argument 1711 computeKnownBits(const Value * V,unsigned Depth,const SimplifyQuery & Q) computeKnownBits() argument 1734 computeKnownBits(const Value * V,const APInt & DemandedElts,KnownBits & Known,unsigned Depth,const SimplifyQuery & Q) computeKnownBits() argument 1874 isPowerOfTwoRecurrence(const PHINode * PN,bool OrZero,unsigned Depth,SimplifyQuery & Q) isPowerOfTwoRecurrence() argument 1932 isKnownToBeAPowerOfTwo(const Value * V,bool OrZero,unsigned Depth,const SimplifyQuery & Q) isKnownToBeAPowerOfTwo() argument 2097 isGEPKnownNonNull(const GEPOperator * GEP,unsigned Depth,const SimplifyQuery & Q) isGEPKnownNonNull() argument 2300 isNonZeroAdd(const APInt & DemandedElts,unsigned Depth,const SimplifyQuery & Q,unsigned BitWidth,Value * X,Value * Y,bool NSW) isNonZeroAdd() argument 2339 isNonZeroSub(const APInt & DemandedElts,unsigned Depth,const SimplifyQuery & Q,unsigned BitWidth,Value * X,Value * Y) isNonZeroSub() argument 2351 isNonZeroShift(const Operator * I,const APInt & DemandedElts,unsigned Depth,const SimplifyQuery & Q,const KnownBits & KnownVal) isNonZeroShift() argument 2403 isKnownNonZeroFromOperator(const Operator * I,const APInt & DemandedElts,unsigned Depth,const SimplifyQuery & Q) isKnownNonZeroFromOperator() argument 2762 isKnownNonZero(const Value * V,const APInt & DemandedElts,unsigned Depth,const SimplifyQuery & Q) isKnownNonZero() argument 2858 isKnownNonZero(const Value * V,unsigned Depth,const SimplifyQuery & Q) isKnownNonZero() argument 2973 isAddOfNonZero(const Value * V1,const Value * V2,unsigned Depth,const SimplifyQuery & Q) isAddOfNonZero() argument 2990 isNonEqualMul(const Value * V1,const Value * V2,unsigned Depth,const SimplifyQuery & Q) isNonEqualMul() argument 3003 isNonEqualShl(const Value * V1,const Value * V2,unsigned Depth,const SimplifyQuery & Q) isNonEqualShl() argument 3015 isNonEqualPHIs(const PHINode * PN1,const PHINode * PN2,unsigned Depth,const SimplifyQuery & Q) isNonEqualPHIs() argument 3044 isNonEqualSelect(const Value * V1,const Value * V2,unsigned Depth,const SimplifyQuery & Q) isNonEqualSelect() argument 3116 isKnownNonEqual(const Value * V1,const Value * V2,unsigned Depth,const SimplifyQuery & Q) isKnownNonEqual() argument 3264 ComputeNumSignBits(const Value * V,const APInt & DemandedElts,unsigned Depth,const SimplifyQuery & Q) ComputeNumSignBits() argument 3279 ComputeNumSignBitsImpl(const Value * V,const APInt & DemandedElts,unsigned Depth,const SimplifyQuery & Q) ComputeNumSignBitsImpl() argument 3715 cannotBeOrderedLessThanZeroImpl(const Value * V,const DataLayout & DL,const TargetLibraryInfo * TLI,bool SignBitOnly,unsigned Depth) cannotBeOrderedLessThanZeroImpl() argument 4299 computeKnownFPClass(const Value * V,KnownFPClass & Known,FPClassTest InterestedClasses,unsigned Depth,const SimplifyQuery & Q) computeKnownFPClass() argument 4310 computeKnownFPClassForFPTrunc(const Operator * Op,const APInt & DemandedElts,FPClassTest InterestedClasses,KnownFPClass & Known,unsigned Depth,const SimplifyQuery & Q) computeKnownFPClassForFPTrunc() argument 4333 computeKnownFPClass(const Value * V,const APInt & DemandedElts,FPClassTest InterestedClasses,KnownFPClass & Known,unsigned Depth,const SimplifyQuery & Q) computeKnownFPClass() argument 5315 computeKnownFPClass(const Value * V,const APInt & DemandedElts,const DataLayout & DL,FPClassTest InterestedClasses,unsigned Depth,const TargetLibraryInfo * TLI,AssumptionCache * AC,const Instruction * CxtI,const DominatorTree * DT,bool UseInstrInfo) computeKnownFPClass() argument 5327 computeKnownFPClass(const Value * V,const DataLayout & DL,FPClassTest InterestedClasses,unsigned Depth,const TargetLibraryInfo * TLI,AssumptionCache * AC,const Instruction * CxtI,const DominatorTree * DT,bool UseInstrInfo) computeKnownFPClass() argument 6737 directlyImpliesPoison(const Value * ValAssumedPoison,const Value * V,unsigned Depth) directlyImpliesPoison() argument 6765 impliesPoison(const Value * ValAssumedPoison,const Value * V,unsigned Depth) impliesPoison() argument 6793 isGuaranteedNotToBeUndefOrPoison(const Value * V,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth,UndefPoisonKind Kind) isGuaranteedNotToBeUndefOrPoison() argument 6932 isGuaranteedNotToBeUndefOrPoison(const Value * V,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth) isGuaranteedNotToBeUndefOrPoison() argument 6939 isGuaranteedNotToBePoison(const Value * V,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth) isGuaranteedNotToBePoison() argument 6946 isGuaranteedNotToBeUndef(const Value * V,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth) isGuaranteedNotToBeUndef() argument 7449 matchMinMaxOfMinMax(CmpInst::Predicate Pred,Value * CmpLHS,Value * CmpRHS,Value * TVal,Value * FVal,unsigned Depth) matchMinMaxOfMinMax() argument 7559 matchMinMax(CmpInst::Predicate Pred,Value * CmpLHS,Value * CmpRHS,Value * TrueVal,Value * FalseVal,Value * & LHS,Value * & RHS,unsigned Depth) matchMinMax() argument 7650 matchSelectPattern(CmpInst::Predicate Pred,FastMathFlags FMF,Value * CmpLHS,Value * CmpRHS,Value * TrueVal,Value * FalseVal,Value * & LHS,Value * & RHS,unsigned Depth) matchSelectPattern() argument 7948 matchSelectPattern(Value * V,Value * & LHS,Value * & RHS,Instruction::CastOps * CastOp,unsigned Depth) matchSelectPattern() argument 7967 matchDecomposedSelectPattern(CmpInst * CmpI,Value * TrueVal,Value * FalseVal,Value * & LHS,Value * & RHS,Instruction::CastOps * CastOp,unsigned Depth) matchDecomposedSelectPattern() argument 8159 isTruePredicate(CmpInst::Predicate Pred,const Value * LHS,const Value * RHS,const DataLayout & DL,unsigned Depth) isTruePredicate() argument 8222 isImpliedCondOperands(CmpInst::Predicate Pred,const Value * ALHS,const Value * ARHS,const Value * BLHS,const Value * BRHS,const DataLayout & DL,unsigned Depth) isImpliedCondOperands() argument 8309 isImpliedCondICmps(const ICmpInst * LHS,CmpInst::Predicate RPred,const Value * R0,const Value * R1,const DataLayout & DL,bool LHSIsTrue,unsigned Depth) isImpliedCondICmps() argument 8365 isImpliedCondAndOr(const Instruction * LHS,CmpInst::Predicate RHSPred,const Value * RHSOp0,const Value * RHSOp1,const DataLayout & DL,bool LHSIsTrue,unsigned Depth) isImpliedCondAndOr() argument 8395 isImpliedCondition(const Value * LHS,CmpInst::Predicate RHSPred,const Value * RHSOp0,const Value * RHSOp1,const DataLayout & DL,bool LHSIsTrue,unsigned Depth) isImpliedCondition() argument 8429 isImpliedCondition(const Value * LHS,const Value * RHS,const DataLayout & DL,bool LHSIsTrue,unsigned Depth) isImpliedCondition() argument 8879 computeConstantRange(const Value * V,bool ForSigned,bool UseInstrInfo,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth) computeConstantRange() argument [all...]
/freebsd-src/sys/contrib/libfdt/
H A D	fdt.c	165 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-src/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_root/zfs_get/
H A D	zfs_get_010_neg.ksh	`37 # 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-src/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/
H A D	divsi3.S	`36 * $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 D	modsi3.S	`36 * $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-src/crypto/openssl/doc/man3/
H A D	SSL_CTX_set_verify.pod	24 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 to 2 allows the levels 0, 1, 2 and 3 (0 being the end-entity and 3 the [all …]
/freebsd-src/sys/contrib/device-tree/Bindings/net/
H A D	altr,tse.yaml	`28 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-src/usr.sbin/camdd/
H A D	camdd.8	166 .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-src/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 - 1 ))`
/freebsd-src/secure/lib/libcrypto/man/man3/
H A D	SSL_CTX_set_verify.3	159 \& void SSL_CTX_set_verify_depth(SSL_CTX ctx, int depth); 160 \& void SSL_set_verify_depth(SSL ssl, int depth); 195 callback (e.g., at a lower depth, or for a separate error condition) returns 0. 197 \&\fBSSL_CTX_set_verify_depth()\fR sets the maximum \fBdepth\fR for the certificate chain 200 \&\fBSSL_set_verify_depth()\fR sets the maximum \fBdepth\fR for the certificate chain 277 application provided procedure also has access to the verify depth information 284 end-entity nor the trust-anchor certificates count against \fBdepth\fR. If the 285 certificate chain needed to reach a trusted issuer is longer than \fBdepth+2\fR, 287 The depth count is \(L"level 0:peer certificate\(R", \(L"level 1: \s-1CA\s0 certificate\(R", 289 depth to 2 allows the levels 0, 1, 2 and 3 (0 being the end-entity and 3 the [all …]

12 3 4 5 6 7 8 9 10 >>...65