File: compound.xs

package info (click to toggle)
libconvert-binary-c-perl 0.74-1
  • links: PTS, VCS
  • area: main
  • in suites: squeeze
  • size: 9,100 kB
  • ctags: 21,416
  • sloc: ansic: 63,666; perl: 18,582; yacc: 2,143; makefile: 44
file content (211 lines) | stat: -rw-r--r-- 4,759 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
################################################################################
#
# $Project: /Convert-Binary-C $
# $Author: mhx $
# $Date: 2009/03/15 04:10:44 +0100 $
# $Revision: 11 $
# $Source: /xsubs/compound.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: compound_names / struct_names / union_names
#
#   WRITTEN BY: Marcus Holland-Moritz             ON: Aug 2002
#   CHANGED BY:                                   ON:
#
################################################################################

void
CBC::compound_names()
  ALIAS:
    struct_names = 1
    union_names  = 2

  PREINIT:
    CBC_METHOD_VAR;
    ListIterator li;
    Struct *pStruct;
    int count = 0;
    U32 context;
    u_32 mask;

  PPCODE:
    switch (ix)
    {
      case 1:  /* struct_names */
        CBC_METHOD_SET("struct_names");
        mask = T_STRUCT;
        break;
      case 2:  /* union_names */
        CBC_METHOD_SET("union_names");
        mask = T_UNION;
        break;
      default: /* compound_names */
        CBC_METHOD_SET("compound_names");
        mask = T_STRUCT | T_UNION;
        break;
    }

    CT_DEBUG_METHOD;

    CHECK_PARSE_DATA;
    CHECK_VOID_CONTEXT;

    context = GIMME_V;

    LL_foreach(pStruct, li, THIS->cpi.structs)
      if (pStruct->identifier[0] &&
          pStruct->declarations &&
          pStruct->tflags & mask)
      {
        if (context == G_ARRAY)
          XPUSHs(sv_2mortal(newSVpv(pStruct->identifier, 0)));
        count++;
      }

    if (context == G_ARRAY)
      XSRETURN(count);
    else
      XSRETURN_IV(count);


################################################################################
#
#   METHOD: compound / struct / union
#
#   WRITTEN BY: Marcus Holland-Moritz             ON: Aug 2002
#   CHANGED BY:                                   ON:
#
################################################################################

void
CBC::compound(...)
  ALIAS:
    struct = 1
    union  = 2

  PREINIT:
    CBC_METHOD_VAR;
    Struct *pStruct;
    U32 context;
    u_32 mask;

  PPCODE:
    switch(ix)
    {
      case 1:  /* struct */
        CBC_METHOD_SET("struct");
        mask = T_STRUCT;
        break;
      case 2:  /* union */
        CBC_METHOD_SET("union");
        mask = T_UNION;
        break;
      default: /* compound */
        CBC_METHOD_SET("compound");
        mask = T_STRUCT | T_UNION;
        break;
    }

    CT_DEBUG_METHOD;

    CHECK_PARSE_DATA;
    CHECK_VOID_CONTEXT;

    context = GIMME_V;

    if (context == G_SCALAR && items != 2)
    {
      if (items > 1)
        XSRETURN_IV(items-1);
      else if (mask == (T_STRUCT|T_UNION))
        XSRETURN_IV(LL_count(THIS->cpi.structs));
      else
      {
        ListIterator li;
        int count = 0;

        LL_foreach(pStruct, li, THIS->cpi.structs)
          if (pStruct->tflags & mask)
            count++;

        XSRETURN_IV(count);
      }
    }

    NEED_PARSE_DATA;

    if (items > 1)
    {
      int i;

      for (i = 1; i < items; i++)
      {
        const char *name;
        u_32 limit = mask;

        name = SvPV_nolen(ST(i));

        /* skip optional union/struct */
        if(mask & T_UNION && 
           name[0] == 'u' && 
           name[1] == 'n' && 
           name[2] == 'i' && 
           name[3] == 'o' && 
           name[4] == 'n' && 
           isSPACE(name[5]))
        {
          name += 6;
          limit = T_UNION;
        }
        else
        if(mask & T_STRUCT && 
           name[0] == 's'  && 
           name[1] == 't'  && 
           name[2] == 'r'  && 
           name[3] == 'u'  && 
           name[4] == 'c'  && 
           name[5] == 't'  && 
           isSPACE(name[6]))
        {
          name += 7;
          limit = T_STRUCT;
        }

        while (isSPACE(*name))
          name++;

        pStruct = HT_get(THIS->cpi.htStructs, name, 0, 0);

        if (pStruct && pStruct->tflags & limit)
          PUSHs(sv_2mortal(get_struct_spec_def(aTHX_ &THIS->cfg, pStruct)));
        else
          PUSHs(&PL_sv_undef);
      }

      XSRETURN(items-1);
    }
    else
    {
      ListIterator li;
      int count = 0;

      LL_foreach(pStruct, li, THIS->cpi.structs)
        if (pStruct->tflags & mask)
        {
          XPUSHs(sv_2mortal(get_struct_spec_def(aTHX_ &THIS->cfg, pStruct)));
          count++;
        }

      XSRETURN(count);
    }