/linux-master/drivers/net/phy/ |
H A D | marvell.c | 2083 static u32 marvell_vct5_distance2cm(int distance) argument 2085 return distance * 805 / 10; 2094 int distance, int pair) 2102 distance); 2133 int distance; local 2163 for (distance = priv->first; 2164 distance <= priv->last; 2165 distance += priv->step) { 2166 err = marvell_vct5_amplitude_distance(phydev, distance, 2171 if (distance > TDR_SHORT_CABLE_LENGT 2093 marvell_vct5_amplitude_distance(struct phy_device *phydev, int distance, int pair) argument 2291 marvell_vct7_distance_to_length(int distance, bool meter) argument [all...] |
/linux-master/kernel/sched/ |
H A D | topology.c | 817 * Given a node-distance table, for example: 1752 bool find_numa_distance(int distance) argument 1757 if (distance == node_distance(0, 0)) 1765 if (distances[i] == distance) { 1795 * - If the maximum distance between any nodes is 1 hop, the system 1860 int distance = node_distance(i, j); local 1862 if (distance < LOCAL_DISTANCE || distance >= NR_DISTANCE_VALUES) { 1863 sched_numa_warn("Invalid distance value range"); 1868 bitmap_set(distance_map, distance, [all...] |
/linux-master/mm/ |
H A D | compaction.c | 445 /* Leave no distance if no suitable block was reset */ 1567 unsigned long distance; local 1589 distance = (cc->free_pfn - cc->migrate_pfn); 1590 low_pfn = pageblock_start_pfn(cc->free_pfn - (distance >> 2)); 1591 min_pfn = pageblock_start_pfn(cc->free_pfn - (distance >> 1)); 1978 unsigned long distance; local 2026 distance = (cc->free_pfn - cc->migrate_pfn) >> 1; 2028 distance >>= 2; 2029 high_pfn = pageblock_start_pfn(cc->migrate_pfn + distance);
|
/linux-master/kernel/locking/ |
H A D | lockdep.c | 1410 u16 distance, u8 dep, 1425 entry->distance = distance; 3092 struct held_lock *next, u16 distance, 3151 if (distance == 1) 3152 entry->distance = 1; 3173 if (distance == 1) 3174 entry->distance = 1; 3205 &hlock_class(prev)->locks_after, distance, 3212 &hlock_class(next)->locks_before, distance, 1408 add_lock_to_list(struct lock_class *this, struct lock_class *links_to, struct list_head *head, u16 distance, u8 dep, const struct lock_trace *trace) argument 3091 check_prev_add(struct task_struct *curr, struct held_lock *prev, struct held_lock *next, u16 distance, struct lock_trace **const trace) argument 3249 u16 distance = curr->lockdep_depth - depth + 1; local [all...] |
H A D | lockdep_proc.c | 108 if (entry->distance == 1) {
|
/linux-master/mm/kfence/ |
H A D | core.c | 1175 int distance = 0; local 1180 /* Data race ok; distance calculation approximate. */ 1181 distance = addr - data_race(meta->addr + meta->size); 1186 /* Data race ok; distance calculation approximate. */ 1187 if (!to_report || distance > data_race(meta->addr) - addr)
|
/linux-master/drivers/gpu/drm/bridge/ |
H A D | sii902x.c | 541 int distance = 100000; local 547 if (d >= distance) 551 distance = d;
|
/linux-master/arch/powerpc/mm/ |
H A D | numa.c | 252 int distance = LOCAL_DISTANCE; local 263 /* Double the distance for each NUMA level */ 264 distance *= 2; 267 return distance; 319 * broken hierarchy, return with broken distance table 340 * Used to update distance information w.r.t newly added node. 365 * With FORM2 we expect NUMA distance of all possible NUMA 369 "NUMA distance details for node %d not provided\n", nid); 375 * ibm,numa-distance-table = { N, 1, 2, 4, 5, 1, 6, .... N elements} 397 form2_distances = of_get_property(root, "ibm,numa-distance [all...] |
/linux-master/drivers/infiniband/hw/hns/ |
H A D | hns_roce_hem.c | 1109 int distance; local 1130 distance = offset - r->offset; 1149 start_aligned = (distance / step) * step + r->offset;
|
/linux-master/drivers/net/ethernet/aquantia/atlantic/hw_atl/ |
H A D | hw_atl_utils.h | 132 u8 distance; member in struct:hw_atl_cable_diag
|
/linux-master/fs/xfs/ |
H A D | xfs_log_recover.c | 608 * <---------> less than scan distance 649 * <---------> less than scan distance 901 * Calculate distance from head to tail (i.e., unused space in the log). 1614 int distance; local 1623 * Figure out the distance between the new head of the log 1631 * so the distance from the head to the tail is the 1632 * distance from the head to the end of the log plus 1633 * the distance from the beginning of the log to the 1644 * so the distance from the head to the tail is just 1666 * we could have and the distance t [all...] |
/linux-master/drivers/cxl/core/ |
H A D | region.c | 1175 int distance) 1188 * then that endpoint, at index 'position - distance', must also be 1191 if (pos < distance) { 1197 cxled_peer = p->targets[pos - distance]; 1242 int i, distance; local 1245 * Passthrough decoders impose no distance requirements between 1249 distance = 0; 1251 distance = p->nr_targets / cxl_rr->nr_targets; 1255 distance); 1173 check_last_peer(struct cxl_endpoint_decoder *cxled, struct cxl_ep *ep, struct cxl_region_ref *cxl_rr, int distance) argument
|
/linux-master/tools/perf/bench/ |
H A D | numa.c | 1027 int distance; local 1107 distance = nr_max - nr_min; 1109 tprintf(" [%2d/%-2d]", distance, process_groups);
|
/linux-master/include/linux/ |
H A D | lockdep.h | 53 u16 distance; member in struct:lock_list
|
/linux-master/drivers/input/touchscreen/ |
H A D | atmel_mxt_ts.c | 930 int distance = 0; local 952 distance = MXT_DISTANCE_HOVERING; 962 distance = MXT_DISTANCE_ACTIVE_TOUCH; 1017 input_report_abs(input_dev, ABS_MT_DISTANCE, distance);
|
/linux-master/scripts/ |
H A D | checkpatch.pl | 690 # two dimensional array storing minimum edit distance 691 my @distance; 695 $distance[$i][$j] = $j; 697 $distance[$i][$j] = $i; 699 $distance[$i][$j] = $distance[$i - 1][$j - 1]; 701 my $dist1 = $distance[$i][$j - 1]; #insert distance 702 my $dist2 = $distance[$i - 1][$j]; # remove 703 my $dist3 = $distance[ [all...] |
/linux-master/fs/xfs/libxfs/ |
H A D | xfs_bmap.c | 3829 xfs_fileoff_t distance; local 3839 distance = bno - irec->br_startoff; 3844 irec->br_startblock += distance; 3845 irec->br_startoff += distance; 3846 irec->br_blockcount -= distance; 3850 distance = irec->br_startoff + irec->br_blockcount - end; 3851 irec->br_blockcount -= distance;
|
/linux-master/tools/perf/util/ |
H A D | machine.c | 2523 u64 cur_base, distance; local 2531 distance = (prev_stack->hw_idx > cur_base) ? (prev_stack->hw_idx - cur_base) : 2534 if (distance + 1 > prev_stack->nr) 2545 for (i = distance, j = cur_stack->nr - 1; (i >= 0) && (j >= 0); i--, j--) { 2561 for (i = prev_stack->nr - 1; i > (int)distance; i--) {
|
/linux-master/drivers/input/mouse/ |
H A D | alps.c | 485 int distance = dx * dx + dy * dy; local 487 if (distance < closest) { 489 closest = distance;
|
H A D | cyapa_gen5.c | 157 * 2 : significant displacement (> active distance) 181 * The distance, in surface units, between the contact and 2702 u8 distance = report_data->report_head[PIP_PROXIMITY_DISTANCE_OFFSET] & local 2705 input_report_abs(input, ABS_DISTANCE, distance);
|
/linux-master/drivers/hid/ |
H A D | wacom_wac.c | 410 /* Compute distance between mouse and tablet */ 902 unsigned int x, y, distance, t; local 940 distance = data[9] >> 2; 944 distance >>= 1; 947 distance = features->distance_max - distance; 950 input_report_abs(input, ABS_DISTANCE, distance); 3189 * Convert distance from out prox to distance from tablet. 3190 * distance wil [all...] |
/linux-master/drivers/scsi/bfa/ |
H A D | bfi.h | 1151 u32 distance; /* from swtich unit in meters */ member in struct:bfi_diag_dport_scn_testcomp_s
|
/linux-master/drivers/base/ |
H A D | node.c | 559 * at the most (distance + space or newline). 571 static DEVICE_ATTR(distance, 0444, node_read_distance, NULL);
|
/linux-master/arch/m68k/ifpsp060/src/ |
H A D | isp.S | 924 mov.w (tbl_ea_mode.b,%pc,%d0.w*2), %d0 # fetch jmp distance
|
/linux-master/drivers/net/ethernet/qlogic/qed/ |
H A D | qed_sriov.c | 3600 u32 prod, cons[MAX_NUM_EXT_VOQS], distance[MAX_NUM_EXT_VOQS], tmp; local 3609 memset(distance, 0, MAX_NUM_EXT_VOQS * sizeof(u32)); 3621 distance[voq] = prod - cons[voq]; 3638 if (distance[voq] > tmp - cons[voq])
|