williamr@2: /*
williamr@2: * Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies). All rights reserved.
williamr@2: 
williamr@2: * Redistribution and use in source and binary forms, with or without 
williamr@2: * modification, are permitted provided that the following conditions are met:
williamr@2: 
williamr@2: * Redistributions of source code must retain the above copyright notice, this 
williamr@2: * list of conditions and the following disclaimer.
williamr@2: * Redistributions in binary form must reproduce the above copyright notice, 
williamr@2: * this list of conditions and the following disclaimer in the documentation 
williamr@2: * and/or other materials provided with the distribution.
williamr@2: * Neither the name of Nokia Corporation nor the names of its contributors 
williamr@2: * may be used to endorse or promote products derived from this software 
williamr@2: * without specific prior written permission.
williamr@2: 
williamr@2: * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
williamr@2: * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
williamr@2: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 
williamr@2: * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE 
williamr@2: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 
williamr@2: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 
williamr@2: * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 
williamr@2: * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 
williamr@2: * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 
williamr@2: * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
williamr@2: *
williamr@2: * Description:
williamr@2: *
williamr@2: */
williamr@2: 
williamr@2: #ifndef __G_LOW_MEM_H__
williamr@2: #define __G_LOW_MEM_H__
williamr@2:  
williamr@2: #include <unistd.h> 
williamr@2: #include <setjmp.h>
williamr@2: 
williamr@2: /*-------------------------- Data Structure Decleration ----------------*/
williamr@2: typedef struct _cleanUpStack cleanUpStack ;
williamr@2: typedef struct _mem_info mem_info ;
williamr@2: 
williamr@2: struct _cleanUpStack
williamr@2: {
williamr@2: 	void *ptr[1000];
williamr@2: 	int top;
williamr@2: };
williamr@2: 
williamr@2: struct _mem_info
williamr@2: {
williamr@2: 	int is_setjmp_called;
williamr@2: 	jmp_buf buf;
williamr@2: 	cleanUpStack stack;
williamr@2: };
williamr@2: 
williamr@2:  
williamr@2: /*--------------------Function declerations------------------*/ 
williamr@2: #ifdef __cplusplus
williamr@2: extern "C"
williamr@2: {
williamr@2: #endif    /* __cplusplus */
williamr@2: 
williamr@2: IMPORT_C mem_info * _get_thread_specific_data();
williamr@2: IMPORT_C int _set_thread_specific_data(mem_info *m);
williamr@2: IMPORT_C int _push(cleanUpStack *cs,void *ptr);
williamr@2: IMPORT_C void *_pop(cleanUpStack *cs);
williamr@2: IMPORT_C void _findAndDestroy(cleanUpStack *cs,void *ptr);
williamr@2: IMPORT_C void _destroCleanUpStack(cleanUpStack *cs);
williamr@2: IMPORT_C void _clearCleanUpStack(cleanUpStack *cs);
williamr@2: IMPORT_C void * _pAlloc(size_t size);
williamr@2: IMPORT_C void _dummy1();
williamr@2: IMPORT_C void _dummy2();
williamr@2: IMPORT_C void _dummy3();
williamr@2: 
williamr@2: #ifdef __cplusplus
williamr@2: }
williamr@2: #endif    /* __cplusplus */
williamr@2: 
williamr@2: /*--------------------MACRO declerations------------------*/
williamr@2: 
williamr@2: #define SET_LOW_MEMORY_TRAP_VOID()	\
williamr@2: gboolean did_i_set = FALSE;\
williamr@2: {\
williamr@2: 	mem_info *m = _get_thread_specific_data();\
williamr@2: 	if(m == NULL)\
williamr@2: 	{\
williamr@2: 		m = (mem_info *)_pAlloc(sizeof(mem_info));\
williamr@2: 		if(!m)\
williamr@2: 			return;\
williamr@2: 		m->is_setjmp_called = FALSE;\
williamr@2: 		_clearCleanUpStack(&(m->stack));\
williamr@2: 		if(_set_thread_specific_data(m))\
williamr@2: 			return;\
williamr@2: 	}\
williamr@2: 	if(!m->is_setjmp_called)\
williamr@2: 	{\
williamr@2:   		if(setjmp(m->buf) > 0)\
williamr@2:   		{\
williamr@2:   			m->is_setjmp_called = FALSE;\
williamr@2:   			_destroCleanUpStack(&(m->stack));\
williamr@2:   			return ;\
williamr@2:   		}\
williamr@2:   		m->is_setjmp_called = TRUE;\
williamr@2:   		did_i_set = TRUE;\
williamr@2:   	}\
williamr@2: }
williamr@2: 
williamr@2: #define SET_LOW_MEMORY_TRAP(failure_value)	\
williamr@2: gboolean did_i_set = FALSE;\
williamr@2: {\
williamr@2: 	mem_info *m = _get_thread_specific_data();\
williamr@2: 	if(m == NULL)\
williamr@2: 	{\
williamr@2: 		m = (mem_info *)_pAlloc(sizeof(mem_info));\
williamr@2: 		if(!m)\
williamr@2: 			return failure_value;\
williamr@2: 		m->is_setjmp_called = FALSE;\
williamr@2: 		_clearCleanUpStack(&(m->stack));\
williamr@2: 		if(_set_thread_specific_data(m))\
williamr@2: 			return failure_value;\
williamr@2: 	}\
williamr@2: 	if(!m->is_setjmp_called)\
williamr@2: 	{\
williamr@2:   		if(setjmp(m->buf) > 0)\
williamr@2:   		{\
williamr@2:   			m->is_setjmp_called = FALSE;\
williamr@2:   			_destroCleanUpStack(&(m->stack));\
williamr@2:   			return failure_value;\
williamr@2:   		}\
williamr@2:   		m->is_setjmp_called = TRUE;\
williamr@2:   		did_i_set = TRUE;\
williamr@2:   	}\
williamr@2: }
williamr@2: 
williamr@2: 
williamr@2: #define REMOVE_LOW_MEMORY_TRAP()	{\
williamr@2: if(did_i_set)\
williamr@2: 	{\
williamr@2: 	mem_info *m = _get_thread_specific_data();\
williamr@2: 	if(m)\
williamr@2: 		m->is_setjmp_called = FALSE;\
williamr@2: 		_clearCleanUpStack(&(m->stack));\
williamr@2: 	}\
williamr@2: }
williamr@2: 
williamr@2: #endif /* __G_LOW_MEM_H__ */