/Linux-v6.1/fs/jbd2/ |
D | checkpoint.c | 26 * Unlink a buffer from a transaction checkpoint list. 32 transaction_t *transaction = jh->b_cp_transaction; in __buffer_unlink_first() local 36 if (transaction->t_checkpoint_list == jh) { in __buffer_unlink_first() 37 transaction->t_checkpoint_list = jh->b_cpnext; in __buffer_unlink_first() 38 if (transaction->t_checkpoint_list == jh) in __buffer_unlink_first() 39 transaction->t_checkpoint_list = NULL; in __buffer_unlink_first() 44 * Unlink a buffer from a transaction checkpoint(io) list. 50 transaction_t *transaction = jh->b_cp_transaction; in __buffer_unlink() local 53 if (transaction->t_checkpoint_io_list == jh) { in __buffer_unlink() 54 transaction->t_checkpoint_io_list = jh->b_cpnext; in __buffer_unlink() [all …]
|
D | transaction.c | 3 * linux/fs/jbd2/transaction.c 9 * Generic filesystem transaction handling code; part of the ext2fs 46 pr_emerg("JBD2: failed to create transaction cache\n"); in jbd2_journal_init_transaction_cache() 58 void jbd2_journal_free_transaction(transaction_t *transaction) in jbd2_journal_free_transaction() argument 60 if (unlikely(ZERO_OR_NULL_PTR(transaction))) in jbd2_journal_free_transaction() 62 kmem_cache_free(transaction_cache, transaction); in jbd2_journal_free_transaction() 66 * Base amount of descriptor blocks we reserve for each transaction. 81 * space for commit block and normal transaction descriptor blocks. in jbd2_descriptor_blocks_per_trans() 90 * Simply initialise a new transaction. Initialize it in 92 * have an existing running transaction: we only make a new transaction [all …]
|
D | revoke.c | 17 * transaction's revoked blocks to the journal 19 * + Recovery: during recovery we record the transaction ID of all 26 * single transaction: 30 * cancel the revoke before the transaction commits. 37 * in the current transaction, so any revoke for that block in the 38 * transaction must have happened after the block was journaled and so 47 * We cache revoke status of a buffer in the current transaction in b_states 62 * running transaction (is pointed to by journal->j_revoke), the other one 63 * belongs to the committing transaction. Accesses to the second hash table 66 * running and which to the committing transaction is called only from [all …]
|
/Linux-v6.1/drivers/net/ipa/ |
D | gsi_trans.h | 25 /* Maximum number of TREs in an IPA immediate command transaction */ 29 * struct gsi_trans - a GSI transaction 31 * Most fields in this structure for internal use by the transaction core code: 33 * @channel_id: Channel number transaction is associated with 34 * @cancelled: If set by the core code, transaction was cancelled 35 * @rsvd_count: Number of TREs reserved for this transaction 37 * @len: Number of bytes sent or received by the transaction 38 * @data: Preserved but not touched by the core transaction code 43 * @completion: Completed when the transaction completes 44 * @byte_count: TX channel byte count recorded when transaction committed [all …]
|
D | gsi_private.h | 20 * gsi_trans_move_complete() - Mark a GSI transaction completed 21 * @trans: Transaction whose state is to be updated 26 * gsi_trans_move_polled() - Mark a transaction polled 27 * @trans: Transaction whose state is to be updated 32 * gsi_trans_complete() - Complete a GSI transaction 33 * @trans: Transaction to complete 35 * Marks a transaction complete (including freeing it). 40 * gsi_channel_trans_mapped() - Return a transaction mapped to a TRE index 41 * @channel: Channel associated with the transaction 42 * @index: Index of the TRE having a transaction [all …]
|
D | gsi_trans.c | 24 * A GSI transaction abstracts the behavior of a GSI channel by representing 28 * by the GSI transaction core, allowing users to simply describe operations 29 * to be performed. When a transaction has completed a callback function 31 * cleanup of resources associated with the transaction. 33 * To perform an operation (or set of them), a user of the GSI transaction 34 * interface allocates a transaction, indicating the number of TREs required 36 * for use in the transaction and the allocation succeeds. This way 39 * transaction are also allocated when the transaction is allocated. 41 * Operations performed as part of a transaction are represented in an array 42 * of Linux scatterlist structures, allocated with the transaction. These [all …]
|
D | ipa_cmd.h | 84 * ipa_cmd_table_init_add() - Add table init command to a transaction 85 * @trans: GSI transaction 102 * ipa_cmd_hdr_init_local_add() - Add a header init command to a transaction 103 * @trans: GSI transaction 114 * ipa_cmd_register_write_add() - Add a register write command to a transaction 115 * @trans: GSI transaction 125 * ipa_cmd_dma_shared_mem_add() - Add a DMA memory command to a transaction 126 * @trans: GSI transaction 136 * ipa_cmd_pipeline_clear_add() - Add pipeline clear commands to a transaction 137 * @trans: GSI transaction [all …]
|
/Linux-v6.1/Documentation/filesystems/ |
D | xfs-delayed-logging-design.rst | 13 themselves with the general concepts of how transaction processing in XFS works. 16 transaction reservations are structured and accounted, and then move into how we 59 transactions. Permanent transaction reservations can take reservations that span 68 In the code, a one-shot transaction pattern looks somewhat like this:: 72 <join item to transaction> 76 As items are modified in the transaction, the dirty regions in those items are 77 tracked via the transaction handle. Once the transaction is committed, all 79 space that was taken at the transaction allocation time. 81 In contrast, a permanent transaction is made up of multiple linked individual 97 While this might look similar to a one-shot transaction, there is an important [all …]
|
D | journalling.rst | 42 this use jbd2_journal_start() which returns a transaction handle. 45 which indicates the end of a transaction are nestable calls, so you can 46 reenter a transaction if necessary, but remember you must call 48 jbd2_journal_start() before the transaction is completed (or more 52 Inside each transaction you need to wrap the modifications to the 59 uncommitted transaction. At this point you are at last ready to modify a 74 single outstanding transaction at any one time, remember nothing commits 76 the transaction at the end of each file/inode/address etc. operation you 83 if there isn't enough space in the journal for your transaction (based 96 transaction. I advise having a look at at least ext4_jbd.h to see the [all …]
|
/Linux-v6.1/include/linux/ |
D | journal-head.h | 16 typedef unsigned int tid_t; /* Unique transaction ID */ 17 typedef struct transaction_s transaction_t; /* Compound transaction type */ 50 * the currently running transaction 69 * Pointer to the compound transaction which owns this buffer's 70 * metadata: either the running transaction or the committing 71 * transaction (if there is one). Only applies to buffers on a 72 * transaction's data or metadata journaling list. 80 * Pointer to the running compound transaction which is currently 81 * modifying the buffer's metadata, if there was already a transaction 82 * committing it when the new transaction touched it. [all …]
|
D | jbd2.h | 9 * Definitions for transaction data structures for the buffer cache 86 * the transaction, so that at all times we know how many buffers the 87 * outstanding updates on a transaction might possibly touch. 99 * We use the journal_t to keep track of all outstanding transaction 219 #define JBD2_FLAG_DELETED 4 /* block deleted by this transaction */ 404 * ordered mode present in a transaction so that we can sync them during commit. 410 * Which transaction does this inode belong to? Either the running 411 * transaction or the committing one. [j_list_lock] 418 * Pointer to the running transaction modifying inode's data in case 419 * there is already a committing transaction touching it. [j_list_lock] [all …]
|
/Linux-v6.1/Documentation/powerpc/ |
D | transactional_memory.rst | 21 A simple transaction looks like this:: 41 /* Retry the transaction if it failed because it conflicted with 50 example, the transaction completes as though it were normal straight-line code 58 transaction, the transaction will be aborted by the CPU. Register and memory 66 Causes of transaction aborts 78 Syscalls made from within an active transaction will not be performed and the 79 transaction will be doomed by the kernel with the failure code TM_CAUSE_SYSCALL 82 Syscalls made from within a suspended transaction are performed as normal and 83 the transaction is not explicitly doomed by the kernel. However, what the 84 kernel does to perform the syscall may result in the transaction being doomed [all …]
|
/Linux-v6.1/drivers/usb/host/ |
D | octeon-hcd.c | 108 * @CVMX_USB_STATUS_OK: The transaction / operation finished without 111 * @CVMX_USB_STATUS_CANCEL: The transaction was canceled while in flight 113 * @CVMX_USB_STATUS_ERROR: The transaction aborted with an unexpected 115 * @CVMX_USB_STATUS_STALL: The transaction received a USB STALL response 117 * @CVMX_USB_STATUS_XACTERR: The transaction failed with an error from the 119 * @CVMX_USB_STATUS_DATATGLERR: The transaction failed with a data toggle 121 * @CVMX_USB_STATUS_BABBLEERR: The transaction failed with a babble error 122 * @CVMX_USB_STATUS_FRAMEERR: The transaction failed with a frame error 238 * enum represents all of the possible stages a transaction can 241 * transaction with a simple clearing of bit 0. [all …]
|
/Linux-v6.1/fs/btrfs/ |
D | transaction.c | 17 #include "transaction.h" 30 * Transaction states and transitions 32 * No running transaction (fs tree blocks are not modified) 37 * Transaction N [[TRANS_STATE_RUNNING]] 39 * | New trans handles can be attached to transaction N by calling all 44 * | transaction N 46 * Transaction N [[TRANS_STATE_COMMIT_START]] 48 * | Will wait for previous running transaction to completely finish if there 54 * | - Wait for current transaction to be committed by others. 58 * | to this running transaction. [all …]
|
D | transaction.h | 32 * transaction, it must be zero before the transaction is 37 * total writers in this transaction, it must be zero before the 38 * transaction can end 61 * it do so under some form of transaction critical section, namely: 64 * run by one of the transaction committers. Refer to 68 * commit_cowonly_roots from transaction critical section 71 * - btrfs_cleanup_dirty_bgs - called on transaction abort 91 * Number of ordered extents the transaction must wait for before 123 struct btrfs_transaction *transaction; member 131 * Error code of transaction abort, set outside of locks and must use [all …]
|
/Linux-v6.1/fs/ntfs/ |
D | usnjrnl.h | 3 * usnjrnl.h - Defines for NTFS kernel transaction log ($UsnJrnl) handling. 20 * Transaction log ($UsnJrnl) organization: 22 * The transaction log records whenever a file is modified in any way. So for 28 * The transaction log is in the $Extend directory which is in the root 29 * directory of each volume. If it is not present it means transaction 30 * logging is disabled. If it is present it means transaction logging is 34 * To determine whether the transaction logging is enabled or in the process 38 * If the flag VOLUME_DELETE_USN_UNDERWAY is set it means the transaction log 40 * transaction log is enabled. 42 * The transaction log consists of two parts; the $DATA/$Max attribute as well [all …]
|
/Linux-v6.1/fs/xfs/ |
D | xfs_trans.c | 49 * Initialize the precomputed transaction reservation values 61 * Free the transaction structure. If there is more clean up 80 * This is called to create a new transaction which will share the 81 * permanent log reservation of the given transaction. The remaining 83 * implies that the original transaction is no longer allowed to allocate 85 * be added to the new transaction explicitly. 98 * Initialize the new transaction structure. in xfs_trans_dup() 114 /* We gave our writer reference to the new transaction */ in xfs_trans_dup() 136 * given transaction. This must be done before allocating any resources 137 * within the transaction. [all …]
|
D | xfs_trans_buf.c | 20 * a part of the given transaction. 52 * Add the locked buffer to the transaction. 55 * transaction. 58 * then allocate one for it. Then add the buf item to the transaction. 84 * Take a reference for this transaction on the buf item. in _xfs_trans_bjoin() 89 * Attach the item to the transaction so we can find it in in _xfs_trans_bjoin() 108 * locked within the given transaction. If it is already locked 109 * within the transaction, just increment its lock recursion count 112 * If the transaction pointer is NULL, make this just a normal 133 * If we find the buffer in the cache with this transaction in xfs_trans_get_buf_map() [all …]
|
/Linux-v6.1/include/linux/dma/ |
D | sprd-dma.h | 18 * configurations. Once the source channel's transaction is done, it will 19 * trigger the destination channel's transaction automatically by hardware 49 * @SPRD_DMA_FRAG_DONE_TRG: Trigger the transaction of destination channel 51 * @SPRD_DMA_BLOCK_DONE_TRG: Trigger the transaction of destination channel 53 * @SPRD_DMA_TRANS_DONE_TRG: Trigger the transaction of destination channel 55 * @SPRD_DMA_LIST_DONE_TRG: Trigger the transaction of destination channel 70 * @SPRD_DMA_TRANS_REQ: transaction request mode 73 * We have 4 types request mode: fragment mode, block mode, transaction mode 74 * and linklist mode. One transaction can contain several blocks, one block can 94 * @SPRD_DMA_TRANS_INT: tansaction done interrupt when one transaction [all …]
|
/Linux-v6.1/fs/xfs/libxfs/ |
D | xfs_defer.c | 37 * we can roll the transaction to adhere to AG locking order rules and 48 * roll a transaction to facilitate this, but using this facility 60 * start, we define "rolling a deferred-op transaction" as follows: 69 * > Roll the transaction. 71 * NOTE: To avoid exceeding the transaction reservation, we limit the 77 * - Roll the deferred-op transaction as above. 84 * wants a new transaction. See the "Requesting a Fresh 85 * Transaction while Finishing Deferred Work" section below for 89 * work items every time we roll the transaction, and that we must log 94 * Requesting a Fresh Transaction while Finishing Deferred Work [all …]
|
/Linux-v6.1/fs/ext4/ |
D | ext4_jbd2.h | 21 /* Define the number of blocks we need to account to a transaction to 26 * block to complete the transaction. 42 /* Define the minimum size for a transaction which modifies data. This 61 * writing to any given transaction. For unbounded transactions such as 63 * start off at the maximum transaction size and grow the transaction 68 /* We break up a large truncate or write transaction once the handle's 70 * transaction or to start a new one. Reserve enough space here for 145 * ext4_journal_callback_add: add a function to call after transaction commit 146 * @handle: active journal transaction handle to register callback on 147 * @func: callback function to call after the transaction has committed: [all …]
|
/Linux-v6.1/drivers/net/wireless/intel/iwlwifi/dvm/ |
D | tt.c | 24 /* default Thermal Throttling transaction table 352 struct iwl_tt_trans *transaction; in iwl_advance_tt_handler() local 357 * find the curresponding transaction table in iwl_advance_tt_handler() 359 * tt->transaction + ((old_state * (IWL_TI_STATE_MAX - 1)) in iwl_advance_tt_handler() 362 * find the next state need to transaction to in iwl_advance_tt_handler() 364 * in the current table to see if transaction is needed in iwl_advance_tt_handler() 366 transaction = tt->transaction + in iwl_advance_tt_handler() 368 if (temp >= transaction->tt_low && in iwl_advance_tt_handler() 369 temp <= transaction->tt_high) { in iwl_advance_tt_handler() 383 transaction->next_state) { in iwl_advance_tt_handler() [all …]
|
/Linux-v6.1/Documentation/i2c/busses/ |
D | i2c-mlxcpld.rst | 19 The next transaction types are supported: 29 Bits [6:5] - transaction length. b01 - 72B is supported, 43 It should be written last as it triggers an I2C transaction. 45 Number of data bytes to write in read transaction 47 Number of address bytes to write in read transaction. 49 Bit 0 - transaction is completed. 52 For write transaction address is specified in four first bytes 54 For read transactions address is sent in a separate transaction and
|
/Linux-v6.1/tools/testing/selftests/powerpc/tm/ |
D | tm-resched-dscr.c | 3 * when within a transaction. 12 * Start a transaction, and suspend it (*). 14 * Hard loop checking to see if the transaction has become doomed. 21 * (*) If the transaction is not suspended we can't see the problem because 22 * the transaction abort handler will restore the DSCR to it's checkpointed 54 /* start and suspend a transaction */ in test_body() 59 /* hard loop until the transaction becomes doomed */ in test_body() 79 assert(rv); /* make sure the transaction aborted */ in test_body()
|
/Linux-v6.1/Documentation/locking/ |
D | ww-mutex-design.rst | 36 In the RDBMS literature, a reservation ticket is associated with a transaction. 39 If the transaction holding the lock is younger, the locking transaction waits. 40 If the transaction holding the lock is older, the locking transaction backs off 43 If the transaction holding the lock is younger, the locking transaction 44 wounds the transaction holding the lock, requesting it to die. 45 If the transaction holding the lock is older, it waits for the other 46 transaction. Hence Wound-Wait. 47 The two algorithms are both fair in that a transaction will eventually succeed. 53 running transaction. Note that this is not the same as process preemption. A 54 Wound-Wait transaction is considered preempted when it dies (returning [all …]
|