gh0s7/mckernel
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

add log print for existing processes/threads

Browse Source 
usage: ihkosctl 0 ioctl 40000000 [1-4]
1: print for existing processes
2: print for existing threads
3: print for existing processes without process lock
4: print for existing threads without thread lock
This commit is contained in:
Tomoki Shirasawa
2017-06-11 15:12:12 +09:00
parent 58e531eb58
commit 7773c4aef6
1 changed files with 14 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
kernel/process.c
View File

@@ -3224,7 +3224,6 @@ process_unlock(struct process *proc, struct mcs_rwlock_node_irqsave *lock)
void void
debug_log(unsigned long arg) debug_log(unsigned long arg)
{ {
#if 0
struct process *p; struct process *p;
struct thread *t; struct thread *t;
int i; int i;
@@ -3232,50 +3231,59 @@ debug_log(unsigned long arg)
struct resource_set *rset = cpu_local_var(resource_set); struct resource_set *rset = cpu_local_var(resource_set);
struct process_hash *phash = rset->process_hash; struct process_hash *phash = rset->process_hash;
struct thread_hash *thash = rset->thread_hash; struct thread_hash *thash = rset->thread_hash;
struct process *pid1 = rset->pid1;
int found = 0;
switch(arg){ switch(arg){
case 1: case 1:
for(i = 0; i < HASH_SIZE; i++){ for(i = 0; i < HASH_SIZE; i++){
__mcs_rwlock_reader_lock(&phash->lock[i], &lock); __mcs_rwlock_reader_lock(&phash->lock[i], &lock);
list_for_each_entry(p, &phash->list[i], hash_list){ list_for_each_entry(p, &phash->list[i], hash_list){
if (p == pid1)
continue;
found++;
kprintf("pid=%d ppid=%d status=%d\n", kprintf("pid=%d ppid=%d status=%d\n",
p->pid, p->ppid_parent->pid, p->status); p->pid, p->ppid_parent->pid, p->status);
} }
__mcs_rwlock_reader_unlock(&phash->lock[i], &lock); __mcs_rwlock_reader_unlock(&phash->lock[i], &lock);
} }
kprintf("%d processes are found.\n", found);
break; break;
case 2: case 2:
for(i = 0; i < HASH_SIZE; i++){ for(i = 0; i < HASH_SIZE; i++){
__mcs_rwlock_reader_lock(&thash->lock[i], &lock); __mcs_rwlock_reader_lock(&thash->lock[i], &lock);
list_for_each_entry(t, &thash->list[i], hash_list){ list_for_each_entry(t, &thash->list[i], hash_list){
found++;
kprintf("cpu=%d pid=%d tid=%d status=%d offload=%d\n", kprintf("cpu=%d pid=%d tid=%d status=%d offload=%d\n",
t->cpu_id, t->proc->pid, t->tid, t->cpu_id, t->proc->pid, t->tid,
t->status, t->in_syscall_offload); t->status, t->in_syscall_offload);
} }
__mcs_rwlock_reader_unlock(&thash->lock[i], &lock); __mcs_rwlock_reader_unlock(&thash->lock[i], &lock);
} }
kprintf("%d threads are found.\n", found);
break; break;
case 3: case 3:
for(i = 0; i < HASH_SIZE; i++){ for(i = 0; i < HASH_SIZE; i++){
if(phash->lock[i].node)
kprintf("phash[i] is locked\n");
list_for_each_entry(p, &phash->list[i], hash_list){ list_for_each_entry(p, &phash->list[i], hash_list){
if (p == pid1)
continue;
found++;
kprintf("pid=%d ppid=%d status=%d\n", kprintf("pid=%d ppid=%d status=%d\n",
p->pid, p->ppid_parent->pid, p->status); p->pid, p->ppid_parent->pid, p->status);
} }
} }
kprintf("%d processes are found.\n", found);
break; break;
case 4: case 4:
for(i = 0; i < HASH_SIZE; i++){ for(i = 0; i < HASH_SIZE; i++){
if(thash->lock[i].node)
kprintf("thash[i] is locked\n");
list_for_each_entry(t, &thash->list[i], hash_list){ list_for_each_entry(t, &thash->list[i], hash_list){
found++;
kprintf("cpu=%d pid=%d tid=%d status=%d\n", kprintf("cpu=%d pid=%d tid=%d status=%d\n",
t->cpu_id, t->proc->pid, t->tid, t->cpu_id, t->proc->pid, t->tid,
t->status); t->status);
} }
} }
kprintf("%d threads are found.\n", found);
break; break;
} }
#endif
} }