second\-order (full) in projects: freebsd

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched +full:second +full:- +full:order (Results 1 – 25 of 1047) sorted by relevance

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

/freebsd/contrib/tzcode/
H A D	tzfile.5	`2 .\" 1996-06-05 by Arthur David Olson. 15 Each file is a sequence of 8-bit bytes. 17 more bytes in network order (bigendian, or high-order byte first), 20 and a boolean is represented by a one-byte binary integer that is 22 The format begins with a 44-byte header containing the following fields: 24 .Bl -bullet 26 The magic four-byte ASCII sequence 39 Six four-byte integer values, in the following order: 41 .Bl -tag -compat -width tzh_ttisstdcnt 63 .Bl -tag -compat -width tzh_timecnt [all …]`
/freebsd/lib/msun/man/
H A D	math.3	33 .Nd "floating-point mathematical library" 40 .Bl -column "<complex.h>" "polymorphic (type-generic) versions of functions" -compact -offset indent 80 The classification macros and silent order predicates are type generic and 86 .Bl -column "isgreaterequal" "bessel function of the second kind of the order 0" 92 fma fused multiply-add 98 fpclassify classify a floating-point value 113 .Ss Extremum- and Sign-Related Functions 131 llrint round to integer in fixed-point format 132 llround round to nearest integer in fixed-point format 133 lrint round to integer in fixed-point format [all …]
H A D	j0.3	`44 .Nd Bessel functions of first and second kind 87 compute the Bessel function of the first kind of the integer order 98 compute the linearly independent Bessel function of the second kind 107 compute the Bessel function of the second kind for the integer order 127 is negative, including -\(If, these routines will generate an invalid 132 will generate a divide-by-zero exception and return -\(If. 141 will generate an overflow exception and return -\*(If. 154 .St -p1003.1-2001 .`
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A D	SyntheticCountsUtils.cpp	1 //===--- SyntheticCountsUtils.cpp - synthetic counts propagation utils ---===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 11 //===----------------------------------------------------------------------===// 48 // This ensures that the order of in propagateFromSCC() 53 auto OptProfCount = GetProfCount(E.first, E.second); in propagateFromSCC() 56 auto Callee = CGT::edge_dest(E.second); in propagateFromSCC() 62 AddCount(Entry.first, Entry.second); in propagateFromSCC() 66 auto OptProfCount = GetProfCount(E.first, E.second); in propagateFromSCC() 69 auto Callee = CGT::edge_dest(E.second); in propagateFromSCC() [all …]
/freebsd/contrib/llvm-project/llvm/lib/Bitcode/Writer/
H A D	ValueEnumerator.cpp	1 //===- ValueEnumerator.cpp - Number values and types for bitcode writer ---===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 11 //===----------------------------------------------------------------------===// 15 #include "llvm/Config/llvm-config.h" 69 // Explicitly sequence get-size and insert-value operations to avoid UB. in index() 82 if (C->getNumOperands()) { in orderValue() 83 for (const Value *Op : C->operands()) in orderValue() 87 if (CE->getOpcode() == Instruction::ShuffleVector) in orderValue() 88 orderValue(CE->getShuffleMaskForBitcode(), OM); in orderValue() [all …]
/freebsd/contrib/llvm-project/lldb/source/DataFormatters/
H A D	TypeCategoryMap.cpp	1 //===-- TypeCategoryMap.cpp -----------------------------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 35 // reverse order when calling FormatManager::Changed. in Add() 37 listener->Changed(); in Add() 52 // reverse order when calling FormatManager::Changed. in Delete() 54 listener->Changed(); in Delete() 85 pos_w--, iter++; in Enable() 90 category->Enable(true, pos); in Enable() 100 category->Disable(); in Disable() [all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/DirectX/DXILWriter/
H A D	DXILValueEnumerator.cpp	1 //===- ValueEnumerator.cpp - Number values and types for bitcode writer ---===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 12 //===----------------------------------------------------------------------===// 16 #include "llvm/Config/llvm-config.h" 77 // Explicitly sequence get-size and insert-value operations to avoid UB. in index() 90 if (C->getNumOperands() && !isa<GlobalValue>(C)) { in orderValue() 91 for (const Value *Op : C->operands()) in orderValue() 95 if (CE->getOpcode() == Instruction::ShuffleVector) in orderValue() 96 orderValue(CE->getShuffleMaskForBitcode(), OM); in orderValue() [all …]
/freebsd/share/man/man7/
H A D	orders.7	38 .Bl -column -offset 2n \ 54 .Bl -column -offset 2n \ 55 "Megabit per second" "Prefix" "Bit per second" "Byte per second" 56 .It Sy Name Ta Sy Prefix Ta Sy Bit per second Ta Sy Byte per second 57 .It Bit per second Ta bit/s Ta 1 Ta 0.125 58 .It Byte per second Ta B/s Ta 8 Ta 1 59 .It Kilobit per second Ta kbit/s Ta 10^3 Ta 125 60 .It Kilobyte per second Ta kB/s Ta 8 * 10^3 Ta 1000 61 .It Megabit per second Ta Mbit/s Ta 10^6 Ta 125000 62 .It Megabyte per second Ta MB/s Ta 8 * 10^6 Ta 1000000 [all …]
/freebsd/contrib/llvm-project/clang/lib/Headers/
H A D	xmmintrin.h	1 /===---- xmmintrin.h - SSE intrinsics -------------------------------------=== 5 SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 *===-----------------------------------------------------------------------=== 36 __attribute__((__always_inline__, __nodebug__, __target__("sse,no-evex512"), \ 40 __target__("mmx,sse,no-evex512"), __min_vector_width__(64))) 42 /// Adds the 32-bit float values in the low-order bits of the operands. 49 /// A 128-bit vector of [4 x float] containing one of the source operands. 52 /// A 128-bit vector of [4 x float] containing one of the source operands. 54 /// \returns A 128-bit vector of [4 x float] whose lower 32 bits contain the sum 64 /// Adds two 128-bit vectors of [4 x float], and returns the results of [all …]
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A D	RISCVISAUtils.cpp	1 //===-- RISCVISAUtils.cpp - RISC-V ISA Utilities --------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 11 //===----------------------------------------------------------------------===// 19 // We rank extensions in the following order: 20 // -Single letter extensions in canonical order. 21 // -Unknown single letter extensions in alphabetical order. 22 // -Multi-letter extensions starting with 'z' sorted by canonical order of 23 // the second letter then sorted alphabetically. 24 // -Multi-letter extensions starting with 's' in alphabetical order. [all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A D	StructurizeCFG.cpp	1 //===- StructurizeCFG.cpp -------------------------------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 63 "structurizecfg-skip-uniform-regions", 69 RelaxedUniformRegions("structurizecfg-relaxed-uniform-regions", cl::Hidden, 118 static bool filterSet(const NodeRef &N) { return N.second->count(N.first); } in filterSet() 130 auto filter = N.second ? &filterSet : &filterAll; in children() 133 {GraphTraits<RegionNode >::child_begin(N.first), N.second}, in children() 134 {GraphTraits<RegionNode >::child_end(N.first), N.second}), in children() 165 BasicBlock NewResult = DT->findNearestCommonDominator(Result, BB); in addBlock() [all …]
/freebsd/contrib/ntp/html/
H A D	parsenew.html	1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> 6 <meta http-equiv="content-type" content="text/html;charset=iso-8859-1"> 13 …out what you need to do in order to add another clock to the parse driver: Currently the implement… 15 <!-- #BeginDate format:En2m -->13-Oct-2010 00:33<!-- #EndDate --> 26 …<li>find year, month, day, hour, minute, second, status (synchronised or not), possibly time zone … 35 long second; 45 PARSEB_POWERUP no synchronisation - clock confused (must set then) 52 … PARSEB_LEAPADD LEAP addition warning (prior to leap happening - must set when imminent) 55 … PARSEB_LEAPDEL LEAP deletion warning (prior to leap happening - must set when imminent) 58 PARSEB_LEAPSECOND actual leap second (this time code is the leap [all …]
/freebsd/crypto/krb5/src/lib/krb5/unicode/ucdata/
H A D	format.txt	`23 --------------------- 24 Mn 0 Mark, Non-Spacing 52 L 28 Left-To-Right 53 R 29 Right-To-Left 69 Nb 40 Non-Breaking 79 Assumptions: unsigned short is at least 16-bits in size and unsigned long 80 is at least 32-bits in size. 89 Ranges[] arrays. The Offsets[] array is aligned on a 4-byte boundary and 91 Ranges[] array. The Ranges[] array contains pairs of 4-byte values 93 increasing order by the first character code in the range. [all …]`
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A D	MapVector.h	`1 //===- llvm/ADT/MapVector.h - Map w/ deterministic value order --- C++ --===// 5 // SPDX-License-Identifie [all...]`
H A D	PriorityWorklist.h	1 //===- PriorityWorklist.h - Worklist with insertion priority ----- C++ --===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 13 //===----------------------------------------------------------------------===// 30 /// A FILO worklist that prioritizes on re-insertion without duplication. 33 /// while re-insertion does not create a duplicate, it does adjust the 34 /// visitation order to respect the last insertion point. This can be useful 35 /// when the visit order needs to be prioritized based on insertion point 38 /// Note that this doesn't prevent re-insertion of elements which have been 39 /// visited -- if you need to break cycles, a set will still be necessary. [all …]
/freebsd/contrib/llvm-project/llvm/lib/ProfileData/
H A D	SampleProfWriter.cpp	1 //===- SampleProfWriter.cpp - Write LLVM sample profile data --------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 18 //===----------------------------------------------------------------------===// 41 #define DEBUG_TYPE "llvm-profdata" 81 size_t NumToRemove = ProfileMap.size() - NewSize; in Erase() 87 llvm::drop_begin(SortedFunctions, SortedFunctions.size() - NumToRemove)) in Erase() 89 SortedFunctions.resize(SortedFunctions.size() - NumToRemove); in Erase() 124 Strategy->Erase(TotalSize); in writeWithSizeLimitInternal() 132 OutputStream->write(StringBuffer.data(), StringBuffer.size()); in writeWithSizeLimitInternal() [all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A D	SLPVectorizer.cpp	1 //===- SLPVectorizer.cpp - A bottom up SLP Vectorizer -------- 1007 fixupOrderingIndices(MutableArrayRef<unsigned> Order) fixupOrderingIndices() argument 4177 reorderOrder(SmallVectorImpl<unsigned> & Order,ArrayRef<int> Mask,bool BottomOrder=false) reorderOrder() argument 4414 isReverseOrder(ArrayRef<unsigned> Order) isReverseOrder() argument 4547 canVectorizeLoads(ArrayRef<Value * > VL,const Value * VL0,SmallVectorImpl<unsigned> & Order,SmallVectorImpl<Value * > & PointerOps,bool TryRecursiveCheck) const canVectorizeLoads() argument 4665 SmallVector<unsigned> Order; canVectorizeLoads() local 4869 BoUpSLP::OrdersType Order; findPartiallyOrderedLoads() local 5084 __anon07b2d7743c02(const OrdersType &Order) getReorderingData() argument 5138 OrdersType Order(Sz, Sz); getReorderingData() local 5155 OrdersType Order(Sz, Sz); getReorderingData() local 5164 if (std::optional<OrdersType> Order = findPartiallyOrderedLoads(TE)) getReorderingData() local 5214 combineOrders(MutableArrayRef<unsigned> Order,ArrayRef<unsigned> SecondaryOrder) combineOrders() argument 5339 const auto &Order = [OpTE, &GathersToOrders, &AltShufflesToOrders, reorderTopToBottom() local 5395 __anon07b2d7744302(ArrayRef<unsigned> Order) reorderTopToBottom() argument 5641 const auto Order = [&]() -> const OrdersType { reorderBottomToTop() local 5721 __anon07b2d7745202(ArrayRef<unsigned> Order) reorderBottomToTop() argument 6002 __anon07b2d7745602(const OrdersType &Order) canFormVector() argument 6015 dumpOrder(const BoUpSLP::OrdersType & Order) dumpOrder() argument 8386 OrdersType Order; getBuildVectorCost() local 12132 addOrdered(Value * V1,ArrayRef<unsigned> Order) addOrdered() argument 13337 OrdersType Order; vectorizeTree() local [all...]
/freebsd/share/doc/smm/06.nfs/
H A D	2.t	38 This section borrows heavily from work done on Spritely-NFS [Srinivasan89], 60 There are three types of leases: read caching, write caching and non-caching. 98 correspond to a Sprite server\(->client callback, but are not implemented as an 131 The high order longword is stored in the ufs inode and is initialized to one 133 The low order longword is stored in main memory only and is initialized to 135 When the file is modified for the first time within a given second of 136 wall clock time, the high order longword is incremented by one and 137 the low order longword reset to zero. 138 For subsequent modifications within the same second of wall clock 139 time, the low order longword is incremented. If the low order longword wraps [all …]
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A D	CodeGenRegisters.cpp	1 //===- CodeGenRegisters.cpp - Register and RegisterClass Info -------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 12 //===----------------------------------------------------------------------===// 45 #define DEBUG_TYPE "regalloc-emitter" 47 //===----------------------------------------------------------------------===// 49 //===----------------------------------------------------------------------===// 54 Name = std::string(R->getName()); in CodeGenSubRegIndex() 55 if (R->getValue("Namespace")) in CodeGenSubRegIndex() 56 Namespace = std::string(R->getValueAsString("Namespace")); in CodeGenSubRegIndex() [all …]
/freebsd/sys/contrib/device-tree/Bindings/mailbox/
H A D	nvidia,tegra186-hsp.txt	`13 - name : Should be hsp 14 - compatible 17 - "nvidia,tegra186-hsp" 18 - "nvidia,tegra194-hsp", "nvidia,tegra186-hsp" 19 - reg : Offset and length of the register set for the device. 20 - interrupt-names 23 property. May contain the following entries, in any order: 24 - "doorbell" 25 - "sharedN", where 'N' is a number from zero up to the number of 28 by name, using this interrupt-names property to do so. [all …]`
/freebsd/crypto/openssl/crypto/aes/asm/
H A D	aes-riscv64-zvbb-zvkg-zvkned.pl	2 # This file is dual-licensed, meaning that you can use it under your 37 # - RV64I 38 # - RISC-V Vector ('V') with VLEN >= 128 39 # - RISC-V Vector Bit-manipulation extension ('Zvbb') 40 # - RISC-V Vector GCM/GMAC extension ('Zvkg') 41 # - RISC-V Vector AES block cipher extension ('Zvkned') 42 # - RISC-V Zicclsm(Main memory supports misaligned loads/stores) 90 addi $T0, $T0, -1 95 addi $T0, $T0, -1 105 # prepare input data(v24), iv(v28), bit-reversed-iv(v16), bit-reversed-iv-multiplier(v20) [all …]
/freebsd/sys/contrib/device-tree/Bindings/mmc/
H A D	exynos-dw-mshc.txt	7 by synopsys-dw-mshc.txt and the properties used by the Samsung Exynos specific 13 - "samsung,exynos4210-dw-mshc": for controllers with Samsung Exynos4210 15 - "samsung,exynos4412-dw-mshc": for controllers with Samsung Exynos4412 17 - "samsung,exynos5250-dw-mshc": for controllers with Samsung Exynos5250 19 - "samsung,exynos5420-dw-mshc": for controllers with Samsung Exynos5420 21 - "samsung,exynos7-dw-mshc": for controllers with Samsung Exynos7 23 - "samsung,exynos7-dw-mshc-smu": for controllers with Samsung Exynos7 25 - "axis,artpec8-dw-mshc": for controllers with ARTPEC-8 specific 28 * samsung,dw-mshc-ciu-div: Specifies the divider value for the card interface 32 * samsung,dw-mshc-sdr-timing: Specifies the value of CIU clock phase shift value [all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A D	LiveRangeShrink.cpp	`1 //===- LiveRangeShrink.cpp - Move instructions to shrink live range -------===// 5 // SPDX-Licens [all...]`
/freebsd/lib/libc/aarch64/string/
H A D	timingsafe_memcmp.S	`2 * SPDX-License-Identifier: BSD-2-Clause 45 rev w3, w3 // swap word order 48 csetm w0, lo // w0 = w3 >= w4 ? 0 : -1 49 csinc w0, w0, wzr, ls // w0 = w3 <=> w4 ? 1 : 0 : -1 59 rev x3, x3 // swap word order 62 csetm w0, lo // x0 = x3 >= w4 ? 0 : -1 63 csinc w0, w0, wzr, ls // x0 = x3 <=> w4 ? 1 : 0 : -1 72 csel x3, x3, x5, ne // use second pair if first pair equal 85 csel x3, x3, x4, ne // use second pair if first pair equal 93 csel x4, x4, x7, ne // if not, try second pair [all …]`
/freebsd/usr.bin/cap_mkdb/
H A D	cap_mkdb.1	`60 .Bl -tag -width indent 62 Use big-endian byte order for database metadata. 66 Use little-endian byte order for database metadata. 76 The default byte ordering is the current host order. 87 The second type is a key which consists of one of the names from the 93 in a key/data pair of the second type. 98 .Ex -std`

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