Home
last modified time | relevance | path

Searched +full:psi +full:- +full:l (Results 1 – 25 of 60) sorted by relevance

123

/freebsd/sys/contrib/device-tree/Bindings/dma/ti/
H A Dk3-udma.yaml1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
5 ---
6 $id: http://devicetree.org/schemas/dma/ti/k3-udm
[all...]
H A Dk3-pktdma.yaml1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
5 ---
6 $id: http://devicetree.org/schemas/dma/ti/k3-pktdm
[all...]
H A Dk3-bcdma.yaml1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
5 ---
6 $id: http://devicetree.org/schemas/dma/ti/k3-bcdm
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopLoadElimination.cpp1 //===- LoopLoadElimination.cpp - Loop Load Elimination Pass ---------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
9 // This file implement a loop-aware load elimination pass.
11 // It uses LoopAccessAnalysis to identify loop-carried dependences with a
17 // may-aliasing stores can't change the value in memory before it's read by the
20 //===----------------------------------------------------------------------===//
66 #define LLE_OPTION "loop-load-elim"
70 "runtime-check-per-loop-load-elim", cl::Hidden,
75 "loop-load-elimination-scev-check-threshold", cl::init(8), cl::Hidden,
[all …]
H A DLoopUnrollPass.cpp1 //===- LoopUnroll.cpp - Loop unroller pass --------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
10 // been canonicalized by the -indvars pass, allowing it to determine the trip
12 //===----------------------------------------------------------------------===//
74 #define DEBUG_TYPE "loop-unroll"
77 "forget-scev-loop-unroll", cl::init(false), cl::Hidden,
79 " the current top-most loop. This is sometimes preferred to reduce"
83 UnrollThreshold("unroll-threshold", cl::Hidden,
88 "unroll-optsize-threshold", cl::init(0), cl::Hidden,
[all …]
H A DSimpleLoopUnswitch.cpp1 ///===- SimpleLoopUnswitch.cpp - Hoist loop-invariant control flow -------
193 collectHomogenousInstGraphLoopInvariants(const Loop & L,Instruction & Root,const LoopInfo & LI) collectHomogenousInstGraphLoopInvariants() argument
235 replaceLoopInvariantUses(const Loop & L,Value * Invariant,Constant & Replacement) replaceLoopInvariantUses() argument
252 areLoopExitPHIsLoopInvariant(const Loop & L,const BasicBlock & ExitingBB,const BasicBlock & ExitBB) areLoopExitPHIsLoopInvariant() argument
294 buildPartialInvariantUnswitchConditionalBranch(BasicBlock & BB,ArrayRef<Value * > ToDuplicate,bool Direction,BasicBlock & UnswitchedSucc,BasicBlock & NormalSucc,Loop & L,MemorySSAUpdater * MSSAU) buildPartialInvariantUnswitchConditionalBranch() argument
409 hoistLoopToNewParent(Loop & L,BasicBlock & Preheader,DominatorTree & DT,LoopInfo & LI,MemorySSAUpdater * MSSAU,ScalarEvolution * SE) hoistLoopToNewParent() argument
509 unswitchTrivialBranch(Loop & L,BranchInst & BI,DominatorTree & DT,LoopInfo & LI,ScalarEvolution * SE,MemorySSAUpdater * MSSAU) unswitchTrivialBranch() argument
743 unswitchTrivialSwitch(Loop & L,SwitchInst & SI,DominatorTree & DT,LoopInfo & LI,ScalarEvolution * SE,MemorySSAUpdater * MSSAU) unswitchTrivialSwitch() argument
1048 unswitchAllTrivialConditions(Loop & L,DominatorTree & DT,LoopInfo & LI,ScalarEvolution * SE,MemorySSAUpdater * MSSAU) unswitchAllTrivialConditions() argument
1168 buildClonedLoopBlocks(Loop & L,BasicBlock * LoopPH,BasicBlock * SplitBB,ArrayRef<BasicBlock * > ExitBlocks,BasicBlock * ParentBB,BasicBlock * UnswitchedSuccBB,BasicBlock * ContinueSuccBB,const SmallDenseMap<BasicBlock *,BasicBlock *,16> & DominatingSucc,ValueToValueMapTy & VMap,SmallVectorImpl<DominatorTree::UpdateType> & DTUpdates,AssumptionCache & AC,DominatorTree & DT,LoopInfo & LI,MemorySSAUpdater * MSSAU,ScalarEvolution * SE) buildClonedLoopBlocks() argument
1397 Loop *ClonedParentL, *L; cloneLoopNest() local
1672 deleteDeadClonedBlocks(Loop & L,ArrayRef<BasicBlock * > ExitBlocks,ArrayRef<std::unique_ptr<ValueToValueMapTy>> VMaps,DominatorTree & DT,MemorySSAUpdater * MSSAU) deleteDeadClonedBlocks() argument
1701 deleteDeadBlocksFromLoop(Loop & L,SmallVectorImpl<BasicBlock * > & ExitBlocks,DominatorTree & DT,LoopInfo & LI,MemorySSAUpdater * MSSAU,ScalarEvolution * SE,LPMUpdater & LoopUpdater) deleteDeadBlocksFromLoop() argument
1795 recomputeLoopBlockSet(Loop & L,LoopInfo & LI) recomputeLoopBlockSet() argument
1906 rebuildLoopAfterUnswitch(Loop & L,ArrayRef<BasicBlock * > ExitBlocks,LoopInfo & LI,SmallVectorImpl<Loop * > & HoistedLoops,ScalarEvolution * SE) rebuildLoopAfterUnswitch() argument
1984 __anondb665f8c1102(Loop &L, SmallPtrSetImpl<BasicBlock *> &UnloopedBlocks) rebuildLoopAfterUnswitch() argument
2138 postUnswitch(Loop & L,LPMUpdater & U,StringRef LoopName,bool CurrentLoopValid,bool PartiallyInvariant,bool InjectedCondition,ArrayRef<Loop * > NewLoops) postUnswitch() argument
2176 unswitchNontrivialInvariants(Loop & L,Instruction & TI,ArrayRef<Value * > Invariants,IVConditionInfo & PartialIVInfo,DominatorTree & DT,LoopInfo & LI,AssumptionCache & AC,ScalarEvolution * SE,MemorySSAUpdater * MSSAU,LPMUpdater & LoopUpdater,bool InsertFreeze,bool InjectedCondition) unswitchNontrivialInvariants() argument
2762 turnGuardIntoBranch(IntrinsicInst * GI,Loop & L,DominatorTree & DT,LoopInfo & LI,MemorySSAUpdater * MSSAU) turnGuardIntoBranch() argument
2819 CalculateUnswitchCostMultiplier(const Instruction & TI,const Loop & L,const LoopInfo & LI,const DominatorTree & DT,ArrayRef<NonTrivialUnswitchCandidate> UnswitchCandidates) CalculateUnswitchCostMultiplier() argument
2900 collectUnswitchCandidates(SmallVectorImpl<NonTrivialUnswitchCandidate> & UnswitchCandidates,IVConditionInfo & PartialIVInfo,Instruction * & PartialIVCondBranch,const Loop & L,const LoopInfo & LI,AAResults & AA,const MemorySSAUpdater * MSSAU) collectUnswitchCandidates() argument
2995 canonicalizeForInvariantConditionInjection(ICmpInst::Predicate & Pred,Value * & LHS,Value * & RHS,BasicBlock * & IfTrue,BasicBlock * & IfFalse,const Loop & L) canonicalizeForInvariantConditionInjection() argument
3021 shouldTryInjectInvariantCondition(const ICmpInst::Predicate Pred,const Value * LHS,const Value * RHS,const BasicBlock * IfTrue,const BasicBlock * IfFalse,const Loop & L) shouldTryInjectInvariantCondition() argument
3081 injectPendingInvariantConditions(NonTrivialUnswitchCandidate Candidate,Loop & L,DominatorTree & DT,LoopInfo & LI,AssumptionCache & AC,MemorySSAUpdater * MSSAU) injectPendingInvariantConditions() argument
3180 insertCandidatesWithPendingInjections(SmallVectorImpl<NonTrivialUnswitchCandidate> & UnswitchCandidates,Loop & L,ICmpInst::Predicate Pred,ArrayRef<CompareDesc> Compares,const DominatorTree & DT) insertCandidatesWithPendingInjections() argument
3219 collectUnswitchCandidatesWithInjections(SmallVectorImpl<NonTrivialUnswitchCandidate> & UnswitchCandidates,IVConditionInfo & PartialIVInfo,Instruction * & PartialIVCondBranch,Loop & L,const DominatorTree & DT,const LoopInfo & LI,AAResults & AA,const MemorySSAUpdater * MSSAU) collectUnswitchCandidatesWithInjections() argument
3272 isSafeForNoNTrivialUnswitching(Loop & L,LoopInfo & LI) isSafeForNoNTrivialUnswitching() argument
3316 findBestNonTrivialUnswitchCandidate(ArrayRef<NonTrivialUnswitchCandidate> UnswitchCandidates,const Loop & L,const DominatorTree & DT,const LoopInfo & LI,AssumptionCache & AC,const TargetTransformInfo & TTI,const IVConditionInfo & PartialIVInfo) findBestNonTrivialUnswitchCandidate() argument
3472 shouldInsertFreeze(Loop & L,Instruction & TI,DominatorTree & DT,AssumptionCache & AC) shouldInsertFreeze() argument
3492 unswitchBestCondition(Loop & L,DominatorTree & DT,LoopInfo & LI,AssumptionCache & AC,AAResults & AA,TargetTransformInfo & TTI,ScalarEvolution * SE,MemorySSAUpdater * MSSAU,LPMUpdater & LoopUpdater) unswitchBestCondition() argument
3585 unswitchLoop(Loop & L,DominatorTree & DT,LoopInfo & LI,AssumptionCache & AC,AAResults & AA,TargetTransformInfo & TTI,bool Trivial,bool NonTrivial,ScalarEvolution * SE,MemorySSAUpdater * MSSAU,ProfileSummaryInfo * PSI,BlockFrequencyInfo * BFI,LPMUpdater & LoopUpdater) unswitchLoop() argument
3589 unswitchLoop(Loop & L,DominatorTree & DT,LoopInfo & LI,AssumptionCache & AC,AAResults & AA,TargetTransformInfo & TTI,bool Trivial,bool NonTrivial,ScalarEvolution * SE,MemorySSAUpdater * MSSAU,ProfileSummaryInfo * PSI,BlockFrequencyInfo * BFI,LPMUpdater & LoopUpdater) unswitchLoop() argument
3632 __anondb665f8c1e02(const Loop *L) unswitchLoop() argument
3680 run(Loop & L,LoopAnalysisManager & AM,LoopStandardAnalysisResults & AR,LPMUpdater & U) run() argument
3685 ProfileSummaryInfo *PSI = nullptr; run() local
[all...]
/freebsd/share/doc/usd/21.troff/
H A Dtable21 .\" Copyright (C) Caldera International Inc. 2001-2002. All rights reserved.
60 Input Naming Conventions for \', \`, and \-
61 and for Non-ASCII Special Characters
68 Non-\s-1ASCII\s+1 characters and \fIminus\fP on the standard fonts.
87 - \- hyphen or
89 \- \e\- current font minus
125 Non-\s-1ASCII\s+1 characters and \', \`, \_\|, \(pl, \(mi, \(eq, and \(** on the special font.
131 \fIonly\fR on the special font and are printed as a 1-em space if that font
143 .ch cl \nmu-\n(.vu-1u
165 \(*l \e\|(*l lambda
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/
H A DLoopVectorizationLegality.h1 //===- llvm/Transforms/Vectorize/LoopVectorizationLegality.h ----*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
24 //===----------------------------------------------------------------------===//
70 /// Hint - associates name and validation with the hint value.
73 unsigned Value; // This may have to change for non-numeric values.
108 FK_Undefined = -1, ///< Not selected.
115 SK_Unspecified = -1,
118 /// Vectorize loops using scalable vectors or fixed-width vectors, but favor
119 /// scalable vectors when the cost-model is inconclusive. This is the
[all …]
H A DLoopVectorize.h1 //===- LoopVectorize.h ------------------------------------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
10 // and generates target-independent LLVM-IR.
20 // 2. LoopVectorizationLegality - A unit that checks for the legality
22 // 3. InnerLoopVectorizer - A unit that performs the actual
24 // 4. LoopVectorizationCostModel - A unit that checks for the profitability
31 // http://lists.llvm.org/pipermail/llvm-dev/2017-December/119523.html). For this
32 // purpose, we temporarily introduced the VPlan-native vectorization path: an
36 //===----------------------------------------------------------------------===//
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DSelectOptimize.cpp1 //===--- SelectOptimize.cpp - Convert select to branches if profitable ---===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
47 #define DEBUG_TYPE "select-optimize"
54 "Number of select groups converted due to high-predictability");
60 "Number of select groups converted due to loop-level analysis");
64 "cold-operand-threshold",
69 "cold-operand-max-cost-multiplier",
75 GainGradientThreshold("select-opti-loop-gradient-gain-threshold",
[all …]
/freebsd/contrib/mandoc/
H A Deqn.727 language is an equation-formatting language.
59 case-sensitive literals in the input:
60 .Bd -literal -offset indent
91 White-space consists of the space, tab, circumflex, and tilde
109 lambda, mu, nu, omega, omicron, phi, pi, psi, rho, sigma, tau, theta,
110 upsilon, xi, zeta, DELTA, GAMMA, LAMBDA, OMEGA, PHI, PI, PSI, SIGMA,
113 differential), times (multiply), cdot (center-dot), nothing (zero-width
114 space), approx (approximately equals), prime (prime), half (one-half),
116 (much less), <\- (left arrow), \-> (right arrow), +\- (plus-minus), !=
117 (not equal), == (equivalence), <= (less-than-equal), and >=
[all …]
H A Dmandoc_char.75 .\" Copyright (c) 2011, 2013, 2015, 2017-2020, 2022
61 In particular, in English manual pages, do not use special-character
67 the en-dash (\(en),
68 the em-dash (\(em),
75 .Bd -unfilled -offset indent
76 blue-eyed
77 lorry-driver
80 The en-dash is used to separate the two elements of a range,
81 or can be used the same way as an em-dash.
84 .Bd -unfilled -offset indent
[all …]
H A Dchars.c60 { "rn", "-", 0x203e },
91 { "em", "--", 0x2014 },
92 { "en", "-", 0x2013 },
93 { "hy", "-", 0x2010 },
129 { "lt", ",-", 0x23a7 },
130 { "bracelefttp", ",-", 0x23a7 },
133 { "lb", "`-", 0x23a9 },
134 { "braceleftbt", "`-", 0x23a9 },
136 { "rt", "-.", 0x23ab },
137 { "bracerighttp", "-.", 0x23ab },
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp1 //===- SampleProfile.cpp - Incorporate sample profiles into the IR --------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
10 // reads a profile file generated by a sampling profiler (e.g. Linux Perf -
16 // - prof: Represents branch weights. This annotation is added to branches
22 //===----------------------------------------------------------------------===//
99 #define DEBUG_TYPE "sample-profile"
100 #define CSINLINE_DEBUG DEBUG_TYPE "-inline"
123 "sample-profile-file", cl::init(""), cl::value_desc("filename"),
124 cl::desc("Profile file loaded by -sample-profile"), cl::Hidden);
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DInlineCost.cpp1 //===- InlineCost.cpp - Cost analysis for inliner -------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
31 #include "llvm/Config/llvm-config.h"
52 #define DEBUG_TYPE "inline-cost"
57 DefaultThreshold("inlinedefault-threshold", cl::Hidden, cl::init(225),
60 // We introduce this option since there is a minor compile-time win by avoiding
61 // addition of TTI attributes (target-features in particular) to inline
66 "ignore-tti-inline-compatible", cl::Hidden, cl::init(false),
[all …]
H A DInlineOrder.cpp1 //===- InlineOrder.cpp - Inlining order abstraction -*- C++ ---*-----------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
23 #define DEBUG_TYPE "inline-order"
28 "inline-priority-mode", cl::init(InlinePriorityMode::Size), cl::Hidden,
34 clEnumValN(InlinePriorityMode::CostBenefit, "cost-benefit",
35 "Use cost-benefit ratio."),
39 "module-inliner-top-priority-threshold", cl::Hidden, cl::init(0),
41 "cost-benefit analysis"));
49 ProfileSummaryInfo *PSI = in getInlineCostWrapper() local
[all …]
/freebsd/contrib/netbsd-tests/sys/uvm/
H A Dt_uvm_physseg_load.c3 /*-
57 /* Testing API - assumes userland */
114 #define mutex_enter(l) argument
115 #define mutex_exit(l) argument
169 /* end - Provide Kernel API equivalents */
173 #include <atf-c.h>
220 printf("%s: seg->start == %ld\n", __func__, in uvm_physseg_dump_seg()
222 printf("%s: seg->end == %ld\n", __func__, in uvm_physseg_dump_seg()
224 printf("%s: seg->avail_start == %ld\n", __func__, in uvm_physseg_dump_seg()
226 printf("%s: seg->avail_end == %ld\n", __func__, in uvm_physseg_dump_seg()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DUnrollLoop.h1 //===- llvm/Transforms/Utils/UnrollLoop.h - Unrolling utilities -*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
13 //===----------------------------------------------------------------------===//
60 /// The loop was partially unrolled -- we still have a loop, but with a
62 /// had a non-constant trip count.
65 /// The loop was fully unrolled into straight-line code. We no longer have
66 /// any back-edges.
80 LoopUnrollResult UnrollLoop(Loop *L, UnrollLoopOptions ULO, LoopInfo *LI,
89 Loop *L, unsigned Count, bool AllowExpensiveTripCount,
[all …]
H A DSampleProfileLoaderBaseImpl.h1 ////===- SampleProfileLoadBaseImpl.h - Profile loader base impl --*- C++-*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
13 //===----------------------------------------------------------------------===//
56 #define DEBUG_TYPE "sample-profile-impl"
77 return &F->getEntryBlock();
95 for (const auto *Operand : FuncInfo->operands()) {
97 auto GUID = mdconst::dyn_extract<ConstantInt>(MD->getOperand(0))
98 ->getZExtValue();
99 auto Hash = mdconst::dyn_extract<ConstantInt>(MD->getOperand(1))
[all …]
/freebsd/tools/tools/locale/etc/charmaps/
H A DISO8859-7.TXT3 # Name: ISO 8859-7:2003 to Unicode
7 # Date: 2003-Nov-12
10 # Copyright (c) 1991-2003 Unicode, Inc. All Rights reserved.
12 # This file is provided as-is by Unicode, Inc. (The Unicode Consortium).
29 # ISO 8859-7:2003 characters map into Unicode.
31 # ISO 8859-7:1987 is equivalent to ISO-IR-126, ELOT 928,
32 # and ECMA 118. ISO 8859-7:2003 adds two currency signs
35 # Format: Three tab-separated columns
36 # Column #1 is the ISO 8859-7 code (in hex as 0xXX)
40 # The entries are in ISO 8859-7 order.
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DPGOInstrumentation.cpp1 //===- PGOInstrumentation.cpp - MST-based PGO Instrumentation -------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
13 // Issue 3, pp 313-322
20 // The minimal spanning tree here is actually a maximum weight tree -- on-tree
48 //===----------------------------------------------------------------------===//
133 #define DEBUG_TYPE "pgo-instrumentation"
139 STATISTIC(NumOfPGOBB, "Number of basic-blocks.");
151 STATISTIC(NumOfCSPGOBB, "Number of basic-blocks in CSPGO.");
163 PGOTestProfileFile("pgo-test-profile-file", cl::init(""), cl::Hidden,
[all …]
/freebsd/contrib/file/tests/
H A DHWP97.hwp.testfile1ll�o� �W�o�r�l�d� �H�W�P�2�0�1�6�����������������������������������������������������������������…
3 XH�N[�ύ\��;��!��,��n�%��� l�#N�\���T.�X��}�)u�n�k롞%]��qۃ�"��,�jv �װ�a�/���^�����u�亮h��t{��…
4 d\އ�&R/[�7�-��ہ�}��A��%�䔓���_XZ�5-r]^��
5 …�ǿ�F���5��)_�/d��l�#�bv�׃C-�νuY­wu-E�#rY���a"�"��; >A�������7����{���$��܅y҅���\t�8���#S&O� 貔�…
6 �1n��n$�d���-%R!6O�B��^묘j���-x��������6��J�}��F ��NK�Y�Q�u�9��F�Ŋ��0��+&�Iw4�I��{�fߍǮ����9…
8 �7�s����-đ��0��uC�D:�:�Yޣ��I�D��~��:��~V��mqL�rQ9L�#������ 9�}\��q]ɰ^6�G�����] ��Փ3Q׻�…
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp1 //===- LoopVectorize.cpp - A Loop Vectorizer ------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
10 // and generates target-independent LLVM-IR.
20 // 2. LoopVectorizationLegality - A unit that checks for the legality
22 // 3. InnerLoopVectorizer - A unit that performs the actual
24 // 4. LoopVectorizationCostModel - A unit that checks for the profitability
31 // http://lists.llvm.org/pipermail/llvm-dev/2017-December/119523.html). For this
32 // purpose, we temporarily introduced the VPlan-native vectorization path: an
36 //===----------------------------------------------------------------------===//
[all …]
/freebsd/crypto/libecc/src/examples/hash/
H A Dgostr34_11_94.c2 * Copyright (C) 2021 - This file is part of libecc project
13 /* The 8 4-bit GOST block cipher encryption SBOX */
75 unsigned int phi_idx = (8 * GOSTR34_11_94_STATE_SIZE) - (i + (4 * (k - 1))); in gostr34_11_94_P()
77 y_[phi_idx - 1] = y[phi - 1]; in gostr34_11_94_P()
114 GET_UINT64_LE(C, (const u8*)&gostr34_11_94_C[i - 1][j], 0); in gostr34_11_94_key_generation()
158 GET_UINT32_LE(sk, k, (4 * (7 - (round % 8)))); in gostr34_11_94_block_encryption()
166 sb_idx = (2 * (3 - i)); in gostr34_11_94_block_encryption()
173 /* Rotation by 11 and XOR with L */ in gostr34_11_94_block_encryption()
217 * in order to apply our Psi function).
243 * where Γ is split into sixteen 16-bit words, i.e. Γ = γ15 γ14 · · · γ0. in gostr34_11_94_state_psi()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DSwitchLoweringUtils.h1 //===- SwitchLoweringUtils.h - Switch Lowering --------
[all...]

123