1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622
|
<?xml version="1.0"?>
<!DOCTYPE refentry PUBLIC "-//OASIS//DTD DocBook XML V4.1.2//EN"
"http://www.oasis-open.org/docbook/xml/4.1.2/docbookx.dtd">
<refentry id="libedataserver-e-memory">
<refmeta>
<refentrytitle role="top_of_page">e-memory</refentrytitle>
<manvolnum>3</manvolnum>
<refmiscinfo>LIBEDATASERVER Library</refmiscinfo>
</refmeta>
<refnamediv>
<refname>e-memory</refname>
<refpurpose></refpurpose>
<!--[<xref linkend="desc" endterm="desc.title"/>]-->
</refnamediv>
<refsynopsisdiv role="synopsis">
<title role="synopsis.title">Synopsis</title>
<synopsis>
<link linkend="EMemChunk">EMemChunk</link>;
<link linkend="EMemChunk">EMemChunk</link>* <link linkend="e-memchunk-new">e_memchunk_new</link> (<link linkend="int">int</link> atomcount,
<link linkend="int">int</link> atomsize);
<link linkend="void">void</link>* <link linkend="e-memchunk-alloc">e_memchunk_alloc</link> (<link linkend="EMemChunk">EMemChunk</link> *m);
<link linkend="void">void</link>* <link linkend="e-memchunk-alloc0">e_memchunk_alloc0</link> (<link linkend="EMemChunk">EMemChunk</link> *m);
<link linkend="void">void</link> <link linkend="e-memchunk-free">e_memchunk_free</link> (<link linkend="EMemChunk">EMemChunk</link> *m,
<link linkend="void">void</link> *mem);
<link linkend="void">void</link> <link linkend="e-memchunk-empty">e_memchunk_empty</link> (<link linkend="EMemChunk">EMemChunk</link> *m);
<link linkend="void">void</link> <link linkend="e-memchunk-clean">e_memchunk_clean</link> (<link linkend="EMemChunk">EMemChunk</link> *m);
<link linkend="void">void</link> <link linkend="e-memchunk-destroy">e_memchunk_destroy</link> (<link linkend="EMemChunk">EMemChunk</link> *m);
<link linkend="EMemPool">EMemPool</link>;
enum <link linkend="EMemPoolFlags">EMemPoolFlags</link>;
<link linkend="EMemPool">EMemPool</link>* <link linkend="e-mempool-new">e_mempool_new</link> (<link linkend="int">int</link> blocksize,
<link linkend="int">int</link> threshold,
<link linkend="EMemPoolFlags">EMemPoolFlags</link> flags);
<link linkend="void">void</link>* <link linkend="e-mempool-alloc">e_mempool_alloc</link> (<link linkend="EMemPool">EMemPool</link> *pool,
<link linkend="int">int</link> size);
<link linkend="char">char</link>* <link linkend="e-mempool-strdup">e_mempool_strdup</link> (<link linkend="EMemPool">EMemPool</link> *pool,
const <link linkend="char">char</link> *str);
<link linkend="void">void</link> <link linkend="e-mempool-flush">e_mempool_flush</link> (<link linkend="EMemPool">EMemPool</link> *pool,
<link linkend="int">int</link> freeall);
<link linkend="void">void</link> <link linkend="e-mempool-destroy">e_mempool_destroy</link> (<link linkend="EMemPool">EMemPool</link> *pool);
<link linkend="EStrv">EStrv</link>;
<link linkend="EStrv">EStrv</link>* <link linkend="e-strv-new">e_strv_new</link> (<link linkend="int">int</link> size);
<link linkend="EStrv">EStrv</link>* <link linkend="e-strv-set-ref">e_strv_set_ref</link> (<link linkend="EStrv">EStrv</link> *strv,
<link linkend="int">int</link> index,
<link linkend="char">char</link> *str);
<link linkend="EStrv">EStrv</link>* <link linkend="e-strv-set-ref-free">e_strv_set_ref_free</link> (<link linkend="EStrv">EStrv</link> *strv,
<link linkend="int">int</link> index,
<link linkend="char">char</link> *str);
<link linkend="EStrv">EStrv</link>* <link linkend="e-strv-set">e_strv_set</link> (<link linkend="EStrv">EStrv</link> *strv,
<link linkend="int">int</link> index,
const <link linkend="char">char</link> *str);
<link linkend="EStrv">EStrv</link>* <link linkend="e-strv-pack">e_strv_pack</link> (<link linkend="EStrv">EStrv</link> *strv);
<link linkend="char">char</link>* <link linkend="e-strv-get">e_strv_get</link> (<link linkend="EStrv">EStrv</link> *strv,
<link linkend="int">int</link> index);
<link linkend="void">void</link> <link linkend="e-strv-destroy">e_strv_destroy</link> (<link linkend="EStrv">EStrv</link> *strv);
<link linkend="EPoolv">EPoolv</link>;
<link linkend="EPoolv">EPoolv</link>* <link linkend="e-poolv-new">e_poolv_new</link> (unsigned <link linkend="int">int</link> size);
<link linkend="EPoolv">EPoolv</link>* <link linkend="e-poolv-cpy">e_poolv_cpy</link> (<link linkend="EPoolv">EPoolv</link> *dest,
const <link linkend="EPoolv">EPoolv</link> *src);
<link linkend="EPoolv">EPoolv</link>* <link linkend="e-poolv-set">e_poolv_set</link> (<link linkend="EPoolv">EPoolv</link> *poolv,
<link linkend="int">int</link> index,
<link linkend="char">char</link> *str,
<link linkend="int">int</link> freeit);
const <link linkend="char">char</link>* <link linkend="e-poolv-get">e_poolv_get</link> (<link linkend="EPoolv">EPoolv</link> *poolv,
<link linkend="int">int</link> index);
<link linkend="void">void</link> <link linkend="e-poolv-destroy">e_poolv_destroy</link> (<link linkend="EPoolv">EPoolv</link> *poolv);
</synopsis>
</refsynopsisdiv>
<refsect1 role="desc">
<title role="desc.title">Description</title>
<para>
</para>
</refsect1>
<refsect1 role="details">
<title role="details.title">Details</title>
<refsect2>
<title><anchor id="EMemChunk" role="struct"/>EMemChunk</title>
<indexterm><primary>EMemChunk</primary></indexterm><programlisting>typedef struct _EMemChunk EMemChunk;</programlisting>
<para>
</para></refsect2>
<refsect2>
<title><anchor id="e-memchunk-new" role="function"/>e_memchunk_new ()</title>
<indexterm><primary>e_memchunk_new</primary></indexterm><programlisting><link linkend="EMemChunk">EMemChunk</link>* e_memchunk_new (<link linkend="int">int</link> atomcount,
<link linkend="int">int</link> atomsize);</programlisting>
<para>
Create a new memchunk header. Memchunks are an efficient way to allocate
and deallocate identical sized blocks of memory quickly, and space efficiently.
</para>
<para>
e_memchunks are effectively the same as gmemchunks, only faster (much), and
they use less memory overhead for housekeeping.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>atomcount</parameter> :</term>
<listitem><simpara> The number of atoms stored in a single malloc'd block of memory.
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>atomsize</parameter> :</term>
<listitem><simpara> The size of each allocation.
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara> The new header.
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-memchunk-alloc" role="function"/>e_memchunk_alloc ()</title>
<indexterm><primary>e_memchunk_alloc</primary></indexterm><programlisting><link linkend="void">void</link>* e_memchunk_alloc (<link linkend="EMemChunk">EMemChunk</link> *m);</programlisting>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>m</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara>
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-memchunk-alloc0" role="function"/>e_memchunk_alloc0 ()</title>
<indexterm><primary>e_memchunk_alloc0</primary></indexterm><programlisting><link linkend="void">void</link>* e_memchunk_alloc0 (<link linkend="EMemChunk">EMemChunk</link> *m);</programlisting>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>m</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara>
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-memchunk-free" role="function"/>e_memchunk_free ()</title>
<indexterm><primary>e_memchunk_free</primary></indexterm><programlisting><link linkend="void">void</link> e_memchunk_free (<link linkend="EMemChunk">EMemChunk</link> *m,
<link linkend="void">void</link> *mem);</programlisting>
<para>
Free a single atom back to the free pool of atoms in the given
memchunk.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>m</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>mem</parameter> :</term>
<listitem><simpara> Address of atom to free.
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-memchunk-empty" role="function"/>e_memchunk_empty ()</title>
<indexterm><primary>e_memchunk_empty</primary></indexterm><programlisting><link linkend="void">void</link> e_memchunk_empty (<link linkend="EMemChunk">EMemChunk</link> *m);</programlisting>
<para>
Clean out the memchunk buffers. Marks all allocated memory as free blocks,
but does not give it back to the system. Can be used if the memchunk
is to be used repeatedly.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>m</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-memchunk-clean" role="function"/>e_memchunk_clean ()</title>
<indexterm><primary>e_memchunk_clean</primary></indexterm><programlisting><link linkend="void">void</link> e_memchunk_clean (<link linkend="EMemChunk">EMemChunk</link> *m);</programlisting>
<para>
Scan all empty blocks and check for blocks which can be free'd
back to the system.
</para>
<para>
This routine may take a while to run if there are many allocated
memory blocks (if the total number of allocations is many times
greater than atomcount).</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>m</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-memchunk-destroy" role="function"/>e_memchunk_destroy ()</title>
<indexterm><primary>e_memchunk_destroy</primary></indexterm><programlisting><link linkend="void">void</link> e_memchunk_destroy (<link linkend="EMemChunk">EMemChunk</link> *m);</programlisting>
<para>
Free the memchunk header, and all associated memory.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>m</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="EMemPool" role="struct"/>EMemPool</title>
<indexterm><primary>EMemPool</primary></indexterm><programlisting>typedef struct _EMemPool EMemPool;</programlisting>
<para>
</para></refsect2>
<refsect2>
<title><anchor id="EMemPoolFlags" role="enum"/>enum EMemPoolFlags</title>
<indexterm><primary>EMemPoolFlags</primary></indexterm><programlisting>typedef enum {
E_MEMPOOL_ALIGN_STRUCT = 0, /* allocate to native structure alignment */
E_MEMPOOL_ALIGN_WORD = 1, /* allocate to words - 16 bit alignment */
E_MEMPOOL_ALIGN_BYTE = 2, /* allocate to bytes - 8 bit alignment */
E_MEMPOOL_ALIGN_MASK = 3, /* which bits determine the alignment information */
} EMemPoolFlags;
</programlisting>
<para>
</para></refsect2>
<refsect2>
<title><anchor id="e-mempool-new" role="function"/>e_mempool_new ()</title>
<indexterm><primary>e_mempool_new</primary></indexterm><programlisting><link linkend="EMemPool">EMemPool</link>* e_mempool_new (<link linkend="int">int</link> blocksize,
<link linkend="int">int</link> threshold,
<link linkend="EMemPoolFlags">EMemPoolFlags</link> flags);</programlisting>
<para>
Create a new mempool header. Mempools can be used to efficiently
allocate data which can then be freed as a whole.
</para>
<para>
Mempools can also be used to efficiently allocate arbitrarily
aligned data (such as strings) without incurring the space overhead
of aligning each allocation (which is not required for strings).
</para>
<para>
However, each allocation cannot be freed individually, only all
or nothing.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>blocksize</parameter> :</term>
<listitem><simpara> The base blocksize to use for all system alocations.
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>threshold</parameter> :</term>
<listitem><simpara> If the allocation exceeds the threshold, then it is
allocated separately and stored in a separate list.
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>flags</parameter> :</term>
<listitem><simpara> Alignment options: E_MEMPOOL_ALIGN_STRUCT uses native
struct alignment, E_MEMPOOL_ALIGN_WORD aligns to 16 bits (2 bytes),
and E_MEMPOOL_ALIGN_BYTE aligns to the nearest byte. The default
is to align to native structures.
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara>
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-mempool-alloc" role="function"/>e_mempool_alloc ()</title>
<indexterm><primary>e_mempool_alloc</primary></indexterm><programlisting><link linkend="void">void</link>* e_mempool_alloc (<link linkend="EMemPool">EMemPool</link> *pool,
<link linkend="int">int</link> size);</programlisting>
<para>
Allocate a new data block in the mempool. Size will
be rounded up to the mempool's alignment restrictions
before being used.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>pool</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>size</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara>
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-mempool-strdup" role="function"/>e_mempool_strdup ()</title>
<indexterm><primary>e_mempool_strdup</primary></indexterm><programlisting><link linkend="char">char</link>* e_mempool_strdup (<link linkend="EMemPool">EMemPool</link> *pool,
const <link linkend="char">char</link> *str);</programlisting>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>pool</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>str</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara>
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-mempool-flush" role="function"/>e_mempool_flush ()</title>
<indexterm><primary>e_mempool_flush</primary></indexterm><programlisting><link linkend="void">void</link> e_mempool_flush (<link linkend="EMemPool">EMemPool</link> *pool,
<link linkend="int">int</link> freeall);</programlisting>
<para>
Flush used memory and mark allocated blocks as free.
</para>
<para>
If <parameter>freeall</parameter> is <link linkend="TRUE:CAPS"><type>TRUE</type></link>, then all allocated blocks are free'd
as well. Otherwise only blocks above the threshold are
actually freed, and the others are simply marked as empty.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>pool</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>freeall</parameter> :</term>
<listitem><simpara> Free all system allocated blocks as well.
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-mempool-destroy" role="function"/>e_mempool_destroy ()</title>
<indexterm><primary>e_mempool_destroy</primary></indexterm><programlisting><link linkend="void">void</link> e_mempool_destroy (<link linkend="EMemPool">EMemPool</link> *pool);</programlisting>
<para>
Free all memory associated with a mempool.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>pool</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="EStrv" role="struct"/>EStrv</title>
<indexterm><primary>EStrv</primary></indexterm><programlisting>typedef struct _EStrv EStrv;</programlisting>
<para>
</para></refsect2>
<refsect2>
<title><anchor id="e-strv-new" role="function"/>e_strv_new ()</title>
<indexterm><primary>e_strv_new</primary></indexterm><programlisting><link linkend="EStrv">EStrv</link>* e_strv_new (<link linkend="int">int</link> size);</programlisting>
<para>
Create a new strv (string array) header. strv's can be used to
create and work with arrays of strings that can then be compressed
into a space-efficient static structure. This is useful
where a number of strings are to be stored for lookup, and not
generally edited afterwards.
</para>
<para>
The size limit is currently 254 elements. This will probably not
change as arrays of this size suffer significant performance
penalties when looking up strings with high indices.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>size</parameter> :</term>
<listitem><simpara> The number of elements in the strv. Currently this is limited
to 254 elements.
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara>
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-strv-set-ref" role="function"/>e_strv_set_ref ()</title>
<indexterm><primary>e_strv_set_ref</primary></indexterm><programlisting><link linkend="EStrv">EStrv</link>* e_strv_set_ref (<link linkend="EStrv">EStrv</link> *strv,
<link linkend="int">int</link> index,
<link linkend="char">char</link> *str);</programlisting>
<para>
Set a string array element by reference. The string
is not copied until the array is packed.
</para>
<para>
If <parameter>strv</parameter> has been packed, then it is unpacked ready
for more inserts, and should be packed again once finished with.
The memory used by the original <parameter>strv</parameter> is not freed until
the new strv is packed, or freed itself.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>strv</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>index</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>str</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara> A new EStrv if the strv has already
been packed, otherwise <parameter>strv</parameter>.
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-strv-set-ref-free" role="function"/>e_strv_set_ref_free ()</title>
<indexterm><primary>e_strv_set_ref_free</primary></indexterm><programlisting><link linkend="EStrv">EStrv</link>* e_strv_set_ref_free (<link linkend="EStrv">EStrv</link> *strv,
<link linkend="int">int</link> index,
<link linkend="char">char</link> *str);</programlisting>
<para>
Set a string by reference, similar to set_ref, but also
free the string when finished with it. The string
is not copied until the strv is packed, and not at
all if the index is overwritten.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>strv</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>index</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>str</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara> <parameter>strv</parameter> if already unpacked, otherwise an packed
EStrv.
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-strv-set" role="function"/>e_strv_set ()</title>
<indexterm><primary>e_strv_set</primary></indexterm><programlisting><link linkend="EStrv">EStrv</link>* e_strv_set (<link linkend="EStrv">EStrv</link> *strv,
<link linkend="int">int</link> index,
const <link linkend="char">char</link> *str);</programlisting>
<para>
Set a string array reference. The string <parameter>str</parameter> is copied
into the string array at location <parameter>index</parameter>.
</para>
<para>
If <parameter>strv</parameter> has been packed, then it is unpacked ready
for more inserts, and should be packed again once finished with.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>strv</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>index</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>str</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara> A new EStrv if the strv has already
been packed, otherwise <parameter>strv</parameter>.
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-strv-pack" role="function"/>e_strv_pack ()</title>
<indexterm><primary>e_strv_pack</primary></indexterm><programlisting><link linkend="EStrv">EStrv</link>* e_strv_pack (<link linkend="EStrv">EStrv</link> *strv);</programlisting>
<para>
Pack the <parameter>strv</parameter> into a space efficient structure for later lookup.
</para>
<para>
All strings are packed into a single allocated block, separated
by single \0 characters, together with a count byte.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>strv</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara>
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-strv-get" role="function"/>e_strv_get ()</title>
<indexterm><primary>e_strv_get</primary></indexterm><programlisting><link linkend="char">char</link>* e_strv_get (<link linkend="EStrv">EStrv</link> *strv,
<link linkend="int">int</link> index);</programlisting>
<para>
Retrieve a string by index. This function works
identically on both packed and unpacked strv's, although
may be much slower on a packed strv.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>strv</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>index</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara>
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-strv-destroy" role="function"/>e_strv_destroy ()</title>
<indexterm><primary>e_strv_destroy</primary></indexterm><programlisting><link linkend="void">void</link> e_strv_destroy (<link linkend="EStrv">EStrv</link> *strv);</programlisting>
<para>
Free a strv and all associated memory. Works on packed
or unpacked strv's.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>strv</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="EPoolv" role="struct"/>EPoolv</title>
<indexterm><primary>EPoolv</primary></indexterm><programlisting>typedef struct _EPoolv EPoolv;</programlisting>
<para>
</para></refsect2>
<refsect2>
<title><anchor id="e-poolv-new" role="function"/>e_poolv_new ()</title>
<indexterm><primary>e_poolv_new</primary></indexterm><programlisting><link linkend="EPoolv">EPoolv</link>* e_poolv_new (unsigned <link linkend="int">int</link> size);</programlisting>
<para>
create a new poolv (string vector which shares a global string
pool). poolv's can be used to work with arrays of strings which
save memory by eliminating duplicated allocations of the same
string.
</para>
<para>
this is useful when you have a log of read-only strings that do not
go away and are duplicated a lot (such as email headers).
</para>
<para>
we should probably in the future ref count the strings contained in
the hash table, but for now let's not.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>size</parameter> :</term>
<listitem><simpara>
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara> new pooled string vector
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-poolv-cpy" role="function"/>e_poolv_cpy ()</title>
<indexterm><primary>e_poolv_cpy</primary></indexterm><programlisting><link linkend="EPoolv">EPoolv</link>* e_poolv_cpy (<link linkend="EPoolv">EPoolv</link> *dest,
const <link linkend="EPoolv">EPoolv</link> *src);</programlisting>
<para>
Copy the contents of a pooled string vector</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>dest</parameter> :</term>
<listitem><simpara> destination pooled string vector
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>src</parameter> :</term>
<listitem><simpara> source pooled string vector
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara> <parameter>dest</parameter>, which may be re-allocated if the strings
are different lengths.
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-poolv-set" role="function"/>e_poolv_set ()</title>
<indexterm><primary>e_poolv_set</primary></indexterm><programlisting><link linkend="EPoolv">EPoolv</link>* e_poolv_set (<link linkend="EPoolv">EPoolv</link> *poolv,
<link linkend="int">int</link> index,
<link linkend="char">char</link> *str,
<link linkend="int">int</link> freeit);</programlisting>
<para>
Set a string vector reference. If the caller will no longer be
referencing the string, freeit should be TRUE. Otherwise, this
will duplicate the string if it is not found in the pool.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>poolv</parameter> :</term>
<listitem><simpara> pooled string vector
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>index</parameter> :</term>
<listitem><simpara> index in vector of string
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>str</parameter> :</term>
<listitem><simpara> string to set
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>freeit</parameter> :</term>
<listitem><simpara> whether the caller is releasing its reference to the
string
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara> <parameter>poolv</parameter>
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-poolv-get" role="function"/>e_poolv_get ()</title>
<indexterm><primary>e_poolv_get</primary></indexterm><programlisting>const <link linkend="char">char</link>* e_poolv_get (<link linkend="EPoolv">EPoolv</link> *poolv,
<link linkend="int">int</link> index);</programlisting>
<para>
Retrieve a string by index. This could possibly just be a macro.
</para>
<para>
Since the pool is never freed, this string does not need to be
duplicated, but should not be modified.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>poolv</parameter> :</term>
<listitem><simpara> pooled string vector
</simpara></listitem></varlistentry>
<varlistentry><term><parameter>index</parameter> :</term>
<listitem><simpara> index in vector of string
</simpara></listitem></varlistentry>
<varlistentry><term><emphasis>Returns</emphasis> :</term><listitem><simpara> string at that index.
</simpara></listitem></varlistentry>
</variablelist></refsect2>
<refsect2>
<title><anchor id="e-poolv-destroy" role="function"/>e_poolv_destroy ()</title>
<indexterm><primary>e_poolv_destroy</primary></indexterm><programlisting><link linkend="void">void</link> e_poolv_destroy (<link linkend="EPoolv">EPoolv</link> *poolv);</programlisting>
<para>
Free a pooled string vector. This doesn't free the strings from
the vector, however.</para>
<para>
</para><variablelist role="params">
<varlistentry><term><parameter>poolv</parameter> :</term>
<listitem><simpara> pooled string vector to free
</simpara></listitem></varlistentry>
</variablelist></refsect2>
</refsect1>
</refentry>
|