mirror of
https://github.com/darlinghq/darling-gdb.git
synced 2024-11-26 13:30:30 +00:00
145 lines
3.5 KiB
C
145 lines
3.5 KiB
C
/* ldexp.h -
|
|
Copyright 1991, 1992, 1993, 1994, 1995, 1998, 1999, 2000, 2001, 2002
|
|
Free Software Foundation, Inc.
|
|
|
|
This file is part of GLD, the Gnu Linker.
|
|
|
|
GLD is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2, or (at your option)
|
|
any later version.
|
|
|
|
GLD is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with GLD; see the file COPYING. If not, write to the Free
|
|
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
|
|
02111-1307, USA. */
|
|
|
|
#ifndef LDEXP_H
|
|
#define LDEXP_H
|
|
|
|
/* The result of an expression tree */
|
|
typedef struct {
|
|
bfd_vma value;
|
|
char *str;
|
|
struct lang_output_section_statement_struct *section;
|
|
bfd_boolean valid_p;
|
|
} etree_value_type;
|
|
|
|
typedef struct {
|
|
int node_code;
|
|
enum {
|
|
etree_binary,
|
|
etree_trinary,
|
|
etree_unary,
|
|
etree_name,
|
|
etree_assign,
|
|
etree_provide,
|
|
etree_provided,
|
|
etree_undef,
|
|
etree_unspec,
|
|
etree_value,
|
|
etree_assert,
|
|
etree_rel
|
|
} node_class;
|
|
} node_type;
|
|
|
|
typedef union etree_union {
|
|
node_type type;
|
|
struct {
|
|
node_type type;
|
|
union etree_union *lhs;
|
|
union etree_union *rhs;
|
|
} binary;
|
|
struct {
|
|
node_type type;
|
|
union etree_union *cond;
|
|
union etree_union *lhs;
|
|
union etree_union *rhs;
|
|
} trinary;
|
|
struct {
|
|
node_type type;
|
|
const char *dst;
|
|
union etree_union *src;
|
|
} assign;
|
|
struct {
|
|
node_type type;
|
|
union etree_union *child;
|
|
} unary;
|
|
struct {
|
|
node_type type;
|
|
const char *name;
|
|
} name;
|
|
struct {
|
|
node_type type;
|
|
bfd_vma value;
|
|
char *str;
|
|
} value;
|
|
struct {
|
|
node_type type;
|
|
asection *section;
|
|
bfd_vma value;
|
|
} rel;
|
|
struct {
|
|
node_type type;
|
|
union etree_union *child;
|
|
const char *message;
|
|
} assert_s;
|
|
} etree_type;
|
|
|
|
extern struct exp_data_seg {
|
|
enum {
|
|
exp_dataseg_none,
|
|
exp_dataseg_align_seen,
|
|
exp_dataseg_end_seen,
|
|
exp_dataseg_adjust
|
|
} phase;
|
|
bfd_vma base, end, pagesize;
|
|
} exp_data_seg;
|
|
|
|
typedef struct _fill_type fill_type;
|
|
|
|
etree_type *exp_intop
|
|
PARAMS ((bfd_vma));
|
|
etree_type *exp_bigintop
|
|
PARAMS ((bfd_vma, char *));
|
|
etree_type *exp_relop
|
|
PARAMS ((asection *, bfd_vma));
|
|
etree_value_type invalid
|
|
PARAMS ((void));
|
|
etree_value_type exp_fold_tree
|
|
PARAMS ((etree_type *, struct lang_output_section_statement_struct *,
|
|
lang_phase_type, bfd_vma, bfd_vma *));
|
|
etree_type *exp_binop
|
|
PARAMS ((int, etree_type *, etree_type *));
|
|
etree_type *exp_trinop
|
|
PARAMS ((int,etree_type *, etree_type *, etree_type *));
|
|
etree_type *exp_unop
|
|
PARAMS ((int, etree_type *));
|
|
etree_type *exp_nameop
|
|
PARAMS ((int, const char *));
|
|
etree_type *exp_assop
|
|
PARAMS ((int, const char *, etree_type *));
|
|
etree_type *exp_provide
|
|
PARAMS ((const char *, etree_type *));
|
|
etree_type *exp_assert
|
|
PARAMS ((etree_type *, const char *));
|
|
void exp_print_tree
|
|
PARAMS ((etree_type *));
|
|
bfd_vma exp_get_vma
|
|
PARAMS ((etree_type *, bfd_vma, char *, lang_phase_type));
|
|
int exp_get_value_int
|
|
PARAMS ((etree_type *, int, char *, lang_phase_type));
|
|
fill_type *exp_get_fill
|
|
PARAMS ((etree_type *, fill_type *, char *, lang_phase_type));
|
|
bfd_vma exp_get_abs_int
|
|
PARAMS ((etree_type *, int, char *, lang_phase_type));
|
|
bfd_vma align_n
|
|
PARAMS ((bfd_vma, bfd_vma));
|
|
|
|
#endif
|