<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en_US" xml:lang="en_US">
<head>
<title>kjs: collector.cpp Source File (kjs)</title>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<meta http-equiv="Content-Style-Type" content="text/css" />
<meta http-equiv="pics-label" content='(pics-1.1 "http://www.icra.org/ratingsv02.html" comment "ICRAonline DE v2.0" l gen true for "http://www.kde.org" r (nz 1 vz 1 lz 1 oz 1 cb 1) "http://www.rsac.org/ratingsv01.html" l gen true for "http://www.kde.org" r (n 0 s 0 v 0 l 0))' />
<meta name="trademark" content="KDE e.V." />
<meta name="description" content="K Desktop Environment Homepage, KDE.org" />
<meta name="MSSmartTagsPreventParsing" content="true" />
<meta name="robots" content="all" />
<link rel="shortcut icon" href="../../favicon.ico" />
<link rel="stylesheet" media="screen" type="text/css" title="APIDOX" href="doxygen.css" />
</head>
<body>
<div id="nav_header_top" align="right">
<a href="#content" class="doNotDisplay" accesskey="2">Skip to main content ::</a>
<a href="../.."><img id="nav_header_logo" alt="Home" align="left" src="../../kde_gear_64.png" border="0" /></a>
<span class="doNotDisplay">::</span>
<div id="nav_header_title" align="left">KDE API Reference</div>
</div>
<div id="nav_header_bottom" align="right">
<span class="doNotDisplay">:: <a href="#navigation" accesskey="5">Skip to Link Menu</a><br/></span>
<div id="nav_header_bottom_right" style="text-align: left;">
/ <a href="../..">API Reference</a>
/ <a href=".">kjs</a>
</div>
</div>
<table id="main" border="0" cellpadding="0" cellspacing="0" width="100%">
<tr>
<td valign="top" class="menuheader" height="0"></td>
<td id="contentcolumn" valign="top" rowspan="2" >
<div id="content" style="padding-top: 0px;"><div style="width:100%; margin: 0px; padding: 0px;">
<a name="content"></a>
<!-- Generated by Doxygen 1.7.4 -->
<div class="header">
<div class="headertitle">
<div class="title">collector.cpp</div> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// -*- c-basic-offset: 2 -*-</span>
<a name="l00002"></a>00002 <span class="comment">/*</span>
<a name="l00003"></a>00003 <span class="comment"> * This file is part of the KDE libraries</span>
<a name="l00004"></a>00004 <span class="comment"> * Copyright (C) 2003 Apple Computer, Inc.</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * This library is free software; you can redistribute it and/or</span>
<a name="l00007"></a>00007 <span class="comment"> * modify it under the terms of the GNU Lesser General Public</span>
<a name="l00008"></a>00008 <span class="comment"> * License as published by the Free Software Foundation; either</span>
<a name="l00009"></a>00009 <span class="comment"> * version 2 of the License, or (at your option) any later version.</span>
<a name="l00010"></a>00010 <span class="comment"> *</span>
<a name="l00011"></a>00011 <span class="comment"> * This library is distributed in the hope that it will be useful,</span>
<a name="l00012"></a>00012 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00013"></a>00013 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
<a name="l00014"></a>00014 <span class="comment"> * Lesser General Public License for more details.</span>
<a name="l00015"></a>00015 <span class="comment"> *</span>
<a name="l00016"></a>00016 <span class="comment"> * You should have received a copy of the GNU Lesser General Public</span>
<a name="l00017"></a>00017 <span class="comment"> * License along with this library; if not, write to the Free Software</span>
<a name="l00018"></a>00018 <span class="comment"> * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA</span>
<a name="l00019"></a>00019 <span class="comment"> *</span>
<a name="l00020"></a>00020 <span class="comment"> */</span>
<a name="l00021"></a>00021
<a name="l00022"></a>00022 <span class="preprocessor">#include "collector.h"</span>
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="preprocessor">#include "value.h"</span>
<a name="l00025"></a>00025 <span class="preprocessor">#include "internal.h"</span>
<a name="l00026"></a>00026 <span class="preprocessor">#include <limits.h></span>
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="preprocessor">#ifndef MAX</span>
<a name="l00029"></a>00029 <span class="preprocessor"></span><span class="preprocessor">#define MAX(a,b) ((a) > (b) ? (a) : (b))</span>
<a name="l00030"></a>00030 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00031"></a>00031 <span class="preprocessor"></span>
<a name="l00032"></a>00032 <span class="keyword">namespace </span>KJS {
<a name="l00033"></a>00033
<a name="l00034"></a>00034 <span class="comment">// tunable parameters</span>
<a name="l00035"></a>00035 <span class="keyword">const</span> <span class="keywordtype">int</span> MINIMUM_CELL_SIZE = 56;
<a name="l00036"></a>00036 <span class="keyword">const</span> <span class="keywordtype">int</span> BLOCK_SIZE = (8 * 4096);
<a name="l00037"></a>00037 <span class="keyword">const</span> <span class="keywordtype">int</span> SPARE_EMPTY_BLOCKS = 2;
<a name="l00038"></a>00038 <span class="keyword">const</span> <span class="keywordtype">int</span> MIN_ARRAY_SIZE = 14;
<a name="l00039"></a>00039 <span class="keyword">const</span> <span class="keywordtype">int</span> GROWTH_FACTOR = 2;
<a name="l00040"></a>00040 <span class="keyword">const</span> <span class="keywordtype">int</span> LOW_WATER_FACTOR = 4;
<a name="l00041"></a>00041 <span class="keyword">const</span> <span class="keywordtype">int</span> ALLOCATIONS_PER_COLLECTION = 1000;
<a name="l00042"></a>00042
<a name="l00043"></a>00043 <span class="comment">// derived constants</span>
<a name="l00044"></a>00044 <span class="keyword">const</span> <span class="keywordtype">int</span> CELL_ARRAY_LENGTH = (MINIMUM_CELL_SIZE / <span class="keyword">sizeof</span>(double)) + (MINIMUM_CELL_SIZE % <span class="keyword">sizeof</span>(double) != 0 ? <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>) : 0);
<a name="l00045"></a>00045 <span class="keyword">const</span> <span class="keywordtype">int</span> CELL_SIZE = CELL_ARRAY_LENGTH * <span class="keyword">sizeof</span>(double);
<a name="l00046"></a>00046 <span class="keyword">const</span> <span class="keywordtype">int</span> CELLS_PER_BLOCK = ((BLOCK_SIZE * 8 - <span class="keyword">sizeof</span>(int) * 8 - <span class="keyword">sizeof</span>(<span class="keywordtype">void</span> *) * 8) / (CELL_SIZE * 8));
<a name="l00047"></a>00047
<a name="l00048"></a>00048
<a name="l00049"></a>00049
<a name="l00050"></a>00050 <span class="keyword">struct </span>CollectorCell {
<a name="l00051"></a>00051 <span class="keywordtype">double</span> memory[CELL_ARRAY_LENGTH];
<a name="l00052"></a>00052 };
<a name="l00053"></a>00053
<a name="l00054"></a>00054
<a name="l00055"></a>00055 <span class="keyword">struct </span>CollectorBlock {
<a name="l00056"></a>00056 CollectorCell cells[CELLS_PER_BLOCK];
<a name="l00057"></a>00057 <span class="keywordtype">int</span> usedCells;
<a name="l00058"></a>00058 CollectorCell *freeList;
<a name="l00059"></a>00059 };
<a name="l00060"></a>00060
<a name="l00061"></a>00061 <span class="keyword">struct </span>CollectorHeap {
<a name="l00062"></a>00062 CollectorBlock **blocks;
<a name="l00063"></a>00063 <span class="keywordtype">int</span> numBlocks;
<a name="l00064"></a>00064 <span class="keywordtype">int</span> usedBlocks;
<a name="l00065"></a>00065 <span class="keywordtype">int</span> firstBlockWithPossibleSpace;
<a name="l00066"></a>00066
<a name="l00067"></a>00067 CollectorCell **oversizeCells;
<a name="l00068"></a>00068 <span class="keywordtype">int</span> numOversizeCells;
<a name="l00069"></a>00069 <span class="keywordtype">int</span> usedOversizeCells;
<a name="l00070"></a>00070
<a name="l00071"></a>00071 <span class="keywordtype">int</span> numLiveObjects;
<a name="l00072"></a>00072 <span class="keywordtype">int</span> numAllocationsSinceLastCollect;
<a name="l00073"></a>00073 };
<a name="l00074"></a>00074
<a name="l00075"></a>00075 <span class="keyword">static</span> CollectorHeap heap = {NULL, 0, 0, 0, NULL, 0, 0, 0, 0};
<a name="l00076"></a>00076
<a name="l00077"></a>00077 <span class="keywordtype">bool</span> Collector::memoryFull = <span class="keyword">false</span>;
<a name="l00078"></a>00078
<a name="l00079"></a><a class="code" href="classKJS_1_1Collector.html#a82ab0f2a4b1a30d51d152432d92b00d4">00079</a> <span class="keywordtype">void</span>* <a class="code" href="classKJS_1_1Collector.html#a82ab0f2a4b1a30d51d152432d92b00d4" title="Register an object with the collector.">Collector::allocate</a>(<span class="keywordtype">size_t</span> s)
<a name="l00080"></a>00080 {
<a name="l00081"></a>00081 <span class="keywordflow">if</span> (s == 0)
<a name="l00082"></a>00082 <span class="keywordflow">return</span> 0L;
<a name="l00083"></a>00083
<a name="l00084"></a>00084 <span class="comment">// collect if needed</span>
<a name="l00085"></a>00085 <span class="keywordflow">if</span> (++heap.numAllocationsSinceLastCollect >= ALLOCATIONS_PER_COLLECTION) {
<a name="l00086"></a>00086 <a class="code" href="classKJS_1_1Collector.html#af5a69f9e35f2698694bbbac983eb5272" title="Run the garbage collection.">collect</a>();
<a name="l00087"></a>00087 }
<a name="l00088"></a>00088
<a name="l00089"></a>00089 <span class="keywordflow">if</span> (s > (<span class="keywordtype">unsigned</span>)CELL_SIZE) {
<a name="l00090"></a>00090 <span class="comment">// oversize allocator</span>
<a name="l00091"></a>00091 <span class="keywordflow">if</span> (heap.usedOversizeCells == heap.numOversizeCells) {
<a name="l00092"></a>00092 heap.numOversizeCells = MAX(MIN_ARRAY_SIZE, heap.numOversizeCells * GROWTH_FACTOR);
<a name="l00093"></a>00093 heap.oversizeCells = (CollectorCell **)realloc(heap.oversizeCells, heap.numOversizeCells * <span class="keyword">sizeof</span>(CollectorCell *));
<a name="l00094"></a>00094 }
<a name="l00095"></a>00095
<a name="l00096"></a>00096 <span class="keywordtype">void</span> *newCell = malloc(s);
<a name="l00097"></a>00097 heap.oversizeCells[heap.usedOversizeCells] = (CollectorCell *)newCell;
<a name="l00098"></a>00098 heap.usedOversizeCells++;
<a name="l00099"></a>00099 heap.numLiveObjects++;
<a name="l00100"></a>00100
<a name="l00101"></a>00101 ((<a class="code" href="classKJS_1_1ValueImp.html" title="ValueImp is the base type for all primitives (Undefined, Null, Boolean, String, Number) and objects i...">ValueImp</a> *)(newCell))->_flags = 0;
<a name="l00102"></a>00102 <span class="keywordflow">return</span> newCell;
<a name="l00103"></a>00103 }
<a name="l00104"></a>00104
<a name="l00105"></a>00105 <span class="comment">// slab allocator</span>
<a name="l00106"></a>00106
<a name="l00107"></a>00107 CollectorBlock *targetBlock = NULL;
<a name="l00108"></a>00108
<a name="l00109"></a>00109 <span class="keywordtype">int</span> i;
<a name="l00110"></a>00110 <span class="keywordflow">for</span> (i = heap.firstBlockWithPossibleSpace; i < heap.usedBlocks; i++) {
<a name="l00111"></a>00111 <span class="keywordflow">if</span> (heap.blocks[i]->usedCells < CELLS_PER_BLOCK) {
<a name="l00112"></a>00112 targetBlock = heap.blocks[i];
<a name="l00113"></a>00113 <span class="keywordflow">break</span>;
<a name="l00114"></a>00114 }
<a name="l00115"></a>00115 }
<a name="l00116"></a>00116
<a name="l00117"></a>00117 heap.firstBlockWithPossibleSpace = i;
<a name="l00118"></a>00118
<a name="l00119"></a>00119 <span class="keywordflow">if</span> (targetBlock == NULL) {
<a name="l00120"></a>00120 <span class="comment">// didn't find one, need to allocate a new block</span>
<a name="l00121"></a>00121
<a name="l00122"></a>00122 <span class="keywordflow">if</span> (heap.usedBlocks == heap.numBlocks) {
<a name="l00123"></a>00123 <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> maxNumBlocks = ULONG_MAX / <span class="keyword">sizeof</span>(CollectorBlock*) / GROWTH_FACTOR;
<a name="l00124"></a>00124 <span class="keywordflow">if</span> (heap.numBlocks > maxNumBlocks)
<a name="l00125"></a>00125 <span class="keywordflow">return</span> 0L;
<a name="l00126"></a>00126 heap.numBlocks = MAX(MIN_ARRAY_SIZE, heap.numBlocks * GROWTH_FACTOR);
<a name="l00127"></a>00127 heap.blocks = (CollectorBlock **)realloc(heap.blocks, heap.numBlocks * <span class="keyword">sizeof</span>(CollectorBlock *));
<a name="l00128"></a>00128 }
<a name="l00129"></a>00129
<a name="l00130"></a>00130 targetBlock = (CollectorBlock *)calloc(1, <span class="keyword">sizeof</span>(CollectorBlock));
<a name="l00131"></a>00131 targetBlock->freeList = targetBlock->cells;
<a name="l00132"></a>00132 heap.blocks[heap.usedBlocks] = targetBlock;
<a name="l00133"></a>00133 heap.usedBlocks++;
<a name="l00134"></a>00134 }
<a name="l00135"></a>00135
<a name="l00136"></a>00136 <span class="comment">// find a free spot in the block and detach it from the free list</span>
<a name="l00137"></a>00137 CollectorCell *newCell = targetBlock->freeList;
<a name="l00138"></a>00138
<a name="l00139"></a>00139 <a class="code" href="classKJS_1_1ValueImp.html" title="ValueImp is the base type for all primitives (Undefined, Null, Boolean, String, Number) and objects i...">ValueImp</a> *imp = (<a class="code" href="classKJS_1_1ValueImp.html" title="ValueImp is the base type for all primitives (Undefined, Null, Boolean, String, Number) and objects i...">ValueImp</a>*)newCell;
<a name="l00140"></a>00140 <span class="keywordflow">if</span> (imp->_vd != NULL) {
<a name="l00141"></a>00141 targetBlock->freeList = (CollectorCell*)(imp->_vd);
<a name="l00142"></a>00142 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (targetBlock->usedCells == (CELLS_PER_BLOCK - 1)) {
<a name="l00143"></a>00143 <span class="comment">// last cell in this block</span>
<a name="l00144"></a>00144 targetBlock->freeList = NULL;
<a name="l00145"></a>00145 } <span class="keywordflow">else</span> {
<a name="l00146"></a>00146 <span class="comment">// all next pointers are initially 0, meaning "next cell"</span>
<a name="l00147"></a>00147 targetBlock->freeList = newCell + 1;
<a name="l00148"></a>00148 }
<a name="l00149"></a>00149
<a name="l00150"></a>00150 targetBlock->usedCells++;
<a name="l00151"></a>00151 heap.numLiveObjects++;
<a name="l00152"></a>00152
<a name="l00153"></a>00153 ((<a class="code" href="classKJS_1_1ValueImp.html" title="ValueImp is the base type for all primitives (Undefined, Null, Boolean, String, Number) and objects i...">ValueImp</a> *)(newCell))->_flags = 0;
<a name="l00154"></a>00154 <span class="keywordflow">return</span> (<span class="keywordtype">void</span> *)(newCell);
<a name="l00155"></a>00155 }
<a name="l00156"></a>00156
<a name="l00157"></a><a class="code" href="classKJS_1_1Collector.html#af5a69f9e35f2698694bbbac983eb5272">00157</a> <span class="keywordtype">bool</span> <a class="code" href="classKJS_1_1Collector.html#af5a69f9e35f2698694bbbac983eb5272" title="Run the garbage collection.">Collector::collect</a>()
<a name="l00158"></a>00158 {
<a name="l00159"></a>00159 <span class="keywordtype">bool</span> deleted = <span class="keyword">false</span>;
<a name="l00160"></a>00160
<a name="l00161"></a>00161 <span class="comment">// MARK: first mark all referenced objects recursively</span>
<a name="l00162"></a>00162 <span class="comment">// starting out from the set of root objects</span>
<a name="l00163"></a>00163 <span class="keywordflow">if</span> (InterpreterImp::s_hook) {
<a name="l00164"></a>00164 InterpreterImp *scr = InterpreterImp::s_hook;
<a name="l00165"></a>00165 <span class="keywordflow">do</span> {
<a name="l00166"></a>00166 <span class="comment">//fprintf( stderr, "Collector marking interpreter %p\n",(void*)scr);</span>
<a name="l00167"></a>00167 scr->mark();
<a name="l00168"></a>00168 scr = scr->next;
<a name="l00169"></a>00169 } <span class="keywordflow">while</span> (scr != InterpreterImp::s_hook);
<a name="l00170"></a>00170 }
<a name="l00171"></a>00171
<a name="l00172"></a>00172 <span class="comment">// mark any other objects that we wouldn't delete anyway</span>
<a name="l00173"></a>00173 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> block = 0; block < heap.usedBlocks; block++) {
<a name="l00174"></a>00174
<a name="l00175"></a>00175 <span class="keywordtype">int</span> minimumCellsToProcess = heap.blocks[block]->usedCells;
<a name="l00176"></a>00176 CollectorBlock *curBlock = heap.blocks[block];
<a name="l00177"></a>00177
<a name="l00178"></a>00178 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> cell = 0; cell < CELLS_PER_BLOCK; cell++) {
<a name="l00179"></a>00179 <span class="keywordflow">if</span> (minimumCellsToProcess < cell) {
<a name="l00180"></a>00180 <span class="keywordflow">goto</span> skip_block_mark;
<a name="l00181"></a>00181 }
<a name="l00182"></a>00182
<a name="l00183"></a>00183 <a class="code" href="classKJS_1_1ValueImp.html" title="ValueImp is the base type for all primitives (Undefined, Null, Boolean, String, Number) and objects i...">ValueImp</a> *imp = (<a class="code" href="classKJS_1_1ValueImp.html" title="ValueImp is the base type for all primitives (Undefined, Null, Boolean, String, Number) and objects i...">ValueImp</a> *)(curBlock->cells + cell);
<a name="l00184"></a>00184
<a name="l00185"></a>00185 <span class="keywordflow">if</span> (!(imp->_flags & ValueImp::VI_DESTRUCTED)) {
<a name="l00186"></a>00186
<a name="l00187"></a>00187 <span class="keywordflow">if</span> ((imp->_flags & (ValueImp::VI_CREATED|ValueImp::VI_MARKED)) == ValueImp::VI_CREATED &&
<a name="l00188"></a>00188 ((imp->_flags & ValueImp::VI_GCALLOWED) == 0 || imp->refcount != 0)) {
<a name="l00189"></a>00189 imp->mark();
<a name="l00190"></a>00190 }
<a name="l00191"></a>00191 } <span class="keywordflow">else</span> {
<a name="l00192"></a>00192 minimumCellsToProcess++;
<a name="l00193"></a>00193 }
<a name="l00194"></a>00194 }
<a name="l00195"></a>00195 skip_block_mark: ;
<a name="l00196"></a>00196 }
<a name="l00197"></a>00197
<a name="l00198"></a>00198 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> cell = 0; cell < heap.usedOversizeCells; cell++) {
<a name="l00199"></a>00199 <a class="code" href="classKJS_1_1ValueImp.html" title="ValueImp is the base type for all primitives (Undefined, Null, Boolean, String, Number) and objects i...">ValueImp</a> *imp = (<a class="code" href="classKJS_1_1ValueImp.html" title="ValueImp is the base type for all primitives (Undefined, Null, Boolean, String, Number) and objects i...">ValueImp</a> *)heap.oversizeCells[cell];
<a name="l00200"></a>00200 if ((imp->_flags & (ValueImp::VI_CREATED|ValueImp::VI_MARKED)) == ValueImp::VI_CREATED &&
<a name="l00201"></a>00201 ((imp->_flags & ValueImp::VI_GCALLOWED) == 0 || imp->refcount != 0)) {
<a name="l00202"></a>00202 imp->mark();
<a name="l00203"></a>00203 }
<a name="l00204"></a>00204 }
<a name="l00205"></a>00205
<a name="l00206"></a>00206 <span class="comment">// SWEEP: delete everything with a zero refcount (garbage) and unmark everything else</span>
<a name="l00207"></a>00207
<a name="l00208"></a>00208 <span class="keywordtype">int</span> emptyBlocks = 0;
<a name="l00209"></a>00209
<a name="l00210"></a>00210 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> block = 0; block < heap.usedBlocks; block++) {
<a name="l00211"></a>00211 CollectorBlock *curBlock = heap.blocks[block];
<a name="l00212"></a>00212
<a name="l00213"></a>00213 <span class="keywordtype">int</span> minimumCellsToProcess = curBlock->usedCells;
<a name="l00214"></a>00214
<a name="l00215"></a>00215 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> cell = 0; cell < CELLS_PER_BLOCK; cell++) {
<a name="l00216"></a>00216 <span class="keywordflow">if</span> (minimumCellsToProcess < cell) {
<a name="l00217"></a>00217 <span class="keywordflow">goto</span> skip_block_sweep;
<a name="l00218"></a>00218 }
<a name="l00219"></a>00219
<a name="l00220"></a>00220 <a class="code" href="classKJS_1_1ValueImp.html" title="ValueImp is the base type for all primitives (Undefined, Null, Boolean, String, Number) and objects i...">ValueImp</a> *imp = (<a class="code" href="classKJS_1_1ValueImp.html" title="ValueImp is the base type for all primitives (Undefined, Null, Boolean, String, Number) and objects i...">ValueImp</a> *)(curBlock->cells + cell);
<a name="l00221"></a>00221
<a name="l00222"></a>00222 <span class="keywordflow">if</span> (!(imp->_flags & ValueImp::VI_DESTRUCTED)) {
<a name="l00223"></a>00223 <span class="keywordflow">if</span> (!imp->refcount && imp->_flags == (ValueImp::VI_GCALLOWED | ValueImp::VI_CREATED)) {
<a name="l00224"></a>00224 <span class="comment">//fprintf( stderr, "Collector::deleting ValueImp %p (%s)\n", (void*)imp, typeid(*imp).name());</span>
<a name="l00225"></a>00225 <span class="comment">// emulate destructing part of 'operator delete()'</span>
<a name="l00226"></a>00226 imp->~ValueImp();
<a name="l00227"></a>00227 curBlock->usedCells--;
<a name="l00228"></a>00228 heap.numLiveObjects--;
<a name="l00229"></a>00229 deleted = <span class="keyword">true</span>;
<a name="l00230"></a>00230
<a name="l00231"></a>00231 <span class="comment">// put it on the free list</span>
<a name="l00232"></a>00232 imp->_vd = (ValueImpPrivate*)curBlock->freeList;
<a name="l00233"></a>00233 curBlock->freeList = (CollectorCell *)imp;
<a name="l00234"></a>00234
<a name="l00235"></a>00235 } <span class="keywordflow">else</span> {
<a name="l00236"></a>00236 imp->_flags &= ~<a class="code" href="classKJS_1_1ValueImp.html" title="ValueImp is the base type for all primitives (Undefined, Null, Boolean, String, Number) and objects i...">ValueImp</a>::VI_MARKED;
<a name="l00237"></a>00237 }
<a name="l00238"></a>00238 } <span class="keywordflow">else</span> {
<a name="l00239"></a>00239 minimumCellsToProcess++;
<a name="l00240"></a>00240 }
<a name="l00241"></a>00241 }
<a name="l00242"></a>00242
<a name="l00243"></a>00243 skip_block_sweep:
<a name="l00244"></a>00244
<a name="l00245"></a>00245 <span class="keywordflow">if</span> (heap.blocks[block]->usedCells == 0) {
<a name="l00246"></a>00246 emptyBlocks++;
<a name="l00247"></a>00247 <span class="keywordflow">if</span> (emptyBlocks > SPARE_EMPTY_BLOCKS) {
<a name="l00248"></a>00248 <span class="preprocessor">#ifndef DEBUG_COLLECTOR</span>
<a name="l00249"></a>00249 <span class="preprocessor"></span> free(heap.blocks[block]);
<a name="l00250"></a>00250 <span class="preprocessor">#endif</span>
<a name="l00251"></a>00251 <span class="preprocessor"></span> <span class="comment">// swap with the last block so we compact as we go</span>
<a name="l00252"></a>00252 heap.blocks[block] = heap.blocks[heap.usedBlocks - 1];
<a name="l00253"></a>00253 heap.usedBlocks--;
<a name="l00254"></a>00254 block--; <span class="comment">// Don't move forward a step in this case</span>
<a name="l00255"></a>00255
<a name="l00256"></a>00256 <span class="keywordflow">if</span> (heap.numBlocks > MIN_ARRAY_SIZE && heap.usedBlocks < heap.numBlocks / LOW_WATER_FACTOR) {
<a name="l00257"></a>00257 heap.numBlocks = heap.numBlocks / GROWTH_FACTOR;
<a name="l00258"></a>00258 heap.blocks = (CollectorBlock **)realloc(heap.blocks, heap.numBlocks * <span class="keyword">sizeof</span>(CollectorBlock *));
<a name="l00259"></a>00259 }
<a name="l00260"></a>00260 }
<a name="l00261"></a>00261 }
<a name="l00262"></a>00262 }
<a name="l00263"></a>00263
<a name="l00264"></a>00264 <span class="keywordflow">if</span> (deleted) {
<a name="l00265"></a>00265 heap.firstBlockWithPossibleSpace = 0;
<a name="l00266"></a>00266 }
<a name="l00267"></a>00267
<a name="l00268"></a>00268 <span class="keywordtype">int</span> cell = 0;
<a name="l00269"></a>00269 <span class="keywordflow">while</span> (cell < heap.usedOversizeCells) {
<a name="l00270"></a>00270 <a class="code" href="classKJS_1_1ValueImp.html" title="ValueImp is the base type for all primitives (Undefined, Null, Boolean, String, Number) and objects i...">ValueImp</a> *imp = (<a class="code" href="classKJS_1_1ValueImp.html" title="ValueImp is the base type for all primitives (Undefined, Null, Boolean, String, Number) and objects i...">ValueImp</a> *)heap.oversizeCells[cell];
<a name="l00271"></a>00271
<a name="l00272"></a>00272 if (!imp->refcount &&
<a name="l00273"></a>00273 imp->_flags == (ValueImp::VI_GCALLOWED | ValueImp::VI_CREATED)) {
<a name="l00274"></a>00274
<a name="l00275"></a>00275 imp->~ValueImp();
<a name="l00276"></a>00276 <span class="preprocessor">#ifndef DEBUG_COLLECTOR</span>
<a name="l00277"></a>00277 <span class="preprocessor"></span> free((<span class="keywordtype">void</span> *)imp);
<a name="l00278"></a>00278 <span class="preprocessor">#endif</span>
<a name="l00279"></a>00279 <span class="preprocessor"></span>
<a name="l00280"></a>00280 <span class="comment">// swap with the last oversize cell so we compact as we go</span>
<a name="l00281"></a>00281 heap.oversizeCells[cell] = heap.oversizeCells[heap.usedOversizeCells - 1];
<a name="l00282"></a>00282
<a name="l00283"></a>00283 heap.usedOversizeCells--;
<a name="l00284"></a>00284 deleted = <span class="keyword">true</span>;
<a name="l00285"></a>00285 heap.numLiveObjects--;
<a name="l00286"></a>00286
<a name="l00287"></a>00287 <span class="keywordflow">if</span> (heap.numOversizeCells > MIN_ARRAY_SIZE && heap.usedOversizeCells < heap.numOversizeCells / LOW_WATER_FACTOR) {
<a name="l00288"></a>00288 heap.numOversizeCells = heap.numOversizeCells / GROWTH_FACTOR;
<a name="l00289"></a>00289 heap.oversizeCells = (CollectorCell **)realloc(heap.oversizeCells, heap.numOversizeCells * <span class="keyword">sizeof</span>(CollectorCell *));
<a name="l00290"></a>00290 }
<a name="l00291"></a>00291
<a name="l00292"></a>00292 } <span class="keywordflow">else</span> {
<a name="l00293"></a>00293 imp->_flags &= ~<a class="code" href="classKJS_1_1ValueImp.html" title="ValueImp is the base type for all primitives (Undefined, Null, Boolean, String, Number) and objects i...">ValueImp</a>::VI_MARKED;
<a name="l00294"></a>00294 cell++;
<a name="l00295"></a>00295 }
<a name="l00296"></a>00296 }
<a name="l00297"></a>00297
<a name="l00298"></a>00298 heap.numAllocationsSinceLastCollect = 0;
<a name="l00299"></a>00299
<a name="l00300"></a>00300 memoryFull = (heap.numLiveObjects >= KJS_MEM_LIMIT);
<a name="l00301"></a>00301
<a name="l00302"></a>00302 <span class="keywordflow">return</span> deleted;
<a name="l00303"></a>00303 }
<a name="l00304"></a>00304
<a name="l00305"></a>00305 <span class="keywordtype">int</span> Collector::size()
<a name="l00306"></a>00306 {
<a name="l00307"></a>00307 <span class="keywordflow">return</span> heap.numLiveObjects;
<a name="l00308"></a>00308 }
<a name="l00309"></a>00309
<a name="l00310"></a>00310 <span class="preprocessor">#ifdef KJS_DEBUG_MEM</span>
<a name="l00311"></a>00311 <span class="preprocessor"></span><span class="keywordtype">void</span> Collector::finalCheck()
<a name="l00312"></a>00312 {
<a name="l00313"></a>00313 }
<a name="l00314"></a>00314 <span class="preprocessor">#endif</span>
<a name="l00315"></a>00315 <span class="preprocessor"></span>
<a name="l00316"></a>00316 } <span class="comment">// namespace KJS</span>
</pre></div></div>
</div>
</div></div>
</td>
</tr>
<tr>
<td valign="top" id="leftmenu" width="25%">
<a name="navigation"></a>
<div class="menu_box"><h2>kjs</h2>
<div class="nav_list">
<ul><li><a href="index.html">Main Page</a></li><li><a href="hierarchy.html">Class Hierarchy</a></li><li><a href="classes.html">Alphabetical List</a></li><li><a href="annotated.html">Class List</a></li><li><a href="files.html">File List</a></li><li><a href="functions.html">Class Members</a></li><li><a href="pages.html">Related Pages</a></li></ul>
<!--
<h2>Class Picker</h2>
<div style="text-align: center;">
<form name="guideform">
<select name="guidelinks" style="width:100%;" onChange="window.location=document.guideform.guidelinks.options[document.guideform.guidelinks.selectedIndex].value">
<option value="annotated.html">-- Choose --</option>
<option value="classKJS_1_1BinaryLogicalNode.html">kjs::binarylogicalnode</option>, <option value="classKJS_1_1Boolean.html">kjs::boolean</option>, <option value="classKJS_1_1Collector.html">kjs::collector</option>, <option value="classKJS_1_1Completion.html">kjs::completion</option>, <option value="classKJS_1_1ConditionalNode.html">kjs::conditionalnode</option>, <option value="classKJS_1_1Context.html">kjs::context</option>, <option value="classKJS_1_1ContextImp.html">kjs::contextimp</option>, <option value="classKJS_1_1CString.html">kjs::cstring</option>, <option value="classKJS_1_1Error.html">kjs::error</option>, <option value="classKJS_1_1ExecState.html">kjs::execstate</option>, <option value="classKJS_1_1FunctionImp.html">kjs::functionimp</option>, <option value="classKJS_1_1FunctionPrototypeImp.html">kjs::functionprototypeimp</option>, <option value="classKJS_1_1Identifier.html">kjs::identifier</option>, <option value="classKJS_1_1InternalFunctionImp.html">kjs::internalfunctionimp</option>, <option value="classKJS_1_1Interpreter.html">kjs::interpreter</option>, <option value="classKJS_1_1LabelStack.html">kjs::labelstack</option>, <option value="classKJS_1_1List.html">kjs::list</option>, <option value="classKJS_1_1ListIterator.html">kjs::listiterator</option>, <option value="classKJS_1_1Lookup.html">kjs::lookup</option>, <option value="classKJS_1_1Null.html">kjs::null</option>, <option value="classKJS_1_1Number.html">kjs::number</option>, <option value="classKJS_1_1Object.html">kjs::object</option>, <option value="classKJS_1_1PropertyMap.html">kjs::propertymap</option>, <option value="classKJS_1_1Reference.html">kjs::reference</option>, <option value="classKJS_1_1ReferenceList.html">kjs::referencelist</option>, <option value="classKJS_1_1ReferenceListIterator.html">kjs::referencelistiterator</option>, <option value="classKJS_1_1SavedProperties.html">kjs::savedproperties</option>, <option value="classKJS_1_1ScopeChain.html">kjs::scopechain</option>, <option value="classKJS_1_1ScopeChainNode.html">kjs::scopechainnode</option>, <option value="classKJS_1_1String.html">kjs::string</option>, <option value="classKJS_1_1UCharReference.html">kjs::ucharreference</option>, <option value="classKJS_1_1Undefined.html">kjs::undefined</option>, <option value="classKJS_1_1UString.html">kjs::ustring</option>, <option value="classKJS_1_1Value.html">kjs::value</option>, <option value="classKJS_1_1ValueImp.html">kjs::valueimp</option>,
</select>
</form>
</div>
-->
</div></div>
<div class="menu_box"><h2>API Dox</h2>
<div class="nav_list">
<ul>
<li><a href="../../arts/html/index.html">arts</a></li><li><a href="../../dcop/html/index.html">dcop</a></li><li><a href="../../dnssd/html/index.html">dnssd</a></li><li><a href="../../interfaces/html/index.html">interfaces</a></li><li> <a href="../../interfaces/kimproxy/interface/html/index.html">interface</a></li><li> <a href="../../interfaces/kimproxy/library/html/index.html">library</a></li><li> <a href="../../interfaces/kspeech/html/index.html">kspeech</a></li><li> <a href="../../interfaces/ktexteditor/html/index.html">ktexteditor</a></li><li><a href="../../kabc/html/index.html">kabc</a></li><li><a href="../../kate/html/index.html">kate</a></li><li><a href="../../kcmshell/html/index.html">kcmshell</a></li><li><a href="../../kdecore/html/index.html">kdecore</a></li><li><a href="../../kded/html/index.html">kded</a></li><li><a href="../../kdefx/html/index.html">kdefx</a></li><li><a href="../../kdeprint/html/index.html">kdeprint</a></li><li><a href="../../kdesu/html/index.html">kdesu</a></li><li><a href="../../kdeui/html/index.html">kdeui</a></li><li><a href="../../kdoctools/html/index.html">kdoctools</a></li><li><a href="../../khtml/html/index.html">khtml</a></li><li><a href="../../kimgio/html/index.html">kimgio</a></li><li><a href="../../kinit/html/index.html">kinit</a></li><li><a href="../../kio/html/index.html">kio</a></li><li> <a href="../../kio/bookmarks/html/index.html">bookmarks</a></li><li> <a href="../../kio/httpfilter/html/index.html">httpfilter</a></li><li> <a href="../../kio/kfile/html/index.html">kfile</a></li><li> <a href="../../kio/kio/html/index.html">kio</a></li><li> <a href="../../kio/kioexec/html/index.html">kioexec</a></li><li> <a href="../../kio/kpasswdserver/html/index.html">kpasswdserver</a></li><li> <a href="../../kio/kssl/html/index.html">kssl</a></li><li><a href="../../kioslave/html/index.html">kioslave</a></li><li> <a href="../../kioslave/http/html/index.html">http</a></li><li><a href="../../kjs/html/index.html">kjs</a></li><li><a href="../../kmdi/html/index.html">kmdi</a></li><li> <a href="../../kmdi/kmdi/html/index.html">kmdi</a></li><li><a href="../../knewstuff/html/index.html">knewstuff</a></li><li><a href="../../kparts/html/index.html">kparts</a></li><li><a href="../../kresources/html/index.html">kresources</a></li><li><a href="../../kspell2/html/index.html">kspell2</a></li><li><a href="../../kunittest/html/index.html">kunittest</a></li><li><a href="../../kutils/html/index.html">kutils</a></li><li><a href="../../kwallet/html/index.html">kwallet</a></li><li><a href="../../libkmid/html/index.html">libkmid</a></li><li><a href="../../libkscreensaver/html/index.html">libkscreensaver</a></li>
</ul></div></div>
</td>
</tr>
</table>
<span class="doNotDisplay">
<a href="http://www.kde.org/" accesskey="8">KDE Home</a> |
<a href="http://accessibility.kde.org/" accesskey="9">KDE Accessibility Home</a> |
<a href="http://www.kde.org/media/accesskeys.php" accesskey="0">Description of Access Keys</a>
</span>
<div style="height: 8px"></div>
<div id="footer">
<div id="footer_left">
Maintained by <a href="mailto:groot@kde.org">Adriaan de Groot</a>
and
<a href="mailto:winter@kde.org">Allen Winter</a>.
<br/>
KDE and K Desktop Environment are trademarks of <a href="http://www.kde.org/areas/kde-ev/" title="Homepage of the KDE non-profit Organization">KDE e.V.</a> |
<a href="http://www.kde.org/contact/impressum.php">Legal</a>
</div>
<div id="footer_right"><img src="/media/images/footer_right.png" style="margin: 0px" alt="" /></div>
</div>
<!--
WARNING: DO NOT SEND MAIL TO THE FOLLOWING EMAIL ADDRESS! YOU WILL
BE BLOCKED INSTANTLY AND PERMANENTLY!
<a href="mailto:aaaatrap-425acc3b5374943f@kde.org">Block me</a>
WARNING END
-->
</body>
</html>
