Lines Matching full:assume
300 // Assume that floating point arithmetic operations cost twice as much as
305 // The operation is legal. Assume it costs 1.
306 // If the type is split to multiple registers, assume that there is some
315 // If the operation is custom lowered then assume
320 // Else, assume that we need to scalarize this op.
384 // If the cast is marked as legal (or promote) then assume low cost.
396 // Just check the op cost. If the operation is legal then assume it costs 1.
400 // Assume that illegal scalar instruction are expensive.
411 // Assume that Zext is done using AND.
415 // Assume that sext is done using SHL and SRA.
419 // Just check the op cost. If the operation is legal then assume it costs
438 // is where we handle bitcast between vectors and scalars. We need to assume
469 // The operation is legal. Assume it costs 1. Multiply
474 // Otherwise, assume that the cast is scalarized.
537 // Assume that we need to scalarize this intrinsic.
584 // The operation is legal. Assume it costs 1.
585 // If the type is split to multiple registers, assume that thre is some
594 // If the operation is custom lowered then assume
605 // Else, assume that we need to scalarize this intrinsic. For math builtins
635 // Assume the pairwise shuffles add a cost.
