tcset.pas 7.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229
  1. {
  2. $Id$
  3. Copyright (c) 1993-98 by Florian Klaempfl
  4. Type checking and register allocation for set/case nodes
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 2 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program; if not, write to the Free Software
  15. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16. ****************************************************************************
  17. }
  18. unit tcset;
  19. interface
  20. uses
  21. tree;
  22. procedure firstsetelement(var p : ptree);
  23. procedure firstin(var p : ptree);
  24. procedure firstrange(var p : ptree);
  25. procedure firstcase(var p : ptree);
  26. implementation
  27. uses
  28. cobjects,verbose,globals,systems,
  29. symtable,aasm,types,
  30. hcodegen,htypechk,pass_1
  31. {$ifdef i386}
  32. ,i386,tgeni386
  33. {$endif}
  34. {$ifdef m68k}
  35. ,m68k,tgen68k
  36. {$endif}
  37. ;
  38. {*****************************************************************************
  39. FirstSetElement
  40. *****************************************************************************}
  41. procedure firstsetelement(var p : ptree);
  42. begin
  43. firstpass(p^.left);
  44. if codegenerror then
  45. exit;
  46. if assigned(p^.right) then
  47. begin
  48. firstpass(p^.right);
  49. if codegenerror then
  50. exit;
  51. end;
  52. calcregisters(p,0,0,0);
  53. p^.resulttype:=p^.left^.resulttype;
  54. set_location(p^.location,p^.left^.location);
  55. end;
  56. {*****************************************************************************
  57. FirstIn
  58. *****************************************************************************}
  59. procedure firstin(var p : ptree);
  60. begin
  61. p^.location.loc:=LOC_FLAGS;
  62. p^.resulttype:=booldef;
  63. firstpass(p^.right);
  64. if codegenerror then
  65. exit;
  66. if p^.right^.resulttype^.deftype<>setdef then
  67. CGMessage(sym_e_set_expected);
  68. firstpass(p^.left);
  69. if codegenerror then
  70. exit;
  71. p^.left:=gentypeconvnode(p^.left,psetdef(p^.right^.resulttype)^.setof);
  72. firstpass(p^.left);
  73. if codegenerror then
  74. exit;
  75. left_right_max(p);
  76. { this is not allways true due to optimization }
  77. { but if we don't set this we get problems with optimizing self code }
  78. if psetdef(p^.right^.resulttype)^.settype<>smallset then
  79. procinfo.flags:=procinfo.flags or pi_do_call
  80. else
  81. begin
  82. { a smallset needs maybe an misc. register }
  83. if (p^.left^.treetype<>ordconstn) and
  84. not(p^.right^.location.loc in [LOC_CREGISTER,LOC_REGISTER]) and
  85. (p^.right^.registers32<1) then
  86. inc(p^.registers32);
  87. end;
  88. end;
  89. {*****************************************************************************
  90. FirstRange
  91. *****************************************************************************}
  92. procedure firstrange(var p : ptree);
  93. var
  94. ct : tconverttype;
  95. begin
  96. firstpass(p^.left);
  97. firstpass(p^.right);
  98. if codegenerror then
  99. exit;
  100. { both types must be compatible }
  101. if not(is_equal(p^.left^.resulttype,p^.right^.resulttype)) and
  102. not(isconvertable(p^.left^.resulttype,p^.right^.resulttype,ct,ordconstn,false)) then
  103. CGMessage(type_e_mismatch);
  104. { Check if only when its a constant set }
  105. if (p^.left^.treetype=ordconstn) and (p^.right^.treetype=ordconstn) then
  106. begin
  107. { upper limit must be greater or equal than lower limit }
  108. { not if u32bit }
  109. if (p^.left^.value>p^.right^.value) and
  110. (( p^.left^.value<0) or (p^.right^.value>=0)) then
  111. CGMessage(cg_e_upper_lower_than_lower);
  112. end;
  113. left_right_max(p);
  114. p^.resulttype:=p^.left^.resulttype;
  115. set_location(p^.location,p^.left^.location);
  116. end;
  117. {*****************************************************************************
  118. FirstCase
  119. *****************************************************************************}
  120. procedure firstcase(var p : ptree);
  121. var
  122. old_t_times : longint;
  123. hp : ptree;
  124. begin
  125. { evalutes the case expression }
  126. cleartempgen;
  127. must_be_valid:=true;
  128. firstpass(p^.left);
  129. if codegenerror then
  130. exit;
  131. p^.registers32:=p^.left^.registers32;
  132. p^.registersfpu:=p^.left^.registersfpu;
  133. {$ifdef SUPPORT_MMX}
  134. p^.registersmmx:=p^.left^.registersmmx;
  135. {$endif SUPPORT_MMX}
  136. { walk through all instructions }
  137. { estimates the repeat of each instruction }
  138. old_t_times:=t_times;
  139. if not(cs_littlesize in aktglobalswitches) then
  140. begin
  141. t_times:=t_times div case_count_labels(p^.nodes);
  142. if t_times<1 then
  143. t_times:=1;
  144. end;
  145. { first case }
  146. hp:=p^.right;
  147. while assigned(hp) do
  148. begin
  149. cleartempgen;
  150. firstpass(hp^.right);
  151. { searchs max registers }
  152. if hp^.right^.registers32>p^.registers32 then
  153. p^.registers32:=hp^.right^.registers32;
  154. if hp^.right^.registersfpu>p^.registersfpu then
  155. p^.registersfpu:=hp^.right^.registersfpu;
  156. {$ifdef SUPPORT_MMX}
  157. if hp^.right^.registersmmx>p^.registersmmx then
  158. p^.registersmmx:=hp^.right^.registersmmx;
  159. {$endif SUPPORT_MMX}
  160. hp:=hp^.left;
  161. end;
  162. { may be handle else tree }
  163. if assigned(p^.elseblock) then
  164. begin
  165. cleartempgen;
  166. firstpass(p^.elseblock);
  167. if codegenerror then
  168. exit;
  169. if p^.registers32<p^.elseblock^.registers32 then
  170. p^.registers32:=p^.elseblock^.registers32;
  171. if p^.registersfpu<p^.elseblock^.registersfpu then
  172. p^.registersfpu:=p^.elseblock^.registersfpu;
  173. {$ifdef SUPPORT_MMX}
  174. if p^.registersmmx<p^.elseblock^.registersmmx then
  175. p^.registersmmx:=p^.elseblock^.registersmmx;
  176. {$endif SUPPORT_MMX}
  177. end;
  178. t_times:=old_t_times;
  179. { there is one register required for the case expression }
  180. if p^.registers32<1 then p^.registers32:=1;
  181. end;
  182. end.
  183. {
  184. $Log$
  185. Revision 1.2 1998-10-06 20:49:13 peter
  186. * m68k compiler compiles again
  187. Revision 1.1 1998/09/23 20:42:24 peter
  188. * splitted pass_1
  189. }