|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
lib/Transforms/Vectorize/SLPVectorizer.cpp 2179 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);
2184 if (S.OpValue->getType()->isVectorTy()) {
2186 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);
2190 if (StoreInst *SI = dyn_cast<StoreInst>(S.OpValue))
2193 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);
2198 if (allConstant(VL) || isSplat(VL) || !allSameBlock(VL) || !S.getOpcode()) {
2200 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);
2212 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);
2218 if (TreeEntry *E = getTreeEntry(S.OpValue)) {
2219 LLVM_DEBUG(dbgs() << "SLP: \tChecking bundle: " << *S.OpValue << ".\n");
2222 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);
2228 LLVM_DEBUG(dbgs() << "SLP: Perfect diamond merge at " << *S.OpValue
2241 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);
2252 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);
2259 auto *VL0 = cast<Instruction>(S.OpValue);
2266 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);
2288 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);
2300 Optional<ScheduleData *> Bundle = BS.tryScheduleBundle(VL, this, S);
2306 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2312 unsigned ShuffleOrOp = S.isAltShuffle() ?
2313 (unsigned) Instruction::ShuffleVector : S.getOpcode();
2328 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2335 newTreeEntry(VL, Bundle, S, UserTreeIdx, ReuseShuffleIndicies);
2360 newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,
2382 newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,
2393 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2410 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2424 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2455 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S,
2464 newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,
2475 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2496 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2503 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,
2529 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2537 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,
2585 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,
2618 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2633 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2646 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2652 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,
2671 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2677 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,
2696 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2713 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2726 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2741 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2749 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,
2766 if (!S.isAltShuffle()) {
2768 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,
2773 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,
2801 newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,