Branch: Tag:

2002-08-15

2002-08-15 14:50:28 by Marcus Comstedt <marcus@mc.pp.se>

Rename fatal -> Pike_fatal.

Rev: src/apply_low.h:1.7
Rev: src/array.c:1.129
Rev: src/array.h:1.41
Rev: src/backend.cmod:1.27
Rev: src/bignum.c:1.25
Rev: src/block_alloc.h:1.41
Rev: src/builtin.cmod:1.90
Rev: src/builtin_functions.c:1.435
Rev: src/callback.c:1.26
Rev: src/code/ia32.c:1.21
Rev: src/code/ppc32.c:1.16
Rev: src/code/ppc32.h:1.14
Rev: src/code/sparc.c:1.11
Rev: src/code/sparc.h:1.13
Rev: src/compilation.h:1.28
Rev: src/constants.c:1.38
Rev: src/cpp.c:1.102
Rev: src/cyclic.c:1.6
Rev: src/dlopen.c:1.32
Rev: src/docode.c:1.144
Rev: src/dynamic_buffer.c:1.16
Rev: src/dynamic_load.c:1.64
Rev: src/encode.c:1.151
Rev: src/error.c:1.86
Rev: src/fd_control.c:1.41
Rev: src/fdlib.c:1.52
Rev: src/fdlib.h:1.41
Rev: src/fsort_template.h:1.11
Rev: src/gc.c:1.185
Rev: src/gc.h:1.90
Rev: src/hashtable.c:1.11
Rev: src/interpret.c:1.263
Rev: src/interpret.h:1.110
Rev: src/interpret_functions.h:1.105
Rev: src/interpreter.h:1.76
Rev: src/iterators.cmod:1.26
Rev: src/language.yacc:1.289
Rev: src/las.c:1.297
Rev: src/lex.c:1.105
Rev: src/lexer.h:1.38
Rev: src/main.c:1.150
Rev: src/mapping.c:1.149
Rev: src/module_support.c:1.46
Rev: src/modules/Gmp/mpf.cmod:1.9
Rev: src/modules/Gmp/mpq.cmod:1.10
Rev: src/modules/Gmp/mpz_glue.c:1.107
Rev: src/modules/HTTPLoop/cache.c:1.17
Rev: src/modules/HTTPLoop/requestobject.c:1.21
Rev: src/modules/Image/colors.c:1.61
Rev: src/modules/Image/colortable.c:1.109
Rev: src/modules/Image/colortable_lookup.h:1.18
Rev: src/modules/Image/encodings/bmp.c:1.35
Rev: src/modules/Image/font.c:1.72
Rev: src/modules/Image/image_module.c:1.14
Rev: src/modules/Image/layers.c:1.79
Rev: src/modules/Odbc/odbc.c:1.30
Rev: src/modules/Oracle/oracle.c:1.70
Rev: src/modules/PDF/pdf_module.c:1.11
Rev: src/modules/Parser/html.c:1.152
Rev: src/modules/Parser/parser.c:1.14
Rev: src/modules/Perl/perlmod.c:1.25
Rev: src/modules/Pipe/pipe.c:1.49
Rev: src/modules/_Charset/charsetmod.c:1.35
Rev: src/modules/_Charset/iso2022.c:1.23
Rev: src/modules/files/file.c:1.239
Rev: src/modules/files/sendfile.c:1.57
Rev: src/modules/files/socket.c:1.63
Rev: src/modules/files/stat.c:1.22
Rev: src/modules/files/udp.c:1.37
Rev: src/modules/spider/xml.c:1.52
Rev: src/modules/sprintf/sprintf.c:1.93
Rev: src/modules/sybase/sybase.c:1.9
Rev: src/multiset.c:1.50
Rev: src/multiset.h:1.25
Rev: src/object.c:1.203
Rev: src/object.h:1.71
Rev: src/opcodes.c:1.122
Rev: src/operators.c:1.159
Rev: src/peep.c:1.72
Rev: src/pike_error.h:1.19
Rev: src/pike_macros.h:1.31
Rev: src/pike_memory.c:1.120
Rev: src/pike_search.c:1.9
Rev: src/pike_search_engine.c:1.8
Rev: src/pike_search_engine2.c:1.5
Rev: src/pike_threadlib.h:1.16
Rev: src/pike_types.c:1.194
Rev: src/pike_types.h:1.79
Rev: src/port.c:1.52
Rev: src/post_modules/GTK/source/support.c:1.33
Rev: src/post_modules/Unicode/normalize.c:1.9
Rev: src/preprocessor.h:1.51
Rev: src/program.c:1.441
Rev: src/queue.c:1.8
Rev: src/rbtree.c:1.10
Rev: src/rbtree_low.h:1.2
Rev: src/signal_handler.c:1.225
Rev: src/stralloc.c:1.143
Rev: src/stralloc.h:1.66
Rev: src/svalue.c:1.144
Rev: src/svalue.h:1.106
Rev: src/threads.c:1.180

5:      #include "global.h"    - RCSID("$Id: rbtree.c,v 1.9 2001/12/10 00:57:17 mast Exp $"); + RCSID("$Id: rbtree.c,v 1.10 2002/08/15 14:49:25 marcus Exp $");      #include "interpret.h"   #include "pike_error.h"
100: Inside #if defined(PIKE_DEBUG)
   if (rbp1.slice->up) rbstack_up (&rbp1);   #ifdef PIKE_DEBUG    else if (rbp1.ssp != rbpos.ssp || rbp1.slice != rbpos.slice) -  fatal ("Didn't find the given position on the stack.\n"); +  Pike_fatal ("Didn't find the given position on the stack.\n");   #endif    }    }
117:    struct rbstack_slice *tgt_slice = target->slice;      #ifdef PIKE_DEBUG -  if (target->ssp) fatal ("target rbstack not empty.\n"); +  if (target->ssp) Pike_fatal ("target rbstack not empty.\n");   #endif       target->ssp = source->ssp;
154:    size_t ssp = source->ssp;      #ifdef PIKE_DEBUG -  if (target->ssp) fatal ("target rbstack not empty.\n"); +  if (target->ssp) Pike_fatal ("target rbstack not empty.\n");   #endif       target->ssp = ssp;
736:   void low_rb_init_root (struct rb_node_hdr *node)   {   #ifdef PIKE_DEBUG -  if (!node) fatal ("New node is null.\n"); +  if (!node) Pike_fatal ("New node is null.\n");   #endif   #ifdef RB_STATS    rb_num_adds++;
752:    struct rb_node_hdr *parent = RBSTACK_PEEK (rbstack);      #ifdef PIKE_DEBUG -  if (!new) fatal ("New node is null.\n"); -  if (!parent) fatal ("Cannot link in root node.\n"); +  if (!new) Pike_fatal ("New node is null.\n"); +  if (!parent) Pike_fatal ("Cannot link in root node.\n");    if (!(parent->flags & RB_THREAD_PREV)) -  fatal ("Cannot link in node at interior prev link.\n"); +  Pike_fatal ("Cannot link in node at interior prev link.\n");   #endif   #ifdef RB_STATS    rb_num_adds++;
777:    struct rb_node_hdr *parent = RBSTACK_PEEK (rbstack);      #ifdef PIKE_DEBUG -  if (!new) fatal ("New node is null.\n"); -  if (!parent) fatal ("Cannot link in root node.\n"); +  if (!new) Pike_fatal ("New node is null.\n"); +  if (!parent) Pike_fatal ("Cannot link in root node.\n");    if (!(parent->flags & RB_THREAD_NEXT)) -  fatal ("Cannot link in node at interior next link.\n"); +  Pike_fatal ("Cannot link in node at interior next link.\n");   #endif   #ifdef RB_STATS    rb_num_adds++;
876:       RBSTACK_POP (rbstack, node);   #ifdef PIKE_DEBUG -  if (!node) fatal ("No node to delete on stack.\n"); +  if (!node) Pike_fatal ("No node to delete on stack.\n");   #endif   #ifdef RB_STATS    rb_num_deletes++;
958: Inside #if 0
   debug_check_rbstack (*root, *rbstack_ptr);    if (node != unlink) next = node;    if (RBSTACK_PEEK (*rbstack_ptr) != next) -  fatal ("Stack got %p on top, but next node is %p.\n", +  Pike_fatal ("Stack got %p on top, but next node is %p.\n",    RBSTACK_PEEK (*rbstack_ptr), next);    if (!keep_rbstack) RBSTACK_FREE (*rbstack_ptr);    return unlink;
978:       RBSTACK_POP (rbstack, node);   #ifdef PIKE_DEBUG -  if (!node) fatal ("No node to delete on stack.\n"); +  if (!node) Pike_fatal ("No node to delete on stack.\n");   #endif   #ifdef RB_STATS    rb_num_deletes++;
1051: Inside #if 0
   real_low_rb_unlink_without_move (root, rbstack_ptr, 1);    debug_check_rbstack (*root, *rbstack_ptr);    if (RBSTACK_PEEK (*rbstack_ptr) != next) -  fatal ("Stack got %p on top, but next node is %p.\n", +  Pike_fatal ("Stack got %p on top, but next node is %p.\n",    RBSTACK_PEEK (*rbstack_ptr), next);    if (!keep_rbstack) RBSTACK_FREE (*rbstack_ptr);   }
1124: Inside #if defined(ENABLE_UNUSED_RB_FUNCTIONS)
   while (node != existing) {    LOW_RB_TRACK_PREV (rbstack, node);   #ifdef PIKE_DEBUG -  if (!node) fatal ("Tree doesn't contain the existing node.\n"); +  if (!node) Pike_fatal ("Tree doesn't contain the existing node.\n");   #endif    }    if (node->flags & RB_THREAD_NEXT) {
1145: Inside #if defined(ENABLE_UNUSED_RB_FUNCTIONS)
      else {   #ifdef PIKE_DEBUG -  if (existing) fatal ("Tree doesn't contain the existing node.\n"); +  if (existing) Pike_fatal ("Tree doesn't contain the existing node.\n");   #endif    low_rb_init_root (new);    *root = new;
1181: Inside #if defined(ENABLE_UNUSED_RB_FUNCTIONS)
   struct rb_node_hdr *node = *root;    RBSTACK_INIT (rbstack);   #ifdef PIKE_DEBUG -  if (!node) fatal ("Tree is empty.\n"); +  if (!node) Pike_fatal ("Tree is empty.\n");   #if 0    if (find_fn (key, to_delete)) -  fatal ("Given key doesn't match the node to delete.\n"); +  Pike_fatal ("Given key doesn't match the node to delete.\n");   #endif   #endif    LOW_RB_TRACK_NEQ (rbstack, node, cmp_res = find_fn (key, node) >= 0 ? 1 : -1, ;, ;);    while (node != to_delete) {    LOW_RB_TRACK_PREV (rbstack, node);   #ifdef PIKE_DEBUG -  if (!node) fatal ("Tree doesn't contain the node to delete.\n"); +  if (!node) Pike_fatal ("Tree doesn't contain the node to delete.\n");   #endif    }    low_rb_unlink_without_move (root, rbstack);
1235: Inside #if defined(ENABLE_UNUSED_RB_FUNCTIONS)
   struct rb_node_hdr *node = *root;    RBSTACK_INIT (rbstack);   #ifdef PIKE_DEBUG -  if (!node) fatal ("Tree is empty.\n"); +  if (!node) Pike_fatal ("Tree is empty.\n");   #if 0    if (find_fn (key, to_delete)) -  fatal ("Given key doesn't match the node to delete.\n"); +  Pike_fatal ("Given key doesn't match the node to delete.\n");   #endif   #endif    LOW_RB_TRACK_NEQ (rbstack, node, cmp_res = find_fn (key, node) >= 0 ? 1 : -1, ;, ;);    while (node != to_delete) {    LOW_RB_TRACK_PREV (rbstack, node);   #ifdef PIKE_DEBUG -  if (!node) fatal ("Tree doesn't contain the node to delete.\n"); +  if (!node) Pike_fatal ("Tree doesn't contain the node to delete.\n");   #endif    }    return low_rb_unlink_with_move (root, rbstack, node_size);
1314:    }   tree_too_small:   #ifdef PIKE_DEBUG -  fatal ("Tree too small for index %"PRINTSIZET"u.\n", index); +  Pike_fatal ("Tree too small for index %"PRINTSIZET"u.\n", index);   #endif    return (struct rb_node_hdr *) (ptrdiff_t) -1;   }
1458:    while (count < length) {    struct rb_node_hdr *next;   #ifdef PIKE_DEBUG -  if (!list) fatal ("Premature end of list at %"PRINTSIZET"u, " +  if (!list) Pike_fatal ("Premature end of list at %"PRINTSIZET"u, "    "expected %"PRINTSIZET"u.\n", count, length);   #endif    next = list->next;
1514:    }      #ifdef PIKE_DEBUG -  if (list) fatal ("List longer than expected %d.\n", length); +  if (list) Pike_fatal ("List longer than expected %d.\n", length);   #endif    return root;   }