/linux-master/drivers/net/ipa/ |
H A D | ipa_gsi.h | 17 * @trans: Transaction that has completed 22 void ipa_gsi_trans_complete(struct gsi_trans *trans); 26 * @trans: Transaction whose resources should be freed 32 void ipa_gsi_trans_release(struct gsi_trans *trans);
|
H A D | ipa_cmd.h | 85 * @trans: GSI transaction 96 void ipa_cmd_table_init_add(struct gsi_trans *trans, enum ipa_cmd_opcode opcode, 103 * @trans: GSI transaction 110 void ipa_cmd_hdr_init_local_add(struct gsi_trans *trans, u32 offset, u16 size, 115 * @trans: GSI transaction 121 void ipa_cmd_register_write_add(struct gsi_trans *trans, u32 offset, u32 value, 126 * @trans: GSI transaction 132 void ipa_cmd_dma_shared_mem_add(struct gsi_trans *trans, u32 offset, 137 * @trans: GSI transaction 139 void ipa_cmd_pipeline_clear_add(struct gsi_trans *trans); [all...] |
H A D | ipa_table.c | 202 static void ipa_table_reset_add(struct gsi_trans *trans, bool filter, argument 205 struct ipa *ipa = container_of(trans->gsi, struct ipa, gsi); 223 ipa_cmd_dma_shared_mem_add(trans, offset, size, addr, true); 234 struct gsi_trans *trans; local 237 trans = ipa_cmd_trans_alloc(ipa, hweight64(ep_mask)); 238 if (!trans) { 255 ipa_table_reset_add(trans, true, hashed, ipv6, endpoint_id, 1); 258 gsi_trans_commit_wait(trans); 294 struct gsi_trans *trans; local 298 trans 348 struct gsi_trans *trans; local 383 ipa_table_init_add(struct gsi_trans *trans, bool filter, bool ipv6) argument 453 struct gsi_trans *trans; local [all...] |
/linux-master/fs/bcachefs/ |
H A D | fs-common.c | 19 int bch2_create_trans(struct btree_trans *trans, argument 30 struct bch_fs *c = trans->c; 41 ret = bch2_subvolume_get_snapshot(trans, dir.subvol, &snapshot); 45 ret = bch2_inode_peek(trans, &dir_iter, dir_u, dir, BTREE_ITER_INTENT); 56 ret = bch2_inode_create(trans, &inode_iter, new_inode, snapshot, cpu); 72 ret = bch2_subvolume_get(trans, snapshot_src.subvol, true, 80 ret = bch2_inode_peek(trans, &inode_iter, new_inode, snapshot_src, 109 ret = bch2_subvolume_create(trans, new_inode->bi_inum, 123 ret = bch2_subvolume_get_snapshot(trans, dir.subvol, &dir_snapshot); 135 ret = bch2_set_acl_trans(trans, new_inu 185 bch2_link_trans(struct btree_trans *trans, subvol_inum dir, struct bch_inode_unpacked *dir_u, subvol_inum inum, struct bch_inode_unpacked *inode_u, const struct qstr *name) argument 241 bch2_unlink_trans(struct btree_trans *trans, subvol_inum dir, struct bch_inode_unpacked *dir_u, struct bch_inode_unpacked *inode_u, const struct qstr *name, bool deleting_subvol) argument 360 subvol_update_parent(struct btree_trans *trans, u32 subvol, u32 new_parent) argument 376 bch2_rename_trans(struct btree_trans *trans, subvol_inum src_dir, struct bch_inode_unpacked *src_dir_u, subvol_inum dst_dir, struct bch_inode_unpacked *dst_dir_u, struct bch_inode_unpacked *src_inode_u, struct bch_inode_unpacked *dst_inode_u, const struct qstr *src_name, const struct qstr *dst_name, enum bch_rename_mode mode) argument [all...] |
H A D | rebalance.c | 35 static int __bch2_set_rebalance_needs_scan(struct btree_trans *trans, u64 inum) argument 43 bch2_trans_iter_init(trans, &iter, BTREE_ID_rebalance_work, 55 cookie = bch2_trans_kmalloc(trans, sizeof(*cookie)); 64 ret = bch2_trans_update(trans, &iter, &cookie->k_i, 0); 66 bch2_trans_iter_exit(trans, &iter); 73 __bch2_set_rebalance_needs_scan(trans, inum)); 83 static int bch2_clear_rebalance_needs_scan(struct btree_trans *trans, u64 inum, u64 cookie) argument 90 bch2_trans_iter_init(trans, &iter, BTREE_ID_rebalance_work, 103 ret = bch2_btree_delete_at(trans, &iter, 0); 105 bch2_trans_iter_exit(trans, 109 next_rebalance_entry(struct btree_trans *trans, struct btree_iter *work_iter) argument 117 bch2_bkey_clear_needs_rebalance(struct btree_trans *trans, struct btree_iter *iter, struct bkey_s_c k) argument 131 next_rebalance_extent(struct btree_trans *trans, struct bpos work_pos, struct btree_iter *extent_iter, struct data_update_opts *data_opts) argument 196 struct btree_trans *trans = ctxt->trans; local 271 struct btree_trans *trans = ctxt->trans; local 319 struct btree_trans *trans = ctxt->trans; local [all...] |
H A D | tests.c | 34 struct btree_trans *trans = bch2_trans_get(c); local 42 bch2_trans_iter_init(trans, &iter, BTREE_ID_xattrs, k.k.p, 45 ret = commit_do(trans, NULL, NULL, 0, 47 bch2_trans_update(trans, &iter, &k.k_i, 0)); 53 ret = commit_do(trans, NULL, NULL, 0, 55 bch2_btree_delete_at(trans, &iter, 0)); 61 ret = commit_do(trans, NULL, NULL, 0, 63 bch2_btree_delete_at(trans, &iter, 0)); 68 bch2_trans_iter_exit(trans, &iter); 69 bch2_trans_put(trans); 75 struct btree_trans *trans = bch2_trans_get(c); local 345 struct btree_trans *trans = bch2_trans_get(c); local 365 struct btree_trans *trans = bch2_trans_get(c); local 476 struct btree_trans *trans; local 541 struct btree_trans *trans = bch2_trans_get(c); local 563 struct btree_trans *trans = bch2_trans_get(c); local 595 struct btree_trans *trans = bch2_trans_get(c); local 618 rand_mixed_trans(struct btree_trans *trans, struct btree_iter *iter, struct bkey_i_cookie *cookie, u64 i, u64 pos) argument 645 struct btree_trans *trans = bch2_trans_get(c); local 667 __do_delete(struct btree_trans *trans, struct bpos pos) argument 691 struct btree_trans *trans = bch2_trans_get(c); local [all...] |
H A D | migrate.c | 39 static int bch2_dev_usrdata_drop_key(struct btree_trans *trans, argument 45 struct bch_fs *c = trans->c; 52 n = bch2_bkey_make_mut(trans, iter, &k, BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE); 81 struct btree_trans *trans = bch2_trans_get(c); local 89 ret = for_each_btree_key_commit(trans, iter, id, POS_MIN, 92 bch2_dev_usrdata_drop_key(trans, &iter, k, dev_idx, flags)); 97 bch2_trans_put(trans); 104 struct btree_trans *trans; local 116 trans = bch2_trans_get(c); 121 bch2_trans_node_iter_init(trans, [all...] |
H A D | subvolume.c | 27 static int check_subvol(struct btree_trans *trans, argument 31 struct bch_fs *c = trans->c; 44 ret = bch2_snapshot_lookup(trans, snapid, &snapshot); 53 ret = bch2_subvolume_delete(trans, iter->pos.offset); 64 bch2_bkey_make_mut_typed(trans, iter, &subvol.s_c, 0, subvolume); 76 bch2_bkey_get_iter(trans, &subvol_children_iter, 88 ret = bch2_btree_bit_mod(trans, BTREE_ID_subvolume_children, pos, true); 96 ret = bch2_inode_peek_nowarn(trans, &inode_iter, &inode, 99 bch2_trans_iter_exit(trans, &inode_iter); 108 ret = bch2_subvolume_delete(trans, ite 172 check_subvol_child(struct btree_trans *trans, struct btree_iter *child_iter, struct bkey_s_c child_k) argument 238 subvolume_children_mod(struct btree_trans *trans, struct bpos pos, bool set) argument 245 bch2_subvolume_trigger(struct btree_trans *trans, enum btree_id btree_id, unsigned level, struct bkey_s_c old, struct bkey_s new, unsigned flags) argument 265 bch2_subvol_has_children(struct btree_trans *trans, u32 subvol) argument 279 bch2_subvolume_get_inlined(struct btree_trans *trans, unsigned subvol, bool inconsistent_if_not_found, int iter_flags, struct bch_subvolume *s) argument 292 bch2_subvolume_get(struct btree_trans *trans, unsigned subvol, bool inconsistent_if_not_found, int iter_flags, struct bch_subvolume *s) argument 300 bch2_subvol_is_ro_trans(struct btree_trans *trans, u32 subvol) argument 318 bch2_snapshot_get_subvol(struct btree_trans *trans, u32 snapshot, struct bch_subvolume *subvol) argument 327 bch2_subvolume_get_snapshot(struct btree_trans *trans, u32 subvolid, u32 *snapid) argument 348 bch2_subvolume_reparent(struct btree_trans *trans, struct btree_iter *iter, struct bkey_s_c k, u32 old_parent, u32 new_parent) argument 380 bch2_subvolumes_reparent(struct btree_trans *trans, u32 subvolid_to_delete) argument 398 __bch2_subvolume_delete(struct btree_trans *trans, u32 subvolid) argument 423 bch2_subvolume_delete(struct btree_trans *trans, u32 subvolid) argument 467 bch2_subvolume_wait_for_pagecache_and_delete_hook(struct btree_trans *trans, struct btree_trans_commit_hook *_h) argument 490 bch2_subvolume_unlink(struct btree_trans *trans, u32 subvolid) argument 521 bch2_subvolume_create(struct btree_trans *trans, u64 inode, u32 parent_subvolid, u32 src_subvolid, u32 *new_subvolid, u32 *new_snapshotid, bool ro) argument 631 __bch2_fs_upgrade_for_subvolumes(struct btree_trans *trans) argument [all...] |
H A D | str_hash.h | 163 bch2_hash_lookup_in_snapshot(struct btree_trans *trans, argument 173 for_each_btree_key_upto_norestart(trans, *iter, desc.btree_id, 187 bch2_trans_iter_exit(trans, iter); 193 bch2_hash_lookup(struct btree_trans *trans, argument 201 return bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot) ?: 202 bch2_hash_lookup_in_snapshot(trans, iter, desc, info, inum, key, flags, snapshot); 206 bch2_hash_hole(struct btree_trans *trans, argument 216 ret = bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot); 220 for_each_btree_key_upto_norestart(trans, *iter, desc.btree_id, 226 bch2_trans_iter_exit(trans, ite 232 bch2_hash_needs_whiteout(struct btree_trans *trans, const struct bch_hash_desc desc, const struct bch_hash_info *info, struct btree_iter *start) argument 262 bch2_hash_set_in_snapshot(struct btree_trans *trans, const struct bch_hash_desc desc, const struct bch_hash_info *info, subvol_inum inum, u32 snapshot, struct bkey_i *insert, bch_str_hash_flags_t str_hash_flags, int update_flags) argument 324 bch2_hash_set(struct btree_trans *trans, const struct bch_hash_desc desc, const struct bch_hash_info *info, subvol_inum inum, struct bkey_i *insert, bch_str_hash_flags_t str_hash_flags) argument 340 bch2_hash_delete_at(struct btree_trans *trans, const struct bch_hash_desc desc, const struct bch_hash_info *info, struct btree_iter *iter, unsigned update_flags) argument 366 bch2_hash_delete(struct btree_trans *trans, const struct bch_hash_desc desc, const struct bch_hash_info *info, subvol_inum inum, const void *key) argument [all...] |
H A D | dirent.c | 164 static struct bkey_i_dirent *dirent_create_key(struct btree_trans *trans, argument 176 dirent = bch2_trans_kmalloc(trans, u64s * sizeof(u64)); 203 int bch2_dirent_create_snapshot(struct btree_trans *trans, argument 214 dirent = dirent_create_key(trans, dir_inum, type, name, dst_inum); 222 ret = bch2_hash_set_in_snapshot(trans, bch2_dirent_hash_desc, hash_info, 231 int bch2_dirent_create(struct btree_trans *trans, subvol_inum dir, argument 240 dirent = dirent_create_key(trans, dir, type, name, dst_inum); 245 ret = bch2_hash_set(trans, bch2_dirent_hash_desc, hash_info, 259 int bch2_dirent_read_target(struct btree_trans *trans, subvol_inum dir, argument 275 ret = bch2_subvolume_get(trans, targe 283 bch2_dirent_rename(struct btree_trans *trans, subvol_inum src_dir, struct bch_hash_info *src_hash, subvol_inum dst_dir, struct bch_hash_info *dst_hash, const struct qstr *src_name, subvol_inum *src_inum, u64 *src_offset, const struct qstr *dst_name, subvol_inum *dst_inum, u64 *dst_offset, enum bch_rename_mode mode) argument 475 bch2_dirent_lookup_trans(struct btree_trans *trans, struct btree_iter *iter, subvol_inum dir, const struct bch_hash_info *hash_info, const struct qstr *name, subvol_inum *inum, unsigned flags) argument 505 struct btree_trans *trans = bch2_trans_get(c); local 515 bch2_empty_dir_snapshot(struct btree_trans *trans, u64 dir, u32 subvol, u32 snapshot) argument 536 bch2_empty_dir_trans(struct btree_trans *trans, subvol_inum dir) argument 546 struct btree_trans *trans = bch2_trans_get(c); local [all...] |
H A D | btree_update_interior.c | 41 static btree_path_idx_t get_unlocked_mut_path(struct btree_trans *trans, argument 46 btree_path_idx_t path_idx = bch2_path_get(trans, btree_id, pos, level + 1, level, 49 path_idx = bch2_btree_path_make_mut(trans, path_idx, true, _RET_IP_); 51 struct btree_path *path = trans->paths + path_idx; 52 bch2_btree_path_downgrade(trans, path); 53 __bch2_btree_path_unlock(trans, path); 60 int bch2_btree_node_check_topology(struct btree_trans *trans, struct btree *b) argument 62 struct bch_fs *c = trans->c; 81 bch2_btree_and_journal_iter_init_node_iter(trans, &iter, b); 223 static void __btree_node_free(struct btree_trans *trans, struc argument 244 bch2_btree_node_free_inmem(struct btree_trans *trans, struct btree_path *path, struct btree *b) argument 264 bch2_btree_node_free_never_used(struct btree_update *as, struct btree_trans *trans, struct btree *b) argument 301 __bch2_btree_node_alloc(struct btree_trans *trans, struct disk_reservation *res, struct closure *cl, bool interior_node, unsigned flags) argument 377 bch2_btree_node_alloc(struct btree_update *as, struct btree_trans *trans, unsigned level) argument 443 bch2_btree_node_alloc_replacement(struct btree_update *as, struct btree_trans *trans, struct btree *b) argument 471 __btree_root_alloc(struct btree_update *as, struct btree_trans *trans, unsigned level) argument 486 bch2_btree_reserve_put(struct btree_update *as, struct btree_trans *trans) argument 522 bch2_btree_reserve_get(struct btree_trans *trans, struct btree_update *as, unsigned nr_nodes[2], unsigned flags, struct closure *cl) argument 563 bch2_btree_update_free(struct btree_update *as, struct btree_trans *trans) argument 633 btree_update_nodes_written_trans(struct btree_trans *trans, struct btree_update *as) argument 670 struct btree_trans *trans = bch2_trans_get(c); local 1111 bch2_btree_update_done(struct btree_update *as, struct btree_trans *trans) argument 1132 bch2_btree_update_start(struct btree_trans *trans, struct btree_path *path, unsigned level_start, bool split, unsigned flags) argument 1307 bch2_btree_set_root(struct btree_update *as, struct btree_trans *trans, struct btree_path *path, struct btree *b, bool nofail) argument 1348 bch2_insert_fixup_btree_ptr(struct btree_update *as, struct btree_trans *trans, struct btree_path *path, struct btree *b, struct btree_node_iter *node_iter, struct bkey_i *insert) argument 1410 bch2_btree_insert_keys_interior(struct btree_update *as, struct btree_trans *trans, struct btree_path *path, struct btree *b, struct btree_node_iter node_iter, struct keylist *keys) argument 1441 __btree_split_node(struct btree_update *as, struct btree_trans *trans, struct btree *b, struct btree *n[2]) argument 1557 btree_split_insert_keys(struct btree_update *as, struct btree_trans *trans, btree_path_idx_t path_idx, struct btree *b, struct keylist *keys) argument 1577 btree_split(struct btree_update *as, struct btree_trans *trans, btree_path_idx_t path, struct btree *b, struct keylist *keys) argument 1767 bch2_btree_insert_node(struct btree_update *as, struct btree_trans *trans, btree_path_idx_t path_idx, struct btree *b, struct keylist *keys) argument 1840 bch2_btree_split_leaf(struct btree_trans *trans, btree_path_idx_t path, unsigned flags) argument 1872 __btree_increase_depth(struct btree_update *as, struct btree_trans *trans, btree_path_idx_t path_idx) argument 1913 bch2_btree_increase_depth(struct btree_trans *trans, btree_path_idx_t path, unsigned flags) argument 1931 __bch2_foreground_maybe_merge(struct btree_trans *trans, btree_path_idx_t path, unsigned level, unsigned flags, enum btree_node_sibling sib) argument 2125 bch2_btree_node_rewrite(struct btree_trans *trans, struct btree_iter *iter, struct btree *b, unsigned flags) argument 2200 async_btree_node_rewrite_trans(struct btree_trans *trans, struct async_btree_rewrite *a) argument 2321 __bch2_btree_node_update_key(struct btree_trans *trans, struct btree_iter *iter, struct btree *b, struct btree *new_hash, struct bkey_i *new_key, unsigned commit_flags, bool skip_triggers) argument 2418 bch2_btree_node_update_key(struct btree_trans *trans, struct btree_iter *iter, struct btree *b, struct bkey_i *new_key, unsigned commit_flags, bool skip_triggers) argument 2467 bch2_btree_node_update_key_get_iter(struct btree_trans *trans, struct btree *b, struct bkey_i *new_key, unsigned commit_flags, bool skip_triggers) argument 2514 __bch2_btree_root_alloc_fake(struct btree_trans *trans, enum btree_id id, unsigned level) argument [all...] |
H A D | btree_key_cache.c | 199 bkey_cached_alloc(struct btree_trans *trans, struct btree_path *path, argument 202 struct bch_fs *c = trans->c; 255 ret = btree_node_lock_nopath(trans, &ck->c, SIX_LOCK_intent, _THIS_IP_); 263 mark_btree_node_locked(trans, path, 0, BTREE_NODE_INTENT_LOCKED); 265 ret = bch2_btree_node_lock_write(trans, path, &ck->c); 267 btree_node_unlock(trans, path, 0); 275 ck = allocate_dropping_locks(trans, ret, 322 btree_key_cache_create(struct btree_trans *trans, struct btree_path *path) argument 324 struct bch_fs *c = trans->c; 329 ck = bkey_cached_alloc(trans, pat 375 btree_key_cache_fill(struct btree_trans *trans, struct btree_path *ck_path, struct bkey_cached *ck) argument 466 bch2_btree_path_traverse_cached_slowpath(struct btree_trans *trans, struct btree_path *path, unsigned flags) argument 557 bch2_btree_path_traverse_cached(struct btree_trans *trans, struct btree_path *path, unsigned flags) argument 612 btree_key_cache_flush_pos(struct btree_trans *trans, struct bkey_cached_key key, u64 journal_seq, unsigned commit_flags, bool evict) argument 727 struct btree_trans *trans = bch2_trans_get(c); local 758 bch2_btree_insert_key_cached(struct btree_trans *trans, unsigned flags, struct btree_insert_entry *insert_entry) argument 805 bch2_btree_key_cache_drop(struct btree_trans *trans, struct btree_path *path) argument [all...] |
/linux-master/fs/btrfs/ |
H A D | verity.c | 110 struct btrfs_trans_handle *trans; local 123 trans = btrfs_start_transaction(root, 1); 124 if (IS_ERR(trans)) { 125 ret = PTR_ERR(trans); 137 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); 145 btrfs_end_transaction(trans); 161 ret = btrfs_del_items(trans, root, path, path->slots[0], 1); 163 btrfs_end_transaction(trans); 168 btrfs_end_transaction(trans); 171 btrfs_end_transaction(trans); 219 struct btrfs_trans_handle *trans; local 425 del_orphan(struct btrfs_trans_handle *trans, struct btrfs_inode *inode) argument 459 struct btrfs_trans_handle *trans = NULL; local 526 struct btrfs_trans_handle *trans = NULL; local 585 struct btrfs_trans_handle *trans; local [all...] |
H A D | dir-item.h | 18 int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, 21 struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans, 26 struct btrfs_trans_handle *trans, 33 int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans, 37 int btrfs_insert_xattr_item(struct btrfs_trans_handle *trans, 42 struct btrfs_dir_item *btrfs_lookup_xattr(struct btrfs_trans_handle *trans,
|
H A D | root-tree.h | 21 int btrfs_add_root_ref(struct btrfs_trans_handle *trans, u64 root_id, 24 int btrfs_del_root_ref(struct btrfs_trans_handle *trans, u64 root_id, 27 int btrfs_del_root(struct btrfs_trans_handle *trans, const struct btrfs_key *key); 28 int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root *root, 31 int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root *root, 40 void btrfs_update_root_times(struct btrfs_trans_handle *trans, struct btrfs_root *root);
|
H A D | transaction.h | 171 #define TRANS_ABORTED(trans) (unlikely(READ_ONCE((trans)->aborted))) 191 static inline void btrfs_set_inode_last_trans(struct btrfs_trans_handle *trans, argument 195 inode->last_trans = trans->transaction->transid; 205 static inline void btrfs_set_skip_qgroup(struct btrfs_trans_handle *trans, argument 210 delayed_refs = &trans->transaction->delayed_refs; 215 static inline void btrfs_clear_skip_qgroup(struct btrfs_trans_handle *trans) argument 219 delayed_refs = &trans->transaction->delayed_refs; 230 #define btrfs_abort_transaction(trans, error) \ 235 &((trans) [all...] |
H A D | root-tree.c | 128 int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root argument 144 ret = btrfs_search_slot(trans, root, key, path, 0, 1); 154 btrfs_abort_transaction(trans, ret); 170 ret = btrfs_search_slot(trans, root, key, path, 173 btrfs_abort_transaction(trans, ret); 177 ret = btrfs_del_item(trans, root, path); 179 btrfs_abort_transaction(trans, ret); 183 ret = btrfs_insert_empty_item(trans, root, path, 186 btrfs_abort_transaction(trans, ret); 201 btrfs_mark_buffer_dirty(trans, pat 207 btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root *root, const struct btrfs_key *key, struct btrfs_root_item *item) argument 269 struct btrfs_trans_handle *trans; local 319 btrfs_del_root(struct btrfs_trans_handle *trans, const struct btrfs_key *key) argument 344 btrfs_del_root_ref(struct btrfs_trans_handle *trans, u64 root_id, u64 ref_id, u64 dirid, u64 *sequence, const struct fscrypt_str *name) argument 416 btrfs_add_root_ref(struct btrfs_trans_handle *trans, u64 root_id, u64 ref_id, u64 dirid, u64 sequence, const struct fscrypt_str *name) argument 483 btrfs_update_root_times(struct btrfs_trans_handle *trans, struct btrfs_root *root) argument [all...] |
/linux-master/drivers/net/wireless/intel/iwlwifi/ |
H A D | iwl-dbg-tlv.c | 7 #include "iwl-trans.h" 99 static int iwl_dbg_tlv_alloc_debug_info(struct iwl_trans *trans, argument 113 IWL_DEBUG_FW(trans, "WRT: Loading debug cfg: %s\n", 116 if (!iwl_dbg_tlv_add(tlv, &trans->dbg.debug_info_tlv_list)) 121 static int iwl_dbg_tlv_alloc_buf_alloc(struct iwl_trans *trans, argument 152 IWL_ERR(trans, "WRT: Invalid DRAM buffer allocation requested size (0)\n"); 156 trans->dbg.fw_mon_cfg[alloc_id] = *alloc; 160 IWL_ERR(trans, 166 static int iwl_dbg_tlv_alloc_hcmd(struct iwl_trans *trans, argument 181 IWL_ERR(trans, 192 iwl_dbg_tlv_alloc_region(struct iwl_trans *trans, const struct iwl_ucode_tlv *tlv) argument 256 iwl_dbg_tlv_alloc_trigger(struct iwl_trans *trans, const struct iwl_ucode_tlv *tlv) argument 293 iwl_dbg_tlv_config_set(struct iwl_trans *trans, const struct iwl_ucode_tlv *tlv) argument 329 iwl_dbg_tlv_alloc(struct iwl_trans *trans, const struct iwl_ucode_tlv *tlv, bool ext) argument 383 iwl_dbg_tlv_del_timers(struct iwl_trans *trans) argument 396 iwl_dbg_tlv_fragments_free(struct iwl_trans *trans, enum iwl_fw_ini_allocation_id alloc_id) argument 424 iwl_dbg_tlv_free(struct iwl_trans *trans) argument 479 iwl_dbg_tlv_parse_bin(struct iwl_trans *trans, const u8 *data, size_t len) argument 505 iwl_dbg_tlv_load_bin(struct device *dev, struct iwl_trans *trans) argument 528 iwl_dbg_tlv_init(struct iwl_trans *trans) argument [all...] |
H A D | iwl-devtrace.h | 15 #include "iwl-trans.h" 49 static inline size_t iwl_rx_trace_len(const struct iwl_trans *trans, argument 57 if (cmd->cmd != trans->rx_mpdu_cmd) 61 trans->rx_mpdu_cmd_hdr_size; 70 return sizeof(__le32) + sizeof(*cmd) + trans->rx_mpdu_cmd_hdr_size + 103 void __trace_iwlwifi_dev_rx(struct iwl_trans *trans, void *pkt, size_t len); 105 static inline void maybe_trace_iwlwifi_dev_rx(struct iwl_trans *trans, argument 111 __trace_iwlwifi_dev_rx(trans, pkt, len);
|
H A D | iwl-dbg-tlv.h | 51 void iwl_dbg_tlv_load_bin(struct device *dev, struct iwl_trans *trans); 52 void iwl_dbg_tlv_free(struct iwl_trans *trans); 53 void iwl_dbg_tlv_alloc(struct iwl_trans *trans, const struct iwl_ucode_tlv *tlv, 55 void iwl_dbg_tlv_init(struct iwl_trans *trans); 76 void iwl_dbg_tlv_del_timers(struct iwl_trans *trans);
|
H A D | iwl-nvm-parse.h | 33 iwl_parse_nvm_data(struct iwl_trans *trans, const struct iwl_cfg *cfg, 70 int iwl_read_external_nvm(struct iwl_trans *trans, 82 struct iwl_nvm_data *iwl_get_nvm(struct iwl_trans *trans, 90 iwl_parse_mei_nvm_data(struct iwl_trans *trans, const struct iwl_cfg *cfg, 97 void iwl_reinit_cab(struct iwl_trans *trans, struct iwl_nvm_data *data,
|
/linux-master/drivers/gpu/drm/i915/display/ |
H A D | intel_audio_regs.h | 85 #define HSW_AUD_CFG(trans) _MMIO_TRANS(trans, _HSW_AUD_CONFIG_A, _HSW_AUD_CONFIG_B) 89 #define HSW_AUD_MISC_CTRL(trans) _MMIO_TRANS(trans, _HSW_AUD_MISC_CTRL_A, _HSW_AUD_MISC_CTRL_B) 93 #define HSW_AUD_M_CTS_ENABLE(trans) _MMIO_TRANS(trans, _HSW_AUD_M_CTS_ENABLE_A, _HSW_AUD_M_CTS_ENABLE_B) 100 #define HSW_AUD_DIP_ELD_CTRL(trans) _MMIO_TRANS(trans, _HSW_AUD_DIP_ELD_CTRL_ST_A, _HSW_AUD_DIP_ELD_CTRL_ST_B) 105 #define AUD_DIG_CNVT(trans) _MMIO_TRANS(trans, _HSW_AUD_DIG_CNVT_ [all...] |
/linux-master/drivers/net/wireless/intel/iwlwifi/fw/ |
H A D | uefi.c | 57 void *iwl_uefi_get_pnvm(struct iwl_trans *trans, size_t *len) argument 67 IWL_DEBUG_FW(trans, 73 IWL_DEBUG_FW(trans, "Read PNVM from UEFI with size %lu\n", package_size); 80 void *iwl_uefi_get_verified_variable(struct iwl_trans *trans, argument 93 IWL_DEBUG_RADIO(trans, 100 IWL_DEBUG_RADIO(trans, 107 IWL_DEBUG_RADIO(trans, "%s from UEFI with size %lu\n", var_name, 115 int iwl_uefi_handle_tlv_mem_desc(struct iwl_trans *trans, const u8 *data, argument 122 IWL_DEBUG_FW(trans, "TLV len (%d) is too small\n", tlv_len); 128 IWL_DEBUG_FW(trans, 151 iwl_uefi_reduce_power_section(struct iwl_trans *trans, const u8 *data, size_t len, struct iwl_pnvm_image *pnvm_data) argument 205 iwl_uefi_reduce_power_parse(struct iwl_trans *trans, const u8 *data, size_t len, struct iwl_pnvm_image *pnvm_data) argument 263 iwl_uefi_get_reduced_power(struct iwl_trans *trans, size_t *len) argument 292 iwl_uefi_step_parse(struct uefi_cnv_common_step_data *common_step_data, struct iwl_trans *trans) argument 306 iwl_uefi_get_step_table(struct iwl_trans *trans) argument 359 iwl_uefi_get_sgom_table(struct iwl_trans *trans, struct iwl_fw_runtime *fwrt) argument 392 iwl_uefi_get_uats_table(struct iwl_trans *trans, struct iwl_fw_runtime *fwrt) argument [all...] |
/linux-master/fs/btrfs/tests/ |
H A D | free-space-tree-tests.c | 20 static int __check_free_space_extents(struct btrfs_trans_handle *trans, argument 35 info = search_free_space_info(trans, cache, path, 0); 107 static int check_free_space_extents(struct btrfs_trans_handle *trans, argument 118 info = search_free_space_info(trans, cache, path, 0); 127 ret = __check_free_space_extents(trans, fs_info, cache, path, extents, 134 ret = convert_free_space_to_extents(trans, cache, path); 140 ret = convert_free_space_to_bitmaps(trans, cache, path); 146 return __check_free_space_extents(trans, fs_info, cache, path, extents, 150 static int test_empty_block_group(struct btrfs_trans_handle *trans, argument 160 return check_free_space_extents(trans, fs_inf 164 test_remove_all(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, struct btrfs_block_group *cache, struct btrfs_path *path, u32 alignment) argument 185 test_remove_beginning(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, struct btrfs_block_group *cache, struct btrfs_path *path, u32 alignment) argument 208 test_remove_end(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, struct btrfs_block_group *cache, struct btrfs_path *path, u32 alignment) argument 231 test_remove_middle(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, struct btrfs_block_group *cache, struct btrfs_path *path, u32 alignment) argument 255 test_merge_left(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, struct btrfs_block_group *cache, struct btrfs_path *path, u32 alignment) argument 292 test_merge_right(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, struct btrfs_block_group *cache, struct btrfs_path *path, u32 alignment) argument 330 test_merge_both(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, struct btrfs_block_group *cache, struct btrfs_path *path, u32 alignment) argument 373 test_merge_none(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, struct btrfs_block_group *cache, struct btrfs_path *path, u32 alignment) argument 430 struct btrfs_trans_handle trans; local [all...] |
/linux-master/drivers/net/wireless/quantenna/qtnfmac/ |
H A D | trans.c | 18 struct qtnf_cmd_ctl_node *ctl_node = &bus->trans.curr_cmd; 83 struct qtnf_cmd_ctl_node *ctl_node = &bus->trans.curr_cmd; 114 struct qtnf_qlink_transport *trans = &bus->trans; local 116 if (likely(skb_queue_len(&trans->event_queue) < 117 trans->event_queue_max_len)) { 118 skb_queue_tail(&trans->event_queue, skb); 131 struct qtnf_qlink_transport *trans = &bus->trans; local 133 init_completion(&trans [all...] |