| /* xdelta 3 - delta compression tools and library |
| * Copyright (C) 2002, 2006, 2007. Joshua P. MacDonald |
| * |
| * This program is free software; you can redistribute it and/or modify |
| * it under the terms of the GNU General Public License as published by |
| * the Free Software Foundation; either version 2 of the License, or |
| * (at your option) any later version. |
| * |
| * This program 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 General Public License for more details. |
| * |
| * You should have received a copy of the GNU General Public License |
| * along with this program; if not, write to the Free Software |
| * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
| */ |
| |
| #ifndef __XDELTA3_LIST__ |
| #define __XDELTA3_LIST__ |
| |
| #define XD3_MAKELIST(LTYPE,ETYPE,LNAME) \ |
| \ |
| static inline ETYPE* \ |
| LTYPE ## _entry (LTYPE* l) \ |
| { \ |
| return (ETYPE*) ((char*) l - (ptrdiff_t) &((ETYPE*) 0)->LNAME); \ |
| } \ |
| \ |
| static inline void \ |
| LTYPE ## _init (LTYPE *l) \ |
| { \ |
| l->next = l; \ |
| l->prev = l; \ |
| } \ |
| \ |
| static inline void \ |
| LTYPE ## _add (LTYPE *prev, LTYPE *next, LTYPE *ins) \ |
| { \ |
| next->prev = ins; \ |
| prev->next = ins; \ |
| ins->next = next; \ |
| ins->prev = prev; \ |
| } \ |
| \ |
| static inline void \ |
| LTYPE ## _push_back (LTYPE *l, ETYPE *i) \ |
| { \ |
| LTYPE ## _add (l->prev, l, & i->LNAME); \ |
| } \ |
| \ |
| static inline void \ |
| LTYPE ## _del (LTYPE *next, \ |
| LTYPE *prev) \ |
| { \ |
| next->prev = prev; \ |
| prev->next = next; \ |
| } \ |
| \ |
| static inline ETYPE* \ |
| LTYPE ## _remove (ETYPE *f) \ |
| { \ |
| LTYPE *i = f->LNAME.next; \ |
| LTYPE ## _del (f->LNAME.next, f->LNAME.prev); \ |
| return LTYPE ## _entry (i); \ |
| } \ |
| \ |
| static inline ETYPE* \ |
| LTYPE ## _pop_back (LTYPE *l) \ |
| { \ |
| LTYPE *i = l->prev; \ |
| LTYPE ## _del (i->next, i->prev); \ |
| return LTYPE ## _entry (i); \ |
| } \ |
| \ |
| static inline ETYPE* \ |
| LTYPE ## _pop_front (LTYPE *l) \ |
| { \ |
| LTYPE *i = l->next; \ |
| LTYPE ## _del (i->next, i->prev); \ |
| return LTYPE ## _entry (i); \ |
| } \ |
| \ |
| static inline int \ |
| LTYPE ## _empty (LTYPE *l) \ |
| { \ |
| return l == l->next; \ |
| } \ |
| \ |
| static inline ETYPE* \ |
| LTYPE ## _front (LTYPE *f) \ |
| { \ |
| return LTYPE ## _entry (f->next); \ |
| } \ |
| \ |
| static inline ETYPE* \ |
| LTYPE ## _back (LTYPE *f) \ |
| { \ |
| return LTYPE ## _entry (f->prev); \ |
| } \ |
| \ |
| static inline int \ |
| LTYPE ## _end (LTYPE *f, ETYPE *i) \ |
| { \ |
| return f == & i->LNAME; \ |
| } \ |
| \ |
| static inline ETYPE* \ |
| LTYPE ## _next (ETYPE *f) \ |
| { \ |
| return LTYPE ## _entry (f->LNAME.next); \ |
| } \ |
| \ |
| static inline usize_t \ |
| LTYPE ## _length (LTYPE *l) \ |
| { \ |
| LTYPE *p; \ |
| int c = 0; \ |
| \ |
| for (p = l->next; p != l; p = p->next) \ |
| { \ |
| c += 1; \ |
| } \ |
| \ |
| return c; \ |
| } \ |
| \ |
| typedef int unused_ ## LTYPE |
| |
| #endif |