| c-typeck.c (52750) | c-typeck.c (60967) |
|---|---|
| 1/* Build expressions with type checking for C compiler. 2 Copyright (C) 1987, 88, 91-97, 1998 Free Software Foundation, Inc. 3 4This file is part of GNU CC. 5 6GNU CC is free software; you can redistribute it and/or modify 7it under the terms of the GNU General Public License as published by 8the Free Software Foundation; either version 2, or (at your option) --- 5832 unchanged lines hidden (view full) --- 5841 5842 if (TREE_CODE (constructor_type) == ARRAY_TYPE) 5843 { 5844 while (*q != 0) 5845 { 5846 p = *q; 5847 if (tree_int_cst_lt (purpose, p->purpose)) 5848 q = &p->left; | 1/* Build expressions with type checking for C compiler. 2 Copyright (C) 1987, 88, 91-97, 1998 Free Software Foundation, Inc. 3 4This file is part of GNU CC. 5 6GNU CC is free software; you can redistribute it and/or modify 7it under the terms of the GNU General Public License as published by 8the Free Software Foundation; either version 2, or (at your option) --- 5832 unchanged lines hidden (view full) --- 5841 5842 if (TREE_CODE (constructor_type) == ARRAY_TYPE) 5843 { 5844 while (*q != 0) 5845 { 5846 p = *q; 5847 if (tree_int_cst_lt (purpose, p->purpose)) 5848 q = &p->left; |
| 5849 else if (tree_int_cst_lt (p->purpose, purpose)) | 5849 else if (p->purpose != purpose) |
| 5850 q = &p->right; 5851 else 5852 abort (); 5853 } 5854 } 5855 else 5856 { 5857 while (*q != NULL) 5858 { 5859 p = *q; 5860 if (tree_int_cst_lt (DECL_FIELD_BITPOS (purpose), 5861 DECL_FIELD_BITPOS (p->purpose))) 5862 q = &p->left; | 5850 q = &p->right; 5851 else 5852 abort (); 5853 } 5854 } 5855 else 5856 { 5857 while (*q != NULL) 5858 { 5859 p = *q; 5860 if (tree_int_cst_lt (DECL_FIELD_BITPOS (purpose), 5861 DECL_FIELD_BITPOS (p->purpose))) 5862 q = &p->left; |
| 5863 else if (tree_int_cst_lt (DECL_FIELD_BITPOS (p->purpose), 5864 DECL_FIELD_BITPOS (purpose))) | 5863 else if (p->purpose != purpose) |
| 5865 q = &p->right; 5866 else 5867 abort (); 5868 } 5869 } 5870 5871 r = (struct init_node *) oballoc (sizeof (struct init_node)); 5872 r->purpose = purpose; --- 168 unchanged lines hidden (view full) --- 6041{ 6042 struct init_node *p; 6043 6044 p = constructor_pending_elts; 6045 if (TREE_CODE (constructor_type) == ARRAY_TYPE) 6046 { 6047 while (p) 6048 { | 5864 q = &p->right; 5865 else 5866 abort (); 5867 } 5868 } 5869 5870 r = (struct init_node *) oballoc (sizeof (struct init_node)); 5871 r->purpose = purpose; --- 168 unchanged lines hidden (view full) --- 6040{ 6041 struct init_node *p; 6042 6043 p = constructor_pending_elts; 6044 if (TREE_CODE (constructor_type) == ARRAY_TYPE) 6045 { 6046 while (p) 6047 { |
| 6049 if (tree_int_cst_equal (field, p->purpose)) | 6048 if (field == p->purpose) |
| 6050 return 1; 6051 else if (tree_int_cst_lt (field, p->purpose)) 6052 p = p->left; 6053 else 6054 p = p->right; 6055 } 6056 } 6057 else --- 891 unchanged lines hidden --- | 6049 return 1; 6050 else if (tree_int_cst_lt (field, p->purpose)) 6051 p = p->left; 6052 else 6053 p = p->right; 6054 } 6055 } 6056 else --- 891 unchanged lines hidden --- |