| /linux/drivers/md/dm-vdo/indexer/ |
| H A 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 …]
|
| H A 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
|
| H A 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 */
|
| H A 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/fs/xfs/ |
| H A 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? */
153 /* Allocate a prefetch buffer for inobt records. */ in xfs_iwalk_alloc()
240 * Set ourselves up for walking inobt records starting from a given point in
281 * the record into our cache, and then see if there are more records. in xfs_iwalk_ag_start()
284 * records. in xfs_iwalk_ag_start()
291 * If the LE lookup at @agino yields no records, jump ahead to the in xfs_iwalk_ag_start()
[all …]
|
| /linux/drivers/acpi/apei/ |
| H A 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/drivers/gpu/drm/amd/amdgpu/ |
| H A D | amdgpu_ras_eeprom.h | 75 * and where the records start--always
82 /* Number of records in the table.
91 /* Number of records store mca address */
94 /* Number of records store physical address */
104 /* Maximum possible number of records
153 struct eeprom_table_record *records, const u32 num);
156 struct eeprom_table_record *records, const u32 num);
|
| /linux/fs/xfs/libxfs/ |
| H A 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/fs/xfs/scrub/ |
| H A 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
222 /* Record extents that aren't in use from gaps in the rmap records. */
[all …]
|
| H A 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. */
283 * appropriate inode records.
[all …]
|
| H A D | rmap_repair.c | 57 * list of rmap records requires that we be able to scan both block mapping
74 * bmaps into rmap records (see 1.1.4). Set bits in BMBIT for each btree
79 * target AG. Remember, multiple bmap records can map to a single rmap
80 * record, so we cannot simply emit rmap records 1:1.
81 * 1.5. Emit rmap records for each extent in BMBIT and free it.
84 * and set bits in INOBIT for each btree block. If the inobt has no records
87 * 5. Emit rmap records for each extent in INOBIT and ICHUNKBIT and free them.
92 * 9. Emit rmap records for each extent in REFCBIT and COWBIT and free them.
99 * 2. Estimate the number of rmapbt blocks needed to store NR records. (= RMB)
112 * 1. Sort the rmap records.
[all …]
|
| /linux/arch/x86/kvm/vmx/ |
| H A D | pmu_intel.c | 52 return &to_vmx(vcpu)->lbr_desc.records; in vcpu_to_lbr_records()
170 struct x86_pmu_lbr *records = vcpu_to_lbr_records(vcpu); in intel_pmu_is_valid_lbr_msr() local
177 (index >= records->from && index < records->from + records->nr) || in intel_pmu_is_valid_lbr_msr()
178 (index >= records->to && index < records->to + records->nr); in intel_pmu_is_valid_lbr_msr()
180 if (!ret && records->info) in intel_pmu_is_valid_lbr_msr()
181 ret = (index >= records->info && index < records->info + records->nr); in intel_pmu_is_valid_lbr_msr()
262 * event, which helps KVM to save/restore guest LBR records in intel_pmu_create_guest_lbr_event()
301 * the LBR msrs records when the guest LBR event is scheduled in.
514 memset(&lbr_desc->records, 0, sizeof(lbr_desc->records)); in intel_pmu_refresh()
555 memcpy(&lbr_desc->records, &vmx_lbr_caps, sizeof(vmx_lbr_caps)); in intel_pmu_refresh()
[all …]
|
| /linux/tools/testing/selftests/landlock/ |
| H A D | audit_test.c | 357 struct audit_records records; in TEST_F() local
394 /* Checks domain information records. */ in TEST_F()
407 /* Makes sure there is no superfluous logged records. */ in TEST_F()
408 EXPECT_EQ(0, audit_count_records(self->audit_fd, &records)); in TEST_F()
411 EXPECT_EQ(0, records.access); in TEST_F()
413 EXPECT_EQ(1, records.access); in TEST_F()
415 EXPECT_EQ(0, records.domain); in TEST_F()
544 struct audit_records records; in TEST_F() local
602 EXPECT_EQ(0, audit_count_records(self->audit_fd, &records)); in TEST_F()
603 EXPECT_EQ(0, records.access); in TEST_F()
[all …]
|
| /linux/include/uapi/linux/ |
| H A 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/include/linux/ |
| H A 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/tools/perf/Documentation/ |
| H A 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 */
383 Indicates that trace contains records of PERF_RECORD_COMPRESSED2 type
384 that have perf_events records in compressed form.
424 } [nr]; /* Variable length records */
612 Describes a header feature. These are records used in pipe-mode that
[all …]
|
| /linux/Documentation/arch/s390/ |
| H A 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/tools/firmware/ |
| H A 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/Documentation/networking/ |
| H A D | tls.rst | 81 The sendfile system call will send the file's data over TLS records of maximum
90 TLS records are created and sent after each send() call, unless
203 recv will never return data from mixed types of TLS records.
214 To prevent attempting to decrypt incoming records using the wrong key,
267 this will look like TLS records had been tampered with and will result
273 TLS 1.3 only. Expect the sender to not pad records. This allows the data
310 number of RX records which had to be re-decrypted due to
312 also increment for non-data records.
315 number of data RX records which had to be re-decrypted due to
|
| H A 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 segmentation, so the initial records' TCP sequence number may be anywhere
139 segments may start at any point of a record and contain any number of records.
276 as received on wire, red stripes mark start of new records.
323 and counting all records since the just-confirmed one, it adds the number
324 of records it had seen to the record number provided by the kernel.
342 whenever it sees the records are no longer getting decrypted.
345 records.
349 records continue to be received fully encrypted stack retries the
[all …]
|
| /linux/drivers/usb/serial/ |
| H A 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/Documentation/bpf/ |
| H A D | ringbuf.rst | 75 - variable-length records;
98 submit records of the length that's not known to verifier beforehand. It also
103 pointer directly to ring buffer memory. In a lot of cases records are larger
113 a record as discarded, and such records are supposed to be ignored by consumer
148 independent records and work with them without blocking other producers. This
180 completely lockless and independent. All records become available to consumer
181 in the order of reservations, but only after all previous records where
183 off submitted records, that were reserved later.
|
| /linux/Documentation/admin-guide/device-mapper/ |
| H A 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
|
| /linux/drivers/s390/char/ |
| H A 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/drivers/perf/ |
| H A D | arm_brbe.c | 220 /* Ensure all branch records are invalidated after this point */ in brbe_invalidate()
269 * between setting BANK and accessing branch records. in select_brbe_bank()
324 * generating branch records. These branch filters can be enabled,
369 * branch records.
371 * BRBCR_ELx_E0BRE - EL0 branch records
372 * BRBCR_ELx_ExBRE - EL1/EL2 branch records
375 * filters while generating branch records.
413 * or target only records. in branch_type_to_brbcr()
500 * Discard existing records to avoid a discontinuity, e.g. records in brbe_enable()
519 * controls freezing the branch records on counter overflow rather than in brbe_enable()
[all …]
|