3 echo "This script will create the gen_list contrib files in the current"
4 echo "directory. Do you wish to continue? [y/n]"
9 if [[ ${ans} != [Yy]* ]]; then
15 typeset fileList="Makefile README addr_clean.pl gen_list.c gen_list.h isa.c
16 isa.h main.c malloc_police.c malloc_police.h rec_char.c rec_char.h
17 rec_charptr.c rec_charptr.h rec_double.c rec_double.h rec_long.c
18 rec_long.h rec_malloc_police.c rec_malloc_police.h"
21 for i in ${fileList}; do
25 ####################################
28 ## -e "s/^\(#${i}:\)\(.*\)/\2/"
29 ## Find lines belonging to
30 ## this file and remove the
34 ## Jump to label print if the
35 ## above s command matched
38 ## This command is skipped
39 ## when the s command fails.
40 ## This will remove any
44 ## The last thing sed does
45 ## is print the data. So,
46 ## by now, we only print
47 ## lines belonging to the file.
49 ####################################
51 sed -e "s/^\(#${i}:\)\(.*\)/\2/" \
63 #Makefile:PROGRAM = test_list
65 #Makefile:SRC = main.c isa.c gen_list.c rec_char.c rec_charptr.c rec_double.c rec_long.c rec_malloc_police.c malloc_police.c
66 #Makefile:OBJS = main.o isa.o gen_list.o rec_char.o rec_charptr.o rec_double.o rec_long.o rec_malloc_police.o malloc_police.o
68 #Makefile:all : $(PROGRAM)
70 #Makefile:$(PROGRAM) : $(OBJS)
71 #Makefile: gcc $(CFLAGS) -o $(PROGRAM) $(OBJS)
74 #Makefile: rm -f $(OBJS)
76 #Makefile:clobber: clean
77 #Makefile: rm -f $(PROGRAM)
80 #README:This list supports:
81 #README: copy construction,
82 #README: "virtual" destruction,
84 #README: comparison (equal comparison currently supported).
86 #README:With the "object oriented" nature of the list, nodes, and records; it is
87 #README:easily concievable that sorted lists and hash tables could be implemented
88 #README:with little extra effort.
91 #README:Philosophical point:
93 #README:I am sure there is room for improvement with this design. I am
94 #README:submitting this as a generic doubly linked list recomendation for IJB.
95 #README:Whatever the "collective" decides is fine with me.
97 #README:This implementation uses the "naming space" of gen_list, derived_rec,
98 #README:construct, copy construct, stream, destruct, etc... These are open to
99 #README:argument. I just used what was familiar to me and others in the "OO"
100 #README:community. If these need changed to be adopted ... "so be it".
103 #README:Implementation point:
105 #README:I assume this is too late for a "3.0" release. As I work for an
106 #README:airline, the whole past summer has been hectic (not to mention the
107 #README:last 4 months); but things have begun to settle down and I am
108 #README:following the IJB lists a bit more closely. And I would like to say
109 #README:"HOLY CRAP!" .. you guys have accompolished a lot! Way to go.
111 #README:But, the adoption of a better linked list package should at least be
112 #README:high on the next release list (if not the current one). If you choose
113 #README:this submission or not, so be it. But as a "data structure" man, I
114 #README:think IJB's linked lists need addressing.
117 #README:List/Enlist note:
119 #README:I have noticed the list.c file. If this generic list is adopted, I
120 #README:think all existing functionallity could be duplicated with the
121 #README:"copy_contruct", "equal", and "destruct" `virtuals'. This would also
122 #README:eliminate and/or enhance the other manually maintained lists in IJB.
127 #README:Since the generic list defined a "stream" virtual, it could be programmed
128 #README:that the list could print itself whenever a FATAL error occurs. A user (or
129 #README:programmer) could read the list and hopefully determine the cause of the
133 #README:Potential note:
135 #README:Think of the possibilites of a linked list, sorted list, and/or a hash
136 #README:list. Think of a request to a web site that has been referenced
137 #README:before. If a hash list keep track of all block requests and regexp
138 #README:change commands, then a site could be blocked and/or modified without
139 #README:ever consulting the actions lists again. What a speed up!
141 #README:What if some of the current lists were kept in sorted lists? Then a
142 #README:search for a particular record could be a binary search instead of a
143 #README:linear search.
145 #README:The actions file(s) and regexp files(s) could be inserted into the
146 #README:list from front to back order (or visa versa) and the processing would
147 #README:take place in actual file order (which is more natural); rather than
148 #README:in reverse order (as it is today).
151 #README:Thank you for you time and attention to this contribution. If it is
152 #README:"blessed" by the group, I am available to give time to integrating
153 #README:this into IJB.
155 #README:Let me know what y'all think about this package.
161 #addr_clean.pl:#!/usr/bin/perl
163 #addr_clean.pl:## *********************************************************************
165 #addr_clean.pl:## * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
167 #addr_clean.pl:## * Purpose : Cleans addresses out of ./test_list and replaces
168 #addr_clean.pl:## * them with "english" replacements.
170 #addr_clean.pl:## * Usage : ./test_list | ./addr_clean.pl
172 #addr_clean.pl:## * Copyright : This program is free software; you can redistribute it
173 #addr_clean.pl:## * and/or modify it under the terms of the GNU General
174 #addr_clean.pl:## * Public License as published by the Free Software
175 #addr_clean.pl:## * Foundation; either version 2 of the License, or (at
176 #addr_clean.pl:## * your option) any later version.
178 #addr_clean.pl:## * This program is distributed in the hope that it will
179 #addr_clean.pl:## * be useful, but WITHOUT ANY WARRANTY; without even the
180 #addr_clean.pl:## * implied warranty of MERCHANTABILITY or FITNESS FOR A
181 #addr_clean.pl:## * PARTICULAR PURPOSE. See the GNU General Public
182 #addr_clean.pl:## * License for more details.
184 #addr_clean.pl:## * The GNU General Public License should be included with
185 #addr_clean.pl:## * this file. If not, you can view it at
186 #addr_clean.pl:## * http://www.gnu.org/copyleft/gpl.html
187 #addr_clean.pl:## * or write to the Free Software Foundation, Inc., 59
188 #addr_clean.pl:## * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
190 #addr_clean.pl:## **********************************************************************/
192 #addr_clean.pl:use strict;
195 #addr_clean.pl:my $nMaxList = 0;
196 #addr_clean.pl:my $nMaxNode = 0;
197 #addr_clean.pl:my $nMaxRec = 0;
198 #addr_clean.pl:my %aaTranslation;
199 #addr_clean.pl:my $strLine;
201 #addr_clean.pl:while ( $strLine = <STDIN> )
203 #addr_clean.pl: if ( $strLine =~ m!(list.*=\s*)(0x[0-9a-f]+)! )
205 #addr_clean.pl: my $str1 = $1;
206 #addr_clean.pl: my $str2 = $2;
208 #addr_clean.pl: if ( ! defined $aaTranslation{$str2} )
210 #addr_clean.pl: $aaTranslation{$str2} = "list" . ++ $nMaxList;
212 #addr_clean.pl: $strLine =~ s!(list.*=\s*)(0x[0-9a-f]+)!$str1($aaTranslation{$str2})!;
216 #addr_clean.pl: if ( $strLine =~ m!(node.*=\s*)(0x[0-9a-f]+)! )
218 #addr_clean.pl: my $str1 = $1;
219 #addr_clean.pl: my $str2 = $2;
221 #addr_clean.pl: if ( ! defined $aaTranslation{$str2} )
223 #addr_clean.pl: $aaTranslation{$str2} = "node" . ++ $nMaxNode;
225 #addr_clean.pl: $strLine =~ s!(node.*=\s*)(0x[0-9a-f]+)!$str1($aaTranslation{$str2})!;
229 #addr_clean.pl: if ( $strLine =~ m!(rec.*=\s*(iter_. \.\.\. )?)(0x[0-9a-f]+)! )
231 #addr_clean.pl: my $str1 = $1;
232 #addr_clean.pl: my $str2 = $3;
234 #addr_clean.pl: if ( ! defined $aaTranslation{$str2} )
236 #addr_clean.pl: $aaTranslation{$str2} = "rec" . ++ $nMaxRec;
238 #addr_clean.pl: $strLine =~ s!(rec.*=\s*(iter_. \.\.\. )?)(0x[0-9a-f]+)!$str1($aaTranslation{$str2})!;
242 #addr_clean.pl: ## Catch the copy constuct syntax
244 #addr_clean.pl: if ( $strLine =~ m!(list.*=>\s*)(0x[0-9a-f]+)! )
246 #addr_clean.pl: my $str1 = $1;
247 #addr_clean.pl: my $str2 = $2;
249 #addr_clean.pl: if ( ! defined $aaTranslation{$str2} )
251 #addr_clean.pl: $aaTranslation{$str2} = "list" . ++ $nMaxList;
253 #addr_clean.pl: $strLine =~ s!(list.*=>\s*)(0x[0-9a-f]+)!$str1($aaTranslation{$str2})!;
257 #addr_clean.pl: if ( $strLine =~ m!(node.*=>\s*)(0x[0-9a-f]+)! )
259 #addr_clean.pl: my $str1 = $1;
260 #addr_clean.pl: my $str2 = $2;
262 #addr_clean.pl: if ( ! defined $aaTranslation{$str2} )
264 #addr_clean.pl: $aaTranslation{$str2} = "node" . ++ $nMaxNode;
266 #addr_clean.pl: $strLine =~ s!(node.*=>\s*)(0x[0-9a-f]+)!$str1($aaTranslation{$str2})!;
270 #addr_clean.pl: if ( $strLine =~ m!(rec.*=>\s*)(0x[0-9a-f]+)! )
272 #addr_clean.pl: my $str1 = $1;
273 #addr_clean.pl: my $str2 = $2;
275 #addr_clean.pl: if ( ! defined $aaTranslation{$str2} )
277 #addr_clean.pl: $aaTranslation{$str2} = "rec" . ++ $nMaxRec;
279 #addr_clean.pl: $strLine =~ s!(rec.*=>\s*)(0x[0-9a-f]+)!$str1($aaTranslation{$str2})!;
282 #addr_clean.pl: print( $strLine );
287 #gen_list.c:const char gen_list_rcs[] = "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $";
288 #gen_list.c:/*********************************************************************
290 #gen_list.c: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
292 #gen_list.c: * Purpose : To create some functions to do generic doubly linked
293 #gen_list.c: * list management.
295 #gen_list.c: * Copyright : Written by and Copyright (C) 2001 the SourceForge
296 #gen_list.c: * Privoxy team. http://www.privoxy.org/
298 #gen_list.c: * This program is free software; you can redistribute it
299 #gen_list.c: * and/or modify it under the terms of the GNU General
300 #gen_list.c: * Public License as published by the Free Software
301 #gen_list.c: * Foundation; either version 2 of the License, or (at
302 #gen_list.c: * your option) any later version.
304 #gen_list.c: * This program is distributed in the hope that it will
305 #gen_list.c: * be useful, but WITHOUT ANY WARRANTY; without even the
306 #gen_list.c: * implied warranty of MERCHANTABILITY or FITNESS FOR A
307 #gen_list.c: * PARTICULAR PURPOSE. See the GNU General Public
308 #gen_list.c: * License for more details.
310 #gen_list.c: * The GNU General Public License should be included with
311 #gen_list.c: * this file. If not, you can view it at
312 #gen_list.c: * http://www.gnu.org/copyleft/gpl.html
313 #gen_list.c: * or write to the Free Software Foundation, Inc., 59
314 #gen_list.c: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
316 #gen_list.c: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
317 #gen_list.c: * and edit IJB, correctly.
319 #gen_list.c: * Revisions :
320 #gen_list.c: * $Log: contrib.sh,v $
321 #gen_list.c: * Revision 1.2 2002/03/24 13:25:43 swa
322 #gen_list.c: * name change related issues
324 #gen_list.c: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
325 #gen_list.c: * A contribution/recomendation to the IJBSWA group for a generic doubly
326 #gen_list.c: * linked list. This file is a home brew "bash tar" (I cannot create a
327 #gen_list.c: * contrib directory and I cannot upload a tarball ... it gets
328 #gen_list.c: * corrupted). This script will expand all files needed to create the
329 #gen_list.c: * linked list modules and an example program. Please see the README.
330 #gen_list.c: * Feed back is welcomed. Enjoy.
333 #gen_list.c: *********************************************************************/
336 #gen_list.c:#include <malloc.h>
337 #gen_list.c:#include <stdio.h>
338 #gen_list.c:#include <stdlib.h>
339 #gen_list.c:#include <string.h>
341 #gen_list.c:#include "gen_list.h"
342 #gen_list.c:#include "malloc_police.h"
344 #gen_list.c:const char gen_list_h_rcs[] = GEN_LIST_H_VERSION;
347 #gen_list.c:/* This is used (for the moment) to cut out all the */
348 #gen_list.c:/* extra verbige of the malloc_police module. After */
349 #gen_list.c:/* all, we do not want to see construct/destruct of a */
350 #gen_list.c:/* class that is supposed to be "in the background". */
352 #gen_list.c:/* But it could lead to broader usage. */
354 #gen_list.c:int list_is_quiet = 0;
357 #gen_list.c:#define CALL_VT_REC_COPY_CONSTRUCT(rec) (((rec_copy_construct)(rec)->vtable[ VT_REC_COPY_CONSTRUCT ])( rec ))
358 #gen_list.c:#define CALL_VT_REC_DESTRUCT(rec) (((rec_destruct)(rec)->vtable[ VT_REC_DESTRUCT ])( rec ))
359 #gen_list.c:#define CALL_VT_REC_STREAM(rec) (((rec_stream)(rec)->vtable[ VT_REC_STREAM ])( rec ))
360 #gen_list.c:#define CALL_VT_REC_EQUAL(rec,eq_rec) (((rec_equal)((rec)->vtable[ VT_REC_EQUAL ]))( rec, eq_rec ))
363 #gen_list.c:/*********************************************************************
365 #gen_list.c: * Function : gen_list_rec_construct
367 #gen_list.c: * Description : Called from a derived list record class ONLY.
368 #gen_list.c: * This function "construct" a classs: malloc_ed,
369 #gen_list.c: * vtable, isa, and sizeof_rec "attributes".
371 #gen_list.c: * Parameters :
372 #gen_list.c: * 1 : The record. If NULL, malloc is called.
373 #gen_list.c: * 2 : isa (prounced "is a") ... type of the record.
374 #gen_list.c: * 3 : Memory image size of this record.
375 #gen_list.c: * ... : The "virtuals" for this record. NOTE: this list
376 #gen_list.c: * may increase if more "virtuals" are added.
378 #gen_list.c: * Returns : A pointer to the record (either the orig record
379 #gen_list.c: * or the malloc_ed copy.
381 #gen_list.c: *********************************************************************/
382 #gen_list.c:struct gen_list_rec *gen_list_rec_construct( enum GEN_LIST_ISA isa, int sizeof_rec, const t_vtable _vtable )
384 #gen_list.c: struct gen_list_rec *this_rec = (struct gen_list_rec *)MALLOC( sizeof_rec );
385 #gen_list.c: this_rec->vtable = _vtable;
386 #gen_list.c: this_rec->isa = isa;
387 #gen_list.c: this_rec->sizeof_rec = sizeof_rec;
389 #gen_list.c: return( this_rec );
394 #gen_list.c:/*********************************************************************
396 #gen_list.c: * Function : gen_list_rec_copy_construct
398 #gen_list.c: * Description : Makes a copy of the current existing record. All
399 #gen_list.c: * inherited properties (isa, vtable, malloc_ed, ...)
400 #gen_list.c: * are kept in tact after the copy.
402 #gen_list.c: * Parameters :
403 #gen_list.c: * 1 : Existing record.
404 #gen_list.c: * 2 : New record.
406 #gen_list.c: * Returns : The newly constructed copy record.
408 #gen_list.c: *********************************************************************/
409 #gen_list.c:struct gen_list_rec *gen_list_rec_copy_construct( const struct gen_list_rec *this_rec )
411 #gen_list.c: struct gen_list_rec *copy_rec = (struct gen_list_rec *)MALLOC( this_rec->sizeof_rec );
412 #gen_list.c: copy_rec->vtable = this_rec->vtable;
413 #gen_list.c: copy_rec->isa = this_rec->isa;
414 #gen_list.c: copy_rec->sizeof_rec = this_rec->sizeof_rec;
416 #gen_list.c: return( copy_rec );
421 #gen_list.c:/*********************************************************************
423 #gen_list.c: * Function : gen_list_rec_destruct
425 #gen_list.c: * Description : Destruct the record. Including free_ing the memory
426 #gen_list.c: * if applicable.
428 #gen_list.c: * Parameters :
429 #gen_list.c: * 1 : The record.
431 #gen_list.c: * Returns : NULL
433 #gen_list.c: *********************************************************************/
434 #gen_list.c:struct gen_list_rec *gen_list_rec_destruct( struct gen_list_rec *this_rec )
436 #gen_list.c: FREE( this_rec );
437 #gen_list.c: return( NULL );
442 #gen_list.c:/*********************************************************************
444 #gen_list.c: * Function : gen_list_rec_stream
446 #gen_list.c: * Description : Displays all attributes on the STDOUT stream.
448 #gen_list.c: * Parameters :
449 #gen_list.c: * 1 : The record.
451 #gen_list.c: * Returns : The record.
453 #gen_list.c: *********************************************************************/
454 #gen_list.c:const struct gen_list_rec *gen_list_rec_stream( const struct gen_list_rec *this_rec )
456 #gen_list.c: LIST_SHOW( printf( "\t\tstream rec isa = %s\n", isa_ra[ this_rec->isa ] ) );
457 #gen_list.c: return( this_rec );
462 #gen_list.c:/*********************************************************************
464 #gen_list.c: * Function : gen_list_rec_equal
466 #gen_list.c: * Description : Compares two records to see if they are equal.
468 #gen_list.c: * Parameters :
469 #gen_list.c: * 1 : A record.
470 #gen_list.c: * 2 : Another record.
472 #gen_list.c: * Returns : 0 => NOT EQUAL, anything else is EQUAL.
474 #gen_list.c: *********************************************************************/
475 #gen_list.c:int gen_list_rec_equal( const struct gen_list_rec *this_rec, const struct gen_list_rec *eq_rec )
477 #gen_list.c: if ( NULL == this_rec && NULL == eq_rec )
479 #gen_list.c: return( 1 );
482 #gen_list.c: if ( ( NULL == this_rec && NULL != eq_rec ) ||
483 #gen_list.c: ( NULL != this_rec && NULL == eq_rec ) )
485 #gen_list.c: return( 0 );
488 #gen_list.c: if ( ( this_rec->isa != eq_rec->isa ) ||
489 #gen_list.c: ( this_rec->sizeof_rec != eq_rec->sizeof_rec ) )
491 #gen_list.c: LIST_SHOW( printf( "INFORMATION: sorry, but comparing different rec types is unsupported at this time.\n" ) );
492 #gen_list.c: return( 0 );
495 #gen_list.c: return( 1 );
500 #gen_list.c:/*
\f*********************************************************************/
503 #gen_list.c:struct gen_list_node
505 #gen_list.c: /* private: */
506 #gen_list.c: struct gen_list_node *next;
507 #gen_list.c: struct gen_list_node *prev;
509 #gen_list.c: struct gen_list_rec *rec;
511 #gen_list.c:/* public: */
512 #gen_list.c:extern struct gen_list_node * gen_list_node_construct( struct gen_list_rec *_rec );
513 #gen_list.c:extern struct gen_list_node * gen_list_node_copy_construct( const struct gen_list_node *this_node );
514 #gen_list.c:extern struct gen_list_node * gen_list_node_destruct( struct gen_list_node *this_node );
515 #gen_list.c:extern struct gen_list_node * gen_list_node_remove( struct gen_list_node *this_node );
517 #gen_list.c:extern struct gen_list_node * gen_list_node_set_next( struct gen_list_node *this_node, struct gen_list_node *_next );
518 #gen_list.c:extern struct gen_list_node * gen_list_node_set_prev( struct gen_list_node *this_node, struct gen_list_node *_prev );
520 #gen_list.c:extern struct gen_list_node * gen_list_node_get_next( const struct gen_list_node *this_node );
521 #gen_list.c:extern struct gen_list_node * gen_list_node_get_prev( const struct gen_list_node *this_node );
523 #gen_list.c:extern const struct gen_list_rec * gen_list_node_stream( const struct gen_list_node *this_node );
524 #gen_list.c:extern int gen_list_node_equal( const struct gen_list_node *this_node, const struct gen_list_node *eq_node );
526 #gen_list.c:/* struct/class COMPLETE */
529 #gen_list.c:/*********************************************************************
531 #gen_list.c: * Function : gen_list_node_construct
533 #gen_list.c: * Description : Constructs a generic list node and sets its record.
535 #gen_list.c: * Parameters :
536 #gen_list.c: * 1 : The node. If NULL, malloc is called.
537 #gen_list.c: * 2 : The nodes record contents.
539 #gen_list.c: * Returns : A pointer to the node (either the orig node
540 #gen_list.c: * or the malloc_ed copy.
542 #gen_list.c: *********************************************************************/
543 #gen_list.c:struct gen_list_node *gen_list_node_construct( struct gen_list_rec *_rec )
545 #gen_list.c: struct gen_list_node *this_node = (struct gen_list_node *)MALLOC( sizeof( struct gen_list_node ) );
547 #gen_list.c: LIST_SHOW( printf( "\
548 #gen_list.c:\tconstruct new node\t\t= %p
549 #gen_list.c:\tconstruct new node->rec\t= %p\n\n", (const void *)this_node, (const void *)_rec ) );
551 #gen_list.c: this_node->rec = _rec;
552 #gen_list.c: this_node->next = NULL;
553 #gen_list.c: this_node->prev = NULL;
555 #gen_list.c: return( this_node );
560 #gen_list.c:/*********************************************************************
562 #gen_list.c: * Function : gen_list_node_copy_construct
564 #gen_list.c: * Description : Makes a copy of the current node.
566 #gen_list.c: * Parameters :
567 #gen_list.c: * 1 : Existing node.
568 #gen_list.c: * 2 : New node.
570 #gen_list.c: * Returns : The newly constructed copy node.
572 #gen_list.c: *********************************************************************/
573 #gen_list.c:struct gen_list_node *gen_list_node_copy_construct( const struct gen_list_node *this_node )
575 #gen_list.c: struct gen_list_node *copy_node = (struct gen_list_node *)MALLOC( sizeof( struct gen_list_node ) );
577 #gen_list.c: LIST_SHOW( printf( "\tcopy construct new node = %p => %p\n\n", (const void *)this_node, (const void *)copy_node ) );
579 #gen_list.c: copy_node->rec = CALL_VT_REC_COPY_CONSTRUCT( this_node->rec );
580 #gen_list.c: copy_node->next = NULL;
581 #gen_list.c: copy_node->prev = NULL;
583 #gen_list.c: return( copy_node );
588 #gen_list.c:/*********************************************************************
590 #gen_list.c: * Function : gen_list_node_destruct
592 #gen_list.c: * Description : Destruct the node. Including free_ing the memory
593 #gen_list.c: * if applicable.
595 #gen_list.c: * Parameters :
596 #gen_list.c: * 1 : The node.
598 #gen_list.c: * Returns : NULL
600 #gen_list.c: *********************************************************************/
601 #gen_list.c:struct gen_list_node *gen_list_node_destruct( struct gen_list_node *this_node )
603 #gen_list.c: LIST_SHOW( printf( "\
604 #gen_list.c:\tdestruct this_node\t\t\t= %p
605 #gen_list.c:\tdestruct this_node->rec\t\t= %p
606 #gen_list.c:\tdestruct this_node->next\t= %p
607 #gen_list.c:\tdestruct this_node->prev\t= %p\n\n", (const void *)this_node, (const void *)this_node->rec, (const void *)this_node->next, (const void *)this_node->prev ) );
609 #gen_list.c: if ( NULL != this_node->rec )
611 #gen_list.c: CALL_VT_REC_DESTRUCT( this_node->rec );
614 #gen_list.c: FREE( this_node );
615 #gen_list.c: return( NULL );
620 #gen_list.c:/*********************************************************************
622 #gen_list.c: * Function : gen_list_node_remove
624 #gen_list.c: * Description : Destruct the node. Including free_ing the memory
625 #gen_list.c: * if applicable.
627 #gen_list.c: * Parameters :
628 #gen_list.c: * 1 : The node.
630 #gen_list.c: * Returns : NULL
632 #gen_list.c: *********************************************************************/
633 #gen_list.c:struct gen_list_node *gen_list_node_remove( struct gen_list_node *this_node )
635 #gen_list.c: LIST_SHOW( printf( "\
636 #gen_list.c:\tremove this_node\t\t\t= %p
637 #gen_list.c:\tremove this_node->rec\t= %p
638 #gen_list.c:\tremove this_node->next\t= %p
639 #gen_list.c:\tremove this_node->prev\t= %p\n\n", (const void *)this_node, (const void *)this_node->rec, (const void *)this_node->next, (const void *)this_node->prev ) );
641 #gen_list.c: FREE( this_node );
642 #gen_list.c: return( NULL );
647 #gen_list.c:/*********************************************************************
649 #gen_list.c: * Function : gen_list_node_set_next
651 #gen_list.c: * Description : Sets the next node in the list series. Used mainly
652 #gen_list.c: * when constructing and adding/removing nodes.
654 #gen_list.c: * Parameters :
655 #gen_list.c: * 1 : The node.
656 #gen_list.c: * 2 : The next node.
658 #gen_list.c: * Returns : The node.
660 #gen_list.c: *********************************************************************/
661 #gen_list.c:struct gen_list_node *gen_list_node_set_next( struct gen_list_node *this_node, struct gen_list_node *_next )
663 #gen_list.c: this_node->next = _next;
664 #gen_list.c: return( this_node );
669 #gen_list.c:/*********************************************************************
671 #gen_list.c: * Function : gen_list_node_set_prev
673 #gen_list.c: * Description : Sets the previous node in the list series. Used mainly
674 #gen_list.c: * when constructing and adding/removing nodes.
676 #gen_list.c: * Parameters :
677 #gen_list.c: * 1 : The node.
678 #gen_list.c: * 2 : The previous node.
680 #gen_list.c: * Returns : The node.
682 #gen_list.c: *********************************************************************/
683 #gen_list.c:struct gen_list_node *gen_list_node_set_prev( struct gen_list_node *this_node, struct gen_list_node *_prev )
685 #gen_list.c: this_node->prev = _prev;
686 #gen_list.c: return( this_node );
691 #gen_list.c:/*********************************************************************
693 #gen_list.c: * Function : gen_list_node_get_next
695 #gen_list.c: * Description : Gets the next node in the list series. Used mainly
696 #gen_list.c: * for traversing a list.
698 #gen_list.c: * Parameters :
699 #gen_list.c: * 1 : The node.
701 #gen_list.c: * Returns : The next node.
703 #gen_list.c: *********************************************************************/
704 #gen_list.c:struct gen_list_node *gen_list_node_get_next( const struct gen_list_node *this_node )
706 #gen_list.c: return( this_node->next );
711 #gen_list.c:/*********************************************************************
713 #gen_list.c: * Function : gen_list_node_get_prev
715 #gen_list.c: * Description : Gets the previous node in the list series. Used mainly
716 #gen_list.c: * for traversing a list.
718 #gen_list.c: * Parameters :
719 #gen_list.c: * 1 : The node.
721 #gen_list.c: * Returns : The previous node.
723 #gen_list.c: *********************************************************************/
724 #gen_list.c:struct gen_list_node *gen_list_node_get_prev( const struct gen_list_node *this_node )
726 #gen_list.c: return( this_node->prev );
731 #gen_list.c:/*********************************************************************
733 #gen_list.c: * Function : gen_list_node_stream
735 #gen_list.c: * Description : Displays all attributes on the STDOUT stream,
736 #gen_list.c: * including the contents of the nodes record.
738 #gen_list.c: * Parameters :
739 #gen_list.c: * 1 : The record.
741 #gen_list.c: * Returns : The result of streaming the nodes record.
743 #gen_list.c: *********************************************************************/
744 #gen_list.c:const struct gen_list_rec *gen_list_node_stream( const struct gen_list_node *this_node )
746 #gen_list.c: LIST_SHOW( printf( "\
747 #gen_list.c:\tstream this_node\t\t\t= %p
748 #gen_list.c:\tstream this_node->rec\t= %p
749 #gen_list.c:\tstream this_node->next\t= %p
750 #gen_list.c:\tstream this_node->prev\t= %p\n\n", (const void *)this_node, (const void *)this_node->rec, (const void *)this_node->next, (const void *)this_node->prev ) );
752 #gen_list.c: return( CALL_VT_REC_STREAM( this_node->rec ) );
757 #gen_list.c:/*********************************************************************
759 #gen_list.c: * Function : gen_list_node_equal
761 #gen_list.c: * Description : Compares two nodes (and their records) to see if they are equal.
763 #gen_list.c: * Parameters :
764 #gen_list.c: * 1 : A node.
765 #gen_list.c: * 2 : Another node.
767 #gen_list.c: * Returns : 0 => NOT EQUAL, anything else is EQUAL.
769 #gen_list.c: *********************************************************************/
770 #gen_list.c:int gen_list_node_equal( const struct gen_list_node *this_node, const struct gen_list_node *eq_node )
772 #gen_list.c: if ( NULL == this_node && NULL == eq_node )
774 #gen_list.c: return( 1 );
777 #gen_list.c: if ( ( NULL == this_node && NULL != eq_node ) ||
778 #gen_list.c: ( NULL != this_node && NULL == eq_node ) )
780 #gen_list.c: return( 0 );
783 #gen_list.c: return( gen_list_rec_equal( this_node->rec, eq_node->rec ) );
788 #gen_list.c:/*
\f*********************************************************************/
791 #gen_list.c:/* private: */
792 #gen_list.c:/*********************************************************************
794 #gen_list.c: * Function : gen_list_insert_node
796 #gen_list.c: * Description : Inserts a node (not a record!) into a list. This
797 #gen_list.c: * is (currently) only used in copy construction.
799 #gen_list.c: * Parameters :
800 #gen_list.c: * 1 : The list.
801 #gen_list.c: * 2 : A new node to insert into the list.
803 #gen_list.c: * Returns : The node.
805 #gen_list.c: *********************************************************************/
806 #gen_list.c:const struct gen_list_node *gen_list_insert_node( struct gen_list *this_list, struct gen_list_node *node )
808 #gen_list.c: gen_list_node_set_next( node, NULL );
810 #gen_list.c: if ( NULL == this_list->first )
812 #gen_list.c: this_list->first = node;
815 #gen_list.c: if ( NULL == this_list->last )
817 #gen_list.c: this_list->last = node;
821 #gen_list.c: gen_list_node_set_next( this_list->last, node );
822 #gen_list.c: gen_list_node_set_prev( node, this_list->last );
823 #gen_list.c: this_list->last = node;
826 #gen_list.c: this_list->last = node;
828 #gen_list.c: return( node );
833 #gen_list.c:/*********************************************************************
835 #gen_list.c: * Function : gen_list_construct
837 #gen_list.c: * Description : Constructs a generic list.
839 #gen_list.c: * Parameters : None
841 #gen_list.c: * Returns : A pointer to the list (either the orig list
842 #gen_list.c: * or the malloc_ed copy.
844 #gen_list.c: *********************************************************************/
845 #gen_list.c:struct gen_list *gen_list_construct()
847 #gen_list.c: struct gen_list *this_list = (struct gen_list *)MALLOC( sizeof( struct gen_list ) );
848 #gen_list.c: LIST_SHOW( printf( "construct new list = %p\n\n", (const void *)this_list ) );
850 #gen_list.c: this_list->first = NULL;
851 #gen_list.c: this_list->last = NULL;
853 #gen_list.c: return( this_list );
858 #gen_list.c:/*********************************************************************
860 #gen_list.c: * Function : gen_list_copy_construct
862 #gen_list.c: * Description : Makes a copy of the current list.
864 #gen_list.c: * Parameters :
865 #gen_list.c: * 1 : Existing list.
866 #gen_list.c: * 2 : New list.
868 #gen_list.c: * Returns : The newly constructed copy list.
870 #gen_list.c: *********************************************************************/
871 #gen_list.c:struct gen_list *gen_list_copy_construct( const struct gen_list *this_list )
873 #gen_list.c: struct gen_list_node *curr = this_list->first;
874 #gen_list.c: struct gen_list *copy_list = (struct gen_list *)MALLOC( sizeof( struct gen_list ) );
876 #gen_list.c: LIST_SHOW( printf( "copy construct new list = %p => %p\n\n", (const void *)this_list, (const void *)copy_list ) );
878 #gen_list.c: copy_list->first = NULL;
879 #gen_list.c: copy_list->last = NULL;
882 #gen_list.c: while ( NULL != curr )
884 #gen_list.c: struct gen_list_node *copy_node = gen_list_node_copy_construct( curr );
885 #gen_list.c: gen_list_insert_node( copy_list, copy_node );
886 #gen_list.c: curr = gen_list_node_get_next( curr );
889 #gen_list.c: return( copy_list );
894 #gen_list.c:/*********************************************************************
896 #gen_list.c: * Function : gen_list_destruct
898 #gen_list.c: * Description : Destruct the list. Including free_ing the memory
899 #gen_list.c: * if applicable.
901 #gen_list.c: * Parameters :
902 #gen_list.c: * 1 : The list.
904 #gen_list.c: * Returns : NULL
906 #gen_list.c: *********************************************************************/
907 #gen_list.c:struct gen_list *gen_list_destruct( struct gen_list *this_list )
909 #gen_list.c: struct gen_list_node *curr = this_list->first;
911 #gen_list.c: LIST_SHOW( printf( "\
912 #gen_list.c:destruct this_list\t\t\t= %p
913 #gen_list.c:destruct this_list->first\t= %p
914 #gen_list.c:destruct this_list->last\t= %p\n\n", (const void *)this_list, (const void *)this_list->first, (const void *)this_list->last ) );
916 #gen_list.c: while ( NULL != curr )
918 #gen_list.c: struct gen_list_node *next = gen_list_node_get_next( curr );
919 #gen_list.c: gen_list_node_destruct( curr );
920 #gen_list.c: curr = next;
923 #gen_list.c: FREE( this_list );
924 #gen_list.c: return( NULL );
929 #gen_list.c:/*********************************************************************
931 #gen_list.c: * Function : gen_list_remove_all
933 #gen_list.c: * Description : Destruct the list. Including free_ing the memory
934 #gen_list.c: * if applicable.
936 #gen_list.c: * Parameters :
937 #gen_list.c: * 1 : The list.
939 #gen_list.c: * Returns : NULL
941 #gen_list.c: *********************************************************************/
942 #gen_list.c:struct gen_list *gen_list_remove_all( struct gen_list *this_list )
944 #gen_list.c: struct gen_list_node *curr = this_list->first;
946 #gen_list.c: LIST_SHOW( printf( "\
947 #gen_list.c:remove_all this_list\t\t\t\t= %p
948 #gen_list.c:remove_all this_list->first\t= %p
949 #gen_list.c:remove_all this_list->last\t\t= %p\n\n", (const void *)this_list, (const void *)this_list->first, (const void *)this_list->last ) );
951 #gen_list.c: while ( NULL != curr )
953 #gen_list.c: struct gen_list_node *next = gen_list_node_get_next( curr );
954 #gen_list.c: gen_list_node_remove( curr );
955 #gen_list.c: curr = next;
958 #gen_list.c: this_list->first = this_list->last = NULL;
959 #gen_list.c: return( this_list );
964 #gen_list.c:/*********************************************************************
966 #gen_list.c: * Function : gen_list_remove
968 #gen_list.c: * Description : A record from the list and return it if found. This
969 #gen_list.c: * will allow a futher call to rec_destruct.
971 #gen_list.c: * Parameters :
972 #gen_list.c: * 1 : The list.
973 #gen_list.c: * 2 : The record to be removed.
975 #gen_list.c: * Returns : rec if found and removed, NULL otherwise.
977 #gen_list.c: *********************************************************************/
978 #gen_list.c:struct gen_list_rec *gen_list_remove( struct gen_list *this_list, struct gen_list_rec *rec )
980 #gen_list.c: struct gen_list_node *curr = this_list->first;
982 #gen_list.c: LIST_SHOW( printf( "\
983 #gen_list.c:remove this_list\t\t\t= %p
984 #gen_list.c:remove this_list->first\t= %p
985 #gen_list.c:remove this_list->last\t= %p
986 #gen_list.c:remove rec\t\t\t\t\t= %p\n\n", (const void *)this_list, (const void *)this_list->first, (const void *)this_list->last, rec ) );
988 #gen_list.c: while ( NULL != curr )
990 #gen_list.c: /* Grab these values before the are destroyed. */
991 #gen_list.c: struct gen_list_node *prev = gen_list_node_get_prev( curr );
992 #gen_list.c: struct gen_list_node *next = gen_list_node_get_next( curr );
994 #gen_list.c: /* Access to rec, next, prev of gen_list_node is allowed since it is private to gen_list */
995 #gen_list.c: if ( curr->rec == rec )
997 #gen_list.c: /* Destruct the node, but not the record. */
998 #gen_list.c: gen_list_node_remove( curr );
1000 #gen_list.c: if ( NULL == prev )
1002 #gen_list.c: /************************************************/
1003 #gen_list.c: /* This is the first node in the list. */
1004 #gen_list.c: /* Picture: */
1005 #gen_list.c: /* [first] ---------------------> [next] */
1006 #gen_list.c: /* [NULL] <---------------------- [next->prev] */
1007 #gen_list.c: /************************************************/
1008 #gen_list.c: this_list->first = next;
1010 #gen_list.c: if ( NULL == next )
1012 #gen_list.c: /* Since next is NULL, then this is an empty list. */
1013 #gen_list.c: this_list->last = NULL;
1017 #gen_list.c: /* Since next is not NULL, then there is another node to make first. */
1018 #gen_list.c: gen_list_node_set_prev( next, NULL );
1021 #gen_list.c: else if ( NULL == next )
1023 #gen_list.c: /************************************************/
1024 #gen_list.c: /* This is the last node in the list. */
1025 #gen_list.c: /* Picture: */
1026 #gen_list.c: /* [last] ----------------------> [prev] */
1027 #gen_list.c: /* [prev->next] ----------------> [NULL] */
1028 #gen_list.c: /************************************************/
1029 #gen_list.c: this_list->last = prev;
1031 #gen_list.c: if ( NULL == prev )
1033 #gen_list.c: /* Since prev is NULL, then this is an empty list. */
1034 #gen_list.c: this_list->first = NULL;
1038 #gen_list.c: /* Since prev is NULL, then there is another node to make last. */
1039 #gen_list.c: gen_list_node_set_next( prev, NULL );
1044 #gen_list.c: /************************************************/
1045 #gen_list.c: /* This is a middle node in the list. */
1046 #gen_list.c: /* Picture: */
1047 #gen_list.c: /* [prev->next] ----------------> [next] */
1048 #gen_list.c: /* [removing middle] */
1049 #gen_list.c: /* [prev] <---------------------- [next->prev] */
1050 #gen_list.c: /************************************************/
1051 #gen_list.c: gen_list_node_set_next( prev, next );
1052 #gen_list.c: gen_list_node_set_prev( next, prev );
1055 #gen_list.c: return( rec );
1057 #gen_list.c: curr = next;
1060 #gen_list.c: return( NULL );
1065 #gen_list.c:/*********************************************************************
1067 #gen_list.c: * Function : gen_list_get_first
1069 #gen_list.c: * Description : Gets the first record in the list.
1071 #gen_list.c: * Parameters :
1072 #gen_list.c: * 1 : The list.
1074 #gen_list.c: * Returns : The first node.
1076 #gen_list.c: *********************************************************************/
1077 #gen_list.c:struct gen_list_rec *gen_list_get_first( const struct gen_list *this_list )
1079 #gen_list.c: if ( NULL == this_list->first )
1081 #gen_list.c: return( NULL );
1084 #gen_list.c: /* Access to rec of gen_list_node is allowed since it is private to gen_list */
1085 #gen_list.c: return( this_list->first->rec );
1090 #gen_list.c:/*********************************************************************
1092 #gen_list.c: * Function : gen_list_get_last
1094 #gen_list.c: * Description : Gets the last record in the list.
1096 #gen_list.c: * Parameters :
1097 #gen_list.c: * 1 : The list.
1099 #gen_list.c: * Returns : The last node.
1101 #gen_list.c: *********************************************************************/
1102 #gen_list.c:struct gen_list_rec *gen_list_get_last( const struct gen_list *this_list )
1104 #gen_list.c: if ( NULL == this_list->last )
1106 #gen_list.c: return( NULL );
1109 #gen_list.c: /* Access to rec of gen_list_node is allowed since it is private to gen_list */
1110 #gen_list.c: return( this_list->last->rec );
1115 #gen_list.c:/*********************************************************************
1117 #gen_list.c: * Function : gen_list_insert
1119 #gen_list.c: * Description : Inserts a record into the list. This is the
1120 #gen_list.c: * primary API interface for inserting a record.
1122 #gen_list.c: * Parameters :
1123 #gen_list.c: * 1 : The list.
1124 #gen_list.c: * 2 : A new record to insert into the list.
1126 #gen_list.c: * Returns : The node.
1128 #gen_list.c: *********************************************************************/
1129 #gen_list.c:const struct gen_list_node *gen_list_insert( struct gen_list *this_list, struct gen_list_rec *_rec )
1131 #gen_list.c: return( gen_list_insert_node( this_list, gen_list_node_construct( _rec ) ) );
1136 #gen_list.c:/*********************************************************************
1138 #gen_list.c: * Function : gen_list_stream
1140 #gen_list.c: * Description : Displays all attributes on the STDOUT stream,
1141 #gen_list.c: * including the contents of the nodes.
1143 #gen_list.c: * Parameters :
1144 #gen_list.c: * 1 : The list.
1146 #gen_list.c: * Returns : The list.
1148 #gen_list.c: *********************************************************************/
1149 #gen_list.c:const struct gen_list *gen_list_stream( const struct gen_list *this_list )
1151 #gen_list.c: const struct gen_list_node *curr = this_list->first;
1153 #gen_list.c: LIST_SHOW( printf( "\
1154 #gen_list.c:stream this_list\t\t\t= %p
1155 #gen_list.c:stream this_list->first\t= %p
1156 #gen_list.c:stream this_list->last\t= %p\n\n", (const void *)this_list, (const void *)this_list->first, (const void *)this_list->last ) );
1158 #gen_list.c: while ( NULL != curr )
1160 #gen_list.c: struct gen_list_node *next = gen_list_node_get_next( curr );
1161 #gen_list.c: gen_list_node_stream( curr );
1162 #gen_list.c: curr = next;
1165 #gen_list.c: return( this_list );
1170 #gen_list.c:/*********************************************************************
1172 #gen_list.c: * Function : gen_list_equal
1174 #gen_list.c: * Description : Compares two lists (and their nodes) to see if they are equal.
1176 #gen_list.c: * Parameters :
1177 #gen_list.c: * 1 : A list.
1178 #gen_list.c: * 2 : Another list.
1180 #gen_list.c: * Returns : 0 => NOT EQUAL, anything else is EQUAL.
1182 #gen_list.c: *********************************************************************/
1183 #gen_list.c:int gen_list_equal( const struct gen_list *this_list, const struct gen_list *eq_list )
1185 #gen_list.c: struct gen_list_node *c1 = this_list->first;
1186 #gen_list.c: struct gen_list_node *c2 = eq_list->first;
1187 #gen_list.c: int eq = 1;
1189 #gen_list.c: if ( ( NULL == c1 && NULL != c2 ) || ( NULL != c1 && NULL == c2 ) )
1191 #gen_list.c: return( 0 );
1194 #gen_list.c: while ( ( eq ) && ( NULL != c1 ) && ( NULL != c2 ) )
1196 #gen_list.c: /* Access to rec of gen_list_node is allowed since it is private to gen_list */
1197 #gen_list.c: eq = CALL_VT_REC_EQUAL( c1->rec, c2->rec );
1198 #gen_list.c: if ( NULL != c1 )
1200 #gen_list.c: c1 = gen_list_node_get_next( c1 );
1203 #gen_list.c: if ( NULL != c2 )
1205 #gen_list.c: c2 = gen_list_node_get_next( c2 );
1210 #gen_list.c: if ( NULL == c1 && NULL == c2 )
1212 #gen_list.c: return( 1 );
1215 #gen_list.c: return( eq );
1220 #gen_list.c:/*********************************************************************
1222 #gen_list.c: * Function : gen_list_find
1224 #gen_list.c: * Description : Find a record that matches the one passed to this
1225 #gen_list.c: * function.
1226 #gen_list.c: * NOTE: this function receives a RECORD and not a NODE.
1227 #gen_list.c: * Some implementation issues might be easier addressed
1228 #gen_list.c: * if a node was passed ... but for the time being, I
1229 #gen_list.c: * would like to keep the use/programmer isolated from
1230 #gen_list.c: * the node structure/class.
1232 #gen_list.c: * Parameters :
1233 #gen_list.c: * 1 : The list.
1234 #gen_list.c: * 2 : The record to find.
1236 #gen_list.c: * Returns : NULL => none found, anything else is a pointer to the record.
1238 #gen_list.c: *********************************************************************/
1239 #gen_list.c:struct gen_list_rec *gen_list_find( const struct gen_list *this_list, struct gen_list_rec *rec )
1241 #gen_list.c: const struct gen_list_node *curr = this_list->first;
1242 #gen_list.c: int eq = 0;
1244 #gen_list.c: if ( NULL == curr && NULL == rec )
1246 #gen_list.c: return( (struct gen_list_rec *)1 );
1249 #gen_list.c: if ( ( NULL == curr && NULL != rec ) ||
1250 #gen_list.c: ( NULL != curr && NULL == rec ) )
1252 #gen_list.c: return( 0 );
1255 #gen_list.c: /* Access to rec of gen_list_node is allowed since it is private to gen_list */
1256 #gen_list.c: if ( curr->rec->isa != rec->isa )
1258 #gen_list.c: LIST_SHOW( printf( "INFORMATION: sorry, but comparing different list types is unsupported at this time.\n" ) );
1259 #gen_list.c: return( 0 );
1262 #gen_list.c: if ( NULL == curr )
1264 #gen_list.c: return( NULL );
1268 #gen_list.c: while ( ( !eq ) && ( NULL != curr ) )
1270 #gen_list.c: struct gen_list_node *next = gen_list_node_get_next( curr );
1272 #gen_list.c: eq = CALL_VT_REC_EQUAL( curr->rec, rec );
1274 #gen_list.c: if ( eq )
1276 #gen_list.c: return( curr->rec );
1279 #gen_list.c: curr = next;
1283 #gen_list.c: return( NULL );
1288 #gen_list.c:/*********************************************************************
1290 #gen_list.c: * Function : gen_list_iterate
1292 #gen_list.c: * Description : Pass over the list, calling "iter" for every record.
1293 #gen_list.c: * If the "iter" function returns a non-NULL value,
1294 #gen_list.c: * return it and stop iterating.
1296 #gen_list.c: * Parameters :
1297 #gen_list.c: * 1 : The list.
1298 #gen_list.c: * 2 : The iterator function.
1300 #gen_list.c: * Returns : Whatever the iterator does, or NULL if the entire
1301 #gen_list.c: * list was processed.
1303 #gen_list.c: *********************************************************************/
1304 #gen_list.c:struct gen_list_rec *gen_list_iterate( struct gen_list *this_list, rec_iterate iter )
1306 #gen_list.c: struct gen_list_node *curr = this_list->first;
1308 #gen_list.c: if ( NULL == curr )
1310 #gen_list.c: return( NULL );
1313 #gen_list.c: while ( NULL != curr )
1315 #gen_list.c: /* Access to rec of gen_list_node is allowed since it is private to gen_list */
1316 #gen_list.c: struct gen_list_node *next = gen_list_node_get_next( curr );
1317 #gen_list.c: struct gen_list_rec *r = iter( curr->rec );
1319 #gen_list.c: if ( NULL != r )
1321 #gen_list.c: return( r );
1324 #gen_list.c: curr = next;
1328 #gen_list.c: return( NULL );
1333 #gen_list.c:/*********************************************************************
1335 #gen_list.c: * Function : gen_list_iterate
1337 #gen_list.c: * Description : Pass over the list (in reverse order), calling "iter"
1338 #gen_list.c: * for every record. If the "iter" function returns
1339 #gen_list.c: * a non-NULL value, return it and stop iterating.
1341 #gen_list.c: * Parameters :
1342 #gen_list.c: * 1 : The list.
1343 #gen_list.c: * 2 : The iterator function.
1345 #gen_list.c: * Returns : Whatever the iterator does, or NULL if the entire
1346 #gen_list.c: * list was processed.
1348 #gen_list.c: *********************************************************************/
1349 #gen_list.c:struct gen_list_rec *gen_list_iterate_reverse( struct gen_list *this_list, rec_iterate iter )
1351 #gen_list.c: struct gen_list_node *curr = this_list->last;
1353 #gen_list.c: if ( NULL == curr )
1355 #gen_list.c: return( NULL );
1358 #gen_list.c: while ( NULL != curr )
1360 #gen_list.c: /* Access to rec of gen_list_node is allowed since it is private to gen_list */
1361 #gen_list.c: struct gen_list_node *prev = gen_list_node_get_prev( curr );
1362 #gen_list.c: struct gen_list_rec *r = iter( curr->rec );
1364 #gen_list.c: if ( NULL != r )
1366 #gen_list.c: return( r );
1369 #gen_list.c: curr = prev;
1373 #gen_list.c: return( NULL );
1378 #gen_list.h:#ifndef GEN_LIST_H_INCLUDED
1379 #gen_list.h:#define GEN_LIST_H_INCLUDED
1380 #gen_list.h:#define GEN_LIST_H_VERSION "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $"
1381 #gen_list.h:/*********************************************************************
1383 #gen_list.h: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
1385 #gen_list.h: * Purpose : To create some functions to do generic doubly linked
1386 #gen_list.h: * list management.
1388 #gen_list.h: * Copyright : Written by and Copyright (C) 2001 the SourceForge
1389 #gen_list.h: * Privoxy team. http://www.privoxy.org/
1391 #gen_list.h: * This program is free software; you can redistribute it
1392 #gen_list.h: * and/or modify it under the terms of the GNU General
1393 #gen_list.h: * Public License as published by the Free Software
1394 #gen_list.h: * Foundation; either version 2 of the License, or (at
1395 #gen_list.h: * your option) any later version.
1397 #gen_list.h: * This program is distributed in the hope that it will
1398 #gen_list.h: * be useful, but WITHOUT ANY WARRANTY; without even the
1399 #gen_list.h: * implied warranty of MERCHANTABILITY or FITNESS FOR A
1400 #gen_list.h: * PARTICULAR PURPOSE. See the GNU General Public
1401 #gen_list.h: * License for more details.
1403 #gen_list.h: * The GNU General Public License should be included with
1404 #gen_list.h: * this file. If not, you can view it at
1405 #gen_list.h: * http://www.gnu.org/copyleft/gpl.html
1406 #gen_list.h: * or write to the Free Software Foundation, Inc., 59
1407 #gen_list.h: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
1409 #gen_list.h: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
1410 #gen_list.h: * and edit IJB, correctly.
1412 #gen_list.h: * Revisions :
1413 #gen_list.h: * $Log: contrib.sh,v $
1414 #gen_list.h: * Revision 1.2 2002/03/24 13:25:43 swa
1415 #gen_list.h: * name change related issues
1417 #gen_list.h: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
1418 #gen_list.h: * A contribution/recomendation to the IJBSWA group for a generic doubly
1419 #gen_list.h: * linked list. This file is a home brew "bash tar" (I cannot create a
1420 #gen_list.h: * contrib directory and I cannot upload a tarball ... it gets
1421 #gen_list.h: * corrupted). This script will expand all files needed to create the
1422 #gen_list.h: * linked list modules and an example program. Please see the README.
1423 #gen_list.h: * Feed back is welcomed. Enjoy.
1426 #gen_list.h: *********************************************************************/
1429 #gen_list.h:#ifdef __cplusplus
1430 #gen_list.h:extern "C" {
1433 #gen_list.h:#include "isa.h"
1436 #gen_list.h:extern int list_is_quiet;
1438 #gen_list.h:#define LIST_SHOW(stmt) if ( ! list_is_quiet ) { stmt; }
1441 #gen_list.h:struct gen_list_rec;
1442 #gen_list.h:typedef struct gen_list_rec * (*rec_copy_construct)( struct gen_list_rec *copy_rec );
1443 #gen_list.h:typedef struct gen_list_rec * (*rec_destruct)( struct gen_list_rec *this_rec );
1444 #gen_list.h:typedef const struct gen_list_rec * (*rec_stream)( const struct gen_list_rec *this_rec );
1445 #gen_list.h:typedef int (*rec_equal)( const struct gen_list_rec *this_rec, const struct gen_list_rec *eq_rec );
1446 #gen_list.h:typedef struct gen_list_rec * (*rec_iterate)( struct gen_list_rec *this_rec );
1448 #gen_list.h:typedef void * (*rec_method)( void *this_rec, ... );
1451 #gen_list.h:enum VT_ENTRIES
1453 #gen_list.h: VT_REC_COPY_CONSTRUCT,
1454 #gen_list.h: VT_REC_DESTRUCT,
1455 #gen_list.h: VT_REC_STREAM,
1456 #gen_list.h: VT_REC_EQUAL,
1457 #gen_list.h: VT_REC_MAX
1461 #gen_list.h:typedef const rec_method *t_vtable;
1464 #gen_list.h:struct gen_list_rec
1466 #gen_list.h: /* private: */
1467 #gen_list.h: t_vtable vtable;
1468 #gen_list.h: enum GEN_LIST_ISA isa;
1469 #gen_list.h: int sizeof_rec;
1470 #gen_list.h: /* contents HERE */
1472 #gen_list.h:/* public: */
1473 #gen_list.h:extern struct gen_list_rec * gen_list_rec_construct( enum GEN_LIST_ISA isa, int sizeof_rec, const t_vtable _vtable );
1474 #gen_list.h:extern struct gen_list_rec * gen_list_rec_copy_construct( const struct gen_list_rec *this_rec );
1475 #gen_list.h:extern struct gen_list_rec * gen_list_rec_destruct( struct gen_list_rec *this_rec );
1476 #gen_list.h:extern const struct gen_list_rec * gen_list_rec_stream( const struct gen_list_rec *this_rec );
1477 #gen_list.h:extern int gen_list_rec_equal( const struct gen_list_rec *this_rec, const struct gen_list_rec *eq_rec );
1479 #gen_list.h:/* struct/class COMPLETE */
1482 #gen_list.h:/*
\f*********************************************************************/
1484 #gen_list.h:/* private: to gen_list */
1485 #gen_list.h:struct gen_list_node;
1488 #gen_list.h:struct gen_list
1490 #gen_list.h: /* private: */
1491 #gen_list.h: struct gen_list_node *first;
1492 #gen_list.h: struct gen_list_node *last;
1494 #gen_list.h:/* gen_list_insert_node */
1496 #gen_list.h:/* public: */
1497 #gen_list.h:extern struct gen_list * gen_list_construct();
1498 #gen_list.h:extern struct gen_list * gen_list_copy_construct( const struct gen_list *this_list );
1499 #gen_list.h:extern struct gen_list * gen_list_destruct( struct gen_list *this_list );
1500 #gen_list.h:extern struct gen_list * gen_list_remove_all( struct gen_list *this_list );
1501 #gen_list.h:extern struct gen_list_rec * gen_list_remove( struct gen_list *this_list, struct gen_list_rec *_rec );
1502 #gen_list.h:extern struct gen_list_rec * gen_list_get_first( const struct gen_list *this_list );
1503 #gen_list.h:extern struct gen_list_rec * gen_list_get_last( const struct gen_list *this_list );
1504 #gen_list.h:extern const struct gen_list_node * gen_list_insert( struct gen_list *this_list, struct gen_list_rec *_rec );
1505 #gen_list.h:extern const struct gen_list * gen_list_stream( const struct gen_list *this_list );
1506 #gen_list.h:extern int gen_list_equal( const struct gen_list *this_list, const struct gen_list *eq_list );
1507 #gen_list.h:extern struct gen_list_rec * gen_list_find( const struct gen_list *this_list, struct gen_list_rec *rec );
1508 #gen_list.h:extern struct gen_list_rec * gen_list_iterate( struct gen_list *this_list, rec_iterate iter );
1509 #gen_list.h:/* struct/class COMPLETE */
1512 #gen_list.h:#ifdef __cplusplus
1513 #gen_list.h:} /* extern "C" */
1516 #gen_list.h:#endif /* ndef GEN_LIST_H_INCLUDED */
1519 #gen_list.h: Local Variables:
1520 #gen_list.h: tab-width: 3
1525 #isa.c:const char isa_rcs[] = "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $";
1526 #isa.c:/*********************************************************************
1528 #isa.c: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
1530 #isa.c: * Purpose : Pronounced "is a". To create "english" translations
1531 #isa.c: * for all linked "classes".
1533 #isa.c: * NOTE: this header file must appear once and only once
1534 #isa.c: * per project.
1536 #isa.c: * Copyright : Written by and Copyright (C) 2001 the SourceForge
1537 #isa.c: * Privoxy team. http://www.privoxy.org/
1539 #isa.c: * This program is free software; you can redistribute it
1540 #isa.c: * and/or modify it under the terms of the GNU General
1541 #isa.c: * Public License as published by the Free Software
1542 #isa.c: * Foundation; either version 2 of the License, or (at
1543 #isa.c: * your option) any later version.
1545 #isa.c: * This program is distributed in the hope that it will
1546 #isa.c: * be useful, but WITHOUT ANY WARRANTY; without even the
1547 #isa.c: * implied warranty of MERCHANTABILITY or FITNESS FOR A
1548 #isa.c: * PARTICULAR PURPOSE. See the GNU General Public
1549 #isa.c: * License for more details.
1551 #isa.c: * The GNU General Public License should be included with
1552 #isa.c: * this file. If not, you can view it at
1553 #isa.c: * http://www.gnu.org/copyleft/gpl.html
1554 #isa.c: * or write to the Free Software Foundation, Inc., 59
1555 #isa.c: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
1557 #isa.c: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
1558 #isa.c: * and edit IJB, correctly.
1560 #isa.c: * Revisions :
1561 #isa.c: * $Log: contrib.sh,v $
1562 #isa.c: * Revision 1.2 2002/03/24 13:25:43 swa
1563 #isa.c: * name change related issues
1565 #isa.c: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
1566 #isa.c: * A contribution/recomendation to the IJBSWA group for a generic doubly
1567 #isa.c: * linked list. This file is a home brew "bash tar" (I cannot create a
1568 #isa.c: * contrib directory and I cannot upload a tarball ... it gets
1569 #isa.c: * corrupted). This script will expand all files needed to create the
1570 #isa.c: * linked list modules and an example program. Please see the README.
1571 #isa.c: * Feed back is welcomed. Enjoy.
1573 #isa.c: * Revision 1.1 2001/11/30 21:55:51 rodney
1574 #isa.c: * Initial revision
1577 #isa.c: *********************************************************************/
1580 #isa.c:#include <malloc.h>
1581 #isa.c:#include <stdio.h>
1582 #isa.c:#include <stdlib.h>
1583 #isa.c:#include <string.h>
1585 #isa.c:#include "gen_list.h"
1586 #isa.c:#include "isa.h"
1588 #isa.c:const char isa_h_rcs[] = ISA_H_VERSION;
1591 #isa.c:/* Pronounce "ra" phonectically and you get "array", which this variable is. */
1592 #isa.c:char *isa_ra[] =
1594 #isa.c: "GEN_LIST_REC",
1595 #isa.c: "REC_MALLOC_POLICE",
1597 #isa.c: "REC_CHARPTR",
1598 #isa.c: "REC_DOUBLE",
1604 #isa.h:#ifndef ISA_H_INCLUDED
1605 #isa.h:#define ISA_H_INCLUDED
1606 #isa.h:#define ISA_H_VERSION "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $"
1607 #isa.h:/*********************************************************************
1609 #isa.h: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
1611 #isa.h: * Purpose : Pronounced "is a". To create "english" translations
1612 #isa.h: * for all linked "classes".
1614 #isa.h: * NOTE: this header file must appear once and only once
1615 #isa.h: * per project.
1617 #isa.h: * Copyright : Written by and Copyright (C) 2001 the SourceForge
1618 #isa.h: * Privoxy team. http://www.privoxy.org/
1620 #isa.h: * This program is free software; you can redistribute it
1621 #isa.h: * and/or modify it under the terms of the GNU General
1622 #isa.h: * Public License as published by the Free Software
1623 #isa.h: * Foundation; either version 2 of the License, or (at
1624 #isa.h: * your option) any later version.
1626 #isa.h: * This program is distributed in the hope that it will
1627 #isa.h: * be useful, but WITHOUT ANY WARRANTY; without even the
1628 #isa.h: * implied warranty of MERCHANTABILITY or FITNESS FOR A
1629 #isa.h: * PARTICULAR PURPOSE. See the GNU General Public
1630 #isa.h: * License for more details.
1632 #isa.h: * The GNU General Public License should be included with
1633 #isa.h: * this file. If not, you can view it at
1634 #isa.h: * http://www.gnu.org/copyleft/gpl.html
1635 #isa.h: * or write to the Free Software Foundation, Inc., 59
1636 #isa.h: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
1638 #isa.h: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
1639 #isa.h: * and edit IJB, correctly.
1641 #isa.h: * Revisions :
1642 #isa.h: * $Log: contrib.sh,v $
1643 #isa.h: * Revision 1.2 2002/03/24 13:25:43 swa
1644 #isa.h: * name change related issues
1646 #isa.h: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
1647 #isa.h: * A contribution/recomendation to the IJBSWA group for a generic doubly
1648 #isa.h: * linked list. This file is a home brew "bash tar" (I cannot create a
1649 #isa.h: * contrib directory and I cannot upload a tarball ... it gets
1650 #isa.h: * corrupted). This script will expand all files needed to create the
1651 #isa.h: * linked list modules and an example program. Please see the README.
1652 #isa.h: * Feed back is welcomed. Enjoy.
1655 #isa.h: *********************************************************************/
1658 #isa.h:#ifdef __cplusplus
1663 #isa.h:enum GEN_LIST_ISA
1665 #isa.h: ISA_GEN_LIST_REC,
1666 #isa.h: ISA_MALLOC_POLICE,
1668 #isa.h: ISA_CHARPTR,
1675 #isa.h:/* Pronounce "ra" phonectically and you get "array", which this variable is. */
1676 #isa.h:extern char *isa_ra[];
1679 #isa.h:#ifdef __cplusplus
1680 #isa.h:} /* extern "C" */
1683 #isa.h:#endif /* ndef ISA_H_INCLUDED */
1686 #isa.h: Local Variables:
1687 #isa.h: tab-width: 3
1692 #main.c:const char main_rcs[] = "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $";
1693 #main.c:/*********************************************************************
1695 #main.c: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
1697 #main.c: * Purpose : To test "generic list" creation and manipulation.
1699 #main.c: * Copyright : Written by and Copyright (C) 2001 the SourceForge
1700 #main.c: * Privoxy team. http://www.privoxy.org/
1702 #main.c: * This program is free software; you can redistribute it
1703 #main.c: * and/or modify it under the terms of the GNU General
1704 #main.c: * Public License as published by the Free Software
1705 #main.c: * Foundation; either version 2 of the License, or (at
1706 #main.c: * your option) any later version.
1708 #main.c: * This program is distributed in the hope that it will
1709 #main.c: * be useful, but WITHOUT ANY WARRANTY; without even the
1710 #main.c: * implied warranty of MERCHANTABILITY or FITNESS FOR A
1711 #main.c: * PARTICULAR PURPOSE. See the GNU General Public
1712 #main.c: * License for more details.
1714 #main.c: * The GNU General Public License should be included with
1715 #main.c: * this file. If not, you can view it at
1716 #main.c: * http://www.gnu.org/copyleft/gpl.html
1717 #main.c: * or write to the Free Software Foundation, Inc., 59
1718 #main.c: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
1720 #main.c: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
1721 #main.c: * and edit IJB, correctly.
1723 #main.c: * Note : This output assumes (per IJB standards) that tabs are
1724 #main.c: * set to 3 characters. If you run this in a terminal,
1725 #main.c: * you may want to run this as so:
1726 #main.c: * >./test_list 2>&1 | expand -t3 | ./addr_clean.pl
1727 #main.c: * This will expand the tab to 3 columns and then replace
1728 #main.c: * "0x" style addresses with more human readable ones.
1730 #main.c: * Revisions :
1731 #main.c: * $Log: contrib.sh,v $
1732 #main.c: * Revision 1.2 2002/03/24 13:25:43 swa
1733 #main.c: * name change related issues
1735 #main.c: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
1736 #main.c: * A contribution/recomendation to the IJBSWA group for a generic doubly
1737 #main.c: * linked list. This file is a home brew "bash tar" (I cannot create a
1738 #main.c: * contrib directory and I cannot upload a tarball ... it gets
1739 #main.c: * corrupted). This script will expand all files needed to create the
1740 #main.c: * linked list modules and an example program. Please see the README.
1741 #main.c: * Feed back is welcomed. Enjoy.
1744 #main.c: *********************************************************************/
1747 #main.c:#include <malloc.h>
1748 #main.c:#include <stdio.h>
1749 #main.c:#include <stdlib.h>
1750 #main.c:#include <string.h>
1752 #main.c:#include "gen_list.h"
1753 #main.c:#include "rec_char.h"
1754 #main.c:#include "rec_charptr.h"
1755 #main.c:#include "rec_double.h"
1756 #main.c:#include "rec_long.h"
1757 #main.c:#include "malloc_police.h"
1760 #main.c:extern const char isa_rcs[];
1761 #main.c:extern const char isa_h_rcs[];
1762 #main.c:extern const char gen_list_rcs[];
1763 #main.c:extern const char gen_list_h_rcs[];
1764 #main.c:extern const char malloc_police_rcs[];
1765 #main.c:extern const char malloc_police_h_rcs[];
1766 #main.c:extern const char rec_charptr_rcs[];
1767 #main.c:extern const char rec_charptr_h_rcs[];
1768 #main.c:extern const char rec_long_rcs[];
1769 #main.c:extern const char rec_long_h_rcs[];
1770 #main.c:extern const char rec_double_rcs[];
1771 #main.c:extern const char rec_double_h_rcs[];
1772 #main.c:extern const char rec_char_rcs[];
1773 #main.c:extern const char rec_char_h_rcs[];
1774 #main.c:extern const char rec_malloc_police_rcs[];
1775 #main.c:extern const char rec_malloc_police_h_rcs[];
1776 #main.c:extern const char main_rcs[];
1779 #main.c:/*********************************************************************
1781 #main.c: * Function : my_custom_charptr_iterator_1
1783 #main.c: * Description : This funtion is called once for every record in a
1784 #main.c: * list. Or at least until we return non-NULL. BTW,
1785 #main.c: * this function always returns NULL, thus it will
1786 #main.c: * iterate over the entire list.
1788 #main.c: * Parameters :
1789 #main.c: * 1 : The record.
1791 #main.c: * Returns : NULL
1793 #main.c: *********************************************************************/
1794 #main.c:struct derived_rec_charptr *my_custom_charptr_iterator_1( struct derived_rec_charptr *this_rec )
1797 #main.c:\t\tcharptr iterator_1 this_rec\t\t\t\t= iter_1 ... %p
1798 #main.c:\t\tcharptr iterator_1 this_rec->contents\t= iter_1 ... %s\n\n", (const void *)this_rec, this_rec->contents );
1799 #main.c: return( NULL );
1804 #main.c:/*********************************************************************
1806 #main.c: * Function : my_custom_charptr_iterator_2
1808 #main.c: * Description : This funtion is called once for every record in a
1809 #main.c: * list. Or at least until we return non-NULL. BTW,
1810 #main.c: * this function always returns non-NULL, thus it will
1811 #main.c: * iterate over only 1 record.
1813 #main.c: * Parameters :
1814 #main.c: * 1 : The record.
1816 #main.c: * Returns : The record.
1818 #main.c: *********************************************************************/
1819 #main.c:struct derived_rec_charptr *my_custom_charptr_iterator_2( struct derived_rec_charptr *this_rec )
1822 #main.c:\t\tcharptr iterator_1 this_rec\t\t\t\t= iter_2 ... %p
1823 #main.c:\t\tcharptr iterator_1 this_rec->contents\t= iter_2 ... %s\n\n", (const void *)this_rec, this_rec->contents );
1824 #main.c: return( this_rec );
1829 #main.c:/*********************************************************************
1831 #main.c: * Function : main
1833 #main.c: * Description : Test the doubly linked list as it is so far.
1835 #main.c: * Parameters : None
1837 #main.c: * Returns : N/A
1839 #main.c: *********************************************************************/
1840 #main.c:int main( int argc, const char **argv )
1842 #main.c: struct gen_list *lcharptr;
1843 #main.c: struct gen_list *llong;
1844 #main.c: struct gen_list *ldouble;
1845 #main.c: struct gen_list *lchar;
1847 #main.c: struct gen_list *lcharptr_c;
1848 #main.c: struct gen_list *llong_c;
1849 #main.c: struct gen_list *ldouble_c;
1850 #main.c: struct gen_list *lchar_c;
1852 #main.c: struct gen_list_rec *f_rec;
1854 #main.c: struct gen_list *no_own_list;
1855 #main.c: struct gen_list_rec *no_own_rec1;
1856 #main.c: struct gen_list_rec *no_own_rec2;
1857 #main.c: struct gen_list_rec *no_own_rec3;
1859 #main.c: printf( "\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n\n",
1860 #main.c: gen_list_rcs,
1861 #main.c: gen_list_h_rcs,
1864 #main.c: malloc_police_rcs,
1865 #main.c: malloc_police_h_rcs,
1866 #main.c: rec_char_rcs,
1867 #main.c: rec_char_h_rcs,
1868 #main.c: rec_charptr_rcs,
1869 #main.c: rec_charptr_h_rcs,
1870 #main.c: rec_long_rcs,
1871 #main.c: rec_long_h_rcs,
1872 #main.c: rec_double_rcs,
1873 #main.c: rec_double_h_rcs,
1874 #main.c: rec_malloc_police_rcs,
1875 #main.c: rec_malloc_police_h_rcs,
1876 #main.c: main_rcs );
1879 #main.c: /* Force a memory leak to test the strdup/malloc/free police. */
1880 #main.c: /* NOTE: this should trigger the alphanum check of allocated memory. */
1881 #main.c: strcpy( MALLOC( 60 ), "Force a memory leak to test the strdup/malloc/free police." );
1884 #main.c: printf( "** -- Calling gen_list_construct to constuct a charptr list -- **\n" );
1885 #main.c: lcharptr = gen_list_construct();
1887 #main.c: gen_list_insert( lcharptr, (struct gen_list_rec *)derived_rec_charptr_construct( "Rodney Stromlund" ) );
1888 #main.c: gen_list_insert( lcharptr, f_rec = (struct gen_list_rec *)derived_rec_charptr_construct( "RJS" ) );
1889 #main.c: gen_list_insert( lcharptr, (struct gen_list_rec *)derived_rec_charptr_construct( "jammin!" ) );
1891 #main.c: printf( "** -- Calling gen_list_stream to test streaming a charptr list -- **\n" );
1892 #main.c: gen_list_stream( lcharptr );
1894 #main.c: printf( "** -- Calling gen_list_find to find the 2nd charptr record -- **\n" );
1895 #main.c: f_rec = gen_list_find( lcharptr, f_rec );
1896 #main.c: printf( "Found rec = %p\n", f_rec );
1897 #main.c: derived_rec_charptr_stream( (const struct derived_rec_charptr *)f_rec );
1900 #main.c: printf( "** -- Calling gen_list_copy_construct to test copy construct the charptr list -- **\n" );
1901 #main.c: lcharptr_c = gen_list_copy_construct( lcharptr );
1903 #main.c: printf( "** -- Calling gen_list_equal to see if the copied list is the same as the orig -- **
1904 #main.c:** -- NOTE: they will NOT be because the charptr copy constructor changes the string contents -- **\n" );
1905 #main.c: printf( "Are these 2 equal? => %d\n\n", gen_list_equal( lcharptr, lcharptr_c ) );
1907 #main.c: printf( "** -- Calling gen_list_stream to stream a copied charptr list -- **\n" );
1908 #main.c: gen_list_stream( lcharptr_c );
1911 #main.c: printf( "** -- Calling gen_list_construct to constuct a long list -- **\n" );
1912 #main.c: llong = gen_list_construct();
1915 #main.c: gen_list_insert( llong, no_own_rec1 = (struct gen_list_rec *)derived_rec_long_construct( 1 ) );
1916 #main.c: gen_list_insert( llong, no_own_rec2 = (struct gen_list_rec *)derived_rec_long_construct( 100 ) );
1917 #main.c: gen_list_insert( llong, no_own_rec3 = (struct gen_list_rec *)derived_rec_long_construct( 200 ) );
1919 #main.c: printf( "** -- Calling gen_list_stream to test streaming a long list -- **\n" );
1920 #main.c: gen_list_stream( llong );
1923 #main.c: printf( "** -- Calling gen_list_copy_construct to test copy construct the long list -- **\n" );
1924 #main.c: llong_c = gen_list_copy_construct( llong );
1926 #main.c: printf( "** -- Calling gen_list_stream to stream a copied long list -- **\n" );
1927 #main.c: gen_list_stream( llong_c );
1929 #main.c: printf( "** -- Calling gen_list_construct to test a no-owner long list -- **\n" );
1930 #main.c: no_own_list = gen_list_construct();
1931 #main.c: gen_list_insert( no_own_list, no_own_rec1 );
1932 #main.c: gen_list_insert( no_own_list, no_own_rec2 );
1933 #main.c: gen_list_insert( no_own_list, no_own_rec3 );
1935 #main.c: printf( "** -- Calling gen_list_stream to stream a no-owner list -- **\n" );
1936 #main.c: gen_list_stream( no_own_list );
1938 #main.c: printf( "** -- Calling gen_list_equal to see if list and no-owner list are equal NOTE: they should be. -- **\n" );
1939 #main.c: printf( "Are these 2 equal? => %d\n\n", gen_list_equal( llong, no_own_list ) );
1942 #main.c: printf( "** -- Calling gen_list_construct to constuct a double list -- **\n" );
1943 #main.c: ldouble = gen_list_construct();
1945 #main.c: gen_list_insert( ldouble, (struct gen_list_rec *)derived_rec_double_construct( 3.0 ) );
1946 #main.c: gen_list_insert( ldouble, (struct gen_list_rec *)derived_rec_double_construct( 3.1 ) );
1947 #main.c: gen_list_insert( ldouble, (struct gen_list_rec *)derived_rec_double_construct( 3.14 ) );
1949 #main.c: printf( "** -- Calling gen_list_stream to test streaming a double list -- **\n" );
1950 #main.c: gen_list_stream( ldouble );
1953 #main.c: printf( "** -- Calling gen_list_copy_construct to test copy construct the double list -- **\n" );
1954 #main.c: ldouble_c = gen_list_copy_construct( ldouble );
1956 #main.c: printf( "** -- Calling gen_list_stream to stream a copied double list -- **\n" );
1957 #main.c: gen_list_stream( ldouble_c );
1960 #main.c: printf( "** -- Calling gen_list_construct to constuct a char list -- **\n" );
1961 #main.c: lchar = gen_list_construct();
1963 #main.c: gen_list_insert( lchar, (struct gen_list_rec *)derived_rec_char_construct( '1' ) );
1964 #main.c: gen_list_insert( lchar, (struct gen_list_rec *)derived_rec_char_construct( 'A' ) );
1965 #main.c: gen_list_insert( lchar, (struct gen_list_rec *)derived_rec_char_construct( 'a' ) );
1967 #main.c: printf( "** -- Calling gen_list_stream to test streaming a char list -- **\n" );
1968 #main.c: gen_list_stream( lchar );
1971 #main.c: printf( "** -- Calling gen_list_copy_construct to test copy construct the char list -- **\n" );
1972 #main.c: lchar_c = gen_list_copy_construct( lchar );
1974 #main.c: printf( "** -- Calling gen_list_equal to see if the copied list is the same as the orig NOTE: they should be. -- **\n" );
1975 #main.c: printf( "Are these 2 equal? => %d\n\n", gen_list_equal( lchar, lchar_c ) );
1977 #main.c: printf( "** -- Calling gen_list_stream to stream a copied char list -- **\n" );
1978 #main.c: gen_list_stream( lchar_c );
1981 #main.c: printf( "** -- Calling gen_list_iterate to iterate a charptr list -- **
1982 #main.c:** -- NOTE: this iterator (my_custom_charptr_iterator_1) will iterate the whole list. -- **\n" );
1983 #main.c: gen_list_iterate( lcharptr, (rec_iterate)my_custom_charptr_iterator_1 );
1985 #main.c: printf( "** -- Calling gen_list_iterate to iterate a copied charptr list -- **
1986 #main.c:** -- NOTE: this iterator (my_custom_charptr_iterator_2) will return after the first iteration. -- **\n" );
1987 #main.c: gen_list_iterate( lcharptr_c, (rec_iterate)my_custom_charptr_iterator_2 );
1990 #main.c: printf( "** -- Calling gen_list_iterate_reverse to iterate a charptr list -- **
1991 #main.c:** -- NOTE: this iterator (my_custom_charptr_iterator_1) will iterate the whole list. -- **\n" );
1992 #main.c: gen_list_iterate_reverse( lcharptr, (rec_iterate)my_custom_charptr_iterator_1 );
1994 #main.c: printf( "** -- Calling gen_list_iterate_reverse to iterate a copied charptr list -- **
1995 #main.c:** -- NOTE: this iterator (my_custom_charptr_iterator_2) will return after the first iteration. -- **\n" );
1996 #main.c: gen_list_iterate_reverse( lcharptr_c, (rec_iterate)my_custom_charptr_iterator_2 );
1999 #main.c: printf( "** -- Calling gen_list_equal to see if 2 different typed lists are equal NOTE: they should not be. -- **\n" );
2000 #main.c: printf( "Are these 2 equal? => %d\n\n", gen_list_equal( lcharptr, llong ) );
2003 #main.c: printf( "** -- Calling gen_list_remove_all to erase a no-owner list -- **\n" );
2004 #main.c: no_own_list = gen_list_remove_all( no_own_list );
2006 #main.c: printf( "** -- Calling gen_list_destruct to destruct a no-owner list -- **\n" );
2007 #main.c: no_own_list = gen_list_destruct( no_own_list );
2010 #main.c: printf( "** -- Calling gen_list_remove to remove the first record of a copied charptr list -- **\n" );
2011 #main.c: derived_rec_charptr_destruct( (struct derived_rec_charptr *)gen_list_remove( lcharptr_c, gen_list_get_first( lcharptr_c ) ) );
2013 #main.c: printf( "** -- Calling gen_list_remove to remove the last record of a copied long list -- **\n" );
2014 #main.c: derived_rec_long_destruct( (struct derived_rec_long *)gen_list_remove( llong_c, gen_list_get_last( llong_c ) ) );
2016 #main.c: printf( "** -- Calling gen_list_remove to remove the middle record of an original charptr list -- **\n" );
2017 #main.c: derived_rec_charptr_destruct( (struct derived_rec_charptr *)gen_list_remove( lcharptr, f_rec ) );
2019 #main.c: printf( "** -- Calling gen_list_remove to remove the all 3 records of a copied char list (first to last) -- **\n" );
2020 #main.c: derived_rec_char_destruct( (struct derived_rec_char *)gen_list_remove( lchar_c, gen_list_get_first( lchar_c ) ) );
2021 #main.c: derived_rec_char_destruct( (struct derived_rec_char *)gen_list_remove( lchar_c, gen_list_get_first( lchar_c ) ) );
2022 #main.c: derived_rec_char_destruct( (struct derived_rec_char *)gen_list_remove( lchar_c, gen_list_get_first( lchar_c ) ) );
2024 #main.c: printf( "** -- Calling gen_list_remove to remove the all 3 records of the original char list (last to first) -- **\n" );
2025 #main.c: derived_rec_char_destruct( (struct derived_rec_char *)gen_list_remove( lchar, gen_list_get_last( lchar ) ) );
2026 #main.c: derived_rec_char_destruct( (struct derived_rec_char *)gen_list_remove( lchar, gen_list_get_last( lchar ) ) );
2027 #main.c: derived_rec_char_destruct( (struct derived_rec_char *)gen_list_remove( lchar, gen_list_get_last( lchar ) ) );
2030 #main.c: printf( "** -- Calling gen_list_destruct to destruct the original charptr list (less the middle record) -- **\n" );
2031 #main.c: lcharptr = gen_list_destruct( lcharptr );
2032 #main.c: printf( "** -- Calling gen_list_destruct to destruct the copied charptr list (less the first record) -- **\n" );
2033 #main.c: lcharptr_c = gen_list_destruct( lcharptr_c );
2035 #main.c: printf( "** -- Calling gen_list_destruct to destruct the original long list -- **\n" );
2036 #main.c: llong = gen_list_destruct( llong );
2037 #main.c: printf( "** -- Calling gen_list_destruct to destruct the copied long list (less the last record) -- **\n" );
2038 #main.c: llong_c = gen_list_destruct( llong_c );
2040 #main.c: printf( "** -- Calling gen_list_destruct to destruct the original double list -- **\n" );
2041 #main.c: ldouble = gen_list_destruct( ldouble );
2042 #main.c: printf( "** -- Calling gen_list_destruct to destruct the copied double list -- **\n" );
2043 #main.c: ldouble_c = gen_list_destruct( ldouble_c );
2045 #main.c: printf( "** -- Calling gen_list_destruct to destruct the original char list (less all records last to first) -- **\n" );
2046 #main.c: lchar = gen_list_destruct( lchar );
2047 #main.c: printf( "** -- Calling gen_list_destruct to destruct the copied char list (less all records first to last) -- **\n" );
2048 #main.c: lchar_c = gen_list_destruct( lchar_c );
2051 #main.c: /* Force another memory leak to test the strdup/malloc/free police. */
2052 #main.c: /* NOTE: this should trigger the alphanum check of allocated memory. */
2053 #main.c: STRDUP( "Force another memory leak to test the strdup/malloc/free police." );
2055 #main.c: /* Force a memory leak in a list and also in 2 nodes. */
2056 #main.c: /* NOTE: this should NOT trigger the alphanum check of allocated memory. */
2057 #main.c: gen_list_construct();
2059 #main.c: /* NOTE: this should trigger 1 NON check (for the node) */
2060 #main.c: /* followed by 1 alphanum check for the charptr string. */
2061 #main.c: derived_rec_charptr_construct( "Leaky charptr node." );
2063 #main.c: /* NOTE: this should NOT trigger the alphanum check of allocated memory. */
2064 #main.c: derived_rec_char_construct( 'Z' );
2067 #main.c: printf( "\ndone" );
2068 #main.c: return( 0 );
2074 #main.c: Local Variables:
2075 #main.c: tab-width: 3
2080 #malloc_police.c:const char malloc_police_rcs[] = "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $";
2081 #malloc_police.c:/*********************************************************************
2083 #malloc_police.c: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
2085 #malloc_police.c: * Purpose : This module uses the rec_malloc_police to build a
2086 #malloc_police.c: * list of allocated and freed memory. When the
2087 #malloc_police.c: * program exits, we will print a list of all memory
2088 #malloc_police.c: * that was allocated, but never freed. This could
2089 #malloc_police.c: * be most helpful to developers and debugers.
2091 #malloc_police.c: * Copyright : Written by and Copyright (C) 2001 the SourceForge
2092 #malloc_police.c: * Privoxy team. http://www.privoxy.org/
2094 #malloc_police.c: * This program is free software; you can redistribute it
2095 #malloc_police.c: * and/or modify it under the terms of the GNU General
2096 #malloc_police.c: * Public License as published by the Free Software
2097 #malloc_police.c: * Foundation; either version 2 of the License, or (at
2098 #malloc_police.c: * your option) any later version.
2100 #malloc_police.c: * This program is distributed in the hope that it will
2101 #malloc_police.c: * be useful, but WITHOUT ANY WARRANTY; without even the
2102 #malloc_police.c: * implied warranty of MERCHANTABILITY or FITNESS FOR A
2103 #malloc_police.c: * PARTICULAR PURPOSE. See the GNU General Public
2104 #malloc_police.c: * License for more details.
2106 #malloc_police.c: * The GNU General Public License should be included with
2107 #malloc_police.c: * this file. If not, you can view it at
2108 #malloc_police.c: * http://www.gnu.org/copyleft/gpl.html
2109 #malloc_police.c: * or write to the Free Software Foundation, Inc., 59
2110 #malloc_police.c: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
2112 #malloc_police.c: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
2113 #malloc_police.c: * and edit IJB, correctly.
2115 #malloc_police.c: * Revisions :
2116 #malloc_police.c: * $Log: contrib.sh,v $
2117 #malloc_police.c: * Revision 1.2 2002/03/24 13:25:43 swa
2118 #malloc_police.c: * name change related issues
2120 #malloc_police.c: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
2121 #malloc_police.c: * A contribution/recomendation to the IJBSWA group for a generic doubly
2122 #malloc_police.c: * linked list. This file is a home brew "bash tar" (I cannot create a
2123 #malloc_police.c: * contrib directory and I cannot upload a tarball ... it gets
2124 #malloc_police.c: * corrupted). This script will expand all files needed to create the
2125 #malloc_police.c: * linked list modules and an example program. Please see the README.
2126 #malloc_police.c: * Feed back is welcomed. Enjoy.
2129 #malloc_police.c: *********************************************************************/
2132 #malloc_police.c:#include <ctype.h>
2133 #malloc_police.c:#include <malloc.h>
2134 #malloc_police.c:#include <stdio.h>
2135 #malloc_police.c:#include <stdlib.h>
2136 #malloc_police.c:#include <string.h>
2138 #malloc_police.c:#include "gen_list.h"
2139 #malloc_police.c:#include "malloc_police.h"
2140 #malloc_police.c:#include "rec_malloc_police.h"
2142 #malloc_police.c:const char malloc_police_h_rcs[] = MALLOC_POLICE_H_VERSION;
2145 #malloc_police.c:/* When we need to allocate malloc_police records, we */
2146 #malloc_police.c:/* will do recursion infinately. This variable will */
2147 #malloc_police.c:/* stop the STRDUP, MALLOC, and FREE replacements from */
2148 #malloc_police.c:/* trying to log these allocations. */
2150 #malloc_police.c:char recursion_protect = 0;
2152 #malloc_police.c:struct gen_list *get_police_list();
2153 #malloc_police.c:static char called_once = 0;
2154 #malloc_police.c:static const char *leak_report_header = "%s****************************** MEMORY LEAK REPORT %s ******************************%s";
2157 #malloc_police.c:/*********************************************************************
2159 #malloc_police.c: * Function : police_list_release_iterator
2161 #malloc_police.c: * Description : Iterator for the police list. We will report
2162 #malloc_police.c: * "leaked" memory for the developer to correct.
2164 #malloc_police.c: * Parameters :
2165 #malloc_police.c: * 1 : The record.
2167 #malloc_police.c: * Returns : NULL
2169 #malloc_police.c: *********************************************************************/
2170 #malloc_police.c:struct derived_rec_malloc_police *police_list_release_iterator( struct derived_rec_malloc_police *this_rec )
2172 #malloc_police.c: if ( ! called_once )
2174 #malloc_police.c: called_once = 1;
2175 #malloc_police.c: fprintf( stderr, leak_report_header, "\n\n", "BEGIN", "\n\n" );
2178 #malloc_police.c: fprintf( stderr, "\
2179 #malloc_police.c:\t\tmalloc_police leaked memory iterator this_rec\t\t\t\t\t= %p
2180 #malloc_police.c:\t\tmalloc_police leaked memory iterator this_rec->alloced_addr\t= %p
2181 #malloc_police.c:\t\tmalloc_police leaked memory iterator this_rec->source_where\t= %s
2182 #malloc_police.c:\t\tmalloc_police leaked memory iterator this_rec->sz\t\t\t\t= %ld\n",
2183 #malloc_police.c: (const void *)this_rec,
2184 #malloc_police.c: this_rec->alloced_addr,
2185 #malloc_police.c: this_rec->source_where,
2186 #malloc_police.c: this_rec->sz
2187 #malloc_police.c: );
2189 #malloc_police.c: if (
2190 #malloc_police.c: this_rec->sz >= 3 &&
2191 #malloc_police.c: isalnum( ((const char *)this_rec->alloced_addr)[ 0 ] ) &&
2192 #malloc_police.c: isalnum( ((const char *)this_rec->alloced_addr)[ 1 ] ) &&
2193 #malloc_police.c: isalnum( ((const char *)this_rec->alloced_addr)[ 2 ] ) )
2195 #malloc_police.c: /* If the memory starts with 3 alpha-numerics,
2196 #malloc_police.c: * assume a string was allocated. This might be
2197 #malloc_police.c: * a little dangerous for production code, but I
2198 #malloc_police.c: * will take the risk for development payoff
2199 #malloc_police.c: * (at least for now ...) */
2201 #malloc_police.c: fprintf( stderr, "\
2202 #malloc_police.c:\t\tAlpha numeric found, assuming a string was allocated\t\t\t= %s\n",
2203 #malloc_police.c: this_rec->alloced_addr
2204 #malloc_police.c: );
2207 #malloc_police.c: fprintf( stderr, "\n" );
2209 #malloc_police.c: return( NULL );
2214 #malloc_police.c:/*********************************************************************
2216 #malloc_police.c: * Function : release_police_list
2218 #malloc_police.c: * Description : Iterates the police_list and reports "leaked" memory.
2219 #malloc_police.c: * It will then free the list itself.
2221 #malloc_police.c: * Parameters : None
2223 #malloc_police.c: * Returns : None.
2225 #malloc_police.c: *********************************************************************/
2226 #malloc_police.c:void release_police_list()
2228 #malloc_police.c: struct gen_list *police_list = get_police_list();
2229 #malloc_police.c: fflush( stdout );
2230 #malloc_police.c: gen_list_iterate( police_list, (rec_iterate)police_list_release_iterator );
2232 #malloc_police.c: if ( called_once )
2234 #malloc_police.c: called_once = 0;
2235 #malloc_police.c: fprintf( stderr, leak_report_header, "", "END", "\n" );
2241 #malloc_police.c:/*********************************************************************
2243 #malloc_police.c: * Function : get_police_list
2245 #malloc_police.c: * Description : Get the police malloc/strdup/free list. Generate
2246 #malloc_police.c: * a new one if it does not yet exist.
2248 #malloc_police.c: * Parameters : None
2250 #malloc_police.c: * Returns : The police list.
2252 #malloc_police.c: *********************************************************************/
2253 #malloc_police.c:struct gen_list *get_police_list()
2255 #malloc_police.c: static struct gen_list *police_list = NULL;
2257 #malloc_police.c: if ( NULL == police_list )
2259 #malloc_police.c: recursion_protect ++;
2260 #malloc_police.c: list_is_quiet ++;
2262 #malloc_police.c: police_list = gen_list_construct();
2263 #malloc_police.c: atexit( release_police_list );
2265 #malloc_police.c: recursion_protect --;
2266 #malloc_police.c: list_is_quiet --;
2269 #malloc_police.c: return( police_list );
2274 #malloc_police.c:/*********************************************************************
2276 #malloc_police.c: * Function : police_strdup
2278 #malloc_police.c: * Description : Save the results of the strdup into our linked list.
2279 #malloc_police.c: * This will be checked against latter free(s).
2281 #malloc_police.c: * Parameters :
2282 #malloc_police.c: * 1 : The string to be duplicated.
2283 #malloc_police.c: * 2 : Filename where the strdup occured.
2284 #malloc_police.c: * 3 : Line# of where the strdup occured.
2286 #malloc_police.c: * Returns : Pointer to newly allocated memory.
2288 #malloc_police.c: * NOTE : This could replace the custom strdup for __MINGW32__
2289 #malloc_police.c: * systems. We only need to copy the conditionally
2290 #malloc_police.c: * compiled code here and eliminate the strdup copy.
2292 #malloc_police.c: *********************************************************************/
2293 #malloc_police.c:char *police_strdup( const char *s, const char *filename, long lineno )
2295 #malloc_police.c: char *ret = strdup( s );
2297 #malloc_police.c: if ( 0 == recursion_protect )
2299 #malloc_police.c: char buffer[ 255 ];
2300 #malloc_police.c: sprintf( buffer, "strdup : %s @ %ld for %ld (%s)", filename, lineno, strlen( s ) + 1, s );
2302 #malloc_police.c: recursion_protect ++;
2303 #malloc_police.c: list_is_quiet ++;
2305 #malloc_police.c: gen_list_insert(
2306 #malloc_police.c: get_police_list(),
2307 #malloc_police.c: (struct gen_list_rec *)derived_rec_malloc_police_construct( ret, buffer, strlen( s ) + 1 )
2308 #malloc_police.c: );
2310 #malloc_police.c: recursion_protect --;
2311 #malloc_police.c: list_is_quiet --;
2314 #malloc_police.c: return( ret );
2319 #malloc_police.c:/*********************************************************************
2321 #malloc_police.c: * Function : police_malloc
2323 #malloc_police.c: * Description : Save the results of the malloc into our linked list.
2324 #malloc_police.c: * This will be checked against latter free(s).
2326 #malloc_police.c: * Parameters :
2327 #malloc_police.c: * 1 : The size of the memory to be malloc(ed).
2328 #malloc_police.c: * 2 : Filename where the malloc occured.
2329 #malloc_police.c: * 3 : Line# of where the malloc occured.
2331 #malloc_police.c: * Returns : 0 => NOT EQUAL, anything else is EQUAL.
2333 #malloc_police.c: *********************************************************************/
2334 #malloc_police.c:void *police_malloc( size_t sz, const char *filename, long lineno )
2336 #malloc_police.c: void *ret = malloc( sz );
2338 #malloc_police.c: if ( 0 == recursion_protect )
2340 #malloc_police.c: char buffer[ 255 ];
2341 #malloc_police.c: sprintf( buffer, "malloc : %s @ %ld for %ld", filename, lineno, sz );
2343 #malloc_police.c: recursion_protect ++;
2344 #malloc_police.c: list_is_quiet ++;
2346 #malloc_police.c: gen_list_insert(
2347 #malloc_police.c: get_police_list(),
2348 #malloc_police.c: (struct gen_list_rec *)derived_rec_malloc_police_construct( ret, buffer, sz )
2349 #malloc_police.c: );
2351 #malloc_police.c: recursion_protect --;
2352 #malloc_police.c: list_is_quiet --;
2355 #malloc_police.c: return( ret );
2360 #malloc_police.c:/*********************************************************************
2362 #malloc_police.c: * Function : police_free
2364 #malloc_police.c: * Description : Frees the memory allocation and removes the address
2365 #malloc_police.c: * from the linked list. Anything left in this list
2366 #malloc_police.c: * is "leaked" memory.
2368 #malloc_police.c: * Parameters :
2369 #malloc_police.c: * 1 : Pointer to the memory to be freed.
2370 #malloc_police.c: * 2 : Filename where the free occured.
2371 #malloc_police.c: * 3 : Line# of where the free occured.
2373 #malloc_police.c: * Returns : 0 => NOT EQUAL, anything else is EQUAL.
2375 #malloc_police.c: *********************************************************************/
2376 #malloc_police.c:void police_free( void *ptr, const char *filename, long lineno )
2378 #malloc_police.c: if ( 0 == recursion_protect )
2380 #malloc_police.c: struct derived_rec_malloc_police *rec;
2381 #malloc_police.c: struct gen_list_rec *fRec;
2382 #malloc_police.c: struct gen_list *l = get_police_list();
2384 #malloc_police.c: recursion_protect ++;
2385 #malloc_police.c: list_is_quiet ++;
2387 #malloc_police.c: rec = derived_rec_malloc_police_construct( ptr, "FREEING POLICE RECORD.", 23 );
2388 #malloc_police.c: fRec = gen_list_find( l, (struct gen_list_rec *)rec );
2389 #malloc_police.c: derived_rec_malloc_police_destruct( rec );
2391 #malloc_police.c: if ( NULL == fRec )
2393 #malloc_police.c: fprintf( stderr, "\nERROR: free failed to find corresponding strdup/malloc : %s @ %ld\n", filename, lineno );
2395 #malloc_police.c: else
2397 #malloc_police.c: derived_rec_malloc_police_destruct( (struct derived_rec_malloc_police *)gen_list_remove( l, fRec ) );
2400 #malloc_police.c: recursion_protect --;
2401 #malloc_police.c: list_is_quiet --;
2404 #malloc_police.c: free( ptr );
2409 #malloc_police.h:#ifndef MALLOC_POLICE_H_INCLUDED
2410 #malloc_police.h:#define MALLOC_POLICE_H_INCLUDED
2411 #malloc_police.h:#define MALLOC_POLICE_H_VERSION "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $"
2412 #malloc_police.h:/*********************************************************************
2414 #malloc_police.h: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
2416 #malloc_police.h: * Purpose : This module uses the rec_malloc_police to build a
2417 #malloc_police.h: * list of allocated and freed memory. When the
2418 #malloc_police.h: * program exits, we will print a list of all memory
2419 #malloc_police.h: * that was allocated, but never freed. This could
2420 #malloc_police.h: * be most helpful to developers and debugers.
2422 #malloc_police.h: * Copyright : Written by and Copyright (C) 2001 the SourceForge
2423 #malloc_police.h: * Privoxy team. http://www.privoxy.org/
2425 #malloc_police.h: * This program is free software; you can redistribute it
2426 #malloc_police.h: * and/or modify it under the terms of the GNU General
2427 #malloc_police.h: * Public License as published by the Free Software
2428 #malloc_police.h: * Foundation; either version 2 of the License, or (at
2429 #malloc_police.h: * your option) any later version.
2431 #malloc_police.h: * This program is distributed in the hope that it will
2432 #malloc_police.h: * be useful, but WITHOUT ANY WARRANTY; without even the
2433 #malloc_police.h: * implied warranty of MERCHANTABILITY or FITNESS FOR A
2434 #malloc_police.h: * PARTICULAR PURPOSE. See the GNU General Public
2435 #malloc_police.h: * License for more details.
2437 #malloc_police.h: * The GNU General Public License should be included with
2438 #malloc_police.h: * this file. If not, you can view it at
2439 #malloc_police.h: * http://www.gnu.org/copyleft/gpl.html
2440 #malloc_police.h: * or write to the Free Software Foundation, Inc., 59
2441 #malloc_police.h: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
2443 #malloc_police.h: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
2444 #malloc_police.h: * and edit IJB, correctly.
2446 #malloc_police.h: * Revisions :
2447 #malloc_police.h: * $Log: contrib.sh,v $
2448 #malloc_police.h: * Revision 1.2 2002/03/24 13:25:43 swa
2449 #malloc_police.h: * name change related issues
2451 #malloc_police.h: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
2452 #malloc_police.h: * A contribution/recomendation to the IJBSWA group for a generic doubly
2453 #malloc_police.h: * linked list. This file is a home brew "bash tar" (I cannot create a
2454 #malloc_police.h: * contrib directory and I cannot upload a tarball ... it gets
2455 #malloc_police.h: * corrupted). This script will expand all files needed to create the
2456 #malloc_police.h: * linked list modules and an example program. Please see the README.
2457 #malloc_police.h: * Feed back is welcomed. Enjoy.
2460 #malloc_police.h: *********************************************************************/
2463 #malloc_police.h:#ifdef __cplusplus
2464 #malloc_police.h:extern "C" {
2465 #malloc_police.h:#endif
2468 #malloc_police.h:char *police_strdup( const char *s, const char *filename, long lineno );
2469 #malloc_police.h:void *police_malloc( size_t sz, const char *filename, long lineno );
2470 #malloc_police.h:void police_free( void *ptr, const char *filename, long lineno );
2472 #malloc_police.h:#define STRDUP(s) police_strdup( s, __FILE__, __LINE__ )
2473 #malloc_police.h:#define MALLOC(sz) police_malloc( sz, __FILE__, __LINE__ )
2474 #malloc_police.h:#define FREE(ptr) police_free( ptr, __FILE__, __LINE__ )
2477 #malloc_police.h:#ifdef __cplusplus
2478 #malloc_police.h:} /* extern "C" */
2479 #malloc_police.h:#endif
2481 #malloc_police.h:#endif /* ndef MALLOC_POLICE_H_INCLUDED */
2484 #malloc_police.h: Local Variables:
2485 #malloc_police.h: tab-width: 3
2486 #malloc_police.h: end:
2490 #rec_char.c:const char rec_char_rcs[] = "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $";
2491 #rec_char.c:/*********************************************************************
2493 #rec_char.c: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
2495 #rec_char.c: * Purpose : A "derived class" of gen_list_rec.
2497 #rec_char.c: * Copyright : Written by and Copyright (C) 2001 the SourceForge
2498 #rec_char.c: * Privoxy team. http://www.privoxy.org/
2500 #rec_char.c: * This program is free software; you can redistribute it
2501 #rec_char.c: * and/or modify it under the terms of the GNU General
2502 #rec_char.c: * Public License as published by the Free Software
2503 #rec_char.c: * Foundation; either version 2 of the License, or (at
2504 #rec_char.c: * your option) any later version.
2506 #rec_char.c: * This program is distributed in the hope that it will
2507 #rec_char.c: * be useful, but WITHOUT ANY WARRANTY; without even the
2508 #rec_char.c: * implied warranty of MERCHANTABILITY or FITNESS FOR A
2509 #rec_char.c: * PARTICULAR PURPOSE. See the GNU General Public
2510 #rec_char.c: * License for more details.
2512 #rec_char.c: * The GNU General Public License should be included with
2513 #rec_char.c: * this file. If not, you can view it at
2514 #rec_char.c: * http://www.gnu.org/copyleft/gpl.html
2515 #rec_char.c: * or write to the Free Software Foundation, Inc., 59
2516 #rec_char.c: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
2518 #rec_char.c: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
2519 #rec_char.c: * and edit IJB, correctly.
2521 #rec_char.c: * Revisions :
2522 #rec_char.c: * $Log: contrib.sh,v $
2523 #rec_char.c: * Revision 1.2 2002/03/24 13:25:43 swa
2524 #rec_char.c: * name change related issues
2526 #rec_char.c: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
2527 #rec_char.c: * A contribution/recomendation to the IJBSWA group for a generic doubly
2528 #rec_char.c: * linked list. This file is a home brew "bash tar" (I cannot create a
2529 #rec_char.c: * contrib directory and I cannot upload a tarball ... it gets
2530 #rec_char.c: * corrupted). This script will expand all files needed to create the
2531 #rec_char.c: * linked list modules and an example program. Please see the README.
2532 #rec_char.c: * Feed back is welcomed. Enjoy.
2535 #rec_char.c: *********************************************************************/
2538 #rec_char.c:#include <malloc.h>
2539 #rec_char.c:#include <stdio.h>
2540 #rec_char.c:#include <stdlib.h>
2541 #rec_char.c:#include <string.h>
2543 #rec_char.c:#include "gen_list.h"
2544 #rec_char.c:#include "rec_char.h"
2546 #rec_char.c:const char rec_char_h_rcs[] = REC_CHAR_H_VERSION;
2549 #rec_char.c:static const rec_method rec_char_vtable[] =
2551 #rec_char.c: (rec_method)derived_rec_char_copy_construct,
2552 #rec_char.c: (rec_method)derived_rec_char_destruct,
2553 #rec_char.c: (rec_method)derived_rec_char_stream,
2554 #rec_char.c: (rec_method)derived_rec_char_equal
2558 #rec_char.c:/*********************************************************************
2560 #rec_char.c: * Function : derived_rec_char_construct
2562 #rec_char.c: * Description : A simple derived record class that contains 1 string.
2564 #rec_char.c: * Parameters :
2565 #rec_char.c: * 1 : The record
2566 #rec_char.c: * 2 : The string to contain.
2568 #rec_char.c: * Returns : A pointer to the constructed record.
2570 #rec_char.c: *********************************************************************/
2571 #rec_char.c:struct derived_rec_char *derived_rec_char_construct( const char _contents )
2573 #rec_char.c: struct derived_rec_char *this_rec = (struct derived_rec_char *)gen_list_rec_construct(
2574 #rec_char.c: ISA_CHAR,
2575 #rec_char.c: sizeof( struct derived_rec_char ),
2576 #rec_char.c: rec_char_vtable
2579 #rec_char.c: this_rec->contents = _contents;
2581 #rec_char.c: LIST_SHOW( printf( "\
2582 #rec_char.c:\t\tchar construct new rec\t\t\t\t= %p
2583 #rec_char.c:\t\tchar construct new rec contents\t= %c\n\n", (const void *)this_rec, this_rec->contents ) );
2585 #rec_char.c: return( this_rec );
2590 #rec_char.c:/*********************************************************************
2592 #rec_char.c: * Function : derived_rec_char_copy_construct
2594 #rec_char.c: * Description : Copies one char record to another.
2596 #rec_char.c: * Parameters :
2597 #rec_char.c: * 1 : Existing record.
2598 #rec_char.c: * 2 : Copy record.
2600 #rec_char.c: * Returns : The newly constructed copy record.
2602 #rec_char.c: *********************************************************************/
2603 #rec_char.c:struct derived_rec_char *derived_rec_char_copy_construct( const struct derived_rec_char *this_rec )
2605 #rec_char.c: struct derived_rec_char *copy_rec = (struct derived_rec_char *)gen_list_rec_copy_construct( (struct gen_list_rec *)this_rec );
2606 #rec_char.c: copy_rec->contents = this_rec->contents;
2608 #rec_char.c: LIST_SHOW( printf( "\
2609 #rec_char.c:\t\tchar copy construct new gen rec\t\t\t\t= %p => %p
2610 #rec_char.c:\t\tchar copy construct new gen rec contents\t= %c\n\n", (const void *)this_rec, (const void *)copy_rec, copy_rec->contents ) );
2612 #rec_char.c: return( copy_rec );
2617 #rec_char.c:/*********************************************************************
2619 #rec_char.c: * Function : derived_rec_char_destruct
2621 #rec_char.c: * Description : Destruct the char record.
2623 #rec_char.c: * Parameters :
2624 #rec_char.c: * 1 : The record.
2626 #rec_char.c: * Returns : NULL
2628 #rec_char.c: *********************************************************************/
2629 #rec_char.c:struct derived_rec_char *derived_rec_char_destruct( struct derived_rec_char *this_rec )
2631 #rec_char.c: LIST_SHOW( printf( "\
2632 #rec_char.c:\t\tchar destruct this_rec\t\t\t\t= %p
2633 #rec_char.c:\t\tchar destruct this_rec->contents\t= %c\n\n", (const void *)this_rec, this_rec->contents ) );
2635 #rec_char.c: this_rec->contents = '!';
2636 #rec_char.c: return( (struct derived_rec_char *)gen_list_rec_destruct( (struct gen_list_rec *)this_rec ) );
2641 #rec_char.c:/*********************************************************************
2643 #rec_char.c: * Function : derived_rec_char_stream
2645 #rec_char.c: * Description : Displays all char attributes on the STDOUT stream.
2647 #rec_char.c: * Parameters :
2648 #rec_char.c: * 1 : The record.
2650 #rec_char.c: * Returns : The record.
2652 #rec_char.c: *********************************************************************/
2653 #rec_char.c:const struct derived_rec_char *derived_rec_char_stream( const struct derived_rec_char *this_rec )
2655 #rec_char.c: this_rec = (struct derived_rec_char *)gen_list_rec_stream(
2656 #rec_char.c: (struct gen_list_rec *)this_rec
2658 #rec_char.c: LIST_SHOW( printf( "\
2659 #rec_char.c:\t\tchar stream this_rec\t\t\t\t\t= %p
2660 #rec_char.c:\t\tchar stream this_rec->contents\t= %c\n\n", (const void *)this_rec, this_rec->contents ) );
2662 #rec_char.c: return( this_rec );
2667 #rec_char.c:/*********************************************************************
2669 #rec_char.c: * Function : derived_rec_char_equal
2671 #rec_char.c: * Description : Compares two char records to see if they are equal.
2673 #rec_char.c: * Parameters :
2674 #rec_char.c: * 1 : A record.
2675 #rec_char.c: * 2 : Another record.
2677 #rec_char.c: * Returns : 0 => NOT EQUAL, anything else is EQUAL.
2679 #rec_char.c: *********************************************************************/
2680 #rec_char.c:int derived_rec_char_equal( const struct derived_rec_char *this_rec, const struct derived_rec_char *eq_rec )
2682 #rec_char.c: if ( ! gen_list_rec_equal( (const struct gen_list_rec *)this_rec, (struct gen_list_rec *)eq_rec ) )
2684 #rec_char.c: return( 0 );
2686 #rec_char.c: return( this_rec->contents == eq_rec->contents );
2691 #rec_char.h:#ifndef REC_CHAR_H_INCLUDED
2692 #rec_char.h:#define REC_CHAR_H_INCLUDED
2693 #rec_char.h:#define REC_CHAR_H_VERSION "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $"
2694 #rec_char.h:/*********************************************************************
2696 #rec_char.h: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
2698 #rec_char.h: * Purpose : A "derived class" of gen_list_rec.
2700 #rec_char.h: * Copyright : Written by and Copyright (C) 2001 the SourceForge
2701 #rec_char.h: * Privoxy team. http://www.privoxy.org/
2703 #rec_char.h: * This program is free software; you can redistribute it
2704 #rec_char.h: * and/or modify it under the terms of the GNU General
2705 #rec_char.h: * Public License as published by the Free Software
2706 #rec_char.h: * Foundation; either version 2 of the License, or (at
2707 #rec_char.h: * your option) any later version.
2709 #rec_char.h: * This program is distributed in the hope that it will
2710 #rec_char.h: * be useful, but WITHOUT ANY WARRANTY; without even the
2711 #rec_char.h: * implied warranty of MERCHANTABILITY or FITNESS FOR A
2712 #rec_char.h: * PARTICULAR PURPOSE. See the GNU General Public
2713 #rec_char.h: * License for more details.
2715 #rec_char.h: * The GNU General Public License should be included with
2716 #rec_char.h: * this file. If not, you can view it at
2717 #rec_char.h: * http://www.gnu.org/copyleft/gpl.html
2718 #rec_char.h: * or write to the Free Software Foundation, Inc., 59
2719 #rec_char.h: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
2721 #rec_char.h: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
2722 #rec_char.h: * and edit IJB, correctly.
2724 #rec_char.h: * Revisions :
2725 #rec_char.h: * $Log: contrib.sh,v $
2726 #rec_char.h: * Revision 1.2 2002/03/24 13:25:43 swa
2727 #rec_char.h: * name change related issues
2729 #rec_char.h: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
2730 #rec_char.h: * A contribution/recomendation to the IJBSWA group for a generic doubly
2731 #rec_char.h: * linked list. This file is a home brew "bash tar" (I cannot create a
2732 #rec_char.h: * contrib directory and I cannot upload a tarball ... it gets
2733 #rec_char.h: * corrupted). This script will expand all files needed to create the
2734 #rec_char.h: * linked list modules and an example program. Please see the README.
2735 #rec_char.h: * Feed back is welcomed. Enjoy.
2738 #rec_char.h: *********************************************************************/
2741 #rec_char.h:#ifdef __cplusplus
2742 #rec_char.h:extern "C" {
2746 #rec_char.h:struct derived_rec_char
2748 #rec_char.h: /* private: */
2749 #rec_char.h: struct gen_list_rec parent_rec;
2750 #rec_char.h: char contents;
2753 #rec_char.h:/* public: */
2754 #rec_char.h:extern struct derived_rec_char * derived_rec_char_construct( const char _contents );
2755 #rec_char.h:extern struct derived_rec_char * derived_rec_char_copy_construct( const struct derived_rec_char *this_rec );
2756 #rec_char.h:extern struct derived_rec_char * derived_rec_char_destruct( struct derived_rec_char *this_rec );
2757 #rec_char.h:extern const struct derived_rec_char *derived_rec_char_stream( const struct derived_rec_char *this_rec );
2758 #rec_char.h:extern int derived_rec_char_equal( const struct derived_rec_char *this_rec, const struct derived_rec_char *eq_rec );
2760 #rec_char.h:/* struct/class COMPLETE */
2763 #rec_char.h:#ifdef __cplusplus
2764 #rec_char.h:} /* extern "C" */
2767 #rec_char.h:#endif /* ndef REC_CHAR_H_INCLUDED */
2770 #rec_char.h: Local Variables:
2771 #rec_char.h: tab-width: 3
2776 #rec_charptr.c:const char rec_charptr_rcs[] = "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $";
2777 #rec_charptr.c:/*********************************************************************
2779 #rec_charptr.c: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
2781 #rec_charptr.c: * Purpose : A "derived class" of gen_list_rec.
2783 #rec_charptr.c: * Copyright : Written by and Copyright (C) 2001 the SourceForge
2784 #rec_charptr.c: * Privoxy team. http://www.privoxy.org/
2786 #rec_charptr.c: * This program is free software; you can redistribute it
2787 #rec_charptr.c: * and/or modify it under the terms of the GNU General
2788 #rec_charptr.c: * Public License as published by the Free Software
2789 #rec_charptr.c: * Foundation; either version 2 of the License, or (at
2790 #rec_charptr.c: * your option) any later version.
2792 #rec_charptr.c: * This program is distributed in the hope that it will
2793 #rec_charptr.c: * be useful, but WITHOUT ANY WARRANTY; without even the
2794 #rec_charptr.c: * implied warranty of MERCHANTABILITY or FITNESS FOR A
2795 #rec_charptr.c: * PARTICULAR PURPOSE. See the GNU General Public
2796 #rec_charptr.c: * License for more details.
2798 #rec_charptr.c: * The GNU General Public License should be included with
2799 #rec_charptr.c: * this file. If not, you can view it at
2800 #rec_charptr.c: * http://www.gnu.org/copyleft/gpl.html
2801 #rec_charptr.c: * or write to the Free Software Foundation, Inc., 59
2802 #rec_charptr.c: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
2804 #rec_charptr.c: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
2805 #rec_charptr.c: * and edit IJB, correctly.
2807 #rec_charptr.c: * Revisions :
2808 #rec_charptr.c: * $Log: contrib.sh,v $
2809 #rec_charptr.c: * Revision 1.2 2002/03/24 13:25:43 swa
2810 #rec_charptr.c: * name change related issues
2812 #rec_charptr.c: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
2813 #rec_charptr.c: * A contribution/recomendation to the IJBSWA group for a generic doubly
2814 #rec_charptr.c: * linked list. This file is a home brew "bash tar" (I cannot create a
2815 #rec_charptr.c: * contrib directory and I cannot upload a tarball ... it gets
2816 #rec_charptr.c: * corrupted). This script will expand all files needed to create the
2817 #rec_charptr.c: * linked list modules and an example program. Please see the README.
2818 #rec_charptr.c: * Feed back is welcomed. Enjoy.
2821 #rec_charptr.c: *********************************************************************/
2824 #rec_charptr.c:#include <malloc.h>
2825 #rec_charptr.c:#include <stdio.h>
2826 #rec_charptr.c:#include <stdlib.h>
2827 #rec_charptr.c:#include <string.h>
2829 #rec_charptr.c:#include "gen_list.h"
2830 #rec_charptr.c:#include "rec_charptr.h"
2831 #rec_charptr.c:#include "malloc_police.h"
2833 #rec_charptr.c:const char rec_charptr_h_rcs[] = REC_CHARPTR_H_VERSION;
2836 #rec_charptr.c:static const rec_method rec_charptr_vtable[] =
2838 #rec_charptr.c: (rec_method)derived_rec_charptr_copy_construct,
2839 #rec_charptr.c: (rec_method)derived_rec_charptr_destruct,
2840 #rec_charptr.c: (rec_method)derived_rec_charptr_stream,
2841 #rec_charptr.c: (rec_method)derived_rec_charptr_equal
2845 #rec_charptr.c:/*********************************************************************
2847 #rec_charptr.c: * Function : derived_rec_charptr_construct
2849 #rec_charptr.c: * Description : A simple derived record class that contains 1 string.
2851 #rec_charptr.c: * Parameters :
2852 #rec_charptr.c: * 1 : The record
2853 #rec_charptr.c: * 2 : The string to contain.
2855 #rec_charptr.c: * Returns : A pointer to the constructed record.
2857 #rec_charptr.c: *********************************************************************/
2858 #rec_charptr.c:struct derived_rec_charptr *derived_rec_charptr_construct( const char *_contents )
2860 #rec_charptr.c: struct derived_rec_charptr *this_rec = (struct derived_rec_charptr *)gen_list_rec_construct(
2861 #rec_charptr.c: ISA_CHARPTR,
2862 #rec_charptr.c: sizeof( struct derived_rec_charptr ),
2863 #rec_charptr.c: rec_charptr_vtable
2866 #rec_charptr.c: this_rec->contents = STRDUP( _contents );
2868 #rec_charptr.c: LIST_SHOW( printf( "\
2869 #rec_charptr.c:\t\tcharptr construct new rec\t\t\t\t= %p
2870 #rec_charptr.c:\t\tcharptr construct new rec contents\t= %s\n\n", (const void *)this_rec, this_rec->contents ) );
2872 #rec_charptr.c: return( this_rec );
2877 #rec_charptr.c:/*********************************************************************
2879 #rec_charptr.c: * Function : derived_rec_charptr_copy_construct
2881 #rec_charptr.c: * Description : Copies one charptr record to another.
2883 #rec_charptr.c: * Parameters :
2884 #rec_charptr.c: * 1 : Existing record.
2885 #rec_charptr.c: * 2 : Copy record.
2887 #rec_charptr.c: * Returns : The newly constructed copy record.
2889 #rec_charptr.c: *********************************************************************/
2890 #rec_charptr.c:struct derived_rec_charptr *derived_rec_charptr_copy_construct( const struct derived_rec_charptr *this_rec )
2892 #rec_charptr.c: int len;
2893 #rec_charptr.c: char *new_contents;
2895 #rec_charptr.c: struct derived_rec_charptr *copy_rec = (struct derived_rec_charptr *)gen_list_rec_copy_construct( (struct gen_list_rec *)this_rec );
2897 #rec_charptr.c: len = strlen( this_rec->contents );
2898 #rec_charptr.c: len += sizeof( "COPY " );
2900 #rec_charptr.c: copy_rec->contents = (char *)MALLOC( len );
2901 #rec_charptr.c: strcpy( copy_rec->contents, "COPY " );
2902 #rec_charptr.c: strcat( copy_rec->contents, this_rec->contents );
2904 #rec_charptr.c: LIST_SHOW( printf( "\
2905 #rec_charptr.c:\t\tcharptr copy construct new gen rec\t\t\t\t= %p => %p
2906 #rec_charptr.c:\t\tcharptr copy construct new gen rec contents\t= %s\n\n", (const void *)this_rec, (const void *)copy_rec, copy_rec->contents ) );
2909 #rec_charptr.c: return( copy_rec );
2914 #rec_charptr.c:/*********************************************************************
2916 #rec_charptr.c: * Function : derived_rec_charptr_destruct
2918 #rec_charptr.c: * Description : Destruct the charptr record.
2920 #rec_charptr.c: * Parameters :
2921 #rec_charptr.c: * 1 : The record.
2923 #rec_charptr.c: * Returns : NULL
2925 #rec_charptr.c: *********************************************************************/
2926 #rec_charptr.c:struct derived_rec_charptr *derived_rec_charptr_destruct( struct derived_rec_charptr *this_rec )
2928 #rec_charptr.c: LIST_SHOW( printf( "\
2929 #rec_charptr.c:\t\tcharptr destruct this_rec\t\t\t\t= %p
2930 #rec_charptr.c:\t\tcharptr destruct this_rec->contents\t= %s\n\n", (const void *)this_rec, (const void *)this_rec->contents ) );
2932 #rec_charptr.c: memset( this_rec->contents, '!', strlen( this_rec->contents ) );
2933 #rec_charptr.c: FREE( this_rec->contents );
2934 #rec_charptr.c: return( (struct derived_rec_charptr *)gen_list_rec_destruct( (struct gen_list_rec *)this_rec ) );
2939 #rec_charptr.c:/*********************************************************************
2941 #rec_charptr.c: * Function : derived_rec_charptr_stream
2943 #rec_charptr.c: * Description : Displays all charptr attributes on the STDOUT stream.
2945 #rec_charptr.c: * Parameters :
2946 #rec_charptr.c: * 1 : The record.
2948 #rec_charptr.c: * Returns : The record.
2950 #rec_charptr.c: *********************************************************************/
2951 #rec_charptr.c:const struct derived_rec_charptr *derived_rec_charptr_stream( const struct derived_rec_charptr *this_rec )
2953 #rec_charptr.c: this_rec = (struct derived_rec_charptr *)gen_list_rec_stream(
2954 #rec_charptr.c: (struct gen_list_rec *)this_rec
2956 #rec_charptr.c: LIST_SHOW( printf( "\
2957 #rec_charptr.c:\t\tcharptr stream this_rec\t\t\t\t\t= %p
2958 #rec_charptr.c:\t\tcharptr stream this_rec->contents\t= %s\n\n", (const void *)this_rec, this_rec->contents ) );
2960 #rec_charptr.c: return( this_rec );
2965 #rec_charptr.c:/*********************************************************************
2967 #rec_charptr.c: * Function : derived_rec_charptr_equal
2969 #rec_charptr.c: * Description : Compares two charptr records to see if they are equal.
2971 #rec_charptr.c: * Parameters :
2972 #rec_charptr.c: * 1 : A record.
2973 #rec_charptr.c: * 2 : Another record.
2975 #rec_charptr.c: * Returns : 0 => NOT EQUAL, anything else is EQUAL.
2977 #rec_charptr.c: *********************************************************************/
2978 #rec_charptr.c:int derived_rec_charptr_equal( const struct derived_rec_charptr *this_rec, const struct derived_rec_charptr *eq_rec )
2980 #rec_charptr.c: if ( ! gen_list_rec_equal( (const struct gen_list_rec *)this_rec, (struct gen_list_rec *)eq_rec ) )
2982 #rec_charptr.c: return( 0 );
2984 #rec_charptr.c: return( 0 == strcmp( this_rec->contents, eq_rec->contents ) );
2989 #rec_charptr.h:#ifndef REC_CHARPTR_H_INCLUDED
2990 #rec_charptr.h:#define REC_CHARPTR_H_INCLUDED
2991 #rec_charptr.h:#define REC_CHARPTR_H_VERSION "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $"
2992 #rec_charptr.h:/*********************************************************************
2994 #rec_charptr.h: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
2996 #rec_charptr.h: * Purpose : A "derived class" of gen_list_rec.
2998 #rec_charptr.h: * Copyright : Written by and Copyright (C) 2001 the SourceForge
2999 #rec_charptr.h: * Privoxy team. http://www.privoxy.org/
3001 #rec_charptr.h: * This program is free software; you can redistribute it
3002 #rec_charptr.h: * and/or modify it under the terms of the GNU General
3003 #rec_charptr.h: * Public License as published by the Free Software
3004 #rec_charptr.h: * Foundation; either version 2 of the License, or (at
3005 #rec_charptr.h: * your option) any later version.
3007 #rec_charptr.h: * This program is distributed in the hope that it will
3008 #rec_charptr.h: * be useful, but WITHOUT ANY WARRANTY; without even the
3009 #rec_charptr.h: * implied warranty of MERCHANTABILITY or FITNESS FOR A
3010 #rec_charptr.h: * PARTICULAR PURPOSE. See the GNU General Public
3011 #rec_charptr.h: * License for more details.
3013 #rec_charptr.h: * The GNU General Public License should be included with
3014 #rec_charptr.h: * this file. If not, you can view it at
3015 #rec_charptr.h: * http://www.gnu.org/copyleft/gpl.html
3016 #rec_charptr.h: * or write to the Free Software Foundation, Inc., 59
3017 #rec_charptr.h: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
3019 #rec_charptr.h: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
3020 #rec_charptr.h: * and edit IJB, correctly.
3022 #rec_charptr.h: * Revisions :
3023 #rec_charptr.h: * $Log: contrib.sh,v $
3024 #rec_charptr.h: * Revision 1.2 2002/03/24 13:25:43 swa
3025 #rec_charptr.h: * name change related issues
3027 #rec_charptr.h: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
3028 #rec_charptr.h: * A contribution/recomendation to the IJBSWA group for a generic doubly
3029 #rec_charptr.h: * linked list. This file is a home brew "bash tar" (I cannot create a
3030 #rec_charptr.h: * contrib directory and I cannot upload a tarball ... it gets
3031 #rec_charptr.h: * corrupted). This script will expand all files needed to create the
3032 #rec_charptr.h: * linked list modules and an example program. Please see the README.
3033 #rec_charptr.h: * Feed back is welcomed. Enjoy.
3036 #rec_charptr.h: *********************************************************************/
3039 #rec_charptr.h:#ifdef __cplusplus
3040 #rec_charptr.h:extern "C" {
3041 #rec_charptr.h:#endif
3044 #rec_charptr.h:struct derived_rec_charptr
3046 #rec_charptr.h: /* private: */
3047 #rec_charptr.h: struct gen_list_rec parent_rec;
3048 #rec_charptr.h: char *contents;
3051 #rec_charptr.h:/* public: */
3052 #rec_charptr.h:extern struct derived_rec_charptr * derived_rec_charptr_construct( const char *_contents );
3053 #rec_charptr.h:extern struct derived_rec_charptr * derived_rec_charptr_copy_construct( const struct derived_rec_charptr *this_rec );
3054 #rec_charptr.h:extern struct derived_rec_charptr * derived_rec_charptr_destruct( struct derived_rec_charptr *this_rec );
3055 #rec_charptr.h:extern const struct derived_rec_charptr *derived_rec_charptr_stream( const struct derived_rec_charptr *this_rec );
3056 #rec_charptr.h:extern int derived_rec_charptr_equal( const struct derived_rec_charptr *this_rec, const struct derived_rec_charptr *eq_rec );
3058 #rec_charptr.h:/* struct/class COMPLETE */
3061 #rec_charptr.h:#ifdef __cplusplus
3062 #rec_charptr.h:} /* extern "C" */
3063 #rec_charptr.h:#endif
3065 #rec_charptr.h:#endif /* ndef REC_CHARPTR_H_INCLUDED */
3068 #rec_charptr.h: Local Variables:
3069 #rec_charptr.h: tab-width: 3
3070 #rec_charptr.h: end:
3074 #rec_double.c:const char rec_double_rcs[] = "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $";
3075 #rec_double.c:/*********************************************************************
3077 #rec_double.c: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
3079 #rec_double.c: * Purpose : A "derived class" of gen_list_rec.
3081 #rec_double.c: * Copyright : Written by and Copyright (C) 2001 the SourceForge
3082 #rec_double.c: * Privoxy team. http://www.privoxy.org/
3084 #rec_double.c: * This program is free software; you can redistribute it
3085 #rec_double.c: * and/or modify it under the terms of the GNU General
3086 #rec_double.c: * Public License as published by the Free Software
3087 #rec_double.c: * Foundation; either version 2 of the License, or (at
3088 #rec_double.c: * your option) any later version.
3090 #rec_double.c: * This program is distributed in the hope that it will
3091 #rec_double.c: * be useful, but WITHOUT ANY WARRANTY; without even the
3092 #rec_double.c: * implied warranty of MERCHANTABILITY or FITNESS FOR A
3093 #rec_double.c: * PARTICULAR PURPOSE. See the GNU General Public
3094 #rec_double.c: * License for more details.
3096 #rec_double.c: * The GNU General Public License should be included with
3097 #rec_double.c: * this file. If not, you can view it at
3098 #rec_double.c: * http://www.gnu.org/copyleft/gpl.html
3099 #rec_double.c: * or write to the Free Software Foundation, Inc., 59
3100 #rec_double.c: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
3102 #rec_double.c: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
3103 #rec_double.c: * and edit IJB, correctly.
3105 #rec_double.c: * Revisions :
3106 #rec_double.c: * $Log: contrib.sh,v $
3107 #rec_double.c: * Revision 1.2 2002/03/24 13:25:43 swa
3108 #rec_double.c: * name change related issues
3110 #rec_double.c: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
3111 #rec_double.c: * A contribution/recomendation to the IJBSWA group for a generic doubly
3112 #rec_double.c: * linked list. This file is a home brew "bash tar" (I cannot create a
3113 #rec_double.c: * contrib directory and I cannot upload a tarball ... it gets
3114 #rec_double.c: * corrupted). This script will expand all files needed to create the
3115 #rec_double.c: * linked list modules and an example program. Please see the README.
3116 #rec_double.c: * Feed back is welcomed. Enjoy.
3119 #rec_double.c: *********************************************************************/
3122 #rec_double.c:#include <malloc.h>
3123 #rec_double.c:#include <stdio.h>
3124 #rec_double.c:#include <stdlib.h>
3125 #rec_double.c:#include <string.h>
3127 #rec_double.c:#include "gen_list.h"
3128 #rec_double.c:#include "rec_double.h"
3130 #rec_double.c:const char rec_double_h_rcs[] = REC_DOUBLE_H_VERSION;
3133 #rec_double.c:static const rec_method rec_double_vtable[] =
3135 #rec_double.c: (rec_method)derived_rec_double_copy_construct,
3136 #rec_double.c: (rec_method)derived_rec_double_destruct,
3137 #rec_double.c: (rec_method)derived_rec_double_stream,
3138 #rec_double.c: (rec_method)derived_rec_double_equal
3142 #rec_double.c:/*********************************************************************
3144 #rec_double.c: * Function : derived_rec_double_construct
3146 #rec_double.c: * Description : A simple derived record class that contains 1 string.
3148 #rec_double.c: * Parameters :
3149 #rec_double.c: * 1 : The record
3150 #rec_double.c: * 2 : The string to contain.
3152 #rec_double.c: * Returns : A pointer to the constructed record.
3154 #rec_double.c: *********************************************************************/
3155 #rec_double.c:struct derived_rec_double *derived_rec_double_construct( const double _contents )
3157 #rec_double.c: struct derived_rec_double *this_rec = (struct derived_rec_double *)gen_list_rec_construct(
3158 #rec_double.c: ISA_DOUBLE,
3159 #rec_double.c: sizeof( struct derived_rec_double ),
3160 #rec_double.c: rec_double_vtable
3163 #rec_double.c: this_rec->contents = _contents;
3165 #rec_double.c: LIST_SHOW( printf( "\
3166 #rec_double.c:\t\tdouble construct new rec\t\t\t\t= %p
3167 #rec_double.c:\t\tdouble construct new rec contents\t= %8.2lf\n\n", (const void *)this_rec, this_rec->contents ) );
3169 #rec_double.c: return( this_rec );
3174 #rec_double.c:/*********************************************************************
3176 #rec_double.c: * Function : derived_rec_double_copy_construct
3178 #rec_double.c: * Description : Copies one double record to another.
3180 #rec_double.c: * Parameters :
3181 #rec_double.c: * 1 : Existing record.
3182 #rec_double.c: * 2 : Copy record.
3184 #rec_double.c: * Returns : The newly constructed copy record.
3186 #rec_double.c: *********************************************************************/
3187 #rec_double.c:struct derived_rec_double *derived_rec_double_copy_construct( const struct derived_rec_double *this_rec )
3189 #rec_double.c: struct derived_rec_double *copy_rec = (struct derived_rec_double *)gen_list_rec_copy_construct( (struct gen_list_rec *)this_rec );
3190 #rec_double.c: copy_rec->contents = - this_rec->contents;
3192 #rec_double.c: LIST_SHOW( printf( "\
3193 #rec_double.c:\t\tdouble copy construct new gen rec\t\t\t\t= %p => %p
3194 #rec_double.c:\t\tdouble copy construct new gen rec contents\t= %8.2lf\n\n", (const void *)this_rec, (const void *)copy_rec, copy_rec->contents ) );
3196 #rec_double.c: return( copy_rec );
3201 #rec_double.c:/*********************************************************************
3203 #rec_double.c: * Function : derived_rec_double_destruct
3205 #rec_double.c: * Description : Destruct the double record.
3207 #rec_double.c: * Parameters :
3208 #rec_double.c: * 1 : The record.
3210 #rec_double.c: * Returns : NULL
3212 #rec_double.c: *********************************************************************/
3213 #rec_double.c:struct derived_rec_double *derived_rec_double_destruct( struct derived_rec_double *this_rec )
3215 #rec_double.c: LIST_SHOW( printf( "\
3216 #rec_double.c:\t\tdouble destruct this_rec\t\t\t\t= %p
3217 #rec_double.c:\t\tdouble destruct this_rec->contents\t= %8.2lf\n\n", (const void *)this_rec, this_rec->contents ) );
3219 #rec_double.c: this_rec->contents = -1.1111;
3220 #rec_double.c: return( (struct derived_rec_double *)gen_list_rec_destruct( (struct gen_list_rec *)this_rec ) );
3225 #rec_double.c:/*********************************************************************
3227 #rec_double.c: * Function : derived_rec_double_stream
3229 #rec_double.c: * Description : Displays all double attributes on the STDOUT stream.
3231 #rec_double.c: * Parameters :
3232 #rec_double.c: * 1 : The record.
3234 #rec_double.c: * Returns : The record.
3236 #rec_double.c: *********************************************************************/
3237 #rec_double.c:const struct derived_rec_double *derived_rec_double_stream( const struct derived_rec_double *this_rec )
3239 #rec_double.c: this_rec = (struct derived_rec_double *)gen_list_rec_stream(
3240 #rec_double.c: (struct gen_list_rec *)this_rec
3242 #rec_double.c: LIST_SHOW( printf( "\
3243 #rec_double.c:\t\tdouble stream this_rec\t\t\t\t= %p
3244 #rec_double.c:\t\tdouble stream this_rec->contents\t= %8.2lf\n\n", (const void *)this_rec, this_rec->contents ) );
3246 #rec_double.c: return( this_rec );
3251 #rec_double.c:/*********************************************************************
3253 #rec_double.c: * Function : derived_rec_double_equal
3255 #rec_double.c: * Description : Compares two double records to see if they are equal.
3257 #rec_double.c: * Parameters :
3258 #rec_double.c: * 1 : A record.
3259 #rec_double.c: * 2 : Another record.
3261 #rec_double.c: * Returns : 0 => NOT EQUAL, anything else is EQUAL.
3263 #rec_double.c: *********************************************************************/
3264 #rec_double.c:int derived_rec_double_equal( const struct derived_rec_double *this_rec, const struct derived_rec_double *eq_rec )
3266 #rec_double.c: if ( ! gen_list_rec_equal( (const struct gen_list_rec *)this_rec, (struct gen_list_rec *)eq_rec ) )
3268 #rec_double.c: return( 0 );
3270 #rec_double.c: return( this_rec->contents == eq_rec->contents );
3275 #rec_double.h:#ifndef REC_DOUBLE_H_INCLUDED
3276 #rec_double.h:#define REC_DOUBLE_H_INCLUDED
3277 #rec_double.h:#define REC_DOUBLE_H_VERSION "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $"
3278 #rec_double.h:/*********************************************************************
3280 #rec_double.h: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
3282 #rec_double.h: * Purpose : gen_A "derived class" of gen_list_rec.
3284 #rec_double.h: * Copyright : Written by and Copyright (C) 2001 the SourceForge
3285 #rec_double.h: * Privoxy team. http://www.privoxy.org/
3287 #rec_double.h: * This program is free software; you can redistribute it
3288 #rec_double.h: * and/or modify it under the terms of the GNU General
3289 #rec_double.h: * Public License as published by the Free Software
3290 #rec_double.h: * Foundation; either version 2 of the License, or (at
3291 #rec_double.h: * your option) any later version.
3293 #rec_double.h: * This program is distributed in the hope that it will
3294 #rec_double.h: * be useful, but WITHOUT ANY WARRANTY; without even the
3295 #rec_double.h: * implied warranty of MERCHANTABILITY or FITNESS FOR A
3296 #rec_double.h: * PARTICULAR PURPOSE. See the GNU General Public
3297 #rec_double.h: * License for more details.
3299 #rec_double.h: * The GNU General Public License should be included with
3300 #rec_double.h: * this file. If not, you can view it at
3301 #rec_double.h: * http://www.gnu.org/copyleft/gpl.html
3302 #rec_double.h: * or write to the Free Software Foundation, Inc., 59
3303 #rec_double.h: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
3305 #rec_double.h: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
3306 #rec_double.h: * and edit IJB, correctly.
3308 #rec_double.h: * Revisions :
3309 #rec_double.h: * $Log: contrib.sh,v $
3310 #rec_double.h: * Revision 1.2 2002/03/24 13:25:43 swa
3311 #rec_double.h: * name change related issues
3313 #rec_double.h: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
3314 #rec_double.h: * A contribution/recomendation to the IJBSWA group for a generic doubly
3315 #rec_double.h: * linked list. This file is a home brew "bash tar" (I cannot create a
3316 #rec_double.h: * contrib directory and I cannot upload a tarball ... it gets
3317 #rec_double.h: * corrupted). This script will expand all files needed to create the
3318 #rec_double.h: * linked list modules and an example program. Please see the README.
3319 #rec_double.h: * Feed back is welcomed. Enjoy.
3322 #rec_double.h: *********************************************************************/
3325 #rec_double.h:#ifdef __cplusplus
3326 #rec_double.h:extern "C" {
3327 #rec_double.h:#endif
3330 #rec_double.h:struct derived_rec_double
3332 #rec_double.h: /* private: */
3333 #rec_double.h: struct gen_list_rec parent_rec;
3334 #rec_double.h: double contents;
3337 #rec_double.h:/* public: */
3338 #rec_double.h:extern struct derived_rec_double * derived_rec_double_construct( const double _contents );
3339 #rec_double.h:extern struct derived_rec_double * derived_rec_double_copy_construct( const struct derived_rec_double *this_rec );
3340 #rec_double.h:extern struct derived_rec_double * derived_rec_double_destruct( struct derived_rec_double *this_rec );
3341 #rec_double.h:extern const struct derived_rec_double *derived_rec_double_stream( const struct derived_rec_double *this_rec );
3342 #rec_double.h:extern int derived_rec_double_equal( const struct derived_rec_double *this_rec, const struct derived_rec_double *eq_rec );
3344 #rec_double.h:/* struct/class COMPLETE */
3347 #rec_double.h:#ifdef __cplusplus
3348 #rec_double.h:} /* extern "C" */
3349 #rec_double.h:#endif
3351 #rec_double.h:#endif /* ndef REC_DOUBLE_H_INCLUDED */
3354 #rec_double.h: Local Variables:
3355 #rec_double.h: tab-width: 3
3360 #rec_long.c:const char rec_long_rcs[] = "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $";
3361 #rec_long.c:/*********************************************************************
3363 #rec_long.c: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
3365 #rec_long.c: * Purpose : A "derived class" of gen_list_rec.
3367 #rec_long.c: * Copyright : Written by and Copyright (C) 2001 the SourceForge
3368 #rec_long.c: * Privoxy team. http://www.privoxy.org/
3370 #rec_long.c: * This program is free software; you can redistribute it
3371 #rec_long.c: * and/or modify it under the terms of the GNU General
3372 #rec_long.c: * Public License as published by the Free Software
3373 #rec_long.c: * Foundation; either version 2 of the License, or (at
3374 #rec_long.c: * your option) any later version.
3376 #rec_long.c: * This program is distributed in the hope that it will
3377 #rec_long.c: * be useful, but WITHOUT ANY WARRANTY; without even the
3378 #rec_long.c: * implied warranty of MERCHANTABILITY or FITNESS FOR A
3379 #rec_long.c: * PARTICULAR PURPOSE. See the GNU General Public
3380 #rec_long.c: * License for more details.
3382 #rec_long.c: * The GNU General Public License should be included with
3383 #rec_long.c: * this file. If not, you can view it at
3384 #rec_long.c: * http://www.gnu.org/copyleft/gpl.html
3385 #rec_long.c: * or write to the Free Software Foundation, Inc., 59
3386 #rec_long.c: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
3388 #rec_long.c: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
3389 #rec_long.c: * and edit IJB, correctly.
3391 #rec_long.c: * Revisions :
3392 #rec_long.c: * $Log: contrib.sh,v $
3393 #rec_long.c: * Revision 1.2 2002/03/24 13:25:43 swa
3394 #rec_long.c: * name change related issues
3396 #rec_long.c: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
3397 #rec_long.c: * A contribution/recomendation to the IJBSWA group for a generic doubly
3398 #rec_long.c: * linked list. This file is a home brew "bash tar" (I cannot create a
3399 #rec_long.c: * contrib directory and I cannot upload a tarball ... it gets
3400 #rec_long.c: * corrupted). This script will expand all files needed to create the
3401 #rec_long.c: * linked list modules and an example program. Please see the README.
3402 #rec_long.c: * Feed back is welcomed. Enjoy.
3405 #rec_long.c: *********************************************************************/
3408 #rec_long.c:#include <malloc.h>
3409 #rec_long.c:#include <stdio.h>
3410 #rec_long.c:#include <stdlib.h>
3411 #rec_long.c:#include <string.h>
3413 #rec_long.c:#include "gen_list.h"
3414 #rec_long.c:#include "rec_long.h"
3416 #rec_long.c:const char rec_long_h_rcs[] = REC_LONG_H_VERSION;
3419 #rec_long.c:static const rec_method rec_long_vtable[] =
3421 #rec_long.c: (rec_method)derived_rec_long_copy_construct,
3422 #rec_long.c: (rec_method)derived_rec_long_destruct,
3423 #rec_long.c: (rec_method)derived_rec_long_stream,
3424 #rec_long.c: (rec_method)derived_rec_long_equal
3428 #rec_long.c:/*********************************************************************
3430 #rec_long.c: * Function : derived_rec_long_construct
3432 #rec_long.c: * Description : A simple derived record class that contains 1 string.
3434 #rec_long.c: * Parameters :
3435 #rec_long.c: * 1 : The record
3436 #rec_long.c: * 2 : The string to contain.
3438 #rec_long.c: * Returns : A pointer to the constructed record.
3440 #rec_long.c: *********************************************************************/
3441 #rec_long.c:struct derived_rec_long *derived_rec_long_construct( const long _contents )
3443 #rec_long.c: struct derived_rec_long *this_rec = (struct derived_rec_long *)gen_list_rec_construct(
3444 #rec_long.c: ISA_LONG,
3445 #rec_long.c: sizeof( struct derived_rec_long ),
3446 #rec_long.c: rec_long_vtable
3449 #rec_long.c: this_rec->contents = _contents;
3451 #rec_long.c: LIST_SHOW( printf( "\
3452 #rec_long.c:\t\tlong construct new rec\t\t\t\t= %p
3453 #rec_long.c:\t\tlong construct new rec contents\t= %d\n\n", (const void *)this_rec, this_rec->contents ) );
3455 #rec_long.c: return( this_rec );
3460 #rec_long.c:/*********************************************************************
3462 #rec_long.c: * Function : derived_rec_long_copy_construct
3464 #rec_long.c: * Description : Copies one long record to another.
3466 #rec_long.c: * Parameters :
3467 #rec_long.c: * 1 : Existing record.
3468 #rec_long.c: * 2 : Copy record.
3470 #rec_long.c: * Returns : The newly constructed copy record.
3472 #rec_long.c: *********************************************************************/
3473 #rec_long.c:struct derived_rec_long *derived_rec_long_copy_construct( const struct derived_rec_long *this_rec )
3475 #rec_long.c: struct derived_rec_long *copy_rec = (struct derived_rec_long *)gen_list_rec_copy_construct( (struct gen_list_rec *)this_rec );
3476 #rec_long.c: copy_rec->contents = - this_rec->contents;
3478 #rec_long.c: LIST_SHOW( printf( "\
3479 #rec_long.c:\t\tlong copy construct new gen rec\t\t\t\t= %p => %p
3480 #rec_long.c:\t\tlong copy construct new gen rec contents\t= %d\n\n", (const void *)this_rec, (const void *)copy_rec, copy_rec->contents ) );
3482 #rec_long.c: return( copy_rec );
3487 #rec_long.c:/*********************************************************************
3489 #rec_long.c: * Function : derived_rec_long_destruct
3491 #rec_long.c: * Description : Destruct the long record.
3493 #rec_long.c: * Parameters :
3494 #rec_long.c: * 1 : The record.
3496 #rec_long.c: * Returns : NULL
3498 #rec_long.c: *********************************************************************/
3499 #rec_long.c:struct derived_rec_long *derived_rec_long_destruct( struct derived_rec_long *this_rec )
3501 #rec_long.c: LIST_SHOW( printf( "\
3502 #rec_long.c:\t\tlong destruct this_rec\t\t\t\t= %p
3503 #rec_long.c:\t\tlong destruct this_rec->contents\t= %d\n\n", (const void *)this_rec, this_rec->contents ) );
3505 #rec_long.c: this_rec->contents = -1;
3506 #rec_long.c: return( (struct derived_rec_long *)gen_list_rec_destruct( (struct gen_list_rec *)this_rec ) );
3511 #rec_long.c:/*********************************************************************
3513 #rec_long.c: * Function : derived_rec_long_stream
3515 #rec_long.c: * Description : Displays all long attributes on the STDOUT stream.
3517 #rec_long.c: * Parameters :
3518 #rec_long.c: * 1 : The record.
3520 #rec_long.c: * Returns : The record.
3522 #rec_long.c: *********************************************************************/
3523 #rec_long.c:const struct derived_rec_long *derived_rec_long_stream( const struct derived_rec_long *this_rec )
3525 #rec_long.c: this_rec = (struct derived_rec_long *)gen_list_rec_stream(
3526 #rec_long.c: (struct gen_list_rec *)this_rec
3528 #rec_long.c: LIST_SHOW( printf( "\
3529 #rec_long.c:\t\tlong stream this_rec\t\t\t\t\t= %p
3530 #rec_long.c:\t\tlong stream this_rec->contents\t= %d\n\n", (const void *)this_rec, this_rec->contents ) );
3532 #rec_long.c: return( this_rec );
3537 #rec_long.c:/*********************************************************************
3539 #rec_long.c: * Function : derived_rec_long_equal
3541 #rec_long.c: * Description : Compares two long records to see if they are equal.
3543 #rec_long.c: * Parameters :
3544 #rec_long.c: * 1 : A record.
3545 #rec_long.c: * 2 : Another record.
3547 #rec_long.c: * Returns : 0 => NOT EQUAL, anything else is EQUAL.
3549 #rec_long.c: *********************************************************************/
3550 #rec_long.c:int derived_rec_long_equal( const struct derived_rec_long *this_rec, const struct derived_rec_long *eq_rec )
3552 #rec_long.c: if ( ! gen_list_rec_equal( (const struct gen_list_rec *)this_rec, (struct gen_list_rec *)eq_rec ) )
3554 #rec_long.c: return( 0 );
3556 #rec_long.c: return( this_rec->contents == eq_rec->contents );
3561 #rec_long.h:#ifndef REC_LONG_H_INCLUDED
3562 #rec_long.h:#define REC_LONG_H_INCLUDED
3563 #rec_long.h:#define REC_LONG_H_VERSION "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $"
3564 #rec_long.h:/*********************************************************************
3566 #rec_long.h: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
3568 #rec_long.h: * Purpose : A "derived class" of gen_list_rec.
3570 #rec_long.h: * Copyright : Written by and Copyright (C) 2001 the SourceForge
3571 #rec_long.h: * Privoxy team. http://www.privoxy.org/
3573 #rec_long.h: * This program is free software; you can redistribute it
3574 #rec_long.h: * and/or modify it under the terms of the GNU General
3575 #rec_long.h: * Public License as published by the Free Software
3576 #rec_long.h: * Foundation; either version 2 of the License, or (at
3577 #rec_long.h: * your option) any later version.
3579 #rec_long.h: * This program is distributed in the hope that it will
3580 #rec_long.h: * be useful, but WITHOUT ANY WARRANTY; without even the
3581 #rec_long.h: * implied warranty of MERCHANTABILITY or FITNESS FOR A
3582 #rec_long.h: * PARTICULAR PURPOSE. See the GNU General Public
3583 #rec_long.h: * License for more details.
3585 #rec_long.h: * The GNU General Public License should be included with
3586 #rec_long.h: * this file. If not, you can view it at
3587 #rec_long.h: * http://www.gnu.org/copyleft/gpl.html
3588 #rec_long.h: * or write to the Free Software Foundation, Inc., 59
3589 #rec_long.h: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
3591 #rec_long.h: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
3592 #rec_long.h: * and edit IJB, correctly.
3594 #rec_long.h: * Revisions :
3595 #rec_long.h: * $Log: contrib.sh,v $
3596 #rec_long.h: * Revision 1.2 2002/03/24 13:25:43 swa
3597 #rec_long.h: * name change related issues
3599 #rec_long.h: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
3600 #rec_long.h: * A contribution/recomendation to the IJBSWA group for a generic doubly
3601 #rec_long.h: * linked list. This file is a home brew "bash tar" (I cannot create a
3602 #rec_long.h: * contrib directory and I cannot upload a tarball ... it gets
3603 #rec_long.h: * corrupted). This script will expand all files needed to create the
3604 #rec_long.h: * linked list modules and an example program. Please see the README.
3605 #rec_long.h: * Feed back is welcomed. Enjoy.
3608 #rec_long.h: *********************************************************************/
3611 #rec_long.h:#ifdef __cplusplus
3612 #rec_long.h:extern "C" {
3616 #rec_long.h:struct derived_rec_long
3618 #rec_long.h: /* private: */
3619 #rec_long.h: struct gen_list_rec parent_rec;
3620 #rec_long.h: long contents;
3623 #rec_long.h:/* public: */
3624 #rec_long.h:extern struct derived_rec_long * derived_rec_long_construct( const long _contents );
3625 #rec_long.h:extern struct derived_rec_long * derived_rec_long_copy_construct( const struct derived_rec_long *this_rec );
3626 #rec_long.h:extern struct derived_rec_long * derived_rec_long_destruct( struct derived_rec_long *this_rec );
3627 #rec_long.h:extern const struct derived_rec_long *derived_rec_long_stream( const struct derived_rec_long *this_rec );
3628 #rec_long.h:extern int derived_rec_long_equal( const struct derived_rec_long *this_rec, const struct derived_rec_long *eq_rec );
3630 #rec_long.h:/* struct/class COMPLETE */
3633 #rec_long.h:#ifdef __cplusplus
3634 #rec_long.h:} /* extern "C" */
3637 #rec_long.h:#endif /* ndef REC_LONG_H_INCLUDED */
3640 #rec_long.h: Local Variables:
3641 #rec_long.h: tab-width: 3
3646 #rec_malloc_police.c:const char rec_malloc_police_rcs[] = "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $";
3647 #rec_malloc_police.c:/*********************************************************************
3648 #rec_malloc_police.c: *
3649 #rec_malloc_police.c: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
3650 #rec_malloc_police.c: *
3651 #rec_malloc_police.c: * Purpose : A "derived class" of gen_list_rec.
3652 #rec_malloc_police.c: * This class helps to build a list of allocated and
3653 #rec_malloc_police.c: * freed memory. When the program exits, we will print
3654 #rec_malloc_police.c: * a list of all memory that was allocated, but never
3655 #rec_malloc_police.c: * freed. This could be most helpful to developers
3656 #rec_malloc_police.c: * and debugers.
3657 #rec_malloc_police.c: *
3658 #rec_malloc_police.c: * Copyright : Written by and Copyright (C) 2001 the SourceForge
3659 #rec_malloc_police.c: * Privoxy team. http://www.privoxy.org/
3660 #rec_malloc_police.c: *
3661 #rec_malloc_police.c: * This program is free software; you can redistribute it
3662 #rec_malloc_police.c: * and/or modify it under the terms of the GNU General
3663 #rec_malloc_police.c: * Public License as published by the Free Software
3664 #rec_malloc_police.c: * Foundation; either version 2 of the License, or (at
3665 #rec_malloc_police.c: * your option) any later version.
3666 #rec_malloc_police.c: *
3667 #rec_malloc_police.c: * This program is distributed in the hope that it will
3668 #rec_malloc_police.c: * be useful, but WITHOUT ANY WARRANTY; without even the
3669 #rec_malloc_police.c: * implied warranty of MERCHANTABILITY or FITNESS FOR A
3670 #rec_malloc_police.c: * PARTICULAR PURPOSE. See the GNU General Public
3671 #rec_malloc_police.c: * License for more details.
3672 #rec_malloc_police.c: *
3673 #rec_malloc_police.c: * The GNU General Public License should be included with
3674 #rec_malloc_police.c: * this file. If not, you can view it at
3675 #rec_malloc_police.c: * http://www.gnu.org/copyleft/gpl.html
3676 #rec_malloc_police.c: * or write to the Free Software Foundation, Inc., 59
3677 #rec_malloc_police.c: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
3678 #rec_malloc_police.c: *
3679 #rec_malloc_police.c: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
3680 #rec_malloc_police.c: * and edit IJB, correctly.
3681 #rec_malloc_police.c: *
3682 #rec_malloc_police.c: * Revisions :
3683 #rec_malloc_police.c: * $Log: contrib.sh,v $
3684 #rec_malloc_police.c: * Revision 1.2 2002/03/24 13:25:43 swa
3685 #rec_malloc_police.c: * name change related issues
3686 #rec_malloc_police.c: *
3687 #rec_malloc_police.c: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
3688 #rec_malloc_police.c: * A contribution/recomendation to the IJBSWA group for a generic doubly
3689 #rec_malloc_police.c: * linked list. This file is a home brew "bash tar" (I cannot create a
3690 #rec_malloc_police.c: * contrib directory and I cannot upload a tarball ... it gets
3691 #rec_malloc_police.c: * corrupted). This script will expand all files needed to create the
3692 #rec_malloc_police.c: * linked list modules and an example program. Please see the README.
3693 #rec_malloc_police.c: * Feed back is welcomed. Enjoy.
3694 #rec_malloc_police.c: *
3695 #rec_malloc_police.c: *
3696 #rec_malloc_police.c: *********************************************************************/
3697 #rec_malloc_police.c:
\f
3698 #rec_malloc_police.c:
3699 #rec_malloc_police.c:#include <stdio.h>
3700 #rec_malloc_police.c:
3701 #rec_malloc_police.c:#include "gen_list.h"
3702 #rec_malloc_police.c:#include "malloc_police.h"
3703 #rec_malloc_police.c:#include "rec_malloc_police.h"
3704 #rec_malloc_police.c:
3705 #rec_malloc_police.c:const char rec_malloc_police_h_rcs[] = REC_MALLOC_POLICE_H_VERSION;
3706 #rec_malloc_police.c:
3707 #rec_malloc_police.c:
3708 #rec_malloc_police.c:static const rec_method rec_malloc_police_vtable[] =
3709 #rec_malloc_police.c:{
3710 #rec_malloc_police.c: (rec_method)derived_rec_malloc_police_copy_construct,
3711 #rec_malloc_police.c: (rec_method)derived_rec_malloc_police_destruct,
3712 #rec_malloc_police.c: (rec_method)derived_rec_malloc_police_stream,
3713 #rec_malloc_police.c: (rec_method)derived_rec_malloc_police_equal
3714 #rec_malloc_police.c:};
3715 #rec_malloc_police.c:
3716 #rec_malloc_police.c:
3717 #rec_malloc_police.c:/*********************************************************************
3718 #rec_malloc_police.c: *
3719 #rec_malloc_police.c: * Function : derived_rec_malloc_police_construct
3720 #rec_malloc_police.c: *
3721 #rec_malloc_police.c: * Description : A simple derived record class that contains 1 string.
3722 #rec_malloc_police.c: *
3723 #rec_malloc_police.c: * Parameters :
3724 #rec_malloc_police.c: * 1 : The record
3725 #rec_malloc_police.c: * 2 : The string to contain.
3726 #rec_malloc_police.c: *
3727 #rec_malloc_police.c: * Returns : A pointer to the constructed record.
3728 #rec_malloc_police.c: *
3729 #rec_malloc_police.c: *********************************************************************/
3730 #rec_malloc_police.c:struct derived_rec_malloc_police *derived_rec_malloc_police_construct( void *_alloced_addr, char *_source_where, size_t _sz )
3731 #rec_malloc_police.c:{
3732 #rec_malloc_police.c: struct derived_rec_malloc_police *this_rec;
3733 #rec_malloc_police.c: list_is_quiet ++;
3734 #rec_malloc_police.c:
3735 #rec_malloc_police.c: this_rec = (struct derived_rec_malloc_police *)gen_list_rec_construct(
3736 #rec_malloc_police.c: ISA_MALLOC_POLICE,
3737 #rec_malloc_police.c: sizeof( struct derived_rec_malloc_police ),
3738 #rec_malloc_police.c: rec_malloc_police_vtable
3739 #rec_malloc_police.c: );
3740 #rec_malloc_police.c:
3741 #rec_malloc_police.c: this_rec->alloced_addr = _alloced_addr;
3742 #rec_malloc_police.c: this_rec->source_where = STRDUP( _source_where );
3743 #rec_malloc_police.c: this_rec->sz = _sz;
3744 #rec_malloc_police.c:
3745 #rec_malloc_police.c:/* LIST_SHOW( printf( "\ */
3746 #rec_malloc_police.c:/* \t\tmalloc_police construct new rec\t\t\t\t\t= %p */
3747 #rec_malloc_police.c:/* \t\tmalloc_police construct new rec alloced_addr = %p */
3748 #rec_malloc_police.c:/* \t\tmalloc_police construct new rec source_where = %s */
3749 #rec_malloc_police.c:/* \t\tmalloc_police construct new rec sz\t\t\t\t\t= %ld\n\n", */
3750 #rec_malloc_police.c:/* (const void *)this_rec, */
3751 #rec_malloc_police.c:/* this_rec->alloced_addr, */
3752 #rec_malloc_police.c:/* this_rec->source_where, */
3753 #rec_malloc_police.c:/* this_rec->sz */
3754 #rec_malloc_police.c:/* ) ); */
3755 #rec_malloc_police.c:
3756 #rec_malloc_police.c: list_is_quiet --;
3757 #rec_malloc_police.c:
3758 #rec_malloc_police.c: return( this_rec );
3759 #rec_malloc_police.c:
3760 #rec_malloc_police.c:}
3761 #rec_malloc_police.c:
3762 #rec_malloc_police.c:
3763 #rec_malloc_police.c:/*********************************************************************
3764 #rec_malloc_police.c: *
3765 #rec_malloc_police.c: * Function : derived_rec_malloc_police_copy_construct
3766 #rec_malloc_police.c: *
3767 #rec_malloc_police.c: * Description : Copies one malloc_police record to another.
3768 #rec_malloc_police.c: *
3769 #rec_malloc_police.c: * Parameters :
3770 #rec_malloc_police.c: * 1 : Existing record.
3771 #rec_malloc_police.c: * 2 : Copy record.
3772 #rec_malloc_police.c: *
3773 #rec_malloc_police.c: * Returns : The newly constructed copy record.
3774 #rec_malloc_police.c: *
3775 #rec_malloc_police.c: *********************************************************************/
3776 #rec_malloc_police.c:struct derived_rec_malloc_police *derived_rec_malloc_police_copy_construct( const struct derived_rec_malloc_police *this_rec )
3777 #rec_malloc_police.c:{
3778 #rec_malloc_police.c: int len;
3779 #rec_malloc_police.c: char *new_contents;
3780 #rec_malloc_police.c: struct derived_rec_malloc_police *copy_rec;
3781 #rec_malloc_police.c:
3782 #rec_malloc_police.c: list_is_quiet ++;
3783 #rec_malloc_police.c:
3784 #rec_malloc_police.c: copy_rec = (struct derived_rec_malloc_police *)gen_list_rec_copy_construct( (struct gen_list_rec *)this_rec );
3785 #rec_malloc_police.c:
3786 #rec_malloc_police.c: copy_rec->alloced_addr = this_rec->alloced_addr;
3787 #rec_malloc_police.c: copy_rec->source_where = STRDUP( this_rec->source_where );
3788 #rec_malloc_police.c: copy_rec->sz = this_rec->sz;
3789 #rec_malloc_police.c:
3790 #rec_malloc_police.c:/* LIST_SHOW( printf( "\ */
3791 #rec_malloc_police.c:/* \t\tmalloc_police copy construct new gen rec = %p => %p */
3792 #rec_malloc_police.c:/* \t\tmalloc_police copy construct new gen rec alloced_addr = %p */
3793 #rec_malloc_police.c:/* \t\tmalloc_police copy construct new gen rec source_where = %s */
3794 #rec_malloc_police.c:/* \t\tmalloc_police copy construct new gen rec sz\t\t\t\t\t= %ld\n\n", */
3795 #rec_malloc_police.c:/* (const void *)this_rec, (const void *)copy_rec, */
3796 #rec_malloc_police.c:/* copy_rec->alloced_addr, */
3797 #rec_malloc_police.c:/* copy_rec->source_where, */
3798 #rec_malloc_police.c:/* copy_rec->sz */
3799 #rec_malloc_police.c:/* ) ); */
3800 #rec_malloc_police.c:
3801 #rec_malloc_police.c: list_is_quiet --;
3802 #rec_malloc_police.c:
3803 #rec_malloc_police.c: return( copy_rec );
3804 #rec_malloc_police.c:
3805 #rec_malloc_police.c:}
3806 #rec_malloc_police.c:
3807 #rec_malloc_police.c:
3808 #rec_malloc_police.c:/*********************************************************************
3809 #rec_malloc_police.c: *
3810 #rec_malloc_police.c: * Function : derived_rec_malloc_police_destruct
3811 #rec_malloc_police.c: *
3812 #rec_malloc_police.c: * Description : Destruct the malloc_police record.
3813 #rec_malloc_police.c: *
3814 #rec_malloc_police.c: * Parameters :
3815 #rec_malloc_police.c: * 1 : The record.
3816 #rec_malloc_police.c: *
3817 #rec_malloc_police.c: * Returns : NULL
3818 #rec_malloc_police.c: *
3819 #rec_malloc_police.c: *********************************************************************/
3820 #rec_malloc_police.c:struct derived_rec_malloc_police *derived_rec_malloc_police_destruct( struct derived_rec_malloc_police *this_rec )
3821 #rec_malloc_police.c:{
3822 #rec_malloc_police.c: struct derived_rec_malloc_police *d;
3823 #rec_malloc_police.c: list_is_quiet ++;
3824 #rec_malloc_police.c:
3825 #rec_malloc_police.c:/* LIST_SHOW( printf( "\ */
3826 #rec_malloc_police.c:/* \t\tmalloc_police destruct this_rec\t\t\t\t\t\t= %p */
3827 #rec_malloc_police.c:/* \t\tmalloc_police destruct this_rec->alloced_addr\t= %p */
3828 #rec_malloc_police.c:/* \t\tmalloc_police destruct this_rec->source_where\t= %s, */
3829 #rec_malloc_police.c:/* \t\tmalloc_police destruct this_rec->sz\t\t\t\t\t= %ld\n\n", */
3830 #rec_malloc_police.c:/* (const void *)this_rec, */
3831 #rec_malloc_police.c:/* this_rec->alloced_addr, */
3832 #rec_malloc_police.c:/* this_rec->source_where, */
3833 #rec_malloc_police.c:/* this_rec->sz */
3834 #rec_malloc_police.c:/* ) ); */
3835 #rec_malloc_police.c:
3836 #rec_malloc_police.c: memset( this_rec->source_where, '!', strlen( this_rec->source_where ) );
3837 #rec_malloc_police.c: FREE( this_rec->source_where );
3838 #rec_malloc_police.c:
3839 #rec_malloc_police.c: d = (struct derived_rec_malloc_police *)gen_list_rec_destruct( (struct gen_list_rec *)this_rec );
3840 #rec_malloc_police.c: list_is_quiet --;
3841 #rec_malloc_police.c:
3842 #rec_malloc_police.c: return( d );
3843 #rec_malloc_police.c:
3844 #rec_malloc_police.c:}
3845 #rec_malloc_police.c:
3846 #rec_malloc_police.c:
3847 #rec_malloc_police.c:/*********************************************************************
3848 #rec_malloc_police.c: *
3849 #rec_malloc_police.c: * Function : derived_rec_malloc_police_stream
3850 #rec_malloc_police.c: *
3851 #rec_malloc_police.c: * Description : Displays all malloc_police attributes on the STDOUT stream.
3852 #rec_malloc_police.c: *
3853 #rec_malloc_police.c: * Parameters :
3854 #rec_malloc_police.c: * 1 : The record.
3855 #rec_malloc_police.c: *
3856 #rec_malloc_police.c: * Returns : The record.
3857 #rec_malloc_police.c: *
3858 #rec_malloc_police.c: *********************************************************************/
3859 #rec_malloc_police.c:const struct derived_rec_malloc_police *derived_rec_malloc_police_stream( const struct derived_rec_malloc_police *this_rec )
3860 #rec_malloc_police.c:{
3861 #rec_malloc_police.c: list_is_quiet ++;
3862 #rec_malloc_police.c:
3863 #rec_malloc_police.c: this_rec = (struct derived_rec_malloc_police *)gen_list_rec_stream(
3864 #rec_malloc_police.c: (struct gen_list_rec *)this_rec
3865 #rec_malloc_police.c: );
3866 #rec_malloc_police.c: LIST_SHOW( printf( "\
3867 #rec_malloc_police.c:\t\tmalloc_police stream this_rec\t\t\t\t\t= %p
3868 #rec_malloc_police.c:\t\tmalloc_police stream this_rec->alloced_addr\t= %p
3869 #rec_malloc_police.c:\t\tmalloc_police stream this_rec->source_where\t= %s
3870 #rec_malloc_police.c:\t\tmalloc_police stream this_rec->sz\t\t\t\t= %ld\n\n",
3871 #rec_malloc_police.c: (const void *)this_rec,
3872 #rec_malloc_police.c: this_rec->alloced_addr,
3873 #rec_malloc_police.c: this_rec->source_where,
3874 #rec_malloc_police.c: this_rec->sz
3875 #rec_malloc_police.c: ) );
3876 #rec_malloc_police.c:
3877 #rec_malloc_police.c: list_is_quiet --;
3878 #rec_malloc_police.c: return( this_rec );
3879 #rec_malloc_police.c:
3880 #rec_malloc_police.c:}
3881 #rec_malloc_police.c:
3882 #rec_malloc_police.c:
3883 #rec_malloc_police.c:/*********************************************************************
3884 #rec_malloc_police.c: *
3885 #rec_malloc_police.c: * Function : derived_rec_malloc_police_equal
3886 #rec_malloc_police.c: *
3887 #rec_malloc_police.c: * Description : Compares two malloc_police records to see if they are equal.
3888 #rec_malloc_police.c: *
3889 #rec_malloc_police.c: * Parameters :
3890 #rec_malloc_police.c: * 1 : A record.
3891 #rec_malloc_police.c: * 2 : Another record.
3892 #rec_malloc_police.c: *
3893 #rec_malloc_police.c: * Returns : 0 => NOT EQUAL, anything else is EQUAL.
3894 #rec_malloc_police.c: *
3895 #rec_malloc_police.c: *********************************************************************/
3896 #rec_malloc_police.c:int derived_rec_malloc_police_equal( const struct derived_rec_malloc_police *this_rec, const struct derived_rec_malloc_police *eq_rec )
3897 #rec_malloc_police.c:{
3898 #rec_malloc_police.c: list_is_quiet ++;
3899 #rec_malloc_police.c:
3900 #rec_malloc_police.c: if ( ! gen_list_rec_equal( (const struct gen_list_rec *)this_rec, (struct gen_list_rec *)eq_rec ) )
3901 #rec_malloc_police.c: {
3902 #rec_malloc_police.c: return( 0 );
3903 #rec_malloc_police.c: }
3904 #rec_malloc_police.c:
3905 #rec_malloc_police.c: list_is_quiet --;
3906 #rec_malloc_police.c: return( this_rec->alloced_addr == eq_rec->alloced_addr );
3907 #rec_malloc_police.c:
3908 #rec_malloc_police.c:}
3911 #rec_malloc_police.h:#ifndef REC_MALLOC_POLICE_H_INCLUDED
3912 #rec_malloc_police.h:#define REC_MALLOC_POLICE_H_INCLUDED
3913 #rec_malloc_police.h:#define REC_MALLOC_POLICE_H_VERSION "$Id: contrib.sh,v 1.2 2002/03/24 13:25:43 swa Exp $"
3914 #rec_malloc_police.h:/*********************************************************************
3915 #rec_malloc_police.h: *
3916 #rec_malloc_police.h: * File : $Source: /cvsroot/ijbswa/current/contrib.sh,v $
3917 #rec_malloc_police.h: *
3918 #rec_malloc_police.h: * Purpose : A "derived class" of gen_list_rec.
3919 #rec_malloc_police.h: * This class helps to build a list of allocated and
3920 #rec_malloc_police.h: * freed memory. When the program exits, we will print
3921 #rec_malloc_police.h: * a list of all memory that was allocated, but never
3922 #rec_malloc_police.h: * freed. This could be most helpful to developers
3923 #rec_malloc_police.h: * and debugers.
3924 #rec_malloc_police.h: *
3925 #rec_malloc_police.h: * Copyright : Written by and Copyright (C) 2001 the SourceForge
3926 #rec_malloc_police.h: * Privoxy team. http://www.privoxy.org/
3927 #rec_malloc_police.h: *
3928 #rec_malloc_police.h: * This program is free software; you can redistribute it
3929 #rec_malloc_police.h: * and/or modify it under the terms of the GNU General
3930 #rec_malloc_police.h: * Public License as published by the Free Software
3931 #rec_malloc_police.h: * Foundation; either version 2 of the License, or (at
3932 #rec_malloc_police.h: * your option) any later version.
3933 #rec_malloc_police.h: *
3934 #rec_malloc_police.h: * This program is distributed in the hope that it will
3935 #rec_malloc_police.h: * be useful, but WITHOUT ANY WARRANTY; without even the
3936 #rec_malloc_police.h: * implied warranty of MERCHANTABILITY or FITNESS FOR A
3937 #rec_malloc_police.h: * PARTICULAR PURPOSE. See the GNU General Public
3938 #rec_malloc_police.h: * License for more details.
3939 #rec_malloc_police.h: *
3940 #rec_malloc_police.h: * The GNU General Public License should be included with
3941 #rec_malloc_police.h: * this file. If not, you can view it at
3942 #rec_malloc_police.h: * http://www.gnu.org/copyleft/gpl.html
3943 #rec_malloc_police.h: * or write to the Free Software Foundation, Inc., 59
3944 #rec_malloc_police.h: * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
3945 #rec_malloc_police.h: *
3946 #rec_malloc_police.h: * VI users : Please "set tabstop=3 shiftwidth=3" to view this file,
3947 #rec_malloc_police.h: * and edit IJB, correctly.
3948 #rec_malloc_police.h: *
3949 #rec_malloc_police.h: * Revisions :
3950 #rec_malloc_police.h: * $Log: contrib.sh,v $
3951 #rec_malloc_police.h: * Revision 1.2 2002/03/24 13:25:43 swa
3952 #rec_malloc_police.h: * name change related issues
3953 #rec_malloc_police.h: *
3954 #rec_malloc_police.h: * Revision 1.1 2001/12/07 01:54:50 iwanttokeepanon
3955 #rec_malloc_police.h: * A contribution/recomendation to the IJBSWA group for a generic doubly
3956 #rec_malloc_police.h: * linked list. This file is a home brew "bash tar" (I cannot create a
3957 #rec_malloc_police.h: * contrib directory and I cannot upload a tarball ... it gets
3958 #rec_malloc_police.h: * corrupted). This script will expand all files needed to create the
3959 #rec_malloc_police.h: * linked list modules and an example program. Please see the README.
3960 #rec_malloc_police.h: * Feed back is welcomed. Enjoy.
3961 #rec_malloc_police.h: *
3962 #rec_malloc_police.h: *
3963 #rec_malloc_police.h: *********************************************************************/
3964 #rec_malloc_police.h:
\f
3965 #rec_malloc_police.h:
3966 #rec_malloc_police.h:#ifdef __cplusplus
3967 #rec_malloc_police.h:extern "C" {
3968 #rec_malloc_police.h:#endif
3969 #rec_malloc_police.h:
3970 #rec_malloc_police.h:
3971 #rec_malloc_police.h:struct derived_rec_malloc_police
3972 #rec_malloc_police.h:{
3973 #rec_malloc_police.h: /* private: */
3974 #rec_malloc_police.h: struct gen_list_rec parent_rec;
3975 #rec_malloc_police.h: void *alloced_addr;
3976 #rec_malloc_police.h: char *source_where;
3977 #rec_malloc_police.h: size_t sz;
3978 #rec_malloc_police.h:};
3979 #rec_malloc_police.h:
3980 #rec_malloc_police.h:/* public: */
3981 #rec_malloc_police.h:extern struct derived_rec_malloc_police * derived_rec_malloc_police_construct( void *_alloced_addr, char *_source_where, size_t _sz );
3982 #rec_malloc_police.h:extern struct derived_rec_malloc_police * derived_rec_malloc_police_copy_construct( const struct derived_rec_malloc_police *this_rec );
3983 #rec_malloc_police.h:extern struct derived_rec_malloc_police * derived_rec_malloc_police_destruct( struct derived_rec_malloc_police *this_rec );
3984 #rec_malloc_police.h:extern const struct derived_rec_malloc_police *derived_rec_malloc_police_stream( const struct derived_rec_malloc_police *this_rec );
3985 #rec_malloc_police.h:extern int derived_rec_malloc_police_equal( const struct derived_rec_malloc_police *this_rec, const struct derived_rec_malloc_police *eq_rec );
3986 #rec_malloc_police.h:
3987 #rec_malloc_police.h:/* struct/class COMPLETE */
3988 #rec_malloc_police.h:
3989 #rec_malloc_police.h:
3990 #rec_malloc_police.h:#ifdef __cplusplus
3991 #rec_malloc_police.h:} /* extern "C" */
3992 #rec_malloc_police.h:#endif
3993 #rec_malloc_police.h:
3994 #rec_malloc_police.h:
3995 #rec_malloc_police.h:#endif /* ndef REC_MALLOC_POLICE_H_INCLUDED */
3996 #rec_malloc_police.h:
3997 #rec_malloc_police.h:/*
3998 #rec_malloc_police.h: Local Variables:
3999 #rec_malloc_police.h: tab-width: 3
4000 #rec_malloc_police.h: end:
4001 #rec_malloc_police.h:*/
4004 ###########################################################################
4005 ## Description: makeInsertableFile
4006 ## Use this function to make a file suitable for insertion into this
4007 ## script. This file (x), will contain all of the files listed.
4013 ## Return status: (0) - Everything is Okay, anything else is an error
4014 ###########################################################################
4016 function makeInsertableFile {
4020 for i in ${fileList}; do
4021 sed -e "s/^/#${i}:/" ${i} >> x
projects / privoxy.git / blob