reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
222 assert(N->getNodeId() == ReadyToProcess && 225 LLVM_DEBUG(dbgs() << "Legalizing node: "; N->dump(&DAG)); 226 if (IgnoreNodeResults(N)) { 233 for (unsigned i = 0, NumResults = N->getNumValues(); i < NumResults; ++i) { 234 EVT ResultVT = N->getValueType(i); 247 PromoteIntegerResult(N, i); 251 ExpandIntegerResult(N, i); 255 SoftenFloatResult(N, i); 259 ExpandFloatResult(N, i); 263 ScalarizeVectorResult(N, i); 267 SplitVectorResult(N, i); 271 WidenVectorResult(N, i); 275 PromoteFloatResult(N, i); 285 unsigned NumOperands = N->getNumOperands(); 289 if (IgnoreNodeResults(N->getOperand(i).getNode())) 292 const auto Op = N->getOperand(i); 303 NeedsReanalyzing = PromoteIntegerOperand(N, i); 307 NeedsReanalyzing = ExpandIntegerOperand(N, i); 311 NeedsReanalyzing = SoftenFloatOperand(N, i); 315 NeedsReanalyzing = ExpandFloatOperand(N, i); 319 NeedsReanalyzing = ScalarizeVectorOperand(N, i); 323 NeedsReanalyzing = SplitVectorOperand(N, i); 327 NeedsReanalyzing = WidenVectorOperand(N, i); 331 NeedsReanalyzing = PromoteFloatOperand(N, i); 342 assert(N->getNodeId() == ReadyToProcess && "Node ID recalculated?"); 344 N->setNodeId(NewNode); 347 SDNode *M = AnalyzeNewNode(N); 348 if (M == N) 354 assert(N->getNumValues() == M->getNumValues() && 356 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) 358 ReplaceValueWith(SDValue(N, i), SDValue(M, i)); 359 assert(N->getNodeId() == NewNode && "Unexpected node state!"); 367 LLVM_DEBUG(dbgs() << "Legally typed node: "; N->dump(&DAG); 375 assert(N->getNodeId() == ReadyToProcess && "Node ID recalculated?"); 376 N->setNodeId(Processed); 378 for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end(); 378 for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end();