diff options
Diffstat (limited to 'vcl/source/fontsubset/list.c')
-rw-r--r-- | vcl/source/fontsubset/list.c | 541 |
1 files changed, 541 insertions, 0 deletions
diff --git a/vcl/source/fontsubset/list.c b/vcl/source/fontsubset/list.c new file mode 100644 index 000000000000..86864650db85 --- /dev/null +++ b/vcl/source/fontsubset/list.c @@ -0,0 +1,541 @@ +/************************************************************************* + * + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. + * + * Copyright 2008 by Sun Microsystems, Inc. + * + * OpenOffice.org - a multi-platform office productivity suite + * + * This file is part of OpenOffice.org. + * + * OpenOffice.org is free software: you can redistribute it and/or modify + * it under the terms of the GNU Lesser General Public License version 3 + * only, as published by the Free Software Foundation. + * + * OpenOffice.org is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU Lesser General Public License version 3 for more details + * (a copy is included in the LICENSE file that accompanied this code). + * + * You should have received a copy of the GNU Lesser General Public License + * version 3 along with OpenOffice.org. If not, see + * <http://www.openoffice.org/license.html> + * for a copy of the LGPLv3 License. + * + ************************************************************************/ + +/*[]---------------------------------------------------[]*/ +/*| |*/ +/*| list.c - bidirectional list class |*/ +/*| |*/ +/*| |*/ +/*| Author: Alexander Gelfenbain |*/ +/*[]---------------------------------------------------[]*/ + +#include <stdlib.h> + +#if OSL_DEBUG_LEVEL == 0 +# ifndef NDEBUG +# define NDEBUG +# endif +#endif + +#include <assert.h> + +#ifdef MALLOC_TRACE +#include <stdio.h> +#include </usr/local/include/malloc.h> +#endif +/* #define TEST */ +#include "list.h" + +/*- private data types */ +typedef struct _lnode { + struct _lnode *next; + struct _lnode *prev; + + void *value; + +} lnode; + +struct _list { + lnode *head, *tail, *cptr; + size_t aCount; + list_destructor eDtor; +}; + +/*- private methods */ + +static lnode *newNode(void *el) +{ + lnode *ptr = malloc(sizeof(lnode)); + assert(ptr != 0); + + ptr->value = el; + + return ptr; +} + +static lnode *appendPrim(list this, void *el) +{ + lnode *ptr = newNode(el); + lnode **flink, *blink; + + if (this->tail != 0) { + flink = &(this->tail->next); + blink = this->tail; + } else { + flink = &this->head; + blink = 0; + this->cptr = ptr; /*- list was empty - set current to this element */ + } + + *flink = ptr; + this->tail = ptr; + + ptr->prev = blink; + ptr->next = 0; + + this->aCount++; + return ptr; +} +#ifdef TEST +static lnode *prependPrim(list this, void *el) +{ + lnode *ptr = newNode(el); + lnode *flink, **blink; + + if (this->head != 0) { + blink = &(this->head->prev); + flink = this->head; + } else { + blink = &this->tail; + flink = 0; + this->cptr = ptr; /*- list was empty - set current to this element */ + } + + *blink = ptr; + this->head = ptr; + + ptr->next = flink; + ptr->prev = 0; + + this->aCount++; + return ptr; +} +#endif + +/*- public methods */ +list listNewEmpty(void) /*- default ctor */ +{ + list this = malloc(sizeof(struct _list)); + assert(this != 0); + + this->aCount = 0; + this->eDtor = 0; + this->head = this->tail = this->cptr = 0; + + return this; +} + +#ifdef TEST +list listNewCopy(list l) /*- copy ctor */ +{ + lnode *ptr, *c; + list this; + assert(l != 0); + + this = malloc(sizeof(struct _list)); + assert(this != 0); + + ptr = l->head; + + this->aCount = 0; + this->eDtor = 0; + this->head = this->tail = this->cptr = 0; + + while (ptr) { + c = appendPrim(this, ptr->value); + if (ptr == l->cptr) this->cptr = c; + ptr = ptr->next; + } + + return this; +} +#endif + +void listDispose(list this) /*- dtor */ +{ + assert(this != 0); + listClear(this); + free(this); +} + +void listSetElementDtor(list this, list_destructor f) +{ + assert(this != 0); + this->eDtor = f; +} + +/* calling this function on an empty list is a run-time error */ +void *listCurrent(list this) +{ + assert(this != 0); + assert(this->cptr != 0); + return this->cptr->value; +} + +int listCount(list this) +{ + assert(this != 0); + return this->aCount; +} + +int listIsEmpty(list this) +{ + assert(this != 0); + return this->aCount == 0; +} + + +#ifdef TEST +int listAtFirst(list this) +{ + assert(this != 0); + return this->cptr == this->head; +} + +int listAtLast(list this) +{ + assert(this != 0); + return this->cptr == this->tail; +} + +int listPosition(list this) +{ + int res = 0; + lnode *ptr; + assert(this != 0); + + ptr = this->head; + + while (ptr != this->cptr) { + ptr = ptr->next; + res++; + } + + return res; +} +#endif +int listFind(list this, void *el) +{ + lnode *ptr; + assert(this != 0); + + ptr = this->head; + + while (ptr) { + if (ptr->value == el) { + this->cptr = ptr; + return 1; + } + ptr = ptr->next; + } + + return 0; +} + +int listNext(list this) +{ + return listSkipForward(this, 1); +} + +int listSkipForward(list this, int n) +{ + int m = 0; + assert(this != 0); + + if (this->cptr == 0) return 0; + + while (n != 0) { + if (this->cptr->next == 0) break; + this->cptr = this->cptr->next; + n--; + m++; + } + return m; +} + +int listToFirst(list this) +{ + assert(this != 0); + + if (this->cptr != this->head) { + this->cptr = this->head; + return 1; + } + return 0; +} + +int listToLast(list this) +{ + assert(this != 0); + + if (this->cptr != this->tail) { + this->cptr = this->tail; + return 1; + } + return 0; +} + +int listPositionAt(list this, int n) /*- returns the actual position number */ +{ + int m = 0; + assert(this != 0); + + this->cptr = this->head; + while (n != 0) { + if (this->cptr->next == 0) break; + this->cptr = this->cptr->next; + n--; + m++; + } + return m; +} + +list listAppend(list this, void *el) +{ + assert(this != 0); + + appendPrim(this, el); + return this; +} +#ifdef TEST +list listPrepend(list this, void *el) +{ + assert(this != 0); + + prependPrim(this, el); + return this; +} + +list listInsertAfter(list this, void *el) +{ + lnode *ptr; + assert(this != 0); + + if (this->cptr == 0) return listAppend(this, el); + + ptr = newNode(el); + + ptr->prev = this->cptr; + ptr->next = this->cptr->next; + this->cptr->next = ptr; + + if (ptr->next != 0) { + ptr->next->prev = ptr; + } else { + this->tail = ptr; + } + this->aCount++; + return this; +} + +list listInsertBefore(list this, void *el) +{ + lnode *ptr; + assert(this != 0); + + if (this->cptr == 0) return listAppend(this, el); + + ptr = newNode(el); + + ptr->prev = this->cptr->prev; + ptr->next = this->cptr; + this->cptr->prev = ptr; + + if (ptr->prev != 0) { + ptr->prev->next = ptr; + } else { + this->head = ptr; + } + this->aCount++; + return this; +} +#endif +list listRemove(list this) +{ + lnode *ptr = 0; + if (this->cptr == 0) return this; + + if (this->cptr->next != 0) { + ptr = this->cptr->next; + this->cptr->next->prev = this->cptr->prev; + } else { + this->tail = this->cptr->prev; + } + + if (this->cptr->prev != 0) { + if (ptr == 0) ptr = this->cptr->prev; + this->cptr->prev->next = this->cptr->next; + } else { + this->head = this->cptr->next; + } + + if (this->eDtor) this->eDtor(this->cptr->value); /* call the dtor callback */ + + free(this->cptr); + this->aCount--; + this->cptr = ptr; + return this; +} + +list listClear(list this) +{ + lnode *node = this->head, *ptr; + + while (node) { + ptr = node->next; + if (this->eDtor) this->eDtor(node->value); /* call the dtor callback */ + free(node); + this->aCount--; + node = ptr; + } + + this->head = this->tail = this->cptr = 0; + assert(this->aCount == 0); + return this; +} + +#ifdef TEST + +void listForAll(list this, void (*f)(void *)) +{ + lnode *ptr = this->head; + while (ptr) { + f(ptr->value); + ptr = ptr->next; + } +} + + +#include <stdio.h> + +void printlist(list l) +{ + int saved; + assert(l != 0); + saved = listPosition(l); + + printf("[ "); + + if (!listIsEmpty(l)) { + listToFirst(l); + do { + printf("%d ", (int) listCurrent(l)); + } while (listNext(l)); + } + + printf("]\n"); + + listPositionAt(l, saved); +} + +void printstringlist(list l) +{ + int saved; + assert(l != 0); + saved = listPosition(l); + + printf("[ "); + + if (!listIsEmpty(l)) { + listToFirst(l); + do { + printf("'%s' ", (char *) listCurrent(l)); + } while (listNext(l)); + } + + printf("]\n"); + + listPositionAt(l, saved); +} + +void printstat(list l) +{ + printf("count: %d, position: %d, isEmpty: %d, atFirst: %d, atLast: %d.\n", + listCount(l), listPosition(l), listIsEmpty(l), listAtFirst(l), listAtLast(l)); +} + +void allfunc(void *e) +{ + printf("%d ", e); +} + +void edtor(void *ptr) +{ + printf("element dtor: 0x%08x\n", ptr); + free(ptr); +} + +int main() +{ + list l1, l2; + char *ptr; + int i; + +#ifdef MALLOC_TRACE + mal_leaktrace(1); + mal_debug(2); +#endif + + l1 = listNewEmpty(); + printstat(l1); + + listAppend(l1, 1); + printstat(l1); + + listAppend(l1, 2); + printstat(l1); + + listAppend(l1, 3); + printstat(l1); + + printlist(l1); + + listToFirst(l1); + listInsertBefore(l1, -5); + printlist(l1); + + l2 = listNewCopy(l1); + printlist(l2); + + listForAll(l2, allfunc); + printf("\n"); + + listClear(l1); + listSetElementDtor(l1, edtor); + + for(i=0; i<10; i++) { + ptr = malloc(20); + snprintf(ptr, 20, "element # %d", i); + listAppend(l1, ptr); + } + + printstringlist(l1); + + + listDispose(l1); + listDispose(l2); + +#ifdef MALLOC_TRACE + mal_dumpleaktrace(stdout); +#endif + + + return 0; +} +#endif + + |