| /linux-6.12.1/drivers/md/dm-vdo/indexer/ |
| D | open-chapter.c | 20 * open chapter space. Records are assigned to zones based on their record name. Within each zone,
21 * records are stored in an array in the order they arrive. Additionally, a reference to each
24 * records is 1-based so that record number 0 can be used to indicate an unused hash slot.
26 * Deleted records are marked with a flag rather than actually removed to simplify hash table
29 * power of two that is greater than the number of records to be indexed, guaranteeing that hash
30 * insertion cannot fail, and that there are sufficient flags for all records.
32 * Once any open chapter zone fills its available space, the chapter is closed. The records from
34 * Empty or deleted records are replaced by copies of a valid record so that the record pages only
35 * contain valid records. The chapter then constructs a delta index which maps each record name to
39 * When the index is saved, the open chapter records are saved in a single array, once again
[all …]
|
| D | open-chapter.h | 15 * The open chapter tracks the newest records in memory. Like the index as a whole, each open
32 /* The maximum number of records that can be stored */
34 /* The number of records stored */
36 /* The number of deleted records */
38 /* Array of chunk records, 1-based */
39 struct uds_volume_record *records; member
|
| D | geometry.h | 12 …* The index_geometry records parameters that define the layout of a UDS index volume, and the size…
45 /* Number of records that fit on a page */
47 /* Number of records that fit in a chapter */
49 /* Number of records that fit in a volume */
70 /* The default maximum number of records per page */
|
| D | volume.h | 27 * The volume manages deduplication records on permanent storage. The term "volume" can also refer
28 * to the region of permanent storage where the records (and the chapters containing them) are
105 /* A single page worth of records, for sorting */
107 /* Sorter for sorting records within each page */
156 const struct uds_volume_record records[]);
|
| /linux-6.12.1/fs/xfs/ |
| D | xfs_iwalk.c | 41 * therefore cache the inobt records in kernel memory and only call the walk
42 * function when our memory buffer is full. @nr_recs is the number of records
46 * allocated inodes, as the inobt records may be stale by the time they are
64 /* Array of inobt records we cache. */
85 /* Skip empty inobt records? */
154 /* Allocate a prefetch buffer for inobt records. */ in xfs_iwalk_alloc()
241 * Set ourselves up for walking inobt records starting from a given point in
282 * the record into our cache, and then see if there are more records. in xfs_iwalk_ag_start()
285 * records. in xfs_iwalk_ag_start()
292 * If the LE lookup at @agino yields no records, jump ahead to the in xfs_iwalk_ag_start()
[all …]
|
| /linux-6.12.1/drivers/acpi/apei/ |
| D | bert.c | 40 * Print "all" the error records in the BERT table, but avoid huge spam to
41 * the console if the BIOS included oversize records, or too many records.
42 * Skipping some records here does not lose anything because the full
63 /* No more error records. */ in bert_print_all()
74 pr_info_once("Error records from previous boot:\n"); in bert_print_all()
93 pr_info(HW_ERR "Skipped %d error records\n", skipped); in bert_print_all()
96 pr_info("Total records found: %d\n", printed + skipped); in bert_print_all()
|
| /linux-6.12.1/fs/xfs/libxfs/ |
| D | xfs_btree_staging.h | 59 * This function will be called to load @nr_wanted records into the
62 * records in the btree block. Records must be returned in sort order.
63 * The function must return the number of records loaded or the usual
83 * The caller should set this to the number of records that will be
89 * Number of free records to leave in each leaf block. If the caller
104 * number of btree blocks needed to store nr_records records.
|
| /linux-6.12.1/fs/xfs/scrub/ |
| D | alloc_repair.c | 48 * AG. Therefore, we can recreate the free extent records in an AG by looking
49 * for gaps in the physical extents recorded in the rmapbt. These records are
51 * reflink filesystem because rmap records are allowed to overlap.
58 * The scan of the reverse mapping information records the space used by OWN_AG
60 * walking the rmapbt records, we create a second bitmap @not_allocbt_blocks to
79 * parameter in place to avoid copying records around.
82 * reservation and used to format new btree blocks. The remaining records are
111 /* Number of non-null records in @free_records. */
118 * Next block we anticipate seeing in the rmap records. If the next
223 /* Record extents that aren't in use from gaps in the rmap records. */
[all …]
|
| D | ialloc_repair.c | 50 * - Inode records are read into memory in units of 'inode clusters'. However
62 * also possible to construct a geometry where multiple inobt records map to
66 * inode records is enough to contain one inode chunk's worth of inodes.
72 * of inode records is one inode cluster.
76 * Iterate the reverse mapping records looking for OWN_INODES and OWN_INOBT
77 * records. The OWN_INOBT records are the old inode btree blocks and will be
86 * Once we've reconstructed all the inode records, we can create new inode
109 /* Reconstructed inode records. */
120 /* Number of finobt records needed. */
285 * appropriate inode records.
[all …]
|
| D | rmap_repair.c | 54 * list of rmap records requires that we be able to scan both block mapping
71 * bmaps into rmap records (see 1.1.4). Set bits in BMBIT for each btree
76 * target AG. Remember, multiple bmap records can map to a single rmap
77 * record, so we cannot simply emit rmap records 1:1.
78 * 1.5. Emit rmap records for each extent in BMBIT and free it.
81 * and set bits in INOBIT for each btree block. If the inobt has no records
84 * 5. Emit rmap records for each extent in INOBIT and ICHUNKBIT and free them.
89 * 9. Emit rmap records for each extent in REFCBIT and COWBIT and free them.
96 * 2. Estimate the number of rmapbt blocks needed to store NR records. (= RMB)
109 * 1. Sort the rmap records.
[all …]
|
| D | rmap.c | 55 * The furthest-reaching of the rmapbt records that we've already
56 * processed. This enables us to detect overlapping records for space
62 * The previous rmapbt record, so that we can check for two records
136 * In reverse mapping records, the file mapping extent state
139 * convert rmapbt records to keys forgot to filter out the extent state bit,
200 /* Flag failures for records that overlap but cannot. */
221 /* Overlap is only allowed if both records are data fork mappings. */ in xchk_rmapbt_check_overlapping()
235 /* Decide if two reverse-mapping records can be merged. */
264 /* Flag failures for records that could be merged. */
292 * Skip corrupt records. It is essential that we detect records in the in xchk_rmapbt_mark_bitmap()
[all …]
|
| /linux-6.12.1/drivers/gpu/drm/amd/amdgpu/ |
| D | amdgpu_ras_eeprom.c | 561 dev_warn(adev->dev, "RAS records:%d exceed threshold:%d", in amdgpu_ras_eeprom_check_err_threshold()
582 * @num: number of records to write
603 DRM_ERROR("Writing %d EEPROM table records error:%d", in __amdgpu_ras_eeprom_write()
608 DRM_ERROR("Wrote %d records out of %d", in __amdgpu_ras_eeprom_write()
648 * a = first index to read (fri) + number of records in the table, in amdgpu_ras_eeprom_append_table()
652 * just append @num records starting at a; in amdgpu_ras_eeprom_append_table()
654 * append (N - a) records starting at a, and in amdgpu_ras_eeprom_append_table()
658 * append num records starting at a; and fix fri if b overwrote it, in amdgpu_ras_eeprom_append_table()
662 * write num records starting at a, which wraps around 0=N in amdgpu_ras_eeprom_append_table()
668 * the number of records present in the table after writing, is, in amdgpu_ras_eeprom_append_table()
[all …]
|
| D | amdgpu_ras_eeprom.h | 74 * and where the records start--always
81 /* Number of records in the table.
92 /* Maximum possible number of records
139 struct eeprom_table_record *records, const u32 num);
142 struct eeprom_table_record *records, const u32 num);
|
| /linux-6.12.1/Documentation/filesystems/xfs/ |
| D | xfs-online-fsck-design.rst | 79 cross-references different types of metadata records with each other to look
364 - Inode records and indexes
383 errors and cross-references healthy records against other metadata to look for
424 Metadata structures in this category reflect records found in primary metadata,
510 compared the shadow records to the ondisk records.
520 metadata records.
590 coherent narrative cannot be formed from records collected, then the repair
594 designed to stage and validate all new records before committing the new
710 Targeted Fuzz Testing of Metadata Records
1077 The details of how these records are staged, written to disk, and committed
[all …]
|
| /linux-6.12.1/include/uapi/linux/ |
| D | dns_resolver.h | 60 DNS_LOOKUP_GOOD = 1, /* Good records obtained */
61 DNS_LOOKUP_GOOD_WITH_BAD = 2, /* Good records, some decoding errors */
81 * the server records. Each server records begins with a struct of type
88 __u8 nr_servers; /* Number of server records following this */
94 * records for that server. Each address record begins with a struct of type
|
| /linux-6.12.1/arch/x86/kvm/vmx/ |
| D | pmu_intel.c | 134 struct x86_pmu_lbr *records = vcpu_to_lbr_records(vcpu); in intel_pmu_is_valid_lbr_msr() local
141 (index >= records->from && index < records->from + records->nr) || in intel_pmu_is_valid_lbr_msr()
142 (index >= records->to && index < records->to + records->nr); in intel_pmu_is_valid_lbr_msr()
144 if (!ret && records->info) in intel_pmu_is_valid_lbr_msr()
145 ret = (index >= records->info && index < records->info + records->nr); in intel_pmu_is_valid_lbr_msr()
223 * event, which helps KVM to save/restore guest LBR records in intel_pmu_create_guest_lbr_event()
259 * the LBR msrs records when the guest LBR event is scheduled in.
469 memset(&lbr_desc->records, 0, sizeof(lbr_desc->records)); in intel_pmu_refresh()
547 memcpy(&lbr_desc->records, &vmx_lbr_caps, sizeof(vmx_lbr_caps)); in intel_pmu_refresh()
549 lbr_desc->records.nr = 0; in intel_pmu_refresh()
[all …]
|
| /linux-6.12.1/include/linux/ |
| D | ihex.h | 3 * Compact binary representation of ihex records. Some devices need their
16 drivers which would benefit from using separate records which are
55 /* Zero length marks end of records */ in ihex_validate_fw()
63 * run off the end while reading records... */
76 dev_err(dev, "Firmware \"%s\" not valid IHEX records\n", in request_ihex_firmware()
|
| /linux-6.12.1/tools/perf/Documentation/ |
| D | perf.data-file-format.txt | 62 struct perf_header_string strings[nr]; /* variable length records */
149 } events[nr]; /* Variable length records */
173 } cpus[nr]; /* Variable length records */
205 } nodes[nr]; /* Variable length records */
221 } [nr]; /* Variable length records */
234 } [nr]; /* Variable length records */
373 Indicates that trace contains records of PERF_RECORD_COMPRESSED type
374 that have perf_events records in compressed form.
414 } [nr]; /* Variable length records */
602 Describes a header feature. These are records used in pipe-mode that
[all …]
|
| /linux-6.12.1/arch/x86/kernel/cpu/mce/ |
| D | genpool.c | 18 * This memory pool is only to be used to save MCE records in MCE context.
29 * Compare the record "t" with each of the records on list "l" to see if
49 * The system has panicked - we'd like to peruse the list of MCE records
52 * also drop duplicate records (these were logged because some banks are
109 pr_warn_ratelimited("MCE records pool full!\n"); in mce_gen_pool_add()
|
| /linux-6.12.1/Documentation/arch/s390/ |
| D | monreader.rst | 2 Linux API for read access to z/VM Monitor Records
15 usable from user space and allows read access to the z/VM Monitor Records
137 followed by a set of one or more contiguous monitor records (similar to the
143 last byte of data. The start address is needed to handle "end-of-frame" records
148 of the monitor control element layout. The layout of the monitor records can
156 <first set of records> |
159 <last set of records> /
192 read with 0 size is valid but subsequent records may be missing.
|
| /linux-6.12.1/tools/firmware/ |
| D | ihex2fw.c | 66 fprintf(stderr, " -w: wide records (16-bit length)\n"); in usage()
67 fprintf(stderr, " -s: sort records by address\n"); in usage()
68 fprintf(stderr, " -j: include records for CS:IP/EIP address\n"); in usage()
165 fprintf(stderr, "out of memory for records\n"); in process_ihex()
238 /* These records contain the CS/IP or EIP where execution in process_ihex()
252 static struct ihex_binrec *records; variable
256 struct ihex_binrec **p = &records; in file_record()
273 struct ihex_binrec *p = records; in output_records()
|
| /linux-6.12.1/drivers/usb/serial/ |
| D | ezusb_convert.pl | 5 # convert an Intel HEX file into a set of C records usable by the firmware
19 # normal records, 01 for EOF
28 push(@records, [$addr, \@bytes]);
31 @sorted_records = sort { $a->[0] <=> $b->[0] } @records;
|
| /linux-6.12.1/Documentation/networking/ |
| D | tls-offload.rst | 58 and the ``strparser`` mechanism is used to delineate the records. Upon read
59 request, records are retrieved from the socket and passed to decryption routine.
124 so the initial records' TCP sequence number may be anywhere inside the segment.
138 segments may start at any point of a record and contain any number of records.
275 as received on wire, red stripes mark start of new records.
322 and counting all records since the just-confirmed one, it adds the number
323 of records it had seen to the record number provided by the kernel.
341 whenever it sees the records are no longer getting decrypted.
344 records.
348 records continue to be received fully encrypted stack retries the
[all …]
|
| /linux-6.12.1/drivers/s390/char/ |
| D | Kconfig | 147 Select this option if you want to be able to receive records collected
173 prompt "API for reading z/VM monitor service records"
176 Character device driver for reading z/VM monitor service records
180 prompt "API for writing z/VM monitor service records"
183 Character device driver for writing z/VM monitor service records
|
| /linux-6.12.1/Documentation/admin-guide/device-mapper/ |
| D | dm-dust.rst | 79 128+0 records in
80 128+0 records out
83 128+0 records in
84 128+0 records out
124 0+0 records in
125 0+0 records out
132 128+0 records in
133 128+0 records out
|