Branch: Tag:

1999-01-21

1999-01-21 09:15:55 by Fredrik Hübinette (Hubbe) <hubbe@hubbe.net>

security system v1.0E-100 checked in... (lots of work left to do)

Rev: src/array.c:1.43
Rev: src/array.h:1.15
Rev: src/builtin_functions.c:1.145
Rev: src/error.h:1.26
Rev: src/interpret.c:1.112
Rev: src/interpret.h:1.25
Rev: src/main.c:1.61
Rev: src/mapping.c:1.38
Rev: src/mapping.h:1.13
Rev: src/modules/files/file.c:1.133
Rev: src/modules/system/system.c:1.61
Rev: src/multiset.c:1.13
Rev: src/multiset.h:1.8
Rev: src/object.c:1.54
Rev: src/object.h:1.20
Rev: src/opcodes.c:1.35
Rev: src/otable.h:1.3(DEAD)
Rev: src/program.c:1.106
Rev: src/program.h:1.47
Rev: src/security.c:1.1
Rev: src/security.h:1.1
Rev: src/svalue.h:1.20
Rev: src/testsuite.in:1.139
Rev: src/threads.c:1.86

18:   #include "pike_memory.h"   #include "gc.h"   #include "main.h" + #include "security.h"    - RCSID("$Id: array.c,v 1.42 1998/11/22 11:02:31 hubbe Exp $"); + RCSID("$Id: array.c,v 1.43 1999/01/21 09:14:56 hubbe Exp $");      struct array empty_array=   {    1, /* Never free */ -  + #ifdef PIKE_SECURITY +  0, + #endif    &empty_array, /* Next */    &empty_array, /* previous (circular) */    0, /* Size = 0 */
70:    empty_array.next=v;    v->next->prev=v;    +  INITIALIZE_PROT(v); +     for(e=0;e<v->size;e++)    {    ITEM(v)[e].type=T_INT;
103:    */   void really_free_array(struct array *v)   { -  +    #ifdef PIKE_DEBUG    if(v == & empty_array)    fatal("Tried to free the empty_array.\n");
114:   #endif       add_ref(v); +  FREE_PROT(v);    free_svalues(ITEM(v), v->size, v->type_field);    v->refs--;    array_free_no_free(v);