/linux-4.4.14/drivers/net/wireless/hostap/ |
H A D | hostap_proc.c | 63 struct comm_tallies_sums *sums = &local->comm_tallies; prism2_stats_proc_show() local 65 seq_printf(m, "TxUnicastFrames=%u\n", sums->tx_unicast_frames); prism2_stats_proc_show() 66 seq_printf(m, "TxMulticastframes=%u\n", sums->tx_multicast_frames); prism2_stats_proc_show() 67 seq_printf(m, "TxFragments=%u\n", sums->tx_fragments); prism2_stats_proc_show() 68 seq_printf(m, "TxUnicastOctets=%u\n", sums->tx_unicast_octets); prism2_stats_proc_show() 69 seq_printf(m, "TxMulticastOctets=%u\n", sums->tx_multicast_octets); prism2_stats_proc_show() 71 sums->tx_deferred_transmissions); prism2_stats_proc_show() 72 seq_printf(m, "TxSingleRetryFrames=%u\n", sums->tx_single_retry_frames); prism2_stats_proc_show() 74 sums->tx_multiple_retry_frames); prism2_stats_proc_show() 76 sums->tx_retry_limit_exceeded); prism2_stats_proc_show() 77 seq_printf(m, "TxDiscards=%u\n", sums->tx_discards); prism2_stats_proc_show() 78 seq_printf(m, "RxUnicastFrames=%u\n", sums->rx_unicast_frames); prism2_stats_proc_show() 79 seq_printf(m, "RxMulticastFrames=%u\n", sums->rx_multicast_frames); prism2_stats_proc_show() 80 seq_printf(m, "RxFragments=%u\n", sums->rx_fragments); prism2_stats_proc_show() 81 seq_printf(m, "RxUnicastOctets=%u\n", sums->rx_unicast_octets); prism2_stats_proc_show() 82 seq_printf(m, "RxMulticastOctets=%u\n", sums->rx_multicast_octets); prism2_stats_proc_show() 83 seq_printf(m, "RxFCSErrors=%u\n", sums->rx_fcs_errors); prism2_stats_proc_show() 84 seq_printf(m, "RxDiscardsNoBuffer=%u\n", sums->rx_discards_no_buffer); prism2_stats_proc_show() 85 seq_printf(m, "TxDiscardsWrongSA=%u\n", sums->tx_discards_wrong_sa); prism2_stats_proc_show() 87 sums->rx_discards_wep_undecryptable); prism2_stats_proc_show() 89 sums->rx_message_in_msg_fragments); prism2_stats_proc_show() 91 sums->rx_message_in_bad_msg_fragments); prism2_stats_proc_show()
|
/linux-4.4.14/fs/btrfs/ |
H A D | file-item.c | 313 struct btrfs_ordered_sum *sums; btrfs_lookup_csums_range() local 388 sums = kzalloc(btrfs_ordered_sum_size(root, size), btrfs_lookup_csums_range() 390 if (!sums) { btrfs_lookup_csums_range() 395 sums->bytenr = start; btrfs_lookup_csums_range() 396 sums->len = (int)size; btrfs_lookup_csums_range() 404 sums->sums, btrfs_lookup_csums_range() 409 list_add_tail(&sums->list, &tmplist); btrfs_lookup_csums_range() 416 sums = list_entry(tmplist.next, struct btrfs_ordered_sum, list); btrfs_lookup_csums_range() 417 list_del(&sums->list); btrfs_lookup_csums_range() 418 kfree(sums); btrfs_lookup_csums_range() 429 struct btrfs_ordered_sum *sums; btrfs_csum_one_bio() local 440 sums = kzalloc(btrfs_ordered_sum_size(root, bio->bi_iter.bi_size), btrfs_csum_one_bio() 442 if (!sums) btrfs_csum_one_bio() 445 sums->len = bio->bi_iter.bi_size; btrfs_csum_one_bio() 446 INIT_LIST_HEAD(&sums->list); btrfs_csum_one_bio() 455 sums->bytenr = (u64)bio->bi_iter.bi_sector << 9; btrfs_csum_one_bio() 465 sums->len = this_sum_bytes; btrfs_csum_one_bio() 467 btrfs_add_ordered_sum(inode, ordered, sums); btrfs_csum_one_bio() 472 sums = kzalloc(btrfs_ordered_sum_size(root, bytes_left), btrfs_csum_one_bio() 474 BUG_ON(!sums); /* -ENOMEM */ btrfs_csum_one_bio() 475 sums->len = bytes_left; btrfs_csum_one_bio() 478 sums->bytenr = ((u64)bio->bi_iter.bi_sector << 9) + btrfs_csum_one_bio() 484 sums->sums[index] = ~(u32)0; btrfs_csum_one_bio() 485 sums->sums[index] = btrfs_csum_data(data + bvec->bv_offset, btrfs_csum_one_bio() 486 sums->sums[index], btrfs_csum_one_bio() 489 btrfs_csum_final(sums->sums[index], btrfs_csum_one_bio() 490 (char *)(sums->sums + index)); btrfs_csum_one_bio() 500 btrfs_add_ordered_sum(inode, ordered, sums); btrfs_csum_one_bio() 685 struct btrfs_ordered_sum *sums) btrfs_csum_file_blocks() 710 bytenr = sums->bytenr + total_bytes; btrfs_csum_file_blocks() 802 tmp = sums->len - total_bytes; btrfs_csum_file_blocks() 826 tmp = sums->len - total_bytes; btrfs_csum_file_blocks() 853 ins_size = (u32)(sums->len - total_bytes) >> btrfs_csum_file_blocks() 858 write_extent_buffer(leaf, sums->sums + index, (unsigned long)item, btrfs_csum_file_blocks() 866 if (total_bytes < sums->len) { btrfs_csum_file_blocks() 683 btrfs_csum_file_blocks(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_ordered_sum *sums) btrfs_csum_file_blocks() argument
|
H A D | compression.c | 81 u32 sums; member in struct:compressed_bio 112 u32 *cb_sum = &cb->sums; check_compressed_csum() 583 u32 *sums; btrfs_submit_compressed_read() local 606 sums = &cb->sums; btrfs_submit_compressed_read() 688 comp_bio, sums); btrfs_submit_compressed_read() 691 sums += DIV_ROUND_UP(comp_bio->bi_iter.bi_size, btrfs_submit_compressed_read() 720 ret = btrfs_lookup_bio_sums(root, inode, comp_bio, sums); btrfs_submit_compressed_read()
|
H A D | ordered-data.h | 34 * this is the length in bytes covered by the sums array below. 39 u32 sums[]; member in struct:btrfs_ordered_sum
|
H A D | tree-log.c | 777 struct btrfs_ordered_sum *sums; replay_one_extent() local 778 sums = list_entry(ordered_sums.next, replay_one_extent() 784 sums->bytenr, replay_one_extent() 785 sums->len); replay_one_extent() 789 sums); replay_one_extent() 790 list_del(&sums->list); replay_one_extent() 791 kfree(sums); replay_one_extent() 3731 struct btrfs_ordered_sum *sums = list_entry(ordered_sums.next, copy_items() local 3735 ret = btrfs_csum_file_blocks(trans, log, sums); copy_items() 3736 list_del(&sums->list); copy_items() 3737 kfree(sums); copy_items() 4019 struct btrfs_ordered_sum *sums = list_entry(ordered_sums.next, local 4023 ret = btrfs_csum_file_blocks(trans, log, sums); 4024 list_del(&sums->list); 4025 kfree(sums);
|
H A D | relocation.c | 4490 struct btrfs_ordered_sum *sums; btrfs_reloc_clone_csums() local 4508 sums = list_entry(list.next, struct btrfs_ordered_sum, list); btrfs_reloc_clone_csums() 4509 list_del_init(&sums->list); btrfs_reloc_clone_csums() 4523 new_bytenr = ordered->start + (sums->bytenr - disk_bytenr); btrfs_reloc_clone_csums() 4524 sums->bytenr = new_bytenr; btrfs_reloc_clone_csums() 4526 btrfs_add_ordered_sum(inode, ordered, sums); btrfs_reloc_clone_csums()
|
H A D | inode.c | 1192 struct btrfs_ordered_sum *sums; csum_exist_in_range() local 1201 sums = list_entry(list.next, struct btrfs_ordered_sum, list); csum_exist_in_range() 1202 list_del(&sums->list); csum_exist_in_range() 1203 kfree(sums); csum_exist_in_range() 1831 * checksummed and sums are attached onto the ordered extent record. 1852 * checksummed and sums are attached onto the ordered extent record. 1936 * given a list of ordered sums record them in the inode. This happens 1937 * at IO completion time based on sums calculated at bio submission time.
|
H A D | ordered-data.c | 1088 memcpy(sum + index, ordered_sum->sums + i, btrfs_find_ordered_sum()
|
H A D | ctree.h | 3895 struct btrfs_ordered_sum *sums);
|
H A D | scrub.c | 2473 memcpy(csum, sum->sums + index, sctx->csum_size); scrub_find_csum()
|
/linux-4.4.14/sound/pci/ctxfi/ |
H A D | ctmixer.c | 821 sum_c = mixer->sums[SUM_IN_F_C*CHN_NUM+i]; ct_mixer_recording_select() 861 mixer->sums[i] = sum; ct_mixer_get_resources() 893 if (NULL != mixer->sums[i]) { ct_mixer_get_resources() 894 sum_mgr->put_sum(sum_mgr, (struct sum *)mixer->sums[i]); ct_mixer_get_resources() 895 mixer->sums[i] = NULL; ct_mixer_get_resources() 919 mixer->sums = kzalloc(sizeof(void *)*(NUM_CT_SUMS*CHN_NUM), GFP_KERNEL); ct_mixer_get_mem() 920 if (!mixer->sums) { ct_mixer_get_mem() 947 sum = mixer->sums[j*CHN_NUM]; ct_mixer_topology_build() 950 sum = mixer->sums[j*CHN_NUM+1]; ct_mixer_topology_build() 976 sum = mixer->sums[j*CHN_NUM]; ct_mixer_topology_build() 979 sum = mixer->sums[j*CHN_NUM+1]; ct_mixer_topology_build() 985 sum = mixer->sums[SUM_IN_F*CHN_NUM]; ct_mixer_topology_build() 988 sum = mixer->sums[SUM_IN_F*CHN_NUM+1]; ct_mixer_topology_build() 993 sum = mixer->sums[SUM_IN_F*CHN_NUM]; ct_mixer_topology_build() 996 sum = mixer->sums[SUM_IN_F*CHN_NUM+1]; ct_mixer_topology_build() 1001 sum = mixer->sums[SUM_IN_F*CHN_NUM]; ct_mixer_topology_build() 1004 sum = mixer->sums[SUM_IN_F*CHN_NUM+1]; ct_mixer_topology_build() 1009 sum = mixer->sums[SUM_IN_F_C*CHN_NUM]; ct_mixer_topology_build() 1012 sum = mixer->sums[SUM_IN_F_C*CHN_NUM+1]; ct_mixer_topology_build() 1017 sum = mixer->sums[SUM_IN_F_C*CHN_NUM]; ct_mixer_topology_build() 1020 sum = mixer->sums[SUM_IN_F_C*CHN_NUM+1]; ct_mixer_topology_build() 1025 sum = mixer->sums[SUM_IN_F_C*CHN_NUM]; ct_mixer_topology_build() 1028 sum = mixer->sums[SUM_IN_F_C*CHN_NUM+1]; ct_mixer_topology_build() 1033 sum = mixer->sums[SUM_IN_F_C*CHN_NUM]; ct_mixer_topology_build() 1036 sum = mixer->sums[SUM_IN_F_C*CHN_NUM+1]; ct_mixer_topology_build() 1041 sum = mixer->sums[SUM_IN_F_C*CHN_NUM]; ct_mixer_topology_build() 1044 sum = mixer->sums[SUM_IN_F_C*CHN_NUM+1]; ct_mixer_topology_build() 1161 if (NULL != mixer->sums[i]) ct_mixer_destroy() 1162 sum_mgr->put_sum(sum_mgr, (struct sum *)mixer->sums[i]); ct_mixer_destroy() 1166 kfree(mixer->sums); ct_mixer_destroy()
|
H A D | ctmixer.h | 49 void **sums; /* sum resources for signal collection */ member in struct:ct_mixer
|
/linux-4.4.14/arch/tile/include/asm/ |
H A D | checksum.h | 26 * This sums two subwords on a 32-bit machine, and four on 64 bits.
|
/linux-4.4.14/net/dccp/ |
H A D | ackvec.h | 64 * @av_buf_nonce: ECN nonce sums, each covering subsequent segments of up to
|
/linux-4.4.14/fs/proc/ |
H A D | task_nommu.c | 13 * Logic: we've got two memory sums for each process, "shared", and
|
/linux-4.4.14/include/net/ |
H A D | bond_alb.h | 137 u32 load; /* Each slave sums the loadHistory of all clients
|
H A D | sock.h | 2035 /* Since sk_{r,w}mem_alloc sums skb->truesize, even a small frame might
|
/linux-4.4.14/arch/s390/kernel/ |
H A D | irq.c | 45 * Since the external and I/O interrupt fields are already sums we would end
|
/linux-4.4.14/net/ipv4/ |
H A D | tcp_cdg.c | 204 /* We keep sums to ignore gradients during cwnd reductions; tcp_cdg_grad()
|
/linux-4.4.14/drivers/scsi/lpfc/ |
H A D | lpfc_sli.h | 25 /* Define the context types that SLI handles for abort and sums. */
|
/linux-4.4.14/drivers/net/ethernet/intel/ixgb/ |
H A D | ixgb_ee.c | 321 * Reads the first 64 16 bit words of the EEPROM and sums the values read.
|
/linux-4.4.14/net/ceph/crush/ |
H A D | mapper.c | 160 dprintk("bad list sums for bucket %d\n", bucket->h.id); bucket_list_choose()
|
/linux-4.4.14/drivers/leds/ |
H A D | leds-tca6507.c | 43 * 26% of the achievable sums can be matched by multiple pairings.
|
/linux-4.4.14/drivers/tty/serial/ |
H A D | sunsu.c | 1232 strlcpy(serio->name, "sums", sizeof(serio->name)); sunsu_kbd_ms_init()
|
/linux-4.4.14/drivers/staging/lustre/lustre/obdclass/ |
H A D | cl_lock.c | 1477 * Executes cl_lock_operations::clo_weigh(), and sums results to estimate lock
|
/linux-4.4.14/kernel/ |
H A D | sys.c | 1510 * care which for the sums. We always take the siglock to protect reading
|
/linux-4.4.14/drivers/net/ethernet/freescale/ |
H A D | gianfar.c | 3013 /* If valid headers were found, and valid sums gfar_rx_checksum()
|
/linux-4.4.14/drivers/net/wireless/iwlegacy/ |
H A D | commands.h | 1927 * includes a shifting bitmap of success(1)/failure(0), and sums of successful
|
/linux-4.4.14/drivers/net/wireless/iwlwifi/dvm/ |
H A D | commands.h | 1677 * includes a shifting bitmap of success(1)/failure(0), and sums of successful
|
/linux-4.4.14/drivers/net/ethernet/intel/e1000/ |
H A D | e1000_hw.c | 3984 * Reads the first 64 16 bit words of the EEPROM and sums the values read.
|