Searched refs:insert (Results 1 - 200 of 773) sorted by relevance

1234

/linux-4.1.27/drivers/md/bcache/
H A Dextents.c226 struct bkey *insert, bch_btree_ptr_insert_fixup()
232 if (!KEY_OFFSET(insert)) bch_btree_ptr_insert_fixup()
322 struct bkey *insert, bch_extent_insert_fixup()
331 BUG_ON(!KEY_OFFSET(insert)); bch_extent_insert_fixup()
332 BUG_ON(!KEY_SIZE(insert)); bch_extent_insert_fixup()
339 if (bkey_cmp(&START_KEY(k), insert) >= 0) { bch_extent_insert_fixup()
346 if (bkey_cmp(k, &START_KEY(insert)) <= 0) bch_extent_insert_fixup()
375 if (KEY_START(k) > KEY_START(insert) + sectors_found) bch_extent_insert_fixup()
390 sectors_found = KEY_OFFSET(k) - KEY_START(insert); bch_extent_insert_fixup()
393 if (bkey_cmp(insert, k) < 0 && bch_extent_insert_fixup()
394 bkey_cmp(&START_KEY(insert), &START_KEY(k)) > 0) { bch_extent_insert_fixup()
404 bch_subtract_dirty(k, c, KEY_START(insert), bch_extent_insert_fixup()
405 KEY_SIZE(insert)); bch_extent_insert_fixup()
409 * We insert a new key to cover the top of the bch_extent_insert_fixup()
421 insert); bch_extent_insert_fixup()
430 bch_cut_front(insert, top); bch_extent_insert_fixup()
431 bch_cut_back(&START_KEY(insert), k); bch_extent_insert_fixup()
436 if (bkey_cmp(insert, k) < 0) { bch_extent_insert_fixup()
437 bch_cut_front(insert, k); bch_extent_insert_fixup()
439 if (bkey_cmp(&START_KEY(insert), &START_KEY(k)) > 0) bch_extent_insert_fixup()
440 old_offset = KEY_START(insert); bch_extent_insert_fixup()
443 bkey_cmp(&START_KEY(insert), &START_KEY(k)) <= 0) { bch_extent_insert_fixup()
450 __bch_cut_back(&START_KEY(insert), k); bch_extent_insert_fixup()
462 } else if (sectors_found < KEY_SIZE(insert)) { bch_extent_insert_fixup()
463 SET_KEY_OFFSET(insert, KEY_OFFSET(insert) - bch_extent_insert_fixup()
464 (KEY_SIZE(insert) - sectors_found)); bch_extent_insert_fixup()
465 SET_KEY_SIZE(insert, sectors_found); bch_extent_insert_fixup()
469 if (KEY_DIRTY(insert)) bch_extent_insert_fixup()
470 bcache_dev_sectors_dirty_add(c, KEY_INODE(insert), bch_extent_insert_fixup()
471 KEY_START(insert), bch_extent_insert_fixup()
472 KEY_SIZE(insert)); bch_extent_insert_fixup()
225 bch_btree_ptr_insert_fixup(struct btree_keys *bk, struct bkey *insert, struct btree_iter *iter, struct bkey *replace_key) bch_btree_ptr_insert_fixup() argument
321 bch_extent_insert_fixup(struct btree_keys *b, struct bkey *insert, struct btree_iter *iter, struct bkey *replace_key) bch_extent_insert_fixup() argument
H A Djournal.h41 * entry that we're going to insert (held by struct btree_op), and then when we
42 * insert those keys into the btree the btree write we're setting up takes a
H A Dbtree.h91 * miss and we wish to insert this data into the cache, we have to insert a
97 * insert the check key it unlocks the btree node and then takes a write lock,
H A Dbset.c800 struct bkey *insert) bch_bset_insert()
806 __set_bytes(t->data, t->data->keys + bkey_u64s(insert)) > bch_bset_insert()
809 memmove((uint64_t *) where + bkey_u64s(insert), bch_bset_insert()
813 t->data->keys += bkey_u64s(insert); bch_bset_insert()
814 bkey_copy(where, insert); bch_bset_insert()
799 bch_bset_insert(struct btree_keys *b, struct bkey *where, struct bkey *insert) bch_bset_insert() argument
H A Drequest.c104 * The journalling code doesn't handle the case where the keys to insert bch_keylist_realloc()
106 * bio_insert() and bio_invalidate() will insert the keys created so far bch_keylist_realloc()
149 * insert that point to data that wasn't succesfully written. bch_data_insert_error()
151 * We don't have to insert those keys but we still have to invalidate bch_data_insert_error()
278 * From a cache miss, we can just insert the keys for the data bch_data_insert_start()
H A Dbset.h66 * So we need to construct some sort of lookup table. Since we only insert keys
138 * whenever we insert another key into it. For the unwritten set, we use a much
143 * These are much easier to keep up to date when we insert a key - we do it
/linux-4.1.27/block/
H A Dblk-exec.c37 * blk_execute_rq_nowait - insert a request into queue for execution
38 * @q: queue to insert the request in
40 * @rq: request to insert
41 * @at_head: insert request at head or tail of queue
99 * blk_execute_rq - insert a request into queue for execution
100 * @q: queue to insert the request in
102 * @rq: request to insert
103 * @at_head: insert request at head or tail of queue
H A Dblk-flush.c360 * blk_insert_flush - insert a new FLUSH/FUA request
361 * @rq: request to insert
/linux-4.1.27/include/linux/netfilter/
H A Dnf_conntrack_common.h14 unsigned int insert; member in struct:ip_conntrack_stat
H A Dx_tables.h119 /* Called when user tries to insert an entry of this type. */
156 /* Called when user tries to insert an entry of this type:
/linux-4.1.27/net/rds/
H A Dbind.c52 struct rds_sock *insert) rds_bind_lookup()
71 if (insert) {
78 insert->rs_bound_addr = addr;
79 insert->rs_bound_port = port;
80 rds_sock_addref(insert);
82 hlist_add_head_rcu(&insert->rs_bound_node, head);
51 rds_bind_lookup(__be32 addr, __be16 port, struct rds_sock *insert) rds_bind_lookup() argument
H A Dcong.c105 struct rds_cong_map *insert) rds_cong_tree_walk()
123 if (insert) { rds_cong_tree_walk()
124 rb_link_node(&insert->m_rb_node, parent, p); rds_cong_tree_walk()
125 rb_insert_color(&insert->m_rb_node, &rds_cong_tree); rds_cong_tree_walk()
104 rds_cong_tree_walk(__be32 addr, struct rds_cong_map *insert) rds_cong_tree_walk() argument
H A Drdma.c67 struct rds_mr *insert) rds_mr_tree_walk()
85 if (insert) { rds_mr_tree_walk()
86 rb_link_node(&insert->r_rb_node, parent, p); rds_mr_tree_walk()
87 rb_insert_color(&insert->r_rb_node, root); rds_mr_tree_walk()
88 atomic_inc(&insert->r_refcount); rds_mr_tree_walk()
66 rds_mr_tree_walk(struct rb_root *root, u64 key, struct rds_mr *insert) rds_mr_tree_walk() argument
/linux-4.1.27/drivers/mmc/host/
H A Dsdhci-bcm-kona.c88 * insert-removal. sdhci_bcm_kona_sd_reset()
113 * insert-removal. sdhci_bcm_kona_sd_init()
120 * Software emulation of the SD card insertion/removal. Set insert=1 for insert
121 * and insert=0 for removal. The card detection is done by GPIO. For Broadcom
125 static int sdhci_bcm_kona_sd_card_emulate(struct sdhci_host *host, int insert) sdhci_bcm_kona_sd_card_emulate() argument
135 * insert-removal. sdhci_bcm_kona_sd_card_emulate()
142 if (insert) { sdhci_bcm_kona_sd_card_emulate()
290 /* if device is eMMC, emulate card insert right here */ sdhci_bcm_kona_probe()
/linux-4.1.27/arch/x86/um/asm/
H A Dprocessor.h22 /* REP NOP (PAUSE) is a good thing to insert into busy-wait loops. */ rep_nop()
/linux-4.1.27/include/linux/unaligned/
H A Dmemmove.h7 /* Use memmove here, so gcc does not insert a __builtin_memcpy. */
/linux-4.1.27/arch/m32r/include/asm/opsput/
H A Dopsput_lan.h30 * ICUCR4: control register for CFC Card insert interrupt
33 * ICUCR11: control register for MMC Card insert/eject interrupt
H A Dopsput_pld.h62 * ICUCR4: control register for CFC Card insert interrupt
65 * ICUCR11: control register for MMC Card insert/eject interrupt
/linux-4.1.27/tools/testing/selftests/timers/
H A Dleap-a-day.c7 * This test signals the kernel to insert a leap second
155 int insert = 1; main() local
225 /* Set the leap second insert flag */ main()
227 if (insert) main()
267 if (insert) main()
306 insert = !insert; main()
H A Dleapcrash.c110 /* Set the leap second insert flag */ main()
H A Dvalid-adjtimex.c124 /* Set the leap second insert flag */ validate_freq()
/linux-4.1.27/arch/mn10300/lib/
H A D__ashldi3.S39 or_asl a1,d1,a0,d0 # insert overflow into MSW and
H A D__lshrdi3.S40 or_lsr a1,d0,a0,d1 # insert underflow into LSW and
H A D__ashrdi3.S39 or_asr a1,d0,a0,d1 # insert underflow into LSW and
/linux-4.1.27/sound/core/seq/oss/
H A Dseq_oss_rw.c147 /* insert queue */ snd_seq_oss_write()
160 * insert event record to write queue
171 return 0; /* no need to insert queue */ insert_queue()
180 return 0; /* invalid event - no need to insert queue */ insert_queue()
/linux-4.1.27/include/linux/
H A Ddmar.h144 extern int dmar_iommu_hotplug(struct dmar_drhd_unit *dmaru, bool insert);
159 static inline int dmar_iommu_hotplug(struct dmar_drhd_unit *dmaru, bool insert) dmar_iommu_hotplug() argument
166 extern int dmar_ir_hotplug(struct dmar_drhd_unit *dmaru, bool insert);
168 static inline int dmar_ir_hotplug(struct dmar_drhd_unit *dmaru, bool insert) dmar_ir_hotplug() argument
H A Dbtree-type.h43 static inline int BTREE_FN(insert)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, insert() function
86 static inline int BTREE_FN(insert)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, insert() function
H A Dkconfig.h14 * we match on the placeholder define, insert the "0," for arg1 and generate
H A Dmmiotrace.h51 /* For anyone to insert markers. Remember trailing newline. */
H A Dbinfmts.h83 extern void __register_binfmt(struct linux_binfmt *fmt, int insert);
H A Ddrbd.h119 /* KEEP the order, do not delete or insert. Only append. */
185 /* insert new ones above this line */
H A Dnfs_page.h158 * @head: head of list into which to insert the request.
H A Drbtree.h21 To use rbtrees you'll have to implement your own insert and search cores.
H A Dseqno-fence.h79 * Certain hardware have instructions to insert this type of wait condition
H A Dif_vlan.h288 * @vlan_tci: VLAN TCI to insert
322 * @vlan_tci: VLAN TCI to insert
349 * @vlan_tci: VLAN TCI to insert
405 * @vlan_tci: VLAN TCI to insert
H A Dplist.h55 * for the priority of the node and insert it before the node_list
58 * insert it into the serialized node_list list
H A Drhashtable.h654 * rhashtable_insert_fast - insert object into hash table
677 * rhashtable_lookup_insert_fast - lookup and insert object into hash table
684 * and can't insert to the new table during the atomic operation of search
710 * rhashtable_lookup_insert_key - search and insert object to hash table
719 * and can't insert to the new table during the atomic operation of search
H A Dpm_qos.h20 /* insert new class ID */
/linux-4.1.27/drivers/atm/
H A Dsuni.h149 #define SUNI_TSOP_CTRL_LAIS 0x01 /* insert alarm indication signal */
153 #define SUNI_TSOP_DIAG_DFP 0x01 /* insert single bit error cont. */
154 #define SUNI_TSOP_DIAG_DBIP8 0x02 /* insert section BIP err (cont) */
158 #define SUNI_TLOP_DIAG_DBIP 0x01 /* insert line BIP err (continuously) */
167 #define SUNI_TPOP_DIAG_PAIS 0x01 /* insert STS path alarm ind (cont) */
168 #define SUNI_TPOP_DIAG_DB3 0x02 /* insert path BIP err (continuously) */
198 #define SUNI_TACP_CS_DHCS 0x10 /* RW, insert HCS errors */
/linux-4.1.27/tools/perf/scripts/python/
H A Devent_analyzing_sample.py30 # If the perf.data has a big number of samples, then the insert operation
67 # Create and insert event object to a database so that user could
88 # Create the event object and insert it to the right table in database
94 con.execute("insert into gen_events values(?, ?, ?, ?)",
99 con.execute("insert into pebs_ll values (?, ?, ?, ?, ?, ?, ?, ?, ?, ?)",
H A Dnetdev-times.py20 all_event_list = []; # insert all tracepoint event related with this script
390 rx_skb_list.insert(0, rec_data)
401 tx_queue_list.insert(0, skb)
416 tx_xmit_list.insert(0, skb)
/linux-4.1.27/lib/
H A Drbtree_test.c24 static void insert(struct test_node *node, struct rb_root *root) insert() function
189 insert(nodes + j, &root); rbtree_test_init()
204 insert(nodes + j, &root); rbtree_test_init()
H A Dinterval_tree_test.c53 printk(KERN_ALERT "interval tree insert/remove"); interval_tree_test_init()
H A Dassoc_array.c514 * need to split this node and insert in one of the fragments. assoc_array_insert_into_terminal_node()
538 /* If there is a free slot in this node then we can just insert the assoc_array_insert_into_terminal_node()
542 pr_devel("insert in free slot %d\n", free_slot); assoc_array_insert_into_terminal_node()
545 pr_devel("<--%s() = ok [insert]\n", __func__); assoc_array_insert_into_terminal_node()
550 * it or insert another node before it. assoc_array_insert_into_terminal_node()
596 * to insert a shortcut if the new node wants to cluster with them. assoc_array_insert_into_terminal_node()
601 /* Otherwise we can just insert a new node ahead of the old assoc_array_insert_into_terminal_node()
744 pr_devel("<--%s() = ok [insert node before]\n", __func__); assoc_array_insert_into_terminal_node()
845 /* We need to split a shortcut and insert a node between the two assoc_array_insert_mid_shortcut()
979 * @array: The array to insert into.
981 * @index_key: The key to insert at.
982 * @object: The object to insert.
H A Dcmdline.c21 * range of numbers, M-N. This will expand the range and insert
/linux-4.1.27/include/uapi/linux/
H A Dfalloc.h45 * FALLOC_FL_INSERT_RANGE is use to insert space within the file size without
55 * Attempting to insert space using this flag at OR beyond the end of
H A Dsonet.h51 #define SONET_INS_HCS 128 /* insert HCS error */
H A Dblktrace_api.h49 __BLK_TA_INSERT, /* insert request */
H A Dtimex.h135 #define STA_INS 0x0010 /* insert leap (rw) */
158 #define TIME_INS 1 /* insert leap second */
/linux-4.1.27/arch/m32r/include/asm/m32700ut/
H A Dm32700ut_lan.h30 * ICUCR4: control register for CFC Card insert interrupt
33 * ICUCR11: control register for MMC Card insert/eject interrupt
H A Dm32700ut_pld.h66 * ICUCR4: control register for CFC Card insert interrupt
69 * ICUCR11: control register for MMC Card insert/eject interrupt
/linux-4.1.27/fs/ocfs2/
H A Dalloc.c98 * If this extent tree is supported by an extent map, insert
597 * Tree depth may change during truncate, or insert. If we're ocfs2_reinit_path()
678 * safely removed if we ever need to insert extent block ocfs2_path_insert_eb()
2024 * - When our insert into the right path leaf is at the leftmost edge
2354 * - In the case that the rotation requires a post-insert update,
2429 "Owner %llu: error during insert of %u " ocfs2_rotate_tree_right()
2449 * before the record insert is that an error ocfs2_rotate_tree_right()
2487 * instead of a real insert, then we have to ocfs2_rotate_tree_right()
3691 * Since the leftright insert always covers the entire ocfs2_try_to_merge_extent()
3692 * extent, this call will delete the insert record ocfs2_try_to_merge_extent()
3826 struct ocfs2_insert_type *insert) ocfs2_insert_at_leaf()
3828 int i = insert->ins_contig_index; ocfs2_insert_at_leaf()
3834 if (insert->ins_split != SPLIT_NONE) { ocfs2_insert_at_leaf()
3839 insert->ins_split, rec, ocfs2_insert_at_leaf()
3845 * Contiguous insert - either left or right. ocfs2_insert_at_leaf()
3847 if (insert->ins_contig != CONTIG_NONE) { ocfs2_insert_at_leaf()
3849 if (insert->ins_contig == CONTIG_LEFT) { ocfs2_insert_at_leaf()
3859 * Handle insert into an empty leaf. ocfs2_insert_at_leaf()
3870 * Appending insert. ocfs2_insert_at_leaf()
3872 if (insert->ins_appending == APPEND_TAIL) { ocfs2_insert_at_leaf()
3883 "insert.cpos %u, insert.clusters %u\n", ocfs2_insert_at_leaf()
3969 * If our appending insert is at the leftmost edge of a leaf, ocfs2_append_rec_to_path()
4062 * do the later insert there. ocfs2_split_record()
4066 * it back for a post-insert update. ocfs2_split_record()
4074 * can just do the insert there. ocfs2_split_record()
4081 * leaf. The insert will be into the ocfs2_split_record()
4098 * Left path is easy - we can just allow the insert to ocfs2_split_record()
4117 * right_path is the path we want to do the actual insert
4119 * portion of the tree after an edge insert.
4126 struct ocfs2_insert_type *insert) ocfs2_insert_path()
4161 if (insert->ins_split != SPLIT_NONE) { ocfs2_insert_path()
4168 insert_rec, insert->ins_split); ocfs2_insert_path()
4172 * have a guarantee that the later edge insert will ocfs2_insert_path()
4180 insert); ocfs2_insert_path()
4187 * up portions of the tree after the insert. ocfs2_insert_path()
4259 * left_path to account for an edge insert. ocfs2_do_insert_extent()
4261 * XXX: When modifying this code, keep in mind that an insert ocfs2_do_insert_extent()
4440 struct ocfs2_insert_type *insert, ocfs2_figure_contig_type()
4453 insert->ins_contig_index = i; ocfs2_figure_contig_type()
4457 insert->ins_contig = contig_type; ocfs2_figure_contig_type()
4459 if (insert->ins_contig != CONTIG_NONE) { ocfs2_figure_contig_type()
4461 &el->l_recs[insert->ins_contig_index]; ocfs2_figure_contig_type()
4471 insert->ins_contig = CONTIG_NONE; ocfs2_figure_contig_type()
4479 * insert at the tail of the rightmost leaf.
4485 static void ocfs2_figure_appending_type(struct ocfs2_insert_type *insert, ocfs2_figure_appending_type() argument
4493 insert->ins_appending = APPEND_NONE; ocfs2_figure_appending_type()
4516 insert->ins_appending = APPEND_TAIL; ocfs2_figure_appending_type()
4520 * Helper function called at the beginning of an insert.
4526 * - Whether the insert is an appending one.
4536 struct ocfs2_insert_type *insert) ocfs2_figure_insert_type()
4544 insert->ins_split = SPLIT_NONE; ocfs2_figure_insert_type()
4547 insert->ins_tree_depth = le16_to_cpu(el->l_tree_depth); ocfs2_figure_insert_type()
4568 * Unless we have a contiguous insert, we'll need to know if ocfs2_figure_insert_type()
4578 if (!insert->ins_tree_depth) { ocfs2_figure_insert_type()
4579 ocfs2_figure_contig_type(et, insert, el, insert_rec); ocfs2_figure_insert_type()
4580 ocfs2_figure_appending_type(insert, el, insert_rec); ocfs2_figure_insert_type()
4613 ocfs2_figure_contig_type(et, insert, el, insert_rec); ocfs2_figure_insert_type()
4616 * The insert code isn't quite ready to deal with all cases of ocfs2_figure_insert_type()
4617 * left contiguousness. Specifically, if it's an insert into ocfs2_figure_insert_type()
4624 if (insert->ins_contig == CONTIG_LEFT && ocfs2_figure_insert_type()
4625 insert->ins_contig_index == 0) ocfs2_figure_insert_type()
4626 insert->ins_contig = CONTIG_NONE; ocfs2_figure_insert_type()
4638 * tree path. This might be an appending insert. There are ocfs2_figure_insert_type()
4644 ocfs2_figure_appending_type(insert, el, insert_rec); ocfs2_figure_insert_type()
4673 struct ocfs2_insert_type insert = {0, }; ocfs2_insert_extent() local
4692 &free_records, &insert); ocfs2_insert_extent()
4698 trace_ocfs2_insert_extent(insert.ins_appending, insert.ins_contig, ocfs2_insert_extent()
4699 insert.ins_contig_index, free_records, ocfs2_insert_extent()
4700 insert.ins_tree_depth); ocfs2_insert_extent()
4702 if (insert.ins_contig == CONTIG_NONE && free_records == 0) { ocfs2_insert_extent()
4704 &insert.ins_tree_depth, &last_eb_bh, ocfs2_insert_extent()
4713 status = ocfs2_do_insert_extent(handle, et, &rec, &insert); ocfs2_insert_extent()
4878 struct ocfs2_insert_type insert; ocfs2_split_and_insert() local
4907 memset(&insert, 0, sizeof(struct ocfs2_insert_type)); ocfs2_split_and_insert()
4908 insert.ins_appending = APPEND_NONE; ocfs2_split_and_insert()
4909 insert.ins_contig = CONTIG_NONE; ocfs2_split_and_insert()
4910 insert.ins_tree_depth = depth; ocfs2_split_and_insert()
4918 insert.ins_split = SPLIT_LEFT; ocfs2_split_and_insert()
4920 insert.ins_split = SPLIT_RIGHT; ocfs2_split_and_insert()
4926 insert.ins_split = SPLIT_RIGHT; ocfs2_split_and_insert()
4937 ret = ocfs2_do_insert_extent(handle, et, &split_rec, &insert); ocfs2_split_and_insert()
5225 * XXX: This should be fixed up so that we just re-insert the ocfs2_mark_extent_written()
5251 struct ocfs2_insert_type insert; ocfs2_split_tree() local
5294 memset(&insert, 0, sizeof(struct ocfs2_insert_type)); ocfs2_split_tree()
5295 insert.ins_appending = APPEND_NONE; ocfs2_split_tree()
5296 insert.ins_contig = CONTIG_NONE; ocfs2_split_tree()
5297 insert.ins_split = SPLIT_RIGHT; ocfs2_split_tree()
5298 insert.ins_tree_depth = depth; ocfs2_split_tree()
5300 ret = ocfs2_do_insert_extent(handle, et, &split_rec, &insert); ocfs2_split_tree()
6903 * Save two copies, one for insert, and one that can ocfs2_convert_inline_data_to_extents()
3823 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) ocfs2_insert_at_leaf() argument
4121 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) ocfs2_insert_path() argument
4439 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) ocfs2_figure_contig_type() argument
4532 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) ocfs2_figure_insert_type() argument
/linux-4.1.27/arch/xtensa/include/uapi/asm/
H A Dswab.h53 * forces both compilers to insert exactly one extui instruction __arch_swab16()
/linux-4.1.27/drivers/tty/serial/8250/
H A D8250_fsl.c18 * a check for a break and insert a dummy read on the Rx for the
/linux-4.1.27/include/net/netfilter/
H A Dnf_nat.h22 /* insert nat helper private data here */
H A Dnf_conntrack.h31 /* insert conntrack proto private data here */
39 /* insert expect proto private data here */
/linux-4.1.27/arch/powerpc/kernel/
H A Dsystbl_chk.c37 /* Just insert a marker for ni_syscalls */
H A Dcrash_dump.c43 * need to branch to current address + 32 MB. So we insert a nop at create_trampoline()
H A Deeh_cache.c135 /* Walk tree, find a place to insert into tree */ eeh_addr_cache_insert()
162 pr_debug("PIAR: insert range=[%lx:%lx] dev=%s\n", eeh_addr_cache_insert()
H A Dhead_32.S509 rlwimi r2,r3,12,20,29 /* insert top 10 bits of address */
513 rlwimi r2,r3,22,20,29 /* insert next 10 bits of address */
583 rlwimi r2,r3,12,20,29 /* insert top 10 bits of address */
587 rlwimi r2,r3,22,20,29 /* insert next 10 bits of address */
667 rlwimi r2,r3,12,20,29 /* insert top 10 bits of address */
671 rlwimi r2,r3,22,20,29 /* insert next 10 bits of address */
/linux-4.1.27/samples/kprobes/
H A Djprobe_example.c8 * Build and insert the kernel module as done in the kprobe example.
H A Dkretprobe_example.c15 * Build and insert the kernel module as done in the kprobe example.
/linux-4.1.27/arch/parisc/kernel/
H A Dpacache.S555 * don't want to insert them into the kernel page table. Instead,
558 * for tlb insertion) needed to insert the translations. When we
562 * %r26 physical page (shifted for tlb insert) of "to" translation
563 * %r23 physical page (shifted for tlb insert) of "from" translation
605 convert_phys_for_tlb_insert20 %r26 /* convert phys addr to tlb insert format */
606 convert_phys_for_tlb_insert20 %r23 /* convert phys addr to tlb insert format */
612 extrw,u %r26, 24,25, %r26 /* convert phys addr to tlb insert format */
613 extrw,u %r23, 24,25, %r23 /* convert phys addr to tlb insert format */
759 convert_phys_for_tlb_insert20 %r26 /* convert phys addr to tlb insert format */
763 extrw,u %r26, 24,25, %r26 /* convert phys addr to tlb insert format */
843 convert_phys_for_tlb_insert20 %r26 /* convert phys addr to tlb insert format */
847 extrw,u %r26, 24,25, %r26 /* convert phys addr to tlb insert format */
919 convert_phys_for_tlb_insert20 %r26 /* convert phys addr to tlb insert format */
923 extrw,u %r26, 24,25, %r26 /* convert phys addr to tlb insert format */
/linux-4.1.27/fs/jfs/
H A Djfs_xtree.c558 * search for the entry location at which to insert: xtInsert()
561 * pinned, index at which to insert). xtInsert()
598 * insert entry for new extent xtInsert()
606 * The xtSplitUp() will insert the entry and unpin the leaf page. xtInsert()
631 * insert the new entry into the leaf page xtInsert()
640 /* if insert into middle, shift right remaining entries. */ xtInsert()
645 /* insert the new entry: mark the entry NEW */ xtInsert()
728 /* if insert into middle, shift right remaining entries. */ xtSplitUp()
735 /* insert the new entry: mark the entry NEW */ xtSplitUp()
789 * The split routines insert the new entry into the leaf page, xtSplitUp()
804 * insert a router entry for the new page into the parent page, xtSplitUp()
805 * propagate the insert/split up the tree by walking back the stack xtSplitUp()
809 * the propagation of insert/split up the tree stops if the root xtSplitUp()
831 * insert router entry in parent for new right child page <rp> xtSplitUp()
856 split->index = skip; /* index at insert */ xtSplitUp()
865 /* The split routines insert the new entry, xtSplitUp()
881 * parent page is not full - insert in parent page xtSplitUp()
885 * insert router entry in parent for the right child xtSplitUp()
896 * if insert into middle, shift right remaining entries xtSplitUp()
903 /* insert the router entry */ xtSplitUp()
955 * Pointer to page in which to insert or NULL on error.
1062 /* insert entry at the first entry of the new right page */ xtSplitPage()
1082 * non-sequential insert (at possibly middle page) xtSplitPage()
1121 * skip index in old split/left page - insert into left page: xtSplitPage()
1133 /* insert new entry */ xtSplitPage()
1149 * skip index in new right page - insert into right page: xtSplitPage()
1157 /* insert new entry */ xtSplitPage()
1222 * Pointer to page in which to insert or NULL on error.
1290 * insert the new entry into the new right/child page xtSplitRoot()
1294 /* if insert into middle, shift right remaining entries */ xtSplitRoot()
1418 * extent overflow: insert entry for new extent xtExtend()
1426 * if the leaf page is full, insert the new entry and xtExtend()
1429 * The xtSplitUp() will insert the entry and unpin the leaf page. xtExtend()
1472 * insert the new entry into the leaf page xtExtend()
1475 /* insert the new entry: mark the entry NEW */ xtExtend()
1587 * partially replace extent: insert entry for new extent xtTailgate()
1591 * if the leaf page is full, insert the new entry and xtTailgate()
1594 * The xtSplitUp() will insert the entry and unpin the leaf page. xtTailgate()
1637 * insert the new entry into the leaf page xtTailgate()
1640 /* insert the new entry: mark the entry NEW */ xtTailgate()
1927 /* insert nXAD:recorded */ xtUpdate()
1979 /* if insert into middle, shift right remaining entries */ xtUpdate()
1984 /* insert the entry */ xtUpdate()
2075 /* insert rXAD:not_recorded */ xtUpdate()
2123 /* if insert into middle, shift right remaining entries */ xtUpdate()
2128 /* insert the entry */ xtUpdate()
2197 * search for the entry location at which to insert: xtAppend()
2200 * pinned, index at which to insert). xtAppend()
2217 //insert: xtAppend()
2219 * insert entry for new extent xtAppend()
2227 * The xtSplitUp() will insert the entry and unpin the leaf page. xtAppend()
2282 * insert the new entry into the leaf page xtAppend()
2300 /* insert the new entry: mark the entry NEW */ xtAppend()
H A Djfs_extent.c155 * extend it. otherwise, insert a new extent to extAlloc()
163 /* if the extend or insert failed, extAlloc()
319 /* check if we need to also insert a new extent */ extRealloc()
321 /* perform the insert. if it fails, free the blocks extRealloc()
H A Djfs_logmgr.c275 /* insert page at tail of logsynclist */ lmLog()
302 /* insert tblock after the page on logsynclist */ lmLog()
1070 * insert filesystem in the active list of the log.
1719 * FUNCTION: insert (<activate> = true)/remove (<activate> = false)
1725 * activate - insert/remove device from active list.
1740 * insert/remove file system device to log active file system list. lmLogFileSystem()
2060 * insert bp at tail of write queue associated with log lbmWrite()
2069 /* insert at tail of wqueue */ lbmWrite()
2329 * insert buffer at head of freelist where it can be recycled lbmIODone()
H A Djfs_dtree.c814 * function: insert an entry to directory tree
839 * dtSearch() returns (leaf page pinned, index at which to insert). dtInsert()
846 * insert entry for new key dtInsert()
867 * dtSplitUp() will insert the entry and unpin the leaf page. dtInsert()
882 * insert the new data entry into the leaf page; dtInsert()
970 * The split routines insert the new entry, and dtSplitUp()
1109 * insert a router entry for the new page into the parent page, dtSplitUp()
1110 * propagate the insert/split up the tree by walking back the stack dtSplitUp()
1114 * the propagation of insert/split up the tree stops if the root dtSplitUp()
1135 * insert router entry in parent for new right child page <rp> dtSplitUp()
1235 split->index = skip; /* index at insert */ dtSplitUp()
1243 /* The split routines insert the new entry, dtSplitUp()
1258 * parent page is not full - insert router entry in parent page dtSplitUp()
1461 /* insert entry at the first entry of the new right page */ dtSplitPage()
1468 * non-sequential insert (at possibly middle page) dtSplitPage()
1599 /* insert the new entry in the split page */ dtSplitPage()
1619 /* insert the new entry in the right page */ dtSplitPage()
1819 * insert the new entry dtExtendPage()
2010 * insert the new entry into the new right/child page dtSplitRoot()
4025 /* if insert into middle, shift right succeeding entries in stbl */ dtInsertEntry()
H A Djfs_txnmgr.h149 #define tlckENTRY 0x0001 /* directory insert/delete */
/linux-4.1.27/arch/powerpc/mm/
H A Dhugepage-hash64.c113 * We failed to update, try to insert a new entry. __hash_page_thp()
130 /* insert new entry */ __hash_page_thp()
/linux-4.1.27/arch/m32r/include/asm/m32104ut/
H A Dm32104ut_pld.h64 * ICUCR4: control register for CFC Card insert interrupt
67 * ICUCR11: control register for MMC Card insert/eject interrupt
/linux-4.1.27/arch/m68k/mm/
H A Dinit.c153 /* insert pointer tables allocated so far into the tablelist */ init_pointer_tables()
160 /* insert also pointer table that we used to unmap the zero page */ init_pointer_tables()
/linux-4.1.27/net/ipv6/
H A Dudp_offload.c90 /* Check if there is enough headroom to insert fragment header. */ udp6_ufo_fragment()
98 * bytes to insert fragment header. udp6_ufo_fragment()
/linux-4.1.27/scripts/
H A Dconfig67 local insert="$2"
72 cmd="$(printf "a\\%b$insert" "\n")"
/linux-4.1.27/arch/microblaze/include/asm/
H A Dflat.h74 /* insert the address */ flat_put_addr_at_rp()
/linux-4.1.27/arch/mips/lib/
H A Dmips-atomic.c21 * For cli() we have to insert nops to make sure that the new value
/linux-4.1.27/fs/btrfs/tests/
H A Dqgroup-tests.c61 test_msg("Couldn't insert ref %d\n", ret); insert_normal_tree_ref()
133 test_msg("Failed to insert backref\n"); add_tree_ref()
443 test_msg("Couldn't insert fs root %d\n", ret); btrfs_test_qgroups()
457 test_msg("Couldn't insert fs root %d\n", ret); btrfs_test_qgroups()
/linux-4.1.27/include/drm/
H A Ddrm_mm.h231 * drm_mm_insert_node - search for space and insert @node
233 * @node: preallocate node to insert
266 * drm_mm_insert_node_in_range - ranged search for space and insert @node
268 * @node: preallocate node to insert
/linux-4.1.27/samples/bpf/
H A Dtest_maps.c34 /* insert key=1 element */ test_hashmap_sanity()
57 /* insert key=2 element */ test_hashmap_sanity()
105 /* insert key=1 element */ test_arraymap_sanity()
/linux-4.1.27/fs/reiserfs/
H A Dibalance.c347 /* insert pointers */ internal_copy_pointers_items()
356 /* insert headers */ internal_copy_pointers_items()
430 /* insert key before key with n_dest number */ internal_insert_key()
460 /* insert key */ internal_insert_key()
507 * insert delimiting key from common father of dest and internal_shift_left()
544 /* insert lkey[h]-th key from CFL[h] to left neighbor L[h] */ internal_shift1_left()
580 * insert delimiting key from common father of dest internal_shift_right()
619 /* insert rkey from CFR[h] to right neighbor R[h] */ internal_shift1_right()
870 /* insert insert_num keys and node-pointers into L[h] */ balance_internal()
939 /* insert insert_num keys and node-pointers into R[h] */ balance_internal()
1086 * insert insert_num keys and node-pointers balance_internal()
H A Ddo_balan.c87 "vs-12013: mode Delete, insert size %d, ih to be deleted %h", balance_leaf_when_delete_del()
305 /* Calculate item length to insert to S[0] */ balance_leaf_insert_left()
308 /* Calculate and check item length to insert to L[0] */ balance_leaf_insert_left()
312 "PAP-12080: there is nothing to insert into L[0]: " balance_leaf_insert_left()
324 * insert into S[0] balance_leaf_insert_left()
340 "PAP-12085: there is nothing to insert into S[0]: " balance_leaf_insert_left()
661 * Calculate key component and item length to insert balance_leaf_insert_right()
690 * insert into S[0] balance_leaf_insert_right()
965 * Calculate key component and item length to insert balance_leaf_new_nodes_insert()
995 * insert into S[i] balance_leaf_new_nodes_insert()
1280 /* If we insert the first key change the delimiting key */ balance_leaf_finish_node_insert()
1340 "PAP-12275: insert size must not be %d", balance_leaf_finish_node_paste()
1370 /* if we must insert or append into buffer S[0] */ balance_leaf_finish_node()
1384 * @flag: i - insert, d - delete, c - cut, p - paste (see do_balance)
1386 * @insert_key: key to insert new nodes
1387 * @insert_ptr: array of nodes to insert at the next level
1846 * @flag: 'i' - insert, 'd' - delete, 'c' - cut, 'p' paste
1856 * insert a directory entry.
H A Dtail_conversion.c54 * and key to search for append or insert pointer to the new direct2indirect()
195 * reads tail through page cache, insert direct item. When direct item
264 /* Set direct item header to insert. */ indirect2direct()
H A Dfix_node.c13 * to be changed/deleted or position in the node we insert a new item
413 * We only create additional nodes if we are in insert or paste mode get_num_ver()
416 * paste or insert before we get here in the code. get_num_ver()
1273 * neighbors even when we insert or paste item.
1319 * mode i - insert, p - paste;
1719 * mode i - insert, p - paste;
1923 * mode i - insert, p - paste;
2059 * mode i - insert, p - paste, d - delete, c - cut.
2083 "vs-8255: ins_ih can not be 0 in insert mode"); check_balance()
2538 * op_mode i - insert, d - delete, c - cut (truncate), p - paste (append)
2608 "of insert", item_num, fix_nodes()
2671 * We have a positive insert size but no nodes exist on this fix_nodes()
/linux-4.1.27/fs/btrfs/
H A Dfile-item.c634 * we need to split this item and insert a new one. btrfs_del_csums()
737 goto insert; btrfs_csum_file_blocks()
741 /* we didn't find a csum item, insert one */ btrfs_csum_file_blocks()
748 goto insert; btrfs_csum_file_blocks()
755 goto insert; btrfs_csum_file_blocks()
759 goto insert; btrfs_csum_file_blocks()
774 goto insert; btrfs_csum_file_blocks()
786 goto insert; btrfs_csum_file_blocks()
798 goto insert; btrfs_csum_file_blocks()
820 insert: btrfs_csum_file_blocks()
H A Ddir-item.c25 * insert a name into a directory, doing overflow properly if there is a hash
113 * insert a directory item in the tree, doing all the magic for
114 * both indexes. 'dir' indicates which objectid to insert it into,
257 * see if there is room in the item to insert this btrfs_check_dir_item_collision()
H A Ddelayed-ref.c135 * insert a new ref into the rbtree. This returns any existing refs
168 /* insert a new ref to head ref rbtree */ htree_insert()
564 * helper function to actually insert a head node into the rbtree.
652 * helper to insert a delayed tree ref into the rbtree.
714 * helper to insert a delayed data ref into the rbtree.
814 * insert both the head node and the new ref without dropping btrfs_add_delayed_tree_ref()
863 * insert both the head node and the new ref without dropping btrfs_add_delayed_data_ref()
H A Ddelayed-inode.h79 struct list_head tree_list; /* used for batch insert/delete items */
H A Ddelayed-inode.c716 * This helper will insert some continuous items into the same leaf according
746 * count the number of the continuous items that we can insert in batch btrfs_batch_insert_items()
799 /* insert the keys of the items */ btrfs_batch_insert_items()
803 /* insert the dir index items */ btrfs_batch_insert_items()
856 * we insert an item first, then if there are some continuous items, we try
857 * to insert those items into the same leaf.
882 /* insert the continuous items into the same leaf */ btrfs_insert_delayed_items()
1637 * insert/delete delayed items in this period. So we also needn't btrfs_get_delayed_items()
H A Ddev-replace.c233 * need to delete old one and insert a new one. btrfs_run_dev_replace()
253 /* need to insert a new item */ btrfs_run_dev_replace()
258 btrfs_warn(fs_info, "insert dev_replace item failed %d!", btrfs_run_dev_replace()
H A Dextent_map.c337 * @tree: tree to insert new map in
338 * @em: map to insert
H A Dxattr.c122 * For a replace we can't just do the insert blindly. do_setxattr()
124 * doesn't exist. If it exists, fall down below to the insert/replace do_setxattr()
/linux-4.1.27/fs/jffs2/
H A Dnodelist.c127 dbg_fragtree2("insert frag (0x%04x-0x%04x)\n", newfrag->ofs, newfrag->ofs + newfrag->size); jffs2_fragtree_insert()
206 dbg_fragtree2("insert the new node at the root of the tree\n"); no_overlapping_node()
294 reasons. So we can do a tree insert from jffs2_add_frag_to_fragtree()
295 'this' to insert newfrag, and a tree insert jffs2_add_frag_to_fragtree()
296 from newfrag to insert newfrag2. */ jffs2_add_frag_to_fragtree()
/linux-4.1.27/arch/frv/mb93090-mb00/
H A Dpci-vdk.c33 * insert specific PCI bus resources instead of using the platform-level bus
369 panic("Unable to insert PCI IOMEM resource\n"); pcibios_init()
371 panic("Unable to insert PCI IOPORT resource\n"); pcibios_init()
/linux-4.1.27/arch/m68k/math-emu/
H A Dmulti_arith.h86 /* we assume here, gcc only insert move and a clr instr */ fp_addmant()
118 /* we assume here, gcc only insert move and a clr instr */ fp_submant()
141 /* we assume here, gcc only insert move and a clr instr */ \
/linux-4.1.27/drivers/irqchip/
H A Dirq-gic-common.c36 * Read current configuration register, and insert the config gic_configure_irq()
/linux-4.1.27/drivers/net/fddi/skfp/
H A Dsmttimer.c98 /* insert in queue */ smt_timer_start()
H A Ddrvfbi.c342 * insert or deinsert optical bypass (called by ECM)
355 outp(ADDR(B0_DAS),DAS_BYP_INS) ; /* insert station */ sm_pm_bypass_req()
/linux-4.1.27/drivers/staging/unisys/common-spar/include/channels/
H A Dvbuschannel.h39 /* Must increment this whenever you insert or delete fields within this channel
H A Diochannel.h53 /* Must increment these whenever you insert or delete fields within this channel
87 #define IOCHAN_TO_IOPART 0 /* used by ioguestpart to 'insert' signals to
92 #define IOCHAN_TO_GUESTPART 1 /* used by iopart to 'insert' signals to
99 #define CTRLCHAN_TO_CTRLGUESTPART 0 /* used by ctrlguestpart to 'insert' signals
105 #define CTRLCHAN_TO_CTRLPART 1 /* used by ctrlpart to 'insert' signals to
114 #define CTRLCHAN_EVENT_TO_CTRLPART 2 /* used by ctrlguestpart to 'insert' Events
119 #define CTRLCHAN_ACK_TO_CTRLGUESTPART 3 /* used by ctrlpart to 'insert' Acks to
/linux-4.1.27/include/net/
H A Ddn_fib.h80 int (*insert)(struct dn_fib_table *t, struct rtmsg *r, member in struct:dn_fib_table
/linux-4.1.27/arch/cris/mm/
H A Dtlb.c55 /* insert it into the page_id_map */ alloc_context()
/linux-4.1.27/fs/ext4/
H A Dextents_status.c489 * Make sure ex and es are not overlap when we try to insert ext4_es_insert_extent_ext_check()
494 pr_warn("ES insert assertion failed for " ext4_es_insert_extent_ext_check()
513 pr_warn("ES insert assertion failed for inode: %lu " ext4_es_insert_extent_ext_check()
523 pr_warn("ES insert assertion failed for inode: %lu " ext4_es_insert_extent_ext_check()
536 pr_warn("ES insert assertion failed for inode: %lu " ext4_es_insert_extent_ext_check()
572 pr_warn("ES insert assertion failed for inode: %lu " ext4_es_insert_extent_ind_check()
580 pr_warn("ES insert assertion failed for " ext4_es_insert_extent_ind_check()
586 pr_warn("ES insert assertion failed for " ext4_es_insert_extent_ind_check()
602 pr_warn("ES insert assertion failed for inode: %lu " ext4_es_insert_extent_ind_check()
/linux-4.1.27/net/batman-adv/
H A Dfragmentation.c93 * Returns true if chain is empty and caller can just insert the new fragment
112 * batadv_frag_insert_packet - insert a fragment into a fragment chain
114 * @skb: skb to insert
188 /* Reached the end of the list, so insert after 'frag_entry_last'. */ batadv_frag_insert_packet()
/linux-4.1.27/security/selinux/ss/
H A Davtab.h71 int (*insert)(struct avtab *a, struct avtab_key *k,
/linux-4.1.27/drivers/net/ethernet/atheros/atlx/
H A Datlx.c224 /* enable VLAN tag insert/strip */ __atlx_vlan_mode()
227 /* disable VLAN tag insert/strip */ __atlx_vlan_mode()
/linux-4.1.27/drivers/gpu/drm/
H A Ddrm_mm.c166 * drm_mm_reserve_node - insert an pre-initialized node
167 * @mm: drm_mm allocator to insert @node into
168 * @node: drm_mm_node to insert
218 * drm_mm_insert_node_generic - search for space and insert @node
220 * @node: preallocate node to insert
316 * drm_mm_insert_node_in_range_generic - ranged search for space and insert @node
318 * @node: preallocate node to insert
511 * and insert with the guarantee that the allocation start will match.
H A Ddrm_hashtab.c137 * Just insert an item and return any "bits" bit key that hasn't been
/linux-4.1.27/drivers/md/persistent-data/
H A Ddm-btree.c89 DMERR("too many entries in btree node for insert"); __dm_written_to_disk()
107 * insert remove loops than (2n + 1).
658 static int insert(struct dm_btree_info *info, dm_block_t root,
753 return insert(info, root, keys, value, new_root, NULL); __dm_written_to_disk()
762 return insert(info, root, keys, value, new_root, inserted); __dm_written_to_disk()
H A Ddm-btree.h120 * A variant of insert that indicates whether it actually inserted or just
/linux-4.1.27/mm/
H A Dmemblock.c454 * memblock_insert_region - insert new memblock region
455 * @type: memblock type to insert into
502 bool insert = false; memblock_add_range() local
522 * The following is executed twice. Once with %false @insert and memblock_add_range()
540 * area, insert that portion. memblock_add_range()
544 if (insert) memblock_add_range()
553 /* insert the remaining portion */ memblock_add_range()
556 if (insert) memblock_add_range()
565 if (!insert) { memblock_add_range()
569 insert = true; memblock_add_range()
H A Dksm.c60 * insert the pages into a normal sorted tree and expect it to find anything.
79 * 2) KSM will only insert into the unstable tree, pages whose hash value
1245 * stable_tree_insert - insert stable tree node pointing to new ksm page
1309 * else insert rmap_item into the unstable tree.
1313 * tree, we insert rmap_item as a new object into the unstable tree.
1465 * don't want to insert it in the unstable tree, and we don't want cmp_and_merge_page()
1482 * The pages were successfully merged: insert new cmp_and_merge_page()
1494 * If we fail to insert the page into the stable tree, cmp_and_merge_page()
1801 * insert just behind the scanning cursor, to let the area settle __ksm_enter()
1805 * But when KSM_RUN_UNMERGE, it's important to insert ahead of its __ksm_enter()
1807 * missed: then we might as well insert at the end of the list. __ksm_enter()
/linux-4.1.27/arch/m68k/ifpsp060/src/
H A Dpfpsp.S1151 # _fpsp_done(). If there is an enabled FP exception, then we insert #
1366 bra.w fu_in_exc_ovfl # go insert overflow frame
1394 # here, we insert the correct fsave status value into the fsave frame for the
1456 or.w %d0,LOCAL_EX(%a0) # insert new exponent
1488 or.w %d0,LOCAL_EX(%a0) # insert new exponent
1657 # we don't mess with the existing fsave frame. just re-insert it and
1972 # here, we insert the correct fsave status value into the fsave frame for the
2320 mov.l %d1,FP_SRC_HI(%a6) # insert new hi(man)
2322 ori.w &0x3f80,FP_SRC_EX(%a6) # insert new "skewed" exponent
2335 mov.w %d0,FP_SRC_EX(%a6) # insert exponent with cleared sign
2346 mov.w %d0,FP_SRC_EX(%a6) # insert new exponent
2662 # an enabled exception occurred. we have to insert the exception type back into
3007 mov.w &0x402c,0xa(%sp) # insert offset,frame format
3430 ori.l &0x7fc00000,%d0 # insert new exponent,SNAN bit
3444 ori.l &0x7fc00000,%d0 # insert new exponent,SNAN bit
3457 ori.l &0x7ff80000,%d0 # insert new exponent,SNAN bit
5456 mov.w %d0,FP_SCR0_EX(%a6) # insert new dst exponent
5492 mov.w %d0,FP_SCR1_EX(%a6) # insert new dst exponent
5537 or.w &0x3fff,%d0 # insert new operand's exponent(=0)
5539 mov.w %d0,FP_SCR0_EX(%a6) # insert biased exponent
5596 ori.w &0x3fff,FP_SCR0_EX(%a6) # insert new operand's exponent(=0)
5604 ori.w &0x3ffe,FP_SCR0_EX(%a6) # insert new operand's exponent(=0)
5618 ori.w &0x3fff,FP_SCR0_EX(%a6) # insert new operand's exponent(=0)
5625 ori.w &0x3ffe,FP_SCR0_EX(%a6) # insert new operand's exponent(=0)
5664 or.w &0x3fff,%d0 # insert new operand's exponent(=0)
5666 mov.w %d0,FP_SCR1_EX(%a6) # insert biased exponent
6032 mov.w %d0, FTEMP_EX(%a0) # insert denorm threshold
6533 mov.w %d1, FTEMP_EX(%a0) # insert new exponent
6831 mov.w %d1, FTEMP_EX(%a0) # insert 16 bit exponent
6895 mov.w %d1,FTEMP_EX(%a0) # insert 16 bit exponent
6988 or.b %d0, %d1 # insert rnd mode
6990 or.b %d0, %d1 # insert rnd prec
7130 fmov.l %d0,%fpcr # insert rnd prec,mode
7176 fmov.l %d0,%fpcr # insert rnd prec:mode
7222 fmov.l %d0,%fpcr # insert rnd prec:mode
7323 or.w %d0,FP_SCR0_EX(%a6) # insert new exponent
7336 ori.b &s_mode*0x10,%d0 # insert sgl prec
7497 # (3) if exp still equals zero, then insert original exponent
7504 ori.w &0x3fff,%d1 # insert exp = 0
7505 mov.w %d1,FP_SCR0_EX(%a6) # insert scaled exp
7574 ori.b &d_mode*0x10,%d0 # insert dbl prec
7708 # (3) if exp still equals zero, then insert original exponent
7715 ori.w &0x3fff,%d1 # insert exp = 0
7716 mov.w %d1,FP_SCR0_EX(%a6) # insert scaled exp
8000 ori.b &s_mode*0x10,%d0 # insert sgl prec
8006 ori.b &d_mode*0x10,%d0 # insert dbl prec
8075 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
8147 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
8267 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
8311 ori.b &rz_mode*0x10,%d1 # insert RZ
8485 ori.b &s_mode*0x10,%d0 # insert sgl precision
8491 ori.b &d_mode*0x10,%d0 # insert dbl precision
8540 # exponent and insert back into the operand.
8554 mov.w %d0,FP_SCR0_EX(%a6) # insert new exponent
8603 mov.w %d2,FP_SCR0_EX(%a6) # insert new exponent
8665 mov.w %d2,FP_SCR1_EX(%a6) # insert new exponent
8719 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
8766 mov.b %d0,FPSR_CC(%a6) # insert correct ccodes
8818 ori.b &s_mode*0x10,%d0 # insert sgl prec
8824 ori.b &d_mode*0x10,%d0 # insert dbl prec
8889 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
8960 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
9035 mov.w %d1,FP_SCR0_EX(%a6) # insert new exp
9079 ori.b &rz_mode*0x10,%d1 # insert RZ
9259 ori.b &s_mode*0x10,%d0 # insert sgl precision
9265 ori.b &d_mode*0x10,%d0 # insert dbl prec
9323 # exponent and insert back into the operand.
9334 mov.w %d0,FP_SCR0_EX(%a6) # insert new exponent
9383 mov.w %d2,FP_SCR0_EX(%a6) # insert new exponent
9445 mov.w %d1,FP_SCR1_EX(%a6) # insert new exp
9499 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
9546 mov.b %d0,FPSR_CC(%a6) # insert correct ccodes
9873 # exceptional case. If no exception should occur, insert the correct #
9882 ori.b &s_mode*0x10,%d0 # insert sgl precision
9888 ori.b &d_mode*0x10,%d0 # insert dbl precision
9912 mov.w %d1,FP_SCR0_EX(%a6) # insert exponent
9930 mov.w %d0,FP_SCR0_EX(%a6) # insert exponent
9941 # exponent and insert back into the operand.
9952 mov.w %d0,FP_SCR0_EX(%a6) # insert new exponent
10001 mov.w %d2,FP_SCR0_EX(%a6) # insert new exponent
10060 mov.w %d1,FP_SCR1_EX(%a6) # insert new exp
10114 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
10446 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
10495 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
10572 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
10606 ori.b &rz_mode*0x10,%d1 # insert RZ
10793 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
10848 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
10905 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
11061 # occurred. If so, return default result and maybe EXOP. Else, insert #
11069 ori.b &s_mode*0x10,%d0 # insert sgl prec
11075 ori.b &d_mode*0x10,%d0 # insert dbl prec
11131 mov.w %d1,(%sp) # insert new exponent
11181 mov.w %d1,(%sp) # insert new exponent
11258 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
11303 ori.b &rz_mode*0x10,%d1 # insert rnd mode
11514 # occurred. If so, return default result and maybe EXOP. Else, insert #
11522 ori.b &s_mode*0x10,%d0 # insert sgl prec
11528 ori.b &d_mode*0x10,%d0 # insert dbl prec
11583 or.w %d2,%d1 # insert new exponent
11584 mov.w %d1,(%sp) # insert new exponent
11634 mov.w %d1,(%sp) # insert new exponent
11711 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
11756 ori.b &rz_mode*0x10,%d1 # insert rnd mode
11967 ori.b &s_mode*0x10,%d0 # insert sgl precision
11973 ori.b &d_mode*0x10,%d0 # insert dbl precision
12064 mov.w %d2,FP_SCR0_EX(%a6) # insert new exponent
12142 mov.w %d1,FP_SCR1_EX(%a6) # insert new exp
12196 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
13920 or.w %d3,(%sp) # insert new exponent
14356 bfins %d0,FP_SCR0(%a6){&0:&2} # insert SM and SE into FP_SCR0
H A Dfpsp.S1152 # _fpsp_done(). If there is an enabled FP exception, then we insert #
1367 bra.w fu_in_exc_ovfl # go insert overflow frame
1395 # here, we insert the correct fsave status value into the fsave frame for the
1457 or.w %d0,LOCAL_EX(%a0) # insert new exponent
1489 or.w %d0,LOCAL_EX(%a0) # insert new exponent
1658 # we don't mess with the existing fsave frame. just re-insert it and
1973 # here, we insert the correct fsave status value into the fsave frame for the
2321 mov.l %d1,FP_SRC_HI(%a6) # insert new hi(man)
2323 ori.w &0x3f80,FP_SRC_EX(%a6) # insert new "skewed" exponent
2336 mov.w %d0,FP_SRC_EX(%a6) # insert exponent with cleared sign
2347 mov.w %d0,FP_SRC_EX(%a6) # insert new exponent
2663 # an enabled exception occurred. we have to insert the exception type back into
3008 mov.w &0x402c,0xa(%sp) # insert offset,frame format
3431 ori.l &0x7fc00000,%d0 # insert new exponent,SNAN bit
3445 ori.l &0x7fc00000,%d0 # insert new exponent,SNAN bit
3458 ori.l &0x7ff80000,%d0 # insert new exponent,SNAN bit
4088 or.b STAG(%a6),%d1 # insert src optag bits
4198 # we'll insert this new exception into the FPU and then return.
4229 # insert an overflow frame
4235 # insert an underflow frame
4247 frestore FP_SRC(%a6) # insert exceptional status
4381 fmov.l %fpiar,0x8(%sp) # insert "current PC"
7652 mov.w %d0,FP_SCR0_EX(%a6) # insert new exponent
9639 clr.l -(%sp) # insert zero low mantissa
9640 mov.l %d1,-(%sp) # insert new high mantissa
9646 mov.l %d1,-(%sp) # insert new low mantissa
9647 clr.l -(%sp) # insert zero high mantissa
9660 clr.l -(%sp) # insert new exponent
9661 mov.l &0x80000000,-(%sp) # insert new high mantissa
9662 mov.l %d0,-(%sp) # insert new lo mantissa
10220 or.w %d0,FP_SCR0_EX(%a6) # insert new exponent
10321 mov.b %d0,FPSR_CC(%a6) # insert new ccodes
10334 mov.b %d0,FPSR_CC(%a6) # insert new ccodes
10427 mov.b (tbl_unf_cc.b,%pc,%d0.w*1),FPSR_CC(%a6) # insert ccode bits
11569 ori.b &s_mode*0x10,%d0 # insert sgl prec
11575 ori.b &d_mode*0x10,%d0 # insert dbl prec
11644 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
11716 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
11836 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
11880 ori.b &rz_mode*0x10,%d1 # insert RZ
12054 ori.b &s_mode*0x10,%d0 # insert sgl precision
12060 ori.b &d_mode*0x10,%d0 # insert dbl precision
12109 # exponent and insert back into the operand.
12123 mov.w %d0,FP_SCR0_EX(%a6) # insert new exponent
12172 mov.w %d2,FP_SCR0_EX(%a6) # insert new exponent
12234 mov.w %d2,FP_SCR1_EX(%a6) # insert new exponent
12288 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
12335 mov.b %d0,FPSR_CC(%a6) # insert correct ccodes
12387 ori.b &s_mode*0x10,%d0 # insert sgl prec
12393 ori.b &d_mode*0x10,%d0 # insert dbl prec
12458 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
12529 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
12604 mov.w %d1,FP_SCR0_EX(%a6) # insert new exp
12648 ori.b &rz_mode*0x10,%d1 # insert RZ
12828 ori.b &s_mode*0x10,%d0 # insert sgl precision
12834 ori.b &d_mode*0x10,%d0 # insert dbl prec
12892 # exponent and insert back into the operand.
12903 mov.w %d0,FP_SCR0_EX(%a6) # insert new exponent
12952 mov.w %d2,FP_SCR0_EX(%a6) # insert new exponent
13014 mov.w %d1,FP_SCR1_EX(%a6) # insert new exp
13068 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
13115 mov.b %d0,FPSR_CC(%a6) # insert correct ccodes
13442 # exceptional case. If no exception should occur, insert the correct #
13451 ori.b &s_mode*0x10,%d0 # insert sgl precision
13457 ori.b &d_mode*0x10,%d0 # insert dbl precision
13481 mov.w %d1,FP_SCR0_EX(%a6) # insert exponent
13499 mov.w %d0,FP_SCR0_EX(%a6) # insert exponent
13510 # exponent and insert back into the operand.
13521 mov.w %d0,FP_SCR0_EX(%a6) # insert new exponent
13570 mov.w %d2,FP_SCR0_EX(%a6) # insert new exponent
13629 mov.w %d1,FP_SCR1_EX(%a6) # insert new exp
13683 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
14015 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
14064 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
14141 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
14175 ori.b &rz_mode*0x10,%d1 # insert RZ
14362 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
14417 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
14474 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
14630 # occurred. If so, return default result and maybe EXOP. Else, insert #
14638 ori.b &s_mode*0x10,%d0 # insert sgl prec
14644 ori.b &d_mode*0x10,%d0 # insert dbl prec
14700 mov.w %d1,(%sp) # insert new exponent
14750 mov.w %d1,(%sp) # insert new exponent
14827 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
14872 ori.b &rz_mode*0x10,%d1 # insert rnd mode
15083 # occurred. If so, return default result and maybe EXOP. Else, insert #
15091 ori.b &s_mode*0x10,%d0 # insert sgl prec
15097 ori.b &d_mode*0x10,%d0 # insert dbl prec
15152 or.w %d2,%d1 # insert new exponent
15153 mov.w %d1,(%sp) # insert new exponent
15203 mov.w %d1,(%sp) # insert new exponent
15280 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
15325 ori.b &rz_mode*0x10,%d1 # insert rnd mode
15536 ori.b &s_mode*0x10,%d0 # insert sgl precision
15542 ori.b &d_mode*0x10,%d0 # insert dbl precision
15633 mov.w %d2,FP_SCR0_EX(%a6) # insert new exponent
15711 mov.w %d1,FP_SCR1_EX(%a6) # insert new exp
15765 mov.w %d1,FP_SCR0_EX(%a6) # insert new exponent
15910 mov.w %d0,FP_SCR0_EX(%a6) # insert new dst exponent
15946 mov.w %d0,FP_SCR1_EX(%a6) # insert new dst exponent
15991 or.w &0x3fff,%d0 # insert new operand's exponent(=0)
15993 mov.w %d0,FP_SCR0_EX(%a6) # insert biased exponent
16050 ori.w &0x3fff,FP_SCR0_EX(%a6) # insert new operand's exponent(=0)
16058 ori.w &0x3ffe,FP_SCR0_EX(%a6) # insert new operand's exponent(=0)
16072 ori.w &0x3fff,FP_SCR0_EX(%a6) # insert new operand's exponent(=0)
16079 ori.w &0x3ffe,FP_SCR0_EX(%a6) # insert new operand's exponent(=0)
16118 or.w &0x3fff,%d0 # insert new operand's exponent(=0)
16120 mov.w %d0,FP_SCR1_EX(%a6) # insert biased exponent
16287 fmov.l %d1,%fpsr # insert into FPSR
16915 fmov.l %d1,%fpsr # insert into FPSR
17485 fmov.l %d1,%fpsr # insert into FPSR
19994 lsl.l &0x8, %d0 # extract and insert hi(man)
20229 fmov.l %d0,%fpcr # insert rnd prec,mode
20275 fmov.l %d0,%fpcr # insert rnd prec:mode
20321 fmov.l %d0,%fpcr # insert rnd prec:mode
20422 or.w %d0,FP_SCR0_EX(%a6) # insert new exponent
20435 ori.b &s_mode*0x10,%d0 # insert sgl prec
20596 # (3) if exp still equals zero, then insert original exponent
20603 ori.w &0x3fff,%d1 # insert exp = 0
20604 mov.w %d1,FP_SCR0_EX(%a6) # insert scaled exp
20673 ori.b &d_mode*0x10,%d0 # insert dbl prec
20807 # (3) if exp still equals zero, then insert original exponent
20814 ori.w &0x3fff,%d1 # insert exp = 0
20815 mov.w %d1,FP_SCR0_EX(%a6) # insert scaled exp
21910 mov.w %d0, FTEMP_EX(%a0) # insert denorm threshold
22411 mov.w %d1, FTEMP_EX(%a0) # insert new exponent
22709 mov.w %d1, FTEMP_EX(%a0) # insert 16 bit exponent
22773 mov.w %d1,FTEMP_EX(%a0) # insert 16 bit exponent
22866 or.b %d0, %d1 # insert rnd mode
22868 or.b %d0, %d1 # insert rnd prec
23960 or.w %d3,(%sp) # insert new exponent
24396 bfins %d0,FP_SCR0(%a6){&0:&2} # insert SM and SE into FP_SCR0
/linux-4.1.27/drivers/pcmcia/
H A Ddb1xxx_ss.c460 /* insert: irq which triggers on card insertion/ejection */ db1x_pcmcia_socket_probe()
461 r = platform_get_resource_byname(pdev, IORESOURCE_IRQ, "insert"); db1x_pcmcia_socket_probe()
546 "(%p) %09llx %09llx card/insert/stschg/eject irqs @ %d " db1x_pcmcia_socket_probe()
H A Dcs.c419 dev_dbg(&skt->dev, "insert\n"); socket_insert()
443 dev_dbg(&skt->dev, "insert done\n"); socket_insert()
721 * userspace-issued insert, eject, suspend and resume commands must be
723 * are PCMCIA_UEVENT_EJECT (for eject), PCMCIA_UEVENT__INSERT (for insert),
H A Dm32r_cfc.c301 t->cs_irq1 = irq; // insert irq add_pcc_socket()
306 t->cs_irq1 = 0; // insert irq add_pcc_socket()
340 /* insert interrupt */ add_pcc_socket()
374 events |= SS_DETECT; /* insert or eject */ pcc_interrupt()
/linux-4.1.27/drivers/base/regmap/
H A Dregcache-rbtree.c129 /* insert the node into the rbtree */ regcache_rbtree_insert()
315 /* insert the register value in the correct place in the rbnode block */ regcache_rbtree_insert_to_block()
441 /* We did not manage to find a place to insert it in regcache_rbtree_write()
/linux-4.1.27/arch/powerpc/xmon/
H A Dppc.h163 /* Insertion function. This is used by the assembler. To insert an
179 unsigned long (*insert)
224 insert function with any op value. The disassembler should call
178 unsigned long (*insert) global() member in struct:powerpc_operand
/linux-4.1.27/arch/mn10300/unit-asb2305/
H A Dpci.c32 * insert specific PCI bus resources instead of using the platform-level bus
353 panic("Unable to insert PCI IOMEM resource\n"); pcibios_init()
355 panic("Unable to insert PCI IOPORT resource\n"); pcibios_init()
/linux-4.1.27/net/dccp/ccids/lib/
H A Dpacket_history.c205 * Reorder history to insert S2 between S0 and S1 __one_after_loss()
232 * Reorder history to insert S3 between S1 and S2 __two_after_loss()
267 * Reorder history to insert S3 between S0 and S1. __two_after_loss()
/linux-4.1.27/drivers/isdn/divert/
H A Disdn_divert.h24 #define IIOCINSRULE _IO('I', 6) /* insert/append one rule */
/linux-4.1.27/drivers/mtd/nand/
H A Dcmx270_nand.c185 /* insert callbacks */ cmx270_init()
H A Dr852.h53 #define R852_CARD_IRQ_INSERT 0x08 /* detect card insert */
/linux-4.1.27/drivers/net/ethernet/seeq/
H A Dether3.h164 unsigned char tx_head; /* buffer nr to insert next packet */
/linux-4.1.27/drivers/staging/lustre/include/linux/lnet/
H A Dtypes.h153 * entry is inserted. The value LNET_INS_BEFORE is used to insert the new
155 * LNET_INS_AFTER is used to insert the new entry after the current entry
159 /** insert ME before current position or head of the list */
161 /** insert ME after current position or tail of the list */
/linux-4.1.27/drivers/staging/lustre/lustre/include/
H A Dlu_ref.h52 * has to be called to insert into foo::foo_reference a record, describing
/linux-4.1.27/drivers/staging/lustre/lustre/obdclass/
H A Dlustre_handles.c61 * Generate a unique 64bit cookie (hash) for a handle and insert it into
/linux-4.1.27/arch/sh/kernel/
H A Dunwinder.c92 /* Keep track of the place, where to insert */ unwinder_enqueue()
/linux-4.1.27/arch/um/include/shared/
H A Dinit.h26 * You should insert __initdata between the variable name and equal
/linux-4.1.27/drivers/block/drbd/
H A Ddrbd_interval.c44 * drbd_insert_interval - insert a new interval into a tree
/linux-4.1.27/arch/mips/alchemy/devboards/
H A Dplatform.c130 sr[3].name = "insert"; db1x_register_pcmcia_socket()
/linux-4.1.27/drivers/acpi/
H A Dioapic.c152 acpi_handle_warn(handle, "failed to insert resource\n"); handle_ioapic_add()
/linux-4.1.27/kernel/bpf/
H A Darraymap.c105 /* all elements were pre-allocated, cannot insert a new one */ array_map_update_elem()
/linux-4.1.27/arch/sh/boards/mach-r2d/
H A Dsetup.c240 * insert a trapped io filter to convert 8-bit operations into 16-bit.
/linux-4.1.27/arch/powerpc/include/asm/
H A Dpte-hash64-64k.h25 * 4k pages as the same assembly will be used to insert 64K pages
/linux-4.1.27/arch/powerpc/kvm/
H A Dbook3s_hv_ras.c57 rb = (rb & ~0xFFFul) | i; /* insert entry number */ reload_slb()
/linux-4.1.27/arch/arm/mach-pxa/
H A Dcorgi_pm.c107 dev_dbg(sharpsl_pm.dev, "ac insert\n"); corgi_should_wakeup()
H A Dcorgi.c430 .desc = "HeadPhone insert",
490 * to give the card a chance to fully insert/eject.
H A Dpoodle.c238 * to give the card a chance to fully insert/eject. poodle_init_spi()
/linux-4.1.27/arch/arm/mm/
H A Dproc-v7-2level.S55 bfi r1, r2, #8, #24 @ insert into new context ID
/linux-4.1.27/arch/arm/include/asm/
H A Dspinlock.h19 * assembler to insert a extra (16-bit) IT instruction, depending on the
/linux-4.1.27/net/dsa/
H A Dtag_dsa.c28 * packets, or insert a DSA tag between the addresses and dsa_xmit()
H A Dtag_edsa.c29 * a DSA ethertype field is the packet is tagged, or insert edsa_xmit()
/linux-4.1.27/scripts/tracing/
H A Ddraw_functrace.py45 """ If a function calls another one, call this method to insert it
/linux-4.1.27/security/integrity/
H A Dintegrity.h118 /* rbtree tree calls to lookup, insert, delete
/linux-4.1.27/tools/perf/util/
H A Dcallchain.h33 struct rb_node rb_node_in; /* to insert nodes in an rbtree */
/linux-4.1.27/include/linux/mfd/arizona/
H A Dpdata.h112 /** set to true if jackdet contact opens on insert */
/linux-4.1.27/include/linux/mfd/
H A Dmax8925.h225 unsigned no_insert_detect:1; /* set if no ac insert detect */
/linux-4.1.27/scripts/dtc/libfdt/
H A Dlibfdt.h1029 * This function will insert data into the reserve map and will
1081 * This function may insert or delete data from the blob, and will
1107 * This function may insert or delete data from the blob, and will
1138 * This function may insert or delete data from the blob, and will
1173 * This function may insert or delete data from the blob, and will
1219 * This function may insert or delete data from the blob, and will
1249 * This function may insert data into the blob, and will therefore
1280 * This function may insert data into the blob, and will therefore
1315 * This function may insert data into the blob, and will therefore
1360 * This function may insert data into the blob, and will therefore
1428 * This function will insert data into the blob, and will therefore
/linux-4.1.27/drivers/char/agp/
H A Defficeon-agp.c261 unsigned long insert = efficeon_mask_memory(mem->pages[i]); efficeon_insert_memory() local
269 *page = insert; efficeon_insert_memory()
/linux-4.1.27/arch/mips/include/asm/
H A Dasmmacro.h266 insert.w $w\wd[\n], $1
274 insert.d $w\wd[\n], $1
/linux-4.1.27/net/ipv4/netfilter/
H A Dnf_conntrack_l3proto_ipv4_compat.c373 seq_printf(seq, "entries searched found new invalid ignore delete delete_list insert insert_failed drop early_drop icmp_error expect_new expect_create expect_delete search_restart\n"); ct_cpu_seq_show()
387 st->insert, ct_cpu_seq_show()
/linux-4.1.27/net/netfilter/
H A Dnf_conntrack_standalone.c314 seq_printf(seq, "entries searched found new invalid ignore delete delete_list insert insert_failed drop early_drop icmp_error expect_new expect_create expect_delete search_restart\n"); ct_cpu_seq_show()
328 st->insert, ct_cpu_seq_show()
/linux-4.1.27/fs/xfs/
H A Dxfs_trans.c789 * items to insert into the AIL. This uses bulk AIL insertion techniques to
800 * The AIL cursor is used to optimise the insert process. If commit_lsn is not
801 * at the end of the AIL, the insert cursor avoids the need to walk
853 * not affect the AIL cursor the bulk insert path is xfs_trans_committed_bulk()
865 /* Item is a candidate for bulk AIL insert. */ xfs_trans_committed_bulk()
874 /* make sure we insert the remainder! */ xfs_trans_committed_bulk()
/linux-4.1.27/drivers/net/ethernet/sfc/
H A Dtx.c321 * the TX queue. The queue's insert pointer will be incremented by
325 * the queue's insert pointer will be restored to its original value.
462 /* Work backwards until we hit the original insert pointer value */ efx_enqueue_skb()
1001 /* Work backwards until we hit the original insert pointer value */ efx_enqueue_unwind()
1163 /* Allocate and insert a DMA-mapped header buffer. */ tso_start_new_packet()
H A Defx.h76 * @efx: NIC in which to insert the filter
/linux-4.1.27/fs/xfs/libxfs/
H A Dxfs_dir2_sf.c364 * Do it the hard way - look for a place to insert the new entry. xfs_dir2_sf_addname()
468 * to insert the new entry. xfs_dir2_sf_addname_hard()
556 * to insert the new entry. xfs_dir2_sf_addname_pick()
573 * If it won't fit in a block form then we can't insert it, xfs_dir2_sf_addname_pick()
574 * we'll go back, convert to block, then try the insert and convert xfs_dir2_sf_addname_pick()
H A Dxfs_da_btree.h133 unsigned char inleaf; /* insert into 1->lf, 0->splf */
/linux-4.1.27/arch/alpha/kernel/
H A Dcore_marvel.c138 else if (io7_head->pe > io7->pe) { /* insert at head */ alloc_io7()
141 } else { /* insert at position */ alloc_io7()
150 insp->next->pe > io7->pe) { /* insert here */ alloc_io7()
157 if (NULL == insp) { /* couldn't insert ?!? */ alloc_io7()
158 printk(KERN_WARNING "Failed to insert IO7 at PE %d " alloc_io7()
/linux-4.1.27/drivers/pci/hotplug/
H A Dsgi_hotplug.c259 dev_dbg(&slot->pci_bus->self->dev, "insert failed with error %d sub-error %d\n", sn_slot_enable()
466 dev_dbg(&slot->pci_bus->self->dev, "insert operation successful\n"); enable_slot()
468 dev_dbg(&slot->pci_bus->self->dev, "insert operation failed rc = %d\n", rc); enable_slot()
/linux-4.1.27/fs/afs/
H A Dvnode.c57 * insert a vnode into the backing server's vnode tree
78 /* insert into the server's vnode tree in FID order */ afs_install_vnode()
110 * insert a vnode into the promising server's update/expiration tree
/linux-4.1.27/drivers/staging/lustre/lustre/fld/
H A Dfld_cache.c393 * Duplicate entries are eliminated in insert op. fld_cache_insert_nolock()
422 CDEBUG(D_INFO, "insert range "DRANGE"\n", PRANGE(&f_new->fce_range));
/linux-4.1.27/drivers/nfc/st21nfca/
H A Di2c.c46 * - insert ST21NFCA_ESCAPE_BYTE_STUFFING (escape byte)
231 * insert ST21NFCA_ESCAPE_BYTE_STUFFING (escape byte) st21nfca_hci_i2c_write()
/linux-4.1.27/drivers/acpi/acpica/
H A Dpsobject.c215 * Find the object. This will either insert the object into acpi_ps_build_named_op()
355 * Find the object. This will either insert the object into acpi_ps_create_op()
/linux-4.1.27/drivers/media/common/saa7146/
H A Dsaa7146_i2c.c56 /* insert the address of the i2c-slave. saa7146_i2c_msg_prepare()
67 /* insert the data bytes */ saa7146_i2c_msg_prepare()
/linux-4.1.27/drivers/power/
H A Dmax8925_power.c392 REQUEST_IRQ(MAX8925_IRQ_VCHG_DC_R, "ac-insert"); max8925_init_charger()
485 of_property_read_u32(np, "no-insert-detect", &no_insert_detect); max8925_power_dt_init()
/linux-4.1.27/arch/ia64/kernel/
H A Divt.S185 ITC_I_AND_D(p10, p11, r18, r24) // insert the instruction TLB entry and
186 // insert the data TLB entry
195 * Now compute and insert the TLB entry for the virtual page table. We never
362 or r19=r17,r19 // insert PTE control bits into r19
367 ITC_I(p0, r19, r18) // insert the TLB entry
419 or r19=r19,r17 // insert PTE control bits into r19
422 ITC_D(p7, r19, r18) // insert the TLB entry
796 dep r29=r8,r29,41,2 // I0 insert new ei into cr.ipsr
/linux-4.1.27/arch/arc/kernel/
H A Dkprobes.c144 /* Now we insert the trap at the next location after this instruction to setup_singlestep()
145 * single step. If it is a branch we insert the trap at possible branch setup_singlestep()
/linux-4.1.27/net/netfilter/ipset/
H A Dip_set_list_set.c296 goto insert; list_set_uadd()
323 insert: list_set_uadd()
/linux-4.1.27/drivers/md/
H A Ddm-cache-policy-cleaner.c139 /* Hash functions (lookup, insert, remove). */ lookup_cache_entry()
H A Dfaulty.c44 * we clone the bio and insert a new b_end_io into the chain.
/linux-4.1.27/drivers/net/ethernet/intel/igb/
H A De1000_82575.h241 #define E1000_VMVIR_VLANA_NEVER 0x80000000 /* Never insert VLAN tag */
/linux-4.1.27/drivers/net/ethernet/mellanox/mlx5/core/
H A Dmr.c98 mlx5_core_warn(dev, "failed radix tree insert of mr 0x%x, %d\n", mlx5_core_create_mkey()
/linux-4.1.27/drivers/media/i2c/soc_camera/
H A Dov2640.c235 #define REG2A 0x2A /* Dummy pixel insert MSB */
236 #define FRARL 0x2B /* Dummy pixel insert LSB */
237 #define ADDVFL 0x2D /* LSB of insert dummy lines in Vertical direction */
238 #define ADDVFH 0x2E /* MSB of insert dummy lines in Vertical direction */
H A Dov772x.c76 #define EXHCH 0x2A /* Dummy pixel insert MSB */
77 #define EXHCL 0x2B /* Dummy pixel insert LSB */
79 #define ADVFL 0x2D /* LSB of insert dummy lines in Vertical direction */
80 #define ADVFH 0x2E /* MSG of insert dummy lines in Vertical direction */
/linux-4.1.27/drivers/media/pci/tw68/
H A Dtw68-risc.c39 * @jump insert a jump at the start
/linux-4.1.27/drivers/memstick/host/
H A Dr592.h85 #define R592_REG_MSC_IRQ_INSERT (1 << 8) /* detect insert / card insered */
/linux-4.1.27/drivers/net/ethernet/xilinx/
H A Dll_temac.h324 u32 app1; /* TX start << 16 | insert */
/linux-4.1.27/drivers/net/wireless/iwlwifi/
H A Diwl-devtrace-iwlwifi.h95 * Do not insert between or below these items,
/linux-4.1.27/drivers/scsi/dpt/
H A Dosd_util.h252 * by the structure insert()/extract() *
/linux-4.1.27/drivers/scsi/sym53c8xx_2/
H A Dsym_glue.h100 * insert dummy PCI read transactions when some ordering involving
/linux-4.1.27/drivers/staging/rtl8712/
H A Drtl871x_sta_mgt.c204 /* insert into free_sta_queue; 20061114 */ r8712_free_stainfo()
/linux-4.1.27/drivers/staging/unisys/uislib/
H A Duisqueue.c37 * Tries to insert the prebuilt signal pointed to by pSignal into the nth
/linux-4.1.27/drivers/staging/lustre/lustre/osc/
H A Dosc_quota.c110 CDEBUG(D_QUOTA, "%s: setdq to insert for %s %d (%d)\n", osc_quota_setdq()
/linux-4.1.27/drivers/staging/ozwpan/
H A Dozeltbuf.c168 * then insert that now. Earlier we stored the unit count in oz_queue_elt_info()
/linux-4.1.27/drivers/infiniband/hw/ipath/
H A Dipath_verbs_mcast.c155 * ipath_mcast_add - insert mcast GID into table and attach QP struct
/linux-4.1.27/arch/x86/kernel/
H A Dtsc_sync.c74 * measurement is done [we also insert a 10 million check_tsc_warp()
/linux-4.1.27/arch/x86/kvm/
H A Dmmu.h158 * the result in X86_EFLAGS_AC. We then insert it in place of permission_fault()
/linux-4.1.27/arch/x86/xen/
H A Dxen-asm_32.S194 * (ie, it's still on stack), we need to insert its value into the
/linux-4.1.27/arch/tile/include/asm/
H A Dtile-desc_32.h480 tilepro_bundle_bits (*insert) (int op); member in struct:tilepro_operand
H A Dtile-desc_64.h418 tilegx_bundle_bits (*insert) (int op); member in struct:tilegx_operand
/linux-4.1.27/arch/unicore32/kernel/
H A Dprocess.c79 * we may need it to insert some 1:1 mappings so that machine_restart()
/linux-4.1.27/drivers/char/
H A Dnwbutton.c206 * below at module insert time. It attempts to register the device node
/linux-4.1.27/drivers/gpu/host1x/hw/
H A Ddebug_hw.c86 host1x_debug_output(o, "GATHER(offset=%03x, insert=%d, type=%d, count=%04x, addr=[", show_channel_command()
/linux-4.1.27/drivers/usb/misc/
H A Dusb_u132.h28 * OHCI controller as an interface is to insert the PC card directly
/linux-4.1.27/drivers/usb/serial/
H A Dconsole.c224 /* search for LF so we can insert CR if necessary */ usb_console_write()
/linux-4.1.27/drivers/media/dvb-frontends/
H A Ddrxk_hard.h260 bool m_insert_rs_byte; /* If TRUE, insert RS byte */
/linux-4.1.27/arch/s390/kernel/
H A Dvdso.c172 * vDSO and insert it into the mm struct tree
/linux-4.1.27/arch/sh/boards/mach-highlander/
H A Dsetup.c284 * insert a trapped io filter to convert 8-bit operations into 16-bit.
/linux-4.1.27/arch/mips/kernel/
H A Dcpu-bugs64.c79 * Leaving it out may cause gas insert a nop itself breaking mult_sh_align_mod()
/linux-4.1.27/arch/ia64/include/asm/sn/
H A Daddrs.h152 * to insert a chiplet id into this macro. However, it is our belief

Completed in 5703 milliseconds

1234