1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
  
32
  
33
  
34
  
35
  
36
  
37
  
38
  
39
  
40
  
41
  
42
  
43
  
44
  
45
  
46
  
47
  
48
  
49
  
50
  
51
  
52
  
53
  
54
  
55
  
56
  
57
  
58
  
59
  
60
  
61
  
62
  
63
  
64
  
65
  
66
  
67
  
68
  
69
  
70
  
71
  
72
  
73
  
74
  
75
  
76
  
77
  
78
  
79
  
80
  
81
  
82
  
83
  
84
  
85
  
86
  
87
  
88
  
89
  
90
  
91
  
92
  
93
  
94
  
95
  
96
  
97
  
98
  
99
  
100
  
101
  
102
  
103
  
104
  
105
  
106
  
107
  
108
  
109
  
110
  
111
  
112
  
113
  
114
  
115
  
116
  
117
  
118
  
119
  
120
  
121
  
122
  
123
  
124
  
125
  
126
  
127
  
128
  
129
  
130
  
131
  
132
  
133
  
134
  
135
  
136
  
137
  
138
  
139
  
140
  
141
  
142
  
143
  
144
  
145
  
146
  
147
  
148
  
149
  
150
  
151
  
152
  
153
  
154
  
155
  
156
  
157
  
158
  
159
  
160
  
161
  
162
  
163
  
164
  
165
  
166
  
167
  
168
  
169
  
170
  
171
  
172
  
173
  
174
  
175
  
176
  
177
  
178
  
179
  
180
  
181
  
182
  
183
  
184
  
185
  
186
  
187
  
188
  
189
  
190
  
191
  
192
  
193
  
194
  
195
  
196
  
197
  
198
  
199
  
200
  
201
  
202
  
203
  
204
  
205
  
206
  
207
  
208
  
209
  
210
  
211
  
212
  
213
  
214
  
215
  
216
  
217
  
218
  
219
  
220
  
221
  
222
  
223
  
224
  
225
  
226
  
227
  
228
  
229
  
230
  
231
  
232
  
233
  
234
  
235
  
236
  
237
  
238
  
239
  
240
  
241
  
242
  
243
  
244
  
245
  
246
  
247
  
248
  
249
  
250
  
251
  
252
  
253
  
254
  
255
  
256
  
257
  
258
  
259
  
260
  
261
  
262
  
263
  
264
  
265
  
266
  
267
  
268
  
269
  
270
  
271
  
272
  
273
  
274
  
275
  
276
  
277
  
278
  
279
  
280
  
281
  
282
  
283
  
284
  
285
  
286
  
287
  
288
  
289
  
290
  
291
  
292
  
293
  
294
  
295
  
296
  
297
  
298
  
299
  
300
  
301
  
302
  
303
  
304
  
305
  
306
  
307
  
308
  
309
  
310
  
311
  
312
  
313
  
/* -*- c -*- */ 
 
#include "global.h" 
#include "interpret.h" 
#include "svalue.h" 
#include "opcodes.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" 
#include "multiset.h" 
#include "pike_types.h" 
#include "pike_memory.h" 
#include "threads.h" 
#include <math.h> 
#include <ctype.h> 
#include "module_support.h" 
#include "cyclic.h" 
#include "bignum.h" 
#include "main.h" 
#include "operators.h" 
 
//! Extract a column from a two-dimensional array. 
//! 
//! This function is exactly equivalent to: 
//! @code{map(@[data], lambda(mixed x,mixed y) { return x[y]; }, @[index])@} 
//! 
//! Except of course it is a lot shorter and faster. 
//! That is, it indices every index in the array data on the value of 
//! the argument index and returns an array with the results. 
//! 
//! @seealso 
//! @[rows()] 
//! 
PIKEFUN array column(array data, mixed index) 
  efun; 
  optflags OPT_TRY_OPTIMIZE; 
{ 
  INT32 e; 
  struct array *a; 
 
  DECLARE_CYCLIC(); 
 
  /* Optimization */ 
  if(data->refs == 1) 
  { 
    /* An array with one ref cannot possibly be cyclic */ 
    struct svalue sval; 
    data->type_field = BIT_MIXED | BIT_UNFINISHED; 
    for(e=0;e<data->size;e++) 
    { 
      index_no_free(&sval, ITEM(data)+e, index); 
      free_svalue(ITEM(data)+e); 
      ITEM(data)[e]=sval; 
    } 
    pop_stack(); 
    return; 
  } 
 
  if((a=(struct array *)BEGIN_CYCLIC(data,0))) 
  { 
    add_ref(a); 
  }else{ 
    push_array(a=allocate_array(data->size)); 
    SET_CYCLIC_RET(a); 
 
    for(e=0;e<a->size;e++) 
      index_no_free(ITEM(a)+e, ITEM(data)+e, index); 
 
    sp--; 
  } 
  END_CYCLIC(); 
  RETURN a; 
} 
 
//! This function creates a multiset from an array. 
//! 
//! @seealso 
//! @[aggregate_multiset()] 
//! 
PIKEFUN multiset(1) mkmultiset(array(1=mixed) a) 
  efun; 
  optflags OPT_TRY_OPTIMIZE|OPT_EXTERNAL_DEPEND; 
{ 
  RETURN mkmultiset(a); 
} 
 
//! This function changes the debug trace level. 
//! 
//! The old level is returned. 
//! 
//! Trace level 1 or higher means that calls to Pike functions are 
//! printed to stderr, level 2 or higher means calls to builtin functions 
//! are printed, 3 means every opcode interpreted is printed, 4 means 
//! arguments to these opcodes are printed as well. 
//! 
//! See the @tt{-t@} command-line option for more information. 
//! 
PIKEFUN int trace(int t) 
  efun; 
  optflags OPT_SIDE_EFFECT; 
{ 
  pop_n_elems(args); 
  push_int(t_flag); 
  t_flag=t; 
} 
 
//! Convert the output from a previous call to @[time()] into a readable 
//! string containing the current year, month, day and time. 
//! 
//! @seealso 
//! @[time()], @[localtime()], @[mktime()], @[gmtime()] 
//! 
PIKEFUN string ctime(int timestamp) 
  efun; 
  optflags OPT_TRY_OPTIMIZE; 
{ 
  time_t i=(time_t)timestamp; 
  RETURN make_shared_string(ctime(&i)); 
} 
 
//! Make a mapping from two arrays. 
//! 
//! Makes a mapping @[ind[x]]:@[val[x]], @tt{0 <= x < sizeof(ind)@}. 
//! 
//! @[ind] and @[val] must have the same size. 
//! 
//! This is the inverse operation of @[indices()] and @[values()]. 
//! 
//! @seealso 
//! @[indices()], @[values()] 
//! 
PIKEFUN mapping(1:2) mkmapping(array(1=mixed) ind, array(2=mixed) val) 
  efun; 
  optflags OPT_TRY_OPTIMIZE|OPT_EXTERNAL_DEPEND; 
{ 
  if(ind->size != val->size) 
    bad_arg_error("mkmapping", sp-args, args, 2, "array", sp+1-args, 
                  "mkmapping called on arrays of different sizes (%d != %d)\n", 
                  ind->size, val->size); 
 
  RETURN mkmapping(ind, val); 
} 
 
//! Count the number of non-overlapping times the string @[needle] occurrs 
//! in the string @[haystack]. 
//! 
//! @seealso 
//! @[search()], @[`/()] 
//! 
PIKEFUN int string_count(string haystack, string needle) 
  errname String.count; 
  optflags OPT_TRY_OPTIMIZE; 
{ 
   ptrdiff_t c = 0; 
   ptrdiff_t i, j; 
 
   switch (needle->len) 
   { 
     case 0: 
       switch (haystack->len) 
       { 
         case 0: c=1; break; /* "" appears one time in "" */ 
         case 1: c=0; break; /* "" doesn't appear in "x" */ 
         default: c=haystack->len-1; /* one time between each character */ 
       } 
       break; 
     case 1: 
       /* maybe optimize? */ 
     default: 
       for (i=0; i<haystack->len; i++) 
       { 
         j=string_search(haystack,needle,i); 
         if (j==-1) break; 
         i=j+needle->len-1; 
         c++; 
       } 
       break; 
   } 
   RETURN DO_NOT_WARN((INT_TYPE)c); 
} 
 
//! Returns 1 if @[prog] implements @[api]. 
//! 
PIKEFUN int program_implements(program prog, program api) 
  errname Program.implements; 
  optflags OPT_TRY_OPTIMIZE; 
{ 
  RETURN implements(prog, api); 
} 
 
//! Returns 1 if @[child] has inherited @[parent]. 
//! 
PIKEFUN int program_inherits(program child, program parent) 
  errname Program.inherits; 
  optflags OPT_TRY_OPTIMIZE; 
{ 
  RETURN !!low_get_storage(parent, child); 
} 
 
//! Returns a string with filename and linenumber describing where 
//! the program @[p] was defined. 
//! 
//! The returned string is of the format @tt{"@i{filename@}:@i{linenumber@}"@}. 
//! 
//! If it cannot be determined where the program was defined, @tt{0@} (zero) 
//! will be returned. 
//! 
PIKEFUN string program_defined(program p) 
  errname Program.defined; 
  optflags OPT_TRY_OPTIMIZE; 
{ 
  if(p && p->num_linenumbers) 
  { 
    char *tmp; 
    INT32 line; 
    if((tmp=get_line(p->program, p, &line))) 
    { 
      struct pike_string *tmp2; 
      tmp2=make_shared_string(tmp); 
      pop_n_elems(args); 
 
      push_string(tmp2); 
      if(line > 1) 
      { 
        push_constant_text(":"); 
        push_int(line); 
        f_add(3); 
      } 
      return; 
    } 
  } 
 
  pop_n_elems(args); 
  push_int(0); 
} 
 
//! Returns the width of a string. 
//! 
//! Three return values are possible: 
//! @int 
//!   @value 8 
//!     The string @[s] only contains characters <= 255. 
//!   @value 16 
//!     The string @[s] only contains characters <= 65535. 
//!   @value 32 
//!     The string @[s] contains characters >= 65536. 
//! @endint 
//! 
PIKEFUN int string_width(string s) 
  errname String.width; 
  optflags OPT_TRY_OPTIMIZE; 
{ 
  RETURN 8 * (1 << s->size_shift); 
} 
 
//! Removes the entry with index @[index] from mapping @[map] destructively. 
//! 
//! If the mapping does not have an entry with index @[index], nothing is done. 
//! 
//! @returns 
//! The value that was removed will be returned. 
//! 
//! @note 
//! Note that @[m_delete()] changes @[map] destructively. 
//! 
//! @seealso 
//! @[mappingp()] 
//! 
PIKEFUN 1 m_delete(mapping(mixed:1=mixed) map, mixed index) 
  efun; 
  optflags OPT_SIDE_EFFECT; 
{ 
  struct svalue s; 
  map_delete_no_free(map, index, &s); 
  pop_n_elems(args); 
  *sp=s; 
  sp++; 
} 
 
//! Returns 1 if the weak flag has been set for @[m]. 
//! 
PIKEFUN int(0 .. 1) get_weak_flag(array|mapping|multiset m) 
  efun; 
  optflags OPT_EXTERNAL_DEPEND; 
{ 
  int flag = 0; 
  switch (m->type) { 
    case T_ARRAY: 
      flag = !!(m->u.array->flags & ARRAY_WEAK_FLAG); 
      break; 
    case T_MAPPING: 
      flag = !!(mapping_get_flags(m->u.mapping) & MAPPING_FLAG_WEAK); 
      break; 
    case T_MULTISET: 
      flag = !!(m->u.multiset->ind->flags & (ARRAY_WEAK_FLAG|ARRAY_WEAK_SHRINK)); 
      break; 
    default: 
      SIMPLE_BAD_ARG_ERROR("get_weak_flag",1,"array|mapping|multiset"); 
  } 
  pop_n_elems(args); 
  push_int(flag); 
} 
 
void init_builtin(void) 
{ 
INIT 
}