/linux-master/drivers/md/dm-vdo/indexer/ |
H A D | open-chapter.c | 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 41 * different number of zones than previously, so the records mus 212 unsigned int records = 0; local [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 in struct:open_chapter_zone
|
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[]);
|
H A D | volume.c | 28 * The remainder of the volume is divided into chapters consisting of several pages of records, and 29 * several pages of static index to use to find those records. The index pages are recorded first, 34 * When a new chapter is filled and closed, the records from that chapter are sorted and 46 * are stored in a page cache when read for the common case that subsequent records need the same 59 * range of chapters contain valid records, so that those records can be used to reconstruct the 475 * The array of records is sorted by name and stored as a binary tree in heap order, so the 479 const struct uds_volume_record *records = (const struct uds_volume_record *) record_page; local 483 const struct uds_volume_record *record = &records[node]; 1181 const struct uds_volume_record records[], u 1180 encode_record_page(const struct volume *volume, const struct uds_volume_record records[], u8 record_page[]) argument 1205 write_record_pages(struct volume *volume, u32 physical_chapter_number, const struct uds_volume_record *records) argument 1244 uds_write_chapter(struct volume *volume, struct open_chapter_index *chapter_index, const struct uds_volume_record *records) argument [all...] |
/linux-master/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-master/drivers/gpu/drm/amd/amdgpu/ |
H A 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 140 struct eeprom_table_record *records, const u32 num); 143 struct eeprom_table_record *records, const u32 num);
|
/linux-master/arch/x86/kvm/vmx/ |
H A D | pmu_intel.c | 134 struct x86_pmu_lbr *records = vcpu_to_lbr_records(vcpu); local 141 (index >= records->from && index < records->from + records->nr) || 142 (index >= records->to && index < records->to + records->nr); 144 if (!ret && records->info) 145 ret = (index >= records->info && index < records [all...] |
H A D | vmx.h | 98 /* Basic info about guest LBR records. */ 99 struct x86_pmu_lbr records; member in struct:lbr_desc 105 * The records may be inaccurate if the host reclaims the LBR. 670 return &vcpu_to_lbr_desc(vcpu)->records;
|
/linux-master/tools/hv/ |
H A D | hv_kvp_daemon.c | 125 struct kvp_record *records; member in struct:kvp_file_state 174 fwrite(kvp_file_info[pool].records, sizeof(struct kvp_record), 190 struct kvp_record *record = kvp_file_info[pool].records; 236 kvp_file_info[pool].records = record; 268 kvp_file_info[i].records = malloc(alloc_unit); 269 if (kvp_file_info[i].records == NULL) 291 record = kvp_file_info[pool].records; 339 record = kvp_file_info[pool].records; 369 kvp_file_info[pool].records = record; 392 record = kvp_file_info[pool].records; [all...] |
/linux-master/tools/firmware/ |
H A D | ihex2fw.c | 66 fprintf(stderr, " -w: wide records (16-bit length)\n"); 67 fprintf(stderr, " -s: sort records by address\n"); 68 fprintf(stderr, " -j: include records for CS:IP/EIP address\n"); 165 fprintf(stderr, "out of memory for records\n"); 238 /* These records contain the CS/IP or EIP where execution 252 static struct ihex_binrec *records; variable in typeref:struct:ihex_binrec 256 struct ihex_binrec **p = &records; 273 struct ihex_binrec *p = records;
|
/linux-master/drivers/cpuidle/ |
H A D | cpuidle-pseries.c | 151 // Make space for 16 records, which "should be enough". 154 struct xcede_latency_record records[16]; member in struct:xcede_latency_payload 204 struct xcede_latency_record *record = &payload->records[i]; 372 struct xcede_latency_record *record = &payload->records[i];
|
/linux-master/lib/pldmfw/ |
H A D | pldmfw.c | 27 struct list_head records; member in struct:pldmfw_priv 42 /* Start pf the firmware device id records */ 183 data->record_start = record_area->records; 336 list_add_tail(&record->entry, &data->records); 554 list_for_each_entry_safe(record, r_safe, &data->records, entry) { 617 * @record: list of records extracted from the PLDM image 687 * Search through PLDM records and find the first matching entry. It is 698 list_for_each_entry(record, &data->records, entry) { 841 INIT_LIST_HEAD(&data->records);
|
H A D | pldmfw_private.h | 101 u8 records[]; member in struct:__pldmfw_record_area 172 * @start: byte offset of the start of the PLDM records 174 * Converts a starting offset of the PLDM records into a pointer to the first 194 * @start: byte offset of the start of the records 195 * @count: the number of records 197 * for loop macro to iterate over all of the records of a PLDM file.
|
/linux-master/include/uapi/linux/ |
H A D | ndctl.h | 89 } __packed records[]; member in struct:nd_cmd_ars_status
|
/linux-master/drivers/gpu/drm/vboxvideo/ |
H A D | vboxvideo.h | 68 * records queue. VBVA_F_RECORD_PARTIAL indicates that the record is being 72 * The host reads the records on flushes and processes all completed records. 132 struct vbva_record records[VBVA_MAX_RECORDS]; member in struct:vbva_buffer 136 /* Space to leave free when large partial records are transferred. */
|
H A D | vbva_base.c | 178 /* Flush if all slots in the records queue are used */ 186 record = &vbva_ctx->vbva->records[vbva_ctx->vbva->record_free_index];
|
/linux-master/kernel/trace/ |
H A D | ftrace.c | 426 struct ftrace_profile records[]; member in struct:ftrace_profile_page 438 (PAGE_SIZE - offsetof(struct ftrace_profile_page, records)) 465 if ((void *)rec >= (void *)&pg->records[pg->index]) { 469 rec = &pg->records[0]; 485 return function_stat_next(&stat->start->records[0], 0); 603 memset(pg->records, 0, PROFILE_RECORDS_SIZE); 773 rec = &stat->pages->records[stat->pages->index++]; 1117 struct dyn_ftrace *records; member in struct:ftrace_page 1541 rec = &pg->records[_____i]; 1571 end < pg->records[ [all...] |
/linux-master/fs/reiserfs/ |
H A D | lbalance.c | 28 int copy_records_len; /* length of all records in item to be copied */ 29 char *records; local 44 records = 49 records = NULL; 113 records, 0); local 123 : 0, copy_count, deh + from, records, 1068 * does not have free space, so it moves DEHs and remaining records as 1079 int cut_records_len; /* length of all removed records */ 1102 * (prev_record) and length of all removed records (cut_records_len) 1129 /* shift records, thos 1314 leaf_paste_entries(struct buffer_info *bi, int item_num, int before, int new_entry_count, struct reiserfs_de_head *new_dehs, const char *records, int paste_size) argument [all...] |
/linux-master/fs/xfs/libxfs/ |
H A D | xfs_btree.h | 163 /* records in block/level */ 167 /* records on disk. Matter for the root in inode case. */ 212 * @key1 < K < @key2. To determine if two btree records are 467 unsigned long long records); 469 unsigned long long records);
|
/linux-master/tools/testing/cxl/test/ |
H A D | mem.c | 236 if (cmd->size_out < struct_size(pl, records, CXL_TEST_EVENT_CNT)) 252 memcpy(&pl->records[i], event_get_current(log), 253 sizeof(pl->records[i])); 254 pl->records[i].event.generic.hdr.handle =
|
/linux-master/drivers/cxl/core/ |
H A D | mbox.c | 909 * Record can return up to 0xffff records. 913 struct cxl_event_record_raw *raw = &get_pl->records[cnt]; 963 .min_out = struct_size(payload, records, 0), 969 "Event log '%d': Failed to query event records : %d", 980 &payload->records[i]); 1002 * Retrieve all event records available on the device, report them as trace
|
/linux-master/drivers/net/wireless/ath/ath10k/ |
H A D | htt_tx.c | 1102 struct htt_tx_fetch_record *records, 1117 len += sizeof(cmd->tx_fetch_resp.records[0]) * num_records; 1131 memcpy(cmd->tx_fetch_resp.records, records, 1132 sizeof(records[0]) * num_records); 1099 ath10k_htt_tx_fetch_resp(struct ath10k *ar, __le32 token, __le16 fetch_seq_num, struct htt_tx_fetch_record *records, size_t num_records) argument
|
H A D | htt.h | 1571 DECLARE_FLEX_ARRAY(struct htt_tx_fetch_record, records); 1578 return (void *)&ind->records[le16_to_cpu(ind->num_records)]; 1587 struct htt_tx_fetch_record records[]; member in struct:htt_tx_fetch_resp 1625 struct htt_tx_mode_switch_record records[]; member in struct:htt_tx_mode_switch_ind 2441 struct htt_tx_fetch_record *records,
|
/linux-master/kernel/rcu/ |
H A D | tree.c | 1805 // the RCU_GP_FLAG_INIT bit in ->gp_state (which records 2852 * @records: Array of the kvfree_rcu() pointers 2858 void *records[]; member in struct:kvfree_rcu_bulk_data 2862 * This macro defines how many entries the "records" array 2949 debug_rcu_head_unqueue((struct rcu_head *)(bhead->records[i])); 3031 bnode->records); 3033 kfree_bulk(bnode->nr_records, bnode->records); 3037 rcu_state.name, bnode->records[i], 0); 3039 vfree(bnode->records[i]); 3398 bnode->records[bnod [all...] |
/linux-master/drivers/cxl/ |
H A D | cxlmem.h | 268 * @max_errors: Maximum media error records held in device cache 641 struct cxl_event_record_raw records[]; member in struct:cxl_get_event_payload
|