Home
last modified time | relevance | path

Searched full:intent (Results 1 – 25 of 176) sorted by relevance

12345678

/linux/fs/xfs/libxfs/
H A Dxfs_defer.c52 * 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 Dxfs_trans_resv.c462 * the three xattr intent items that track the progress of the parent
488 * For a standard rename, the three xattr intent log items in xfs_calc_rename_reservation()
493 * For an RENAME_EXCHANGE, there are two xattr intent in xfs_calc_rename_reservation()
499 * intent items to allow the log tail to move ahead, so in xfs_calc_rename_reservation()
1238 * one logcount for refcount intent items, and one logcount for rmap in xfs_trans_resv_calc()
1239 * intent items. in xfs_trans_resv_calc()
/linux/fs/bcachefs/
H A Dsix.h9 * 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 Dbtree_iter.h22 static inline void __btree_path_get(struct btree_trans *trans, struct btree_path *path, bool intent) in __btree_path_get() argument
33 path->intent_ref += intent; in __btree_path_get()
37 static inline bool __btree_path_put(struct btree_trans *trans, struct btree_path *path, bool intent) in __btree_path_put() argument
41 EBUG_ON(!path->intent_ref && intent); in __btree_path_put()
44 path->intent_ref -= intent; in __btree_path_put()
209 btree_path_idx_t path, bool intent, in bch2_btree_path_make_mut() argument
214 path = __bch2_btree_path_make_mut(trans, path, intent, ip); in bch2_btree_path_make_mut()
226 bool intent, unsigned long ip) in bch2_btree_path_set_pos() argument
229 ? __bch2_btree_path_set_pos(trans, path, new_pos, intent, ip) in bch2_btree_path_set_pos()
H A Dsix.c633 * six_lock_downgrade - convert an intent lock to a read lock
636 * @lock will have read count incremented and intent count decremented
646 * six_lock_tryupgrade - attempt to convert read lock to an intent lock
649 * On success, @lock will have intent count incremented and read count
687 * On success, @lock will have intent count incremented and read count
779 * Return: the number of times a lock is held for read, intent and write.
802 * and intent locks on the same lock.
814 * intent one (or more) times, so @lock will never be left unlocked.
H A Dbtree_iter.c1100 /* If we need intent locks, take them too: */ in __btree_path_up_until_good_node()
1240 bool intent, unsigned long ip) in btree_path_clone() argument
1244 __btree_path_get(trans, trans->paths + new, intent); in btree_path_clone()
1253 btree_path_idx_t path, bool intent, unsigned long ip) in __bch2_btree_path_make_mut() argument
1256 __btree_path_put(trans, trans->paths + path, intent); in __bch2_btree_path_make_mut()
1257 path = btree_path_clone(trans, path, intent, ip); in __bch2_btree_path_make_mut()
1266 bool intent, unsigned long ip) in __bch2_btree_path_set_pos() argument
1275 path_idx = bch2_btree_path_make_mut(trans, path_idx, intent, ip); in __bch2_btree_path_set_pos()
1380 void bch2_path_put(struct btree_trans *trans, btree_path_idx_t path_idx, bool intent) in bch2_path_put() argument
1384 if (!__btree_path_put(trans, path, intent)) in bch2_path_put()
[all …]
/linux/include/uapi/linux/
H A Dmembarrier.h57 * 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/fs/xfs/
H A Dxfs_bmap_item.c243 /* 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 Dxfs_bmap_item.h11 * 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 Dxfs_refcount_item.h12 * 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 Dxfs_rmap_item.h12 * 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 Dxfs_attr_item.c47 * 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 …]
H A Dxfs_log_recover.c1717 * Release the recovered intent item in the AIL that matches the given intent
1718 * type and intent id.
1769 * Log intent items that target inodes effectively contain a file handle.
1770 * Check that the generation number matches the intent item like we do for
1771 * other file handles. Log intent items defined after this validation weakness
1969 * log intent item that was found during recovery.
1983 * Insert the intent into the AIL directly and drop one reference so in xlog_recover_intent_item()
2540 * from recovering a single intent item. in xlog_finish_defer_ops()
2570 * When this is called, all of the log intent items which did not have
2574 * Since we process the log intent items in normal transactions, they will be
[all …]
/linux/include/linux/
H A Dlru_cache.h48 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 Dsysfs-class-fpga-manager12 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 Dcifs_fs_sb.h36 #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 DLICENSE.SRC12 intent in sharing this software is to promote the productive interchange
/linux/tools/testing/selftests/net/
H A Dtoeplitz_client.sh7 # intent is for the calling program to kill this program once it is no longer
/linux/Documentation/security/
H A Dlsm-development.rst6 a new LSM is accepted into the kernel when its intent (a description of
/linux/drivers/net/ethernet/myricom/
H A DKconfig43 is used, with the intent of lessening the impact of cache misses.
/linux/fs/coda/
H A Dcoda_fs_i.h43 bool cfi_access_intent; /* is access intent supported */
/linux/arch/arc/include/asm/
H A Delf.h68 * intent than poking at uname or /proc/cpuinfo.
/linux/arch/openrisc/include/asm/
H A Delf.h54 intent than poking at uname or /proc/cpuinfo.
/linux/drivers/mtd/spi-nor/
H A DKconfig40 Don't use this if you intent to use the software write protection
/linux/Documentation/admin-guide/cifs/
H A Dintroduction.rst24 The intent of this module is to provide the most advanced network

12345678