• Home
  • Raw
  • Download

Lines Matching refs:i

188 	int i;  in lock_point()  local
190 for (i = 0; i < LOCKSTAT_POINTS; i++) { in lock_point()
191 if (points[i] == 0) { in lock_point()
192 points[i] = ip; in lock_point()
195 if (points[i] == ip) in lock_point()
199 return i; in lock_point()
232 int cpu, i; in lock_stats() local
239 for (i = 0; i < ARRAY_SIZE(stats.contention_point); i++) in lock_stats()
240 stats.contention_point[i] += pcs->contention_point[i]; in lock_stats()
242 for (i = 0; i < ARRAY_SIZE(stats.contending_point); i++) in lock_stats()
243 stats.contending_point[i] += pcs->contending_point[i]; in lock_stats()
251 for (i = 0; i < ARRAY_SIZE(stats.bounces); i++) in lock_stats()
252 stats.bounces[i] += pcs->bounces[i]; in lock_stats()
524 int i; in lockdep_stack_trace_count() local
526 for (i = 0; i < ARRAY_SIZE(stack_trace_hash); i++) { in lockdep_stack_trace_count()
527 hlist_for_each_entry(trace, &stack_trace_hash[i], hash_entry) { in lockdep_stack_trace_count()
539 int i; in lockdep_stack_hash_count() local
541 for (i = 0; i < ARRAY_SIZE(stack_trace_hash); i++) in lockdep_stack_hash_count()
542 if (!hlist_empty(&stack_trace_hash[i])) in lockdep_stack_hash_count()
619 int i = 0; in get_usage_chars() local
622 usage[i++] = get_usage_char(class, LOCK_USED_IN_##__STATE); \ in get_usage_chars()
623 usage[i++] = get_usage_char(class, LOCK_USED_IN_##__STATE##_READ); in get_usage_chars()
627 usage[i] = '\0'; in get_usage_chars()
697 int i, depth = READ_ONCE(p->lockdep_depth); in lockdep_print_held_locks() local
710 for (i = 0; i < depth; i++) { in lockdep_print_held_locks()
711 printk(" #%d: ", i); in lockdep_print_held_locks()
712 print_lock(p->held_locks + i); in lockdep_print_held_locks()
909 int i; in in_any_class_list() local
911 for (i = 0; i < ARRAY_SIZE(lock_classes); i++) { in in_any_class_list()
912 class = &lock_classes[i]; in in_any_class_list()
947 int i; in check_lock_chain_key() local
949 for (i = chain->base; i < chain->base + chain->depth; i++) in check_lock_chain_key()
950 chain_key = iterate_chain_key(chain_key, chain_hlocks[i]); in check_lock_chain_key()
969 int i; in in_any_zapped_class_list() local
971 for (i = 0, pf = delayed_free.pf; i < ARRAY_SIZE(delayed_free.pf); i++, pf++) { in in_any_zapped_class_list()
985 int i; in __check_data_structures() local
988 for (i = 0; i < ARRAY_SIZE(lock_classes); i++) { in __check_data_structures()
989 class = &lock_classes[i]; in __check_data_structures()
1000 for (i = 0; i < ARRAY_SIZE(lock_classes); i++) { in __check_data_structures()
1001 class = &lock_classes[i]; in __check_data_structures()
1009 for (i = 0; i < ARRAY_SIZE(chainhash_table); i++) { in __check_data_structures()
1010 head = chainhash_table + i; in __check_data_structures()
1021 for_each_set_bit(i, list_entries_in_use, ARRAY_SIZE(list_entries)) { in __check_data_structures()
1022 e = list_entries + i; in __check_data_structures()
1036 for_each_clear_bit(i, list_entries_in_use, ARRAY_SIZE(list_entries)) { in __check_data_structures()
1037 e = list_entries + i; in __check_data_structures()
1080 int i; in init_data_structures_once() local
1098 for (i = 0; i < ARRAY_SIZE(lock_classes); i++) { in init_data_structures_once()
1099 list_add_tail(&lock_classes[i].lock_entry, &free_lock_classes); in init_data_structures_once()
1100 INIT_LIST_HEAD(&lock_classes[i].locks_after); in init_data_structures_once()
1101 INIT_LIST_HEAD(&lock_classes[i].locks_before); in init_data_structures_once()
2386 int i; in check_deadlock() local
2388 for (i = 0; i < curr->lockdep_depth; i++) { in check_deadlock()
2389 prev = curr->held_locks + i; in check_deadlock()
2628 struct lock_class *lock_chain_get_class(struct lock_chain *chain, int i) in lock_chain_get_class() argument
2630 return lock_classes + chain_hlocks[chain->base + i]; in lock_chain_get_class()
2639 int i; in get_first_held_lock() local
2642 for (i = curr->lockdep_depth - 1; i >= 0; i--) { in get_first_held_lock()
2643 hlock_curr = curr->held_locks + i; in get_first_held_lock()
2649 return ++i; in get_first_held_lock()
2672 int i = get_first_held_lock(curr, hlock_next); in print_chain_keys_held_locks() local
2674 printk("depth: %u (irq_context %u)\n", depth - i + 1, in print_chain_keys_held_locks()
2676 for (; i < depth; i++) { in print_chain_keys_held_locks()
2677 hlock = curr->held_locks + i; in print_chain_keys_held_locks()
2689 int i; in print_chain_keys_chain() local
2694 for (i = 0; i < chain->depth; i++) { in print_chain_keys_chain()
2695 class_id = chain_hlocks[chain->base + i]; in print_chain_keys_chain()
2737 int i, j, id; in check_no_collision() local
2739 i = get_first_held_lock(curr, hlock); in check_no_collision()
2741 if (DEBUG_LOCKS_WARN_ON(chain->depth != curr->lockdep_depth - (i - 1))) { in check_no_collision()
2746 for (j = 0; j < chain->depth - 1; j++, i++) { in check_no_collision()
2747 id = curr->held_locks[i].class_idx; in check_no_collision()
2762 long lockdep_next_lockchain(long i) in lockdep_next_lockchain() argument
2764 i = find_next_bit(lock_chains_in_use, ARRAY_SIZE(lock_chains), i + 1); in lockdep_next_lockchain()
2765 return i < ARRAY_SIZE(lock_chains) ? i : -2; in lockdep_next_lockchain()
2799 int i, j; in add_chain_cache() local
2820 i = get_first_held_lock(curr, hlock); in add_chain_cache()
2821 chain->depth = curr->lockdep_depth + 1 - i; in add_chain_cache()
2829 for (j = 0; j < chain->depth - 1; j++, i++) { in add_chain_cache()
2830 int lock_id = curr->held_locks[i].class_idx; in add_chain_cache()
3000 unsigned int i; in check_chain_key() local
3003 for (i = 0; i < curr->lockdep_depth; i++) { in check_chain_key()
3004 hlock = curr->held_locks + i; in check_chain_key()
3012 curr->lockdep_depth, i, in check_chain_key()
3038 curr->lockdep_depth, i, in check_chain_key()
3345 int i; in mark_held_locks() local
3347 for (i = 0; i < curr->lockdep_depth; i++) { in mark_held_locks()
3349 hlock = curr->held_locks + i; in mark_held_locks()
3712 int i; in lockdep_init_map() local
3714 for (i = 0; i < NR_LOCKDEP_CACHING_CLASSES; i++) in lockdep_init_map()
3715 lock->class_cache[i] = NULL; in lockdep_init_map()
4052 int i; in find_held_lock() local
4054 i = depth - 1; in find_held_lock()
4055 hlock = curr->held_locks + i; in find_held_lock()
4061 for (i--, prev_hlock = hlock--; in find_held_lock()
4062 i >= 0; in find_held_lock()
4063 i--, prev_hlock = hlock--) { in find_held_lock()
4078 *idx = i; in find_held_lock()
4123 int i; in __lock_set_class() local
4136 hlock = find_held_lock(curr, lock, depth, &i); in __lock_set_class()
4146 curr->lockdep_depth = i; in __lock_set_class()
4149 if (reacquire_held_locks(curr, depth, i, &merged)) in __lock_set_class()
4166 int i; in __lock_downgrade() local
4179 hlock = find_held_lock(curr, lock, depth, &i); in __lock_downgrade()
4185 curr->lockdep_depth = i; in __lock_downgrade()
4192 if (reacquire_held_locks(curr, depth, i, &merged)) in __lock_downgrade()
4222 int i; in __lock_release() local
4241 hlock = find_held_lock(curr, lock, depth, &i); in __lock_release()
4270 curr->lockdep_depth = i; in __lock_release()
4277 if (i == depth-1) in __lock_release()
4280 if (reacquire_held_locks(curr, depth, i + 1, &merged)) in __lock_release()
4302 int i; in __lock_is_held() local
4304 for (i = 0; i < curr->lockdep_depth; i++) { in __lock_is_held()
4305 struct held_lock *hlock = curr->held_locks + i; in __lock_is_held()
4322 int i; in __lock_pin_lock() local
4327 for (i = 0; i < curr->lockdep_depth; i++) { in __lock_pin_lock()
4328 struct held_lock *hlock = curr->held_locks + i; in __lock_pin_lock()
4349 int i; in __lock_repin_lock() local
4354 for (i = 0; i < curr->lockdep_depth; i++) { in __lock_repin_lock()
4355 struct held_lock *hlock = curr->held_locks + i; in __lock_repin_lock()
4369 int i; in __lock_unpin_lock() local
4374 for (i = 0; i < curr->lockdep_depth; i++) { in __lock_unpin_lock()
4375 struct held_lock *hlock = curr->held_locks + i; in __lock_unpin_lock()
4622 int i, contention_point, contending_point; in __lock_contended() local
4632 hlock = find_held_lock(curr, lock, depth, &i); in __lock_contended()
4664 int i, cpu; in __lock_acquired() local
4674 hlock = find_held_lock(curr, lock, depth, &i); in __lock_acquired()
4754 int i; in lockdep_reset() local
4763 for (i = 0; i < CHAINHASH_SIZE; i++) in lockdep_reset()
4764 INIT_HLIST_HEAD(chainhash_table + i); in lockdep_reset()
4776 int i; in remove_class_from_lock_chain() local
4778 for (i = chain->base; i < chain->base + chain->depth; i++) { in remove_class_from_lock_chain()
4779 if (chain_hlocks[i] != class - lock_classes) in remove_class_from_lock_chain()
4783 memmove(&chain_hlocks[i], &chain_hlocks[i + 1], in remove_class_from_lock_chain()
4784 (chain->base + chain->depth - i) * in remove_class_from_lock_chain()
4798 for (i = chain->base; i < chain->base + chain->depth; i++) in remove_class_from_lock_chain()
4799 chain_key = iterate_chain_key(chain_key, chain_hlocks[i]); in remove_class_from_lock_chain()
4834 int i; in remove_class_from_lock_chains() local
4836 for (i = 0; i < ARRAY_SIZE(chainhash_table); i++) { in remove_class_from_lock_chains()
4837 head = chainhash_table + i; in remove_class_from_lock_chains()
4850 int i; in zap_class() local
4858 for_each_set_bit(i, list_entries_in_use, ARRAY_SIZE(list_entries)) { in zap_class()
4859 entry = list_entries + i; in zap_class()
4862 __clear_bit(i, list_entries_in_use); in zap_class()
4993 int i; in __lockdep_free_key_range() local
4996 for (i = 0; i < CLASSHASH_SIZE; i++) { in __lockdep_free_key_range()
4997 head = classhash_table + i; in __lockdep_free_key_range()
5077 int i, j; in lock_class_cache_is_registered() local
5079 for (i = 0; i < CLASSHASH_SIZE; i++) { in lock_class_cache_is_registered()
5080 head = classhash_table + i; in lock_class_cache_is_registered()
5284 int i; in debug_check_no_locks_freed() local
5290 for (i = 0; i < curr->lockdep_depth; i++) { in debug_check_no_locks_freed()
5291 hlock = curr->held_locks + i; in debug_check_no_locks_freed()