apr-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "vetty" <vet...@hanmail.net>
Subject apr_palloc(): drawing and printf ing
Date Thu, 07 Aug 2003 16:14:53 GMT
&gt; Could you please sent mail in plain text? Thanks. 
<br>

<br>
I use a free mail, so ... but I've changed my options. I hope so ^^ 
<br>

<br>
&gt; *grin* Do you really want to know? 
<br>

<br>
Just want! Apache module made me go to gory apache sources 8 months ago, and apache made me
be here a month ago. Newbie ^^; 
<br>

<br>
&gt; Well, if it only has one comment, it should be very clear ;). 
<br>

<br>
oot! 
<br>

<br>

<br>
&gt; IOW, take the number of free bytes, round it up to the next 
<br>
&gt; multiple of BOUNDARY_SIZE and then devide it by BOUNDARY_SIZE. 
<br>
&gt; This gives us an index which we can use to compare free amounts 
<br>
&gt; of memory in a node by multiples of BOUNDARY_SIZE. The 
<br>
&gt; advantage is that nodes will be grouped together and the 
<br>
&gt; priority queue has to be reshuffled less. 
<br>

<br>
I got it. 
<br>

<br>
&gt; The part of the code you are looking at checks if the new node 
<br>
&gt; has more memory free (after the allocation) than the currently 
<br>
&gt; active node. If it does, the new node is made the active node. 
<br>
&gt; 
<br>
&gt; The node with less free memory is moved back in the chain, so 
<br>
&gt; that the node with the most memory available is at the front 
<br>
&gt; of the list. 
<br>

<br>
I got it. 
<br>

<br>
&gt; This scheme is a way to use memory a bit more optimal than the 
<br>
&gt; original pools implementation, in a cheap way. 
<br>

<br>
I will ask why it is some times later. 
<br>

<br>
With your help, I am drawing a linked list(node) and printf-ing between lines. 
<br>

<br>
Thanks! Sander 
<br>

<img src="http://premium8.hanmail.net:4280/@from=vet045&rcpt=dev%40apr%2Eapache%2Eorg&msgid=%3C20030808011453%2EHM%2E000000000001c8Y%40premium8%2Ehanmail%2Enet%3E">

Mime
View raw message