Mercurial > hg > CbC > CbC_gcc
comparison gcc/ifcvt.h @ 145:1830386684a0
gcc-9.2.0
author | anatofuz |
---|---|
date | Thu, 13 Feb 2020 11:34:05 +0900 |
parents | 84e7813d76e9 |
children |
comparison
equal
deleted
inserted
replaced
131:84e7813d76e9 | 145:1830386684a0 |
---|---|
1 /* If-conversion header file. | 1 /* If-conversion header file. |
2 Copyright (C) 2014-2018 Free Software Foundation, Inc. | 2 Copyright (C) 2014-2020 Free Software Foundation, Inc. |
3 | 3 |
4 This file is part of GCC. | 4 This file is part of GCC. |
5 | 5 |
6 GCC is free software; you can redistribute it and/or modify it | 6 GCC is free software; you can redistribute it and/or modify it |
7 under the terms of the GNU General Public License as published by | 7 under the terms of the GNU General Public License as published by |
95 we're optimizing for size. */ | 95 we're optimizing for size. */ |
96 bool speed_p; | 96 bool speed_p; |
97 | 97 |
98 /* An estimate of the original costs. When optimizing for size, this is the | 98 /* An estimate of the original costs. When optimizing for size, this is the |
99 combined cost of COND, JUMP and the costs for THEN_BB and ELSE_BB. | 99 combined cost of COND, JUMP and the costs for THEN_BB and ELSE_BB. |
100 When optimizing for speed, we use the costs of COND plus the minimum of | 100 When optimizing for speed, we use the costs of COND plus weighted average |
101 the costs for THEN_BB and ELSE_BB, as computed in the next field. */ | 101 of the costs for THEN_BB and ELSE_BB, as computed in the next field. */ |
102 unsigned int original_cost; | 102 unsigned int original_cost; |
103 | 103 |
104 /* Maximum permissible cost for the unconditional sequence we should | 104 /* Maximum permissible cost for the unconditional sequence we should |
105 generate to replace this branch. */ | 105 generate to replace this branch. */ |
106 unsigned int max_seq_cost; | 106 unsigned int max_seq_cost; |