[SOLVED] Cse330 project 4- bounded buffer producer consumer problem p0

1. Producer Thread The producer thread searches the system for all the processes that belong to a given user (In test scripts, we will automatically create a new user: test_cse330) and adds their task_struct to the shared buffer. There is only one producer in the system, and it exits after it has iterated through the entire task list. The kernel stores all the processes in a circular doubly linked list called task list. Each element in the task list is a process descriptor of the type struct task_struct which contains all the information about a process. The below figure shows the process descriptors and task list. We use the for_each_process macro to iterate through the task list to access each task_struct. The macro goes over all the task_struct in the task list one by one. The task_struct contains the process PID in pid and the process users UID in cred->uid.val for_ each process(struct task struct p) II On each iteration, P points to the next task in the list task struct task; task›pid // PID of the process task-›cred-›uid.val // UID of the user of the process struct task struct. struct task struct struct task struct struct task_struct unsigned long state; int prio; unsigned long policy: struct task_struct parent; struct list head tasks; pid_t pid; the task list

The following code example calculates the number of processes in the task list. include‹linux/sched.h>
#include struct task_struct* p; size_t process_counter = 0; for_each_process(P) {
process_counter;
CSE330 Project 4 Bounded buffer Producer Consumer Problem