Lines Matching full:chain
644 /// Chain/Flag as the input and updates them for the output Chain/Flag.
648 SDValue &Chain, SDValue *Flag,
653 /// Chain/Flag as the input and updates them for the output Chain/Flag.
656 SDValue &Chain, SDValue *Flag, const Value *V) const;
670 /// Chain/Flag as the input and updates them for the output Chain/Flag.
675 SDValue &Chain, SDValue *Flag,
696 P = DAG.getCopyFromReg(Chain, dl, Regs[Part+i], RegisterVT);
698 P = DAG.getCopyFromReg(Chain, dl, Regs[Part+i], RegisterVT, *Flag);
702 Chain = P.getValue(1);
762 /// Chain/Flag as the input and updates them for the output Chain/Flag.
765 SDValue &Chain, SDValue *Flag,
789 Part = DAG.getCopyToReg(Chain, dl, Regs[i], Parts[i]);
791 Part = DAG.getCopyToReg(Chain, dl, Regs[i], Parts[i], *Flag);
802 // chain, then the TokenFactor is both a predecessor (operand) of the
809 Chain = Chains[NumRegs-1];
811 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Chains[0], NumRegs);
1024 SDValue Chain = DAG.getEntryNode();
1025 N = RFV.getCopyFromRegs(DAG, FuncInfo, getCurDebugLoc(), Chain, NULL, V);
1179 SDValue Chain = DAG.getEntryNode();
1180 return RFV.getCopyFromRegs(DAG, FuncInfo, getCurDebugLoc(), Chain, NULL, V);
1187 SDValue Chain = getControlRoot();
1216 DAG.getStore(Chain, getCurDebugLoc(),
1222 Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
1277 Chain = TLI.LowerReturn(Chain, CallConv, isVarArg,
1281 assert(Chain.getNode() && Chain.getValueType() == MVT::Other &&
1282 "LowerReturn didn't return a valid chain!");
1284 // Update the DAG with the new chain value resulting from return lowering.
1285 DAG.setRoot(Chain);
1921 SDValue Chain = Op1.getValue(1);
1926 Ops[1] = Chain;
1928 Chain = Op2.getValue(1);
1937 std::pair<SDValue, SDValue> RetPair = std::make_pair(Res, Chain);
3311 // could recover a bit by hoisting nodes upward in the chain by recognizing
3317 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
3319 Root = Chain;
3335 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
3338 DAG.setRoot(Chain);
3340 PendingLoads.push_back(Chain);
3381 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
3383 Root = Chain;
3402 static SDValue InsertFenceForAtomic(SDValue Chain, AtomicOrdering Order,
3412 return Chain;
3417 return Chain;
3420 Ops[0] = Chain;
3638 SDValue Chain = Result.getValue(Result.getNode()->getNumValues()-1);
3640 PendingLoads.push_back(Chain);
3642 DAG.setRoot(Chain);
5295 "Non-null chain expected with non-tail call!");
5330 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(),
5332 PendingLoads.push_back(Chain);
5343 // As a special case, a null chain means that a tail call has been emitted and
5399 // still constant memory, the input chain can be the entry node.
5915 SDValue Chain, Flag;
5920 Chain = getRoot();
5922 Chain = DAG.getRoot();
5993 Chain = DAG.getStore(Chain, getCurDebugLoc(),
6026 AsmNodeOperands.push_back(SDValue()); // reserve space for input chain
6179 Chain, &Flag, CS.getInstruction());
6261 Chain, &Flag, CS.getInstruction());
6279 // Finish up input operands. Set the input chain and add the flag last.
6280 AsmNodeOperands[InlineAsm::Op_InputChain] = Chain;
6283 Chain = DAG.getNode(ISD::INLINEASM, getCurDebugLoc(),
6286 Flag = Chain.getValue(1);
6292 Chain, &Flag, CS.getInstruction());
6319 // Don't need to use this as a chain in this case.
6332 Chain, &Flag, IA);
6339 SDValue Val = DAG.getStore(Chain, getCurDebugLoc(),
6348 Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), MVT::Other,
6351 DAG.setRoot(Chain);
6488 CLI.Chain = LowerCall(CLI, InVals);
6491 assert(CLI.Chain.getNode() && CLI.Chain.getValueType() == MVT::Other &&
6492 "LowerCall didn't return a valid chain!");
6503 CLI.DAG.setRoot(CLI.Chain);
6538 return std::make_pair(SDValue(), CLI.Chain);
6543 return std::make_pair(Res, CLI.Chain);
6567 SDValue Chain = DAG.getEntryNode();
6568 RFV.getCopyToRegs(Op, DAG, getCurDebugLoc(), Chain, 0, V);
6569 PendingExports.push_back(Chain);
6677 "LowerFormalArguments didn't return a valid chain!");
6689 // Update the DAG with the new chain value resulting from argument lowering.
