/************************************************************************* * * * YAP Prolog %W% %G% * * Yap Prolog was developed at NCCUP - Universidade do Porto * * * * Copyright L.Damas, V.S.Costa and Universidade do Porto 1985-1997 * * * ************************************************************************** * * * File: YapHeap.h * * mods: * * comments: Heap Init Structure * * version: $Id: Heap.h,v 1.136 2008-08-08 14:05:34 vsc Exp $ * *************************************************************************/ /* information that can be stored in Code Space */ #ifndef HEAP_H #define HEAP_H 1 #if LOW_PROF #include #endif #if defined(THREADS) #define RINFO rinfo[worker_id] #else #define RINFO rinfo #endif #ifndef INT_KEYS_DEFAULT_SIZE #define INT_KEYS_DEFAULT_SIZE 256 #endif #if USE_DL_MALLOC #define MAX_DLMALLOC_HOLES 32 typedef struct memory_hole { ADDR start; ADDR end; } memory_hole_type; #endif #define GC_MAVARS_HASH_SIZE 512 typedef struct gc_ma_hash_entry_struct { UInt timestmp; #ifdef TABLING tr_fr_ptr loc; struct gc_ma_hash_entry_struct *more; #endif CELL* addr; struct gc_ma_hash_entry_struct *next; } gc_ma_hash_entry; typedef struct atom_hash_entry { #if defined(YAPOR) || defined(THREADS) rwlock_t AERWLock; #endif Atom Entry; } AtomHashEntry; typedef struct reduction_counters { YAP_ULONG_LONG reductions; YAP_ULONG_LONG reductions_retries; YAP_ULONG_LONG retries; int reductions_on; int reductions_retries_on; int retries_on; } red_counters; typedef struct scratch_block_struct { char *ptr; UInt sz, msz; } scratch_block; typedef struct restore_info { Int base_diff, cl_diff, g_diff, g_diff0, h_diff, l_diff, tr_diff, x_diff, delay_diff; CELL *old_ASP, *old_LCL0; CELL *g_split; tr_fr_ptr old_TR; CELL *old_GlobalBase, *old_H, *old_H0; CELL *old_DelayTop, *current_DelayTop; ADDR old_TrailBase, old_TrailTop; ADDR old_HeapBase, old_HeapTop; } restoreinfo; #if defined(THREADS) extern struct restore_info rinfo[MAX_THREADS]; #else extern struct restore_info rinfo; #endif typedef struct worker_local_struct { struct format_status *f_info; Int delay_arena_overflows; Int arena_overflows; Int depth_arenas; char *scanner_stack; struct scanner_extra_alloc *scanner_extra_blocks; struct DB_TERM *ball_term; #if defined(YAPOR) || defined(THREADS) lockvar signal_lock; /* protect signal handlers from IPIs */ struct pred_entry *wpp; #endif #ifdef USE_GMP mpz_t big_tmp; #endif union CONSULT_OBJ *consultsp; union CONSULT_OBJ *consultbase; union CONSULT_OBJ *consultlow; struct pred_entry *last_asserted_pred; int debug_on; int interrupts_disabled; UInt consultcapacity; UInt active_signals; UInt i_pred_arity; yamop *prof_end; Int start_line; int uncaught_throw; int doing_undefp; int arith_error; scratch_block scratchpad; #ifdef MULTI_ASSIGNMENT_VARIABLES Term woken_goals; Term atts_mutable_list; #endif /* gc_stuff */ Term gc_generation; /* global stack limit at last generation */ Term gc_phase; /* gc phase to be sure we are on a valid compression */ UInt gc_current_phase; /* gc currrent phase */ unsigned int gc_calls; /* number of times GC has been called */ Int tot_gc_time; /* total time spent in GC */ YAP_ULONG_LONG tot_gc_recovered; /* number of heap objects in all garbage collections */ Int last_gc_time, last_ss_time; /* number of heap objects in all garbage collections */ /* in a single gc */ #if defined(YAPOR) || defined(THREADS) /* otherwise, use global variables for speed */ unsigned long int tot_marked, tot_oldies; /* number of heap objects marked */ #ifdef COROUTINING unsigned long int tot_smarked; #endif struct choicept *wl_current_B; #if defined(TABLING) || defined(SBA) struct trail_frame *wl_sTR, *wl_sTR0; struct trail_frame *new_tr; #else Term *wl_sTR, *wl_sTR0; Term *new_tr; #endif CELL *wl_prev_HB; CELL *hgen; CELL **ip_top; #if GC_NO_TAGS char *b_p; #endif struct gc_mark_continuation *conttop0; struct gc_mark_continuation *conttop; int disc_trail_entries; gc_ma_hash_entry Gc_ma_hash_table[GC_MAVARS_HASH_SIZE]; gc_ma_hash_entry *Gc_ma_h_top; gc_ma_hash_entry *Gc_ma_h_list; UInt Gc_timestamp; /* an unsigned int */ ADDR DB_vec, DB_vec0; struct RB_red_blk_node *DB_root, *DB_nil; #endif /* defined(YAPOR) || defined(THREADS) */ jmp_buf gc_restore; /* where to jump if garbage collection crashes */ struct array_entry *dynamic_arrays; struct static_array_entry *static_arrays; struct global_entry *global_variables; struct reduction_counters call_counters; int allow_restart; Term global_arena; UInt global_arena_overflows; Term global_delay_arena; yamop trust_lu_code[3]; #if (defined(YAPOR) || defined(TABLING) ) && defined(THREADS) #ifdef YAPOR struct worker worker; #endif /* YAPOR */ #endif } worker_local; #ifdef THREADS typedef struct thandle { int in_use; int zombie; UInt ssize; UInt tsize; UInt sysize; void *stack_address; Term tdetach; Term cmod, texit_mod; struct DB_TERM *tgoal, *texit; int id; int ret; REGSTORE *default_yaam_regs; REGSTORE *current_yaam_regs; struct pred_entry *local_preds; pthread_t pthread_handle; int ref_count; #ifdef LOW_LEVEL_TRACER long long int thread_inst_count; int been_here1; int been_here2; #endif pthread_mutex_t tlock; pthread_mutex_t tlock_status; #if HAVE_GETRUSAGE||defined(_WIN32) struct timeval *start_of_timesp; struct timeval *last_timep; #endif } yap_thandle; #endif typedef int (*Agc_hook)(Atom); typedef struct various_codes { /* memory allocation and management */ special_functors funcs; #include "hstruct.h" #if defined(YAPOR) || defined(TABLING) struct global_data global; struct local_data remote[MAX_WORKERS]; #endif /* YAPOR || TABLING */ } all_heap_codes; #ifdef USE_SYSTEM_MALLOC extern struct various_codes *Yap_heap_regs; #else #define Yap_heap_regs ((all_heap_codes *)HEAP_INIT_BASE) #endif #define FloatFormat Yap_heap_regs->float_format #define PROLOG_MODULE 0 #include "dhstruct.h" #if defined(YAPOR) || defined(THREADS) #define SignalLock Yap_heap_regs->wl[worker_id].signal_lock #define WPP Yap_heap_regs->wl[worker_id].wpp #define total_marked Yap_heap_regs->wl[worker_id].tot_marked #define total_oldies Yap_heap_regs->wl[worker_id].tot_oldies #if DEBUG #ifdef COROUTINING #define total_smarked Yap_heap_regs->wl[worker_id].tot_smarked #endif #endif /* DEBUG */ #define current_B Yap_heap_regs->wl[worker_id].wl_current_B #define sTR Yap_heap_regs->wl[worker_id].wl_sTR #define sTR0 Yap_heap_regs->wl[worker_id].wl_sTR0 #define prev_HB Yap_heap_regs->wl[worker_id].wl_prev_HB #define new_TR Yap_heap_regs->wl[worker_id].new_tr #define HGEN Yap_heap_regs->wl[worker_id].hgen #define iptop Yap_heap_regs->wl[worker_id].ip_top #define discard_trail_entries Yap_heap_regs->wl[worker_id].disc_trail_entries #if GC_NO_TAGS #define Yap_bp Yap_heap_regs->wl[worker_id].b_p #endif /* GC_NO_TAGS */ #define gc_ma_hash_table Yap_heap_regs->wl[worker_id].Gc_ma_hash_table #define gc_ma_h_top Yap_heap_regs->wl[worker_id].Gc_ma_h_top #define gc_ma_h_list Yap_heap_regs->wl[worker_id].Gc_ma_h_list #define gc_timestamp Yap_heap_regs->wl[worker_id].Gc_timestamp #define cont_top0 Yap_heap_regs->wl[worker_id].conttop0 #define db_vec Yap_heap_regs->wl[worker_id].DB_vec #define db_vec0 Yap_heap_regs->wl[worker_id].DB_vec0 #define db_root Yap_heap_regs->wl[worker_id].DB_root #define db_nil Yap_heap_regs->wl[worker_id].DB_nil #define cont_top Yap_heap_regs->wl[worker_id].conttop #endif #define OldASP RINFO.old_ASP #define OldLCL0 RINFO.old_LCL0 #define OldTR RINFO.old_TR #define OldGlobalBase RINFO.old_GlobalBase #define OldH RINFO.old_H #define OldH0 RINFO.old_H0 #define OldTrailBase RINFO.old_TrailBase #define OldTrailTop RINFO.old_TrailTop #define OldHeapBase RINFO.old_HeapBase #define OldHeapTop RINFO.old_HeapTop #define OldDelayTop RINFO.old_DelayTop #define CurrentDelayTop RINFO.current_DelayTop #define ClDiff RINFO.cl_diff #define GDiff RINFO.g_diff #define GDiff0 RINFO.g_diff0 #define GSplit RINFO.g_split #define HDiff RINFO.h_diff #define LDiff RINFO.l_diff #define TrDiff RINFO.tr_diff #define XDiff RINFO.x_diff #define DelayDiff RINFO.delay_diff #define BaseDiff RINFO.base_diff #define ReductionsCounter Yap_heap_regs->WL.call_counters.reductions #define PredEntriesCounter Yap_heap_regs->WL.call_counters.reductions_retries #define RetriesCounter Yap_heap_regs->WL.call_counters.retries #define ReductionsCounterOn Yap_heap_regs->WL.call_counters.reductions_on #define PredEntriesCounterOn Yap_heap_regs->WL.call_counters.reductions_retries_on #define RetriesCounterOn Yap_heap_regs->WL.call_counters.retries_on #define Yap_InterruptsDisabled Yap_heap_regs->WL.interrupts_disabled /* current consult stack */ #define ConsultSp Yap_heap_regs->WL.consultsp /* top of consult stack */ #define ConsultBase Yap_heap_regs->WL.consultbase /* low-water mark for consult */ #define ConsultLow Yap_heap_regs->WL.consultlow #define ArithError Yap_heap_regs->WL.arith_error #define LastAssertedPred Yap_heap_regs->WL.last_asserted_pred /* current maximum number of cells in consult stack */ #define ConsultCapacity Yap_heap_regs->WL.consultcapacity #define DebugOn Yap_heap_regs->WL.debug_on #define FormatInfo Yap_heap_regs->WL.f_info #define DelayArenaOverflows Yap_heap_regs->WL.delay_arena_overflows #define ArenaOverflows Yap_heap_regs->WL.arena_overflows #define DepthArenas Yap_heap_regs->WL.depth_arenas #define ScannerStack Yap_heap_regs->WL.scanner_stack #define ScannerExtraBlocks Yap_heap_regs->WL.scanner_extra_blocks #define BallTerm Yap_heap_regs->WL.ball_term #define Yap_BigTmp Yap_heap_regs->WL.big_tmp #define ActiveSignals Yap_heap_regs->WL.active_signals #define IPredArity Yap_heap_regs->WL.i_pred_arity #define ProfEnd Yap_heap_regs->WL.prof_end #define UncaughtThrow Yap_heap_regs->WL.uncaught_throw #define DoingUndefp Yap_heap_regs->WL.doing_undefp #define StartLine Yap_heap_regs->WL.start_line #define ScratchPad Yap_heap_regs->WL.scratchpad #ifdef COROUTINING #define WokenGoals Yap_heap_regs->WL.woken_goals #define AttsMutableList Yap_heap_regs->WL.atts_mutable_list #endif #define GcGeneration Yap_heap_regs->WL.gc_generation #define GcPhase Yap_heap_regs->WL.gc_phase #define GcCurrentPhase Yap_heap_regs->WL.gc_current_phase #define GcCalls Yap_heap_regs->WL.gc_calls #define TotGcTime Yap_heap_regs->WL.tot_gc_time #define TotGcRecovered Yap_heap_regs->WL.tot_gc_recovered #define LastGcTime Yap_heap_regs->WL.last_gc_time #define LastSSTime Yap_heap_regs->WL.last_ss_time #define Yap_gc_restore Yap_heap_regs->WL.gc_restore #define TrustLUCode Yap_heap_regs->WL.trust_lu_code #define DynamicArrays Yap_heap_regs->WL.dynamic_arrays #define StaticArrays Yap_heap_regs->WL.static_arrays #define GlobalVariables Yap_heap_regs->WL.global_variables #define GlobalArena Yap_heap_regs->WL.global_arena #define GlobalArenaOverflows Yap_heap_regs->WL.global_arena_overflows #define Yap_AllowRestart Yap_heap_regs->WL.allow_restart #define GlobalDelayArena Yap_heap_regs->WL.global_delay_arena #define PredHashInitialSize 1039L #define PredHashIncrement 7919L #if defined(YAPOR) || defined(TABLING) #define GLOBAL Yap_heap_regs->global #define REMOTE Yap_heap_regs->remote #ifdef THREADS #define WORKER Yap_heap_regs->WL.worker #endif #endif /* YAPOR || TABLING */ #define UPDATE_MODE_IMMEDIATE 0 #define UPDATE_MODE_LOGICAL 1 #define UPDATE_MODE_LOGICAL_ASSERT 2 /* initially allow for files with up to 1024 predicates. This number is extended whenever needed */ #define InitialConsultCapacity 1024 #if (defined(USE_SYSTEM_MALLOC) && HAVE_MALLINFO)||USE_DL_MALLOC UInt STD_PROTO(Yap_givemallinfo, (void)); #endif ADDR STD_PROTO(Yap_ExpandPreAllocCodeSpace, (UInt, void *, int)); #define Yap_ReleasePreAllocCodeSpace(x) ADDR STD_PROTO(Yap_InitPreAllocCodeSpace, (void)); EXTERN inline ADDR Yap_PreAllocCodeSpace(void) { return AuxBase; } #endif /* HEAP_H */