Sponsored Content
Top Forums UNIX for Advanced & Expert Users threads and memory allocation Post 92746 by prankster on Wednesday 14th of December 2005 11:45:22 AM
Old 12-14-2005
1. Yes, I use cleanup_push and pop. Here is a part of my code:
Code:
void thread_cleanup(void* r) {
	ARunnable* runnable = static_cast<ARunnable*>(r);
	runnable->onClose();
	delete runnable;
}

void* thread_function(void* r) {
	CThread* th = static_cast<CThread*>(r);
	ARunnable* runnable = th->target();	
	pthread_cleanup_push(thread_cleanup, static_cast<void*>(runnable));
	try {
		runnable->run();
	}
	catch (...) {
		cerr << "error" << endl;
	}
	pthread_cleanup_pop(1);          // 0
	pthread_detach(th->thread());  // 1
	pthread_exit(NULL);                 // 2

	return NULL;
}

bool CThread::start() {
	int e = 0;
	
	if (0 != (e = pthread_create(&_thread, NULL, thread_function, static_cast<void*>(this)))) {
		return false;
	}

	return true;
}

As you see, I've tried to make a little wrapper for pthread_* routines. I've added lines labelled 1 and 2 because I thought it would make threads to deallocate memory. But it doesn't work.

Also I have some misunderstanding about pthread_cleanup_push and pop technics. Does the system return control to the thread_function after calling thread_cleanup, if thread_cleanup is called not from the line 0?
 

10 More Discussions You Might Find Interesting

1. UNIX for Dummies Questions & Answers

memory allocation

I would like to know how I could allocate some more memory to a process. Please note that I am not the root user. (1 Reply)
Discussion started by: sagar
1 Replies

2. UNIX for Dummies Questions & Answers

HP-UX memory usage allocation

Hi all, I have a HP-UX Server with 4 gigabytes of physical RAM. When I use the 'Glance' utility to see what my memory utilization is, my memory usage shows up maxed out at 99%. I shut off all the known processes that I'm running on that box and the memory utilization is still at 78% (with Swap... (1 Reply)
Discussion started by: dehuang83
1 Replies

3. Programming

Dynamic memory allocation

Hi, I am trying to process line by line of a file. But I should not be allocating static allocation for reading the contents of the file. The memory should be dynamically allocated. The confusion here is how do I determine the size of each line, put it into a buffer with the memory allocated... (11 Replies)
Discussion started by: naan
11 Replies

4. Programming

Memory allocation problem

I have a program that will fetch some particular lines and store it in a buffer for further operations.The code which is given below works but with some errors.I couldn't trace out the error.Can anybody help on this plz?? #include <stdio.h> #include <stdlib.h> #include<string.h> #define... (1 Reply)
Discussion started by: vigneshinbox
1 Replies

5. Programming

Is there a problem with the memory allocation???

I have a scenario like the client has to search for the active server.There will be many servers.But not all server are active.And at a time not more than one server will be active. The client will be in active state always i.e, it should always search for an active server until it gets one.I... (1 Reply)
Discussion started by: vigneshinbox
1 Replies

6. Programming

memory allocation in subroutine

Hi everyone, I'm not new to C programming, but I'm having question regarding the memory allocation of a pointer variable which, for instance, will be declared in main(), but its memory will be allocated in subroutine. To clearify my question, I provide a small working example: #include... (1 Reply)
Discussion started by: MIB_Maik
1 Replies

7. Programming

Memory allocation in C

Hi Experts I need some help in static memory allocation in C. I have a program in which I declared 2 variables, one char array and one integer. I was little surprised to see the addresses of the variables. First: int x; char a; printf("%u %u\n', &x, a); I got the addresses displayed... (2 Replies)
Discussion started by: unx_freak
2 Replies

8. Programming

memory allocation for string in C

hi in the following code, how the memory is allocated for a1 which holds the values of a2 after cpy function call. #include <stdio.h> #include <string.h> void cpy(char* d, const char* s){ while(*d++=*s++); } main(){ char* a1; char* a2="done"; cpy(a1,a2); ... (3 Replies)
Discussion started by: mprakasheee
3 Replies

9. Programming

C++/ROOT Memory Allocation?

Hello, I am new to C++ programming, so I'm still getting a feel for things. I recently wrote a simple C++ program (to be used as a ROOT Macro) to conduct a statistical analysis of a varied version of the Monty Hall problem (code below). Basically, the programs runs a few simple calculations to... (7 Replies)
Discussion started by: Tyler_92
7 Replies

10. UNIX for Dummies Questions & Answers

Memory allocation problem

I am using ubuntu. I have written a program to calculate prime factors. it works perfectly fine till entered number is less than 9989 (or so ) but when one enters a number higher than that, for example 15000, it does not work. Can anyone guide me whats the problem ? although new codes are welcome,... (2 Replies)
Discussion started by: Abhishek_kumar
2 Replies
RUNQUEUE(9)						   BSD Kernel Developer's Manual					       RUNQUEUE(9)

NAME
choosethread, procrunnable, remrunqueue, setrunqueue -- manage the queue of runnable processes SYNOPSIS
#include <sys/param.h> #include <sys/proc.h> extern struct rq itqueues[]; extern struct rq rtqueues[]; extern struct rq queues[]; extern struct rq idqueues[]; struct thread * choosethread(void); int procrunnable(void); void remrunqueue(struct thread *td); void setrunqueue(struct thread *td); DESCRIPTION
The run queue consists of four priority queues: itqueues for interrupt threads, rtqueues for realtime priority processes, queues for time sharing processes, and idqueues for idle priority processes. Each priority queue consists of an array of NQS queue header structures. Each queue header identifies a list of runnable processes of equal priority. Each queue also has a single word that contains a bit mask identify- ing non-empty queues to assist in selecting a process quickly. These are named itqueuebits, rtqueuebits, queuebits, and idqueuebits. The run queues are protected by the sched_lock mutex. procrunnable() returns zero if there are no runnable processes other than the idle process. If there is at least one runnable process other than the idle process, it will return a non-zero value. Note that the sched_lock mutex does not need to be held when this function is called. There is a small race window where one CPU may place a process on the run queue when there are currently no other runnable processes while another CPU is calling this function. In that case the second CPU will simply travel through the idle loop one additional time before noticing that there is a runnable process. This works because idle CPUs are not halted in SMP systems. If idle CPUs are halted in SMP sys- tems, then this race condition might have more serious repercussions in the losing case, and procrunnable() may have to require that the sched_lock mutex be acquired. choosethread() returns the highest priority runnable thread. If there are no runnable threads, then the idle thread is returned. This func- tion is called by cpu_switch() and cpu_throw() to determine which thread to switch to. choosethread() must be called with the sched_lock mutex held. setrunqueue() adds the thread td to the tail of the appropriate queue in the proper priority queue. The thread must be runnable, i.e. p_stat must be set to SRUN. This function must be called with the sched_lock mutex held. remrunqueue() removes thread td from its run queue. If td is not on a run queue, then the kernel will panic(9). This function must be called with the sched_lock mutex held. SEE ALSO
cpu_switch(9), scheduler(9), sleepqueue(9) BSD
August 15, 2010 BSD
All times are GMT -4. The time now is 09:40 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy