pike.git / src / builtin_functions.c

version» Context lines:

pike.git/src/builtin_functions.c:1:   /*   || This file is part of Pike. For copyright information see COPYRIGHT.   || Pike is distributed under GPL, LGPL and MPL. See the file COPYING   || for more information. - || $Id: builtin_functions.c,v 1.548 2004/05/01 15:32:01 mast Exp $ + || $Id: builtin_functions.c,v 1.549 2004/05/02 21:35:54 nilsson Exp $   */      #include "global.h" - RCSID("$Id: builtin_functions.c,v 1.548 2004/05/01 15:32:01 mast Exp $"); + RCSID("$Id: builtin_functions.c,v 1.549 2004/05/02 21:35:54 nilsson Exp $");   #include "interpret.h"   #include "svalue.h"   #include "pike_macros.h"   #include "object.h"   #include "program.h"   #include "array.h"   #include "pike_error.h"   #include "constants.h"   #include "mapping.h"   #include "stralloc.h"
pike.git/src/builtin_functions.c:4877:    }    }    if (max < k->ind.u.integer) {    max = k->ind.u.integer;    }    nelems++;    }    ITEM(min)[i].u.integer = low;    }    -  min->type_field = T_INT; +  min->type_field = BIT_INT;    ref_push_array(order);    f_sort(2); /* Sort the order array on the minimum index */       /* State on stack now:    *    * array(mapping(int:mixed)) arr    * array(int) order    * array(int) min (now sorted)    */   
pike.git/src/builtin_functions.c:5050:    stack[pos] = i;    }       /* FIXME(?) memory unfreed upon error here */    res = low_allocate_array(top, 0);    while (ltop != -1)    {    ITEM(res)[--top].u.integer = ltop;    ltop = links[ltop];    } -  res->type_field = T_INT; +  res->type_field = BIT_INT;       UNSET_ONERROR(tmp2);    UNSET_ONERROR(tmp);       free(stack);    free(links);    return res;   }      /*! @decl array(int) longest_ordered_sequence(array a)