/freebsd/sys/contrib/device-tree/Bindings/sound/ |
H A D | atmel-classd.txt | 4 - compatible 5 Should be "atmel,sama5d2-classd". 6 - reg 8 - interrupts 10 - dmas 11 One DMA specifiers as described in atmel-dma.txt and dma.txt files. 12 - dma-names 14 - clock-names 17 - clocks 18 Please refer to clock-bindings.txt. [all …]
|
H A D | atmel,sama5d2-classd.yaml | 1 # SPDX-License-Identifier: (GPL-2.0 OR BSD-2-Clause) 4 --- 5 $id: http://devicetree.org/schemas/sound/atmel,sama5d2-classd.yaml# 6 $schema: http://devicetree.org/meta-schemas/core.yaml# 11 - Nicolas Ferre <nicolas.ferre@microchip.com> 12 - Alexandre Belloni <alexandre.belloni@bootlin.com> 13 - Claudiu Beznea <claudiu.beznea@microchip.com> 22 - items: 23 - const: atmel,sama5d2-classd 24 - items: [all …]
|
/freebsd/crypto/openssl/test/recipes/ |
H A D | 70-test_tls13kexmodes.t | 2 # Copyright 2017-2021 The OpenSSL Project Authors. All Rights Reserved. 23 if disabled("engine") || disabled("dynamic-engine"); 184 my $proxy = TLSProxy::Proxy->new( 193 $proxy->clientflags("-sess_out ".$session); 194 $proxy->serverflags("-servername localhost"); 195 $proxy->sessionfile($session); 196 $proxy->start() or plan skip_all => "Unable to start up Proxy for tests"; 198 ok(TLSProxy::Message->success(), "Initial connection"); 202 $proxy->clear(); 203 $proxy->clientflags("-sess_in ".$session); [all …]
|
/freebsd/sys/powerpc/powerpc/ |
H A D | ptrace_machdep.c | 1 /*- 56 pcb = td->td_pcb; in cpu_ptrace() 67 if (pcb->pcb_flags & PCB_VEC) { in cpu_ptrace() 69 memcpy(&vec, &pcb->pcb_vec, sizeof(vec)); in cpu_ptrace() 78 pcb->pcb_flags |= PCB_VEC; in cpu_ptrace() 79 memcpy(&pcb->pcb_vec, &vec, sizeof(vec)); in cpu_ptrace() 86 if (pcb->pcb_flags & PCB_VSX) { in cpu_ptrace() 90 * Doubleword 0 of VSR0-VSR31 overlap with FPR0-FPR31 and in cpu_ptrace() 91 * VSR32-VSR63 overlap with VR0-VR31, so we only copy in cpu_ptrace() 92 * the non-overlapping data, which is doubleword 1 of VSR0-VSR31. in cpu_ptrace() [all …]
|
/freebsd/share/man/man9/ |
H A D | sysctl_add_oid.9 | 89 to create partially overlapping trees that they both can use. 90 It is not possible to create overlapping leaves, 118 .Bl -tag -width recurse 126 If non-zero, 139 If non-zero, attempt to remove the node and all its children. 149 Contexts take care of tracking inter-dependencies
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | LiveRangeCalc.h | 1 //===- LiveRangeCalc.h - Calculate live ranges -----------------*- C++ -*-===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 13 // non-overlapping live ranges. SplitKit uses that when computing the live 16 // A low-level interface is available to clients that know where a variable is 18 // propagate values down the dominator tree, and even insert PHI-defs where 21 //===----------------------------------------------------------------------===// 52 /// LiveOutPair - A value and the block that defined it. The domtree node is 53 /// redundant, it can be computed as: MDT[Indexes.getMBBFromIndex(VNI->def)]. 56 /// LiveOutMap - Map basic blocks to the value leaving the block. [all …]
|
H A D | DbgEntityHistoryCalculator.h | 1 //===- llvm/CodeGen/DbgEntityHistoryCalculator.h ----------------*- C++ -*-===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 28 /// non-meta instruction. Class state is invalid if MF is modified after 64 /// value. The ending entry can either be an overlapping debug value, or 70 /// register-described debug values that have their end index 112 /// Test whether a vector of entries features any non-empty locations. It 129 /// For each inlined instance of a source-level label, keep the corresponding
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64MachineScheduler.cpp | 1 //===- AArch64MachineScheduler.cpp - MI Scheduler for AArch64 -------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 20 switch (MI->getOpcode()) { in needReorderStoreMI() 25 if (!MI->getMF()->getSubtarget<AArch64Subtarget>().isStoreAddressAscend()) in needReorderStoreMI() 41 // May overlapping writes if two store instructions without same base in mayOverlapWrite() 58 return llabs(Off0 - Off1) < StoreSize; in mayOverlapWrite() 66 MachineInstr *Instr0 = TryCand.SU->getInstr(); in tryCandidate() 67 MachineInstr *Instr1 = Cand.SU->getInstr(); in tryCandidate() 73 // With the same base address and non-overlapping writes. in tryCandidate()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | ConstantRangeList.h | 1 //===- ConstantRangeList.h - A list of constant ranges ----------*- C++ -*-===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 10 // end of the numeric range. Ranges in the list are ordered and not overlapping. 14 //===----------------------------------------------------------------------===// 43 // Return true if the ranges are non-overlapping and increasing.
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LiveIntervalUnion.cpp | 1 //===- LiveIntervalUnion.cpp - Live interval union data structure -------- [all...] |
H A D | ExpandMemCmp.cpp | 1 //===--- ExpandMemCmp.cpp - Expand memcmp() to load/stores ----------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 9 // This pass tries to expand memcmp() calls into optimally-sized loads and 12 //===----------------------------------------------------------------------===// 42 #define DEBUG_TYPE "expand-memcmp" 51 "memcmp-num-loads-per-block", cl::Hidden, cl::init(1), 56 "max-loads-per-memcmp", cl::Hidden, 60 "max-loads-per-memcmp-opt-size", cl::Hidden, 61 cl::desc("Set maximum number of loads used in expanded memcmp for -Os/Oz")); [all …]
|
H A D | RegisterClassInfo.cpp | 1 //===- RegisterClassInfo.cpp - Dynamic Register Class Info ----------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 10 // information about target register classes. Callee-saved vs. caller-saved and 14 //===----------------------------------------------------------------------===// 37 StressRA("stress-regalloc", cl::Hidden, cl::init(0), cl::value_desc("N"), 46 auto &STI = MF->getSubtarget(); in runOnMachineFunction() 51 RegClass.reset(new RCInfo[TRI->getNumRegClasses()]); in runOnMachineFunction() 56 const MachineRegisterInfo &MRI = MF->getRegInfo(); in runOnMachineFunction() 82 // overlapping CSR. in runOnMachineFunction() [all …]
|
H A D | InitUndef.cpp | 1 //===- InitUndef.cpp - Initialize undef value to pseudo ----===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 14 // Certain instructions have register overlapping constraints, and 28 // when program encounter operation that has early-clobber constraint. 31 // See also: https://github.com/llvm/llvm-project/issues/50157 34 // from NoReg to IMPLICIT_DEF. (Not that this is a non-overlapping set of 39 //===----------------------------------------------------------------------===// 57 #define DEBUG_TYPE "init-undef" 107 for (auto &DefMI : MRI->def_instructions(Reg)) { in findImplictDefMIFromReg() [all …]
|
/freebsd/sys/contrib/libsodium/ |
H A D | ChangeLog | 3 - Signatures computations and verifications are now way faster on 4 64-bit platforms with compilers supporting 128-bit arithmetic (gcc, 6 - New low-level APIs for computations over edwards25519: 11 - `crypto_sign_open()`, `crypto_sign_verify_detached() and 13 non-canonical form in addition to low-order points. 14 - The library can be built with `ED25519_NONDETERMINISTIC` defined in 16 - Webassembly: `crypto_pwhash_*()` functions are now included in 17 non-sumo builds. 18 - `sodium_stackzero()` was added to wipe content off the stack. 19 - Android: support new SDKs where unified headers have become the [all …]
|
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/redacted_send/ |
H A D | redacted_holes.ksh | 2 # SPDX-License-Identifier: CDDL-1.0 26 # 1. Holes written at the beginning and end of a non-sparse file in the 28 # 2. Holes written throughout a non-sparse file in the redacted list are 49 # Write holes at the start and end of a non-sparse file. 51 log_must mkholes -h 0:$M -h $((7 * M)):$M $clone_mnt/f1 58 log_must eval "zfs send --redact book1 $sendfs@snap >$stream" 61 log_must zfs rollback -R $clone@snap 62 log_must zfs destroy -R $recvfs 64 # Write two overlapping sets of holes into the same non-sparse file. 65 log_must stride_dd -i /dev/zero -o $clone_mnt/f1 -b $((128 * 1024)) -c 8 -s 2 -k 3 [all …]
|
/freebsd/sys/cddl/contrib/opensolaris/uts/common/dtrace/ |
H A D | dtrace_xoroshiro128_plus.c | 1 /*- 7 * FA8650-15-C-7558 ("CADETS"), as part of the DARPA Transparent Computing 40 return (x << k) | (x >> (64 - k)); in rotl() 45 * to next(); it can be used to generate 2^64 non-overlapping subsequences for 73 * xoroshiro128+ - XOR/rotate/shift/rotate
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonBlockRanges.cpp | 1 //===- HexagonBlockRanges.cpp ---------------------------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 39 bool SbAE = (S < AE) || (S == AE && A.TiedEnd); // S-before-AE. in overlaps() 40 bool ASbE = (AS < E) || (AS == E && TiedEnd); // AS-before-E. in overlaps() 81 // Merge all overlapping ranges in the list, so that all that remains 90 while (Iter != end()-1) { in unionize() 94 bool Merge = MergeAdjacent && (Iter->end() == Next->start()); in unionize() 95 if (Merge || Iter->overlaps(*Next)) { in unionize() 96 Iter->merge(*Next); in unionize() [all …]
|
/freebsd/contrib/llvm-project/lld/COFF/ |
H A D | Writer.h | 1 //===- Writer.h --------- [all...] |
/freebsd/contrib/llvm-project/lld/ELF/ |
H A D | OutputSections.h | 1 //===- OutputSections.h -----------------------------------------*- C++ -*-===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 35 // non-overlapping file offsets and VAs. 41 return s->kind() == SectionBase::Output; in classof() 44 uint64_t getLMA() const { return ptLoad ? addr + ptLoad->lmaOffset : addr; } in getLMA() 56 // section offset we use the following formula: Off = Off_first + VA - 62 // we consume relocations, but if --emit-relocs is specified (which is rare), 63 // it may have a non-null value. 88 // Used by non-alloc SHT_CREL to hold the header and content byte stream. [all …]
|
/freebsd/contrib/ncurses/doc/ |
H A D | ncurses-intro.doc | 5 by Eric S. Raymond and Zeyd M. Ben-Halim 31 o Low-Level Capability Access 42 o Refresh of Overlapping Windows 71 + Variable-Sized Fields 84 o Inter-Field Navigation Requests 85 o Intra-Field Navigation Requests 117 The curses package is a subroutine library for terminal-independent 118 screen-painting and input-event handling which presents a high level 128 the advantage of (a) back-portability to character-cell terminals, and 129 (b) simplicity. For an application that does not require bit-mapped [all …]
|
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | RangedConstraintManager.h | 1 //== RangedConstraintManager.h ----------------------------------*- C++ -*--==// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 11 //===----------------------------------------------------------------------===// 53 // In order to keep non-overlapping ranges sorted, we can compare only From 64 /// @class RangeSet is a persistent set of non-overlapping ranges. 82 // * Ranges in sets are NOT overlapping, so it is natural to keep them 93 // * Iteration over ranges is widespread and a more cache-friendly 104 // This is a non-owning pointer to an actual container. 115 const_iterator begin() const { return Impl->begin(); } in begin() [all …]
|
/freebsd/contrib/ncurses/ncurses/base/ |
H A D | lib_overlay.c | 3 * Copyright 1998-2013,2016 Free Software Foundation, Inc. * 31 * Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 * 60 (long) src->_begy, in overlap() 61 (long) src->_begx, in overlap() 62 (long) src->_maxy, in overlap() 63 (long) src->_maxx)); in overlap() 65 (long) dst->_begy, in overlap() 66 (long) dst->_begx, in overlap() 67 (long) dst->_maxy, in overlap() 68 (long) dst->_maxx)); in overlap() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | UnicodeCharRanges.h | 1 //===--- UnicodeCharRanges.h - Types and functions for character ranges ---===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 70 /// [min, max], and if the ranges themselves are ordered and non-overlapping. 75 if (I != Ranges.begin() && Prev >= I->Lower) { in rangesAreValid() 79 LLVM_DEBUG(dbgs().write_hex(I->Lower) << "\n"); in rangesAreValid() 82 if (I->Upper < I->Lower) { in rangesAreValid() 84 LLVM_DEBUG(dbgs().write_hex(I->Lower)); in rangesAreValid() 86 LLVM_DEBUG(dbgs().write_hex(I->Upper) << "\n"); in rangesAreValid() 89 Prev = I->Upper; in rangesAreValid()
|
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
H A D | COFFLinkGraphBuilder.cpp | 1 //=--------- COFFLinkGraphBuilder.cpp - COF [all...] |
/freebsd/contrib/llvm-project/libcxx/include/__ranges/ |
H A D | movable_box.h | 1 // -*- C++ -*- 2 //===----------------------------------------------------------------------===// 6 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 8 //===----------------------------------------------------------------------===// 34 // __movable_box allows turning a type that is move-constructible (but maybe not move-assignable) i… 35 // a type that is both move-constructible and move-assignable. It does that by introducing an empty… 36 // and basically doing destroy-then-copy-construct in the assignment operator. The empty state is n… 42 // until C++23, `__movable_box` was named `__copyable_box` and required the stored type to be copy-… 43 // just move-constructible; we preserve the old behavior in pre-C++23 modes. 54 // Primary template - uses std::optional and introduces an empty state in case assignment fails. [all …]
|