| /external/clang/include/clang/Serialization/ |
| ModuleManager.h | 28 /// \brief The chain of AST files. The first entry is the one named by the
30 llvm::SmallVector<Module*, 2> Chain;
53 ModuleIterator begin() { return Chain.begin(); }
55 ModuleIterator end() { return Chain.end(); }
59 ModuleConstIterator begin() const { return Chain.begin(); }
61 ModuleConstIterator end() const { return Chain.end(); }
65 ModuleReverseIterator rbegin() { return Chain.rbegin(); }
67 ModuleReverseIterator rend() { return Chain.rend(); }
71 Module &getPrimaryModule() { return *Chain[0]; }
75 Module &getPrimaryModule() const { return *Chain[0];
[all...] |
| ASTWriter.h | 94 ASTReader *Chain;
242 /// its primary namespace comes from the chain. If it does, we add the primary
606 bool hasChain() const { return Chain; }
|
| /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/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...] |
| /external/llvm/lib/Target/PTX/ |
| PTXISelDAGToDAG.cpp | 92 SDValue Chain = Node->getOperand(0);
102 SDValue Ops[] = { Target, Pred, PredOp, Chain };
107 SDValue Chain = Node->getOperand(0);
137 SDValue Ops[] = { Index, Pred, PredOp, Chain };
143 SDValue Chain = Node->getOperand(0);
175 SDValue Ops[] = { Value, Pred, PredOp, Chain };
|
| /external/llvm/lib/Target/XCore/ |
| XCoreISelDAGToDAG.cpp | 232 /// Given a chain return a new chain where any appearance of Old is replaced
233 /// by New. There must be at most one instruction between Old and Chain and
237 replaceInChain(SelectionDAG *CurDAG, SDValue Chain, SDValue Old, SDValue New)
239 if (Chain == Old)
241 if (Chain->getOpcode() != ISD::TokenFactor)
245 for (unsigned i = 0, e = Chain->getNumOperands(); i != e; ++i) {
246 if (Chain->getOperand(i) == Old) {
250 Ops.push_back(Chain->getOperand(i));
255 return CurDAG->getNode(ISD::TokenFactor, Chain->getDebugLoc(), MVT::Other
[all...] |
| XCoreISelLowering.cpp | 333 SDValue Chain = Op.getOperand(0);
345 return DAG.getNode(XCoreISD::BR_JT, dl, MVT::Other, Chain, TargetJT, Index);
350 return DAG.getNode(XCoreISD::BR_JT32, dl, MVT::Other, Chain, TargetJT,
407 SDValue Chain = LD->getChain();
419 return DAG.getLoad(getPointerTy(), DL, Chain, BasePtr,
437 SDValue Low = DAG.getLoad(getPointerTy(), DL, Chain,
439 SDValue High = DAG.getLoad(getPointerTy(), DL, Chain,
444 Chain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Low.getValue(1),
446 SDValue Ops[] = { Result, Chain };
451 SDValue Low = DAG.getExtLoad(ISD::ZEXTLOAD, DL, MVT::i32, Chain,
[all...] |
| /external/llvm/lib/Target/Mips/ |
| MipsISelDAGToDAG.cpp | 317 SDValue Chain = CurDAG->getCopyToReg(CurDAG->getEntryNode(), dl, DestReg,
319 SDValue ResNode = CurDAG->getCopyFromReg(Chain, dl, DestReg, MVT::i32);
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeTypesGeneric.cpp | 210 SDValue Chain = LD->getChain();
218 Lo = DAG.getLoad(NVT, dl, Chain, Ptr, LD->getPointerInfo(),
225 Hi = DAG.getLoad(NVT, dl, Chain, Ptr,
232 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
239 // Modified the chain - switch anything that used the old chain to use
241 ReplaceValueWith(SDValue(N, 1), Chain);
247 SDValue Chain = N->getOperand(0);
252 Lo = DAG.getVAArg(NVT, dl, Chain, Ptr, N->getOperand(2), Align);
259 // Modified the chain - switch anything that used the old chain to us
[all...] |
| LegalizeVectorOps.cpp | 298 SDValue Chain = LD->getChain();
311 Chain, BasePTR, LD->getPointerInfo().getWithOffset(Idx * Stride),
337 SDValue Chain = ST->getChain();
370 SDValue Store = DAG.getTruncStore(Chain, dl, Ex, BasePTR,
|
| ScheduleDAGSDNodes.cpp | 172 SDNode *Chain = 0;
175 Chain = Node->getOperand(NumOps-1).getNode();
176 if (!Chain)
179 // Look for other loads of the same chain. Find loads that are loading from
186 for (SDNode::use_iterator I = Chain->use_begin(), E = Chain->use_end();
433 "Chain dependence via physreg data?");
|
| LegalizeDAG.cpp | 239 // The chain is usually at the end.
252 // Otherwise, we walked into a node without a chain.
261 // Make sure to only follow users of our token chain.
279 "Node doesn't have a token chain argument!");
386 SDValue Chain = ST->getChain();
400 return DAG.getStore(Chain, dl, Result, Ptr, ST->getPointerInfo(),
418 SDValue Store = DAG.getTruncStore(Chain, dl,
480 Store1 = DAG.getTruncStore(Chain, dl, TLI.isLittleEndian()?Lo:Hi, Ptr,
486 Store2 = DAG.getTruncStore(Chain, dl, TLI.isLittleEndian()?Hi:Lo, Ptr,
498 SDValue Chain = LD->getChain()
[all...] |
| LegalizeFloatTypes.cpp | 484 // Legalized the chain result - switch anything that used the old chain to
496 // Legalized the chain result - switch anything that used the old chain to
523 SDValue Chain = N->getOperand(0); // Get the chain.
530 NewVAARG = DAG.getVAArg(NVT, dl, Chain, Ptr, N->getOperand(2),
533 // Legalized the chain result - switch anything that used the old chain to
[all...] |
| /external/llvm/lib/Target/Alpha/ |
| AlphaISelDAGToDAG.cpp | 231 SDValue Chain = CurDAG->getEntryNode();
235 Chain = CurDAG->getCopyToReg(Chain, dl, Alpha::R24, N1,
237 Chain = CurDAG->getCopyToReg(Chain, dl, Alpha::R25, N2,
238 Chain.getValue(1));
239 Chain = CurDAG->getCopyToReg(Chain, dl, Alpha::R27, N0,
240 Chain.getValue(1));
243 Chain, Chain.getValue(1))
[all...] |
| AlphaISelLowering.cpp | 229 AlphaTargetLowering::LowerCall(SDValue Chain, SDValue Callee,
250 Chain = DAG.getCALLSEQ_START(Chain, DAG.getConstant(NumBytes,
286 StackPtr = DAG.getCopyFromReg(Chain, dl, Alpha::R30, MVT::i64);
292 MemOpChains.push_back(DAG.getStore(Chain, dl, Arg, PtrOff,
300 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
303 // Build a sequence of copy-to-reg nodes chained together with token chain and
308 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
310 InFlag = Chain.getValue(1)
[all...] |
| /external/llvm/lib/Target/SystemZ/ |
| SystemZISelLowering.cpp | 235 SystemZTargetLowering::LowerFormalArguments(SDValue Chain,
250 return LowerCCCArguments(Chain, CallConv, isVarArg, Ins, dl, DAG, InVals);
255 SystemZTargetLowering::LowerCall(SDValue Chain, SDValue Callee,
271 return LowerCCCCallTo(Chain, Callee, CallConv, isVarArg, isTailCall,
281 SystemZTargetLowering::LowerCCCArguments(SDValue Chain,
332 ArgValue = DAG.getCopyFromReg(Chain, dl, VReg, LocVT);
345 ArgValue = DAG.getLoad(LocVT, dl, Chain, FIN,
366 return Chain;
373 SystemZTargetLowering::LowerCCCCallTo(SDValue Chain, SDValue Callee,
398 Chain = DAG.getCALLSEQ_START(Chain ,DAG.getConstant(NumBytes
[all...] |
| /external/llvm/lib/Target/MSP430/ |
| MSP430ISelLowering.cpp | 245 MSP430TargetLowering::LowerFormalArguments(SDValue Chain,
260 return LowerCCCArguments(Chain, CallConv, isVarArg, Ins, dl, DAG, InVals);
263 return Chain;
272 MSP430TargetLowering::LowerCall(SDValue Chain, SDValue Callee,
288 return LowerCCCCallTo(Chain, Callee, CallConv, isVarArg, isTailCall,
301 MSP430TargetLowering::LowerCCCArguments(SDValue Chain,
340 SDValue ArgValue = DAG.getCopyFromReg(Chain, dl, VReg, RegVT);
373 InVals.push_back(DAG.getLoad(VA.getLocVT(), dl, Chain, FIN,
379 return Chain;
383 MSP430TargetLowering::LowerReturn(SDValue Chain,
[all...] |
| /external/llvm/lib/Target/PowerPC/ |
| PPCISelDAGToDAG.cpp | [all...] |
| /external/llvm/lib/Target/CellSPU/ |
| SPUISelDAGToDAG.cpp | 847 SDValue Chain = N->getOperand(1);
852 getRC( VT.getSimpleVT()), Chain);
[all...] |
| /external/llvm/lib/Target/Sparc/ |
| SparcISelLowering.cpp | 81 SparcTargetLowering::LowerReturn(SDValue Chain,
114 Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(),
118 Flag = Chain.getValue(1);
128 SDValue Val = DAG.getCopyFromReg(Chain, dl, Reg, getPointerTy());
129 Chain = DAG.getCopyToReg(Chain, dl, SP::I0, Val, Flag);
130 Flag = Chain.getValue(1);
139 return DAG.getNode(SPISD::RET_FLAG, dl, MVT::Other, Chain,
141 return DAG.getNode(SPISD::RET_FLAG, dl, MVT::Other, Chain,
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| SelectionDAGNodes.h | 148 /// be a chain) reaches the specified operand without crossing any
562 // end of the chain is reached.
[all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMISelDAGToDAG.cpp | [all...] |
| /external/llvm/lib/Target/X86/ |
| X86ISelDAGToDAG.cpp | 359 /// MoveBelowCallOrigChain - Replace the original chain operand of the call with
360 /// load's chain operand and move load below the call's chain operand.
364 SDValue Chain = OrigChain.getOperand(0);
365 if (Chain.getNode() == Load.getNode())
368 assert(Chain.getOpcode() == ISD::TokenFactor &&
369 "Unexpected chain operand");
370 for (unsigned i = 0, e = Chain.getNumOperands(); i != e; ++i)
371 if (Chain.getOperand(i).getNode() == Load.getNode())
374 Ops.push_back(Chain.getOperand(i))
[all...] |
| X86InstrInfo.cpp | [all...] |
