/external/apache-harmony/security/src/test/support/common/java/org/apache/harmony/security/tests/support/ |
MyKeyStore.java | 50 private Hashtable Chain = new Hashtable(); 71 if (Chain.containsKey(alias)) { 72 return (Certificate[]) Chain.get(alias); 92 Certificate[] chain) throws KeyStoreException { 97 if (chain != null) { 98 Chain.put(alias, chain); 103 public void engineSetKeyEntry(String alias, byte[] key, Certificate[] chain) 111 if (Chain.containsKey(alias)) { 112 Chain.remove(alias) [all...] |
/libcore/support/src/test/java/org/apache/harmony/security/tests/support/ |
MyKeyStore.java | 51 private Hashtable<String, Object> Chain = new Hashtable<String, Object>(); 72 if (Chain.containsKey(alias)) { 73 return (Certificate[]) Chain.get(alias); 93 Certificate[] chain) throws KeyStoreException { 98 if (chain != null) { 99 Chain.put(alias, chain); 104 public void engineSetKeyEntry(String alias, byte[] key, Certificate[] chain) 112 if (Chain.containsKey(alias)) { 113 Chain.remove(alias) [all...] |
/external/clang/include/clang/Serialization/ |
ModuleManager.h | 30 /// \brief The chain of AST files. The first entry is the one named by the 32 SmallVector<ModuleFile *, 2> Chain; 94 /// \brief The first visit() state in the chain. 111 ModuleIterator begin() { return Chain.begin(); } 113 ModuleIterator end() { return Chain.end(); } 117 ModuleConstIterator begin() const { return Chain.begin(); } 119 ModuleConstIterator end() const { return Chain.end(); } 123 ModuleReverseIterator rbegin() { return Chain.rbegin(); } 125 ModuleReverseIterator rend() { return Chain.rend(); } 129 ModuleFile &getPrimaryModule() { return *Chain[0]; [all...] |
ASTWriter.h | 110 ASTReader *Chain; 310 /// if its primary namespace comes from the chain. If it does, we add the 698 bool hasChain() const { return Chain; }
|
/external/llvm/lib/Target/MBlaze/ |
MBlazeISelDAGToDAG.cpp | 226 SDValue Chain = Node->getOperand(0); 238 SDValue Ops[] = { Callee, GPReg, Chain }; 241 Chain = Load.getValue(1); 244 Chain = CurDAG->getCopyToReg(Chain, dl, R20Reg, Load, InFlag); 247 Chain = CurDAG->getCopyToReg(Chain, dl, R20Reg, Callee, InFlag); 251 MVT::Glue, R20Reg, Chain); 252 Chain = SDValue(ResNode, 0); 254 ReplaceUses(SDValue(Node, 0), Chain); [all...] |
MBlazeISelLowering.cpp | 693 SDValue Chain = CLI.Chain; 722 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(NumBytes, true)); 770 MemOpChains.push_back(DAG.getStore(Chain, dl, Arg, PtrOff, 784 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, 788 // chain and flag operands which copy the outgoing args into registers. 793 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first, 795 InFlag = Chain.getValue(1) [all...] |
/external/llvm/lib/Target/XCore/ |
XCoreISelDAGToDAG.cpp | 228 /// Given a chain return a new chain where any appearance of Old is replaced 229 /// by New. There must be at most one instruction between Old and Chain and 233 replaceInChain(SelectionDAG *CurDAG, SDValue Chain, SDValue Old, SDValue New) 235 if (Chain == Old) 237 if (Chain->getOpcode() != ISD::TokenFactor) 241 for (unsigned i = 0, e = Chain->getNumOperands(); i != e; ++i) { 242 if (Chain->getOperand(i) == Old) { 246 Ops.push_back(Chain->getOperand(i)); 251 return CurDAG->getNode(ISD::TokenFactor, Chain->getDebugLoc(), MVT::Other [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
ScheduleDAGSDNodes.cpp | 208 SDNode *Chain = 0; 211 Chain = Node->getOperand(NumOps-1).getNode(); 212 if (!Chain) 215 // Look for other loads of the same chain. Find loads that are loading from 222 for (SDNode::use_iterator I = Chain->use_begin(), E = Chain->use_end(); 473 "Chain dependence via physreg data?"); 763 if (I->isCtrl()) continue; // ignore chain preds 772 if (II->isCtrl()) continue; // ignore chain preds [all...] |
LegalizeTypesGeneric.cpp | 252 SDValue Chain = LD->getChain(); 261 Lo = DAG.getLoad(NVT, dl, Chain, Ptr, LD->getPointerInfo(), 268 Hi = DAG.getLoad(NVT, dl, Chain, Ptr, 275 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1), 282 // Modified the chain - switch anything that used the old chain to use 284 ReplaceValueWith(SDValue(N, 1), Chain); 290 SDValue Chain = N->getOperand(0); 295 Lo = DAG.getVAArg(NVT, dl, Chain, Ptr, N->getOperand(2), Align); 302 // Modified the chain - switch anything that used the old chain to us [all...] |
LegalizeDAG.cpp | 305 SDValue Chain = ST->getChain(); 319 Result = DAG.getStore(Chain, dl, Result, Ptr, ST->getPointerInfo(), 339 SDValue Store = DAG.getTruncStore(Chain, dl, 404 Store1 = DAG.getTruncStore(Chain, dl, TLI.isLittleEndian()?Lo:Hi, Ptr, 410 Store2 = DAG.getTruncStore(Chain, dl, TLI.isLittleEndian()?Hi:Lo, Ptr, 427 SDValue Chain = LD->getChain(); 437 SDValue newLoad = DAG.getLoad(intVT, dl, Chain, Ptr, LD->getPointerInfo(), 447 ChainResult = Chain; 469 SDValue Load = DAG.getLoad(RegVT, dl, Chain, Ptr, 487 SDValue Load = DAG.getExtLoad(ISD::EXTLOAD, dl, RegVT, Chain, Ptr [all...] |
LegalizeVectorOps.cpp | 380 SDValue Chain = LD->getChain(); 416 ScalarLoad = DAG.getLoad(WideVT, dl, Chain, BasePTR, 426 ScalarLoad = DAG.getExtLoad(ISD::EXTLOAD, dl, WideVT, Chain, BasePTR, 497 Chain, BasePTR, LD->getPointerInfo().getWithOffset(Idx * Stride), 524 SDValue Chain = ST->getChain(); 557 SDValue Store = DAG.getTruncStore(Chain, dl, Ex, BasePTR,
|
LegalizeFloatTypes.cpp | 508 // Legalized the chain result - switch anything that used the old chain to 520 // Legalized the chain result - switch anything that used the old chain to 547 SDValue Chain = N->getOperand(0); // Get the chain. 554 NewVAARG = DAG.getVAArg(NVT, dl, Chain, Ptr, N->getOperand(2), 557 // Legalized the chain result - switch anything that used the old chain to [all...] |
/external/llvm/lib/Target/Mips/ |
MipsSEISelDAGToDAG.cpp | 447 SDValue Chain = CurDAG->getCopyToReg(CurDAG->getEntryNode(), DL, DestReg, 449 SDValue ResNode = CurDAG->getCopyFromReg(Chain, DL, DestReg, PtrVT);
|
/external/llvm/lib/Target/NVPTX/ |
NVPTXISelDAGToDAG.cpp | 217 SDValue Chain = N->getOperand(0); 239 Addr, Chain }; 259 Base, Offset, Chain }; 291 Base, Offset, Chain }; 322 N1, Chain }; 338 SDValue Chain = N->getOperand(0); 424 Addr, Chain }; 458 Base, Offset, Chain }; 518 Base, Offset, Chain }; 577 Op1, Chain }; [all...] |
/external/llvm/lib/Target/R600/ |
AMDILISelLowering.cpp | 384 SDValue Chain = Op.getOperand(0); 392 Chain, Jump, Cond);
|
SIISelLowering.cpp | 81 SDValue Chain, 170 InVals.push_back(DAG.getCopyFromReg(Chain, DL, Reg, VT)); 177 SDValue Val = DAG.getCopyFromReg(Chain, DL, Reg, VT); 191 Regs.push_back(DAG.getCopyFromReg(Chain, DL, Reg, VT)); 206 return Chain; 323 SDValue Chain = SDValue(Result, Result->getNumValues() - 1); 331 Chain = DAG.getCopyToReg( 332 Chain, DL, 340 // Remove the old intrinsic from the chain 345 return Chain; [all...] |
R600ISelLowering.cpp | 322 SDValue Chain = Op.getOperand(0); 332 return DAG.getCopyToReg(Chain, Op.getDebugLoc(), Reg, Op.getOperand(2)); 336 Chain, 454 // XXX: LLVM seems not to replace Chain Value inside CustomWidenLowerNode 717 SDValue Chain = Op.getOperand(0); 731 Chain = DAG.getStore(Chain, DL, Value, Ptr, StoreNode->getMemOperand()); 733 return Chain; 768 Chain, Elem, Ptr, 771 Chain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Stores, NumElemVT) [all...] |
/external/llvm/lib/CodeGen/ |
MachineBlockPlacement.cpp | 23 // first time it reaches a chain of basic blocks, it schedules them in the 57 /// \brief Type for our function-wide basic block -> block chain mapping. 62 /// \brief A chain of blocks which will be laid out contiguously. 64 /// This is the datastructure representing a chain of consecutive blocks that 66 /// probabilities and code locality. We also can use a block chain to represent 71 /// them. They participate in a block-to-chain mapping, which is updated 74 /// \brief The sequence of blocks belonging to this chain. 76 /// This is the sequence of blocks for a particular chain. These will be laid 80 /// \brief A handle to the function-wide basic block to block chain mapping. 82 /// This is retained in each block chain to simplify the computation of chil [all...] |
/external/llvm/lib/Target/Hexagon/ |
HexagonISelDAGToDAG.cpp | 338 SDValue Chain = LD->getChain(); 370 Chain); 387 SDValue Chain = LD->getChain(); 402 Chain); 423 Chain); 451 SDValue Chain = LD->getChain(); 467 TargetConstVal, Chain); 494 Base, TargetConst0, Chain); 525 SDValue Chain = LD->getChain(); 576 TargetConstVal, Chain); [all...] |
HexagonISelLowering.cpp | 286 CreateCopyOfByValArgument(SDValue Src, SDValue Dst, SDValue Chain, 291 return DAG.getMemcpy(Chain, dl, Dst, Src, SizeNode, Flags.getByValAlign(), 301 HexagonTargetLowering::LowerReturn(SDValue Chain, 318 SmallVector<SDValue, 4> RetOps(1, Chain); 324 Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), OutVals[i], Flag); 327 Flag = Chain.getValue(1); 331 RetOps[0] = Chain; // Update chain. 346 /// Chain/InFlag are the input chain/flag to use, and that TheCall is the cal [all...] |
/external/llvm/lib/Target/MSP430/ |
MSP430ISelLowering.cpp | 252 MSP430TargetLowering::LowerFormalArguments(SDValue Chain, 267 return LowerCCCArguments(Chain, CallConv, isVarArg, Ins, dl, DAG, InVals); 270 return Chain; 283 SDValue Chain = CLI.Chain; 297 return LowerCCCCallTo(Chain, Callee, CallConv, isVarArg, isTailCall, 308 MSP430TargetLowering::LowerCCCArguments(SDValue Chain, 351 SDValue ArgValue = DAG.getCopyFromReg(Chain, dl, VReg, RegVT); 393 InVal = DAG.getLoad(VA.getLocVT(), dl, Chain, FIN, 402 return Chain; [all...] |
/external/llvm/lib/Target/PowerPC/ |
PPCISelDAGToDAG.cpp | [all...] |
/external/llvm/lib/Target/Sparc/ |
SparcISelLowering.cpp | 80 SparcTargetLowering::LowerReturn(SDValue Chain, 99 SmallVector<SDValue, 4> RetOps(1, Chain); 108 Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), 112 Flag = Chain.getValue(1); 123 SDValue Val = DAG.getCopyFromReg(Chain, dl, Reg, getPointerTy()); 124 Chain = DAG.getCopyToReg(Chain, dl, SP::I0, Val, Flag); 125 Flag = Chain.getValue(1); 130 RetOps[0] = Chain; // Update chain [all...] |
/external/llvm/include/llvm/CodeGen/ |
SelectionDAGNodes.h | 158 /// be a chain) reaches the specified operand without crossing any 572 // end of the chain is reached. [all...] |
/external/llvm/lib/Target/ARM/ |
ARMISelDAGToDAG.cpp | [all...] |