Lines Matching refs:layout
110 // GC layout.
131 Purely notional variadic template describing the layout of a block.
307 assert(intSize <= ptrSize && "layout assumptions horribly violated");
329 /// Compute the layout of the given block. Attempts to lay the block
349 // Collect the layout chunks.
350 SmallVector<BlockLayoutChunk, 16> layout;
351 layout.reserve(block->capturesCXXThis() +
367 layout.push_back(BlockLayoutChunk(tinfo.second, tinfo.first,
388 layout.push_back(BlockLayoutChunk(tinfo.second, tinfo.first,
393 // Otherwise, build a layout chunk with the size and alignment of
447 layout.push_back(BlockLayoutChunk(align, size, lifetime, &CI, llvmType));
451 if (layout.empty()) {
458 // Sort the layout by alignment. We have to use a stable sort here
461 std::stable_sort(layout.begin(), layout.end());
463 // Needed for blocks layout info.
487 li = layout.begin() + 1, le = layout.end();
510 // Save total gap size for use in block layout bit map.
517 layout.erase(first, li);
541 li = layout.begin(), le = layout.end(); li != le; ++li) {
565 // Compute information about the layout, etc., of this block,
640 /// Find the layout for the given block in a linked list and remove it.
670 // layout for it.
688 // Using the computed layout, generate the actual block function.
861 // Activate the cleanup if layout pushed one.
898 // const char *layout; // reserved
1022 // Compute information about the layout, etc., of this block.
1875 // since the layout of the byref struct will guarantee at least that.
2155 printf("\n Inline flag for BYREF variable layout (%d):", flags.getBitMask());
2192 "byref.layout");
