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
|
################################################################################
#
# $Project: /Convert-Binary-C $
# $Author: mhx $
# $Date: 2009/03/15 04:10:41 +0100 $
# $Revision: 5 $
# $Source: /xsubs/macro.xs $
#
################################################################################
#
# Copyright (c) 2002-2009 Marcus Holland-Moritz. All rights reserved.
# This program is free software; you can redistribute it and/or modify
# it under the same terms as Perl itself.
#
################################################################################
################################################################################
#
# METHOD: macro_names
#
# WRITTEN BY: Marcus Holland-Moritz ON: Feb 2006
# CHANGED BY: ON:
#
################################################################################
void
CBC::macro_names()
PREINIT:
CBC_METHOD(macro_names);
PPCODE:
CT_DEBUG_METHOD;
CHECK_PARSE_DATA;
CHECK_VOID_CONTEXT;
if (GIMME_V == G_ARRAY)
{
LinkedList ll = macros_get_names(aTHX_ &THIS->cpi, NULL);
int count = LL_count(ll);
SV *sv;
EXTEND(SP, count);
while ((sv = LL_pop(ll)) != NULL)
PUSHs(sv_2mortal(sv));
assert(LL_count(ll) == 0);
LL_delete(ll);
XSRETURN(count);
}
else
{
size_t count;
(void) macros_get_names(aTHX_ &THIS->cpi, &count);
XSRETURN_IV((int)count);
}
################################################################################
#
# METHOD: macro
#
# WRITTEN BY: Marcus Holland-Moritz ON: Feb 2006
# CHANGED BY: ON:
#
################################################################################
void
CBC::macro(...)
PREINIT:
CBC_METHOD(macro);
PPCODE:
CT_DEBUG_METHOD;
CHECK_PARSE_DATA;
CHECK_VOID_CONTEXT;
if (GIMME_V == G_SCALAR && items != 2)
{
if (items > 1)
{
XSRETURN_IV(items-1);
}
else
{
size_t count;
(void) macros_get_names(aTHX_ &THIS->cpi, &count);
XSRETURN_IV((int)count);
}
}
if (items > 1)
{
int i;
for (i = 1; i < items; i++)
{
const char *name = SvPV_nolen(ST(i));
size_t len;
char *def = macro_get_def(&THIS->cpi, name, &len);
if (def)
{
PUSHs(sv_2mortal(newSVpvn(def, len)));
macro_free_def(def);
}
else
PUSHs(&PL_sv_undef);
}
XSRETURN(items-1);
}
else
{
LinkedList ll = macros_get_definitions(aTHX_ &THIS->cpi);
int count = LL_count(ll);
SV *sv;
EXTEND(SP, count);
while ((sv = LL_pop(ll)) != NULL)
PUSHs(sv_2mortal(sv));
assert(LL_count(ll) == 0);
LL_delete(ll);
XSRETURN(count);
}
|
