Line data Source code
1 : /*-------------------------------------------------------------------------
2 : *
3 : * nbtdesc.c
4 : * rmgr descriptor routines for access/nbtree/nbtxlog.c
5 : *
6 : * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
7 : * Portions Copyright (c) 1994, Regents of the University of California
8 : *
9 : *
10 : * IDENTIFICATION
11 : * src/backend/access/rmgrdesc/nbtdesc.c
12 : *
13 : *-------------------------------------------------------------------------
14 : */
15 : #include "postgres.h"
16 :
17 : #include "access/nbtxlog.h"
18 : #include "access/rmgrdesc_utils.h"
19 :
20 : static void delvacuum_desc(StringInfo buf, char *block_data,
21 : uint16 ndeleted, uint16 nupdated);
22 :
23 : void
24 110 : btree_desc(StringInfo buf, XLogReaderState *record)
25 : {
26 110 : char *rec = XLogRecGetData(record);
27 110 : uint8 info = XLogRecGetInfo(record) & ~XLR_INFO_MASK;
28 :
29 110 : switch (info)
30 : {
31 101 : case XLOG_BTREE_INSERT_LEAF:
32 : case XLOG_BTREE_INSERT_UPPER:
33 : case XLOG_BTREE_INSERT_META:
34 : case XLOG_BTREE_INSERT_POST:
35 : {
36 101 : xl_btree_insert *xlrec = (xl_btree_insert *) rec;
37 :
38 101 : appendStringInfo(buf, "off: %u", xlrec->offnum);
39 101 : break;
40 : }
41 0 : case XLOG_BTREE_SPLIT_L:
42 : case XLOG_BTREE_SPLIT_R:
43 : {
44 0 : xl_btree_split *xlrec = (xl_btree_split *) rec;
45 :
46 0 : appendStringInfo(buf, "level: %u, firstrightoff: %d, newitemoff: %d, postingoff: %d",
47 0 : xlrec->level, xlrec->firstrightoff,
48 0 : xlrec->newitemoff, xlrec->postingoff);
49 0 : break;
50 : }
51 2 : case XLOG_BTREE_DEDUP:
52 : {
53 2 : xl_btree_dedup *xlrec = (xl_btree_dedup *) rec;
54 :
55 2 : appendStringInfo(buf, "nintervals: %u", xlrec->nintervals);
56 2 : break;
57 : }
58 2 : case XLOG_BTREE_VACUUM:
59 : {
60 2 : xl_btree_vacuum *xlrec = (xl_btree_vacuum *) rec;
61 :
62 2 : appendStringInfo(buf, "ndeleted: %u, nupdated: %u",
63 2 : xlrec->ndeleted, xlrec->nupdated);
64 :
65 2 : if (XLogRecHasBlockData(record, 0))
66 2 : delvacuum_desc(buf, XLogRecGetBlockData(record, 0, NULL),
67 2 : xlrec->ndeleted, xlrec->nupdated);
68 2 : break;
69 : }
70 0 : case XLOG_BTREE_DELETE:
71 : {
72 0 : xl_btree_delete *xlrec = (xl_btree_delete *) rec;
73 :
74 0 : appendStringInfo(buf, "snapshotConflictHorizon: %u, ndeleted: %u, nupdated: %u, isCatalogRel: %c",
75 : xlrec->snapshotConflictHorizon,
76 0 : xlrec->ndeleted, xlrec->nupdated,
77 0 : xlrec->isCatalogRel ? 'T' : 'F');
78 :
79 0 : if (XLogRecHasBlockData(record, 0))
80 0 : delvacuum_desc(buf, XLogRecGetBlockData(record, 0, NULL),
81 0 : xlrec->ndeleted, xlrec->nupdated);
82 0 : break;
83 : }
84 2 : case XLOG_BTREE_MARK_PAGE_HALFDEAD:
85 : {
86 2 : xl_btree_mark_page_halfdead *xlrec = (xl_btree_mark_page_halfdead *) rec;
87 :
88 2 : appendStringInfo(buf, "topparent: %u, leaf: %u, left: %u, right: %u",
89 : xlrec->topparent, xlrec->leafblk, xlrec->leftblk, xlrec->rightblk);
90 2 : break;
91 : }
92 2 : case XLOG_BTREE_UNLINK_PAGE_META:
93 : case XLOG_BTREE_UNLINK_PAGE:
94 : {
95 2 : xl_btree_unlink_page *xlrec = (xl_btree_unlink_page *) rec;
96 :
97 2 : appendStringInfo(buf, "left: %u, right: %u, level: %u, safexid: %u:%u, ",
98 : xlrec->leftsib, xlrec->rightsib, xlrec->level,
99 2 : EpochFromFullTransactionId(xlrec->safexid),
100 2 : XidFromFullTransactionId(xlrec->safexid));
101 2 : appendStringInfo(buf, "leafleft: %u, leafright: %u, leaftopparent: %u",
102 : xlrec->leafleftsib, xlrec->leafrightsib,
103 : xlrec->leaftopparent);
104 2 : break;
105 : }
106 0 : case XLOG_BTREE_NEWROOT:
107 : {
108 0 : xl_btree_newroot *xlrec = (xl_btree_newroot *) rec;
109 :
110 0 : appendStringInfo(buf, "level: %u", xlrec->level);
111 0 : break;
112 : }
113 0 : case XLOG_BTREE_REUSE_PAGE:
114 : {
115 0 : xl_btree_reuse_page *xlrec = (xl_btree_reuse_page *) rec;
116 :
117 0 : appendStringInfo(buf, "rel: %u/%u/%u, snapshotConflictHorizon: %u:%u, isCatalogRel: %c",
118 : xlrec->locator.spcOid, xlrec->locator.dbOid,
119 : xlrec->locator.relNumber,
120 0 : EpochFromFullTransactionId(xlrec->snapshotConflictHorizon),
121 0 : XidFromFullTransactionId(xlrec->snapshotConflictHorizon),
122 0 : xlrec->isCatalogRel ? 'T' : 'F');
123 0 : break;
124 : }
125 1 : case XLOG_BTREE_META_CLEANUP:
126 : {
127 : xl_btree_metadata *xlrec;
128 :
129 1 : xlrec = (xl_btree_metadata *) XLogRecGetBlockData(record, 0,
130 : NULL);
131 1 : appendStringInfo(buf, "last_cleanup_num_delpages: %u",
132 : xlrec->last_cleanup_num_delpages);
133 1 : break;
134 : }
135 : }
136 110 : }
137 :
138 : const char *
139 110 : btree_identify(uint8 info)
140 : {
141 110 : const char *id = NULL;
142 :
143 110 : switch (info & ~XLR_INFO_MASK)
144 : {
145 101 : case XLOG_BTREE_INSERT_LEAF:
146 101 : id = "INSERT_LEAF";
147 101 : break;
148 0 : case XLOG_BTREE_INSERT_UPPER:
149 0 : id = "INSERT_UPPER";
150 0 : break;
151 0 : case XLOG_BTREE_INSERT_META:
152 0 : id = "INSERT_META";
153 0 : break;
154 0 : case XLOG_BTREE_SPLIT_L:
155 0 : id = "SPLIT_L";
156 0 : break;
157 0 : case XLOG_BTREE_SPLIT_R:
158 0 : id = "SPLIT_R";
159 0 : break;
160 0 : case XLOG_BTREE_INSERT_POST:
161 0 : id = "INSERT_POST";
162 0 : break;
163 2 : case XLOG_BTREE_DEDUP:
164 2 : id = "DEDUP";
165 2 : break;
166 2 : case XLOG_BTREE_VACUUM:
167 2 : id = "VACUUM";
168 2 : break;
169 0 : case XLOG_BTREE_DELETE:
170 0 : id = "DELETE";
171 0 : break;
172 2 : case XLOG_BTREE_MARK_PAGE_HALFDEAD:
173 2 : id = "MARK_PAGE_HALFDEAD";
174 2 : break;
175 1 : case XLOG_BTREE_UNLINK_PAGE:
176 1 : id = "UNLINK_PAGE";
177 1 : break;
178 1 : case XLOG_BTREE_UNLINK_PAGE_META:
179 1 : id = "UNLINK_PAGE_META";
180 1 : break;
181 0 : case XLOG_BTREE_NEWROOT:
182 0 : id = "NEWROOT";
183 0 : break;
184 0 : case XLOG_BTREE_REUSE_PAGE:
185 0 : id = "REUSE_PAGE";
186 0 : break;
187 1 : case XLOG_BTREE_META_CLEANUP:
188 1 : id = "META_CLEANUP";
189 1 : break;
190 : }
191 :
192 110 : return id;
193 : }
194 :
195 : static void
196 2 : delvacuum_desc(StringInfo buf, char *block_data,
197 : uint16 ndeleted, uint16 nupdated)
198 : {
199 : OffsetNumber *deletedoffsets;
200 : OffsetNumber *updatedoffsets;
201 : xl_btree_update *updates;
202 :
203 : /* Output deleted page offset number array */
204 2 : appendStringInfoString(buf, ", deleted:");
205 2 : deletedoffsets = (OffsetNumber *) block_data;
206 2 : array_desc(buf, deletedoffsets, sizeof(OffsetNumber), ndeleted,
207 : &offset_elem_desc, NULL);
208 :
209 : /*
210 : * Output updates as an array of "update objects", where each element
211 : * contains a page offset number from updated array. (This is not the
212 : * most literal representation of the underlying physical data structure
213 : * that we could use. Readability seems more important here.)
214 : */
215 2 : appendStringInfoString(buf, ", updated: [");
216 2 : updatedoffsets = (OffsetNumber *) (block_data + ndeleted *
217 : sizeof(OffsetNumber));
218 2 : updates = (xl_btree_update *) ((char *) updatedoffsets +
219 2 : nupdated *
220 : sizeof(OffsetNumber));
221 2 : for (int i = 0; i < nupdated; i++)
222 : {
223 0 : OffsetNumber off = updatedoffsets[i];
224 :
225 : Assert(OffsetNumberIsValid(off));
226 : Assert(updates->ndeletedtids > 0);
227 :
228 : /*
229 : * "ptid" is the symbol name used when building each xl_btree_update's
230 : * array of offsets into a posting list tuple's ItemPointerData array.
231 : * xl_btree_update describes a subset of the existing TIDs to delete.
232 : */
233 0 : appendStringInfo(buf, "{ off: %u, nptids: %u, ptids: [",
234 0 : off, updates->ndeletedtids);
235 0 : for (int p = 0; p < updates->ndeletedtids; p++)
236 : {
237 : uint16 *ptid;
238 :
239 0 : ptid = (uint16 *) ((char *) updates + SizeOfBtreeUpdate) + p;
240 0 : appendStringInfo(buf, "%u", *ptid);
241 :
242 0 : if (p < updates->ndeletedtids - 1)
243 0 : appendStringInfoString(buf, ", ");
244 : }
245 0 : appendStringInfoString(buf, "] }");
246 0 : if (i < nupdated - 1)
247 0 : appendStringInfoString(buf, ", ");
248 :
249 0 : updates = (xl_btree_update *)
250 0 : ((char *) updates + SizeOfBtreeUpdate +
251 0 : updates->ndeletedtids * sizeof(uint16));
252 : }
253 2 : appendStringInfoChar(buf, ']');
254 2 : }
|
