Searched refs:insert (Results 26 - 50 of 105) sorted by relevance

12345

/linux-master/security/selinux/ss/
H A Davtab.h108 int (*insert)(struct avtab *a, const struct avtab_key *k,
/linux-master/scripts/
H A DMakefile11 hostprogs-always-$(CONFIG_SYSTEM_EXTRA_CERTIFICATE) += insert-sys-cert
/linux-master/fs/bcachefs/
H A Dbtree_trans_commit.c76 * a new bset to insert into:
125 /* Inserting into a given leaf node (last stage of insert): */
127 /* Handle overwrites and do insert, for non extents: */
132 struct bkey_i *insert)
139 EBUG_ON(bkey_deleted(&insert->k) && bkey_val_u64s(&insert->k));
140 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key));
141 EBUG_ON(bpos_gt(insert->k.p, b->data->max_key));
142 EBUG_ON(insert->k.u64s > bch2_btree_keys_u64s_remaining(b));
143 EBUG_ON(!b->c.level && !bpos_eq(insert
128 bch2_btree_bset_insert_key(struct btree_trans *trans, struct btree_path *path, struct btree *b, struct btree_node_iter *node_iter, struct bkey_i *insert) argument
264 bch2_btree_insert_key_leaf(struct btree_trans *trans, struct btree_path *path, struct bkey_i *insert, u64 journal_seq) argument
[all...]
H A Dbset.c49 * over keys that compare equal to our insert key, and then insert immediately
50 * prior to the first key greater than the key we're inserting - our insert
51 * position will be after all keys that compare equal to our insert key, which
52 * by the time we actually do the insert will all be deleted.
243 struct bkey_packed *insert, unsigned clobber_u64s)
252 bkey_iter_cmp(b, prev, insert) > 0);
255 bkey_iter_cmp(b, prev, insert) > 0) {
257 struct bkey k2 = bkey_unpack_key(b, insert);
263 panic("prev > insert
242 bch2_verify_insert_pos(struct btree *b, struct bkey_packed *where, struct bkey_packed *insert, unsigned clobber_u64s) argument
1005 bch2_bset_insert(struct btree *b, struct btree_node_iter *iter, struct bkey_packed *where, struct bkey_i *insert, unsigned clobber_u64s) argument
[all...]
H A Dbackpointers.c100 bool insert)
105 if (insert) {
151 bool insert)
167 if (!insert) {
181 if (insert
185 ret = backpointer_mod_err(trans, bp, k, orig_k, insert);
96 backpointer_mod_err(struct btree_trans *trans, struct bch_backpointer bp, struct bkey_s_c bp_k, struct bkey_s_c orig_k, bool insert) argument
147 bch2_bucket_backpointer_mod_nowritebuffer(struct btree_trans *trans, struct bpos bucket, struct bch_backpointer bp, struct bkey_s_c orig_k, bool insert) argument
H A Dbtree_update_interior.c742 * @b is the node we did the final insert into:
921 struct bkey_i *insert = &b->key; local
926 BUG_ON(as->journal_u64s + jset_u64s(insert->k.u64s) >
933 insert, insert->k.u64s);
1353 struct bkey_i *insert)
1360 BUG_ON(insert->k.type == KEY_TYPE_btree_ptr_v2 &&
1361 !btree_ptr_sectors_written(insert));
1364 bch2_journal_key_overwritten(c, b->c.btree_id, b->c.level, insert->k.p);
1366 if (bch2_bkey_invalid(c, bkey_i_to_s_c(insert),
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
1417 struct bkey_i *insert = bch2_keylist_front(keys); local
[all...]
H A Dtests.c125 bch_err_msg(c, ret, "insert error");
180 bch_err_msg(c, ret, "insert error");
236 bch_err_msg(c, ret, "insert error");
296 bch_err_msg(c, ret, "insert error");
710 struct bkey_i_cookie insert; local
712 bkey_cookie_init(&insert.k_i);
721 insert.k.p = iter.pos;
722 bch2_trans_update(trans, &iter, &insert.k_i, 0);
H A Dfs-io.c172 * insert trigger: look up the btree inode instead
549 bool insert)
559 if (insert) {
571 if (insert)
575 insert, &i_sectors_delta);
576 if (!ret && !insert)
547 bchfs_fcollapse_finsert(struct bch_inode_info *inode, loff_t offset, loff_t len, bool insert) argument
/linux-master/lib/
H A Drbtree_test.c32 static void insert(struct test_node *node, struct rb_root_cached *root) function
261 insert(nodes + j, &root);
270 printk(" -> test 1 (latency of nnodes insert+delete): %llu cycles\n",
286 printk(" -> test 2 (latency of nnodes cached insert+delete): %llu cycles\n",
290 insert(nodes + i, &root);
337 insert(nodes + j, &root);
363 printk(" -> test 1 (latency of nnodes insert+delete): %llu cycles\n", (unsigned long long)time);
378 printk(" -> test 2 (latency of nnodes cached insert+delete): %llu cycles\n", (unsigned long long)time);
/linux-master/arch/powerpc/xmon/
H A Dppc.h245 /* Insertion function. This is used by the assembler. To insert an
263 unsigned long (*insert)
316 insert function with any op value. The disassembler should call
262 unsigned long (*insert) member in struct:powerpc_operand
/linux-master/drivers/mmc/host/
H A Dsdhci-bcm-kona.c75 * insert-removal.
100 * insert-removal.
107 * Software emulation of the SD card insertion/removal. Set insert=1 for insert
108 * and insert=0 for removal. The card detection is done by GPIO. For Broadcom
112 static int sdhci_bcm_kona_sd_card_emulate(struct sdhci_host *host, int insert) argument
122 * insert-removal.
129 if (insert) {
277 /* if device is eMMC, emulate card insert right here */
/linux-master/arch/arm64/kvm/hyp/nvhe/
H A Dpage_alloc.c104 goto insert;
124 insert:
125 /* Mark the new head, and insert it */
/linux-master/Documentation/sphinx/
H A Dautomarkup.py152 possible_targets.insert(0, c_namespace + "." + base_target)
212 possible_targets.insert(0, c_namespace + "." + base_target)
/linux-master/fs/ocfs2/
H A Dalloc.c83 * If this extent tree is supported by an extent map, insert
590 * Tree depth may change during truncate, or insert. If we're
671 * safely removed if we ever need to insert extent block
2036 * - When our insert into the right path leaf is at the leftmost edge
2363 * - In the case that the rotation requires a post-insert update,
2438 "Owner %llu: error during insert of %u "
2458 * before the record insert is that an error
2496 * instead of a real insert, then we have to
3705 * Since the leftright insert always covers the entire
3706 * extent, this call will delete the insert recor
3865 ocfs2_insert_at_leaf(struct ocfs2_extent_tree *et, struct ocfs2_extent_rec *insert_rec, struct ocfs2_extent_list *el, struct ocfs2_insert_type *insert) argument
4162 ocfs2_insert_path(handle_t *handle, struct ocfs2_extent_tree *et, struct ocfs2_path *left_path, struct ocfs2_path *right_path, struct ocfs2_extent_rec *insert_rec, struct ocfs2_insert_type *insert) argument
4483 ocfs2_figure_contig_type(struct ocfs2_extent_tree *et, struct ocfs2_insert_type *insert, struct ocfs2_extent_list *el, struct ocfs2_extent_rec *insert_rec) argument
4529 ocfs2_figure_appending_type(struct ocfs2_insert_type *insert, struct ocfs2_extent_list *el, struct ocfs2_extent_rec *insert_rec) argument
4576 ocfs2_figure_insert_type(struct ocfs2_extent_tree *et, struct buffer_head **last_eb_bh, struct ocfs2_extent_rec *insert_rec, int *free_records, struct ocfs2_insert_type *insert) argument
4717 struct ocfs2_insert_type insert = {0, }; local
4922 struct ocfs2_insert_type insert; local
5289 struct ocfs2_insert_type insert; local
[all...]
/linux-master/tools/verification/dot2/
H A Dautomata.py111 states.insert(0, initial_state)
/linux-master/arch/arm/mm/
H A Dproc-v7-2level.S51 bfi r1, r2, #8, #24 @ insert into new context ID
/linux-master/drivers/char/agp/
H A Defficeon-agp.c259 unsigned long insert = efficeon_mask_memory(mem->pages[i]); local
267 *page = insert;
/linux-master/drivers/staging/vc04_services/interface/vchiq_arm/
H A Dvchiq_arm.c996 int insert; local
1000 insert = instance->completion_insert;
1001 while ((insert - instance->completion_remove) >= MAX_COMPLETIONS) {
1016 completion = &instance->completions[insert & (MAX_COMPLETIONS - 1)];
1036 * record is written out before the insert point.
1041 user_service->message_available_pos = insert;
1043 insert++;
1044 instance->completion_insert = insert;
/linux-master/net/rds/
H A Drdma.c66 struct rds_mr *insert)
84 if (insert) {
85 rb_link_node(&insert->r_rb_node, parent, p);
86 rb_insert_color(&insert->r_rb_node, root);
87 kref_get(&insert->r_kref);
65 rds_mr_tree_walk(struct rb_root *root, u64 key, struct rds_mr *insert) argument
/linux-master/tools/perf/scripts/python/
H A Dnetdev-times.py24 all_event_list = []; # insert all tracepoint event related with this script
398 rx_skb_list.insert(0, rec_data)
409 tx_queue_list.insert(0, skb)
424 tx_xmit_list.insert(0, skb)
/linux-master/fs/btrfs/
H A Dfile-item.c956 * we need to split this item and insert a new one.
1089 goto insert;
1092 /* We didn't find a csum item, insert one. */
1097 goto insert;
1102 * offset matching the start of the checksum range we want to insert.
1127 goto insert;
1138 goto insert;
1165 * a range that ends at the start of the range we want to insert,
1181 goto insert;
1207 insert
[all...]
/linux-master/drivers/md/bcache/
H A Dbset.h67 * So we need to construct some sort of lookup table. Since we only insert keys
139 * whenever we insert another key into it. For the unwritten set, we use a much
144 * These are much easier to keep up to date when we insert a key - we do it
195 struct bkey *insert,
303 struct bkey *insert);
H A Dbset.c858 struct bkey *insert)
864 __set_bytes(t->data, t->data->keys + bkey_u64s(insert)) >
867 memmove((uint64_t *) where + bkey_u64s(insert),
871 t->data->keys += bkey_u64s(insert);
872 bkey_copy(where, insert);
857 bch_bset_insert(struct btree_keys *b, struct bkey *where, struct bkey *insert) argument
/linux-master/drivers/net/ethernet/engleder/
H A Dtsnep_tc.c160 bool insert)
172 if (insert) {
189 /* search for insert operation and reset properties */
212 /* last operation of list is reserved to insert operation */
159 tsnep_set_gcl_change(struct tsnep_gcl *gcl, int index, u64 change, bool insert) argument
/linux-master/kernel/bpf/
H A Dmprog.c90 * P1 and P2 to the new entry, and we insert P4 into idx 2. Inserting
100 * Again, memmove copies P1 and P2 to the new entry, and we insert P4
139 goto insert;
143 insert:

Completed in 233 milliseconds

12345