… | |
… | |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 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 | // |
25 | // |
… | |
… | |
50 | // optimisations/workaround for functions requiring my_perl in scope (anti-bloat) |
51 | // optimisations/workaround for functions requiring my_perl in scope (anti-bloat) |
51 | #undef localtime |
52 | #undef localtime |
52 | #undef srand48 |
53 | #undef srand48 |
53 | #undef drand48 |
54 | #undef drand48 |
54 | #undef srandom |
55 | #undef srandom |
|
|
56 | #undef opendir |
55 | #undef readdir |
57 | #undef readdir |
|
|
58 | #undef closedir |
56 | #undef getprotobyname |
59 | #undef getprotobyname |
57 | #undef gethostbyname |
60 | #undef gethostbyname |
58 | #undef ctime |
61 | #undef ctime |
59 | #undef strerror |
62 | #undef strerror |
60 | #undef _ |
63 | #undef _ |
… | |
… | |
81 | |
84 | |
82 | #define CHECK_ERROR \ |
85 | #define CHECK_ERROR \ |
83 | if (SvTRUE (ERRSV)) \ |
86 | if (SvTRUE (ERRSV)) \ |
84 | LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV)); |
87 | LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV)); |
85 | |
88 | |
|
|
89 | inline int call_pvsv (const char *ob, I32 flags) { return call_pv (ob, flags); } |
|
|
90 | inline int call_pvsv (SV *ob, I32 flags) { return call_sv (ob, flags); } |
|
|
91 | |
86 | #define CALL_BEGIN(args) dSP; ENTER; SAVETMPS; PUSHMARK (SP); EXTEND (SP, args) |
92 | #define CALL_BEGIN(args) dSP; ENTER; SAVETMPS; PUSHMARK (SP); EXTEND (SP, args) |
87 | #define CALL_ARG_SV(sv) PUSHs (sv_2mortal (sv)) // separate because no refcount inc |
93 | #define CALL_ARG_SV(sv) PUSHs (sv_2mortal (sv)) // separate because no refcount inc |
88 | #define CALL_ARG(expr) PUSHs (sv_2mortal (to_sv (expr))) |
94 | #define CALL_ARG(expr) PUSHs (sv_2mortal (to_sv (expr))) |
89 | #define CALL_CALL(name, flags) PUTBACK; int count = call_pv (name, (flags) | G_EVAL); SPAGAIN; |
95 | #define CALL_CALL(name, flags) PUTBACK; int count = call_pvsv (name, (flags) | G_EVAL); SPAGAIN; |
90 | #define CALL_END CHECK_ERROR; FREETMPS; LEAVE |
96 | #define CALL_END PUTBACK; CHECK_ERROR; FREETMPS; LEAVE |
91 | |
97 | |
92 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
98 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
93 | |
99 | |
94 | void cfperl_init (); |
100 | void cfperl_init (); |
95 | void cfperl_main (); |
101 | void cfperl_main (); |
… | |
… | |
97 | void cfperl_emergency_save (); |
103 | void cfperl_emergency_save (); |
98 | void cfperl_cleanup (int make_core); |
104 | void cfperl_cleanup (int make_core); |
99 | void cfperl_make_book (object *book, int level); |
105 | void cfperl_make_book (object *book, int level); |
100 | void cfperl_send_msg (client *ns, int color, const char *type, const char *msg); |
106 | void cfperl_send_msg (client *ns, int color, const char *type, const char *msg); |
101 | int cfperl_can_merge (object *ob1, object *ob2); |
107 | int cfperl_can_merge (object *ob1, object *ob2); |
|
|
108 | void cfperl_mapscript_activate (object *ob, int state, object *activator, object *originator = 0); |
|
|
109 | |
|
|
110 | bool is_match_expr (const char *expr); |
|
|
111 | /* applies the match expression and returns true if it matches */ |
|
|
112 | bool match (const char *expr, object *ob, object *self = 0, object *source = 0, object *originator = 0); |
102 | |
113 | |
103 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
114 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
104 | |
115 | |
105 | #if IVSIZE >= 8 |
116 | #if IVSIZE >= 8 |
106 | typedef IV val64; |
117 | typedef IV val64; |
… | |
… | |
109 | # define SvVAL64 SvIV |
120 | # define SvVAL64 SvIV |
110 | # define newSVuval64 newSVuv |
121 | # define newSVuval64 newSVuv |
111 | # define SvUVAL64 SvUV |
122 | # define SvUVAL64 SvUV |
112 | #else |
123 | #else |
113 | typedef double val64; |
124 | typedef double val64; |
|
|
125 | typedef double uval64; |
114 | # define newSVval64 newSVnv |
126 | # define newSVval64 newSVnv |
115 | # define SvVAL64 SvNV |
127 | # define SvVAL64 SvNV |
116 | # define newSVuval64 newSVnv |
128 | # define newSVuval64 newSVnv |
117 | # define SvUVAL64 SvNV |
129 | # define SvUVAL64 SvNV |
118 | #endif |
130 | #endif |
… | |
… | |
180 | INTERFACE_CLASS (attachable) |
192 | INTERFACE_CLASS (attachable) |
181 | struct attachable : refcnt_base |
193 | struct attachable : refcnt_base |
182 | { |
194 | { |
183 | static MGVTBL vtbl; |
195 | static MGVTBL vtbl; |
184 | |
196 | |
185 | static unordered_vector<attachable *> mortals; |
|
|
186 | MTH static void check_mortals (); |
|
|
187 | |
|
|
188 | enum { |
197 | enum { |
189 | F_DESTROYED = 0x01, |
198 | F_DESTROYED = 0x01, |
190 | F_DEBUG_TRACE = 0x02, |
199 | F_DEBUG_TRACE = 0x02, |
191 | }; |
200 | }; |
192 | int ACC (RW, flags); |
201 | uint8 ACC (RW, flags); |
|
|
202 | |
|
|
203 | static unordered_vector<attachable *> mortals; |
|
|
204 | MTH static void check_mortals (); |
193 | |
205 | |
194 | // object is delete'd after the refcount reaches 0 |
206 | // object is delete'd after the refcount reaches 0 |
195 | MTH int refcnt_cnt () const; |
207 | MTH int refcnt_cnt () const; |
196 | // check wether the object has died and destroy |
208 | // check wether the object has died and destroy |
197 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
209 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
… | |
… | |
285 | ~object_freezer (); |
297 | ~object_freezer (); |
286 | |
298 | |
287 | void put (attachable *ext); |
299 | void put (attachable *ext); |
288 | |
300 | |
289 | // used only for user-defined key-value pairs |
301 | // used only for user-defined key-value pairs |
290 | void put (const shstr &k, const shstr &v) |
302 | void put (shstr_tmp k, shstr_tmp v) |
291 | { |
303 | { |
292 | add (k); |
304 | add (k); |
293 | |
305 | |
294 | if (expect_true (v)) |
306 | if (expect_true (v)) |
295 | add (' '), add (v); |
307 | add (' '), add (v); |
… | |
… | |
319 | void put (keyword k, const char *v = 0) |
331 | void put (keyword k, const char *v = 0) |
320 | { |
332 | { |
321 | put_kw_string (k, v); |
333 | put_kw_string (k, v); |
322 | } |
334 | } |
323 | |
335 | |
324 | void put (keyword k, const shstr &v) |
336 | void put (keyword k, shstr_tmp v) |
325 | { |
337 | { |
326 | put_kw_string (k, v); |
338 | put_kw_string (k, v); |
327 | } |
339 | } |
328 | |
340 | |
329 | void put (keyword k, double v) |
341 | void put (keyword k, double v) |
… | |
… | |
363 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
375 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
364 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
376 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
365 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
377 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
366 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
378 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
367 | |
379 | |
368 | void put (keyword kbeg, keyword kend, const shstr &v) |
380 | void put (keyword kbeg, keyword kend, shstr_tmp v) |
369 | { |
381 | { |
370 | force (MAX_KEYWORD_LEN + 1); |
382 | force (MAX_KEYWORD_LEN + 1); |
371 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
383 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
372 | |
384 | |
373 | if (expect_true (v)) |
385 | if (expect_true (v)) |