Home
last modified time | relevance | path

Searched refs:j (Results 1 – 25 of 41) sorted by relevance

12

/kernel/
Drange.c67 int i, j; in subtract_range() local
72 for (j = 0; j < az; j++) { in subtract_range()
73 if (!range[j].end) in subtract_range()
76 if (start <= range[j].start && end >= range[j].end) { in subtract_range()
77 range[j].start = 0; in subtract_range()
78 range[j].end = 0; in subtract_range()
82 if (start <= range[j].start && end < range[j].end && in subtract_range()
83 range[j].start < end) { in subtract_range()
84 range[j].start = end; in subtract_range()
89 if (start > range[j].start && end >= range[j].end && in subtract_range()
[all …]
Dprofile.c257 int i, j, cpu; in profile_flip_buffers() local
260 j = per_cpu(cpu_profile_flip, get_cpu()); in profile_flip_buffers()
264 struct profile_hit *hits = per_cpu(cpu_profile_hits, cpu)[j]; in profile_flip_buffers()
296 int i, j, cpu; in do_profile_hits() local
315 for (j = 0; j < PROFILE_GRPSZ; ++j) { in do_profile_hits()
316 if (hits[i + j].pc == pc) { in do_profile_hits()
317 hits[i + j].hits += nr_hits; in do_profile_hits()
319 } else if (!hits[i + j].hits) { in do_profile_hits()
320 hits[i + j].pc = pc; in do_profile_hits()
321 hits[i + j].hits = nr_hits; in do_profile_hits()
Dkexec_file.c690 int ret = 0, i, j, zero_buf_sz, sha_region_sz; in kexec_calculate_store_digests() local
735 for (j = i = 0; i < image->nr_segments; i++) { in kexec_calculate_store_digests()
770 sha_regions[j].start = ksegment->mem; in kexec_calculate_store_digests()
771 sha_regions[j].len = ksegment->memsz; in kexec_calculate_store_digests()
772 j++; in kexec_calculate_store_digests()
1166 int i, j; in crash_exclude_mem_range() local
1191 for (j = i; j < mem->nr_ranges - 1; j++) { in crash_exclude_mem_range()
1192 mem->ranges[j].start = in crash_exclude_mem_range()
1193 mem->ranges[j+1].start; in crash_exclude_mem_range()
1194 mem->ranges[j].end = in crash_exclude_mem_range()
[all …]
Daudit_tree.c296 int i, j; in replace_chunk() local
302 for (i = j = 0; j < old->count; i++, j++) { in replace_chunk()
303 if (!old->owners[j].owner) { in replace_chunk()
307 owner = old->owners[j].owner; in replace_chunk()
309 new->owners[i].index = old->owners[j].index - j + i; in replace_chunk()
313 list_replace_init(&old->owners[j].list, &new->owners[i].list); in replace_chunk()
Dkexec_core.c188 unsigned long j; in sanity_check_segment_list() local
192 for (j = 0; j < i; j++) { in sanity_check_segment_list()
195 pstart = image->segment[j].mem; in sanity_check_segment_list()
196 pend = pstart + image->segment[j].memsz; in sanity_check_segment_list()
Dscftorture.c246 int j; in scf_handler() local
271 for (j = 0; j < 1000; j++) { in scf_handler()
/kernel/rcu/
Dtree_stall.h63 unsigned long j = jiffies; in rcu_gp_might_be_stalled() local
74 return !time_before(j, READ_ONCE(rcu_state.gp_start) + d); in rcu_gp_might_be_stalled()
136 unsigned long j = jiffies; in record_gp_stall_check_time() local
139 WRITE_ONCE(rcu_state.gp_start, j); in record_gp_stall_check_time()
142 WRITE_ONCE(rcu_state.jiffies_stall, j + j1); in record_gp_stall_check_time()
143 rcu_state.jiffies_resched = j + j1 / 2; in record_gp_stall_check_time()
161 unsigned long j; in rcu_stall_kick_kthreads() local
165 j = READ_ONCE(rcu_state.jiffies_kick_kthreads); in rcu_stall_kick_kthreads()
166 if (time_after(jiffies, j) && rcu_state.gp_kthread && in rcu_stall_kick_kthreads()
172 WRITE_ONCE(rcu_state.jiffies_kick_kthreads, j + HZ); in rcu_stall_kick_kthreads()
[all …]
Dupdate.c373 int j; in __wait_rcu_gp() local
382 for (j = 0; j < i; j++) in __wait_rcu_gp()
383 if (crcu_array[j] == crcu_array[i]) in __wait_rcu_gp()
385 if (j == i) { in __wait_rcu_gp()
397 for (j = 0; j < i; j++) in __wait_rcu_gp()
398 if (crcu_array[j] == crcu_array[i]) in __wait_rcu_gp()
400 if (j == i) { in __wait_rcu_gp()
Drcu_segcblist.c392 int i, j; in rcu_segcblist_advance() local
413 for (j = RCU_WAIT_TAIL; j < i; j++) in rcu_segcblist_advance()
414 WRITE_ONCE(rsclp->tails[j], rsclp->tails[RCU_DONE_TAIL]); in rcu_segcblist_advance()
422 for (j = RCU_WAIT_TAIL; i < RCU_NEXT_TAIL; i++, j++) { in rcu_segcblist_advance()
423 if (rsclp->tails[j] == rsclp->tails[RCU_NEXT_TAIL]) in rcu_segcblist_advance()
425 WRITE_ONCE(rsclp->tails[j], rsclp->tails[i]); in rcu_segcblist_advance()
426 rsclp->gp_seq[j] = rsclp->gp_seq[i]; in rcu_segcblist_advance()
Dtree.c510 unsigned long j; in adjust_jiffies_till_sched_qs() local
518 j = READ_ONCE(jiffies_till_first_fqs) + in adjust_jiffies_till_sched_qs()
520 if (j < HZ / 10 + nr_cpu_ids / RCU_JIFFIES_FQS_DIV) in adjust_jiffies_till_sched_qs()
521 j = HZ / 10 + nr_cpu_ids / RCU_JIFFIES_FQS_DIV; in adjust_jiffies_till_sched_qs()
522 pr_info("RCU calculated value of scheduler-enlistment delay is %ld jiffies.\n", j); in adjust_jiffies_till_sched_qs()
523 WRITE_ONCE(jiffies_to_sched_qs, j); in adjust_jiffies_till_sched_qs()
528 ulong j; in param_set_first_fqs_jiffies() local
529 int ret = kstrtoul(val, 0, &j); in param_set_first_fqs_jiffies()
532 WRITE_ONCE(*(ulong *)kp->arg, (j > HZ) ? HZ : j); in param_set_first_fqs_jiffies()
540 ulong j; in param_set_next_fqs_jiffies() local
[all …]
Drcuscale.c657 int j; in rcu_scale_cleanup() local
698 j = writer_n_durations[i]; in rcu_scale_cleanup()
700 scale_type, SCALE_FLAG, i, j); in rcu_scale_cleanup()
701 ngps += j; in rcu_scale_cleanup()
719 for (j = 0; j < writer_n_durations[i]; j++) { in rcu_scale_cleanup()
720 wdp = &wdpp[j]; in rcu_scale_cleanup()
723 i, j, *wdp); in rcu_scale_cleanup()
724 if (j % 100 == 0) in rcu_scale_cleanup()
Dtree_plugin.h1690 unsigned long j) in rcu_nocb_do_flush_bypass() argument
1706 WRITE_ONCE(rdp->nocb_bypass_first, j); in rcu_nocb_do_flush_bypass()
1720 unsigned long j) in rcu_nocb_flush_bypass() argument
1726 return rcu_nocb_do_flush_bypass(rdp, rhp, j); in rcu_nocb_flush_bypass()
1733 static void rcu_nocb_try_flush_bypass(struct rcu_data *rdp, unsigned long j) in rcu_nocb_try_flush_bypass() argument
1739 WARN_ON_ONCE(!rcu_nocb_do_flush_bypass(rdp, NULL, j)); in rcu_nocb_try_flush_bypass()
1765 unsigned long j = jiffies; in rcu_nocb_try_bypass() local
1784 if (j == rdp->nocb_nobypass_last) { in rcu_nocb_try_bypass()
1787 WRITE_ONCE(rdp->nocb_nobypass_last, j); in rcu_nocb_try_bypass()
1806 WARN_ON_ONCE(!rcu_nocb_flush_bypass(rdp, NULL, j)); in rcu_nocb_try_bypass()
[all …]
Drcutorture.c1353 int j; in rcutorture_loop_extend() local
1362 for (j = 0; j < i; j++) { in rcutorture_loop_extend()
1364 rcutorture_one_extend(readstate, mask, trsp, &rtrsp[j]); in rcutorture_loop_extend()
1366 return &rtrsp[j]; in rcutorture_loop_extend()
1836 int j; in rcu_torture_fwd_cb_hist() local
1844 for (j = 0; j <= i; j++) { in rcu_torture_fwd_cb_hist()
1845 gps = rfp->n_launders_hist[j].launder_gp_seq; in rcu_torture_fwd_cb_hist()
1847 j + 1, FWD_CBS_HIST_DIV, in rcu_torture_fwd_cb_hist()
1848 rfp->n_launders_hist[j].n_launders, in rcu_torture_fwd_cb_hist()
/kernel/sched/
Dtopology.c1460 int i,j; in sched_numa_warn() local
1471 for (j = 0; j < nr_node_ids; j++) in sched_numa_warn()
1472 printk(KERN_CONT "%02d ", node_distance(i,j)); in sched_numa_warn()
1553 int i, j; in sched_init_numa() local
1565 for (j = 0; j < nr_node_ids; j++) { in sched_init_numa()
1566 int distance = node_distance(i, j); in sched_init_numa()
1588 for (i = 0, j = 0; i < nr_levels; i++, j++) { in sched_init_numa()
1589 j = find_next_bit(distance_map, NR_DISTANCE_VALUES, j); in sched_init_numa()
1590 sched_domains_numa_distance[i] = j; in sched_init_numa()
1627 for (j = 0; j < nr_node_ids; j++) { in sched_init_numa()
[all …]
/kernel/time/
Dtimer.c280 static unsigned long round_jiffies_common(unsigned long j, int cpu, in round_jiffies_common() argument
284 unsigned long original = j; in round_jiffies_common()
294 j += cpu * 3; in round_jiffies_common()
296 rem = j % HZ; in round_jiffies_common()
306 j = j - rem; in round_jiffies_common()
308 j = j - rem + HZ; in round_jiffies_common()
311 j -= cpu * 3; in round_jiffies_common()
317 return time_is_after_jiffies(j) ? j : original; in round_jiffies_common()
340 unsigned long __round_jiffies(unsigned long j, int cpu) in __round_jiffies() argument
342 return round_jiffies_common(j, cpu, false); in __round_jiffies()
[all …]
Dtime.c374 unsigned int jiffies_to_msecs(const unsigned long j) in jiffies_to_msecs() argument
377 return (MSEC_PER_SEC / HZ) * j; in jiffies_to_msecs()
379 return (j + (HZ / MSEC_PER_SEC) - 1)/(HZ / MSEC_PER_SEC); in jiffies_to_msecs()
382 return (HZ_TO_MSEC_MUL32 * j + (1ULL << HZ_TO_MSEC_SHR32) - 1) >> in jiffies_to_msecs()
385 return DIV_ROUND_UP(j * HZ_TO_MSEC_NUM, HZ_TO_MSEC_DEN); in jiffies_to_msecs()
391 unsigned int jiffies_to_usecs(const unsigned long j) in jiffies_to_usecs() argument
400 return (USEC_PER_SEC / HZ) * j; in jiffies_to_usecs()
403 return (HZ_TO_USEC_MUL32 * j) >> HZ_TO_USEC_SHR32; in jiffies_to_usecs()
405 return (j * HZ_TO_USEC_NUM) / HZ_TO_USEC_DEN; in jiffies_to_usecs()
691 u64 jiffies64_to_nsecs(u64 j) in jiffies64_to_nsecs() argument
[all …]
/kernel/irq/
Dproc.c465 int i = *(loff_t *) v, j; in show_interrupts() local
477 for (prec = 3, j = 1000; prec < 10 && j <= nr_irqs; ++prec) in show_interrupts()
478 j *= 10; in show_interrupts()
481 for_each_online_cpu(j) in show_interrupts()
482 seq_printf(p, "CPU%-8d", j); in show_interrupts()
492 for_each_online_cpu(j) in show_interrupts()
493 any_count |= *per_cpu_ptr(desc->kstat_irqs, j); in show_interrupts()
499 for_each_online_cpu(j) in show_interrupts()
501 *per_cpu_ptr(desc->kstat_irqs, j) : 0); in show_interrupts()
/kernel/trace/
Dtrace_probe_tmpl.h225 int i, j; in print_probe_args() local
238 for (j = 0; j < a->count; j++) { in print_probe_args()
241 trace_seq_putc(s, j == a->count - 1 ? '}' : ','); in print_probe_args()
Dtrace_probe.c846 int i, j; in __set_print_fmt() local
866 for (j = 1; j < parg->count; j++) in __set_print_fmt()
885 for (j = 0; j < parg->count; j++) in __set_print_fmt()
887 fmt, parg->name, j); in __set_print_fmt()
/kernel/bpf/
Dverifier.c670 int j; in print_verifier_state() local
672 for (j = 0; j < BPF_REG_SIZE; j++) { in print_verifier_state()
673 if (state->stack[i].slot_type[j] != STACK_INVALID) in print_verifier_state()
675 types_buf[j] = slot_type_char[ in print_verifier_state()
676 state->stack[i].slot_type[j]]; in print_verifier_state()
2027 int i, j; in mark_all_scalars_precise() local
2038 for (j = 0; j < BPF_REG_FP; j++) { in mark_all_scalars_precise()
2039 reg = &func->regs[j]; in mark_all_scalars_precise()
2044 for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) { in mark_all_scalars_precise()
2045 if (!is_spilled_reg(&func->stack[j])) in mark_all_scalars_precise()
[all …]
Dpercpu_freelist.c105 unsigned int cpu, cpu_idx, i, j, n, m; in pcpu_freelist_populate() local
113 j = n + (cpu_idx < m ? 1 : 0); in pcpu_freelist_populate()
114 for (i = 0; i < j; i++) { in pcpu_freelist_populate()
Dbpf_struct_ops.c108 u32 i, j; in bpf_struct_ops_init() local
155 for_each_member(j, t, member) { in bpf_struct_ops_init()
177 &st_ops->func_models[j])) { in bpf_struct_ops_init()
184 if (j == btf_type_vlen(t)) { in bpf_struct_ops_init()
/kernel/locking/
Dlocktorture.c836 int i, j; in lock_torture_init() local
1009 for (i = 0, j = 0; i < cxt.nrealwriters_stress || in lock_torture_init()
1010 j < cxt.nrealreaders_stress; i++, j++) { in lock_torture_init()
1021 if (cxt.cur_ops->readlock == NULL || (j >= cxt.nrealreaders_stress)) in lock_torture_init()
1024 firsterr = torture_create_kthread(lock_torture_reader, &cxt.lrsa[j], in lock_torture_init()
1025 reader_tasks[j]); in lock_torture_init()
Dlockdep.c3500 int i, j, id; in check_no_collision() local
3509 for (j = 0; j < chain->depth - 1; j++, i++) { in check_no_collision()
3512 if (DEBUG_LOCKS_WARN_ON(chain_hlocks[chain->base + j] != id)) { in check_no_collision()
3561 int i, j; in add_chain_cache() local
3589 j = alloc_chain_hlocks(chain->depth); in add_chain_cache()
3590 if (j < 0) { in add_chain_cache()
3599 chain->base = j; in add_chain_cache()
3600 for (j = 0; j < chain->depth - 1; j++, i++) { in add_chain_cache()
3603 chain_hlocks[chain->base + j] = lock_id; in add_chain_cache()
3605 chain_hlocks[chain->base + j] = hlock_id(hlock); in add_chain_cache()
[all …]
/kernel/power/
Dsnapshot.c2069 int j; in pack_pfns() local
2071 for (j = 0; j < PAGE_SIZE / sizeof(long); j++) { in pack_pfns()
2072 buf[j] = memory_bm_next_pfn(bm); in pack_pfns()
2073 if (unlikely(buf[j] == BM_END_OF_MAP)) in pack_pfns()
2218 int j; in unpack_orig_pfns() local
2220 for (j = 0; j < PAGE_SIZE / sizeof(long); j++) { in unpack_orig_pfns()
2221 if (unlikely(buf[j] == BM_END_OF_MAP)) in unpack_orig_pfns()
2224 if (pfn_valid(buf[j]) && memory_bm_pfn_present(bm, buf[j])) in unpack_orig_pfns()
2225 memory_bm_set_bit(bm, buf[j]); in unpack_orig_pfns()

12