/linux/fs/xfs/libxfs/ |
H A D | xfs_defer.c | 52 * requires us to log "intent" items in case log recovery needs to 58 * have not yet had an intent logged) are attached to a pending item 68 * - Create a log intent item for that type. 82 * log intent item. 83 * - For each work item attached to the log intent item, 91 * The key here is that we must log an intent item for all pending 94 * we can perform complex remapping operations, chaining intent items 106 * item to prevent the log intent item from replaying, immediately log 107 * a new log intent item with the unfinished work items, roll the 109 * log done item and the new log intent item must be in the same [all …]
|
H A D | xfs_log_recover.h | 46 * If the recovered item is an intent item, this function should parse 47 * the recovered item to construct an in-core log intent item and 48 * insert it into the AIL. The in-core log intent item should have 1 50 * recovered log item for the intent-done item; (b) replay the work and 51 * log a new intent-done item; or (c) recovery fails and we have to 54 * If the recovered item is an intent-done item, this function should 55 * parse the recovered item to find the id of the corresponding intent 56 * log item. Next, it should find the in-core log intent item in the 147 * intent item. 149 * Intent recovery only runs a single step of the transaction chain and defers [all …]
|
H A D | xfs_defer.h | 14 * Save a log intent item and a list of extents, so that we can replay 21 struct xfs_log_item *dfp_intent; /* log intent item */ 29 * Create a log intent item for this deferred item, but don't actually finish 54 void (*abort_intent)(struct xfs_log_item *intent); 56 struct xfs_log_item *intent, unsigned int count); 65 struct xfs_log_item *intent,
|
H A D | xfs_log_format.h | 241 #define XFS_LI_RUI 0x1240 /* rmap update intent */ 243 #define XFS_LI_CUI 0x1242 /* refcount update intent */ 245 #define XFS_LI_BUI 0x1244 /* bmbt update intent */ 247 #define XFS_LI_ATTRI 0x1246 /* attr set/remove intent*/ 249 #define XFS_LI_XMI 0x1248 /* mapping exchange intent */ 251 #define XFS_LI_EFI_RT 0x124a /* realtime extent free intent */ 253 #define XFS_LI_RUI_RT 0x124c /* realtime rmap update intent */ 255 #define XFS_LI_CUI_RT 0x124e /* realtime refcount update intent */
|
/linux/fs/xfs/ |
H A D | xfs_drain.h | 33 * Deferred Work Intent Drains 36 * When a writer thread executes a chain of log intent items, the AG header 37 * buffer locks will cycle during a transaction roll to get from one intent 48 * scrub wait until it has both AG header buffer locks and the intent counter 50 * AGI or AGF buffers when decrementing the intent counter. 57 * sub-items (such as RUIs) must bump the intent counter and maintain it until 58 * the sub-items can themselves bump the intent counter. 60 * Therefore, the intent count tracks entire lifetimes of deferred work items. 61 * All functions that create work items must increment the intent counter as
|
H A D | xfs_drain.c | 54 /* Increase the pending intent count. */ 70 /* Decrease the pending intent count, and wake any waiters, if appropriate. */ 86 * Wait for the pending intent count for a drain to hit zero. 98 * intent to update its metadata. 120 * Release our intent to update this groups metadata, and then release our 133 * Wait for the intent update count for this AG to hit zero. 145 * Has anyone declared an intent to update this group?
|
H A D | xfs_bmap_item.c | 243 /* Log bmap updates in the intent item. */ 306 struct xfs_log_item *intent, in xfs_bmap_update_create_done() argument 309 struct xfs_bui_log_item *buip = BUI_ITEM(intent); in xfs_bmap_update_create_done() 333 * Bump the intent count on behalf of the deferred rmap and refcount in xfs_bmap_update_get_group() 334 * intent items that that we can queue when we finish this bmap work. in xfs_bmap_update_get_group() 335 * This new intent item will bump the intent count before the bmap in xfs_bmap_update_get_group() 336 * intent drops the intent count, ensuring that the intent count in xfs_bmap_update_get_group() 404 struct xfs_log_item *intent) in xfs_bmap_update_abort_intent() argument 406 xfs_bui_release(BUI_ITEM(intent)); in xfs_bmap_update_abort_intent() 481 * Process a bmap update intent item that was recovered from the log. [all …]
|
H A D | xfs_rmap_item.c | 265 /* Log rmap updates in the intent item. */ 366 struct xfs_log_item *intent, in xfs_rmap_update_create_done() argument 369 struct xfs_rui_log_item *ruip = RUI_ITEM(intent); in xfs_rmap_update_create_done() 453 struct xfs_log_item *intent) in xfs_rmap_update_abort_intent() argument 455 xfs_rui_release(RUI_ITEM(intent)); in xfs_rmap_update_abort_intent() 555 * Process an rmap update intent item that was recovered from the log. 611 /* Relog an intent item to push the log tail forward. */ 615 struct xfs_log_item *intent, in xfs_rmap_relog_intent() argument 622 ASSERT(intent->li_type == XFS_LI_RUI || in xfs_rmap_relog_intent() 623 intent->li_type == XFS_LI_RUI_RT); in xfs_rmap_relog_intent() [all …]
|
H A D | xfs_refcount_item.c | 264 /* Log refcount updates in the intent item. */ 341 struct xfs_log_item *intent, in xfs_refcount_update_create_done() argument 344 struct xfs_cui_log_item *cuip = CUI_ITEM(intent); in xfs_refcount_update_create_done() 434 struct xfs_log_item *intent) in xfs_refcount_update_abort_intent() argument 436 xfs_cui_release(CUI_ITEM(intent)); in xfs_refcount_update_abort_intent() 490 * Process a refcount update intent item that was recovered from the log. 558 /* Relog an intent item to push the log tail forward. */ 562 struct xfs_log_item *intent, in xfs_refcount_relog_intent() argument 569 ASSERT(intent->li_type == XFS_LI_CUI || in xfs_refcount_relog_intent() 570 intent->li_type == XFS_LI_CUI_RT); in xfs_refcount_relog_intent() [all …]
|
H A D | xfs_bmap_item.h | 11 * The common abbreviations for these are BUI (bmap update intent) and BUD 21 * use the redo information recorded by the intent items to replay the 36 * This is the "bmap update intent" log item. It is used to log the fact that
|
H A D | xfs_refcount_item.h | 12 * update intent) and CUD (refcount update done). The redo item type 21 * recovery will use the redo information recorded by the intent items 36 * This is the "refcount update intent" log item. It is used to log
|
H A D | xfs_rmap_item.h | 12 * intent) and RUD (rmap update done). The redo item type is encoded in the 24 * use the redo information recorded by the intent items to replay the 39 * This is the "rmap update intent" log item. It is used to log the fact that
|
H A D | xfs_attr_item.c | 47 * attribute log intent items for a single xattr update. To avoid cycling the 366 /* Log an attr to the intent item. */ 379 * created the log intent. Fill in the attri log item and log format in xfs_attr_log_item() 517 struct xfs_log_item *intent) in xfs_attr_abort_intent() argument 519 xfs_attri_release(ATTRI_ITEM(intent)); in xfs_attr_abort_intent() 730 * Process an attr intent item that was recovered from the log. We need to 807 /* Re-log an intent item to push the log tail forward. */ 811 struct xfs_log_item *intent, in xfs_attr_relog_intent() argument 819 old_attrip = ATTRI_ITEM(intent); in xfs_attr_relog_intent() 853 struct xfs_log_item *intent, in xfs_attr_create_done() argument [all …]
|
/linux/fs/bcachefs/ |
H A D | six.h | 9 * Shared/intent/exclusive locks: sleepable read/write locks, like rw semaphores 10 * but with an additional state: read/shared, intent, exclusive/write 12 * The purpose of the intent state is to allow for greater concurrency on tree 17 * But by adding an intent state, which is exclusive with other intent locks but 18 * not with readers, we can take intent locks at the start of the operation, 26 * An intent lock must be held before taking a write lock: 37 * six_lock_downgrade() convert from intent to read 38 * six_lock_tryupgrade() attempt to convert from read to intent, may fail 69 * read and intent states that can be used to provide reentrancy by an upper 71 * read or intent state, six_lock_increment() can be used to bump the "lock [all …]
|
H A D | btree_iter.h | 22 static inline void __btree_path_get(struct btree_trans *trans, struct btree_path *path, bool intent) in __btree_path_get() argument 34 path->intent_ref += intent; in __btree_path_get() 38 static inline bool __btree_path_put(struct btree_trans *trans, struct btree_path *path, bool intent) in __btree_path_put() argument 43 EBUG_ON(!path->intent_ref && intent); in __btree_path_put() 46 path->intent_ref -= intent; in __btree_path_put() 211 btree_path_idx_t path, bool intent, in bch2_btree_path_make_mut() argument 216 path = __bch2_btree_path_make_mut(trans, path, intent, ip); in bch2_btree_path_make_mut() 228 bool intent, unsigned long ip) in bch2_btree_path_set_pos() argument 231 ? __bch2_btree_path_set_pos(trans, path, new_pos, intent, ip) in bch2_btree_path_set_pos()
|
H A D | six.c | 640 * six_lock_downgrade - convert an intent lock to a read lock 643 * @lock will have read count incremented and intent count decremented 653 * six_lock_tryupgrade - attempt to convert read lock to an intent lock 656 * On success, @lock will have intent count incremented and read count 694 * On success, @lock will have intent count incremented and read count 786 * Return: the number of times a lock is held for read, intent and write. 809 * and intent locks on the same lock. 821 * intent one (or more) times, so @lock will never be left unlocked.
|
H A D | btree_iter.c | 1120 /* If we need intent locks, take them too: */ in __btree_path_up_until_good_node() 1260 bool intent, unsigned long ip) in btree_path_clone() argument 1264 __btree_path_get(trans, trans->paths + new, intent); in btree_path_clone() 1273 btree_path_idx_t path, bool intent, unsigned long ip) in __bch2_btree_path_make_mut() argument 1276 __btree_path_put(trans, trans->paths + path, intent); in __bch2_btree_path_make_mut() 1277 path = btree_path_clone(trans, path, intent, ip); in __bch2_btree_path_make_mut() 1286 bool intent, unsigned long ip) in __bch2_btree_path_set_pos() argument 1295 path_idx = bch2_btree_path_make_mut(trans, path_idx, intent, ip); in __bch2_btree_path_set_pos() 1400 void bch2_path_put(struct btree_trans *trans, btree_path_idx_t path_idx, bool intent) in bch2_path_put() argument 1404 if (!__btree_path_put(trans, path, intent)) in bch2_path_put() [all …]
|
/linux/include/uapi/linux/ |
H A D | membarrier.h | 57 * registration is about the intent to receive 62 * Register the process intent to receive 82 * intent to use the private expedited command 86 * Register the process intent to use 108 * intent to use the private expedited sync 112 * Register the process intent to use 128 * intent to use the private expedited rseq 132 * Register the process intent to use
|
/linux/include/linux/ |
H A D | lru_cache.h | 48 This is known as "write intent log", and can be implemented as on-disk 53 in-flight WRITE IO, e.g. by only lazily clearing the on-disk write-intent 73 write intent log information, three of which are mentioned here. 76 The on-disk "dirty bitmap" may be re-used as "write-intent" bitmap as well. 77 To reduce the frequency of bitmap updates for write-intent log purposes, 84 "Explicit (coarse) write intent bitmap" 86 for write-intent log purposes, additionally to the fine grained dirty bitmap.
|
/linux/Documentation/ABI/testing/ |
H A D | sysfs-class-fpga-manager | 12 The intent is to provide enough detail that if something goes 44 error or incompatible bitstream image. The intent of this
|
/linux/fs/smb/client/ |
H A D | cifs_fs_sb.h | 36 #define CIFS_MOUNT_CIFS_BACKUPUID 0x200000 /* backup intent bit for a user */ 37 #define CIFS_MOUNT_CIFS_BACKUPGID 0x400000 /* backup intent bit for a group */
|
/linux/drivers/net/ |
H A D | LICENSE.SRC | 12 intent in sharing this software is to promote the productive interchange
|
/linux/tools/testing/selftests/net/ |
H A D | toeplitz_client.sh | 7 # intent is for the calling program to kill this program once it is no longer
|
/linux/Documentation/security/ |
H A D | lsm-development.rst | 6 a new LSM is accepted into the kernel when its intent (a description of
|
/linux/drivers/net/ethernet/myricom/ |
H A D | Kconfig | 43 is used, with the intent of lessening the impact of cache misses.
|