espressif/binutils-gdb
1
0
Fork 0
mirror of https://github.com/espressif/binutils-gdb.git synced 2025-06-25 21:41:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

Regenerated.

Browse Source
This commit is contained in:
H.J. Lu
2005-05-03 01:09:45 +00:00
parent 5daa8fe797
commit e02b83d7f4
1 changed files with 18 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
bfd/bfd-in2.h
View File

@ -1440,7 +1440,7 @@ extern const struct bfd_symbol * const bfd_ind_symbol;
/* Macros to handle insertion and deletion of a bfd's sections. These /* Macros to handle insertion and deletion of a bfd's sections. These
only handle the list pointers, ie. do not adjust section_count, only handle the list pointers, ie. do not adjust section_count,
target_index etc. */ target_index etc. */
#define bfd_section_double_list_remove(ABFD, S) \ #define bfd_section_list_remove(ABFD, S) \
do \ do \
{ \ { \
asection *_s = S; \ asection *_s = S; \
@ -1459,9 +1459,7 @@ extern const struct bfd_symbol * const bfd_ind_symbol;
(ABFD)->section_last = _prev; \ (ABFD)->section_last = _prev; \
} \ } \
while (0) while (0)
#define bfd_section_list_remove(ABFD, PS) \ #define bfd_section_list_append(ABFD, S) \
bfd_section_double_list_remove ((ABFD), *(PS))
#define bfd_section_double_list_append(ABFD, S) \
do \ do \
{ \ { \
asection *_s = S; \ asection *_s = S; \
@ -1477,13 +1475,11 @@ extern const struct bfd_symbol * const bfd_ind_symbol;
_abfd->section_last = _s; \ _abfd->section_last = _s; \
} \ } \
while (0) while (0)
#define bfd_section_double_list_insert_after(ABFD, A, S) \ #define bfd_section_list_insert_after(ABFD, A, S) \
do \ do \
{ \ { \
asection *_a = A; \ asection *_a = A; \
asection *_s = S; \ asection *_s = S; \
if (_a) \
{ \
asection *_next = _a->next; \ asection *_next = _a->next; \
_s->next = _next; \ _s->next = _next; \
_s->prev = _a; \ _s->prev = _a; \
@ -1493,17 +1489,12 @@ extern const struct bfd_symbol * const bfd_ind_symbol;
else \ else \
(ABFD)->section_last = _s; \ (ABFD)->section_last = _s; \
} \ } \
else \
bfd_section_double_list_append ((ABFD), (S)); \
} \
while (0) while (0)
#define bfd_section_double_list_insert_before(ABFD, B, S) \ #define bfd_section_list_insert_before(ABFD, B, S) \
do \ do \
{ \ { \
asection *_b = B; \ asection *_b = B; \
asection *_s = S; \ asection *_s = S; \
if (_b) \
{ \
asection *_prev = _b->prev; \ asection *_prev = _b->prev; \
_s->prev = _prev; \ _s->prev = _prev; \
_s->next = _b; \ _s->next = _b; \
@ -1513,12 +1504,7 @@ extern const struct bfd_symbol * const bfd_ind_symbol;
else \ else \
(ABFD)->sections = _s; \ (ABFD)->sections = _s; \
} \ } \
else \
bfd_section_double_list_append ((ABFD), (S)); \
} \
while (0) while (0)
#define bfd_section_list_insert(ABFD, PS, S) \
bfd_section_double_list_insert_before ((ABFD), *(PS), (S))
#define bfd_section_removed_from_list(ABFD, S) \ #define bfd_section_removed_from_list(ABFD, S) \
((S)->next == NULL && (S) != (ABFD)->section_last) ((S)->next == NULL && (S) != (ABFD)->section_last)