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
|
// $Id$
// ============================================================================
//
// = LIBRARY
// TAO IDL
//
// = FILENAME
// be_field.cpp
//
// = DESCRIPTION
// Extension of class AST_Field that provides additional means for C++
// mapping.
//
// = AUTHOR
// Copyright 1994-1995 by Sun Microsystems, Inc.
// and
// Aniruddha Gokhale
//
// ============================================================================
#include "idl.h"
#include "idl_extern.h"
#include "be.h"
ACE_RCSID(be, be_field, "$Id$")
/*
* BE_Field
*/
be_field::be_field (void)
{
}
be_field::be_field (AST_Type *ft, UTL_ScopedName *n, UTL_StrList *p, Visibility vis)
: AST_Field (ft, n, p, vis),
AST_Decl (AST_Decl::NT_field, n, p)
{
}
// compute the size type of the node in question
int
be_field::compute_size_type (void)
{
be_type *type = be_type::narrow_from_decl (this->field_type ());
if (!type)
{
ACE_ERROR_RETURN ((LM_ERROR,
"(%N:%l) be_field::compute_size_type - "
"bad field type\n"), -1);
}
// our size type is the same as our type
this->size_type (type->size_type ()); // as a side effect will also update
// the size type of parent
// and while we're here, take care of has_constructor
this->has_constructor (type->has_constructor ());
return 0;
}
int
be_field::accept (be_visitor *visitor)
{
return visitor->visit_field (this);
}
// Narrowing
IMPL_NARROW_METHODS2 (be_field, AST_Field, be_decl)
IMPL_NARROW_FROM_DECL (be_field)
|
