ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/arch.C
(Generate patch)

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.72 by root, Wed Apr 2 11:13:51 2008 UTC vs.
Revision 1.97 by root, Sun Nov 8 22:28:10 2009 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 23 */
23 24
24#include <cassert> 25#include <cassert>
25 26
26#include <global.h> 27#include <global.h>
27#include <funcpoint.h>
28#include <loader.h> 28#include <loader.h>
29 29
30#include <tr1/functional> 30#include <tr1/functional>
31#include <tr1/unordered_map> 31#include <tr1/unordered_map>
32 32
33/* The naming of these functions is really poor - they are all
34 * pretty much named '.._arch_...', but they may more may not
35 * return archetypes. Some make the arch_to_object call, and thus
36 * return an object. Perhaps those should be called 'archob' functions
37 * to denote they return an object derived from the archetype.
38 * MSW 2003-04-29
39 */
40
41archetype *loading_arch; // ugly flag to object laoder etc. to suppress/request special processing 33archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
34arch_ptr archetype::empty;
42 35
43// the hashtable 36// the hashtable
44typedef std::tr1::unordered_map 37typedef std::tr1::unordered_map
45 < 38 <
46 const char *, 39 const char *,
… …
48 str_hash, 41 str_hash,
49 str_equal, 42 str_equal,
50 slice_allocator< std::pair<const char *const, arch_ptr> > 43 slice_allocator< std::pair<const char *const, arch_ptr> >
51 > HT; 44 > HT;
52 45
53static HT ht (5000); 46static HT ht (10000);
54archvec archetypes; 47archvec archetypes;
48static unordered_vector<archetype *> allarch;
49static int dirtycnt;
50
51// the vector of other_arch references to be resolved
52static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
53// the vector of loaded but not yet committed archetypes
54static std::vector<archetype *> postponed_arch;
55
56//+GPL
57
58/*
59 * Creates an object. This function is called by get_archetype ()
60 * if it fails to find the appropriate archetype.
61 * Thus get_archetype() will be guaranteed to always return
62 * an object, and never NULL.
63 */
64static object *
65create_singularity (const char *name)
66{
67 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
68
69 if (!strcmp (name, "bug"))
70 abort ();
71
72 object *op = archetype::get (shstr_bug);
73 op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
74
75 return op;
76}
55 77
56/** 78/**
57 * GROS - This function retrieves an archetype given the name that appears 79 * GROS - This function retrieves an archetype given the name that appears
58 * during the game (for example, "writing pen" instead of "stylus"). 80 * during the game (for example, "writing pen" instead of "stylus").
59 * It does not use the hashtable system, but browse the whole archlist each time. 81 * It does not use the hashtable system, but browse the whole archlist each time.
… …
103{ 125{
104 shstr_cmp skill_cmp (skill); 126 shstr_cmp skill_cmp (skill);
105 127
106 for_all_archetypes (at) 128 for_all_archetypes (at)
107 if (at->skill == skill_cmp && (type == -1 || type == at->type)) 129 if (at->skill == skill_cmp && (type == -1 || type == at->type))
108 return arch_to_object (at); 130 return at->instance ();
109 131
110 return 0; 132 return 0;
111} 133}
112 134
113/* similiar to above - this returns the first archetype 135/* similiar to above - this returns the first archetype
… …
134 * - name: The name we're searching for (ex: "writing pen"); 156 * - name: The name we're searching for (ex: "writing pen");
135 * Return value: 157 * Return value:
136 * - a corresponding object if found; a singularity object if not found. 158 * - a corresponding object if found; a singularity object if not found.
137 * Note by MSW - it appears that it takes the full name and keeps 159 * Note by MSW - it appears that it takes the full name and keeps
138 * shortening it until it finds a match. I re-wrote this so that it 160 * shortening it until it finds a match. I re-wrote this so that it
139 * doesn't malloc it each time - not that this function is used much, 161 * doesn't allocate it each time - not that this function is used much,
140 * but it otherwise had a big memory leak. 162 * but it otherwise had a big memory leak.
141 */ 163 */
142object * 164object *
143get_archetype_by_object_name (const char *name) 165get_archetype_by_object_name (const char *name)
144{ 166{
145 char tmpname[MAX_BUF]; 167 char tmpname[MAX_BUF];
146 int i;
147 168
148 assign (tmpname, name); 169 assign (tmpname, name);
149 170
150 for (i = strlen (tmpname); i > 0; i--) 171 for (int i = strlen (tmpname); i > 0; i--)
151 { 172 {
152 tmpname[i] = 0; 173 tmpname[i] = 0;
153 174
154 if (archetype *at = find_archetype_by_object_name (tmpname)) 175 if (archetype *at = find_archetype_by_object_name (tmpname))
155 return arch_to_object (at); 176 return at->instance ();
156 } 177 }
157 178
158 return create_singularity (name); 179 return create_singularity (name);
159} 180}
160 181
… …
194 return 1; 215 return 1;
195 216
196 /* unpaid is a little more specific */ 217 /* unpaid is a little more specific */
197 if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) 218 if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
198 return 2; 219 return 2;
220
199 if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) 221 if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED)))
200 return 2; 222 return 2;
201 223
202 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) 224 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
203 return 2; 225 return 2;
… …
225 * is because of the 'else' handling - we don't want to match on 247 * is because of the 'else' handling - we don't want to match on
226 * something and set a low retval, even though it may match a higher retcal 248 * something and set a low retval, even though it may match a higher retcal
227 * later. So keep it in descending order here, so we try for the best 249 * later. So keep it in descending order here, so we try for the best
228 * match first, and work downward. 250 * match first, and work downward.
229 */ 251 */
252 const char *qbn0, *qbn1, *qsn; // query base name/short name caches
253
230 if (!strcasecmp (cp, query_name (op))) 254 if (!strcasecmp (cp, query_name (op)))
231 retval = 20; 255 retval = 20;
232 else if (!strcasecmp (cp, query_short_name (op))) 256 else if (!strcasecmp (cp, qsn = query_short_name (op)))
233 retval = 18; 257 retval = 18;
234 else if (!strcasecmp (cp, query_base_name (op, 0))) 258 else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
235 retval = 16; 259 retval = 16;
236 else if (!strcasecmp (cp, query_base_name (op, 1))) 260 else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
237 retval = 16; 261 retval = 16;
238 else if (op->custom_name && !strcasecmp (cp, op->custom_name)) 262 else if (op->custom_name && !strcasecmp (cp, op->custom_name))
239 retval = 15; 263 retval = 15;
240 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) 264 else if (!strncasecmp (cp, qbn0, strlen (cp)))
241 retval = 14; 265 retval = 14;
242 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) 266 else if (!strncasecmp (cp, qbn1, strlen (cp)))
243 retval = 14; 267 retval = 14;
244 /* Do substring checks, so things like 'Str+1' will match. 268 /* Do substring checks, so things like 'Str+1' will match.
245 * retval of these should perhaps be lower - they are lower 269 * retval of these should perhaps be lower - they are lower
246 * then the specific strcasecmp aboves, but still higher than 270 * then the specific strcasecmp aboves, but still higher than
247 * some other match criteria. 271 * some other match criteria.
248 */ 272 */
249 else if (strstr (query_base_name (op, 1), cp)) 273 else if (strstr (qbn1, cp))
250 retval = 12; 274 retval = 12;
251 else if (strstr (query_base_name (op, 0), cp)) 275 else if (strstr (qbn0, cp))
252 retval = 12; 276 retval = 12;
253 else if (strstr (query_short_name (op), cp)) 277 else if (strstr (qsn, cp))
254 retval = 12; 278 retval = 12;
255 /* Check against plural/non plural based on count. */ 279 /* Check against plural/non plural based on count. */
256 else if (count > 1 && !strcasecmp (cp, op->name_pl)) 280 else if (count > 1 && !strcasecmp (cp, op->name_pl))
257 retval = 6; 281 retval = 6;
258 else if (count == 1 && !strcasecmp (op->name, cp)) 282 else if (count == 1 && !strcasecmp (op->name, cp))
259 retval = 6; 283 retval = 6;
260 /* base name matched - not bad */ 284 /* base name matched - not bad */
261 else if (strcasecmp (cp, op->name) == 0 && !count) 285 else if (strcasecmp (cp, op->name) == 0 && !count)
262 retval = 4; 286 retval = 4;
263 /* Check for partial custom name, but give a real low priority */ 287 /* Check for partial custom name, but give a real low priority */
264 else if (op->custom_name && strstr (op->custom_name, cp)) 288 else if (op->custom_name.contains (cp))
265 retval = 3; 289 retval = 3;
266 290
267 if (retval) 291 if (retval)
268 { 292 {
269 if (pl->type == PLAYER) 293 if (pl->type == PLAYER)
… …
274 } 298 }
275 299
276 return 0; 300 return 0;
277} 301}
278 302
303//-GPL
304
279archetype::archetype (const char *name) 305archetype::archetype (const char *name)
280{ 306{
281 stub = true;
282 arch = this; 307 arch = this;
283 this->archname = this->name = this->name_pl = name; 308 this->archname = this->name = this->name_pl = name;
284} 309}
285 310
286archetype::~archetype () 311archetype::~archetype ()
… …
289} 314}
290 315
291void 316void
292archetype::link () 317archetype::link ()
293{ 318{
294 ht.insert (std::make_pair (archname, this));
295
296 if (!archetypes.contains (this)) 319 if (!archetypes.contains (this))
320 {
297 archetypes.insert (this); 321 archetypes.insert (this);
322 ht.insert (std::make_pair (archname, this));
323 }
298} 324}
299 325
300void 326void
301archetype::unlink () 327archetype::unlink ()
302{ 328{
303 ht.erase (archname);
304
305 if (archetypes.contains (this)) 329 if (archetypes.contains (this))
330 {
306 archetypes.erase (this); 331 archetypes.erase (this);
332 ht.erase (archname);
333 }
307} 334}
308 335
309/* 336/*
310 * Finds, using the hashtable, which archetype matches the given name. 337 * Finds, using the hashtable, which archetype matches the given name.
311 * returns a pointer to the found archetype, otherwise NULL. 338 * returns a pointer to the found archetype, otherwise NULL.
… …
322 return 0; 349 return 0;
323 else 350 else
324 return i->second; 351 return i->second;
325} 352}
326 353
327archetype * 354void
328archetype::get (const char *name) 355archetype::post_load_check ()
329{ 356{
330 if (!name) 357 object::post_load_check ();
331 {
332 LOG (llevError, "null archetype requested\n");
333 name = "(null)";
334 }
335 358
336 if (loading_arch && !strcmp (&loading_arch->archname, name)) 359 assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL]));
337 return loading_arch;
338
339 archetype *at = find (name);
340
341 if (!at)
342 {
343 at = new archetype (name);
344 at->link ();
345 }
346
347 return at;
348} 360}
349 361
350archetype * 362archetype *
351archetype::read (object_thawer &f) 363archetype::read (object_thawer &f)
352{ 364{
… …
356 368
357 coroapi::cede_to_tick (); 369 coroapi::cede_to_tick ();
358 370
359 for (;;) 371 for (;;)
360 { 372 {
361 // the archetype might have been referenced earlier
362 // so try to find an existing stub archetype first
363 archetype *at = find (f.get_str ()); 373 archetype *at = new archetype (f.get_str ());
364
365 if (!at || !at->stub)
366 at = new archetype (f.get_str ());
367 374
368 f.next (); 375 f.next ();
369 376
370#if 0 377#if 0
371 // implementing it here in the server does neither allow multiple inheritence 378 // implementing it here in the server does neither allow multiple inheritence
… …
434 &new_part->archname, &((archetype *)old_part->head_ ())->archname); 441 &new_part->archname, &((archetype *)old_part->head_ ())->archname);
435 goto fail; 442 goto fail;
436 } 443 }
437 } 444 }
438 445
439 // deactivate existing archetype
440 for (archetype *at = old_head; at; at = (archetype *)at->more)
441 at->unlink ();
442
443 // assemble new chain 446 // assemble new chain
444 new_head->min_x = new_head->max_x = new_head->x; 447 new_head->min_x = new_head->max_x = new_head->x;
445 new_head->min_y = new_head->max_y = new_head->y; 448 new_head->min_y = new_head->max_y = new_head->y;
446 449
447 archetype *less = new_head; 450 archetype *less = new_head;
448 for (auto (p, parts.begin () + 1); p != parts.end (); ++p) 451 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
449 { 452 {
450 archetype *at = *p; 453 archetype *at = *p;
451 454
452 // some flags get inherited formt he head (probably a lot more) 455 // some flags get inherited from the head (probably a lot more)
453 // doing it here doesn't feel too cozy, but it allows code 456 // doing it here doesn't feel too cozy, but it allows code
454 // to ignore head checks for these flags, which saves time 457 // to ignore head checks for these flags, which saves time
455 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; 458 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
456 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; 459 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
457 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; 460 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
458 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; 461 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
459 462
460 if (at->x < new_head->min_x) new_head->min_x = at->x; 463 new_head->min_x = min (new_head->min_x, at->x);
461 if (at->y < new_head->min_y) new_head->min_y = at->y; 464 new_head->min_y = min (new_head->min_y, at->y);
462 if (at->x > new_head->max_x) new_head->max_x = at->x; 465 new_head->max_x = max (new_head->max_x, at->x);
463 if (at->y > new_head->max_y) new_head->max_y = at->y; 466 new_head->max_y = max (new_head->max_y, at->y);
464 467
465 at->head = new_head; 468 at->head = new_head;
466 less->more = at; 469 less->more = at;
467 less = at; 470 less = at;
468 } 471 }
469 472
470 // now activate it 473 postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
471 for (auto (p, parts.begin ()); p != parts.end (); ++p)
472 {
473 archetype *at = *p;
474 at->stub = false;
475 at->link ();
476 }
477 474
478 return new_head; 475 return new_head;
479 } 476 }
480 477
481fail: 478fail:
482 for (auto (p, parts.begin ()); p != parts.end (); ++p) 479 for (auto (p, parts.begin ()); p != parts.end (); ++p)
483 (*p)->destroy (true); 480 (*p)->destroy ();
484 481
485 return 0; 482 return 0;
486} 483}
487 484
488/*
489 * Initialize global archtype pointers:
490 */
491void 485void
492init_archetype_pointers () 486archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
493{ 487{
494 ring_arch = archetype::find ("ring"); 488 ref = 0;
495 amulet_arch = archetype::find ("amulet"); 489 postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
496 staff_arch = archetype::find ("staff");
497 crown_arch = archetype::find ("crown");
498 empty_archetype = archetype::find ("empty_archetype");
499} 490}
500 491
501/* 492void
502 * Creates and returns a new object which is a copy of the given archetype. 493archetype::commit_load ()
503 * This function returns NULL on failure.
504 */
505object *
506arch_to_object (archetype *at)
507{ 494{
495 // unlink old archetypes and link in new ones */
496 for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
497 {
498 archetype *at = *p;
499
500 if (archetype *old = find (at->archname))
501 old->unlink ();
502
503 allarch.push_back (at);
504
505 at->link ();
506 ++dirtycnt;
507 }
508
509 postponed_arch.clear ();
510
511 // now resolve arch references
512 for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
513 {
514 arch_ptr *ap = p->first;
515 archetype *at = find (p->second);
516
508 if (!at) 517 if (!at)
518 LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
519
520 *ap = at;
509 { 521 }
510 LOG (llevError, "Couldn't find archetype.\n"); 522
523 postponed_arch_ref.clear ();
524
525 empty = find (shstr_empty_archetype);
526}
527
528void
529archetype::gc ()
530{
531 int cnt = max (1, min (allarch.size () / 128, dirtycnt));
532 dirtycnt = max (0, dirtycnt - cnt);
533
534 do
535 {
536 static int idx;
537
538 if (idx >= allarch.size ())
539 if (idx)
540 idx = 0;
541 else
511 return 0; 542 return;
512 }
513 543
514 object *op = at->clone (); 544 archetype *at = allarch [idx];
515 op->arch = at;
516 op->instantiate ();
517 545
518 return op; 546 if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
547 ++idx;
548 else
549 {
550 LOG (llevDebug, "garbage collect arch %s", &at->archname);
551 assert (at->arch == at); // verify that refcnt == 1 is truly valid
552 allarch.erase (idx);
553
554 // break chain
555 for (object *op = at->head_ (); op; )
556 {
557 object *next = op->more;
558 op->head = 0;
559 op->more = 0;
560 op = next;
561 }
562
563 at->destroy ();
564 at->arch = 0;
565 }
566 }
567 while (--cnt);
519} 568}
520 569
521object * 570object *
522archetype::instance () 571archetype::instance ()
523{ 572{
524 return arch_to_object (this); 573 object *op = clone ();
525} 574 op->instantiate ();
526
527/*
528 * Creates an object. This function is called by get_archetype()
529 * if it fails to find the appropriate archetype.
530 * Thus get_archetype() will be guaranteed to always return
531 * an object, and never NULL.
532 */
533object *
534create_singularity (const char *name)
535{
536 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
537
538 if (!strcmp (name, "bug"))
539 abort ();
540
541 char buf[MAX_BUF];
542 sprintf (buf, "bug, please report (%s)", name);
543
544 object *op = get_archetype ("bug");
545 op->name = op->name_pl = buf;
546
547 return op; 575 return op;
548} 576}
577
578//+GPL
549 579
550/* 580/*
551 * Finds which archetype matches the given name, and returns a new 581 * Finds which archetype matches the given name, and returns a new
552 * object containing a copy of the archetype. 582 * object containing a copy of the archetype.
553 */ 583 */
554object * 584object *
555get_archetype (const char *name) 585get_archetype (const char *name)
556{ 586{
587 return archetype::get (name);
588}
589
590object *
591archetype::get (const char *name)
592{
557 archetype *at = archetype::find (name); 593 archetype *at = find (name);
558 594
559 if (!at) 595 if (!at)
560 return create_singularity (name); 596 return create_singularity (name);
561 597
562 return arch_to_object (at); 598 return at->instance ();
563} 599}
564 600
565/* 601/*
566 * Returns the first archetype using the given type. 602 * Returns the first archetype using the given type.
567 * Used in treasure-generation. 603 * Used in treasure-generation.
568 */ 604 */
569archetype * 605static archetype *
570type_to_archetype (int type) 606type_to_archetype (int type)
571{ 607{
572 for_all_archetypes (at) 608 for_all_archetypes (at)
573 if (at->type == type && at->head_ () != at) 609 if (at->type == type && at->head_ () != at)
574 return at; 610 return at;
… …
582 * Used in treasure-generation. 618 * Used in treasure-generation.
583 */ 619 */
584object * 620object *
585clone_arch (int type) 621clone_arch (int type)
586{ 622{
587 archetype *at; 623 archetype *at = type_to_archetype (type);
588 624
589 if ((at = type_to_archetype (type)) == NULL) 625 if (!at)
590 { 626 {
591 LOG (llevError, "Can't clone archetype %d\n", type); 627 LOG (llevError, "Can't clone archetype %d\n", type);
592 return 0; 628 return 0;
593 } 629 }
594 630
595 object *op = at->clone (); 631 return at->instance ();
596 op->instantiate ();
597 return op;
598} 632}
599 633
600/* 634/*
601 * member: make instance from class 635 * member: make instance from class
602 */ 636 */
… …
605{ 639{
606 object *op, *prev = 0, *head = 0; 640 object *op, *prev = 0, *head = 0;
607 641
608 while (at) 642 while (at)
609 { 643 {
610 op = arch_to_object (at); 644 op = at->instance ();
611 645
612 op->x = at->x; 646 op->x = at->x;
613 op->y = at->y; 647 op->y = at->y;
614 648
615 if (head) 649 if (head)
… …
623 } 657 }
624 658
625 return head; 659 return head;
626} 660}
627 661
662//-GPL
663

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines