1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728
|
-- This file is part of SmartEiffel The GNU Eiffel Compiler Tools and Libraries
--
-- SmartEiffel 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.
-- SmartEiffel 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 SmartEiffel; see the file COPYING. If not, write to
-- the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
-- MA 02111-1307, USA.
--
-- Copyright(C) 1994-2002: INRIA - LORIA (INRIA Lorraine) - ESIAL U.H.P.
-- - University of Nancy 1 - FRANCE
-- Copyright(C) 2003: INRIA - LORIA (INRIA Lorraine) - I.U.T. Charlemagne
-- - University of Nancy 2 - FRANCE
--
-- Dominique COLNET, Suzanne COLLIN, Olivier ZENDRA,
-- Philippe RIBET, Cyril ADRIAN
--
-- http://SmartEiffel.loria.fr - SmartEiffel@loria.fr
--
class FEATURE_NAME
--
-- For all kinds of feature names (simple names as well as infix or
-- prefix names).
-- Note: the very same class is used for all kinds of names (no
-- polymorphism at all) in order to be able to use this class as en entry
-- of a DICTIONARY.
--
inherit
COMPARABLE
redefine is_equal
end
HASHABLE
redefine is_equal
end
EXPRESSION
NAME
redefine is_equal
end
creation simple_feature_name, infix_name, prefix_name, frozen_name
creation {BASE_CLASS, RUN_CLASS} unknown_position
creation {PRECURSOR_CALL} precursor_name
creation {FEATURE_NAME} runnable_feature_name
feature
start_position: POSITION
-- Of the first character.
to_string: STRING
-- The corresponding name (alone in a STRING).
to_key: STRING
-- To avoid clash between different kinds of names (for example when
-- using same infix/prefix operator). Also used to compute the C
-- name or the JVM name of a feature.
hash_code: INTEGER
-- Actually, in order to speed up the compiler, this is a cache
-- for value `to_key.hash_code'.
is_equal(other: like Current): BOOLEAN is
do
Result := to_key = other.to_key
end
infix "<" (other: like Current): BOOLEAN is
do
Result := to_key < other.to_key
end
is_frozen: BOOLEAN is
do
inspect
name_type
when C_frozen_name then
Result := True
when C_precursor_name then
Result := feature_name.is_frozen
else
end
end
is_simple_feature_name: BOOLEAN is
do
Result := name_type = C_simple_feature_name
end
is_infix_name: BOOLEAN is
do
Result := name_type = C_infix_name
end
is_prefix_name: BOOLEAN is
do
Result := name_type = C_prefix_name
end
is_precursor_name: BOOLEAN is
do
Result := name_type = C_precursor_name
end
is_current: BOOLEAN is False
is_manifest_string: BOOLEAN is False
is_result: BOOLEAN is False
is_void: BOOLEAN is False
side_effect_free: BOOLEAN is True
once_pre_computable: BOOLEAN is False
precedence: INTEGER is
do
Result := atomic_precedence
end
use_current: BOOLEAN is True
is_writable: BOOLEAN is
do
Result := C_simple_feature_name = name_type
end
infix_or_prefix: STRING is
-- Return "infix" or "prefix" or something appropriate.
do
inspect
name_type
when C_simple_feature_name then
when C_infix_name then
Result := fz_infix
when C_prefix_name then
Result := fz_prefix
when C_precursor_name then
Result := as_precursor
when C_frozen_name then
Result := feature_name.infix_or_prefix
end
end
mapping_c_in(str: STRING) is
do
str.append(to_key)
end
result_type: E_TYPE is
do
check C_simple_feature_name = name_type end
Result := run_feature_2.result_type
end
to_runnable(ct: E_TYPE): like Current is
local
wbc: BASE_CLASS; rf: RUN_FEATURE; new_name: FEATURE_NAME
rf2: RUN_FEATURE_2
do
check C_simple_feature_name = name_type end
wbc := start_position.base_class
new_name := ct.base_class.new_name_of(wbc,Current)
rf := ct.run_class.get_feature(new_name)
if rf = Void then
error_handler.add_feature_name(new_name)
error_handler.append(" :")
fatal_error(fz_feature_not_found)
else
rf2 ?= rf
if rf2 = Void then
error_handler.add_position(rf.start_position)
error_handler.add_position(start_position)
error_handler.append("Feature found is not writable.")
error_handler.print_as_fatal_error
end
end
if run_feature_2 = Void then
run_feature_2 := rf2
Result := Current
elseif run_feature_2 = rf then
Result := Current
else
!!Result.runnable_feature_name(Current,rf2)
end
end
simplify_1_, simplify_2: like Current is
do
Result := Current
end
start_lookup_class: BASE_CLASS is
local
bc: BASE_CLASS; e_feature: E_FEATURE; rt: E_TYPE
do
check C_simple_feature_name = name_type end
bc := start_position.base_class
if bc /= Void then
e_feature := bc.e_feature(Current)
if e_feature /= Void then
rt := e_feature.result_type
if rt /= Void then
Result := rt.start_lookup_class
end
end
end
end
stupid_switch(run_time_set: RUN_TIME_SET): BOOLEAN is
local
rf2: RUN_FEATURE_2
do
check
C_simple_feature_name = name_type
end
rf2 := run_feature_2
if rf2 /= Void then
if smart_eiffel.same_base_feature(rf2,run_time_set) then
Result := rf2.stupid_switch(run_time_set) /= Void
end
end
end
afd_check is do end
safety_check is do end
collect_c_tmp is do end
compile_to_c is
do
check C_simple_feature_name = name_type end
cpp.put_string(once "/*SFN*/")
if smart_eiffel.scoop and then run_feature_2.current_type.is_separate then
cpp.put_string(once "(((T")
cpp.put_integer(run_feature_2.current_type.id)
cpp.put_string(once "*)C)->ref->")
else
cpp.put_string(once "(C->")
end
run_feature_2.put_c_field_name
cpp.put_character(')')
end
mapping_c_target(target_type: E_TYPE) is
local
flag: BOOLEAN
do
check C_simple_feature_name = name_type end
flag := cpp.call_invariant_start(target_type)
compile_to_c
if flag then
cpp.call_invariant_end
end
end
mapping_c_arg(formal_arg_type: E_TYPE) is
do
check C_simple_feature_name = name_type end
compile_to_c
end
c_frame_descriptor(format, locals: STRING) is do end
isa_dca_inline_argument: INTEGER is 0
dca_inline_argument(formal_arg_type: E_TYPE) is do end
is_static: BOOLEAN is False
assertion_check(tag: CHARACTER) is do end
to_integer_or_error: INTEGER is
do
to_integer_error
end
origin_base_class: BASE_CLASS is
-- Void or the BASE_CLASS where `Current' is written in.
do
Result := start_position.base_class
end
is_free_operator: BOOLEAN is
-- Note: this feature which checks the correctness of free
-- operator notation is not used by the parser but is defined just
-- to make the assertion code clear and nice.
local
set: STRING; i: INTEGER
do
set := once "+-*/\=<>@#|&~"
Result := set.has(to_string.first)
from
i := 2
until
not Result or else i > to_string.count - 1
loop
if set.has(to_string.item(i)) then
else
inspect
to_string.item(i)
when '.', '?', '{', '}' then
else
Result := False
end
end
i := i + 1
end
if Result then
Result := set.has(to_string.first)
end
end
declaration_in(buffer: STRING) is
require
buffer /= Void
do
inspect
name_type
when C_simple_feature_name then
buffer.append(to_string)
when C_infix_name then
buffer.append(fz_infix)
buffer.extend(' ')
buffer.extend('%"')
buffer.append(to_string)
buffer.extend('%"')
when C_prefix_name then
buffer.append(fz_prefix)
buffer.extend(' ')
buffer.extend('%"')
buffer.append(to_string)
buffer.extend('%"')
when C_precursor_name then
when C_frozen_name then
feature_name.declaration_in(buffer)
end
end
declaration_pretty_print is
do
inspect
name_type
when C_simple_feature_name then
pretty_printer.put_string(to_string)
when C_infix_name then
pretty_printer.keyword(fz_infix)
pretty_printer.put_character('%"')
pretty_printer.put_string(to_string)
pretty_printer.put_character('%"')
when C_prefix_name then
pretty_printer.keyword(fz_prefix)
pretty_printer.put_character('%"')
pretty_printer.put_string(to_string)
pretty_printer.put_character('%"')
when C_frozen_name then
pretty_printer.keyword(once "frozen")
feature_name.declaration_pretty_print
end
end
pretty_print is
do
inspect
name_type
when C_simple_feature_name, C_infix_name, C_prefix_name then
pretty_printer.put_string(to_string)
when C_precursor_name then
pretty_printer.put_string(as_precursor)
when C_frozen_name then
feature_name.pretty_print
end
end
print_as_target is
do
check C_simple_feature_name = name_type end
pretty_printer.put_string(to_string)
pretty_printer.put_character('.')
end
short is
local
i: INTEGER; c: CHARACTER
do
inspect
name_type
when C_simple_feature_name then
short_print.hook(once "Bsfn")
from i := 1 until i > to_string.count
loop
c := to_string.item(i)
if c = '_' then
short_print.hook_or(once "Usfn",once "_")
else
short_print.a_character(c)
end
i := i + 1
end
short_print.hook(once "Asfn")
when C_infix_name then
short_print.a_infix_name(once "Bifn",once "infix %"",once "Aifn",once "%"",Current)
when C_prefix_name then
short_print.hook_or(once "Bpfn",once "prefix %"")
from i := 1 until i > to_string.count
loop
c := to_string.item(i)
short_print.a_character(c)
i := i + 1
end
short_print.hook_or(once "Apfn",once "%"")
when C_frozen_name then
feature_name.short
end
end
short_target is
do
check C_simple_feature_name = name_type end
short
short_print.a_dot
end
jvm_assign_creation is
local
space, idx: INTEGER; rf2: like run_feature_2
ca: like code_attribute
do
rf2 := run_feature_2
ca := code_attribute
space := rf2.result_type.jvm_stack_space
ca.opcode_aload_0
if space = 1 then
ca.opcode_swap
else
ca.opcode_dup_x2
ca.opcode_pop
end
idx := constant_pool.idx_fieldref(rf2)
ca.opcode_putfield(idx,-(space + 1))
end
jvm_assign is
local
space, idx: INTEGER; rf2: like run_feature_2
ca: like code_attribute
wa: ARRAY[RUN_FEATURE_2]
rc: RUN_CLASS
flag: BOOLEAN
do
check C_simple_feature_name = name_type end
rf2 := run_feature_2
ca := code_attribute
space := rf2.result_type.jvm_stack_space
rc := rf2.result_type.run_class
flag := rc.run_time_mark.has_substring("NATIVE_ARRAY")
if rf2.result_type.is_basic_eiffel_expanded or
rf2.result_type.is_reference or flag
then
ca.opcode_aload_0
if space = 1 then
ca.opcode_swap
else
ca.opcode_dup_x2
ca.opcode_pop
end
idx := constant_pool.idx_fieldref(rf2)
ca.opcode_putfield(idx,-(space + 1))
elseif rf2.result_type.is_bit then
idx := constant_pool.idx_methodref3(fz_java_util_bitset,fz_a6,fz_a7)
ca.opcode_invokevirtual(idx,0)
ca.opcode_aload_0
idx := constant_pool.idx_fieldref(rf2)
ca.opcode_getfield(idx, space - 1)
ca.opcode_dup
idx := constant_pool.idx_methodref3(fz_java_util_bitset,fz_dc,fz_b1)
ca.opcode_invokevirtual(idx,0)
ca.opcode_aload_0
idx := constant_pool.idx_fieldref(rf2)
ca.opcode_getfield(idx, space - 1)
ca.opcode_swap
idx := constant_pool.idx_class2( fz_java_util_bitset )
ca.opcode_checkcast( idx )
idx := constant_pool.idx_methodref3(fz_java_util_bitset,fz_dd,fz_b1)
ca.opcode_invokevirtual(idx,0)
else
ca.opcode_aload_0
idx := constant_pool.idx_fieldref(rf2)
ca.opcode_getfield(idx, space - 1)
ca.opcode_swap
wa := rc.writable_attributes
jvm.fields_by_fields_expanded_copy(wa)
ca.opcode_pop2
end
end
compile_target_to_jvm, compile_to_jvm is
do
error_handler.add_position(start_position)
fatal_error(fz_jvm_error)
end
jvm_branch_if_false: INTEGER is
do
compile_to_jvm
Result := code_attribute.opcode_ifeq
end
jvm_branch_if_true: INTEGER is
do
compile_to_jvm
Result := code_attribute.opcode_ifne
end
compile_to_jvm_into(dest: E_TYPE): INTEGER is
do
Result := standard_compile_to_jvm_into(dest)
end
feature {RUN_CLASS}
set_run_feature_2(rf2: RUN_FEATURE_2) is
require
rf2 /= Void
do
run_feature_2 := rf2
ensure
run_feature_2 = rf2
end
feature {TYPE_BIT_2}
run_feature(t: E_TYPE): RUN_FEATURE is
-- Look for the corresponding runnable feature in `t'
require
t.is_run_type
do
Result := t.run_class.get_rf_with(Current)
end
feature {RUN_FEATURE_3}
run_feature_2: RUN_FEATURE_2
-- The corresponding one when runnable.
feature {E_FEATURE}
undefine_in(bc: BASE_CLASS) is
require
bc /= Void
do
if is_frozen then
error(start_position,
"A frozen feature must not be undefined (VDUS).")
bc.fatal_undefine(Current)
end
end
feature {FEATURE_NAME}
runnable_feature_name(model: like Current; rf2: RUN_FEATURE_2) is
require
model.is_simple_feature_name; rf2 /= Void
do
start_position := model.start_position
to_string := model.to_string
to_key := to_string
run_feature_2 := rf2
hash_code := model.hash_code
name_type := C_simple_feature_name
ensure
to_string = model.to_string
start_position = model.start_position
run_feature_2 = rf2
end
feature {BASE_CLASS,RUN_CLASS}
unknown_position(n: STRING) is
require
n = string_aliaser.item(n)
local
up: POSITION
do
start_position := up
to_string := n
to_key := n
hash_code := to_key.hash_code
name_type := C_simple_feature_name
ensure
to_string = n
end
feature {FEATURE_NAME_VISITOR}
accept(visitor: FEATURE_NAME_VISITOR) is
do
visitor.visit_feature_name(Current)
end
feature {NONE}
simple_feature_name(n: STRING; sp: like start_position) is
require
n = string_aliaser.item(n)
not sp.is_unknown
do
start_position := sp
to_string := n
to_key := n
hash_code := to_key.hash_code
name_type := C_simple_feature_name
ensure
to_string = n
start_position = sp
end
name_type: INTEGER
-- Dynamic binding is no longuer used for feature name in
-- order to allow `hash_code' memorization.
C_simple_feature_name: INTEGER is 1
C_infix_name: INTEGER is 2
C_prefix_name: INTEGER is 3
C_frozen_name: INTEGER is 4
C_precursor_name: INTEGER is 5
prefix_name(n: STRING; sp: like start_position) is
require
n = string_aliaser.item(n)
not sp.is_unknown
do
start_position := sp
to_string := n
to_key := string_aliaser.for_prefix(to_string)
hash_code := to_key.hash_code
name_type := C_prefix_name
ensure
to_string = n
start_position = sp
to_key = string_aliaser.item(to_key)
end
infix_name(n: STRING; sp: like start_position) is
require
n = string_aliaser.item(n)
not sp.is_unknown
do
start_position := sp
to_string := n
to_key := string_aliaser.for_infix(to_string)
hash_code := to_key.hash_code
name_type := C_infix_name
ensure
to_string = string_aliaser.item(n)
start_position = sp
to_key = string_aliaser.item(to_key)
end
feature_name: FEATURE_NAME
-- Used to refer the corresponding one for `frozen_name' and `precursor_name'.
frozen_name(fn: like feature_name) is
require
fn /= Void
do
feature_name := fn
start_position := fn.start_position
to_string := fn.to_string
to_key := fn.to_key
hash_code := fn.hash_code
name_type := C_frozen_name
ensure
feature_name = fn
end
precursor_name(id: INTEGER; fn: like feature_name) is
-- Where `fn' is name of the enclosing RUN_FEATURE which contains
-- the Precursor call. The `id' is the one of the base class of
-- the Precursor routine.
require
fn /= Void
do
start_position := fn.start_position
feature_name := fn
to_string := fn.to_string
!!to_key.make(8 + feature_name.to_key.count)
to_key.extend('_')
id.append_in(to_key)
to_key.extend('P')
to_key.append(feature_name.to_key)
to_key := string_aliaser.item(to_key)
hash_code := to_key.hash_code
name_type := C_precursor_name
ensure
feature_name = fn
end
invariant
name_type > 0
to_string = string_aliaser.item(to_string)
to_key = string_aliaser.item(to_key)
hash_code > 0
eiffel_parser.case_insensitive
implies
to_string.is_equal(to_string.as_lower)
end -- FEATURE_NAME
|