diff options
| author | Tom Lane <tgl@sss.pgh.pa.us> | 2015-02-21 15:13:06 -0500 |
|---|---|---|
| committer | Tom Lane <tgl@sss.pgh.pa.us> | 2015-02-21 15:13:06 -0500 |
| commit | e1a11d93111ff3fba7a91f3f2ac0b0aca16909a8 (patch) | |
| tree | 522fdb9a6b2ed8208bdf692579399eac73c69184 /src/include/replication/reorderbuffer.h | |
| parent | 3d9b6f31eec150b5a6000e0814e81e36d9eb069a (diff) | |
Use FLEXIBLE_ARRAY_MEMBER for HeapTupleHeaderData.t_bits[].
This requires changing quite a few places that were depending on
sizeof(HeapTupleHeaderData), but it seems for the best.
Michael Paquier, some adjustments by me
Diffstat (limited to 'src/include/replication/reorderbuffer.h')
| -rw-r--r-- | src/include/replication/reorderbuffer.h | 10 |
1 files changed, 7 insertions, 3 deletions
diff --git a/src/include/replication/reorderbuffer.h b/src/include/replication/reorderbuffer.h index 5a1d9a06707..f1e0f57e7c2 100644 --- a/src/include/replication/reorderbuffer.h +++ b/src/include/replication/reorderbuffer.h @@ -28,8 +28,12 @@ typedef struct ReorderBufferTupleBuf /* tuple, stored sequentially */ HeapTupleData tuple; - HeapTupleHeaderData header; - char data[MaxHeapTupleSize]; + union + { + HeapTupleHeaderData header; + char data[MaxHeapTupleSize]; + double align_it; /* ensure t_data is MAXALIGN'd */ + } t_data; } ReorderBufferTupleBuf; /* @@ -77,7 +81,7 @@ typedef struct ReorderBufferChange RelFileNode relnode; /* no previously reassembled toast chunks are necessary anymore */ - bool clear_toast_afterwards; + bool clear_toast_afterwards; /* valid for DELETE || UPDATE */ ReorderBufferTupleBuf *oldtuple; |