1 /* -----------------------------------------------------------------------------
2 * $Id: RtsFlags.h,v 1.10 1999/02/18 13:00:28 sewardj Exp $
4 * (c) The GHC Team, 1998-1999
6 * Datatypes that holds the command-line flag settings.
8 * ---------------------------------------------------------------------------*/
13 /* For defaults, see the @initRtsFlagsDefaults@ routine. */
17 nat giveStats; /* ToDo: replace with enum type? */
19 #define VERBOSE_GC_STATS 1
21 nat maxStkSize; /* in *words* */
22 nat initialStkSize; /* in *words* */
24 nat maxHeapSize; /* in *blocks* */
25 nat minAllocAreaSize; /* in *blocks* */
26 nat minOldGenSize; /* in *blocks* */
27 nat heapSizeSuggestion; /* in *blocks* */
34 rtsBool forceGC; /* force a major GC every <interval> bytes */
35 int forcingInterval; /* actually, stored as a number of *words* */
38 rtsBool squeezeUpdFrames;
41 /* Hack: this struct uses bitfields so that we can use a binary arg
43 * Remember to update the corresponding bit of RtsFlags.c if you
44 * change/extend this struct.
47 /* flags to control debugging output in various subsystems */
48 rtsBool scheduler : 1; /* 1 */
49 rtsBool evaluator : 1; /* 2 */
50 rtsBool codegen : 1; /* 4 */
51 rtsBool weak : 1; /* 8 */
52 rtsBool gccafs : 1; /* 16 */
53 rtsBool gc : 1; /* 32 */
54 rtsBool block_alloc : 1; /* 64 */
56 /* flags to control consistency checking (often very expensive!) */
57 rtsBool sanity : 1; /* 128 */
59 rtsBool stable : 1; /* 256 */
62 #if defined(PROFILING) || defined(PAR)
63 /* with PROFILING, full cost-centre stuff (also PROFILING_FLAGS);
64 with PAR, just the four fixed cost-centres.
66 struct COST_CENTRE_FLAGS {
67 unsigned int doCostCentres;
68 # define COST_CENTRES_SUMMARY 1
69 # define COST_CENTRES_VERBOSE 2 /* incl. serial time profile */
70 # define COST_CENTRES_ALL 3
73 # define SORTCC_LABEL 'C'
74 # define SORTCC_TIME 'T'
75 # define SORTCC_ALLOC 'A'
77 int ctxtSwitchTicks; /* derived */
78 int profilerTicks; /* derived */
79 int msecsPerTick; /* derived */
84 struct PROFILING_FLAGS {
85 unsigned int doHeapProfile;
86 # define NO_HEAP_PROFILING 0 /* N.B. Used as indexes into arrays */
88 # define HEAP_BY_MOD 2
89 # define HEAP_BY_GRP 3
90 # define HEAP_BY_DESCR 4
91 # define HEAP_BY_TYPE 5
92 # define HEAP_BY_TIME 6
97 # define DESCRchar 'D'
109 # define NO_HEAP_PROFILING 0
110 # define HEAP_BY_INFOPTR 1
111 # define HEAP_BY_CLOSURE_TYPE 2
112 struct PROFILING_FLAGS {
113 unsigned int doHeapProfile; /* heap profile using symbol table */
115 #endif /* DEBUG || PROFILING */
117 struct CONCURRENT_FLAGS {
118 int ctxtSwitchTime; /* in milliseconds */
124 rtsBool parallelStats; /* Gather parallel statistics */
125 rtsBool granSimStats; /* Full .gr profile (rtsTrue) or only END events? */
126 rtsBool granSimStats_Binary;
128 rtsBool outputDisabled; /* Disable output for performance purposes */
130 unsigned int packBufferSize;
131 unsigned int maxLocalSparks;
138 rtsBool granSimStats; /* Full .gr profile (rtsTrue) or only END events? */
139 rtsBool granSimStats_suppressed; /* No .gr profile at all */
140 rtsBool granSimStats_Binary;
141 rtsBool granSimStats_Sparks;
142 rtsBool granSimStats_Heap;
144 unsigned int packBufferSize;
145 unsigned int packBufferSize_internal;
147 int proc; /* number of processors */
148 int max_fishes; /* max number of spark or thread steals */
149 TIME time_slice; /* max time slice of one reduction thread */
151 /* Communication Cost Variables -- set in main program */
152 unsigned int gran_latency; /* Latency for single packet */
153 unsigned int gran_additional_latency; /* Latency for additional packets */
154 unsigned int gran_fetchtime;
155 unsigned int gran_lunblocktime; /* Time for local unblock */
156 unsigned int gran_gunblocktime; /* Time for global unblock */
157 unsigned int gran_mpacktime; /* Cost of creating a packet */
158 unsigned int gran_munpacktime; /* Cost of receiving a packet */
159 unsigned int gran_mtidytime; /* Cost of cleaning up after send */
161 unsigned int gran_threadcreatetime; /* Thread creation costs */
162 unsigned int gran_threadqueuetime; /* Cost of adding a thread to the running/runnable queue */
163 unsigned int gran_threaddescheduletime; /* Cost of descheduling a thread */
164 unsigned int gran_threadscheduletime; /* Cost of scheduling a thread */
165 unsigned int gran_threadcontextswitchtime; /* Cost of context switch */
167 /* Instruction Costs */
168 unsigned int gran_arith_cost; /* arithmetic instructions (+,i,< etc) */
169 unsigned int gran_branch_cost; /* branch instructions */
170 unsigned int gran_load_cost; /* load into register */
171 unsigned int gran_store_cost; /* store into memory */
172 unsigned int gran_float_cost; /* floating point operations */
174 unsigned int gran_heapalloc_cost; /* heap allocation costs */
176 /* Overhead for granularity control mechanisms */
177 /* overhead per elem of spark queue */
178 unsigned int gran_pri_spark_overhead;
179 /* overhead per elem of thread queue */
180 unsigned int gran_pri_sched_overhead;
182 /* GrAnSim-Light: This version puts no bound on the number of
183 processors but in exchange doesn't model communication costs
184 (all communication is 0 cost). Mainly intended to show maximal
185 degree of parallelism in the program (*not* to simulate the
186 execution on a real machine). */
190 rtsBool DoFairSchedule ; /* fair scheduling alg? default: unfair */
191 rtsBool DoReScheduleOnFetch ; /* async. communication? */
192 rtsBool DoStealThreadsFirst; /* prefer threads over sparks when stealing */
193 rtsBool SimplifiedFetch; /* fast but inaccurate fetch modelling */
194 rtsBool DoAlwaysCreateThreads; /* eager thread creation */
195 rtsBool DoGUMMFetching; /* bulk fetching */
196 rtsBool DoThreadMigration; /* allow to move threads */
197 int FetchStrategy; /* what to do when waiting for data */
198 rtsBool PreferSparksOfLocalNodes; /* prefer local over global sparks */
199 rtsBool DoPrioritySparking; /* sparks sorted by priorities */
200 rtsBool DoPriorityScheduling; /* threads sorted by priorities */
201 int SparkPriority; /* threshold for cut-off mechanism */
203 rtsBool RandomPriorities;
204 rtsBool InversePriorities;
205 rtsBool IgnorePriorities;
206 int ThunksToPack; /* number of thunks in packet + 1 */
207 rtsBool RandomSteal; /* steal spark/thread from random proc */
208 rtsBool NoForward; /* no forwarding of fetch messages */
209 rtsBool PrintFetchMisses; /* print number of fetch misses */
213 rtsBool event_trace_all;
220 rtsBool showTickyStats;
223 /* see also: doUpdEntryCounts in AllFlags */
225 #endif /* TICKY_TICKY */
228 /* Put them together: */
231 struct GC_FLAGS GcFlags;
232 struct DEBUG_FLAGS DebugFlags;
233 struct CONCURRENT_FLAGS ConcFlags;
235 #if defined(PROFILING) || defined(PAR)
236 struct COST_CENTRE_FLAGS CcFlags;
238 #if defined(PROFILING) || defined(DEBUG)
239 struct PROFILING_FLAGS ProfFlags;
242 struct PAR_FLAGS ParFlags;
245 struct GRAN_FLAGS GranFlags;
248 struct TICKY_FLAGS TickyFlags;
252 extern struct RTS_FLAGS RtsFlags;
254 /* Routines that operate-on/to-do-with RTS flags: */
256 void initRtsFlagsDefaults(void);
257 void setupRtsFlags(int *argc, char *argv[], int *rts_argc, char *rts_argv[]);
260 * The printf formats are here, so we are less likely to make
261 * overly-long filenames (with disastrous results). No more than 128
265 #define STATS_FILENAME_MAXLEN 128
267 #define GR_FILENAME_FMT "%0.124s.gr"
268 #define GR_FILENAME_FMT_GUM "%0.120s.%03d.%s"
269 #define HP_FILENAME_FMT "%0.124s.hp"
270 #define LIFE_FILENAME_FMT "%0.122s.life"
271 #define PROF_FILENAME_FMT "%0.122s.prof"
272 #define PROF_FILENAME_FMT_GUM "%0.118s.%03d.prof"
273 #define QP_FILENAME_FMT "%0.124s.qp"
274 #define STAT_FILENAME_FMT "%0.122s.stat"
275 #define TICKY_FILENAME_FMT "%0.121s.ticky"
276 #define TIME_FILENAME_FMT "%0.122s.time"
277 #define TIME_FILENAME_FMT_GUM "%0.118s.%03d.time"
279 extern int prog_argc; /* an "int" so as to match normal "argc" */
280 extern char **prog_argv;
281 extern int rts_argc; /* ditto */
282 extern char *rts_argv[];
284 #endif /* RTSFLAGS_H */