Lines Matching defs:pieces
219 DOESNT_MATTER. We need to be able to collect enough pieces to
222 able to store at least 8 pieces.
224 We also need to be able to store enough pieces to represent
227 we need at least 12 pieces. */
259 /* Divides types analyzed as IS_PST into individual pieces. The pieces
261 auto_vec<piece, MAX_PIECES> pieces;
2972 for (unsigned int i = 0; i < pieces.length (); ++i)
2973 res += pieces[i].num_zr;
2983 for (unsigned int i = 0; i < pieces.length (); ++i)
2984 res += pieces[i].num_pr;
2999 if (mode == pieces[0].mode)
3001 gcc_assert (pieces.length () == 1);
3002 return pieces[0].get_rtx (first_zr, first_pr);
3005 /* Build up a PARALLEL that contains the individual pieces. */
3006 rtvec rtxes = rtvec_alloc (pieces.length ());
3007 for (unsigned int i = 0; i < pieces.length (); ++i)
3009 rtx reg = pieces[i].get_rtx (first_zr, first_pr);
3010 rtx offset = gen_int_mode (pieces[i].offset, Pmode);
3012 first_zr += pieces[i].num_zr;
3013 first_pr += pieces[i].num_pr;
3025 gcc_assert (pieces.is_empty ());
3092 if (count * element_info.pieces.length () > MAX_PIECES)
3101 gcc_assert (!element_info.pieces.is_empty ());
3103 for (unsigned int j = 0; j < element_info.pieces.length (); ++j)
3105 piece p = element_info.pieces[j];
3149 || pieces.length () + field_info.pieces.length () > MAX_PIECES)
3154 gcc_assert (!field_info.pieces.is_empty ());
3155 for (unsigned int i = 0; i < field_info.pieces.length (); ++i)
3157 piece p = field_info.pieces[i];
3163 return pieces.is_empty () ? NO_ABI_IDENTITY : IS_PST;
3166 /* Add P to the list of pieces in the type. */
3177 if (!pieces.is_empty ())
3179 piece &prev = pieces.last ();
3196 pieces.quick_push (p);
8509 /* The frame is allocated in pieces, with each non-final piece
21894 We need to be able to access the individual pieces, so the range
Indexes created Tue May 19 00:24:48 UTC 2026