/linux-master/fs/xfs/scrub/ |
H A D | dabtree.h | 25 xfs_dablk_t lowest; member in struct:xchk_da_btree
|
H A D | dabtree.c | 134 if (blkno < ds->lowest || (ds->highest != 0 && blkno >= ds->highest)) { 502 ds->lowest = 0; 506 ds->lowest = ds->dargs.geo->leafblk; 509 blkno = ds->lowest; 518 * We didn't find a block at ds->lowest, which means that there's
|
/linux-master/arch/x86/kvm/ |
H A D | irq_comm.c | 51 struct kvm_vcpu *vcpu, *lowest = NULL; local 60 pr_info("apic: phys broadcast and lowest prio\n"); 80 if (!lowest) 81 lowest = vcpu; 82 else if (kvm_apic_compare_prio(vcpu, lowest) < 0) 83 lowest = vcpu; 95 lowest = kvm_get_vcpu(kvm, idx); 98 if (lowest) 99 r = kvm_apic_set_irq(lowest, irq, dest_map);
|
H A D | lapic.c | 1150 int i, lowest; local 1182 lowest = -1; 1186 if (lowest < 0) 1187 lowest = i; 1189 (*dst)[lowest]->vcpu) < 0) 1190 lowest = i; 1196 lowest = kvm_vector_to_index(irq->vector, hweight16(*bitmap), 1199 if (!(*dst)[lowest]) { 1206 *bitmap = (lowest >= 0) ? 1 << lowest [all...] |
/linux-master/drivers/gpu/drm/sun4i/ |
H A D | sun4i_rgb.c | 70 unsigned long long lowest, highest; local 125 lowest = rate * (1000 - SUN4I_RGB_DOTCLOCK_TOLERANCE_PER_MILLE); 126 do_div(lowest, 1000); 127 if (rounded_rate < lowest)
|
/linux-master/arch/x86/platform/uv/ |
H A D | uv_time.c | 173 u64 lowest = ULLONG_MAX; local 179 if (exp < lowest) { 181 lowest = exp; 187 if (uv_setup_intr(c, lowest))
|
/linux-master/drivers/sh/clk/ |
H A D | core.c | 94 unsigned long highest, lowest, freq; local 99 lowest = ~0UL; 104 if (freq < lowest) 105 lowest = freq; 119 if (rounder->rate <= lowest) 120 rate_best_fit = lowest;
|
/linux-master/drivers/hwtracing/intel_th/ |
H A D | core.c | 106 int i, lowest; local 121 for (i = 0, lowest = -1; i < th->num_thdevs; i++) { 128 if (lowest >= 0) { 129 th->thdev[lowest] = th->thdev[i]; 131 ++lowest; 137 if (lowest == -1) 138 lowest = i; 144 if (lowest >= 0) 145 th->num_thdevs = lowest;
|
/linux-master/tools/power/x86/x86_energy_perf_policy/ |
H A D | x86_energy_perf_policy.c | 40 unsigned char lowest; member in struct:msr_hwp_cap 181 * All others leave it at cap.lowest 199 * "power" changes hwp_max to cap.lowest 775 cap->lowest, cap->efficient, cap->guaranteed, cap->highest); 786 cap->lowest = msr_perf_2_ratio(HWP_LOWEST_PERF(msr)); 1041 if (req->hwp_max < cap->lowest) 1042 errx(1, "cpu%d: requested max %d < capabilities lowest %d, use --force?", 1043 cpu, req->hwp_max, cap->lowest); 1050 if (req->hwp_min < cap->lowest) 1051 errx(1, "cpu%d: requested min %d < capabilities lowest [all...] |
/linux-master/arch/arm/mach-sa1100/ |
H A D | sleep.S | 53 @ delay 90us and set CPU PLL to lowest speed
|
/linux-master/drivers/pinctrl/nomadik/ |
H A D | pinctrl-abx500.c | 949 unsigned int lowest = 0; local 971 lowest = gstart; 974 if (gstart < lowest) 975 lowest = gstart; 981 npins = highest - lowest + 1;
|
/linux-master/drivers/hwmon/ |
H A D | ltc4282.c | 660 long lowest, long highest, u32 fs) 666 tmp = DIV_ROUND_CLOSEST(U16_MAX * lowest, fs); 682 long lowest, long highest, u32 fs) 685 return __ltc4282_in_write_history(st, reg, lowest, highest, fs); 811 long lowest = st->vfs_out; local 815 lowest = st->vdd; 820 lowest, 0, st->vfs_out); 825 st->in0_1_cache[channel].in_lowest = lowest; 659 __ltc4282_in_write_history(const struct ltc4282_state *st, u32 reg, long lowest, long highest, u32 fs) argument 681 ltc4282_in_write_history(struct ltc4282_state *st, u32 reg, long lowest, long highest, u32 fs) argument
|
/linux-master/arch/sparc/kernel/ |
H A D | iommu.c | 172 int lowest = iommu->ctx_lowest_free; local 173 int n = find_next_zero_bit(iommu->ctx_bitmap, IOMMU_NUM_CTXS, lowest); 176 n = find_next_zero_bit(iommu->ctx_bitmap, lowest, 1); 177 if (unlikely(n == lowest)) {
|
/linux-master/arch/arm/lib/ |
H A D | findbit.S | 114 and r3, r3, r0 @ mask out lowest bit set
|
/linux-master/fs/btrfs/ |
H A D | backref.h | 341 unsigned int lowest:1; member in struct:btrfs_backref_node
|
H A D | relocation.c | 408 /* The node is the lowest node */ 409 if (cur->lowest) { 411 cur->lowest = 0; 493 node->lowest = 1; 587 new_node->lowest = node->lowest; 592 if (!node->lowest) { 610 if (!new_node->lowest) { 1471 * walk down reloc tree to find relocated block of lowest level 2405 struct btrfs_path *path, int lowest) 2401 do_relocation(struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_backref_node *node, struct btrfs_key *key, struct btrfs_path *path, int lowest) argument [all...] |
H A D | ctree.c | 1436 * lowest_unlock sets the lowest level in the tree we're allowed to unlock. so 1781 * Replace the extent buffer at the lowest level of the path with a cloned 1796 struct extent_buffer *lowest = path->nodes[i]; local 1801 if (!lowest) 1804 lockdep_assert_held_read(&lowest->fs_info->commit_root_sem); 1806 clone = btrfs_clone_extent_buffer(lowest); 1827 * (struct btrfs_key_ptr) refers to the lowest key accessible from the 2399 * the lowest, leftmost, key in the tree. We're done. 3102 * min slot controls the lowest index we're willing to push to the 4649 /* at the lowest leve [all...] |
H A D | backref.c | 3135 * be the lowest node in the cache or a detached node. 3146 BUG_ON(!node->lowest && !node->detached); 3161 upper->lowest = 1; 3646 if (upper->lowest) { 3648 upper->lowest = 0;
|
/linux-master/drivers/md/dm-vdo/indexer/ |
H A D | volume.c | 1356 u64 lowest = BAD_CHAPTER; local 1366 * middle. Wherever it is, the highest and lowest VCNs are adjacent to it. Otherwise the 1368 * precedes the lowest one. 1378 * the end it means that chapter 0 has the lowest vcn. 1412 /* If left_chapter goes off the end, chapter 0 has the lowest virtual chapter number.*/ 1416 /* At this point, left_chapter is the chapter with the lowest virtual chapter number. */ 1417 probe_chapter(volume, left_chapter, &lowest); 1419 /* The moved chapter might be the lowest in the range. */ 1420 if ((moved_chapter != BAD_CHAPTER) && (lowest == geometry->remapped_virtual + 1)) 1421 lowest [all...] |
H A D | index.c | 1078 u64 lowest; local 1084 result = uds_find_volume_chapter_boundaries(index->volume, &lowest, &highest, 1099 index->oldest_virtual_chapter = lowest;
|
/linux-master/fs/ocfs2/dlm/ |
H A D | dlmmaster.c | 1084 /* my node number is lowest. 1237 int lowest = find_first_bit(mle->maybe_map, local 1243 if (node == lowest) { 1247 lowest = find_next_bit(mle->maybe_map, 1249 lowest+1); 1250 if (lowest < O2NM_MAX_NODES) { 1256 lowest); 1814 mlog(0, "%u is the lowest node, "
|
/linux-master/fs/xfs/libxfs/ |
H A D | xfs_bmap.c | 1255 * lowest-address hole if the fork has holes, else the first block past the end 1270 xfs_fileoff_t lowest, max; local 1284 lowest = max = *first_unused; 1289 if (got.br_startoff >= lowest + len && 1293 max = XFS_FILEOFF_MAX(lastaddr, lowest);
|
/linux-master/drivers/net/ethernet/sun/ |
H A D | niu.c | 8622 static int count_10g_ports(struct phy_probe_info *p, int *lowest) argument 8627 *lowest = 32; 8631 *lowest = port; 8639 static int count_1g_ports(struct phy_probe_info *p, int *lowest) argument 8641 *lowest = 32; 8643 *lowest = p->phy_port[PHY_TYPE_MII][0];
|
/linux-master/drivers/nvme/host/ |
H A D | pci.c | 1418 static void nvme_free_queues(struct nvme_dev *dev, int lowest) argument 1422 for (i = dev->ctrl.queue_count - 1; i >= lowest; i--) { 2901 * lowest idle power with quick resume latency on 3192 * use host managed nvme power settings for lowest idle power if
|