Branch: Tag:

1995-10-16

1995-10-16 17:06:26 by Fredrik Hübinette (Hubbe) <hubbe@hubbe.net>

committing

Rev: src/Makefile.in:1.8
Rev: src/alloca.c:1.2
Rev: src/builtin_efuns.c:1.3
Rev: src/call_out.c:1.6
Rev: src/config.h:1.7
Rev: src/configure.in:1.11
Rev: src/interpret.c:1.6
Rev: src/language.y:1.4
Rev: src/lpc_types.c:1.4
Rev: src/lpc_types.h:1.3
Rev: src/modules/files/Makefile.in:1.5
Rev: src/modules/files/file.c:1.6
Rev: src/modules/regexp/Makefile.in:1.5
Rev: src/modules/sprintf/Makefile.in:1.5
Rev: src/program.c:1.4

13:   #include "error.h"   #include "builtin_efuns.h"   #include "memory.h" + #include "main.h"      call_out **pending_calls=0; /* pointer to first busy pointer */   int num_pending_calls; /* no of busy pointers in buffer */
26: Inside #if defined(DEBUG)
  #ifdef DEBUG    struct array *v;    int e; -  if(call_buffer) return; +     -  +  if(!d_flag) return; +  if(!call_buffer) return; +     if(num_pending_calls<0 || num_pending_calls>call_buffer_size)    fatal("Error in call out tables.\n");   
38: Inside #if defined(DEBUG)
   {    if(e)    { -  if(pending_calls[e-1]>pending_calls[e]) +  if(pending_calls[e-1]->time>pending_calls[e]->time)    fatal("Error in call out order.\n");    }   
111:       /* time to link it into the buffer using binsearch */    pos=pending_calls; -  if(new->time>current_time+1) /* do we need to search where ?*/ -  { +     e=num_pending_calls;    while(e>0)    {
125:    e=c;    }    } -  } +     pos--;    pending_calls--;    for(p=pending_calls;p<pos;p++) p[0]=p[1];    *pos=new;    num_pending_calls++;    -  +  verify_call_outs();    return 1;   }