| /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<ModuleFile*, 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 ModuleFile &getPrimaryModule() { return *Chain[0]; }
75 ModuleFile &getPrimaryModule() const { return *Chain[0];
[all...] |
| ASTWriter.h | 104 ASTReader *Chain;
298 /// if its primary namespace comes from the chain. If it does, we add the
687 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...] |
| MBlazeISelLowering.cpp | 691 SDValue Chain = CLI.Chain;
720 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(NumBytes, true));
768 MemOpChains.push_back(DAG.getStore(Chain, dl, Arg, PtrOff,
782 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
786 // chain and flag operands which copy the outgoing args into registers.
791 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
793 InFlag = Chain.getValue(1)
[all...] |
| /external/llvm/lib/Target/XCore/ |
| XCoreISelDAGToDAG.cpp | 233 /// Given a chain return a new chain where any appearance of Old is replaced
234 /// by New. There must be at most one instruction between Old and Chain and
238 replaceInChain(SelectionDAG *CurDAG, SDValue Chain, SDValue Old, SDValue New)
240 if (Chain == Old)
242 if (Chain->getOpcode() != ISD::TokenFactor)
246 for (unsigned i = 0, e = Chain->getNumOperands(); i != e; ++i) {
247 if (Chain->getOperand(i) == Old) {
251 Ops.push_back(Chain->getOperand(i));
256 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?");
762 if (I->isCtrl()) continue; // ignore chain preds
771 if (II->isCtrl()) continue; // ignore chain preds
[all...] |
| LegalizeTypesGeneric.cpp | 218 SDValue Chain = LD->getChain();
227 Lo = DAG.getLoad(NVT, dl, Chain, Ptr, LD->getPointerInfo(),
234 Hi = DAG.getLoad(NVT, dl, Chain, Ptr,
241 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
248 // Modified the chain - switch anything that used the old chain to use
250 ReplaceValueWith(SDValue(N, 1), Chain);
256 SDValue Chain = N->getOperand(0);
261 Lo = DAG.getVAArg(NVT, dl, Chain, Ptr, N->getOperand(2), Align);
268 // Modified the chain - switch anything that used the old chain to us
[all...] |
| LegalizeVectorOps.cpp | 355 SDValue Chain = LD->getChain();
368 Chain, BasePTR, LD->getPointerInfo().getWithOffset(Idx * Stride),
394 SDValue Chain = ST->getChain();
427 SDValue Store = DAG.getTruncStore(Chain, dl, Ex, BasePTR,
|
| LegalizeDAG.cpp | 302 SDValue Chain = ST->getChain();
316 Result = DAG.getStore(Chain, dl, Result, Ptr, ST->getPointerInfo(),
336 SDValue Store = DAG.getTruncStore(Chain, dl,
401 Store1 = DAG.getTruncStore(Chain, dl, TLI.isLittleEndian()?Lo:Hi, Ptr,
407 Store2 = DAG.getTruncStore(Chain, dl, TLI.isLittleEndian()?Hi:Lo, Ptr,
424 SDValue Chain = LD->getChain();
434 SDValue newLoad = DAG.getLoad(intVT, dl, Chain, Ptr, LD->getPointerInfo(),
444 ChainResult = Chain;
466 SDValue Load = DAG.getLoad(RegVT, dl, Chain, Ptr,
484 SDValue Load = DAG.getExtLoad(ISD::EXTLOAD, dl, RegVT, Chain, Ptr
[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/NVPTX/ |
| NVPTXISelDAGToDAG.cpp | 202 SDValue Chain = N->getOperand(0);
234 Addr, Chain };
264 Base, Offset, Chain };
294 Base, Offset, Chain };
323 N1, Chain };
386 SDValue Chain = N->getOperand(0);
421 Addr, Chain };
452 Base, Offset, Chain };
483 Base, Offset, Chain };
512 N2, Chain };
[all...] |
| NVPTXISelLowering.cpp | 449 SDValue Chain = CLI.Chain;
458 SDValue tempChain = Chain;
459 Chain = DAG.getCALLSEQ_START(Chain,
461 SDValue InFlag = Chain.getValue(1);
481 SDValue DeclareParamOps[] = { Chain,
486 Chain = DAG.getNode(NVPTXISD::DeclareScalarParam, dl, DeclareParamVTs,
488 InFlag = Chain.getValue(1);
490 SDValue CopyParamOps[] = { Chain, DAG.getConstant(paramCount, MVT::i32)
[all...] |
| /external/llvm/lib/Target/Mips/ |
| MipsISelDAGToDAG.cpp | 561 SDValue Chain = CurDAG->getCopyToReg(CurDAG->getEntryNode(), dl, DestReg,
563 SDValue ResNode = CurDAG->getCopyFromReg(Chain, dl, DestReg, PtrVT);
|
| /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/PowerPC/ |
| PPCISelDAGToDAG.cpp | [all...] |
| /external/llvm/lib/Target/CellSPU/ |
| SPUISelDAGToDAG.cpp | 836 SDValue Chain = N->getOperand(1);
841 getRC( VT.getSimpleVT()), Chain);
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonISelDAGToDAG.cpp | 300 SDValue Chain = LD->getChain();
332 Chain);
349 SDValue Chain = LD->getChain();
364 Chain);
385 Chain);
413 SDValue Chain = LD->getChain();
429 TargetConstVal, Chain);
456 Base, TargetConst0, Chain);
487 SDValue Chain = LD->getChain();
538 TargetConstVal, Chain);
[all...] |
| HexagonISelLowering.cpp | 276 CreateCopyOfByValArgument(SDValue Src, SDValue Dst, SDValue Chain,
281 return DAG.getMemcpy(Chain, dl, Dst, Src, SizeNode, Flags.getByValAlign(),
291 HexagonTargetLowering::LowerReturn(SDValue Chain,
320 Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), OutVals[i], Flag);
323 Flag = Chain.getValue(1);
327 return DAG.getNode(HexagonISD::RET_FLAG, dl, MVT::Other, Chain, Flag);
329 return DAG.getNode(HexagonISD::RET_FLAG, dl, MVT::Other, Chain);
337 /// Chain/InFlag are the input chain/flag to use, and that TheCall is the cal
[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;
276 SDValue Chain = CLI.Chain;
290 return LowerCCCCallTo(Chain, Callee, CallConv, isVarArg, isTailCall,
302 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;
[all...] |
| /external/llvm/lib/Target/Sparc/ |
| SparcISelLowering.cpp | 80 SparcTargetLowering::LowerReturn(SDValue Chain,
113 Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(),
117 Flag = Chain.getValue(1);
127 SDValue Val = DAG.getCopyFromReg(Chain, dl, Reg, getPointerTy());
128 Chain = DAG.getCopyToReg(Chain, dl, SP::I0, Val, Flag);
129 Flag = Chain.getValue(1);
138 return DAG.getNode(SPISD::RET_FLAG, dl, MVT::Other, Chain,
140 return DAG.getNode(SPISD::RET_FLAG, dl, MVT::Other, Chain,
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| SelectionDAGNodes.h | 153 /// be a chain) reaches the specified operand without crossing any
567 // end of the chain is reached.
[all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMISelDAGToDAG.cpp | [all...] |
| /external/llvm/lib/Target/X86/ |
| X86ISelDAGToDAG.cpp | 361 /// MoveBelowCallOrigChain - Replace the original chain operand of the call with
362 /// load's chain operand and move load below the call's chain operand.
366 SDValue Chain = OrigChain.getOperand(0);
367 if (Chain.getNode() == Load.getNode())
370 assert(Chain.getOpcode() == ISD::TokenFactor &&
371 "Unexpected chain operand");
372 for (unsigned i = 0, e = Chain.getNumOperands(); i != e; ++i)
373 if (Chain.getOperand(i).getNode() == Load.getNode())
376 Ops.push_back(Chain.getOperand(i))
[all...] |
