Lines Matching full:layout

1 //===-- OptimizedStructLayout.h - Struct layout algorithm ---------*- C++ -*-=//
12 /// requirements of the struct while still satisfying the layout
13 /// requirements of the individual fields.  The resulting layout may be
28 /// - Second, there are other ways that a struct layout could be optimized
29 ///   besides space usage, such as locality.  This layout may have a mixed
53     assert(Size > 0 && "adding an empty field to the layout");  in Offset()
56   /// The offset of this field in the final layout.  If this is
57   /// initialized to FlexibleOffset, layout will overwrite it with
76   /// After layout, this will be true of all the fields.
89 /// Compute a layout for a struct containing the given fields, making a
95 /// - Fields may be assigned a fixed offset in the layout.  If there are
107 /// layout must appear at the start of the field array, and they must
110 /// The algorithm will produce a guaranteed-minimal layout with no
119 /// avoid padding, it cannot guarantee a minimal layout, as there is
122 /// The layout produced by this algorithm may not be stable across LLVM