Lines Matching refs:npeel
1245 - to the misalignment computed using NPEEL if DR_INFO's salignment is known,
1251 NPEEL - the number of iterations in the peel loop if the misalignment
1256 dr_vec_info *dr_peel_info, int npeel)
1274 misal += npeel * TREE_INT_CST_LOW (DR_STEP (dr_info->dr));
1435 int npeel;
1459 return (hashval_t) peel_info->npeel;
1465 return (a->npeel == b->npeel);
1469 /* Insert DR_INFO into peeling hash table with NPEEL as key. */
1474 int npeel, bool supportable_if_not_aligned)
1479 elem.npeel = npeel;
1486 slot->npeel = npeel;
1512 && max->peel_info.npeel > elem->npeel))
1514 max->peel_info.npeel = elem->npeel;
1522 /* Get the costs of peeling NPEEL iterations for LOOP_VINFO, checking
1524 npeel is computed at runtime but DR0_INFO's misalignment will be zero
1534 unsigned int npeel)
1561 if (npeel == 0)
1573 misalignment += npeel * TREE_INT_CST_LOW (DR_STEP (dr_info->dr));
1607 &prologue_cost_vec, elem->npeel);
1612 (loop_vinfo, elem->npeel, &dummy,
1630 min->peel_info.npeel = elem->npeel;
1670 /* Return true if the new peeling NPEEL is supported. */
1674 unsigned npeel)
1704 misalignment += npeel * TREE_INT_CST_LOW (DR_STEP (dr_info->dr));
1855 unsigned int npeel = 0;
2163 peel_for_unknown_alignment.peel_info.npeel = 0;
2189 /* If the best peeling for known alignment has NPEEL == 0, perform no
2192 if (best_peel.peel_info.npeel == 0 && !one_dr_unsupportable)
2229 npeel = best_peel.peel_info.npeel;
2246 if (!npeel)
2267 npeel = ((mis & (target_align - 1))
2275 npeel /= DR_GROUP_SIZE (stmt_info);
2279 "Try peeling by %d\n", npeel);
2283 if (!vect_peeling_supportable (loop_vinfo, dr0_info, npeel))
2288 && npeel == 0
2302 unsigned max_peel = npeel;
2337 unsigned int max_peel = npeel == 0 ? assumed_vf - 1 : npeel;
2359 vect_update_misalignment_for_peel (dr_info, dr0_info, npeel);
2363 if (npeel)
2364 LOOP_VINFO_PEELING_FOR_ALIGNMENT (loop_vinfo) = npeel;