Print this page
Revert "8958 Update Intel ucode to 20180108 release"
This reverts commit 1adc3ffcd976ec0a34010cc7db08037a14c3ea4c.
NEX-15280 New default metadata block size is too large
Reviewed by: Yuri Pankov <yuri.pankov@nexenta.com>
Reviewed by: Roman Strashkin <roman.strashkin@nexenta.com>
NEX-15280 New default metadata block size is too large
Reviewed by: Yuri Pankov <yuri.pankov@nexenta.com>
Reviewed by: Roman Strashkin <roman.strashkin@nexenta.com>
NEX-5058 WBC: Race between the purging of window and opening new one
Reviewed by: Alek Pinchuk <alek.pinchuk@nexenta.com>
Reviewed by: Alex Aizman <alex.aizman@nexenta.com>
NEX-2830 ZFS smart compression
Reviewed by: Alek Pinchuk <alek.pinchuk@nexenta.com>
Reviewed by: Roman Strashkin <roman.strashkin@nexenta.com>
NEX-3266 5630 stale bonus buffer in recycled dnode_t leads to data corruption
Reviewed by: Matthew Ahrens <mahrens@delphix.com>
Reviewed by: George Wilson <george@delphix.com>
Reviewed by: Will Andrews <will@freebsd.org>
Approved by: Robert Mustacchi <rm@joyent.com>
Reviewed by: Dan Fields <dan.fields@nexenta.com>
SUP-507 Delete or truncate of large files delayed on datasets with small recordsize
Reviewed by: Albert Lee <trisk@nexenta.com>
Reviewed by: Alek Pinchuk <alek.pinchuk@nexenta.com>
Reviewed by: Ilya Usvyatsky <ilya.usvyatsky@nexenta.com>
Reviewed by: Tony Nguyen <tony.nguyen@nexenta.com>
Fixup merge results
re #12585 rb4049 ZFS++ work port - refactoring to improve separation of open/closed code, bug fixes, performance improvements - open code
Bug 11205: add missing libzfs_closed_stubs.c to fix opensource-only build.
ZFS plus work: special vdevs, cos, cos/vdev properties
| Split |
Close |
| Expand all |
| Collapse all |
--- old/usr/src/uts/common/fs/zfs/sys/dnode.h
+++ new/usr/src/uts/common/fs/zfs/sys/dnode.h
1 1 /*
2 2 * CDDL HEADER START
3 3 *
4 4 * The contents of this file are subject to the terms of the
5 5 * Common Development and Distribution License (the "License").
6 6 * You may not use this file except in compliance with the License.
7 7 *
8 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 9 * or http://www.opensolaris.org/os/licensing.
10 10 * See the License for the specific language governing permissions
11 11 * and limitations under the License.
12 12 *
|
↓ open down ↓ |
12 lines elided |
↑ open up ↑ |
13 13 * When distributing Covered Code, include this CDDL HEADER in each
14 14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 15 * If applicable, add the following below this CDDL HEADER, with the
16 16 * fields enclosed by brackets "[]" replaced with your own identifying
17 17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 18 *
19 19 * CDDL HEADER END
20 20 */
21 21 /*
22 22 * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
23 + * Copyright 2015 Nexenta Systems, Inc. All rights reserved.
23 24 * Copyright (c) 2012, 2017 by Delphix. All rights reserved.
24 25 * Copyright (c) 2014 Spectra Logic Corporation, All rights reserved.
25 26 */
26 27
27 28 #ifndef _SYS_DNODE_H
28 29 #define _SYS_DNODE_H
29 30
30 31 #include <sys/zfs_context.h>
31 32 #include <sys/avl.h>
32 33 #include <sys/spa.h>
33 34 #include <sys/txg.h>
34 35 #include <sys/zio.h>
35 36 #include <sys/refcount.h>
36 37 #include <sys/dmu_zfetch.h>
37 38 #include <sys/zrlock.h>
38 39 #include <sys/multilist.h>
39 40
40 41 #ifdef __cplusplus
41 42 extern "C" {
42 43 #endif
43 44
44 45 /*
45 46 * dnode_hold() flags.
46 47 */
47 48 #define DNODE_MUST_BE_ALLOCATED 1
48 49 #define DNODE_MUST_BE_FREE 2
49 50
50 51 /*
51 52 * dnode_next_offset() flags.
|
↓ open down ↓ |
19 lines elided |
↑ open up ↑ |
52 53 */
53 54 #define DNODE_FIND_HOLE 1
54 55 #define DNODE_FIND_BACKWARDS 2
55 56 #define DNODE_FIND_HAVELOCK 4
56 57
57 58 /*
58 59 * Fixed constants.
59 60 */
60 61 #define DNODE_SHIFT 9 /* 512 bytes */
61 62 #define DN_MIN_INDBLKSHIFT 12 /* 4k */
63 +#define DN_DFL_INDBLKSHIFT 14 /* 16k */
62 64 /*
63 65 * If we ever increase this value beyond 20, we need to revisit all logic that
64 66 * does x << level * ebps to handle overflow. With a 1M indirect block size,
65 67 * 4 levels of indirect blocks would not be able to guarantee addressing an
66 68 * entire object, so 5 levels will be used, but 5 * (20 - 7) = 65.
67 69 */
68 70 #define DN_MAX_INDBLKSHIFT 17 /* 128k */
69 71 #define DNODE_BLOCK_SHIFT 14 /* 16k */
70 72 #define DNODE_CORE_SIZE 64 /* 64 bytes for dnode sans blkptrs */
71 73 #define DN_MAX_OBJECT_SHIFT 48 /* 256 trillion (zfs_fid_t limit) */
72 74 #define DN_MAX_OFFSET_SHIFT 64 /* 2^64 bytes in a dnode */
73 75
74 76 /*
75 77 * dnode id flags
76 78 *
77 79 * Note: a file will never ever have its
78 80 * ids moved from bonus->spill
79 81 * and only in a crypto environment would it be on spill
80 82 */
81 83 #define DN_ID_CHKED_BONUS 0x1
82 84 #define DN_ID_CHKED_SPILL 0x2
83 85 #define DN_ID_OLD_EXIST 0x4
84 86 #define DN_ID_NEW_EXIST 0x8
85 87
86 88 /*
87 89 * Derived constants.
88 90 */
89 91 #define DNODE_SIZE (1 << DNODE_SHIFT)
90 92 #define DN_MAX_NBLKPTR ((DNODE_SIZE - DNODE_CORE_SIZE) >> SPA_BLKPTRSHIFT)
91 93 #define DN_MAX_BONUSLEN (DNODE_SIZE - DNODE_CORE_SIZE - (1 << SPA_BLKPTRSHIFT))
92 94 #define DN_MAX_OBJECT (1ULL << DN_MAX_OBJECT_SHIFT)
93 95 #define DN_ZERO_BONUSLEN (DN_MAX_BONUSLEN + 1)
94 96 #define DN_KILL_SPILLBLK (1)
95 97
96 98 #define DNODES_PER_BLOCK_SHIFT (DNODE_BLOCK_SHIFT - DNODE_SHIFT)
97 99 #define DNODES_PER_BLOCK (1ULL << DNODES_PER_BLOCK_SHIFT)
98 100
99 101 /*
100 102 * This is inaccurate if the indblkshift of the particular object is not the
101 103 * max. But it's only used by userland to calculate the zvol reservation.
102 104 */
103 105 #define DNODES_PER_LEVEL_SHIFT (DN_MAX_INDBLKSHIFT - SPA_BLKPTRSHIFT)
104 106 #define DNODES_PER_LEVEL (1ULL << DNODES_PER_LEVEL_SHIFT)
105 107
106 108 /* The +2 here is a cheesy way to round up */
107 109 #define DN_MAX_LEVELS (2 + ((DN_MAX_OFFSET_SHIFT - SPA_MINBLOCKSHIFT) / \
108 110 (DN_MIN_INDBLKSHIFT - SPA_BLKPTRSHIFT)))
109 111
110 112 #define DN_BONUS(dnp) ((void*)((dnp)->dn_bonus + \
111 113 (((dnp)->dn_nblkptr - 1) * sizeof (blkptr_t))))
112 114
113 115 #define DN_USED_BYTES(dnp) (((dnp)->dn_flags & DNODE_FLAG_USED_BYTES) ? \
114 116 (dnp)->dn_used : (dnp)->dn_used << SPA_MINBLOCKSHIFT)
115 117
116 118 #define EPB(blkshift, typeshift) (1 << (blkshift - typeshift))
117 119
118 120 struct dmu_buf_impl;
119 121 struct objset;
120 122 struct zio;
121 123
122 124 enum dnode_dirtycontext {
123 125 DN_UNDIRTIED,
124 126 DN_DIRTY_OPEN,
|
↓ open down ↓ |
53 lines elided |
↑ open up ↑ |
125 127 DN_DIRTY_SYNC
126 128 };
127 129
128 130 /* Is dn_used in bytes? if not, it's in multiples of SPA_MINBLOCKSIZE */
129 131 #define DNODE_FLAG_USED_BYTES (1<<0)
130 132 #define DNODE_FLAG_USERUSED_ACCOUNTED (1<<1)
131 133
132 134 /* Does dnode have a SA spill blkptr in bonus? */
133 135 #define DNODE_FLAG_SPILL_BLKPTR (1<<2)
134 136
137 +/*
138 + * Smart Compression
139 + *
140 + * Smart compression is a simple heuristic algorithm that automatically
141 + * tries to avoid compression on incompressible objects by continuously
142 + * monitoring per-object compression performance.
143 + *
144 + * The smart compression system has two states for each object:
145 + * COMPRESSING: compression is applied to the object and results are
146 + * reevaluated at fixed check intervals to see if we should
147 + * continue attempting to compress.
148 + * DENYING: compression has failed too often, so we give up trying
149 + * for a while and retry at a later time.
150 + *
151 + * Each time compression succeeds, we bump down the sc_compression_failures
152 + * counter down to a minimum of -5. This helps us to prevent starting
153 + * denying in case of short incompressible transients. Each time
154 + * compression fails, we bump up the sc_compression_failures counter up to
155 + * a maximum of 5 (zfs_smartcomp_interval_shift). If the failure counter
156 + * is > 0 at the time the compression failed, we transition from the
157 + * COMPRESSING to the DENYING state and calculate a deny interval by
158 + * multiplying zfs_smartcomp_interval and (1 << sc_compression_failures).
159 + * This means that successive failures at compression will have us retry
160 + * compression progressively less often down to approx 32x less often
161 + * (by default) than the compression test interval. To avoid potential
162 + * data patterns confusing us, the deny interval is randomized by +-10%.
163 + */
164 +typedef enum dnode_smartcomp_state {
165 + DNODE_SMARTCOMP_COMPRESSING = 0,
166 + DNODE_SMARTCOMP_DENYING
167 +} dnode_smartcomp_state_t;
168 +
169 +typedef struct dnode_smartcomp {
170 + kmutex_t sc_lock;
171 + dnode_smartcomp_state_t sc_state;
172 + uint64_t sc_size;
173 + uint64_t sc_orig_size;
174 + uint64_t sc_deny_interval;
175 + int64_t sc_comp_failures;
176 +} dnode_smartcomp_t;
177 +
135 178 typedef struct dnode_phys {
136 179 uint8_t dn_type; /* dmu_object_type_t */
137 180 uint8_t dn_indblkshift; /* ln2(indirect block size) */
138 181 uint8_t dn_nlevels; /* 1=dn_blkptr->data blocks */
139 182 uint8_t dn_nblkptr; /* length of dn_blkptr */
140 183 uint8_t dn_bonustype; /* type of data in bonus buffer */
141 184 uint8_t dn_checksum; /* ZIO_CHECKSUM type */
142 185 uint8_t dn_compress; /* ZIO_COMPRESS type */
143 186 uint8_t dn_flags; /* DNODE_FLAG_* */
144 187 uint16_t dn_datablkszsec; /* data block size in 512b sectors */
145 188 uint16_t dn_bonuslen; /* length of dn_bonus */
146 189 uint8_t dn_pad2[4];
147 190
148 191 /* accounting is protected by dn_dirty_mtx */
149 192 uint64_t dn_maxblkid; /* largest allocated block ID */
150 193 uint64_t dn_used; /* bytes (or sectors) of disk space */
151 194
152 195 uint64_t dn_pad3[4];
153 196
154 197 blkptr_t dn_blkptr[1];
155 198 uint8_t dn_bonus[DN_MAX_BONUSLEN - sizeof (blkptr_t)];
156 199 blkptr_t dn_spill;
157 200 } dnode_phys_t;
158 201
159 202 struct dnode {
160 203 /*
161 204 * Protects the structure of the dnode, including the number of levels
162 205 * of indirection (dn_nlevels), dn_maxblkid, and dn_next_*
163 206 */
164 207 krwlock_t dn_struct_rwlock;
165 208
166 209 /* Our link on dn_objset->os_dnodes list; protected by os_lock. */
167 210 list_node_t dn_link;
168 211
169 212 /* immutable: */
170 213 struct objset *dn_objset;
171 214 uint64_t dn_object;
172 215 struct dmu_buf_impl *dn_dbuf;
173 216 struct dnode_handle *dn_handle;
174 217 dnode_phys_t *dn_phys; /* pointer into dn->dn_dbuf->db.db_data */
175 218
176 219 /*
177 220 * Copies of stuff in dn_phys. They're valid in the open
178 221 * context (eg. even before the dnode is first synced).
179 222 * Where necessary, these are protected by dn_struct_rwlock.
180 223 */
181 224 dmu_object_type_t dn_type; /* object type */
182 225 uint16_t dn_bonuslen; /* bonus length */
183 226 uint8_t dn_bonustype; /* bonus type */
184 227 uint8_t dn_nblkptr; /* number of blkptrs (immutable) */
185 228 uint8_t dn_checksum; /* ZIO_CHECKSUM type */
186 229 uint8_t dn_compress; /* ZIO_COMPRESS type */
187 230 uint8_t dn_nlevels;
188 231 uint8_t dn_indblkshift;
189 232 uint8_t dn_datablkshift; /* zero if blksz not power of 2! */
190 233 uint8_t dn_moved; /* Has this dnode been moved? */
191 234 uint16_t dn_datablkszsec; /* in 512b sectors */
192 235 uint32_t dn_datablksz; /* in bytes */
193 236 uint64_t dn_maxblkid;
194 237 uint8_t dn_next_type[TXG_SIZE];
195 238 uint8_t dn_next_nblkptr[TXG_SIZE];
196 239 uint8_t dn_next_nlevels[TXG_SIZE];
197 240 uint8_t dn_next_indblkshift[TXG_SIZE];
198 241 uint8_t dn_next_bonustype[TXG_SIZE];
199 242 uint8_t dn_rm_spillblk[TXG_SIZE]; /* for removing spill blk */
200 243 uint16_t dn_next_bonuslen[TXG_SIZE];
201 244 uint32_t dn_next_blksz[TXG_SIZE]; /* next block size in bytes */
202 245
203 246 /* protected by dn_dbufs_mtx; declared here to fill 32-bit hole */
204 247 uint32_t dn_dbufs_count; /* count of dn_dbufs */
205 248
206 249 /* protected by os_lock: */
207 250 multilist_node_t dn_dirty_link[TXG_SIZE]; /* next on dataset's dirty */
208 251
209 252 /* protected by dn_mtx: */
210 253 kmutex_t dn_mtx;
211 254 list_t dn_dirty_records[TXG_SIZE];
212 255 struct range_tree *dn_free_ranges[TXG_SIZE];
213 256 uint64_t dn_allocated_txg;
214 257 uint64_t dn_free_txg;
215 258 uint64_t dn_assigned_txg;
216 259 kcondvar_t dn_notxholds;
217 260 enum dnode_dirtycontext dn_dirtyctx;
218 261 uint8_t *dn_dirtyctx_firstset; /* dbg: contents meaningless */
219 262
220 263 /* protected by own devices */
221 264 refcount_t dn_tx_holds;
222 265 refcount_t dn_holds;
223 266
224 267 kmutex_t dn_dbufs_mtx;
225 268 /*
226 269 * Descendent dbufs, ordered by dbuf_compare. Note that dn_dbufs
227 270 * can contain multiple dbufs of the same (level, blkid) when a
228 271 * dbuf is marked DB_EVICTING without being removed from
229 272 * dn_dbufs. To maintain the avl invariant that there cannot be
230 273 * duplicate entries, we order the dbufs by an arbitrary value -
231 274 * their address in memory. This means that dn_dbufs cannot be used to
232 275 * directly look up a dbuf. Instead, callers must use avl_walk, have
233 276 * a reference to the dbuf, or look up a non-existant node with
234 277 * db_state = DB_SEARCH (see dbuf_free_range for an example).
235 278 */
236 279 avl_tree_t dn_dbufs;
237 280
238 281 /* protected by dn_struct_rwlock */
239 282 struct dmu_buf_impl *dn_bonus; /* bonus buffer dbuf */
240 283
241 284 boolean_t dn_have_spill; /* have spill or are spilling */
242 285
243 286 /* parent IO for current sync write */
244 287 zio_t *dn_zio;
|
↓ open down ↓ |
100 lines elided |
↑ open up ↑ |
245 288
246 289 /* used in syncing context */
247 290 uint64_t dn_oldused; /* old phys used bytes */
248 291 uint64_t dn_oldflags; /* old phys dn_flags */
249 292 uint64_t dn_olduid, dn_oldgid;
250 293 uint64_t dn_newuid, dn_newgid;
251 294 int dn_id_flags;
252 295
253 296 /* holds prefetch structure */
254 297 struct zfetch dn_zfetch;
298 +
299 + dnode_smartcomp_t dn_smartcomp; /* smart compression performance */
255 300 };
256 301
257 302 /*
258 303 * Adds a level of indirection between the dbuf and the dnode to avoid
259 304 * iterating descendent dbufs in dnode_move(). Handles are not allocated
260 305 * individually, but as an array of child dnodes in dnode_hold_impl().
261 306 */
262 307 typedef struct dnode_handle {
263 308 /* Protects dnh_dnode from modification by dnode_move(). */
264 309 zrlock_t dnh_zrlock;
265 310 dnode_t *dnh_dnode;
266 311 } dnode_handle_t;
267 312
268 313 typedef struct dnode_children {
269 314 dmu_buf_user_t dnc_dbu; /* User evict data */
270 315 size_t dnc_count; /* number of children */
271 316 dnode_handle_t dnc_children[]; /* sized dynamically */
272 317 } dnode_children_t;
273 318
274 319 typedef struct free_range {
275 320 avl_node_t fr_node;
276 321 uint64_t fr_blkid;
277 322 uint64_t fr_nblks;
278 323 } free_range_t;
279 324
280 325 void dnode_special_open(struct objset *dd, dnode_phys_t *dnp,
281 326 uint64_t object, dnode_handle_t *dnh);
282 327 void dnode_special_close(dnode_handle_t *dnh);
283 328
284 329 void dnode_setbonuslen(dnode_t *dn, int newsize, dmu_tx_t *tx);
285 330 void dnode_setbonus_type(dnode_t *dn, dmu_object_type_t, dmu_tx_t *tx);
|
↓ open down ↓ |
21 lines elided |
↑ open up ↑ |
286 331 void dnode_rm_spill(dnode_t *dn, dmu_tx_t *tx);
287 332
288 333 int dnode_hold(struct objset *dd, uint64_t object,
289 334 void *ref, dnode_t **dnp);
290 335 int dnode_hold_impl(struct objset *dd, uint64_t object, int flag,
291 336 void *ref, dnode_t **dnp);
292 337 boolean_t dnode_add_ref(dnode_t *dn, void *ref);
293 338 void dnode_rele(dnode_t *dn, void *ref);
294 339 void dnode_rele_and_unlock(dnode_t *dn, void *tag);
295 340 void dnode_setdirty(dnode_t *dn, dmu_tx_t *tx);
341 +void dnode_setdirty_sc(dnode_t *dn, dmu_tx_t *tx, boolean_t usesc);
296 342 void dnode_sync(dnode_t *dn, dmu_tx_t *tx);
297 343 void dnode_allocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, int ibs,
298 344 dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx);
299 345 void dnode_reallocate(dnode_t *dn, dmu_object_type_t ot, int blocksize,
300 346 dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx);
301 347 void dnode_free(dnode_t *dn, dmu_tx_t *tx);
302 348 void dnode_byteswap(dnode_phys_t *dnp);
303 349 void dnode_buf_byteswap(void *buf, size_t size);
304 350 void dnode_verify(dnode_t *dn);
305 351 int dnode_set_blksz(dnode_t *dn, uint64_t size, int ibs, dmu_tx_t *tx);
306 352 void dnode_free_range(dnode_t *dn, uint64_t off, uint64_t len, dmu_tx_t *tx);
307 353 void dnode_diduse_space(dnode_t *dn, int64_t space);
308 -void dnode_new_blkid(dnode_t *dn, uint64_t blkid, dmu_tx_t *tx, boolean_t);
354 +void dnode_new_blkid(dnode_t *dn, uint64_t blkid, dmu_tx_t *tx,
355 + boolean_t usesc, boolean_t);
309 356 uint64_t dnode_block_freed(dnode_t *dn, uint64_t blkid);
310 357 void dnode_init(void);
311 358 void dnode_fini(void);
312 359 int dnode_next_offset(dnode_t *dn, int flags, uint64_t *off,
313 360 int minlvl, uint64_t blkfill, uint64_t txg);
314 -void dnode_evict_dbufs(dnode_t *dn);
361 +void dnode_evict_dbufs(dnode_t *dn, int level);
315 362 void dnode_evict_bonus(dnode_t *dn);
316 -boolean_t dnode_needs_remap(const dnode_t *dn);
317 363
364 +/* Smart compression callbacks (see zio_smartcomp_info_t). */
365 +extern boolean_t dnode_smartcomp_ask_cb(void *userinfo, const zio_t *zio);
366 +extern void dnode_smartcomp_result_cb(void *userinfo, const zio_t *zio);
367 +extern void dnode_setup_zio_smartcomp(struct dmu_buf_impl *db,
368 + zio_smartcomp_info_t *sc);
369 +
318 370 #define DNODE_IS_CACHEABLE(_dn) \
319 371 ((_dn)->dn_objset->os_primary_cache == ZFS_CACHE_ALL || \
320 372 (DMU_OT_IS_METADATA((_dn)->dn_type) && \
321 373 (_dn)->dn_objset->os_primary_cache == ZFS_CACHE_METADATA))
322 374
323 375 #define DNODE_META_IS_CACHEABLE(_dn) \
324 376 ((_dn)->dn_objset->os_primary_cache == ZFS_CACHE_ALL || \
325 377 (_dn)->dn_objset->os_primary_cache == ZFS_CACHE_METADATA)
326 378
327 379 #ifdef ZFS_DEBUG
328 380
329 381 /*
330 382 * There should be a ## between the string literal and fmt, to make it
331 383 * clear that we're joining two strings together, but that piece of shit
332 384 * gcc doesn't support that preprocessor token.
333 385 */
334 386 #define dprintf_dnode(dn, fmt, ...) do { \
335 387 if (zfs_flags & ZFS_DEBUG_DPRINTF) { \
336 388 char __db_buf[32]; \
337 389 uint64_t __db_obj = (dn)->dn_object; \
338 390 if (__db_obj == DMU_META_DNODE_OBJECT) \
339 391 (void) strcpy(__db_buf, "mdn"); \
340 392 else \
341 393 (void) snprintf(__db_buf, sizeof (__db_buf), "%lld", \
342 394 (u_longlong_t)__db_obj);\
343 395 dprintf_ds((dn)->dn_objset->os_dsl_dataset, "obj=%s " fmt, \
344 396 __db_buf, __VA_ARGS__); \
345 397 } \
346 398 _NOTE(CONSTCOND) } while (0)
347 399
348 400 #define DNODE_VERIFY(dn) dnode_verify(dn)
349 401 #define FREE_VERIFY(db, start, end, tx) free_verify(db, start, end, tx)
350 402
351 403 #else
352 404
353 405 #define dprintf_dnode(db, fmt, ...)
354 406 #define DNODE_VERIFY(dn)
355 407 #define FREE_VERIFY(db, start, end, tx)
356 408
357 409 #endif
358 410
359 411 #ifdef __cplusplus
360 412 }
361 413 #endif
362 414
363 415 #endif /* _SYS_DNODE_H */
|
↓ open down ↓ |
36 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX