src/cpu/sparc/vm/c1_CodeStubs_sparc.cpp

Fri, 07 Nov 2008 09:29:38 -0800

author
kvn
date
Fri, 07 Nov 2008 09:29:38 -0800
changeset 855
a1980da045cc
parent 777
37f87013dfd8
child 1162
6b2273dd6fa9
permissions
-rw-r--r--

6462850: generate biased locking code in C2 ideal graph
Summary: Inline biased locking code in C2 ideal graph during macro nodes expansion
Reviewed-by: never

duke@435 1 /*
duke@435 2 * Copyright 1999-2007 Sun Microsystems, Inc. All Rights Reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
duke@435 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435 20 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@435 21 * have any questions.
duke@435 22 *
duke@435 23 */
duke@435 24
duke@435 25 #include "incls/_precompiled.incl"
duke@435 26 #include "incls/_c1_CodeStubs_sparc.cpp.incl"
duke@435 27
duke@435 28 #define __ ce->masm()->
duke@435 29
duke@435 30 RangeCheckStub::RangeCheckStub(CodeEmitInfo* info, LIR_Opr index,
duke@435 31 bool throw_index_out_of_bounds_exception)
duke@435 32 : _throw_index_out_of_bounds_exception(throw_index_out_of_bounds_exception)
duke@435 33 , _index(index)
duke@435 34 {
duke@435 35 _info = new CodeEmitInfo(info);
duke@435 36 }
duke@435 37
duke@435 38
duke@435 39 void RangeCheckStub::emit_code(LIR_Assembler* ce) {
duke@435 40 __ bind(_entry);
duke@435 41
duke@435 42 if (_index->is_register()) {
duke@435 43 __ mov(_index->as_register(), G4);
duke@435 44 } else {
duke@435 45 __ set(_index->as_jint(), G4);
duke@435 46 }
duke@435 47 if (_throw_index_out_of_bounds_exception) {
duke@435 48 __ call(Runtime1::entry_for(Runtime1::throw_index_exception_id), relocInfo::runtime_call_type);
duke@435 49 } else {
duke@435 50 __ call(Runtime1::entry_for(Runtime1::throw_range_check_failed_id), relocInfo::runtime_call_type);
duke@435 51 }
duke@435 52 __ delayed()->nop();
duke@435 53 ce->add_call_info_here(_info);
duke@435 54 ce->verify_oop_map(_info);
duke@435 55 #ifdef ASSERT
duke@435 56 __ should_not_reach_here();
duke@435 57 #endif
duke@435 58 }
duke@435 59
duke@435 60 #ifdef TIERED
duke@435 61
duke@435 62 void CounterOverflowStub::emit_code(LIR_Assembler* ce) {
duke@435 63 __ bind(_entry);
duke@435 64 __ set(_bci, G4);
duke@435 65 __ call(Runtime1::entry_for(Runtime1::counter_overflow_id), relocInfo::runtime_call_type);
duke@435 66 __ delayed()->nop();
duke@435 67 ce->add_call_info_here(_info);
duke@435 68 ce->verify_oop_map(_info);
duke@435 69
duke@435 70 __ br(Assembler::always, true, Assembler::pt, _continuation);
duke@435 71 __ delayed()->nop();
duke@435 72 }
duke@435 73
duke@435 74 #endif // TIERED
duke@435 75
duke@435 76 void DivByZeroStub::emit_code(LIR_Assembler* ce) {
duke@435 77 if (_offset != -1) {
duke@435 78 ce->compilation()->implicit_exception_table()->append(_offset, __ offset());
duke@435 79 }
duke@435 80 __ bind(_entry);
duke@435 81 __ call(Runtime1::entry_for(Runtime1::throw_div0_exception_id), relocInfo::runtime_call_type);
duke@435 82 __ delayed()->nop();
duke@435 83 ce->add_call_info_here(_info);
duke@435 84 ce->verify_oop_map(_info);
duke@435 85 #ifdef ASSERT
duke@435 86 __ should_not_reach_here();
duke@435 87 #endif
duke@435 88 }
duke@435 89
duke@435 90
duke@435 91 void ImplicitNullCheckStub::emit_code(LIR_Assembler* ce) {
duke@435 92 ce->compilation()->implicit_exception_table()->append(_offset, __ offset());
duke@435 93 __ bind(_entry);
duke@435 94 __ call(Runtime1::entry_for(Runtime1::throw_null_pointer_exception_id),
duke@435 95 relocInfo::runtime_call_type);
duke@435 96 __ delayed()->nop();
duke@435 97 ce->add_call_info_here(_info);
duke@435 98 ce->verify_oop_map(_info);
duke@435 99 #ifdef ASSERT
duke@435 100 __ should_not_reach_here();
duke@435 101 #endif
duke@435 102 }
duke@435 103
duke@435 104
duke@435 105 // Implementation of SimpleExceptionStub
duke@435 106 // Note: %g1 and %g3 are already in use
duke@435 107 void SimpleExceptionStub::emit_code(LIR_Assembler* ce) {
duke@435 108 __ bind(_entry);
duke@435 109 __ call(Runtime1::entry_for(_stub), relocInfo::runtime_call_type);
duke@435 110
duke@435 111 if (_obj->is_valid()) {
duke@435 112 __ delayed()->mov(_obj->as_register(), G4); // _obj contains the optional argument to the stub
duke@435 113 } else {
duke@435 114 __ delayed()->mov(G0, G4);
duke@435 115 }
duke@435 116 ce->add_call_info_here(_info);
duke@435 117 #ifdef ASSERT
duke@435 118 __ should_not_reach_here();
duke@435 119 #endif
duke@435 120 }
duke@435 121
duke@435 122
duke@435 123 // Implementation of ArrayStoreExceptionStub
duke@435 124
duke@435 125 ArrayStoreExceptionStub::ArrayStoreExceptionStub(CodeEmitInfo* info):
duke@435 126 _info(info) {
duke@435 127 }
duke@435 128
duke@435 129
duke@435 130 void ArrayStoreExceptionStub::emit_code(LIR_Assembler* ce) {
duke@435 131 __ bind(_entry);
duke@435 132 __ call(Runtime1::entry_for(Runtime1::throw_array_store_exception_id), relocInfo::runtime_call_type);
duke@435 133 __ delayed()->nop();
duke@435 134 ce->add_call_info_here(_info);
duke@435 135 ce->verify_oop_map(_info);
duke@435 136 #ifdef ASSERT
duke@435 137 __ should_not_reach_here();
duke@435 138 #endif
duke@435 139 }
duke@435 140
duke@435 141
duke@435 142
duke@435 143
duke@435 144 // Implementation of NewInstanceStub
duke@435 145
duke@435 146 NewInstanceStub::NewInstanceStub(LIR_Opr klass_reg, LIR_Opr result, ciInstanceKlass* klass, CodeEmitInfo* info, Runtime1::StubID stub_id) {
duke@435 147 _result = result;
duke@435 148 _klass = klass;
duke@435 149 _klass_reg = klass_reg;
duke@435 150 _info = new CodeEmitInfo(info);
duke@435 151 assert(stub_id == Runtime1::new_instance_id ||
duke@435 152 stub_id == Runtime1::fast_new_instance_id ||
duke@435 153 stub_id == Runtime1::fast_new_instance_init_check_id,
duke@435 154 "need new_instance id");
duke@435 155 _stub_id = stub_id;
duke@435 156 }
duke@435 157
duke@435 158
duke@435 159 void NewInstanceStub::emit_code(LIR_Assembler* ce) {
duke@435 160 __ bind(_entry);
duke@435 161 __ call(Runtime1::entry_for(_stub_id), relocInfo::runtime_call_type);
duke@435 162 __ delayed()->mov_or_nop(_klass_reg->as_register(), G5);
duke@435 163 ce->add_call_info_here(_info);
duke@435 164 ce->verify_oop_map(_info);
duke@435 165 __ br(Assembler::always, false, Assembler::pt, _continuation);
duke@435 166 __ delayed()->mov_or_nop(O0, _result->as_register());
duke@435 167 }
duke@435 168
duke@435 169
duke@435 170 // Implementation of NewTypeArrayStub
duke@435 171 NewTypeArrayStub::NewTypeArrayStub(LIR_Opr klass_reg, LIR_Opr length, LIR_Opr result, CodeEmitInfo* info) {
duke@435 172 _klass_reg = klass_reg;
duke@435 173 _length = length;
duke@435 174 _result = result;
duke@435 175 _info = new CodeEmitInfo(info);
duke@435 176 }
duke@435 177
duke@435 178
duke@435 179 void NewTypeArrayStub::emit_code(LIR_Assembler* ce) {
duke@435 180 __ bind(_entry);
duke@435 181
duke@435 182 __ mov(_length->as_register(), G4);
duke@435 183 __ call(Runtime1::entry_for(Runtime1::new_type_array_id), relocInfo::runtime_call_type);
duke@435 184 __ delayed()->mov_or_nop(_klass_reg->as_register(), G5);
duke@435 185 ce->add_call_info_here(_info);
duke@435 186 ce->verify_oop_map(_info);
duke@435 187 __ br(Assembler::always, false, Assembler::pt, _continuation);
duke@435 188 __ delayed()->mov_or_nop(O0, _result->as_register());
duke@435 189 }
duke@435 190
duke@435 191
duke@435 192 // Implementation of NewObjectArrayStub
duke@435 193
duke@435 194 NewObjectArrayStub::NewObjectArrayStub(LIR_Opr klass_reg, LIR_Opr length, LIR_Opr result, CodeEmitInfo* info) {
duke@435 195 _klass_reg = klass_reg;
duke@435 196 _length = length;
duke@435 197 _result = result;
duke@435 198 _info = new CodeEmitInfo(info);
duke@435 199 }
duke@435 200
duke@435 201
duke@435 202 void NewObjectArrayStub::emit_code(LIR_Assembler* ce) {
duke@435 203 __ bind(_entry);
duke@435 204
duke@435 205 __ mov(_length->as_register(), G4);
duke@435 206 __ call(Runtime1::entry_for(Runtime1::new_object_array_id), relocInfo::runtime_call_type);
duke@435 207 __ delayed()->mov_or_nop(_klass_reg->as_register(), G5);
duke@435 208 ce->add_call_info_here(_info);
duke@435 209 ce->verify_oop_map(_info);
duke@435 210 __ br(Assembler::always, false, Assembler::pt, _continuation);
duke@435 211 __ delayed()->mov_or_nop(O0, _result->as_register());
duke@435 212 }
duke@435 213
duke@435 214
duke@435 215 // Implementation of MonitorAccessStubs
duke@435 216 MonitorEnterStub::MonitorEnterStub(LIR_Opr obj_reg, LIR_Opr lock_reg, CodeEmitInfo* info)
duke@435 217 : MonitorAccessStub(obj_reg, lock_reg) {
duke@435 218 _info = new CodeEmitInfo(info);
duke@435 219 }
duke@435 220
duke@435 221
duke@435 222 void MonitorEnterStub::emit_code(LIR_Assembler* ce) {
duke@435 223 __ bind(_entry);
duke@435 224 __ mov(_obj_reg->as_register(), G4);
duke@435 225 if (ce->compilation()->has_fpu_code()) {
duke@435 226 __ call(Runtime1::entry_for(Runtime1::monitorenter_id), relocInfo::runtime_call_type);
duke@435 227 } else {
duke@435 228 __ call(Runtime1::entry_for(Runtime1::monitorenter_nofpu_id), relocInfo::runtime_call_type);
duke@435 229 }
duke@435 230 __ delayed()->mov_or_nop(_lock_reg->as_register(), G5);
duke@435 231 ce->add_call_info_here(_info);
duke@435 232 ce->verify_oop_map(_info);
duke@435 233 __ br(Assembler::always, true, Assembler::pt, _continuation);
duke@435 234 __ delayed()->nop();
duke@435 235 }
duke@435 236
duke@435 237
duke@435 238 void MonitorExitStub::emit_code(LIR_Assembler* ce) {
duke@435 239 __ bind(_entry);
duke@435 240 if (_compute_lock) {
duke@435 241 ce->monitor_address(_monitor_ix, _lock_reg);
duke@435 242 }
duke@435 243 if (ce->compilation()->has_fpu_code()) {
duke@435 244 __ call(Runtime1::entry_for(Runtime1::monitorexit_id), relocInfo::runtime_call_type);
duke@435 245 } else {
duke@435 246 __ call(Runtime1::entry_for(Runtime1::monitorexit_nofpu_id), relocInfo::runtime_call_type);
duke@435 247 }
duke@435 248
duke@435 249 __ delayed()->mov_or_nop(_lock_reg->as_register(), G4);
duke@435 250 __ br(Assembler::always, true, Assembler::pt, _continuation);
duke@435 251 __ delayed()->nop();
duke@435 252 }
duke@435 253
duke@435 254 // Implementation of patching:
duke@435 255 // - Copy the code at given offset to an inlined buffer (first the bytes, then the number of bytes)
duke@435 256 // - Replace original code with a call to the stub
duke@435 257 // At Runtime:
duke@435 258 // - call to stub, jump to runtime
duke@435 259 // - in runtime: preserve all registers (especially objects, i.e., source and destination object)
duke@435 260 // - in runtime: after initializing class, restore original code, reexecute instruction
duke@435 261
duke@435 262 int PatchingStub::_patch_info_offset = -NativeGeneralJump::instruction_size;
duke@435 263
duke@435 264 void PatchingStub::align_patch_site(MacroAssembler* ) {
duke@435 265 // patch sites on sparc are always properly aligned.
duke@435 266 }
duke@435 267
duke@435 268 void PatchingStub::emit_code(LIR_Assembler* ce) {
duke@435 269 // copy original code here
duke@435 270 assert(NativeCall::instruction_size <= _bytes_to_copy && _bytes_to_copy <= 0xFF,
duke@435 271 "not enough room for call");
duke@435 272 assert((_bytes_to_copy & 0x3) == 0, "must copy a multiple of four bytes");
duke@435 273
duke@435 274 Label call_patch;
duke@435 275
duke@435 276 int being_initialized_entry = __ offset();
duke@435 277
duke@435 278 if (_id == load_klass_id) {
duke@435 279 // produce a copy of the load klass instruction for use by the being initialized case
duke@435 280 address start = __ pc();
duke@435 281 Address addr = Address(_obj, address(NULL), oop_Relocation::spec(_oop_index));
duke@435 282 __ sethi(addr, true);
duke@435 283 __ add(addr, _obj, 0);
duke@435 284
duke@435 285 #ifdef ASSERT
duke@435 286 for (int i = 0; i < _bytes_to_copy; i++) {
duke@435 287 address ptr = (address)(_pc_start + i);
duke@435 288 int a_byte = (*ptr) & 0xFF;
duke@435 289 assert(a_byte == *start++, "should be the same code");
duke@435 290 }
duke@435 291 #endif
duke@435 292 } else {
duke@435 293 // make a copy the code which is going to be patched.
duke@435 294 for (int i = 0; i < _bytes_to_copy; i++) {
duke@435 295 address ptr = (address)(_pc_start + i);
duke@435 296 int a_byte = (*ptr) & 0xFF;
duke@435 297 __ a_byte (a_byte);
duke@435 298 }
duke@435 299 }
duke@435 300
duke@435 301 address end_of_patch = __ pc();
duke@435 302 int bytes_to_skip = 0;
duke@435 303 if (_id == load_klass_id) {
duke@435 304 int offset = __ offset();
duke@435 305 if (CommentedAssembly) {
duke@435 306 __ block_comment(" being_initialized check");
duke@435 307 }
duke@435 308
duke@435 309 // static field accesses have special semantics while the class
duke@435 310 // initializer is being run so we emit a test which can be used to
duke@435 311 // check that this code is being executed by the initializing
duke@435 312 // thread.
duke@435 313 assert(_obj != noreg, "must be a valid register");
duke@435 314 assert(_oop_index >= 0, "must have oop index");
duke@435 315 __ ld_ptr(_obj, instanceKlass::init_thread_offset_in_bytes() + sizeof(klassOopDesc), G3);
duke@435 316 __ cmp(G2_thread, G3);
duke@435 317 __ br(Assembler::notEqual, false, Assembler::pn, call_patch);
duke@435 318 __ delayed()->nop();
duke@435 319
duke@435 320 // load_klass patches may execute the patched code before it's
duke@435 321 // copied back into place so we need to jump back into the main
duke@435 322 // code of the nmethod to continue execution.
duke@435 323 __ br(Assembler::always, false, Assembler::pt, _patch_site_continuation);
duke@435 324 __ delayed()->nop();
duke@435 325
duke@435 326 // make sure this extra code gets skipped
duke@435 327 bytes_to_skip += __ offset() - offset;
duke@435 328 }
duke@435 329
duke@435 330 // Now emit the patch record telling the runtime how to find the
duke@435 331 // pieces of the patch. We only need 3 bytes but it has to be
duke@435 332 // aligned as an instruction so emit 4 bytes.
duke@435 333 int sizeof_patch_record = 4;
duke@435 334 bytes_to_skip += sizeof_patch_record;
duke@435 335
duke@435 336 // emit the offsets needed to find the code to patch
duke@435 337 int being_initialized_entry_offset = __ offset() - being_initialized_entry + sizeof_patch_record;
duke@435 338
duke@435 339 // Emit the patch record. We need to emit a full word, so emit an extra empty byte
duke@435 340 __ a_byte(0);
duke@435 341 __ a_byte(being_initialized_entry_offset);
duke@435 342 __ a_byte(bytes_to_skip);
duke@435 343 __ a_byte(_bytes_to_copy);
duke@435 344 address patch_info_pc = __ pc();
duke@435 345 assert(patch_info_pc - end_of_patch == bytes_to_skip, "incorrect patch info");
duke@435 346
duke@435 347 address entry = __ pc();
duke@435 348 NativeGeneralJump::insert_unconditional((address)_pc_start, entry);
duke@435 349 address target = NULL;
duke@435 350 switch (_id) {
duke@435 351 case access_field_id: target = Runtime1::entry_for(Runtime1::access_field_patching_id); break;
duke@435 352 case load_klass_id: target = Runtime1::entry_for(Runtime1::load_klass_patching_id); break;
duke@435 353 default: ShouldNotReachHere();
duke@435 354 }
duke@435 355 __ bind(call_patch);
duke@435 356
duke@435 357 if (CommentedAssembly) {
duke@435 358 __ block_comment("patch entry point");
duke@435 359 }
duke@435 360 __ call(target, relocInfo::runtime_call_type);
duke@435 361 __ delayed()->nop();
duke@435 362 assert(_patch_info_offset == (patch_info_pc - __ pc()), "must not change");
duke@435 363 ce->add_call_info_here(_info);
duke@435 364 __ br(Assembler::always, false, Assembler::pt, _patch_site_entry);
duke@435 365 __ delayed()->nop();
duke@435 366 if (_id == load_klass_id) {
duke@435 367 CodeSection* cs = __ code_section();
duke@435 368 address pc = (address)_pc_start;
duke@435 369 RelocIterator iter(cs, pc, pc + 1);
duke@435 370 relocInfo::change_reloc_info_for_address(&iter, (address) pc, relocInfo::oop_type, relocInfo::none);
duke@435 371
duke@435 372 pc = (address)(_pc_start + NativeMovConstReg::add_offset);
duke@435 373 RelocIterator iter2(cs, pc, pc+1);
duke@435 374 relocInfo::change_reloc_info_for_address(&iter2, (address) pc, relocInfo::oop_type, relocInfo::none);
duke@435 375 }
duke@435 376
duke@435 377 }
duke@435 378
duke@435 379 void ArrayCopyStub::emit_code(LIR_Assembler* ce) {
duke@435 380 //---------------slow case: call to native-----------------
duke@435 381 __ bind(_entry);
duke@435 382 __ mov(src()->as_register(), O0);
duke@435 383 __ mov(src_pos()->as_register(), O1);
duke@435 384 __ mov(dst()->as_register(), O2);
duke@435 385 __ mov(dst_pos()->as_register(), O3);
duke@435 386 __ mov(length()->as_register(), O4);
duke@435 387
duke@435 388 ce->emit_static_call_stub();
duke@435 389
duke@435 390 __ call(SharedRuntime::get_resolve_static_call_stub(), relocInfo::static_call_type);
duke@435 391 __ delayed()->nop();
duke@435 392 ce->add_call_info_here(info());
duke@435 393 ce->verify_oop_map(info());
duke@435 394
duke@435 395 #ifndef PRODUCT
duke@435 396 __ set((intptr_t)&Runtime1::_arraycopy_slowcase_cnt, O0);
duke@435 397 __ ld(O0, 0, O1);
duke@435 398 __ inc(O1);
duke@435 399 __ st(O1, 0, O0);
duke@435 400 #endif
duke@435 401
duke@435 402 __ br(Assembler::always, false, Assembler::pt, _continuation);
duke@435 403 __ delayed()->nop();
duke@435 404 }
duke@435 405
duke@435 406
ysr@777 407 ///////////////////////////////////////////////////////////////////////////////////
ysr@777 408 #ifndef SERIALGC
ysr@777 409
ysr@777 410 void G1PreBarrierStub::emit_code(LIR_Assembler* ce) {
ysr@777 411 __ bind(_entry);
ysr@777 412
ysr@777 413 assert(pre_val()->is_register(), "Precondition.");
ysr@777 414
ysr@777 415 Register pre_val_reg = pre_val()->as_register();
ysr@777 416
ysr@777 417 ce->mem2reg(addr(), pre_val(), T_OBJECT, patch_code(), info(), false);
ysr@777 418 __ br_on_reg_cond(Assembler::rc_z, /*annul*/false, Assembler::pt,
ysr@777 419 pre_val_reg, _continuation);
ysr@777 420 __ delayed()->nop();
ysr@777 421
ysr@777 422 __ call(Runtime1::entry_for(Runtime1::Runtime1::g1_pre_barrier_slow_id));
ysr@777 423 __ delayed()->mov(pre_val_reg, G4);
ysr@777 424 __ br(Assembler::always, false, Assembler::pt, _continuation);
ysr@777 425 __ delayed()->nop();
ysr@777 426
ysr@777 427 }
ysr@777 428
ysr@777 429 jbyte* G1PostBarrierStub::_byte_map_base = NULL;
ysr@777 430
ysr@777 431 jbyte* G1PostBarrierStub::byte_map_base_slow() {
ysr@777 432 BarrierSet* bs = Universe::heap()->barrier_set();
ysr@777 433 assert(bs->is_a(BarrierSet::G1SATBCTLogging),
ysr@777 434 "Must be if we're using this.");
ysr@777 435 return ((G1SATBCardTableModRefBS*)bs)->byte_map_base;
ysr@777 436 }
ysr@777 437
ysr@777 438 void G1PostBarrierStub::emit_code(LIR_Assembler* ce) {
ysr@777 439 __ bind(_entry);
ysr@777 440
ysr@777 441 assert(addr()->is_register(), "Precondition.");
ysr@777 442 assert(new_val()->is_register(), "Precondition.");
ysr@777 443 Register addr_reg = addr()->as_pointer_register();
ysr@777 444 Register new_val_reg = new_val()->as_register();
ysr@777 445 __ br_on_reg_cond(Assembler::rc_z, /*annul*/false, Assembler::pt,
ysr@777 446 new_val_reg, _continuation);
ysr@777 447 __ delayed()->nop();
ysr@777 448
ysr@777 449 __ call(Runtime1::entry_for(Runtime1::Runtime1::g1_post_barrier_slow_id));
ysr@777 450 __ delayed()->mov(addr_reg, G4);
ysr@777 451 __ br(Assembler::always, false, Assembler::pt, _continuation);
ysr@777 452 __ delayed()->nop();
ysr@777 453 }
ysr@777 454
ysr@777 455 #endif // SERIALGC
ysr@777 456 ///////////////////////////////////////////////////////////////////////////////////
ysr@777 457
duke@435 458 #undef __

mercurial