[prev in list] [next in list] [prev in thread] [next in thread] 

List:       php-doc-cvs
Subject:    [DOC-CVS] [doc-en] master: [GC] Update constant for GC treshold (#2393)
From:       Grégoire_Pineau_via_GitHub <noreply () php ! net>
Date:       2023-03-30 15:54:46
Message-ID: VhE2e0xD9to4YM1N095pMH6MrrFZiGxOdbbeANJ9SA () main ! php ! net
[Download RAW message or body]

Author: Grégoire Pineau (lyrixx)
Committer: GitHub (web-flow)
Pusher: Girgias
Date: 2023-03-30T16:41:34+01:00

Commit: https://github.com/php/doc-en/commit/cff46537f99d702055c2a19cfcf8dec2ab7d375b
Raw diff: https://github.com/php/doc-en/commit/cff46537f99d702055c2a19cfcf8dec2ab7d375b.diff


[GC] Update constant for GC treshold (#2393)

see https://github.com/php/php-src/commit/fd348ec43f#diff-55f3370eb1093e8d005aed49132e9159bf49f8a77d0552a5460ecc9c75f471e8L96


Changed paths:
  M  features/gc.xml


Diff:

diff --git a/features/gc.xml b/features/gc.xml
index 5f6cca2912f..de9c272e51d 100644
--- a/features/gc.xml
+++ b/features/gc.xml
@@ -350,7 +350,7 @@ a: (refcount=2, is_ref=1)=array (
    <para>
     Traditionally, reference counting memory mechanisms, such as that used
     previously by PHP, fail to address circular reference memory leaks;
-    however, as of 5.3.0, PHP implements the synchronous algorithm from the 
+    however, as of 5.3.0, PHP implements the synchronous algorithm from the
     <link xlink:href="&url.gc-paper;">Concurrent Cycle Collection in Reference \
Counted Systems</link>  paper which addresses that issue.
    </para>
@@ -363,7 +363,7 @@ a: (refcount=2, is_ref=1)=array (
     be created when a refcount argument is decreased to a non-zero value.
     Secondly, in a garbage cycle, it is possible to discover which parts are
     garbage by checking whether it is possible to decrease their refcount by
-    one, and then checking which of the zvals have a refcount of zero. 
+    one, and then checking which of the zvals have a refcount of zero.
    </para>
    <para>
      <mediaobject>
@@ -405,7 +405,7 @@ a: (refcount=2, is_ref=1)=array (
     When the garbage collector is turned on, the cycle-finding algorithm as
     described above is executed whenever the root buffer runs full. The root
     buffer has a fixed size of 10,000 possible roots (although you can alter
-    this by changing the <literal>GC_ROOT_BUFFER_MAX_ENTRIES</literal> constant in
+    this by changing the <constant>GC_DEFAULT_THRESHOLD</constant> constant in
     <literal>Zend/zend_gc.c</literal> in the PHP source code, and re-compiling
     PHP). When the garbage collector is turned off, the cycle-finding
     algorithm will never run. However, possible roots will always be recorded
@@ -417,7 +417,7 @@ a: (refcount=2, is_ref=1)=array (
     collection mechanism is turned off, further possible roots will simply not
     be recorded. Those possible roots that are not recorded will never be
     analyzed by the algorithm. If they were part of a circular reference
-    cycle, they would never be cleaned up and would create a memory leak. 
+    cycle, they would never be cleaned up and would create a memory leak.
    </para>
    <para>
     The reason why possible roots are recorded even if the mechanism has been
@@ -435,7 +435,7 @@ a: (refcount=2, is_ref=1)=array (
     setting. It is also possible to force the collection of cycles even if the
     possible root buffer is not full yet. For this, you can use the
     <function>gc_collect_cycles</function> function. This function will return
-    how many cycles were collected by the algorithm. 
+    how many cycles were collected by the algorithm.
    </para>
    <para>
     The rationale behind the ability to turn the mechanism on and off, and to

-- 
PHP Documentation Commits Mailing List (http://www.php.net/)
To unsubscribe, visit: http://www.php.net/unsub.php


[prev in list] [next in list] [prev in thread] [next in thread]