2 * Dynamic Binary Instrumentation Module based on KProbes
3 * modules/driver/sspt/sspt_file.c
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
19 * Copyright (C) Samsung Electronics, 2013
21 * 2013 Vyacheslav Cherkashin <v.cherkashin@samsung.com>
25 #include "sspt_file.h"
26 #include "sspt_page.h"
27 #include <linux/slab.h>
28 #include <linux/list.h>
29 #include <linux/hash.h>
31 static int calculation_hash_bits(int cnt)
34 for (bits = 1; cnt >>= 1; ++bits);
39 struct sspt_file *sspt_file_create(char *name, struct dentry *dentry, int page_cnt)
41 struct sspt_file *obj = kmalloc(sizeof(*obj), GFP_ATOMIC);
45 INIT_LIST_HEAD(&obj->list);
53 obj->page_probes_hash_bits = calculation_hash_bits(page_cnt);//PAGE_PROBES_HASH_BITS;
54 table_size = (1 << obj->page_probes_hash_bits);
56 obj->page_probes_table = kmalloc(sizeof(*obj->page_probes_table)*table_size, GFP_ATOMIC);
58 for (i = 0; i < table_size; ++i) {
59 INIT_HLIST_HEAD(&obj->page_probes_table[i]);
66 void sspt_file_free(struct sspt_file *file)
68 struct hlist_node *p, *n;
69 struct hlist_head *head;
70 struct sspt_page *page;
71 int i, table_size = (1 << file->page_probes_hash_bits);
73 for (i = 0; i < table_size; ++i) {
74 head = &file->page_probes_table[i];
75 hlist_for_each_entry_safe(page, p, n, head, hlist) {
76 hlist_del(&page->hlist);
81 kfree(file->page_probes_table);
85 static void sspt_add_page(struct sspt_file *file, struct sspt_page *page)
88 hlist_add_head(&page->hlist, &file->page_probes_table[hash_ptr((void *)page->offset,
89 file->page_probes_hash_bits)]);
92 struct sspt_file *sspt_file_copy(const struct sspt_file *file)
94 struct sspt_file *file_out;
97 printk("### WARNING: file_p == NULL\n");
101 file_out = kmalloc(sizeof(*file_out), GFP_ATOMIC);
103 struct sspt_page *page = NULL;
104 struct hlist_node *node = NULL;
105 struct hlist_head *head = NULL;
107 INIT_LIST_HEAD(&file_out->list);
108 file_out->procs = NULL;
109 file_out->dentry = file->dentry;
110 file_out->name = file->name;
111 file_out->loaded = 0;
112 file_out->vm_start = 0;
113 file_out->vm_end = 0;
115 file_out->page_probes_hash_bits = file->page_probes_hash_bits;
116 table_size = (1 << file_out->page_probes_hash_bits);
118 file_out->page_probes_table =
119 kmalloc(sizeof(*file_out->page_probes_table)*table_size, GFP_ATOMIC);
121 for (i = 0; i < table_size; ++i) {
122 INIT_HLIST_HEAD(&file_out->page_probes_table[i]);
126 for (i = 0; i < table_size; ++i) {
127 head = &file->page_probes_table[i];
128 hlist_for_each_entry(page, node, head, hlist) {
129 sspt_add_page(file_out, sspt_page_copy(page));
137 static struct sspt_page *sspt_find_page(struct sspt_file *file, unsigned long offset)
139 struct hlist_node *node;
140 struct hlist_head *head;
141 struct sspt_page *page;
143 head = &file->page_probes_table[hash_ptr((void *)offset, file->page_probes_hash_bits)];
144 hlist_for_each_entry(page, node, head, hlist) {
145 if (page->offset == offset) {
153 static struct sspt_page *sspt_find_page_or_new(struct sspt_file *file, unsigned long offset)
155 struct sspt_page *page = sspt_find_page(file, offset);
158 page = sspt_page_create(offset);
159 sspt_add_page(file, page);
165 struct sspt_page *sspt_find_page_mapped(struct sspt_file *file, unsigned long page)
167 unsigned long offset;
169 if (file->vm_start > page || file->vm_end < page) {
171 printk("ERROR: file_p[vm_start..vm_end] <> page: file_p[vm_start=%lx, vm_end=%lx, path=%s, d_iname=%s] page=%lx\n",
172 file->vm_start, file->vm_end, file->name, file->dentry->d_iname, page);
176 offset = page - file->vm_start;
178 return sspt_find_page(file, offset);
181 void sspt_file_add_ip(struct sspt_file *file, struct ip_data *ip_d)
183 unsigned long offset = ip_d->offset & PAGE_MASK;
184 struct sspt_page *page = sspt_find_page_or_new(file, offset);
187 struct us_ip *ip = create_ip_by_ip_data(ip_d);
189 sspt_add_ip(page, ip);
192 struct sspt_page *sspt_get_page(struct sspt_file *file, unsigned long offset_addr)
194 unsigned long offset = offset_addr & PAGE_MASK;
195 struct sspt_page *page = sspt_find_page_or_new(file, offset);
197 spin_lock(&page->lock);
202 void sspt_put_page(struct sspt_page *page)
204 spin_unlock(&page->lock);