File: Libm.xs

package info (click to toggle)
libmath-libm-perl 1.0-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, buster, jessie, jessie-kfreebsd, sid, stretch
  • size: 76 kB
  • ctags: 2
  • sloc: perl: 153; makefile: 2
file content (437 lines) | stat: -rw-r--r-- 5,780 bytes parent folder | download
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
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"

#include <math.h>

static int
not_here(char *s)
{
    croak("%s not implemented on this architecture", s);
    return -1;
}

static double
constant_M_PI_(char *name, int len, int arg)
{
    switch (name[5 + 0]) {
    case '2':
	if (strEQ(name + 5, "2")) {	/* M_PI_ removed */
#ifdef M_PI_2
	    return M_PI_2;
#else
	    goto not_there;
#endif
	}
    case '4':
	if (strEQ(name + 5, "4")) {	/* M_PI_ removed */
#ifdef M_PI_4
	    return M_PI_4;
#else
	    goto not_there;
#endif
	}
    }
    errno = EINVAL;
    return 0;

not_there:
    errno = ENOENT;
    return 0;
}

static double
constant_M_P(char *name, int len, int arg)
{
    if (3 + 1 > len ) {
	errno = EINVAL;
	return 0;
    }
    switch (name[3 + 1]) {
    case '\0':
	if (strEQ(name + 3, "I")) {	/* M_P removed */
#ifdef M_PI
	    return M_PI;
#else
	    goto not_there;
#endif
	}
    case '_':
	if (!strnEQ(name + 3,"I", 1))
	    break;
	return constant_M_PI_(name, len, arg);
    }
    errno = EINVAL;
    return 0;

not_there:
    errno = ENOENT;
    return 0;
}

static double
constant_M_2(char *name, int len, int arg)
{
    if (3 + 1 >= len ) {
	errno = EINVAL;
	return 0;
    }
    switch (name[3 + 1]) {
    case 'P':
	if (strEQ(name + 3, "_PI")) {	/* M_2 removed */
#ifdef M_2_PI
	    return M_2_PI;
#else
	    goto not_there;
#endif
	}
    case 'S':
	if (strEQ(name + 3, "_SQRTPI")) {	/* M_2 removed */
#ifdef M_2_SQRTPI
	    return M_2_SQRTPI;
#else
	    goto not_there;
#endif
	}
    }
    errno = EINVAL;
    return 0;

not_there:
    errno = ENOENT;
    return 0;
}

static double
constant_M_S(char *name, int len, int arg)
{
    if (3 + 3 >= len ) {
	errno = EINVAL;
	return 0;
    }
    switch (name[3 + 3]) {
    case '1':
	if (strEQ(name + 3, "QRT1_2")) {	/* M_S removed */
#ifdef M_SQRT1_2
	    return M_SQRT1_2;
#else
	    goto not_there;
#endif
	}
    case '2':
	if (strEQ(name + 3, "QRT2")) {	/* M_S removed */
#ifdef M_SQRT2
	    return M_SQRT2;
#else
	    goto not_there;
#endif
	}
    }
    errno = EINVAL;
    return 0;

not_there:
    errno = ENOENT;
    return 0;
}

static double
constant_M_LN(char *name, int len, int arg)
{
    switch (name[4 + 0]) {
    case '1':
	if (strEQ(name + 4, "10")) {	/* M_LN removed */
#ifdef M_LN10
	    return M_LN10;
#else
	    goto not_there;
#endif
	}
    case '2':
	if (strEQ(name + 4, "2")) {	/* M_LN removed */
#ifdef M_LN2
	    return M_LN2;
#else
	    goto not_there;
#endif
	}
    }
    errno = EINVAL;
    return 0;

not_there:
    errno = ENOENT;
    return 0;
}

static double
constant_M_LO(char *name, int len, int arg)
{
    if (4 + 1 >= len ) {
	errno = EINVAL;
	return 0;
    }
    switch (name[4 + 1]) {
    case '1':
	if (strEQ(name + 4, "G10E")) {	/* M_LO removed */
#ifdef M_LOG10E
	    return M_LOG10E;
#else
	    goto not_there;
#endif
	}
    case '2':
	if (strEQ(name + 4, "G2E")) {	/* M_LO removed */
#ifdef M_LOG2E
	    return M_LOG2E;
#else
	    goto not_there;
#endif
	}
    }
    errno = EINVAL;
    return 0;

not_there:
    errno = ENOENT;
    return 0;
}

static double
constant_M_L(char *name, int len, int arg)
{
    switch (name[3 + 0]) {
    case 'N':
	return constant_M_LN(name, len, arg);
    case 'O':
	return constant_M_LO(name, len, arg);
    }
    errno = EINVAL;
    return 0;

not_there:
    errno = ENOENT;
    return 0;
}

static double
constant(char *name, int len, int arg)
{
    errno = 0;
    if (0 + 2 >= len ) {
	errno = EINVAL;
	return 0;
    }
    switch (name[0 + 2]) {
    case '1':
	if (strEQ(name + 0, "M_1_PI")) {	/*  removed */
#ifdef M_1_PI
	    return M_1_PI;
#else
	    goto not_there;
#endif
	}
    case '2':
	if (!strnEQ(name + 0,"M_", 2))
	    break;
	return constant_M_2(name, len, arg);
    case 'E':
	if (strEQ(name + 0, "M_E")) {	/*  removed */
#ifdef M_E
	    return M_E;
#else
	    goto not_there;
#endif
	}
    case 'L':
	if (!strnEQ(name + 0,"M_", 2))
	    break;
	return constant_M_L(name, len, arg);
    case 'P':
	if (!strnEQ(name + 0,"M_", 2))
	    break;
	return constant_M_P(name, len, arg);
    case 'S':
	if (!strnEQ(name + 0,"M_", 2))
	    break;
	return constant_M_S(name, len, arg);
    }
    errno = EINVAL;
    return 0;

not_there:
    errno = ENOENT;
    return 0;
}


MODULE = Math::Libm		PACKAGE = Math::Libm


double
constant(sv,arg)
    PREINIT:
	STRLEN		len;
    INPUT:
	SV *		sv
	char *		s = SvPV(sv, len);
	int		arg
    CODE:
	RETVAL = constant(s,len,arg);
    OUTPUT:
	RETVAL

double
acos(x)
	double	x
	PROTOTYPE: $

double
acosh(x)
	double	x
	PROTOTYPE: $

double
asin(x)
	double	x
	PROTOTYPE: $

double
asinh(x)
	double	x
	PROTOTYPE: $

double
atan(x)
	double	x
	PROTOTYPE: $

double
atanh(x)
	double	x
	PROTOTYPE: $

double
cbrt(x)
	double	x
	PROTOTYPE: $

double
ceil(x)
	double	x
	PROTOTYPE: $

double
cosh(x)
	double	x
	PROTOTYPE: $

double
erf(x)
	double	x
	PROTOTYPE: $

double
erfc(x)
	double	x
	PROTOTYPE: $

double
expm1(x)
	double	x
	PROTOTYPE: $

double
floor(x)
	double	x
	PROTOTYPE: $

double
hypot(x, y)
	double	x
	double	y
	PROTOTYPE: $$

double
j0(x)
	double	x
	PROTOTYPE: $

double
j1(x)
	double	x
	PROTOTYPE: $

double
jn(n, x)
	int	n
	double	x
	PROTOTYPE: $$

double
lgamma_r(x, signgamp)
	double	x
	int	&signgamp
	PROTOTYPE: $$
	CODE:
#ifdef _AIX
	RETVAL = lgamma(x);
	signgamp = signgam;
#else
	RETVAL = lgamma_r(x, &signgamp);
#endif
	OUTPUT:
	signgamp
	RETVAL

double
log10(x)
	double	x
	PROTOTYPE: $

double
log1p(x)
	double	x
	PROTOTYPE: $

double
pow(x, y)
	double	x
	double	y
	PROTOTYPE: $$

double
rint(x)
	double	x
	PROTOTYPE: $

double
sinh(x)
	double	x
	PROTOTYPE: $

double
tan(x)
	double	x
	PROTOTYPE: $

double
tanh(x)
	double	x
	PROTOTYPE: $

double
y0(x)
	double	x
	PROTOTYPE: $

double
y1(x)
	double	x
	PROTOTYPE: $

double
yn(n, x)
	int	n
	double	x
	PROTOTYPE: $$