| /macosx-10.9.5/tcl-102/tcl_ext/tcllib/tcllib/modules/ripemd/ |
| H A D | ripemd128.tcl | 209 set A $state(A) ; set AA $state(A)
325 set AA [expr {($AA + [I $BB $CC $DD] + $X5 + 0x50a28be6) <<< 8}]
326 set DD [expr {($DD + [I $AA $BB $CC] + $X14 + 0x50a28be6) <<< 9}]
327 set CC [expr {($CC + [I $DD $AA $BB] + $X7 + 0x50a28be6) <<< 9}]
328 set BB [expr {($BB + [I $CC $DD $AA] + $X0 + 0x50a28be6) <<< 11}]
330 set AA [expr {($AA + [I $BB $CC $DD] + $X9 + 0x50a28be6) <<< 13}]
331 set DD [expr {($DD + [I $AA $BB $CC] + $X2 + 0x50a28be6) <<< 15}]
332 set CC [expr {($CC + [I $DD $AA
[all...] |
| H A D | ripemd160.tcl | 228 set A $state(A) ; set AA $state(A)
319 JJJ AA BB CC DD EE $X5 8
320 JJJ EE AA BB CC DD $X14 9
321 JJJ DD EE AA BB CC $X7 9
322 JJJ CC DD EE AA BB $X0 11
323 JJJ BB CC DD EE AA $X9 13
324 JJJ AA BB CC DD EE $X2 15
325 JJJ EE AA BB CC DD $X11 15
326 JJJ DD EE AA BB CC $X4 5
327 JJJ CC DD EE AA B
[all...] |
| /macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Analysis/ |
| H A D | Loads.h | 52 AliasAnalysis *AA = 0,
|
| H A D | AliasSetTracker.h | 255 void addUnknownInst(Instruction *I, AliasAnalysis &AA);
271 AliasAnalysis &AA) const;
272 bool aliasesUnknownInst(Instruction *Inst, AliasAnalysis &AA) const;
296 AliasAnalysis &AA; member in class:llvm::AliasSetTracker
310 explicit AliasSetTracker(AliasAnalysis &aa) : AA(aa) {}
374 AliasAnalysis &getAliasAnalysis() const { return AA; }
|
| /macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Scalar/ |
| H A D | DeadStoreElimination.cpp | 46 AliasAnalysis *AA; member in struct:__anon10570::DSE
52 DSE() : FunctionPass(ID), AA(0), MD(0), DT(0) {
57 AA = &getAnalysis<AliasAnalysis>();
60 TLI = AA->getTargetLibraryInfo();
69 AA = 0; MD = 0; DT = 0;
192 getLocForWrite(Instruction *Inst, AliasAnalysis &AA) { argument
194 return AA.getLocation(SI);
198 AliasAnalysis::Location Loc = AA.getLocationForDest(MI);
202 if (Loc.Size == AliasAnalysis::UnknownSize && AA.getTargetData() == 0)
216 if (AA
231 getLocForRead(Instruction *Inst, AliasAnalysis &AA) argument
319 getPointerSize(const Value *V, AliasAnalysis &AA) argument
339 isOverwrite(const AliasAnalysis::Location &Later, const AliasAnalysis::Location &Earlier, AliasAnalysis &AA, int64_t &EarlierOff, int64_t &LaterOff) argument
457 isPossibleSelfRead(Instruction *Inst, const AliasAnalysis::Location &InstStoreLoc, Instruction *DepWrite, AliasAnalysis &AA) argument
[all...] |
| H A D | Sink.cpp | 36 AliasAnalysis *AA; member in class:__anon10642::Sinking
101 AA = &getAnalysis<AliasAnalysis>();
156 static bool isSafeToMove(Instruction *Inst, AliasAnalysis *AA, argument
165 AliasAnalysis::Location Loc = AA->getLocation(L);
168 if (AA->getModRefInfo(*I, Loc) & AliasAnalysis::Mod)
222 if (!isSafeToMove(Inst, AA, Stores))
|
| /macosx-10.9.5/tcpdump-56/tcpdump/tests/ |
| H A D | print-flags.sh | 3 for i in x xx X XX A AA; do
|
| /macosx-10.9.5/llvmCore-3425.0.33/lib/Analysis/ |
| H A D | AliasAnalysis.cpp | 52 assert(AA && "AA didn't call InitializeAliasAnalysis in its run method!");
53 return AA->alias(LocA, LocB);
58 assert(AA && "AA didn't call InitializeAliasAnalysis in its run method!");
59 return AA->pointsToConstantMemory(Loc, OrLocal);
63 assert(AA && "AA didn't call InitializeAliasAnalysis in its run method!");
64 AA->deleteValue(V);
68 assert(AA
[all...] |
| H A D | AliasSetTracker.cpp | 44 AliasAnalysis &AA = AST.getAliasAnalysis(); local
49 if (AA.alias(AliasAnalysis::Location(L->getValue(),
103 AliasAnalysis &AA = AST.getAliasAnalysis(); local
105 AA.alias(AliasAnalysis::Location(P->getValue(), P->getSize(),
126 void AliasSet::addUnknownInst(Instruction *I, AliasAnalysis &AA) { argument
145 AliasAnalysis &AA) const {
153 return AA.alias(AliasAnalysis::Location(SomePtr->getValue(),
162 if (AA.alias(AliasAnalysis::Location(Ptr, Size, TBAAInfo),
170 if (AA.getModRefInfo(UnknownInsts[i],
179 bool AliasSet::aliasesUnknownInst(Instruction *Inst, AliasAnalysis &AA) cons
[all...] |
| H A D | Loads.cpp | 171 AliasAnalysis *AA,
177 if (AA) {
179 AccessSize = AA->getTypeStoreSize(AccessTy);
224 if (AA &&
225 (AA->getModRefInfo(SI, Ptr, AccessSize) & AliasAnalysis::Mod) == 0)
237 if (AA &&
238 (AA->getModRefInfo(Inst, Ptr, AccessSize) & AliasAnalysis::Mod) == 0)
168 FindAvailableLoadedValue(Value *Ptr, BasicBlock *ScanBB, BasicBlock::iterator &ScanFrom, unsigned MaxInstsToScan, AliasAnalysis *AA, MDNode **TBAATag) argument
|
| H A D | AliasAnalysisEvaluator.cpp | 132 AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); local
175 if (I1ElTy->isSized()) I1Size = AA.getTypeStoreSize(I1ElTy);
180 if (I2ElTy->isSized()) I2Size = AA.getTypeStoreSize(I2ElTy);
182 switch (AA.alias(*I1, I1Size, *I2, I2Size)) {
209 if (ElTy->isSized()) Size = AA.getTypeStoreSize(ElTy);
211 switch (AA.getModRefInfo(*C, *V, Size)) {
234 switch (AA.getModRefInfo(*C, *D)) {
|
| H A D | MemoryDependenceAnalysis.cpp | 91 AA = &getAnalysis<AliasAnalysis>();
121 AliasAnalysis *AA) {
124 Loc = AA->getLocation(LI);
127 Loc = AA->getLocation(LI);
136 Loc = AA->getLocation(SI);
139 Loc = AA->getLocation(SI);
147 Loc = AA->getLocation(V);
151 if (const CallInst *CI = isFreeCall(Inst, AA->getTargetLibraryInfo())) {
208 AliasAnalysis::ModRefResult MR = GetLocation(Inst, Loc, AA);
211 if (AA
119 GetLocation(const Instruction *Inst, AliasAnalysis::Location &Loc, AliasAnalysis *AA) argument
[all...] |
| H A D | LoopDependenceAnalysis.cpp | 96 static AliasAnalysis::AliasResult UnderlyingObjectsAlias(AliasAnalysis *AA, argument
101 return AA->alias(aObj, AA->getTypeStoreSize(aObj->getType()),
102 bObj, AA->getTypeStoreSize(bObj->getType()));
228 switch (UnderlyingObjectsAlias(AA, aPtr, bPtr)) {
316 AA = &getAnalysis<AliasAnalysis>();
|
| H A D | MemDepPrinter.cpp | 96 AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); local
130 AliasAnalysis::Location Loc = AA.getLocation(LI);
139 AliasAnalysis::Location Loc = AA.getLocation(SI);
142 AliasAnalysis::Location Loc = AA.getLocation(VI);
|
| /macosx-10.9.5/llvmCore-3425.0.33/lib/CodeGen/ |
| H A D | ScheduleDAGInstrs.cpp | 42 cl::desc("Enable use of AA during MI GAD construction"));
422 static inline bool isGlobalMemoryObject(AliasAnalysis *AA, MachineInstr *MI) { argument
425 (!MI->mayLoad() || !MI->isInvariantLoad(AA))))
468 static bool MIsNeedChainEdge(AliasAnalysis *AA, const MachineFrameInfo *MFI, argument
483 // To this point analysis is generic. From here on we do need AA.
484 if (!AA)
494 // The following interface to AA is fashioned after DAGCombiner::isAlias
506 // FIXME: Even before we go to AA we can reason locally about some
517 AliasAnalysis::AliasResult AAResult = AA->alias(
529 iterateChainSucc(AliasAnalysis *AA, cons argument
575 adjustChainDeps(AliasAnalysis *AA, const MachineFrameInfo *MFI, SUnit *SU, SUnit *ExitSU, std::set<SUnit *> &CheckList, unsigned LatencyToLoad) argument
606 addChainDependency(AliasAnalysis *AA, const MachineFrameInfo *MFI, SUnit *SUa, SUnit *SUb, std::set<SUnit *> &RejectList, unsigned TrueMemOrderLatency = 0, bool isNormalMemory = false) argument
661 buildSchedGraph(AliasAnalysis *AA, RegPressureTracker *RPTracker) argument
[all...] |
| /macosx-10.9.5/Heimdal-323.92.1/lib/hcrypto/ |
| H A D | sha256.c | 95 uint32_t AA, BB, CC, DD, EE, FF, GG, HH; local
99 AA = A;
118 T2 = Sigma0(AA) + Maj(AA,BB,CC);
126 BB = AA;
127 AA = T1 + T2;
130 A += AA;
|
| H A D | sha512.c | 119 uint64_t AA, BB, CC, DD, EE, FF, GG, HH; local
123 AA = A;
142 T2 = Sigma0(AA) + Maj(AA,BB,CC);
150 BB = AA;
151 AA = T1 + T2;
154 A += AA;
|
| H A D | sha.c | 73 temp = cshift(AA, 5) + f(BB,CC,DD) + EE + data[t] + k; \
77 BB = AA; \
78 AA = temp; \
84 uint32_t AA, BB, CC, DD, EE; local
88 AA = A;
191 A += AA;
|
| /macosx-10.9.5/llvmCore-3425.0.33/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGVLIW.cpp | 65 /// AA - AliasAnalysis for making memory reference queries.
66 AliasAnalysis *AA; member in class:__anon10206::ScheduleDAGVLIW
72 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue), AA(aa) {
100 BuildSchedGraph(AA);
275 return new ScheduleDAGVLIW(*IS->MF, IS->AA, new ResourcePriorityQueue(IS));
|
| /macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/IPO/ |
| H A D | FunctionAttrs.cpp | 45 FunctionAttrs() : CallGraphSCCPass(ID), AA(0) {
72 AliasAnalysis *AA; member in struct:__anon10531::FunctionAttrs
105 AliasAnalysis::ModRefBehavior MRB = AA->getModRefBehavior(F);
132 AliasAnalysis::ModRefBehavior MRB = AA->getModRefBehavior(CS);
147 if (!AA->pointsToConstantMemory(Loc, /*OrLocal=*/true)) {
169 AliasAnalysis::Location Loc = AA->getLocation(LI);
170 if (AA->pointsToConstantMemory(Loc, /*OrLocal=*/true))
176 AliasAnalysis::Location Loc = AA->getLocation(SI);
177 if (AA->pointsToConstantMemory(Loc, /*OrLocal=*/true))
182 AliasAnalysis::Location Loc = AA
[all...] |
| H A D | ArgumentPromotion.cpp | 454 AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); local
462 AliasAnalysis::Location Loc = AA.getLocation(Load);
463 if (AA.canInstructionRangeModify(BB->front(), *Load, Loc))
474 if (AA.canBasicBlockModify(**I, Loc))
616 AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); local
662 // TODO: Tell AA about the new values?
692 AA.copyValue(OrigLoad->getOperand(0), V);
702 AA.copyValue(OrigLoad, Args.back());
735 AA.replaceWithNewValue(Call, New);
766 AA
[all...] |
| /macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Utils/ |
| H A D | LoopSimplify.cpp | 73 // AA - If we have an alias analysis object to update, this is it, otherwise
75 AliasAnalysis *AA; member in struct:__anon10650::LoopSimplify
130 AA = getAnalysisIfAvailable<AliasAnalysis>();
270 if (AA) AA->deleteValue(PN);
462 AliasAnalysis *AA, LoopInfo *LI) {
469 if (AA) AA->deleteValue(PN);
549 PHINode *PN = FindPHIToPartitionLoops(L, DT, AA, LI);
690 if (AA) A
461 FindPHIToPartitionLoops(Loop *L, DominatorTree *DT, AliasAnalysis *AA, LoopInfo *LI) argument
[all...] |
| /macosx-10.9.5/tcl-102/tcl_ext/tktable/tktable/demos/ |
| H A D | spreadsheet.tcl | 17 page AA
20 AA orange
65 tk_optionMenu .page table(page) AA BB CC DD
|
| /macosx-10.9.5/passwordserver_sasl-170/cyrus_sasl/mac/libdes/src/ |
| H A D | sha.c | 93 /*
* Copyright (c) 1995, 1996, 1997, 1998 Kungliga Tekniska H�gskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the Kungliga Tekniska
* H�gskolan and its contributors.
*
* 4. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
RCSID("$Id: sha.c,v 1.4 2005/01/10 19:09:08 snsimon Exp $");
#endif
#include <stdlib.h>
#include <string.h>
#include "sha.h"
#ifndef min
#define min(a,b) (((a)>(b))?(b):(a))
#endif
#define A m->counter[0]
#define B m->counter[1]
#define C m->counter[2]
#define D m->counter[3]
#define E m->counter[4]
#define X data
void
sha_init (struct sha *m)
{
m->offset = 0;
m->sz = 0;
A = 0x67452301;
B = 0xefcdab89;
C = 0x98badcfe;
D = 0x10325476;
E = 0xc3d2e1f0;
}
static inline u_int32_t
cshift (u_int32_t x, unsigned int n)
{
return (x << n) | (x >> (32 - n));
}
#define F0(x,y,z) ((x & y) | (~x & z))
#define F1(x,y,z) (x ^ y ^ z)
#define F2(x,y,z) ((x & y) | (x & z) | (y & z))
#define F3(x,y,z) F1(x,y,z)
#define K0 0x5a827999
#define K1 0x6ed9eba1
#define K2 0x8f1bbcdc
#define K3 0xca62c1d6
#define DO(t,f,k) \
do { \
u_int32_t temp; \
\
temp = cshift(AA, 5) + f(BB,CC,DD) + EE + data[t] + k; \
EE = DD; \
DD = CC; \
CC = cshift(BB, 30); \
BB = AA; \
AA = temp; \
} while(0)
static inline void
calc (struct sha *m, u_int32_t *in)
{
u_int32_t AA, BB, CC, DD, EE;
u_int32_t data[80];
int i;
AA = A;
BB = B;
CC = C;
DD = D;
EE = E;
for (i = 0; i < 16; ++i)
data[i] = in[i];
for (i = 16; i < 80; ++i)
data[i] = cshift(data[i-3] ^ data[i-8] ^ data[i-14] ^ data[i-16], 1);
/* t=[0,19] */
DO(0,F0,K0);
DO(1,F0,K0);
DO(2,F0,K0);
DO(3,F0,K0);
DO(4,F0,K0);
DO(5,F0,K0);
DO(6,F0,K0);
DO(7,F0,K0);
DO(8,F0,K0);
DO(9,F0,K0);
DO(10,F0,K0);
DO(11,F0,K0);
DO(12,F0,K0);
DO(13,F0,K0);
DO(14,F0,K0);
DO(15,F0,K0);
DO(16,F0,K0);
DO(17,F0,K0);
DO(18,F0,K0);
DO(19,F0,K0);
/* t=[20,39] */
DO(20,F1,K1);
DO(21,F1,K1);
DO(22,F1,K1);
DO(23,F1,K1);
DO(24,F1,K1);
DO(25,F1,K1);
DO(26,F1,K1);
DO(27,F1,K1);
DO(28,F1,K1);
DO(29,F1,K1);
DO(30,F1,K1);
DO(31,F1,K1);
DO(32,F1,K1);
DO(33,F1,K1);
DO(34,F1,K1);
DO(35,F1,K1);
DO(36,F1,K1);
DO(37,F1,K1);
DO(38,F1,K1);
DO(39,F1,K1);
/* t=[40,59] */
DO(40,F2,K2);
DO(41,F2,K2);
DO(42,F2,K2);
DO(43,F2,K2);
DO(44,F2,K2);
DO(45,F2,K2);
DO(46,F2,K2);
DO(47,F2,K2);
DO(48,F2,K2);
DO(49,F2,K2);
DO(50,F2,K2);
DO(51,F2,K2);
DO(52,F2,K2);
DO(53,F2,K2);
DO(54,F2,K2);
DO(55,F2,K2);
DO(56,F2,K2);
DO(57,F2,K2);
DO(58,F2,K2);
DO(59,F2,K2);
/* t=[60,79] */
DO(60,F3,K3);
DO(61,F3,K3);
DO(62,F3,K3);
DO(63,F3,K3);
DO(64,F3,K3);
DO(65,F3,K3);
DO(66,F3,K3);
DO(67,F3,K3);
DO(68,F3,K3);
DO(69,F3,K3);
DO(70,F3,K3);
DO(71,F3,K3);
DO(72,F3,K3);
DO(73,F3,K3);
DO(74,F3,K3);
DO(75,F3,K3);
DO(76,F3,K3);
DO(77,F3,K3);
DO(78,F3,K3);
DO(79,F3,K3);
A += AA;
B += BB;
C += CC;
D += DD;
E += EE;
}
/*
* From `Performance analysis of SHA' by Joseph (…)
1 /* local
|
| /macosx-10.9.5/llvmCore-3425.0.33/include/llvm/CodeGen/ |
| H A D | MachineScheduler.h | 54 AliasAnalysis *AA; member in struct:llvm::MachineSchedContext
197 AliasAnalysis *AA; member in class:llvm::ScheduleDAGMI
234 AA(C->AA), RegClassInfo(C->RegClassInfo), SchedImpl(S),
|