28     assert(isAligned(Field.Alignment, Field.Offset) &&  in checkValidLayout()
33     assert(Field.Alignment <= MaxAlign &&  in checkValidLayout()
35     ComputedMaxAlign = std::max(Field.Alignment, MaxAlign);  in checkValidLayout()
72     MaxAlign = std::max(MaxAlign, FirstFlexible->Alignment);  in performOptimizedStructLayout()
97       MaxAlign = std::max(MaxAlign, I->Alignment);  in performOptimizedStructLayout()
101   // Sort the flexible elements in order of decreasing alignment,  in performOptimizedStructLayout()
108     // Decreasing alignment.  in performOptimizedStructLayout()
109     if (lhs->Alignment != rhs->Alignment)  in performOptimizedStructLayout()
110       return (lhs->Alignment < rhs->Alignment ? 1 : -1);  in performOptimizedStructLayout()
130   // of their alignment, then this will reliably trigger.  in performOptimizedStructLayout()
152         auto Offset = alignTo(LastEnd, I->Alignment);  in performOptimizedStructLayout()
200   // stricter constraints earlier, with the idea that weaker alignment  in performOptimizedStructLayout()
205   // that's a multiple of a useful alignment.  Preferring the initial  in performOptimizedStructLayout()
215   // alignment 1 and size O_j; if the layout size is equal to the end of  in performOptimizedStructLayout()
217   // this doesn't even require the complexity of alignment).  in performOptimizedStructLayout()
222   // However, in practice it'll just scan the array of alignment bins  in performOptimizedStructLayout()
234   // their alignment.  We expect a small enough number of bins that we  in performOptimizedStructLayout()
247     /// The alignment requirement of the queue.  in performOptimizedStructLayout()
248     Align Alignment;  in performOptimizedStructLayout()  member
257     auto Alignment = I->Alignment;  in performOptimizedStructLayout()  local
261     for (++I; I != E && I->Alignment == Alignment; ++I) {  in performOptimizedStructLayout()
268     FlexibleFieldsByAlignment.push_back({MinSize, Head, Alignment});  in performOptimizedStructLayout()
277       assert((FirstQueue || Queue.Alignment < LastQueueAlignment) &&  in performOptimizedStructLayout()
278              "bins not in order of descending alignment");  in performOptimizedStructLayout()
279       LastQueueAlignment = Queue.Alignment;  in performOptimizedStructLayout()
285         assert(I->Alignment == Queue.Alignment && "bad field in queue");  in performOptimizedStructLayout()
332     assert(Offset == alignTo(LastEnd, Cur->Alignment));  in performOptimizedStructLayout()
352     assert(StartOffset == alignTo(LastEnd, Queue->Alignment));  in performOptimizedStructLayout()
385       if (isAligned(FirstQueueToSearch->Alignment, LastEnd))  in performOptimizedStructLayout()
394       // Search those queues in descending order of alignment for a  in performOptimizedStructLayout()
412       Offset = alignTo(LastEnd, FirstQueueToSearch->Alignment);  in performOptimizedStructLayout()
416              Offset == alignTo(LastEnd, FirstQueueToSearch[-1].Alignment))  in performOptimizedStructLayout()