Home
last modified time | relevance | path

Searched refs:n3 (Results 1 – 12 of 12) sorted by relevance

/linux-6.12.1/net/dccp/ccids/lib/
Dpacket_history.c200 static int __two_after_loss(struct tfrc_rx_hist *h, struct sk_buff *skb, u32 n3) in __two_after_loss() argument
209 tfrc_rx_hist_entry_from_skb(tfrc_rx_hist_entry(h, 3), skb, n3); in __two_after_loss()
220 tfrc_rx_hist_entry_from_skb(tfrc_rx_hist_entry(h, 2), skb, n3); in __two_after_loss()
227 if (dccp_loss_free(s0, s3, n3)) { in __two_after_loss()
245 tfrc_rx_hist_entry_from_skb(tfrc_rx_hist_loss_prev(h), skb, n3); in __two_after_loss()
256 tfrc_rx_hist_entry_from_skb(tfrc_rx_hist_entry(h, 1), skb, n3); in __two_after_loss()
275 n3 = tfrc_rx_hist_entry(h, 3)->tfrchrx_ndp; in __three_after_loss() local
279 if (dccp_loss_free(s2, s3, n3)) { in __three_after_loss()
/linux-6.12.1/arch/m68k/include/asm/
Duaccess.h190 #define ____constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3, s1, s2, s3)\ argument
220 "30: addq.l #"#n3",%0\n" \
228 #define ___constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3, s1, s2, s3)\ argument
229 ____constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3, s1, s2, s3)
230 #define __constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3) \ argument
231 ___constant_copy_from_user_asm(res, to, from, tmp, n1, n2, n3, \
232 __suffix##n1, __suffix##n2, __suffix##n3)
/linux-6.12.1/arch/powerpc/platforms/ps3/
Drepository.c41 static void _dump_node_name(unsigned int lpar_id, u64 n1, u64 n2, u64 n3, in _dump_node_name() argument
47 _dump_field("n3: ", n3, func, line); in _dump_node_name()
53 static void _dump_node(unsigned int lpar_id, u64 n1, u64 n2, u64 n3, u64 n4, in _dump_node() argument
59 _dump_field("n3: ", n3, func, line); in _dump_node()
109 static int read_node(unsigned int lpar_id, u64 n1, u64 n2, u64 n3, u64 n4, in read_node() argument
122 result = lv1_read_repository_node(lpar_id, n1, n2, n3, n4, &v1, in read_node()
128 dump_node_name(lpar_id, n1, n2, n3, n4); in read_node()
132 dump_node(lpar_id, n1, n2, n3, n4, v1, v2); in read_node()
1049 static int create_node(u64 n1, u64 n2, u64 n3, u64 n4, u64 v1, u64 v2) in create_node() argument
1053 dump_node(0, n1, n2, n3, n4, v1, v2); in create_node()
[all …]
/linux-6.12.1/drivers/media/usb/gspca/
Dt613.c82 const u8 n3[6]; member
137 .n3 =
159 .n3 =
181 .n3 =
203 .n3 = {0x61, 0xc2, 0x65, 0x68, 0x60, 0x00},
632 reg_w_buf(gspca_dev, sensor->n3, sizeof sensor->n3); in sd_init()
/linux-6.12.1/fs/ntfs3/
Dbitmap.c364 struct rb_node *n, *n3; in wnd_remove_free_ext() local
392 n3 = rb_next(n); in wnd_remove_free_ext()
394 while (n3) { in wnd_remove_free_ext()
395 e3 = rb_entry(n3, struct e_node, start.node); in wnd_remove_free_ext()
411 n3 = rb_next(n3); in wnd_remove_free_ext()
419 n3 = rb_first(&wnd->count_tree); in wnd_remove_free_ext()
421 n3 ? rb_entry(n3, struct e_node, count.node)->count.key : in wnd_remove_free_ext()
431 n3 = rb_next(&e->count.node); in wnd_remove_free_ext()
433 if (!n3) { in wnd_remove_free_ext()
436 e3 = rb_entry(n3, struct e_node, count.node); in wnd_remove_free_ext()
/linux-6.12.1/fs/bcachefs/
Dbtree_update_interior.c1589 struct btree *n1, *n2 = NULL, *n3 = NULL; in btree_split() local
1648 n3 = __btree_root_alloc(as, trans, b->c.level + 1); in btree_split()
1650 bch2_btree_update_add_new_node(as, n3); in btree_split()
1651 six_unlock_write(&n3->c.lock); in btree_split()
1654 BUG_ON(btree_node_locked(trans->paths + path2, n3->c.level)); in btree_split()
1655 six_lock_increment(&n3->c.lock, SIX_LOCK_intent); in btree_split()
1656 mark_btree_node_locked(trans, trans->paths + path2, n3->c.level, BTREE_NODE_INTENT_LOCKED); in btree_split()
1657 bch2_btree_path_level_init(trans, trans->paths + path2, n3); in btree_split()
1659 n3->sib_u64s[0] = U16_MAX; in btree_split()
1660 n3->sib_u64s[1] = U16_MAX; in btree_split()
[all …]
/linux-6.12.1/drivers/md/bcache/
Dbtree.c2255 struct btree *n1, *n2 = NULL, *n3 = NULL; in btree_split() local
2287 n3 = bch_btree_node_alloc(b->c, op, b->level + 1, NULL); in btree_split()
2288 if (IS_ERR(n3)) in btree_split()
2334 if (n3) { in btree_split()
2336 mutex_lock(&n3->write_lock); in btree_split()
2337 bkey_copy_key(&n3->key, &MAX_KEY); in btree_split()
2338 bch_btree_insert_keys(n3, op, &parent_keys, NULL); in btree_split()
2339 bch_btree_node_write(n3, &cl); in btree_split()
2340 mutex_unlock(&n3->write_lock); in btree_split()
2343 bch_btree_set_root(n3); in btree_split()
[all …]
/linux-6.12.1/tools/testing/selftests/kvm/lib/x86_64/
Dprocessor.c365 for (uint16_t n3 = 0; n3 <= 0x1ffu; n3++) { in virt_arch_dump() local
366 pde = &pde_start[n3]; in virt_arch_dump()
393 | ((uint64_t) n3 << 9) in virt_arch_dump()
/linux-6.12.1/tools/perf/scripts/python/
Dexport-to-postgresql.py1012 n3 = len(build_id)
1013 fmt = "!hiqiqi" + str(n1) + "si" + str(n2) + "si" + str(n3) + "s"
1014 value = struct.pack(fmt, 5, 8, dso_id, 8, machine_id, n1, short_name, n2, long_name, n3, build_id)
/linux-6.12.1/arch/riscv/kvm/
Dvcpu_onereg.c833 int n2 = 0, n3 = 0; in copy_csr_reg_indices() local
869 n3 = sizeof(struct kvm_riscv_smstateen_csr) / sizeof(unsigned long); in copy_csr_reg_indices()
871 for (int i = 0; i < n3; i++) { in copy_csr_reg_indices()
885 return n1 + n2 + n3; in copy_csr_reg_indices()
/linux-6.12.1/Documentation/admin-guide/device-mapper/
Dstatistics.rst73 histogram:n1,n2,n3,n4,...
127 precise_timestamps histogram:n1,n2,n3,...
/linux-6.12.1/Documentation/input/devices/
Dalps.rst264 byte 0: 1 1 1 n3 1 n2 n1 x24