Home
last modified time | relevance | path

Searched +full:k +full:- +full:to +full:- +full:j (Results 1 – 25 of 1062) sorted by relevance

12345678910>>...43

/linux-6.12.1/drivers/md/bcache/
Dbset.c1 // SPDX-License-Identifier: GPL-2.0
23 struct bkey *k, *next; in bch_dump_bset() local
25 for (k = i->start; k < bset_bkey_last(i); k = next) { in bch_dump_bset()
26 next = bkey_next(k); in bch_dump_bset()
29 (unsigned int) ((u64 *) k - i->d), i->keys); in bch_dump_bset()
31 if (b->ops->key_dump) in bch_dump_bset()
32 b->ops->key_dump(b, k); in bch_dump_bset()
34 pr_cont("%llu:%llu\n", KEY_INODE(k), KEY_OFFSET(k)); in bch_dump_bset()
37 bkey_cmp(k, b->ops->is_extents ? in bch_dump_bset()
48 for (i = 0; i <= b->nsets; i++) in bch_dump_bucket()
[all …]
Djournal.c1 // SPDX-License-Identifier: GPL-2.0
20 * entries (same as garbage collection would), then we replay them - reinserting
30 struct closure *cl = bio->bi_private; in journal_read_endio()
38 struct journal_device *ja = &ca->journal; in journal_read_bucket()
39 struct bio *bio = &ja->bio; in journal_read_bucket()
42 struct jset *j, *data = ca->set->journal.w[0].data; in journal_read_bucket() local
46 sector_t bucket = bucket_to_sector(ca->set, ca->sb.d[bucket_index]); in journal_read_bucket()
52 while (offset < ca->sb.bucket_size) { in journal_read_bucket()
53 reread: left = ca->sb.bucket_size - offset; in journal_read_bucket()
56 bio_reset(bio, ca->bdev, REQ_OP_READ); in journal_read_bucket()
[all …]
/linux-6.12.1/fs/bcachefs/
Deytzinger.c1 // SPDX-License-Identifier: GPL-2.0
6 * is_aligned - is this pointer & size okay for word-wide copying?
7 * @base: pointer to data
15 * For some reason, gcc doesn't know to optimize "if (a & mask || b & mask)"
16 * to "if ((a | b) & mask)", so we do that by hand.
27 return (lsbits & (align - 1)) == 0; in is_aligned()
31 * swap_words_32 - swap two elements in 32-bit chunks
32 * @a: pointer to the first element to swap
33 * @b: pointer to the second element to swap
37 * which basically all CPUs have, to minimize loop overhead computations.
[all …]
Dbset.c1 // SPDX-License-Identifier: GPL-2.0
26 unsigned n = ARRAY_SIZE(iter->data); in __btree_node_iter_used()
28 while (n && __btree_node_iter_set_end(iter, n - 1)) in __btree_node_iter_used()
29 --n; in __btree_node_iter_used()
34 struct bset_tree *bch2_bkey_to_bset(struct btree *b, struct bkey_packed *k) in bch2_bkey_to_bset() argument
36 return bch2_bkey_to_bset_inlined(b, k); in bch2_bkey_to_bset()
40 * There are never duplicate live keys in the btree - but including keys that
48 * The main reason for this is insertion: to handle overwrites, we first iterate
49 * 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
[all …]
Ddisk_accounting.c1 // SPDX-License-Identifier: GPL-2.0
19 * We have two parallel sets of counters to be concerned with, and both must be
22 * - Persistent/on disk accounting, stored in the accounting btree and updated
23 * via btree write buffer updates that treat new accounting keys as deltas to
24 * apply to existing values. But reading from a write buffer btree is
27 * - In memory accounting, where accounting is stored as an array of percpu
31 * Cheap to read, but non persistent.
35 * the output of these triggers are deltas to the various counters.
38 * counters in the disk accounting key are deltas that will be applied to the
42 * To do a disk accounting update:
[all …]
Djournal_io.c1 // SPDX-License-Identifier: GPL-2.0
17 #include "sb-clean.h"
22 lockdep_assert_held(&c->sb_lock); in bch2_journal_pos_from_member_info_set()
25 struct bch_member *m = bch2_members_v2_get_mut(c->disk_sb.sb, ca->dev_idx); in bch2_journal_pos_from_member_info_set()
27 m->last_journal_bucket = cpu_to_le32(ca->journal.cur_idx); in bch2_journal_pos_from_member_info_set()
28 m->last_journal_bucket_offset = cpu_to_le32(ca->mi.bucket_size - ca->journal.sectors_free); in bch2_journal_pos_from_member_info_set()
34 mutex_lock(&c->sb_lock); in bch2_journal_pos_from_member_info_resume()
36 struct bch_member m = bch2_sb_member_get(c->disk_sb.sb, ca->dev_idx); in bch2_journal_pos_from_member_info_resume()
39 if (idx < ca->journal.nr) in bch2_journal_pos_from_member_info_resume()
40 ca->journal.cur_idx = idx; in bch2_journal_pos_from_member_info_resume()
[all …]
/linux-6.12.1/drivers/video/logo/
Dpnmtologo.c1 // SPDX-License-Identifier: GPL-2.0-only
3 * Convert a logo in ASCII PNM format to C source suitable for inclusion in
6 * (C) Copyright 2001-2003 by Geert Uytterhoeven <geert@linux-m68k.org>
100 val = 10*val+c-'0'; in get_number()
124 unsigned int i, j; in read_image() local
150 "Use pnmnoraw(1) to convert it to ASCII PNM\n", filename); in read_image()
174 for (j = 0; j < logo_width; j++) in read_image()
175 logo_data[i][j].red = logo_data[i][j].green = in read_image()
176 logo_data[i][j].blue = 255*(1-get_number(fp)); in read_image()
183 for (j = 0; j < logo_width; j++) in read_image()
[all …]
/linux-6.12.1/drivers/gpu/drm/amd/display/dc/dml/dcn31/
Ddisplay_mode_vba_31.c4 * Permission is hereby granted, free of charge, to any person obtaining a
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
34 * This file is gcc-parsable HW gospel, coming straight from HW engineers.
36 * It doesn't adhere to Linux kernel style and sometimes will do things in odd
38 * remain as-is as it provides us with a guarantee from HW that it is correct.
48 // For DML-C changes that hasn't been propagated to VBA yet
[all …]
/linux-6.12.1/drivers/gpu/drm/amd/display/dc/dml/dcn30/
Ddisplay_mode_vba_30.c4 * Permission is hereby granted, free of charge, to any person obtaining a
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
34 * This file is gcc-parsable HW gospel, coming straight from HW engineers.
36 * It doesn't adhere to Linux kernel style and sometimes will do things in odd
38 * remain as-is as it provides us with a guarantee from HW that it is correct.
679 …//valid sliceWidth = number of pixels per slice line, must be less than or equal to 5184/numSlice… in dscceComputeDelay()
[all …]
/linux-6.12.1/drivers/gpu/drm/amd/display/dc/dml/dcn314/
Ddisplay_mode_vba_314.c1 // SPDX-License-Identifier: MIT
5 * Permission is hereby granted, free of charge, to any person obtaining a
7 * to deal in the Software without restriction, including without limitation
8 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
9 * and/or sell copies of the Software, and to permit persons to whom the
10 * Software is furnished to do so, subject to the following conditions:
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
34 * This file is gcc-parsable HW gospel, coming straight from HW engineers.
36 * It doesn't adhere to Linux kernel style and sometimes will do things in odd
38 * remain as-is as it provides us with a guarantee from HW that it is correct.
[all …]
/linux-6.12.1/lib/
Dtest_hash.c1 // SPDX-License-Identifier: GPL-2.0-only
5 * produce the same thing and, for cases where a k-bit hash
8 * We fill a buffer with a 255-byte null-terminated string,
9 * and use both full_name_hash() and hashlen_string() to hash the
10 * substrings from i to j, where 0 <= i < j < 256.
12 * The returned values are used to check that __hash_32() and
24 /* 32-bit XORSHIFT generator. Seed must not be zero. */
34 /* Given a non-zero x, returns a non-zero byte. */
45 /* Fill the buffer with non-zero bytes. */
58 /* Pointer to integer to be hashed. */
[all …]
Dstring_kunit.c1 // SPDX-License-Identifier: GPL-2.0-only
22 unsigned i, j, k; in string_test_memset16() local
29 for (j = 0; j < 256; j++) { in string_test_memset16()
31 memset16(p + i, 0xb1b2, j); in string_test_memset16()
32 for (k = 0; k < 512; k++) { in string_test_memset16()
33 v = p[k]; in string_test_memset16()
34 if (k < i) { in string_test_memset16()
36 "i:%d j:%d k:%d", i, j, k); in string_test_memset16()
37 } else if (k < i + j) { in string_test_memset16()
39 "i:%d j:%d k:%d", i, j, k); in string_test_memset16()
[all …]
Dbch.c14 * this program; if not, write to the Free Software Foundation, Inc., 51
15 * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
24 * Bose-Chaudhuri-Hocquenghem (BCH) codes.
26 * Call bch_init to get a pointer to a newly allocated bch_control structure for
30 * Call bch_encode to compute and store ecc parity bytes to a given buffer.
31 * Call bch_decode to detect and locate errors in received data.
34 * to bch_decode in order to skip certain steps. See bch_decode() documentation
37 * Option CONFIG_BCH_CONST_PARAMS can be used to force fixed values of
39 * better (up to 2x) encoding performance. Using this option makes sense when
50 * b. Error locator polynomial computation using Berlekamp-Massey algorithm
[all …]
Dinflate.c1 // SPDX-License-Identifier: GPL-2.0
4 /* inflate.c -- Not copyrighted 1992 by Mark Adler
9 * based on gzip-1.0.3
12 * Little mods for all variable to reside either into rodata or bss segments
14 * at run-time only. This allows for the kernel uncompressor to run
20 method searches for as much of the current string of bytes (up to a
21 length of 258) in the previous 32 K bytes. If it doesn't find any
28 of "extra" (sometimes zero) bits to get to add to the base value. At
29 the end of each deflated block is a special end-of-block (EOB) literal/
32 length then get the distance and emit the referred-to bytes from the
[all …]
/linux-6.12.1/drivers/scsi/
Datp870u.c1 // SPDX-License-Identifier: GPL-2.0-only
32 #include <linux/dma-mapping.h>
50 outb(val, atp->baseport + reg); in atp_writeb_base()
55 outw(val, atp->baseport + reg); in atp_writew_base()
60 outb(val, atp->ioport[channel] + reg); in atp_writeb_io()
65 outw(val, atp->ioport[channel] + reg); in atp_writew_io()
70 outb(val, atp->pciport[channel] + reg); in atp_writeb_pci()
75 outl(val, atp->pciport[channel] + reg); in atp_writel_pci()
80 return inb(atp->baseport + reg); in atp_readb_base()
85 return inw(atp->baseport + reg); in atp_readw_base()
[all …]
/linux-6.12.1/drivers/gpu/drm/amd/display/dc/dml/dcn32/
Ddisplay_mode_vba_32.c4 * Permission is hereby granted, free of charge, to any person obtaining a
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
41 dml32_CalculateMaxDETAndMinCompressedBufferSize(mode_lib->vba.ConfigReturnBufferSizeInKByte, in dml32_recalculate()
42 mode_lib->vba.ROBBufferSizeInKByte, in dml32_recalculate()
44 false, //mode_lib->vba.override_setting.nomDETInKByteOverrideEnable, in dml32_recalculate()
45 0, //mode_lib->vba.override_setting.nomDETInKByteOverrideValue, in dml32_recalculate()
[all …]
/linux-6.12.1/lib/raid6/
Dmktables.c1 // SPDX-License-Identifier: GPL-2.0-or-later
2 /* -*- linux-c -*- ------------------------------------------------------- *
4 * Copyright 2002-2007 H. Peter Anvin - All Rights Reserved
6 * ----------------------------------------------------------------------- */
11 * Make RAID-6 tables. This is a host user space program to be run at
55 int i, j, k; in main() local
70 for (j = 0; j < 256; j += 8) { in main()
72 for (k = 0; k < 8; k++) in main()
73 printf("0x%02x,%c", gfmul(i, j + k), in main()
74 (k == 7) ? '\n' : ' '); in main()
[all …]
/linux-6.12.1/drivers/platform/x86/
Duv_sysfs.c1 // SPDX-License-Identifier: GPL-2.0-or-later
20 #define INVALID_CNODE -1
33 static signed short uv_master_nasid = -1;
59 return -1; in ordinal_to_nasid()
77 return -1; in location_to_bpos()
90 if (!obj->f.fields.this_part && !obj->f.fields.is_shared) in cache_obj_to_cnode()
93 if (location_to_bpos(obj->location, &obj_rack, &obj_slot, &obj_blade)) in cache_obj_to_cnode()
94 return -1; in cache_obj_to_cnode()
102 prev_obj_to_cnode[obj->id] = cnode; in cache_obj_to_cnode()
123 return sysfs_emit(buf, "%s\n", hub_info->name); in hub_name_show()
[all …]
/linux-6.12.1/drivers/media/platform/verisilicon/
Dhantro_vp8.c1 // SPDX-License-Identifier: GPL-2.0
35 * filter taps taken to 7-bit precision,
36 * reference RFC6386#Page-16, filters[8][6]
40 { 0, -6, 123, 12, -1, 0 },
41 { 2, -11, 108, 36, -8, 1 },
42 { 0, -9, 93, 50, -6, 0 },
43 { 3, -16, 77, 77, -16, 3 },
44 { 0, -6, 50, 93, -9, 0 },
45 { 1, -8, 36, 108, -11, 2 },
46 { 0, -1, 12, 123, -6, 0 }
[all …]
/linux-6.12.1/drivers/net/ethernet/intel/idpf/
Didpf_virtchnl.c1 // SPDX-License-Identifier: GPL-2.0-only
16 * enum idpf_vc_xn_state - Virtchnl transaction status
17 * @IDPF_VC_XN_IDLE: not expecting a reply, ready to be used
25 * return context; a callback may be provided to handle
43 * struct idpf_vc_xn - Data structure representing virtchnl transactions
44 * @completed: virtchnl event loop uses that to signal when a reply is
49 * truncated on its way to the receiver thread according to
51 * @reply: Reference to the buffer(s) where the reply data should be written
52 * to. May be 0-length (then NULL address permitted) if the reply data
54 * @async_handler: if sent asynchronously, a callback can be provided to handle
[all …]
/linux-6.12.1/drivers/gpu/drm/amd/display/dc/dml/calcs/
Ddcn_calc_auto.c4 * Permission is hereby granted, free of charge, to any person obtaining a
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
32 * This file is gcc-parseable HW gospel, coming straight from HW engineers.
34 * It doesn't adhere to Linux kernel style and sometimes will do things in odd
36 * remain as-is as it provides us with a guarantee from HW that it is correct.
42 int k; in scaler_settings_calculation() local
[all …]
/linux-6.12.1/tools/perf/tests/
Devent_groups.c1 // SPDX-License-Identifier: GPL-2.0
11 #include "../perf-sys.h"
13 /* hw: cycles, sw: context-switch, uncore: [arch dependent] */
14 static int types[] = {0, 1, -1};
41 * initialized with disabled set to 1 and any child events are in event_open()
42 * initialized with disabled set to 0. Despite disabled being 0, in event_open()
46 attr.disabled = group_fd == -1 ? 1 : 0; in event_open()
48 return sys_perf_event_open(&attr, -1, 0, group_fd, 0); in event_open()
58 if (!strcmp(uncore_pmus[i].name, pmu->name)) { in setup_uncore_event()
59 pr_debug("Using %s for uncore pmu event\n", pmu->name); in setup_uncore_event()
[all …]
/linux-6.12.1/lib/crypto/
Dgf128mul.c1 /* gf128mul.c - GF(2^128) multiplication functions
17 ---------------------------------------------------------------------------
32 3. the copyright holder's name is not used to endorse products
42 in respect of its properties, including, but not limited to, correctness
44 ---------------------------------------------------------------------------
94 * 16-bit value that must be XOR-ed into the low-degree end of the
95 * product to reduce it modulo the polynomial x^128 + x^7 + x^2 + x + 1.
98 * the "be" convention where the highest-order bit is the coefficient of
99 * the highest-degree polynomial term, and one for the "le" convention
100 * where the highest-order bit is the coefficient of the lowest-degree
[all …]
/linux-6.12.1/tools/testing/radix-tree/
Dmultiorder.c1 // SPDX-License-Identifier: GPL-2.0-only
3 * multiorder.c: Multi-order radix tree entry testing
8 #include <linux/radix-tree.h>
38 int i, j, err; in multiorder_iteration() local
51 for (j = 0; j < 256; j++) { in multiorder_iteration()
53 if (j <= (index[i] | ((1 << order[i]) - 1))) in multiorder_iteration()
56 xas_set(&xas, j); in multiorder_iteration()
60 unsigned long mask = (1UL << order[i]) - 1; in multiorder_iteration()
63 assert(xas.xa_node->shift == shift); in multiorder_iteration()
65 assert((item->index | mask) == (index[i] | mask)); in multiorder_iteration()
[all …]
/linux-6.12.1/drivers/net/ethernet/freescale/fman/
Dfman_sp.c1 // SPDX-License-Identifier: BSD-3-Clause OR GPL-2.0-or-later
3 * Copyright 2008 - 2015 Freescale Semiconductor Inc.
15 int i = 0, j = 0, k = 0; in fman_sp_set_buf_pools_in_asc_order_of_buf_sizes() local
18 * to an ordered local array in fman_sp_set_buf_pools_in_asc_order_of_buf_sizes()
20 for (i = 0; i < fm_ext_pools->num_of_pools_used; i++) { in fman_sp_set_buf_pools_in_asc_order_of_buf_sizes()
22 buf_size = fm_ext_pools->ext_buf_pool[i].size; in fman_sp_set_buf_pools_in_asc_order_of_buf_sizes()
24 /* keep sizes in an array according to poolId in fman_sp_set_buf_pools_in_asc_order_of_buf_sizes()
27 sizes_array[fm_ext_pools->ext_buf_pool[i].id] = buf_size; in fman_sp_set_buf_pools_in_asc_order_of_buf_sizes()
29 /* save poolId in an ordered array according to size */ in fman_sp_set_buf_pools_in_asc_order_of_buf_sizes()
30 for (j = 0; j <= i; j++) { in fman_sp_set_buf_pools_in_asc_order_of_buf_sizes()
[all …]

12345678910>>...43