73     LLVM_DEBUG(dbgs() << "VPSLP: not all operands are VPInstructions\n");  in areVectorizable()
90     LLVM_DEBUG(dbgs() << "VPSLP: Opcodes do not agree \n");  in areVectorizable()
98     LLVM_DEBUG(dbgs() << "VPSLP: operands in different BBs\n");  in areVectorizable()
104     LLVM_DEBUG(dbgs() << "VPSLP: Some operands have multiple users.\n");  in areVectorizable()
126         LLVM_DEBUG(  in areVectorizable()
136       LLVM_DEBUG(dbgs() << "VPSLP: only simple loads are supported.\n");  in areVectorizable()
146       LLVM_DEBUG(dbgs() << "VPSLP: only simple stores are supported.\n");  in areVectorizable()
242   LLVM_DEBUG(dbgs() << "      getBest\n");  in getBest()
245   LLVM_DEBUG(dbgs() << "        Candidates  for "  in getBest()
251       LLVM_DEBUG(dbgs() << *cast<VPInstruction>(Candidate)->getUnderlyingInstr()  in getBest()
256   LLVM_DEBUG(dbgs() << "\n");  in getBest()
287   LLVM_DEBUG(dbgs() << "Found best "  in getBest()
301   LLVM_DEBUG(dbgs() << "Reordering multinode\n");  in reorderMultiNodeOps()
313     LLVM_DEBUG(dbgs() << "  Finding best value for lane " << Lane << "\n");  in reorderMultiNodeOps()
315     LLVM_DEBUG(dbgs() << "  Candidates  ");  in reorderMultiNodeOps()
317       LLVM_DEBUG(  in reorderMultiNodeOps()
322     LLVM_DEBUG(dbgs() << "\n");  in reorderMultiNodeOps()
325       LLVM_DEBUG(dbgs() << "  Checking " << Op << "\n");  in reorderMultiNodeOps()
381   LLVM_DEBUG({  in buildGraph()
397       LLVM_DEBUG({  in buildGraph()
404         LLVM_DEBUG(dbgs() << "    Same opcode, continue building\n");  in buildGraph()
407         LLVM_DEBUG(dbgs() << "    Adding multinode Ops\n");  in buildGraph()
417       LLVM_DEBUG(dbgs() << "Reorder \n");  in buildGraph()
432       LLVM_DEBUG(dbgs() << "Found final order\n");  in buildGraph()
435     LLVM_DEBUG(dbgs() << "  NonCommuntative\n");  in buildGraph()
465   LLVM_DEBUG(dbgs() << "Create VPInstruction " << *VPI << " "  in buildGraph()