|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1983 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution and use in source and binary forms are permitted ! 6: * provided that: (1) source distributions retain this entire copyright ! 7: * notice and comment, and (2) distributions including binaries display ! 8: * the following acknowledgement: ``This product includes software ! 9: * developed by the University of California, Berkeley and its contributors'' ! 10: * in the documentation or other materials provided with the distribution ! 11: * and in all advertising materials mentioning features or use of this ! 12: * software. Neither the name of the University nor the names of its ! 13: * contributors may be used to endorse or promote products derived ! 14: * from this software without specific prior written permission. ! 15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 16: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 18: */ ! 19: ! 20: #ifndef lint ! 21: static char sccsid[] = "@(#)dr_4.c 5.4 (Berkeley) 6/1/90"; ! 22: #endif /* not lint */ ! 23: ! 24: #include "externs.h" ! 25: ! 26: ungrap(from, to) ! 27: register struct ship *from, *to; ! 28: { ! 29: register k; ! 30: char friend; ! 31: ! 32: if ((k = grappled2(from, to)) == 0) ! 33: return; ! 34: friend = capship(from)->nationality == capship(to)->nationality; ! 35: while (--k >= 0) { ! 36: if (friend || die() < 3) { ! 37: cleangrapple(from, to, 0); ! 38: makesignal(from, "ungrappling %s (%c%c)", to); ! 39: } ! 40: } ! 41: } ! 42: ! 43: grap(from, to) ! 44: register struct ship *from, *to; ! 45: { ! 46: if (capship(from)->nationality != capship(to)->nationality && die() > 2) ! 47: return; ! 48: Write(W_GRAP, from, 0, to->file->index, 0, 0, 0); ! 49: Write(W_GRAP, to, 0, from->file->index, 0, 0, 0); ! 50: makesignal(from, "grappled with %s (%c%c)", to); ! 51: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.