| /freebsd/usr.sbin/ppp/ |
| H A D | ncpaddr.c | 411 struct ncprange range; in ncpaddr_aton() local 413 if (!ncprange_aton(&range, ncp, data)) in ncpaddr_aton() 416 if (range.ncprange_family == AF_INET && range.ncprange_ip4width != 32 && in ncpaddr_aton() 417 range.ncprange_ip4addr.s_addr != INADDR_ANY) { in ncpaddr_aton() 423 if (range.ncprange_family == AF_INET6 && range.ncprange_ip6width != 128 && in ncpaddr_aton() 424 !IN6_IS_ADDR_UNSPECIFIED(&range.ncprange_ip6addr)) { in ncpaddr_aton() 430 switch (range.ncprange_family) { in ncpaddr_aton() 432 addr->ncpaddr_family = range.ncprange_family; in ncpaddr_aton() 433 addr->ncpaddr_ip4addr = range.ncprange_ip4addr; in ncpaddr_aton() 438 addr->ncpaddr_family = range.ncprange_family; in ncpaddr_aton() [all …]
|
| /freebsd/crypto/openssl/ssl/quic/ |
| H A D | uint_set.c | 20 * Insert Range: Adds an inclusive range of integers [start, end] 22 * in the range. 24 * Remove Range: Removes an inclusive range of integers [start, end] 25 * from the set. Not all of the range need already be in 26 * the set, but any part of the range in the set is removed. 35 * implemented as a doubly linked sorted list of range structures, which are 44 * end of the range. 54 * Invariant: No range [a, b] ever has a > b. 56 * Invariant: Since ranges are represented using inclusive bounds, no range 83 if (x->range.start - 1 != xprev->range.end) in uint_set_merge_adjacent() [all …]
|
| H A D | quic_sf_list.c | 16 UINT_RANGE range; member 25 (size_t)(sf->range.end - sf->range.start)); in stream_frame_free() 30 static STREAM_FRAME *stream_frame_new(UINT_RANGE *range, OSSL_QRX_PKT *pkt, in stream_frame_new() argument 41 sf->range = *range; in stream_frame_new() 63 static int append_frame(SFRAME_LIST *fl, UINT_RANGE *range, in append_frame() argument 69 if ((new_frame = stream_frame_new(range, pkt, data)) == NULL) in append_frame() 79 int ossl_sframe_list_insert(SFRAME_LIST *fl, UINT_RANGE *range, in ossl_sframe_list_insert() argument 85 uint64_t curr_end = fl->tail != NULL ? fl->tail->range.end in ossl_sframe_list_insert() 89 assert((!fin || curr_end <= range->end) in ossl_sframe_list_insert() 90 && (!fl->fin || curr_end >= range->end)); in ossl_sframe_list_insert() [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | ConstantRange.h | 1 //===- ConstantRange.h - Represent a range ----------------------*- C++ -*-===// 9 // Represent a range of possible values that may occur when the program is run 11 // constant, which MAY wrap around the end of the numeric range. To do this, it 21 // The other integral ranges use min/max values for special range values. For 46 /// This class represents a range of values. 50 /// Create empty constant range with same bitwidth. 55 /// Create full constant range with same bitwidth. 64 /// Initialize a range to hold the single specified value. 67 /// Initialize a range of values explicitly. This will assert out if 72 /// Create empty constant range with the given bit width. [all …]
|
| H A D | ConstantFPRange.h | 1 //===- ConstantFPRange.h - Represent a range for floating-point -*- C++ -*-===// 9 // Represent a range of possible values that may occur when the program is run 13 // Range = [Lower, Upper] U (MayBeQNaN ? QNaN : {}) U (MayBeSNaN ? SNaN : {}) 17 // 2. -0 is considered to be less than 0. That is, range [0, 0] doesn't contain 36 /// This class represents a range of floating-point values. 42 /// Create empty constant range with same semantics. 47 /// Create full constant range with same semantics. 59 /// Initialize a range to hold the single specified value. 62 /// Initialize a range of values explicitly. 68 /// Create empty constant range with the given semantics. [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | AddressRanges.h | 20 /// A class that represents an address range. The range is specified using 69 bool contains(AddressRange Range) const { in contains() argument 70 return find(Range.start(), Range.end()) != Ranges.end(); in contains() 114 /// The AddressRanges class helps normalize address range collections. 121 Collection::const_iterator insert(AddressRange Range) { in insert() argument 122 if (Range.empty()) in insert() 125 auto It = upper_bound(Ranges, Range); in insert() 127 while (It2 != Ranges.end() && It2->start() <= Range.end()) in insert() 130 Range = {Range.start(), std::max(Range.end(), std::prev(It2)->end())}; in insert() 133 if (It != Ranges.begin() && Range.start() <= std::prev(It)->end()) { in insert() [all …]
|
| H A D | ADL.h | 27 constexpr auto begin_impl(RangeT &&range) 28 -> decltype(begin(std::forward<RangeT>(range))) { 29 return begin(std::forward<RangeT>(range)); 35 constexpr auto end_impl(RangeT &&range) 36 -> decltype(end(std::forward<RangeT>(range))) { 37 return end(std::forward<RangeT>(range)); 43 constexpr auto rbegin_impl(RangeT &&range) 44 -> decltype(rbegin(std::forward<RangeT>(range))) { 45 return rbegin(std::forward<RangeT>(range)); 51 constexpr auto rend_impl(RangeT &&range) [all …]
|
| /freebsd/crypto/openssl/crypto/bn/ |
| H A D | bn_rand.c | 132 /* random number r: 0 <= r < range */ 133 static int bnrand_range(BNRAND_FLAG flag, BIGNUM *r, const BIGNUM *range, in bnrand_range() argument 144 if (range->neg || BN_is_zero(range)) { in bnrand_range() 149 n = BN_num_bits(range); /* n > 0 */ in bnrand_range() 151 /* BN_is_bit_set(range, n - 1) always holds */ in bnrand_range() 155 else if (!BN_is_bit_set(range, n - 2) && !BN_is_bit_set(range, n - 3)) { in bnrand_range() 157 * range = 100..._2, so 3*range (= 11..._2) is exactly one bit longer in bnrand_range() 158 * than range in bnrand_range() 166 * If r < 3*range, use r := r MOD range (which is either r, r - in bnrand_range() 167 * range, or r - 2*range). Otherwise, iterate once more. Since in bnrand_range() [all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Tooling/Transformer/ |
| H A D | SourceCode.cpp | 31 StringRef clang::tooling::getText(CharSourceRange Range, in getText() argument 33 return Lexer::getSourceText(Range, Context.getSourceManager(), in getText() 37 CharSourceRange clang::tooling::maybeExtendRange(CharSourceRange Range, in maybeExtendRange() argument 40 CharSourceRange R = Lexer::getAsCharRange(Range, Context.getSourceManager(), in maybeExtendRange() 43 return Range; in maybeExtendRange() 49 return Range; in maybeExtendRange() 50 return CharSourceRange::getTokenRange(Range.getBegin(), Tok.getLocation()); in maybeExtendRange() 53 llvm::Error clang::tooling::validateRange(const CharSourceRange &Range, in validateRange() argument 56 if (Range.isInvalid()) in validateRange() 58 "Invalid range"); in validateRange() [all …]
|
| /freebsd/contrib/llvm-project/libcxx/modules/std/ |
| H A D | ranges.cppm | |
| H A D | ranges.inc | 13 // [range.access], range access 30 // [range.range], ranges 31 using std::ranges::range; 49 // [range.sized], sized ranges 53 // [range.view], views 58 // [range.refinements], other range refinements 72 // [range.subrange], sub-ranges 83 // [range.dangling], dangling iterator handling 86 // [range.elementsof], class template elements_of 94 // [range.utility.conv], range conversions [all …]
|
| /freebsd/contrib/llvm-project/clang/include/clang/Rewrite/Core/ |
| H A D | Rewriter.h | 39 /// Given a source range, true to include previous inserts at the 40 /// beginning of the range as part of the range itself (true by default). 43 /// Given a source range, true to include previous inserts at the 44 /// end of the range as part of the range itself (true by default). 55 /// line and then, if found, expand the removal range to include it. 58 /// scan before and after the removal range until the next newline or 87 /// getRangeSize - Return the size in bytes of the specified range if they 89 int getRangeSize(SourceRange Range, 91 int getRangeSize(const CharSourceRange &Range, 95 /// range. If the start or end of the range was unrewritable or if they are [all …]
|
| /freebsd/contrib/bmake/unit-tests/ |
| H A D | varmod-range.mk | 1 # $NetBSD: varmod-range.mk,v 1.19 2025/06/28 22:39:29 rillig Exp $ 3 # Tests for the :range variable modifier, which generates sequences 4 # of integers from the given range. 9 # The :range modifier generates a sequence of integers, one number per 11 .if ${a b c:L:range} != "1 2 3" 17 .if ${:U first "the second word" third 4 :range} != "1 2 3 4" 21 # The :range modifier takes the number of words from the value of the 22 # expression. If that expression is undefined, the range is 24 .if "${:range}" != "" 30 .if ${:U:range} != "1" [all …]
|
| /freebsd/contrib/llvm-project/lldb/source/Plugins/Process/Utility/ |
| H A D | MemoryTagManagerAArch64MTE.cpp | 49 MemoryTagManagerAArch64MTE::ExpandToGranule(TagRange range) const { in ExpandToGranule() 51 if (!range.IsValid()) in ExpandToGranule() 52 return range; in ExpandToGranule() 57 lldb::addr_t new_start = range.GetRangeBase(); in ExpandToGranule() 62 size_t new_len = range.GetByteSize() + align_down_amount; in ExpandToGranule() 84 // First check that the range is not inverted. in MakeTaggedRange() 99 // While there are parts of the range that don't have a matching tagged memory in MakeTaggedRange() 102 // Search for a region that contains the start of the range in MakeTaggedRange() 111 // Some part of this range is untagged (or unmapped) so error in MakeTaggedRange() 113 "Address range 0x%" PRIx64 ":0x%" PRIx64 in MakeTaggedRange() [all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/ |
| H A D | ranges | 21 // [range.access], range access 31 // [range.range], ranges 33 concept range = see below; 40 template<range R> 42 template<range R> 46 template<range R> 48 template<range R> 50 template<range R> 52 template <range R> 55 // [range.sized], sized ranges [all …]
|
| /freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_root/zfs_destroy/ |
| H A D | zfs_destroy_016_pos.ksh | 19 # Verify zfs destroy test for range of snapshots by giving a list 23 # 1. Create a list of valid and invalid arguments for range snapshot 55 for i in $range; do 64 for i in $range; do 86 range="1 2 3 4 5" 102 log_note "Destroy the beginning range" 106 range="1 2 3" 108 range="4 5" 112 log_note "Destroy the mid range" 115 range="2 3 4" [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | ConstantRangeList.cpp | 17 auto Range = RangesRef[0]; in isOrderedRanges() local 18 if (Range.getLower().sge(Range.getUpper())) in isOrderedRanges() 103 for (auto &Range : Ranges) { in subtract() local 104 if (SubRange.getUpper().sle(Range.getLower()) || in subtract() 105 Range.getUpper().sle(SubRange.getLower())) { in subtract() 106 // "Range" and "SubRange" do not overlap. in subtract() 107 // L---U : Range in subtract() 110 Result.push_back(Range); in subtract() 111 } else if (Range.getLower().sle(SubRange.getLower()) && in subtract() 112 SubRange.getUpper().sle(Range.getUpper())) { in subtract() [all …]
|
| /freebsd/tests/sys/file/ |
| H A D | fspacectl_test.c | 186 struct spacectl_range range; in ATF_TC_BODY() local 192 range.r_offset = offset = blocksize; in ATF_TC_BODY() 193 range.r_len = length = (file_max_blocks - 1) * blocksize - in ATF_TC_BODY() 194 range.r_offset; in ATF_TC_BODY() 199 ATF_CHECK(fspacectl(fd, SPACECTL_DEALLOC, &range, 0, &range) == 0); in ATF_TC_BODY() 211 struct spacectl_range range; in ATF_TC_BODY() local 217 range.r_offset = offset = blocksize / 2; in ATF_TC_BODY() 218 range.r_len = length = (file_max_blocks - 1) * blocksize + in ATF_TC_BODY() 224 ATF_CHECK(fspacectl(fd, SPACECTL_DEALLOC, &range, 0, &range) == 0); in ATF_TC_BODY() 236 struct spacectl_range range; in ATF_TC_BODY() local [all …]
|
| /freebsd/contrib/llvm-project/lldb/include/lldb/Core/ |
| H A D | AddressRange.h | 24 /// A section + offset based address range class. 46 /// The size in bytes of the address range. 59 /// The size in bytes of the address range. 75 /// The size in bytes of the address range. 91 /// Check if a section offset address is contained in this range. 97 /// Returns \b true if \a so_addr is contained in this range, 101 /// Check if a section offset address is contained in this range. 107 /// Returns \b true if \a so_addr is contained in this range, 113 /// is contained within this object's file address range. 121 /// in the address range, \b false otherwise. [all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Edit/ |
| H A D | Commit.cpp | 64 CharSourceRange range, in insertFromRange() argument 68 if (!canRemoveRange(range, RangeOffs, RangeLen)) { in insertFromRange() 81 PPRec->areInDifferentConditionalDirectiveRegion(loc, range.getBegin())) { in insertFromRange() 90 bool Commit::remove(CharSourceRange range) { in remove() argument 93 if (!canRemoveRange(range, Offs, Len)) { in remove() 98 addRemove(range.getBegin(), Offs, Len); in remove() 102 bool Commit::insertWrap(StringRef before, CharSourceRange range, in insertWrap() argument 104 bool commitableBefore = insert(range.getBegin(), before, /*afterToken=*/false, in insertWrap() 107 if (range.isTokenRange()) in insertWrap() 108 commitableAfter = insertAfterToken(range.getEnd(), after); in insertWrap() [all …]
|
| /freebsd/contrib/elftoolchain/addr2line/ |
| H A D | addr2line.c | 60 struct range { struct 61 RB_ENTRY(range) entry; 92 static RB_HEAD(cutree, range) cuhead = RB_INITIALIZER(&cuhead); argument 95 lopccmp(struct range *e1, struct range *e2) in lopccmp() 100 RB_PROTOTYPE(cutree, range, entry, lopccmp); 101 RB_GENERATE(cutree, range, entry, lopccmp) in RB_GENERATE() argument 174 search_func(struct range *range, Dwarf_Unsigned addr) in search_func() argument 182 STAILQ_FOREACH(f, &range->funclist, next) { in search_func() 220 struct range *range) in collect_func() argument 244 * Function address range can be specified by either in collect_func() [all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/iio/dac/ |
| H A D | ad5758.txt | 36 - adi,range-microvolt: Voltage output range 38 * <0 5000000>: 0 V to 5 V voltage range 39 * <0 10000000>: 0 V to 10 V voltage range 40 * <(-5000000) 5000000>: ±5 V voltage range 41 * <(-10000000) 10000000>: ±10 V voltage range 42 - adi,range-microamp: Current output range 44 * <0 20000>: 0 mA to 20 mA current range 45 * <0 24000>: 0 mA to 24 mA current range 46 * <4 24000>: 4 mA to 20 mA current range 47 * <(-20000) 20000>: ±20 mA current range [all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Rewrite/ |
| H A D | Rewriter.cpp | 44 /// getRangeSize - Return the size in bytes of the specified range if they 46 int Rewriter::getRangeSize(const CharSourceRange &Range, in getRangeSize() argument 48 if (!isRewritable(Range.getBegin()) || in getRangeSize() 49 !isRewritable(Range.getEnd())) return -1; in getRangeSize() 52 unsigned StartOff = getLocationOffsetAndFileID(Range.getBegin(), StartFileID); in getRangeSize() 53 unsigned EndOff = getLocationOffsetAndFileID(Range.getEnd(), EndFileID); in getRangeSize() 58 // If edits have been made to this buffer, the delta between the range may in getRangeSize() 69 // start of the last token if this is a token range. in getRangeSize() 70 if (Range.isTokenRange()) in getRangeSize() 71 EndOff += Lexer::MeasureTokenLength(Range.getEnd(), *SourceMgr, *LangOpts); in getRangeSize() [all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/pinctrl/ |
| H A D | pinctrl-single.txt | 76 - pinctrl-single,gpio-range : list of value that are used to configure a GPIO 77 range. They're value of subnode phandle, pin base in pinctrl device, pin 78 number in this range, GPIO function value of this GPIO range. 79 The number of parameters is depend on #pinctrl-single,gpio-range-cells 83 pinctrl-single,gpio-range = <&range 0 3 0>, <&range 3 9 1>; 126 register, those pins could be defined as a GPIO range. This sub-node is required 127 by pinctrl-single,gpio-range property. 130 - #pinctrl-single,gpio-range-cells : the number of parameters after phandle in 131 pinctrl-single,gpio-range property. 133 range: gpio-range { [all …]
|
| /freebsd/contrib/llvm-project/libc/src/__support/ |
| H A D | freetrie.h | 26 /// but rather the fixed range of possible sizes that the trie can contain. This 30 /// Each trie node's children subdivide the range of possible sizes into two 32 /// within its range. This makes it possible to summarily replace any node with 44 /// of the subtries range. There is no direct relationship between the size of 47 /// The child subtrie covering the lower half of this subtrie's size range. 50 /// The child subtrie covering the upper half of this subtrie's size range. 60 /// Power-of-two range of sizes covered by a subtrie. 70 /// @returns The lower half of the size range. 73 /// @returns The upper half of the size range. 76 /// @returns The largest size in this range. [all …]
|