home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
AmigActive 3
/
AACD03.BIN
/
AACD
/
Programming
/
sofa
/
archive
/
SmallEiffel.lha
/
SmallEiffel
/
lib_se
/
bit_constant.e
< prev
next >
Wrap
Text File
|
1999-06-05
|
6KB
|
284 lines
-- This file is part of SmallEiffel The GNU Eiffel Compiler.
-- Copyright (C) 1994-98 LORIA - UHP - CRIN - INRIA - FRANCE
-- Dominique COLNET and Suzanne COLLIN - colnet@loria.fr
-- http://SmallEiffel.loria.fr
-- SmallEiffel 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. SmallEiffel 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 SmallEiffel; see the file COPYING. If not,
-- write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
-- Boston, MA 02111-1307, USA.
--
class BIT_CONSTANT
--
-- For Manifest Constant BIT_N.
--
inherit EXPRESSION;
creation {EIFFEL_PARSER} make
feature
start_position: POSITION;
-- Of the first bit.
value: STRING;
-- Only '0' and '1'.
result_type: TYPE_BIT_1;
feature {NONE}
id: INTEGER;
hexa: STRING;
feature
is_writable: BOOLEAN is false;
is_current: BOOLEAN is false;
is_manifest_string: BOOLEAN is false;
is_result: BOOLEAN is false;
is_void: BOOLEAN is false;
use_current: BOOLEAN is false;
is_static: BOOLEAN is false;
is_pre_computable: BOOLEAN is false;
can_be_dropped: BOOLEAN is true;
c_simple: BOOLEAN is true;
feature {NONE}
make(sp: like start_position; s: STRING) is
require
s /= Void
-- `s' contains only '0' and '1'.
do
start_position := sp;
value := s;
ensure
value.count = s.count
end;
feature
static_result_base_class: BASE_CLASS is
do
Result := small_eiffel.get_class(as_bit_n);
end;
assertion_check(tag: CHARACTER) is
do
end;
static_value: INTEGER is
do
end;
isa_dca_inline_argument: INTEGER is
do
end;
dca_inline_argument(formal_arg_type: TYPE) is
do
end;
afd_check is
do
end;
mapping_c_target(target_type: TYPE) is
do
mapping_c_arg(target_type);
end;
mapping_c_arg(formal_arg_type: TYPE) is
do
compile_to_c;
end;
collect_c_tmp is
do
end;
compile_to_c is
do
if result_type.is_c_unsigned_ptr then
cpp.register_bit_constant(Current);
else
cpp.put_string(fz_0x);
cpp.put_string(hexa);
end;
end;
c_declare_for_old is
do
end;
compile_to_c_old is
do
end;
compile_to_jvm_old is
do
end;
compile_target_to_jvm, compile_to_jvm is
local
i, idx: INTEGER;
ca: like code_attribute;
cp: like constant_pool;
do
ca := code_attribute;
cp := constant_pool;
idx := cp.idx_class2(fz_a0);
ca.opcode_new(idx);
ca.opcode_dup;
ca.opcode_push_integer(value.count);
idx := cp.idx_methodref3(fz_a0,fz_35,fz_27);
ca.opcode_invokespecial(idx,0);
from
i := value.count;
until
i = 0
loop
if value.item(i) = '1' then
ca.opcode_dup;
ca.opcode_push_integer(i - 1);
idx := cp.idx_methodref3(fz_a0,fz_a4,fz_27);
ca.opcode_invokevirtual(idx,-2);
end;
i := i - 1;
end;
end;
jvm_branch_if_false: INTEGER is
do
end;
jvm_branch_if_true: INTEGER is
do
end;
compile_to_jvm_into(dest: TYPE): INTEGER is
do
Result := standard_compile_to_jvm_into(dest);
end;
jvm_assign is
do
end;
to_runnable(ct: TYPE): like Current is
local
ic: INTEGER_CONSTANT;
do
if result_type = Void then
!!ic.make(value.count,start_position);
!!result_type.make(start_position,ic);
result_type.run_class.set_at_run_time;
hexa := value.twin;
hexa.to_hexadecimal;
end;
Result := Current;
end;
precedence: INTEGER is
do
Result := atomic_precedence;
end;
bracketed_pretty_print, pretty_print is
do
fmt.put_string(value);
fmt.put_character('B');
end;
print_as_target is
do
fmt.put_character('(');
pretty_print;
fmt.put_character(')');
fmt.put_character('.');
end;
short is
local
i: INTEGER;
do
from
i := 1;
until
i > value.count
loop
short_print.a_character(value.item(i));
i := i + 1;
end;
short_print.a_character('B');
end;
short_target is
do
bracketed_short;
short_print.a_dot;
end;
feature {C_PRETTY_PRINTER}
c_define is
local
i, k, digit_nb: INTEGER;
do
digit_nb := (1).object_size * 2;
k := hexa.count \\ digit_nb;
i := 1;
if k > 0 then
from
cpp.put_string(fz_0x);
until
k = 0
loop
cpp.put_character(hexa.item(i));
i := i + 1;
k := k - 1;
end;
cpp.put_character(',');
end;
from
until
i > hexa.count
loop
cpp.put_string(fz_0x);
from
k := digit_nb;
until
k = 0
loop
cpp.put_character(hexa.item(i));
i := i + 1;
k := k - 1;
end;
if i <= hexa.count then
cpp.put_character(',');
end;
end;
end;
end -- BIT_CONSTANT