Annotation of micropolis/src/sim/headers/macros.h, revision 1.1.1.1

1.1       root        1: /* macros.h
                      2:  *
                      3:  * Micropolis, Unix Version.  This game was released for the Unix platform
                      4:  * in or about 1990 and has been modified for inclusion in the One Laptop
                      5:  * Per Child program.  Copyright (C) 1989 - 2007 Electronic Arts Inc.  If
                      6:  * you need assistance with this program, you may contact:
                      7:  *   http://wiki.laptop.org/go/Micropolis  or email  [email protected].
                      8:  * 
                      9:  * This program is free software: you can redistribute it and/or modify
                     10:  * it under the terms of the GNU General Public License as published by
                     11:  * the Free Software Foundation, either version 3 of the License, or (at
                     12:  * your option) any later version.
                     13:  * 
                     14:  * This program is distributed in the hope that it will be useful, but
                     15:  * WITHOUT ANY WARRANTY; without even the implied warranty of
                     16:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
                     17:  * General Public License for more details.  You should have received a
                     18:  * copy of the GNU General Public License along with this program.  If
                     19:  * not, see <http://www.gnu.org/licenses/>.
                     20:  * 
                     21:  *             ADDITIONAL TERMS per GNU GPL Section 7
                     22:  * 
                     23:  * No trademark or publicity rights are granted.  This license does NOT
                     24:  * give you any right, title or interest in the trademark SimCity or any
                     25:  * other Electronic Arts trademark.  You may not distribute any
                     26:  * modification of this program using the trademark SimCity or claim any
                     27:  * affliation or association with Electronic Arts Inc. or its employees.
                     28:  * 
                     29:  * Any propagation or conveyance of this program must include this
                     30:  * copyright notice and these terms.
                     31:  * 
                     32:  * If you convey this program (or any modifications of it) and assume
                     33:  * contractual liability for the program to recipients of it, you agree
                     34:  * to indemnify Electronic Arts for any liability that those contractual
                     35:  * assumptions impose on Electronic Arts.
                     36:  * 
                     37:  * You may not misrepresent the origins of this program; modified
                     38:  * versions of the program must be marked as such and not identified as
                     39:  * the original program.
                     40:  * 
                     41:  * This disclaimer supplements the one included in the General Public
                     42:  * License.  TO THE FULLEST EXTENT PERMISSIBLE UNDER APPLICABLE LAW, THIS
                     43:  * PROGRAM IS PROVIDED TO YOU "AS IS," WITH ALL FAULTS, WITHOUT WARRANTY
                     44:  * OF ANY KIND, AND YOUR USE IS AT YOUR SOLE RISK.  THE ENTIRE RISK OF
                     45:  * SATISFACTORY QUALITY AND PERFORMANCE RESIDES WITH YOU.  ELECTRONIC ARTS
                     46:  * DISCLAIMS ANY AND ALL EXPRESS, IMPLIED OR STATUTORY WARRANTIES,
                     47:  * INCLUDING IMPLIED WARRANTIES OF MERCHANTABILITY, SATISFACTORY QUALITY,
                     48:  * FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT OF THIRD PARTY
                     49:  * RIGHTS, AND WARRANTIES (IF ANY) ARISING FROM A COURSE OF DEALING,
                     50:  * USAGE, OR TRADE PRACTICE.  ELECTRONIC ARTS DOES NOT WARRANT AGAINST
                     51:  * INTERFERENCE WITH YOUR ENJOYMENT OF THE PROGRAM; THAT THE PROGRAM WILL
                     52:  * MEET YOUR REQUIREMENTS; THAT OPERATION OF THE PROGRAM WILL BE
                     53:  * UNINTERRUPTED OR ERROR-FREE, OR THAT THE PROGRAM WILL BE COMPATIBLE
                     54:  * WITH THIRD PARTY SOFTWARE OR THAT ANY ERRORS IN THE PROGRAM WILL BE
                     55:  * CORRECTED.  NO ORAL OR WRITTEN ADVICE PROVIDED BY ELECTRONIC ARTS OR
                     56:  * ANY AUTHORIZED REPRESENTATIVE SHALL CREATE A WARRANTY.  SOME
                     57:  * JURISDICTIONS DO NOT ALLOW THE EXCLUSION OF OR LIMITATIONS ON IMPLIED
                     58:  * WARRANTIES OR THE LIMITATIONS ON THE APPLICABLE STATUTORY RIGHTS OF A
                     59:  * CONSUMER, SO SOME OR ALL OF THE ABOVE EXCLUSIONS AND LIMITATIONS MAY
                     60:  * NOT APPLY TO YOU.
                     61:  */
                     62: 
                     63: #define ABS(x)         (((x) < 0) ? (-(x)) : (x))
                     64: 
                     65: #define HASHED_CMD(scope, name) \
                     66:   { int new; \
                     67:     Tcl_CreateHashEntry(&scope##Cmds, #name, &new)->clientData = \
                     68:       (ClientData)scope##Cmd##name; \
                     69:   }
                     70: 
                     71: 
                     72: #define ARGS \
                     73:        Tcl_Interp *interp, int argc, char **argv
                     74: 
                     75: #define CLIENT_ARGS \
                     76:        ClientData clientData, ARGS
                     77: 
                     78: #define VIEW_ARGS \
                     79:        SimView *view, ARGS
                     80: 
                     81: #define GRAPH_ARGS \
                     82:        SimGraph *graph, ARGS
                     83: 
                     84: #define DATE_ARGS \
                     85:        SimDate *date, ARGS
                     86: 
                     87: #define SPRITE_ARGS \
                     88:        SimSprite *sprite, ARGS
                     89: 
                     90: 
                     91: /* tile bounds */
                     92: 
                     93: #define TestBounds(x, y) \
                     94:        (((x) >= 0) && ((x) < WORLD_X) && ((y) >= 0) && ((y) < WORLD_Y))
                     95: 
                     96: /* For s_disasters.c */
                     97: 
                     98: #define TILE_IS_NUCLEAR(tile) \
                     99:        ((tile & LOMASK) == NUCLEAR)
                    100: 
                    101: #define TILE_IS_VULNERABLE(tile) \
                    102:        (!(tile & ZONEBIT) && \
                    103:         ((tile & LOMASK) >= RBRDR) && \
                    104:         ((tile & LOMASK) <= LASTZONE))
                    105: 
                    106: #define TILE_IS_ARSONABLE(tile) \
                    107:        (!(tile & ZONEBIT) && \
                    108:         ((tile & LOMASK) >= RBRDR) && \
                    109:         ((tile & LOMASK) <= LASTZONE))
                    110: 
                    111: #define TILE_IS_RIVER_EDGE(tile) \
                    112:        (((tile & LOMASK) >= FIRSTRIVEDGE) && \
                    113:         ((tile & LOMASK) <= LASTRIVEDGE))
                    114: 
                    115: #define TILE_IS_FLOODABLE(tile) \
                    116:        ((tile == DIRT) || \
                    117:         ((tile & BULLBIT) && \
                    118:          (tile & BURNBIT)))
                    119: 
                    120: #define TILE_IS_RUBBLE(tile) \
                    121:         (((tile & LOMASK) >= RUBBLE) && \
                    122:          ((tile & LOMASK) <= LASTRUBBLE)))
                    123: 
                    124: #define TILE_IS_FLOODABLE2(tile) \
                    125:        ((tile == 0) || \
                    126:         (tile & BURNBIT) || \
                    127:          TILE_IS_RUBBLE(tile))

unix.superglobalmegacorp.com

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.