linux-master/kernel/kprobes.c

15  *		exceptions notifier to be first on the priority list.
77  * Blacklist -- list of 'struct kprobe_blacklist_entry' to store info where
90 	struct list_head list;
153 	list_for_each_entry_rcu(kip, &c->pages, list) {
187 	INIT_LIST_HEAD(&kip->list);
193 	list_add_rcu(&kip->list, &c->pages);
216 		if (!list_is_singular(&kip->list)) {
224 			list_del_rcu(&kip->list);
241 	list_for_each_entry_safe(kip, next, &c->pages, list) {
264 	list_for_each_entry_rcu(kip, &c->pages, list) {
302 	list_for_each_entry_rcu(kip, &c->pages, list) {
321 	list_for_each_entry_rcu(kip, &c->pages, list) {
404 	       list_empty(&p->list);
419  * Call all 'kprobe::pre_handler' on the list, but ignores its return value.
426 	list_for_each_entry_rcu(kp, &p->list, list) {
460 /* Return true if the kprobe is disarmed. Note: p must be on hash list */
471 	return kprobe_disabled(p) && list_empty(&op->list);
481 		if (!list_empty(&op->list))
510 /* Optimization staging list, protected by 'kprobe_mutex' */
561 	/* Loop on 'freeing_list' for disarming and removing from kprobe hash list */
562 	list_for_each_entry_safe(op, tmp, &freeing_list, list) {
570 			 * Remove unused probes from hash list. After waiting
576 			list_del_init(&op->list);
585 	list_for_each_entry_safe(op, tmp, &freeing_list, list) {
586 		list_del_init(&op->list);
590 			 * still in use, keep it on kprobes hash list.
667 	list_for_each_entry(_op, &unoptimizing_list, list) {
699 			list_del_init(&op->list);
709 	if (WARN_ON_ONCE(!list_empty(&op->list)))
712 	list_add(&op->list, &optimizing_list);
736 	if (!list_empty(&op->list)) {
742 				 * in the freeing list for release afterwards.
745 				list_move(&op->list, &freeing_list);
749 			list_del_init(&op->list);
760 		list_add(&op->list, &unoptimizing_list);
775 	WARN_ON_ONCE(list_empty(&op->list));
778 	/* Optimize it again. (remove from 'op->list') */
792 	if (!list_empty(&op->list))
794 		list_del_init(&op->list);
799 		 * Unused kprobe is on unoptimizing or freeing list. We move it
801 		 * the kprobe hash list and free it.
804 			list_move(&op->list, &freeing_list);
836 	INIT_LIST_HEAD(&op->list);
994 	optimize_kprobe(p);	/* Try to optimize (add kprobe to a list) */
1190  * take care of invoking the individual kprobe handlers on p->list
1196 	list_for_each_entry_rcu(kp, &p->list, list) {
1213 	list_for_each_entry_rcu(kp, &p->list, list) {
1223 /* Walks the list and increments 'nmissed' if 'p' has child probes. */
1231 		list_for_each_entry_rcu(kp, &p->list, list)
1257 /* Add the new probe to 'ap->list'. */
1263 	list_add_rcu(&p->list, &ap->list);
1286 	INIT_LIST_HEAD(&ap->list);
1289 	list_add_rcu(&p->list, &ap->list);
1365 				list_del_rcu(&p->list);
1390 	list_for_each_entry(ent, &kprobe_blacklist, list) {
1508 		list_for_each_entry(list_p, &ap->list, list)
1640 	INIT_LIST_HEAD(&p->list);
1699 	list_for_each_entry(kp, &ap->list, list)
1702 			 * Since there is an active probe on the list,
1764 		 * (not an aggrprobe). Remove from the hash list.
1771 	if (list_is_singular(&ap->list) && kprobe_disarmed(ap))
1780 			list_for_each_entry(list_p, &ap->list, list) {
1797 		list_del_rcu(&p->list);
1816 	if (list_empty(&p->list))
1819 	else if (list_is_singular(&p->list)) {
1821 		ap = list_entry(p->list.next, struct kprobe, list);
1822 		list_del(&p->list);
2375 		 * If this is an aggr_kprobe, we have to list all the
2378 		list_for_each_entry(kp, &p->list, list)
2469 	INIT_LIST_HEAD(&ent->list);
2470 	list_add_tail(&ent->list, &kprobe_blacklist);
2496 	list_for_each_entry_safe(ent, n, &kprobe_blacklist, list) {
2499 		list_del(&ent->list);
2702 	/* initialize all list heads */
2822 			list_for_each_entry_rcu(kp, &p->list, list)
2855 		list_entry(v, struct kprobe_blacklist_entry, list);
3023 	debugfs_create_file("list", 0400, dir, NULL, &kprobes_fops);