PageRenderTime 47ms CodeModel.GetById 17ms RepoModel.GetById 0ms app.codeStats 0ms

/inc/lib/Vendor/symfony/var-dumper/Cloner/VarCloner.php

https://gitlab.com/semplon/GeniXCMS
PHP | 285 lines | 240 code | 23 blank | 22 comment | 55 complexity | a6299feb771df2e6b35ff3ba18e39f93 MD5 | raw file
Possible License(s): Apache-2.0, LGPL-2.1, MPL-2.0-no-copyleft-exception, BSD-3-Clause, BitTorrent-1.0, JSON, MIT
  1. <?php
  2. /*
  3. * This file is part of the Symfony package.
  4. *
  5. * (c) Fabien Potencier <fabien@symfony.com>
  6. *
  7. * For the full copyright and license information, please view the LICENSE
  8. * file that was distributed with this source code.
  9. */
  10. namespace Symfony\Component\VarDumper\Cloner;
  11. /**
  12. * @author Nicolas Grekas <p@tchwork.com>
  13. */
  14. class VarCloner extends AbstractCloner
  15. {
  16. private static $gid;
  17. private static $arrayCache = [];
  18. /**
  19. * {@inheritdoc}
  20. */
  21. protected function doClone($var)
  22. {
  23. $len = 1; // Length of $queue
  24. $pos = 0; // Number of cloned items past the minimum depth
  25. $refsCounter = 0; // Hard references counter
  26. $queue = [[$var]]; // This breadth-first queue is the return value
  27. $indexedArrays = []; // Map of queue indexes that hold numerically indexed arrays
  28. $hardRefs = []; // Map of original zval ids to stub objects
  29. $objRefs = []; // Map of original object handles to their stub object counterpart
  30. $objects = []; // Keep a ref to objects to ensure their handle cannot be reused while cloning
  31. $resRefs = []; // Map of original resource handles to their stub object counterpart
  32. $values = []; // Map of stub objects' ids to original values
  33. $maxItems = $this->maxItems;
  34. $maxString = $this->maxString;
  35. $minDepth = $this->minDepth;
  36. $currentDepth = 0; // Current tree depth
  37. $currentDepthFinalIndex = 0; // Final $queue index for current tree depth
  38. $minimumDepthReached = 0 === $minDepth; // Becomes true when minimum tree depth has been reached
  39. $cookie = (object) []; // Unique object used to detect hard references
  40. $a = null; // Array cast for nested structures
  41. $stub = null; // Stub capturing the main properties of an original item value
  42. // or null if the original value is used directly
  43. if (!$gid = self::$gid) {
  44. $gid = self::$gid = uniqid(mt_rand(), true); // Unique string used to detect the special $GLOBALS variable
  45. }
  46. $arrayStub = new Stub();
  47. $arrayStub->type = Stub::TYPE_ARRAY;
  48. $fromObjCast = false;
  49. for ($i = 0; $i < $len; ++$i) {
  50. // Detect when we move on to the next tree depth
  51. if ($i > $currentDepthFinalIndex) {
  52. ++$currentDepth;
  53. $currentDepthFinalIndex = $len - 1;
  54. if ($currentDepth >= $minDepth) {
  55. $minimumDepthReached = true;
  56. }
  57. }
  58. $refs = $vals = $queue[$i];
  59. foreach ($vals as $k => $v) {
  60. // $v is the original value or a stub object in case of hard references
  61. if (\PHP_VERSION_ID >= 70400) {
  62. $zvalIsRef = null !== \ReflectionReference::fromArrayElement($vals, $k);
  63. } else {
  64. $refs[$k] = $cookie;
  65. $zvalIsRef = $vals[$k] === $cookie;
  66. }
  67. if ($zvalIsRef) {
  68. $vals[$k] = &$stub; // Break hard references to make $queue completely
  69. unset($stub); // independent from the original structure
  70. if ($v instanceof Stub && isset($hardRefs[spl_object_id($v)])) {
  71. $vals[$k] = $refs[$k] = $v;
  72. if ($v->value instanceof Stub && (Stub::TYPE_OBJECT === $v->value->type || Stub::TYPE_RESOURCE === $v->value->type)) {
  73. ++$v->value->refCount;
  74. }
  75. ++$v->refCount;
  76. continue;
  77. }
  78. $refs[$k] = $vals[$k] = new Stub();
  79. $refs[$k]->value = $v;
  80. $h = spl_object_id($refs[$k]);
  81. $hardRefs[$h] = &$refs[$k];
  82. $values[$h] = $v;
  83. $vals[$k]->handle = ++$refsCounter;
  84. }
  85. // Create $stub when the original value $v can not be used directly
  86. // If $v is a nested structure, put that structure in array $a
  87. switch (true) {
  88. case null === $v:
  89. case \is_bool($v):
  90. case \is_int($v):
  91. case \is_float($v):
  92. continue 2;
  93. case \is_string($v):
  94. if ('' === $v) {
  95. continue 2;
  96. }
  97. if (!preg_match('//u', $v)) {
  98. $stub = new Stub();
  99. $stub->type = Stub::TYPE_STRING;
  100. $stub->class = Stub::STRING_BINARY;
  101. if (0 <= $maxString && 0 < $cut = \strlen($v) - $maxString) {
  102. $stub->cut = $cut;
  103. $stub->value = substr($v, 0, -$cut);
  104. } else {
  105. $stub->value = $v;
  106. }
  107. } elseif (0 <= $maxString && isset($v[1 + ($maxString >> 2)]) && 0 < $cut = mb_strlen($v, 'UTF-8') - $maxString) {
  108. $stub = new Stub();
  109. $stub->type = Stub::TYPE_STRING;
  110. $stub->class = Stub::STRING_UTF8;
  111. $stub->cut = $cut;
  112. $stub->value = mb_substr($v, 0, $maxString, 'UTF-8');
  113. } else {
  114. continue 2;
  115. }
  116. $a = null;
  117. break;
  118. case \is_array($v):
  119. if (!$v) {
  120. continue 2;
  121. }
  122. $stub = $arrayStub;
  123. $stub->class = Stub::ARRAY_INDEXED;
  124. $j = -1;
  125. foreach ($v as $gk => $gv) {
  126. if ($gk !== ++$j) {
  127. $stub->class = Stub::ARRAY_ASSOC;
  128. break;
  129. }
  130. }
  131. $a = $v;
  132. if (Stub::ARRAY_ASSOC === $stub->class) {
  133. // Copies of $GLOBALS have very strange behavior,
  134. // let's detect them with some black magic
  135. $a[$gid] = true;
  136. // Happens with copies of $GLOBALS
  137. if (isset($v[$gid])) {
  138. unset($v[$gid]);
  139. $a = [];
  140. foreach ($v as $gk => &$gv) {
  141. $a[$gk] = &$gv;
  142. }
  143. unset($gv);
  144. } else {
  145. $a = $v;
  146. }
  147. }
  148. break;
  149. case \is_object($v):
  150. case $v instanceof \__PHP_Incomplete_Class:
  151. if (empty($objRefs[$h = spl_object_id($v)])) {
  152. $stub = new Stub();
  153. $stub->type = Stub::TYPE_OBJECT;
  154. $stub->class = \get_class($v);
  155. $stub->value = $v;
  156. $stub->handle = $h;
  157. $a = $this->castObject($stub, 0 < $i);
  158. if ($v !== $stub->value) {
  159. if (Stub::TYPE_OBJECT !== $stub->type || null === $stub->value) {
  160. break;
  161. }
  162. $stub->handle = $h = spl_object_id($stub->value);
  163. }
  164. $stub->value = null;
  165. if (0 <= $maxItems && $maxItems <= $pos && $minimumDepthReached) {
  166. $stub->cut = \count($a);
  167. $a = null;
  168. }
  169. }
  170. if (empty($objRefs[$h])) {
  171. $objRefs[$h] = $stub;
  172. $objects[] = $v;
  173. } else {
  174. $stub = $objRefs[$h];
  175. ++$stub->refCount;
  176. $a = null;
  177. }
  178. break;
  179. default: // resource
  180. if (empty($resRefs[$h = (int) $v])) {
  181. $stub = new Stub();
  182. $stub->type = Stub::TYPE_RESOURCE;
  183. if ('Unknown' === $stub->class = @get_resource_type($v)) {
  184. $stub->class = 'Closed';
  185. }
  186. $stub->value = $v;
  187. $stub->handle = $h;
  188. $a = $this->castResource($stub, 0 < $i);
  189. $stub->value = null;
  190. if (0 <= $maxItems && $maxItems <= $pos && $minimumDepthReached) {
  191. $stub->cut = \count($a);
  192. $a = null;
  193. }
  194. }
  195. if (empty($resRefs[$h])) {
  196. $resRefs[$h] = $stub;
  197. } else {
  198. $stub = $resRefs[$h];
  199. ++$stub->refCount;
  200. $a = null;
  201. }
  202. break;
  203. }
  204. if ($a) {
  205. if (!$minimumDepthReached || 0 > $maxItems) {
  206. $queue[$len] = $a;
  207. $stub->position = $len++;
  208. } elseif ($pos < $maxItems) {
  209. if ($maxItems < $pos += \count($a)) {
  210. $a = \array_slice($a, 0, $maxItems - $pos);
  211. if ($stub->cut >= 0) {
  212. $stub->cut += $pos - $maxItems;
  213. }
  214. }
  215. $queue[$len] = $a;
  216. $stub->position = $len++;
  217. } elseif ($stub->cut >= 0) {
  218. $stub->cut += \count($a);
  219. $stub->position = 0;
  220. }
  221. }
  222. if ($arrayStub === $stub) {
  223. if ($arrayStub->cut) {
  224. $stub = [$arrayStub->cut, $arrayStub->class => $arrayStub->position];
  225. $arrayStub->cut = 0;
  226. } elseif (isset(self::$arrayCache[$arrayStub->class][$arrayStub->position])) {
  227. $stub = self::$arrayCache[$arrayStub->class][$arrayStub->position];
  228. } else {
  229. self::$arrayCache[$arrayStub->class][$arrayStub->position] = $stub = [$arrayStub->class => $arrayStub->position];
  230. }
  231. }
  232. if ($zvalIsRef) {
  233. $refs[$k]->value = $stub;
  234. } else {
  235. $vals[$k] = $stub;
  236. }
  237. }
  238. if ($fromObjCast) {
  239. $fromObjCast = false;
  240. $refs = $vals;
  241. $vals = [];
  242. $j = -1;
  243. foreach ($queue[$i] as $k => $v) {
  244. foreach ([$k => true] as $gk => $gv) {
  245. }
  246. if ($gk !== $k) {
  247. $vals = (object) $vals;
  248. $vals->{$k} = $refs[++$j];
  249. $vals = (array) $vals;
  250. } else {
  251. $vals[$k] = $refs[++$j];
  252. }
  253. }
  254. }
  255. $queue[$i] = $vals;
  256. }
  257. foreach ($values as $h => $v) {
  258. $hardRefs[$h] = $v;
  259. }
  260. return $queue;
  261. }
  262. }