| version 1.4 | | version 1.5 |
|---|
| | |
| /* | | /* |
| * static char *rcsid_friend_c = | | * static char *rcsid_friend_c = |
| * "$Id: friend.c,v 1.4 2000/12/04 00:40:03 cvs Exp $"; | | * "$Id: friend.c,v 1.5 2001/01/15 22:33:32 cvs Exp $"; |
| */ | | */ |
| | | |
| /* | | /* |
| CrossFire, A Multiplayer game for X-windows | | CrossFire, A Multiplayer game for X-windows |
| | | |
| | | Copyright (C) 2001 Mark Wedel |
| Copyright (C) 1992 Frank Tore Johansen | | Copyright (C) 1992 Frank Tore Johansen |
| | | |
| This program is free software; you can redistribute it and/or modify | | This program is free software; you can redistribute it and/or modify |
| | |
| along with this program; if not, write to the Free Software | | along with this program; if not, write to the Free Software |
| Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
| | | |
| The author can be reached via e-mail to frankj@ifi.uio.no. | | The author can be reached via e-mail to mwedel@scruz.net |
| */ | | */ |
| | | |
| #include <global.h> | | #include <global.h> |
| | |
| */ | | */ |
| | | |
| void add_friendly_object(object *op) { | | void add_friendly_object(object *op) { |
| objectlink *ol=first_friendly_object; | | objectlink *ol; |
| | | |
| | | /* Add some error checking. This shouldn't happen, but the friendly |
| | | * object list usually isn't very long, and remove_friendly_object |
| | | * won't remove it either. Plus, it is easier to put a breakpoint in |
| | | * the debugger here and see where the problem is happening. |
| | | */ |
| | | for (ol=first_friendly_object; ol!=NULL; ol=ol->next) { |
| | | if (ol->ob == op) { |
| | | LOG(llevError, "add_friendly_object: Trying to add object already on list (%s)\n", |
| | | op->name); |
| | | return; |
| | | } |
| | | } |
| | | |
| | | ol=first_friendly_object; |
| first_friendly_object=get_objectlink(); | | first_friendly_object=get_objectlink(); |
| first_friendly_object->ob = op; | | first_friendly_object->ob = op; |
| first_friendly_object->id = op->count; | | first_friendly_object->id = op->count; |
| | |
| | | |
| void remove_friendly_object(object *op) { | | void remove_friendly_object(object *op) { |
| objectlink *this; | | objectlink *this; |
| | | |
| CLEAR_FLAG(op,FLAG_FRIENDLY); | | CLEAR_FLAG(op,FLAG_FRIENDLY); |
| if(first_friendly_object->ob!=op) { | | |
| objectlink *prev=first_friendly_object; | | if (!first_friendly_object) { |
| while(prev!=NULL&&prev->next!=NULL&& | | LOG(llevError,"remove_friendly_object called with empty friendly list, remove ob=%s\n", op->name); |
| (prev->next->ob!=op || prev->next->id != op->count)) | | |
| prev=prev->next; | | |
| if(prev==NULL||prev->next==NULL|| | | |
| prev->next->ob!=op||prev->next->id!=op->count) { | | |
| LOG(llevError,"Remove_friendly_object: Can't find object %s (%d).\n", | | |
| op->name?op->name:op->arch->name,op->count); | | |
| return; | | return; |
| } | | } |
| this=prev->next; | | /* if the first object happens to be the one, processing is pretty |
| prev->next=this->next; | | * easy. |
| } else { | | */ |
| | | if(first_friendly_object->ob==op) { |
| this=first_friendly_object; | | this=first_friendly_object; |
| first_friendly_object=this->next; | | first_friendly_object=this->next; |
| | | free(this); |
| | | } else { |
| | | objectlink *prev=first_friendly_object; |
| | | |
| | | for (this=first_friendly_object->next; this!=NULL; this=this->next) { |
| | | if (this->ob == op) break; |
| | | prev=this; |
| | | } |
| | | if (this) { |
| | | /* This should not happen. But if it does, presumably the |
| | | * call to remove it is still valid. |
| | | */ |
| | | if (this->id != op->count) { |
| | | LOG(llevError,"remove_friendly_object, tags do no match, %s, %d != %d\n", |
| | | op->name?op->name:"none", op->count, this->id); |
| | | } |
| | | prev->next = this->next; |
| | | free(this); |
| | | } |
| } | | } |
| CFREE(this); | | |
| } | | } |
| | | |
| /* | | /* |
| | |
| | | |
| void dump_friendly_objects() { | | void dump_friendly_objects() { |
| objectlink *ol; | | objectlink *ol; |
| | | |
| for(ol=first_friendly_object;ol!=NULL;ol=ol->next) | | for(ol=first_friendly_object;ol!=NULL;ol=ol->next) |
| LOG(llevError, "%s (%d)\n",ol->ob->name,ol->ob->count); | | LOG(llevError, "%s (%d)\n",ol->ob->name,ol->ob->count); |
| } | | } |
| | | |
| | | /* New function, MSW 2000-1-14 |
| | | * It traverses the friendly list removing objects that should not be here |
| | | * (ie, do not have friendly flag set, freed, etc) |
| | | */ |
| | | void clean_friendly_list() { |
| | | objectlink *this, *prev=NULL, *next; |
| | | int count=0; |
| | | |
| | | for (this=first_friendly_object; this!=NULL; this=next) { |
| | | next=this->next; |
| | | if (QUERY_FLAG(this->ob, FLAG_FREED) || |
| | | !QUERY_FLAG(this->ob, FLAG_FRIENDLY) || |
| | | (this->id != this->ob->count)) { |
| | | if (prev) { |
| | | prev->next = this->next; |
| | | } |
| | | else { |
| | | first_friendly_object = this->next; |
| | | } |
| | | count++; |
| | | free(this); |
| | | } |
| | | /* If we removed the object, then prev is still valid. */ |
| | | else prev=this; |
| | | } |
| | | if (count) |
| | | LOG(llevDebug,"clean_friendly_list: Removed %d bogus links\n", count); |
| | | } |
| | | |