Searched refs:insert (Results 76 - 100 of 105) sorted by relevance

12345

/linux-master/include/linux/
H A Dfsnotify_backend.h619 void (*insert)(struct fsnotify_group *,
/linux-master/drivers/iommu/intel/
H A Dirq_remapping.c1478 int dmar_ir_hotplug(struct dmar_drhd_unit *dmaru, bool insert) argument
1493 if (insert) {
H A Ddmar.c2416 static int dmar_device_hotplug(acpi_handle handle, bool insert) argument
2441 if (insert)
H A Diommu.c3203 int dmar_iommu_hotplug(struct dmar_drhd_unit *dmaru, bool insert) argument
3213 if (insert) {
/linux-master/drivers/spi/
H A Dspi.c3581 * @insert: the number of transfers we want to insert instead
3594 size_t insert,
3605 struct_size(rxfer, inserted_transfers, insert)
3617 &rxfer->inserted_transfers[insert];
3661 for (i = 0; i < insert; i++) {
3663 xfer = &rxfer->inserted_transfers[insert - 1 - i];
3679 rxfer->inserted = insert;
3590 spi_replace_transfers( struct spi_message *msg, struct spi_transfer *xfer_first, size_t remove, size_t insert, spi_replaced_release_t release, size_t extradatasize, gfp_t gfp) argument
/linux-master/net/bridge/
H A Dbr_fdb.c483 goto insert;
487 insert:
488 /* insert new address, may fail if invalid address or dup. */
/linux-master/fs/
H A Dexec.c87 void __register_binfmt(struct linux_binfmt * fmt, int insert) argument
90 insert ? list_add(&fmt->lh, &formats) :
/linux-master/net/netfilter/
H A Dnft_set_pipapo.c116 * - insert references to the rules in the lookup table, selecting buckets
1098 * pipapo_expand() - Expand to composing netmasks, insert into lookup table
1104 * Expand range to composing netmasks and insert corresponding rule references
1251 * nft_pipapo_insert() - Validate and insert ranged elements
2379 .insert = nft_pipapo_insert,
2403 .insert = nft_pipapo_insert,
H A Dnf_conntrack_standalone.c434 seq_puts(seq, "entries clashres found new invalid ignore delete chainlength insert insert_failed drop early_drop icmp_error expect_new expect_create expect_delete search_restart\n");
450 st->insert,
H A Dnft_set_rbtree.c320 * key value to insert that is greater than the new element. This is the
761 .insert = nft_rbtree_insert,
H A Dnf_conntrack_core.c917 /* If genid has changed, we can't insert anymore because ct
934 NF_CT_STAT_INC(net, insert);
1023 * nf_ct_resolve_clash_harder - attempt to insert clashing conntrack entry
1211 * user context, else we insert an already 'dead' hash, blocking
/linux-master/arch/m68k/fpsp040/
H A Dgen_except.S361 bfins %d0,NMCEXC(%a1){#4:#4} |and insert them in nmcexc
/linux-master/tools/testing/selftests/netfilter/
H A Dnft_flowtable.sh442 ip netns exec $nsr1 nft -a insert rule inet filter forward ip dscp set cs3
/linux-master/mm/
H A Dinternal.h1319 struct vm_area_struct *insert; member in struct:vma_prepare
H A Dvmalloc.c1378 goto insert;
1432 insert:
2515 * This technique almost always avoids lock contention on insert/remove,
4637 /* we've found a fitting base, insert all va's */
4669 /* insert all vm's */
/linux-master/fs/btrfs/
H A Dextent-tree.c774 * if insert is true and there are too many inline back refs, the path
786 u64 owner, u64 offset, int insert)
810 if (insert) {
855 if (ret && !insert) {
861 "extent item not found for insert, bytenr %llu num_bytes %llu parent %llu root_objectid %llu owner %llu offset %llu",
958 if (ret == -ENOENT && insert) {
979 if (insert) {
1509 /* this will setup the path even if it fails to insert the back ref */
1517 * Ok we had -EAGAIN which means we didn't have space to insert and
1532 /* now insert th
781 lookup_inline_extent_backref(struct btrfs_trans_handle *trans, struct btrfs_path *path, struct btrfs_extent_inline_ref **ref_ret, u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid, u64 owner, u64 offset, int insert) argument
[all...]
H A Dinode.c616 * conditionally insert an inline extent into the file. This
4920 * for. So if we are truncating this file to a larger size we need to insert
5312 * This drops any pending insert or delete operations we have for this
6481 * if 'add_backref' is true, also insert a backref from the
6944 goto insert;
6951 goto insert;
6973 goto insert;
6980 insert:
H A Dtree-log.c410 goto insert;
490 insert:
492 /* try to insert the key into the destination tree */
777 * insert the extent pointer in the extent
1440 /* insert our name */
1741 * when replaying the log for a directory, we only insert names
2769 /* insert root item on the first sync */
3389 * to insert duplicate dir index keys in the log tree. This must be done
3990 * is to avoid lookups in the log tree every time we try to insert a dir index
4255 * so the inode item is not in the log and we need to insert i
[all...]
/linux-master/tools/perf/scripts/python/
H A Dexported-sql-viewer.py789 ids.insert(0, parent_id)
800 ids.insert(0, query.value(2))
801 ids.insert(0, query.value(1))
984 ids.insert(0, parent_id)
992 ids.insert(0, query.value(2))
993 ids.insert(0, query.value(1))
/linux-master/fs/unicode/
H A Dmkutf8data.c533 static int insert(struct tree *tree, char *key, int keylen, void *leaf) function
1702 insert(&trees[i], keyval, keylen, data);
/linux-master/tools/kvm/kvm_stat/
H A Dkvm_stat1227 sorted_items.insert(i + 1, (' ' + child, values))
1253 childs.insert(0, (key, values))
/linux-master/drivers/net/phy/
H A Dsfp.c108 [SFP_E_INSERT] = "insert",
2412 /* This state machine tracks the insert/remove state of the module, probes
2497 goto insert;
2522 insert:
/linux-master/include/net/netfilter/
H A Dnf_tables.h434 * @insert: insert new element into set
471 int (*insert)(const struct net *net, member in struct:nft_set_ops
/linux-master/arch/m68k/ifpsp060/src/
H A Dilsp.S375 mov.w %d6,%d4 # insert lower word (U3)
923 or.b %d3, %d4 # insert new ccodes
/linux-master/net/mptcp/
H A Dprotocol.c254 goto insert;
257 /* Find place to insert this segment. Handle overlaps on the way. */
296 insert:

Completed in 418 milliseconds

12345