1Stdlib.Gc(3) OCaml library Stdlib.Gc(3)
2
6 Stdlib.Gc - no description
7
9 Module Stdlib.Gc
10
12 Module Gc
13 : (module Stdlib__gc)
14 type stat = {
22 minor_words : float ; (* Number of words allocated in the minor heap
23 since the program was started.
24 *)
25 promoted_words : float ; (* Number of words allocated in the minor
26 heap that survived a minor collection and were moved to the major heap
27 since the program was started.
28 *)
29 major_words : float ; (* Number of words allocated in the major heap,
30 including the promoted words, since the program was started.
31 *)
32 minor_collections : int ; (* Number of minor collections since the
33 program was started.
34 *)
35 major_collections : int ; (* Number of major collection cycles com‐
36 pleted since the program was started.
37 *)
38 heap_words : int ; (* Total size of the major heap, in words.
39 *)
40 heap_chunks : int ; (* Number of contiguous pieces of memory that
41 make up the major heap.
42 *)
43 live_words : int ; (* Number of words of live data in the major heap,
44 including the header words.
45 *)
46 live_blocks : int ; (* Number of live blocks in the major heap.
47 *)
48 free_words : int ; (* Number of words in the free list.
49 *)
50 free_blocks : int ; (* Number of blocks in the free list.
51 *)
52 largest_free : int ; (* Size (in words) of the largest block in the
53 free list.
54 *)
55 fragments : int ; (* Number of wasted words due to fragmentation.
56 These are 1-words free blocks placed between two live blocks. They are
57 not available for allocation.
58 *)
59 compactions : int ; (* Number of heap compactions since the program
60 was started.
61 *)
62 top_heap_words : int ; (* Maximum size reached by the major heap, in
63 words.
64 *)
65 stack_size : int ; (* Current size of the stack, in words.
66 Since 3.12.0
69 *)
70 }
71 The memory management counters are returned in a stat record.
74 The total amount of memory allocated by the program since it was
76 started is (in words) minor_words + major_words - promoted_words .
77 Multiply by the word size (4 on a 32-bit machine, 8 on a 64-bit
78 machine) to get the number of bytes.
79 type control = {
82 mutable minor_heap_size : int ; (* The size (in words) of the minor
84 heap. Changing this parameter will trigger a minor collection.
85 Default: 256k.
86 *)
87 mutable major_heap_increment : int ; (* How much to add to the major
89 heap when increasing it. If this number is less than or equal to 1000,
90 it is a percentage of the current heap size (i.e. setting it to 100
91 will double the heap size at each increase). If it is more than 1000,
92 it is a fixed number of words that will be added to the heap. Default:
93 15.
94 *)
95 mutable space_overhead : int ; (* The major GC speed is computed from
97 this parameter. This is the memory that will be "wasted" because the
98 GC does not immediately collect unreachable blocks. It is expressed as
99 a percentage of the memory used for live data. The GC will work more
100 (use more CPU time and collect blocks more eagerly) if space_overhead
101 is smaller. Default: 80.
102 *)
103 mutable verbose : int ; (* This value controls the GC messages on
105 standard error output. It is a sum of some of the following flags, to
106 print messages on the corresponding events:
107 - 0x001 Start of major GC cycle.
109 - 0x002 Minor collection and major GC slice.
111 - 0x004 Growing and shrinking of the heap.
113 - 0x008 Resizing of stacks and memory manager tables.
115 - 0x010 Heap compaction.
117 - 0x020 Change of GC parameters.
119 - 0x040 Computation of major GC slice size.
121 - 0x080 Calling of finalisation functions.
123 - 0x100 Bytecode executable and shared library search at start-up.
125 - 0x200 Computation of compaction-triggering condition.
127 - 0x400 Output GC statistics at program exit. Default: 0.
129 *)
131 mutable max_overhead : int ; (* Heap compaction is triggered when the
133 estimated amount of "wasted" memory is more than max_overhead percent
134 of the amount of live data. If max_overhead is set to 0, heap com‐
135 paction is triggered at the end of each major GC cycle (this setting is
136 intended for testing purposes only). If max_overhead >= 1000000 , com‐
137 paction is never triggered. If compaction is permanently disabled, it
138 is strongly suggested to set allocation_policy to 2. Default: 500.
139 *)
140 mutable stack_limit : int ; (* The maximum size of the stack (in
142 words). This is only relevant to the byte-code runtime, as the native
143 code runtime uses the operating system's stack. Default: 1024k.
144 *)
145 mutable allocation_policy : int ; (* The policy used for allocating in
147 the major heap. Possible values are 0, 1 and 2.
148 -0 is the next-fit policy, which is usually fast but can result in
151 fragmentation, increasing memory consumption.
152 -1 is the first-fit policy, which avoids fragmentation but has corner
155 cases (in certain realistic workloads) where it is sensibly slower.
156 -2 is the best-fit policy, which is fast and avoids fragmentation. In
159 our experiments it is faster and uses less memory than both next-fit
160 and first-fit. (since OCaml 4.10)
161 The current default is next-fit, as the best-fit policy is new and not
163 yet widely tested. We expect best-fit to become the default in the
164 future.
165 On one example that was known to be bad for next-fit and first-fit,
167 next-fit takes 28s using 855Mio of memory, first-fit takes 47s using
168 566Mio of memory, best-fit takes 27s using 545Mio of memory.
169 Note: When changing to a low-fragmentation policy, you may need to aug‐
171 ment the space_overhead setting, for example using 100 instead of the
172 default 80 which is tuned for next-fit. Indeed, the difference in frag‐
173 mentation behavior means that different policies will have different
174 proportion of "wasted space" for a given program. Less fragmentation
175 means a smaller heap so, for the same amount of wasted space, a higher
176 proportion of wasted space. This makes the GC work harder, unless you
177 relax it by increasing space_overhead .
178 Note: changing the allocation policy at run-time forces a heap com‐
180 paction, which is a lengthy operation unless the heap is small (e.g. at
181 the start of the program).
182 Default: 0.
184 Since 3.11.0
187 *)
188 window_size : int ; (* The size of the window used by the major GC
189 for smoothing out variations in its workload. This is an integer
190 between 1 and 50. Default: 1.
191 Since 4.03.0
194 *)
195 custom_major_ratio : int ; (* Target ratio of floating garbage to
196 major heap size for out-of-heap memory held by custom values located in
197 the major heap. The GC speed is adjusted to try to use this much memory
198 for dead values that are not yet collected. Expressed as a percentage
199 of major heap size. The default value keeps the out-of-heap floating
200 garbage about the same size as the in-heap overhead. Note: this only
201 applies to values allocated with caml_alloc_custom_mem (e.g. bigar‐
202 rays). Default: 44.
203 Since 4.08.0
206 *)
207 custom_minor_ratio : int ; (* Bound on floating garbage for
208 out-of-heap memory held by custom values in the minor heap. A minor GC
209 is triggered when this much memory is held by custom values located in
210 the minor heap. Expressed as a percentage of minor heap size. Note:
211 this only applies to values allocated with caml_alloc_custom_mem (e.g.
212 bigarrays). Default: 100.
213 Since 4.08.0
216 *)
217 custom_minor_max_size : int ; (* Maximum amount of out-of-heap memory
218 for each custom value allocated in the minor heap. When a custom value
219 is allocated on the minor heap and holds more than this many bytes,
220 only this value is counted against custom_minor_ratio and the rest is
221 directly counted against custom_major_ratio . Note: this only applies
222 to values allocated with caml_alloc_custom_mem (e.g. bigarrays).
223 Default: 8192 bytes.
224 Since 4.08.0
227 *)
228 }
229 The GC parameters are given as a control record. Note that these
232 parameters can also be initialised by setting the OCAMLRUNPARAM envi‐
233 ronment variable. See the documentation of ocamlrun .
234 val stat : unit -> stat
238 Return the current values of the memory management counters in a stat
240 record. This function examines every heap block to get the statistics.
241 val quick_stat : unit -> stat
245 Same as stat except that live_words , live_blocks , free_words ,
247 free_blocks , largest_free , and fragments are set to 0. This function
248 is much faster than stat because it does not need to go through the
249 heap.
250 val counters : unit -> float * float * float
254 Return (minor_words, promoted_words, major_words) . This function is
256 as fast as quick_stat .
257 val minor_words : unit -> float
261 Number of words allocated in the minor heap since the program was
263 started. This number is accurate in byte-code programs, but only an
264 approximation in programs compiled to native code.
265 In native code this function does not allocate.
267 Since 4.04
270 val get : unit -> control
274 Return the current values of the GC parameters in a control record.
276 val set : control -> unit
280 set r changes the GC parameters according to the control record r .
283 The normal usage is: Gc.set { (Gc.get()) with Gc.verbose = 0x00d }
284 val minor : unit -> unit
289 Trigger a minor collection.
291 val major_slice : int -> int
295 major_slice n Do a minor collection and a slice of major collection. n
298 is the size of the slice: the GC will do enough work to free (on aver‐
299 age) n words of memory. If n = 0, the GC will try to do enough work to
300 ensure that the next automatic slice has no work to do. This function
301 returns an unspecified integer (currently: 0).
302 val major : unit -> unit
306 Do a minor collection and finish the current major collection cycle.
308 val full_major : unit -> unit
312 Do a minor collection, finish the current major collection cycle, and
314 perform a complete new cycle. This will collect all currently unreach‐
315 able blocks.
316 val compact : unit -> unit
320 Perform a full major collection and compact the heap. Note that heap
322 compaction is a lengthy operation.
323 val print_stat : out_channel -> unit
327 Print the current values of the memory management counters (in
329 human-readable form) into the channel argument.
330 val allocated_bytes : unit -> float
334 Return the total number of bytes allocated since the program was
336 started. It is returned as a float to avoid overflow problems with int
337 on 32-bit machines.
338 val get_minor_free : unit -> int
342 Return the current size of the free space inside the minor heap.
344 Since 4.03.0
347 val get_bucket : int -> int
351 get_bucket n returns the current size of the n -th future bucket of the
354 GC smoothing system. The unit is one millionth of a full GC. Raise
355 Invalid_argument if n is negative, return 0 if n is larger than the
356 smoothing window.
357 Since 4.03.0
360 val get_credit : unit -> int
364 get_credit () returns the current size of the "work done in advance"
367 counter of the GC smoothing system. The unit is one millionth of a full
368 GC.
369 Since 4.03.0
372 val huge_fallback_count : unit -> int
376 Return the number of times we tried to map huge pages and had to fall
378 back to small pages. This is always 0 if OCAMLRUNPARAM contains H=1 .
379 Since 4.03.0
382 val finalise : ('a -> unit) -> 'a -> unit
386 finalise f v registers f as a finalisation function for v . v must be
389 heap-allocated. f will be called with v as argument at some point
390 between the first time v becomes unreachable (including through weak
391 pointers) and the time v is collected by the GC. Several functions can
392 be registered for the same value, or even several instances of the same
393 function. Each instance will be called once (or never, if the program
394 terminates before v becomes unreachable).
395 The GC will call the finalisation functions in the order of dealloca‐
397 tion. When several values become unreachable at the same time (i.e.
398 during the same GC cycle), the finalisation functions will be called in
399 the reverse order of the corresponding calls to finalise . If finalise
400 is called in the same order as the values are allocated, that means
401 each value is finalised before the values it depends upon. Of course,
402 this becomes false if additional dependencies are introduced by assign‐
403 ments.
404 In the presence of multiple OCaml threads it should be assumed that any
406 particular finaliser may be executed in any of the threads.
407 Anything reachable from the closure of finalisation functions is con‐
409 sidered reachable, so the following code will not work as expected:
410 - let v = ... in Gc.finalise (fun _ -> ...v...) v
412 Instead you should make sure that v is not in the closure of the final‐
414 isation function by writing:
415 - let f = fun x -> ... let v = ... in Gc.finalise f v
417 The f function can use all features of OCaml, including assignments
419 that make the value reachable again. It can also loop forever (in this
420 case, the other finalisation functions will not be called during the
421 execution of f, unless it calls finalise_release ). It can call
422 finalise on v or other values to register other functions or even
423 itself. It can raise an exception; in this case the exception will
424 interrupt whatever the program was doing when the function was called.
425 finalise will raise Invalid_argument if v is not guaranteed to be
428 heap-allocated. Some examples of values that are not heap-allocated
429 are integers, constant constructors, booleans, the empty array, the
430 empty list, the unit value. The exact list of what is heap-allocated
431 or not is implementation-dependent. Some constant values can be
432 heap-allocated but never deallocated during the lifetime of the pro‐
433 gram, for example a list of integer constants; this is also implementa‐
434 tion-dependent. Note that values of types float are sometimes allo‐
435 cated and sometimes not, so finalising them is unsafe, and finalise
436 will also raise Invalid_argument for them. Values of type 'a Lazy.t
437 (for any 'a ) are like float in this respect, except that the compiler
438 sometimes optimizes them in a way that prevents finalise from detecting
439 them. In this case, it will not raise Invalid_argument , but you should
440 still avoid calling finalise on lazy values.
441 The results of calling String.make , Bytes.make , Bytes.create ,
443 Array.make , and ref are guaranteed to be heap-allocated and non-con‐
444 stant except when the length argument is 0 .
445 val finalise_last : (unit -> unit) -> 'a -> unit
449 same as Gc.finalise except the value is not given as argument. So you
451 can't use the given value for the computation of the finalisation func‐
452 tion. The benefit is that the function is called after the value is
453 unreachable for the last time instead of the first time. So contrary to
454 Gc.finalise the value will never be reachable again or used again. In
455 particular every weak pointer and ephemeron that contained this value
456 as key or data is unset before running the finalisation function. More‐
457 over the finalisation functions attached with Gc.finalise are always
458 called before the finalisation functions attached with Gc.finalise_last
459 .
460 Since 4.04
463 val finalise_release : unit -> unit
467 A finalisation function may call finalise_release to tell the GC that
469 it can launch the next finalisation function without waiting for the
470 current one to return.
471 type alarm
474 An alarm is a piece of data that calls a user function at the end of
477 each major GC cycle. The following functions are provided to create
478 and delete alarms.
479 val create_alarm : (unit -> unit) -> alarm
483 create_alarm f will arrange for f to be called at the end of each major
486 GC cycle, starting with the current cycle or the next one. A value of
487 type alarm is returned that you can use to call delete_alarm .
488 val delete_alarm : alarm -> unit
492 delete_alarm a will stop the calls to the function associated to a .
495 Calling delete_alarm a again has no effect.
496OCamldoc 2020-02-27 Stdlib.Gc(3)