Lines Matching defs:Field
197 // field, and not the data size. If the field is a record
211 /// 1. Find a close approximation to where we can place our first field.
213 /// 2. Try to find the best field that can legally be placed at the current
220 /// 4. Increment the current offset by the size of the chosen field.
221 /// 5. Remove the chosen field from the set of future possibilities.
232 const FieldDecl *Field;
236 // then large field indices to small field indices
238 Field ? -static_cast<int>(Field->getFieldIndex())
242 RHS.Field ? -static_cast<int>(RHS.Field->getFieldIndex())
249 RetVal.Field = FD;
282 // aligned field.
285 // We found a field that we can layout with the current alignment.
288 OptimalFieldsOrder.push_back(Iter->Field);
292 // field. Round up to at least the smallest field alignment that we