The transactor vol8 iss1 by chris synt

i 8

�News Journal For Commodore Computers

• • • • • • •

Math • •

Lincoln College Commodore Computer Camp with

JIM BUTTERFIELD and

other experts

July 19-25, 1987 Topics Include: • e

Amlga

•

C-128

•

Robotics

•

Telecomputlng

•

Additional selected topics

For further

Information, contact: Office of Continuing Education Lincoln College 300 Keokuk Lincoln, ll 62656

217n32-3155

EXPAND

YOUR AMIGAn.

OOOiim!Ri� iNI W (No Soldenng)

BY ONE MEGABYTE (1,000K or 1,000,000 Bytes)

With the

ooulNJ�U(g)(g(RlQ Q Qoo •

•

The BEST Internal RAM expansion. One Megabyte of FAST Auto-Config RAM. No W311 States. Battery Backed-Up Clock/Calendar Chip.

Compatible with Sidecar'"" Compatible wrth Most other External RAM. One Year Warranty.

Suggel-.d Retail

$595.00 � F!Ris

Canadian Oistrbutor

DF.StGNTEcH Bu tNF.SS SYSTEMS ThC. 1304-850 Burrard Street Vancouve r. BC V6Z 2J1

(604) 669·1855

Cel1ified Cheque Of MO Dealer Enqumes lrMtlld

COMPUTERS OF AMERICA

Ul \:.Jir\

. South�.�� o:\Ji'J

n�

•

2 MEG RAM EXPANSION Cc•ms�c·s second J!(:n�ration A.\2000 RA'l BOARD. litware dl:\'dopers worldwide ha\'�: hccn us in� it fur over a rear. �em so can you. ThL A..\:WOO pro\'idcs fasr RA't. �1\'ln�you more room for pru�ram and data storage. faster program execution and fl:wcr l i me consuming disk accesses. The A.'\2000 pm\'i dc" a full 2 �tc�hytcs of memory

HARD DISK

_ _ ..... ...

IWU'.

The A.'\2000 is fulh· cnmpatahlc '' ith all standard Ami$.1.a pmducb. Snml' hoards aren't. ThL .\X20UO is auto cnnfi�unn�·. All you do is plu� it into your .\miga and turn it on. :\ut hi n� •

dsc L m�cdcd.

Full "pass throu�h" allows for complete peripheral expansion. lt11 l:w:n sur\'i\'c a

suit· reset.

" \\ "r'kh\: nch I 2 \mrs!;lts a r,l!rst�n:J tr.r.l,m.rrl\ "'Ct•mm•Klur.: flu,m�'' 'lachtn"

Finall\•', a hard di!'k driw forth� Ami� made to the same c\acting standards as the AX2000.1t runs on l'\'CI)' mltagc fmm 95 to 26() vnlts. It uses 50 or 60 liz. It's a\'ailahk simply as a SCSI host adaptor a SCSI host adaptor and cnntmlkr. or as a complch.: :w �leg. hard dri\'c. In fact the machine accepl" hard dri\·es starting fmm 10 �leg and up. Th.. hard dri\ c can tx: cnmhmed with the .\.\2000 to pm\'ide up to H �leg of HA.�1 memory. Adaptahility ts the ddinitinn ofCnmspec's n .. .. w hard disk dri,·c. But the hard disk is mnrc than adapwhlc. It comcs standard w·ith fcaturcs you won't !'oon fofl!Ct. •.\ huilt-m power �upply gi\'�5 the Amt� an additional 2 ampli of ncce��l) powa fur usc with peripherals. It huffefl\ the Ami� expansion hus. gi\·ing the computer lx:tkr lle\ihility. It cumc:- with a huilt·tn SC�I purt. The dock calendar ha:- a hatten hack-up. And of cou!'X' it':- autn-cunli�uring.

COM SPEC 1 :J3 Ondg•:'land A.

Unol

• � toronul ()r� Cw>adit M5A 2V6 (<!, 6( 787 061 1

VolumeS Issue 01

Math Start Address

. . . . . . .... . . . . . . . . . . . . . 3

Edttorial

Letters ...

•

\\l.n!ed- Phn/4 Technical Info \\'anted - an IMG strlpprr lot tape

Ctrcutatton at Large 72,000

Aleadon�o Another lEE£ lor the 128 Ull lrusmmn ru: Bibhcal Grerk driih me book blurb Ita""'

Groundin to a hall �an Inner Space Slructwln BaSIC programs f'OOcbrUICS Simplilytn the rakl Double Dmslty HR S&P "Fast File relocation

A dtssmtlng \'Ole lor C �'t'f C Corl\'t'rter lor SuJ)t.'f· C vI

Super C and the RAM disk

TransBASIC grphmg on one screen BundlingTramBASIC d ts

Am music software 5hor More Supcrklt IOI'rows

News BRK

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76

ew Addres$ and f'tlonl! � Sub5alpC101111RrS«l1011 Sd Disk SubscripUOO otes Free TtlllNCtor Ts 10ilb +Disk Sub

Sub5criba t.Wl O.clt:ts

CuuomYDuty onllm!IO� Produtts Transactor t.t.ll Order 11ional Colnplm Olnlmnce I 7 4040 Drh't' lnlrmah

Telecolumn 21 A Real Shuffle Subroutine Shullle�lhewayhwnlm4:1 24 25 Function Manipulation: Roots and Integrals Array Math Operations on the C64 �fl1llifyvrw 1001 28 A Faster Square Root for the C64 �orracante 100 34 Complex Number Arithmetic Addcompttxnumt>acta�ypctol!A.SIC 36 40 FAC 1 Facts t.t.ldllne ��balm� made High-speed Multiplies and Divides r.tt.math rou�maplained . . 42 Secondary Address Bits unle"knowntipltromJlllllklnmn� 44 Interfacing and Controlling the Armatron Robot . . 46 blbesymass� 50 SymLister " XREF \'.nable and fine.tlumbeHt055 rdmncq ln a 52 aiiMlilld . . . . . . . . . . 56 Beyond Compare ,. � � d� .. .

•

Amiga Section:

PoptoFront An�aolhecllmonic TrapSnapper �lhi!Outubebel:ll rou, Amiga Dispatches TheA20COanisoo ,_ andiOIOOfi'OIU Compu-toons . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . •

•

65 68 71 75

J!Ay 1917: Volume .. . ...,. 01

Program Ustln

AU.O.Edhnr Karl J H Hildon

AU pro£r1111$1lsted In The 1iansactor will appear they "-'OUid on)'OUr saten In Uwet!Lowef ta5e mode. To darlly t poll!nl dwacter mix� m wlllappw V and the� o d course be In lowe ta5e. Secondly the looo"ft L (T) 15 a str line as Cll'oscd to the number 1 "-1Udlllas III lOp. loW!) progmns will CI:IWln m"effe \"idto c::twtK1rD that rqJrC5tllt cursot 1110\eme!WS cdouB or lunctkJn lce)'S These"' be �11 endly the\1 "'OUid � on )'ClUJ Kittll tu the) re listed here lor idermcr Abo r� CI'RLq wkhln quoc IS ldmicalto 1Cl.:nor DI:M11, d al

Porthot Edittw Ricbard [\til Anmt• Edltnr

OubZ&mari D'Artapaa Editor lck�'l!l Ar1 Director John MoslliCCI Adml:nbtmlofl & Sut.c:rtptltlofloru�t �Rlcb&rd K.athryn Hollooo

ContritMrtln1 "rttrra lan Adam J KillB'll Orepy Knm D.l\ld Archibald Da\id Lathrop Jun Barbarcllo James A UsowUI Anthony Bmram 11m Bolbach Ranjan Bose Donald 8fllll5Clll

Anthony Bfyant J•m Bunerflcld Betty Clay Joxoph Caffrey Cary Cobb Tom K. Collopy Robet1 \ Da\is EIJz.abdh Or.r

F'tank E. DiGoY Chris Dunn ticbad J En.kl:le hck Amah wm .. m mset1 Jun f'tosl Miklos Car Eric: Thomas Gurle) R. J.une� Grlfl 11m Grintham A<Wn Hers!

1llornM Hmzy John Hol!tum Dlvld Hook John Hougtcon

Robert Huehn D.l\id Jmkowlkl

Brian Junlcer

Oilton Karlll'S l.orne Klwcn

Occasi:lnalJy pn:l£nmS will ctiiQin line�� show ameclllro space Often the numbed� )'ClU lmm wDIOOl be crkicaliO aliIt'd CJprntJon d the progmn Wllftl it 15 the rl"QQIired numbe1 of spaces will be �11 IU eumple Pfll'll ••

ra ..= : ba� :: :: C =. IIrtiOr C ::.: :: ..::

Dawa -II lp ·

___

...,. !An

&eve t.kCrystal 9acy Mcinnis Ctms Millrr leny Monlgomery R.lph t.torrill Rld; Morrl.s

For n."T I CB\tl VIC 114 -

·-·t

O.Joolt!

o.v � -

101'

Colow C'barvtrra fW VIC I t4 .,.. w w c,_

Mlc:hael lossman Bryte Nesbilt

Oerald NMdd :yman Kevin O"Connor RlchiJd �� Terry Prldtwn R.ymond Qulrtlng RidliJd Ridunond Gar) Ro)'al John\\

-· - C)�l

... I Gl- -· -. -· ,.,.._

'A" -

I'd]

FIIPdloa

II It'd

<nyl

Greyt U Greea ll . .... -

�J

Kt:yt_ �\'IC114 F n fl-

F4-

John Spmm Damn J Spruyt Aubrey Sunlcy David ldolph Rldllrd SIJU:ser Anton linlenkb Audrys Vilw

o.-. ·-D

,._ n n

FJ Schmahl Da\id Shllotl P A. Sb)rum:e�

Please Note: The li-ansactor's

Jack \\c.wrr [\'Ill Williams

" ,_.D

· IUt

-1 IM Off - .

NEW phone number is: (416) 737-2786 --

an. U5I'S na ••·- c.._... ,, lftld .... , cwmw• . .. TlwlkMw«D � 211

l:JA Oioolboa>o

=:,:.•• ::... u:y .:- •.n:zsa. , .

It\'

PtoducUoa Attlc'l}lJtSdllng Lid

tJT 11'7 Conw\MISon:Jx>d a..

flush r!glll

Ridllld lucal Scott t.�n D.wld Martin

PrillliDI Prln!ed In Canada by Madan llunter Prirtins ..,� ,.,� ..,...,._

In The TnliUiaCtor

a..m... .,.,.

�CT �,:

Qmod)Oo*n: 2SI

llood. ,.

•tst '.. .,

OilS

The TIGidOdOf

J� 1917: Volume .. ..... 01

Our I.ast Newsstand Issue! Its been just 0\r dghl)ars th I\ been mak Ttansactors. and excepc for a couple of l'le\\ rs from Commodore when their HQ Yf Palo Alto and oneor IYt'O out ofCommodore m .Japan, TheT. was the first Commodore periodic:al At the ime Gene Beales was doing t PET User and Len Undsay w rnaang The PET Gazett (which \\'OOid become COMPllrE' 1 � But aside from the th lnformat1011 w and the b 8\J} pnrued Commodore related artidcs on oct.aSIOfl only ,

Then tiler was the explosion GOMPUTE and Gazett had strong footholds nnd Commodore started publ&tin tv.'O slkk riforts of their OYt1l Other independent publishers follov.-ed But The Transactor v.'OUid \ a humb!e l'le\\"5lctter for another )"ear On June I, 1982, almost fl\ )ars , Ttansador fmall\ bro out of is shell co attempt the impossible; compeuuon the newsstand

I learned l'lO\\to rypesetln a month, nnd shipped Volume 4 Issue 0I to a handtull of rac thai October Surprisingl}, dXI v. I - "surpmmg beca The t " still jUSt a l'lCYf ter, exrept i had Instead of printed on the w I) a colour ((M;J' and the art :EC. I ha\ to Ia v.'hen I th one of those Old , kinda looking at )'Out first program In BASIC. I wasn't satisfied v.hen an artlde didn t nd the bo«om of a bul at the ume I didn't ha\ the Dlto do better \\e ore each on 256K, tqpes That first w v.m through li\' m.oded one - this •

•

had 8 tUgtl But the infonnaOOn "' solid and the Toronto concentmuon of technocr lookingto nsstm anddassemmat In fact. the c:ont nl rna) tm been too id The lollov.ing June v. approadtcd tast r Med&a, a national l'le\\'S stand diStributor They v.re skeptical bout shipping another com puter Iitle to potentialtv twated sheh , but decided &o gtve us a go M)"'\"3\ Thear U.S count rpart, Capitol OiStributmg, didn't take us on for the same reason But aft r the Canadian market showed sales stad!.)· improvmg, they reconsidered In June '84, 16,000 Transac tors v.'OUid fand their way to stands across the U.S. and some C\"Cfl to Europe. S.Amerlca, and Australia

lany things tun happened over the ) (which seem like v.ill be planted months). and v.'llhin a month another m Myself, Richard, Otm and NICk ha\1! placed an offer with our parent company &o purchase Transactor Publishing Inc. The offer has aD bul been signed W take posscssaon after this is shipped, and you11 that new add arc on the back ot our subscnption card Our new HQ is a I 500 square foot unit in a professional plaza jusa orth of Toronto, and the builders should be starling work on our two·storey offtee layotJt any day. Unfoftunatly, the l'lCWSSiand disuitulon business b just too tough. Slandatd payment terms are 120 cia) from the Ndl n dat Since w publish once every two month, lltakt!s6 months from the day an

pressed 10 the day v. retta\ payment lor the last copy sold Ow printer v.oo 't y, that long, and betw n the four us, w can·r noat that kind of fmanclng So un w can find another method for getting TraJlSlldors 10 the 1M3JZ1ne racks, this v.ill be our last issue

l'le\\'SSiand appearnncc.

How �.the l'le\\'SSiand do not generat a Joe of rc\"CflUe. ln lacl, they're not supposed to. That may sound absunt, bul li I sai:i, l'le\\'SSland sales are SUAJ05C(Ito subscnptaons A publishers' main soaJ aa the l'le\\'SSiand IS eo break m"Cn Am rates are driven by IOlaJ , and thoJ:S where the prolic Of course advertisfng rc\-enue The T. accourts for only a small � at the bank. How 'er, between subscriptions, dtsks. and our ancillary prodliCtS, IJlCOI're from Gompu.Sen and TPUG s regular purchase. w 've managed to do rather v. I AND, w cxpca &o contlflUC doing •

well•

There v.ill be other changes. mostly COSI ctltlng The paper w print on is the second most expellSIYC a\'allable W v.oo't be n.ogressingto newsprint or M)1hmg, but the famDiar coated stock used in most pubhcataons actually� less, and Is more appealingto adV1!rtiser Yep, ad\'CrtiSClS And U 80)'000 )'OU know is interested In ad space. w"C're llll cars• Even U intrest Is high, though, I guarnnt at least a meg of I>'PC per issue usual

But according to my calculatlOilS, there' ot least 25,000 of )'OU Orders c:amc Jlilin81n Both M r Medla and ol lncreased their llYening to me blabber right now that are not CUlTentl) su riblng. orders ary and would SO of the copteS or more (30t> And w need )'OUJ help Besides, )'OU won't be to get Transaaors sales at the newsstand IS considered exrellenl by publishers� The any other w • the)11 corne right 10 your door, and )'OU11 be gerung • eel 53 000 l'le\\'SSland pnnt order them for than the)• cost you ncM Ow next will ure operaUng S)'StemS and • boklng like a good one. Fbnhos. Anunis, urnll\ the intent " to sencr bsalptlons -the matnsla) lor DArtagnan, nnd fT1) want 10 keep smashing w Transactors. The) did bul short of expectatiOnS The hopefully much )'OU y,'llfllto keep getting lOOn' So If)'OU''< e'o'el' any "solid anformatJOO w had to offer had a much smaller market than considered subscribing before, ncM IS the tlfllf!1 the fulkolour material from our compel HOYt'eVel', w ed by those w confldt.."'nt that ripeaons v.'OUid be and otlk.'l pre-packaged hobbies. That ad\'anang bc)'OOd hawened too But the � of those v.11o lnteresl than those �ho transcend 10 a fascinataon canpletel) IS much wuh the soenoe of cornpl4ers Karl J H. Hildon, Editor In Chief

Using "VERIFIZER" The

Transactor's FoolproofProgram EntryMethod

VERIFIZER should be run before I)-ping n any lon programfrom the pag15 of The Transactor It wI let you check your \\'Ofk line by line as h frustratns '>'Jlinserrors The \'ERJfl. you entr 1 program and ZF.R concept \\'OI'ks b) diSplaying a 1\\ '0-lettb code for eadl program nst the correspondng oode in the line \\hlch )'OU can check programlistln

PET/CBM VERIF1ZER (BASIC 2.0 or 4.0) Cl 10 rem• d!ltaloader for • verihzer 4 0 • • CF 15 rem pet verSIOn Ll 20cs•O HC 30 lor 1 • 634 to 754 read 8 pol<.e 1 o OH 40 cs •cs + anext 1

There are fl\ \r51ons of\ERIFIZf.R here, one lor PET/CB�1• VIC or C64,Pius4 Cl28 and812 Enterthc pplicablcprogramandRUN If you get a dalll or checksum error. re-dleck the program and keep tr)'lng until all goes "'II 't'ou should StWf-: II program, sancc you'll

OG then prnt • JO 70 rem sys 634

AF IN

nt to usc It every lime you ntcr one of our progr ms Once you\ Rt N the load r, remember to enter EW to purge BASIC text pace. Then turn VERWIZER on with

SYS 634 to enable tho PET/CBM vcrson (off SYS 828 to enable tho �NIC verStOn (off SYS 4096to cnablo the Plus 4 verSIOn (off SYS 3072 1 to cnnble tho C128 verSion (off BANK 15 SYS 1024 tor 8128 (off BANK 15

50 60 I cs<>15580

IB CK EB HE

SYS 637) SYS 831) SYS 4099) SYS 30720} SYS 1027)

JB PA HE EL

Once VERIFIZER IS on C\'er) lime )'OU press RElliRN on a program Inc a l\\'0-lctter report code will appear on the top left of the screen In

Kl EB

that these letters r 10 uppercase andwill appear as graphics chraclrs unless )'OU are 10 uppe r flo\\rase tOOdc (press fe\-ersc field

shfft/Comrmdore on CG4/\'IC)

80cnd 100 1000data 76,138, 2 1010data173,164 2 1020data145,201, 2 1030data 144, 141,163 1040data 2 133,145 1050data201 13 208 1 133 1060data254 1070data 0 2,168 1080data165 253 41 1090data198 254 16 1100data251 41 15 1110data165 251 74 1120data141 1 128 1130data251 133 251

.•• •dataerror ....• •

120 133 240 2 88

62 251 201 3 249 24 74 108

end

173,163, 2, 133,144 145 88. 96, 120,165 16,141,164, 2,165 169 165,133 1441,169 96 85,228,165,217 165 167,208, 58,173 162 0 134,253,189 32 240, 15 230,253 133 254 32,236 2 232 152 208 229 165 105 193 141, 0 128 74 74 24,105 193 163 2 152 24 101

VIC/C$4 VERIF1ZER KE 10 rem•dataloader for • vcr tZer • • JF 15 rem VIC'64 vcrSlOO Ll 20CS•0 BE 30 for 1 828 to 958 read 8 poke 1 a OH 40CS•CS+B next I

Note: If a report code IS missing (or -") means "' \ eelcd that hne at the last mnut \\hlch cha the report code. HowC\r this will onl) happen occasionally and usually onh on REM temcnts W'llh \'ERIFIZER on just enter the program lrom the Jn.llPZUlC nor· malty checking h report code alter you pr RETURN on a line.. If the code doesn't rnach up\\ h the lett pnnted 10 the box beside the ist l 10g )'OU can re-check and corrL'd the Inc then try agam If )'OU then type RETURN over cah in wish )'OU can UST a r of SUCXCSSIOn "'hllc cl k ng the rl'pOrl codes as the) appear Once the program has been proper!) cnt red be sur to turn VERIFIZER off\\ilh the SVS mdx:atcd abO\ bcfor you do an) thmg else

•

60 if cs<>14755

then pr nt • •••••dataerror ••••• • end

KP 70 rem sys 828 AF 80end IN 100 EC 1000dato 76, 74, 3 165,251,141, 2, 3, 165 EP 1010data252,141, 3, 3 96 173 3, 3,201 2 3, 133 OC 1020 data 3, 240, 17, 133 252 173 MN 1030data251, 169, 99 141 2 3 169, 3, 141 MG 1040data 3, 3 96 173 254, 1,133, 89 162 OM 1050data 0 160, 0 189 0, 2 240, 22,201 CA 1060data 32 240 15 133 91 200 152 41, 3 NG 1070 da!a 133 90 32 183 3 198 90, 16,249 OK 1080data232 208 229 56 32 240 255 169 19 AN 1090data 32 210 255 169 18 32,210 255 165 GH 1100data 89 41 15 24 105 97, 32,210 255 JC 1110data165 89 74 74 74 74 24 105 97 EP 1120data 32 210 255 169 146 32 210 255 24 MH 1130da1a 32 240 255 108 251, 0 165 91 24 BH 1140 data101 89 133 89 96

VF.Rifi7.ER \\ill catrh transposition errors hkc I'OK�: 52381,0 l�tcad of POKE 532 I 0 Hov.m r VF.Rif-lZER uso a "w•1ghted checksum tcchnque that can be fooled U )'OU tr) hard enough. transpostng two ts of 4 charact rs \\ I produce the me report code but this should I1C\r happen short of dclibcratcly (\-erlfizer could have been designed to be more complex but the report codes \\'OUid need to be longer, and using it would be more trou than checkm code manually� VERIFJ. ZER IgnOres 5po1CC5 50 )'OU nm add or omit spaces from the isted l program t will (provld )'OU don I split up �'\\'Ords'). Slandanl kc)'\\wd abbrC\ uons (like nE anst d of next) \\ill not nfiect the VERIFIZER report code..

Technical Info: VICIC64 VERIFIZER resides tnthe cassett buller so H you re using a dataset! be a'Aore that Ulpe operatiOnS can be dangerous to Its health As far as compat ) wuh other u1 aesgoes, \'ERIFIZER shouldn'l cause an) problems smcc \\'Ofks through the BASIC \\'llTJTHtarl hnk and jumps to the oragmal desunataon ofthe link the ltnk to itS original after 11 s finished \\hen dasabled it r contents

VIC/64 Double \'erlfizr

SW�n Walk-), SuonyiDCad, CA

When ustrJt! �ERIFIZf.R with some 1V the upper lclt corner of the reen IS CUI off hid gthe \'Crifacr-displayed codes DOUBLE \'ERJ. FIZER soh that problem � showing the two-let r \rifazcr code on both the first nd second 1'0\\' of the 1V reen Just run the below program once the regular \enlizr is tl\'ated

Jut( 1917: Volume .. ,• ..,. 01

BC 01

GO N EN KG

KO FM

100 tor ad •679to 720 r dda po dda next ad 110sys679 pr pr 120 pr t" double ventzcr eel· now 130data120 169 160 141 20 3 140data169 2 141 21 3 88 0 216 150da!a96 162 0 189 2 160da!a157 40 216 232 224 170da!a208 245 162 0 189 0 180da!a 4 157 40 4 232 224 190da!a 2 208 245 76 49 234

\lJUFTlER For Tape Uaen The follow

01 1140data 20 133 2 lK 1150data 0 GJ 1160data176 3 ON 1170data240 22 GJ 1180da!a200 152

CB CB

PE DO BA BG

Tom Potb, Rowle ,MA

mod !lOllS lo Ihe\cr

1190data 16 1200da' 165 1210data 0 1220data 24 0 1230dat3 1240data 96

208 162 0,160 0 189 201 48 144 7 201 58 232 208 242,189 o. 2 201 32 240 15 133 210 3 133 209 32 113 41 198 209 16 249 232 208 229 208 41 15 24 105193 141 12 165 208 74 74 74 74 105193141 1 12 108211 165 210 24 101 208 133 208

C121 VERIFIZER (40 column mode)

lzt'r loack-r "'

I alia\\ VIC and 64 (M1lff "h Oatasett to we the\ crifiZCI ducctl} (\\ilhout the loader) AI cr ru gthc new loader )'0011 ha\ a spcdal cop) of the VerifiZCr program which can be loaded from tape"'thou! diSluptmg the pro gram In mcmor) take the fol�1ng additiOns and changes to the VIC/ 64 \ERIFIZER loader

AK JK NH

OG JP MP AG

do poke 1

NB 30 for 1•850to980 re a AL 60 l cs<> 14821thnprnt"••• ..dataerr or•···· · end IB 70 rem sysBSO on sys853 oft 60 d IC IOC 100 d to no OC 1000data 76 96 3 165 251 141 3 165 2 MO 1030data251 169 121 141 3, 141 2 3 169 EG 1070data133 90 32 205 3 198 90 16 249 BO 2000 • "vcr il sys850( pace)" KH 2010 for •850to 980 Gl 2020 a$ • a$+c ${pcek(i)) ncx1 oc 2030 open 1 1 1 ctoso 1 P 204D end

GF MG HE LM JA

KJ DH JM KG EF

RECORD "'hen prompted 10 do so (use a ). To use the spcdal \1rifiZCr that has JUS! been cr ed frst load the program )'OU wish to \�ffy or

fUY and rewound tapc lor e f u ow RUN

«!\�

cx1111Sert the tape Into )'OUT compu from either tapeor d that is lll\\'OUnd Then ell!r In drcct created � and be rmde- OPENI :CLOSEI Pr P1.AY when prompted b) the compu!er, and "' "' the spcdal \erlzt'r loads intO the tape buffr 011CC loaded the scrt't.'fl will stlO\\ F 0 VERIFIZER�'SSSO To actl\"ate. enter SYS 850 (1101 the 82 m the or nal progr m) To cfc.actl\-ate,

I PO

1000 rem •dataloader lor • verIzcr c128 • 1010rem • commodorec128 verson 1020 rem • use 1n 40 column modo onlyl 1030CS•0 10401oq•3072to3214 r dx pokcJX Ch•oh+x next 1050 if ch<>17860 then pra nt " checksum error· stop 1060 pra nt • sys 3072,1 remto enable· 1070 pr1nt • 6yS 3072.0 rom to dtsablo 1080cnd 1090data208, 11,165,253,141, 2. 3,165 3 3 1100data254 141, 3 3, 96,173 1110data201, 12 240 17 133 254 173 2 1120data 3 133 253 169 38 141 3 2 3 96 165 22 1130data 169 12 141, 3 1140data 133 250,162 0 160 0 189 0 1150data 2 201 48 144 7 201, 58 176 o 1160 data 3,232 208 242 189 2. 240 1170data 22 201 32,240 15 133 252,200 1180data 152 41 3 133 251 32 135 12 1190data 198 251, 16 249 232 208 229 56 1200data 32,240 255 169 19, 32 210 255 1210dala 169 18 32 210 255 165 250 41 1220da!a 15 24 105193 32 210,255 165 1230 daU1250 74 74 74 74, 24 105193 1240da� 32 210 255 169 146 32 210 255 1250 cJa+.a 24 32 240 255 108253 0 165 1260data252 24, 101, 250 133 250 96

•

usc5)'SS53

8128 YERIFlZER

If )'OU arc gong to we 1.\pe to SA\t. 11 program )'OU ITlU5t de«tl\atc (SYS ·3) nee VF.RIFIZER 11'10\'t'$ 500lC of the lnlrnal potnters used during 11 SAVE opcrntiOfl Attempting a SAVE Y.lthout turnmg off VERIFIZER first will usUZtll} result In 11 crash II you wish to use VERIFIZER in aftt'r using the tllpe. you II hii\'C lo reload it with the OPf.NI CI.OSf.l commands

1 rem save • 0 ver!aerb128 8 10rem• crotn loodcr tor • vcnfiZCI' b128• • 20cs·O 30 bank 15 for 1•1024to 1163 a Ia • 40CS•CS+Pncx11 " 50 d c:s<>16828 lhen pnnt •• datn error •• • end 60 rem bank 15 sys 1024 70end 1000 data 76, 14 2 165, 252 4 165 251 141 130 2 201 39240 101ocrota 141,131, 2 96 173 130 2 133 252 169, 39 1020data 17,133 251 173 131 1030data 141,130 2 169, 4 141 131 2 96 165 1040data 1, 72, 162 1,134 1 202 165 27 133 1050data233 32 118 4 234 177 136 240 22 201 1060data 32,240, 15 133 235 232 138 41 3 133 1070d3ta234 32 110 4 198 234 16 249 200 208 1080data230,165 233 41 15 24 105193141, 0 1090 data208 165,233 74 74 74 74 24 105193 1100d!na141 1,208 2o4104 133 1,108251 o 1110data165 235 24,101 233 133 233. 96 165 136 1120data164, 137, 133 133 132 134 32 38 186 24 1130d3ta 32, 78 141,165 133 56 229,136 168 96 1140data170,170 170 170 •

rc d poke

Plu 4 VEAIFIZEA Nl

EE NH J AP

JC 0

Pl CA 00 LP EK

1000rem•da loadcrlor "veri&Zcr +4" 1010rem • commodore plus/4 vcrson 1020 graphiC 1 scnclr grnphlc 0 rem make room for code 1000cs-o 1040 lor 1• 4096to 4216 rcd:x po t.x Ch•dl+ x nex1 1050 ch<>13146 then pflnt · checksum euor • Qop 1060 pr • 6yS 4096 remto enable· • 1070 pr • 6yS 4099 remto dl 1080cnd 1090data 76 14 16 165 211 141 2 3 1100data 165 212 141 3 3 96 173 3 1110data 3 201 16 240 17 133 212 173 1120data 2 3 133 211 169 39141 2 3 3 96 165 1130data 3 169 16 141

The Trar-.tOf

Ellza�tb Deal, Mah-ern, PA

JWy 1917: VOMne ....... 01

•

Got on mreresttns pTQgJnmrrrmg lJP, short rourmc. or on unknou:n bft of Commodore triVlO?Send u m -If we usc rt m the Bits column, wc11 Of!dl you m the column and send you a lrrY one-)mr:S subsc.ripiiOfl to The 7ronsaclor

This will 'tlo'Ork nicely .,..hen you ar uing BASIC or the monitor. If you arc running a machine language program, make sure that �cry read or 'tlortle to the 8563 is made through the routmes at SCDCC and $CODA

Martin Hofbelnz Stockton, CA

C-128 Euy Propam Loadlnt

When savmg programs on diSk, u the follo\\ing procedure: dsavo 0 program namo<shlft space>.

C-128 CAPS-lock q Fix

This� up In the dueclory as

High Pont, North CaroUna

An undocumented f ture of the Commodore 12 is the 'q' Ire) that ""ill not respond to the caps loCk key The problem turns out simply to be the representatiOn m the keyboard lookup table used for the letter q \II. hen the caps lock key IS depressed. The .. . alue of 551 is found .,..here a \'Blue of 50 I should be.

0 program name 0

(the shifted space sllO\\ up as 8 quote) Now you can load a program dtreclly from 8 dtrectory display- just run the cursor up the left margm of the dtreclory until you get to the program you <F2> and <return>. and the program loads want to load, p

The cure IS simple. but it ""ill requtre programmmg an EPROM. for thiS reason 11 IS best th1 )'OU are a technically lndmed person who is comfortable wuh d t5manthng the C-128 or have someone on hand who IS You will also need to have on hand a Promenad" EPROM programmer and a \\'Orking C-64 or C-128 for burning the chip.

1thout any typmg'

You can use the rname command to change the existing pro$!rams on the diSk to th new hlft-pace format. C-128 SO-Column Interrupt Routine•

HalV. Weant

Stephane Laroche

The chip to remove and copy s i U35 (next to the socket for the mternal function R0\1) After th Promenade s i made funct10nal on the workmg computer, copy the EPRO\t U35 into computer me mory with th Promenade command

Ste-Foy, Quebec

Have you ever had troubl programming the 8563 chip (SO column diSplay controllr) through an interrupt routine? Due to the Ylay you program tht chip, you have to design an interrupt that v;on't ace th 8563 at th same lime a program (or the butt l -ln S<kolumn screen edttor) docs. A dock that is displayed continuously on th S<kolumn screen is an example of a program that need to use such an interrupt.

£8192,24575,0,5 After that operation, check for an 81 'tlotth a peek(23586) to be sure everything Is ln its proper place. ext, poke 23586 \\llh 209 and th n burn a new chip l\Uh

I found a clean way to resot�e th problem. You have to begin your interrupt routtne with these Instructions:

n8192 24575,0 5,7 Install the new chip m the U35 socket and reassemble the Ced 12. You should now fmd the case of caps lock little q sol\

Ida $0107,x cmpt$c0 bee UIRO cmpl$d0 boc HIRO UIRO jmp 'your mterrupt' H IRQ JlllP $faGS

Sot I: The control \\'Ord nd program method \\'Ord used \ll.ith the Promenade arc th ones that work for the chtps found m most C-12 Check the Promenade manual to be sure of the

proper cod •

Jvl'f 1917: Volume I, laue 01

otc 2 II )'OUT C-12 should have 32k EPROM Instead of 16k ones, adjUst the dd to copy the who! 32k 1 e.

192,40959 and pok 39970,209. ote 3 EPROM used are 2712 (16k) or 27256 ( 32k). 32k Chips ha\e not been found m any 12 here, though the schematic

shows it to bed

ned for I 6 or 32k chip:..

C-128 Bullet-Proof Wlndowa

O.J.Morrlu Toronto, Ootarlo

The windows on th C-128 hlwe one fault: they're too frag1le. You get a'ntce prompt l ine all set up, then )'00 accidentally hit HOMEt\\'ICe andthe window Is "smashed". Here' how to set up a perman nt Y.1�. atth bottom of the screen

I Place the text that you want protected at the bottom of the screen, use any text colours that you hke, and use as many

You beginthe hookup as 1f you"re going to hook )'OUr C-128 to a 1i02 monitor. First connect two shielded \\1res to the 9-pm DIN plug. One wtr goes to pin •1 or •2 (ground connections), the second wire goes to pin •7. the monoChrome output Run these two wires to the RF modulator. connecting the mono chrome output from pin 7 to the video Input, and theother bnc to the ground connectiOn. If you are using a VIC RF modulator, openthecase to find out wher the connections should go- they are labelled on thectrcult board (the ground line connects tothe case

After the video and ground lines ha� been connected, all that re mains as to connect JlO"'e r to the RF modulator. The power contteetlons on th Rad10 Shack RF modulator arc fairly strnlght· forward - connect them 10 to the f.JO\\"ef supply power output, observing polanty. On the VIC RF modulator. the red wtrc isthe "hot" (positl\"e leadI, and the case serves ns ground (negativ )

Lastly, all that ts necessary IS to plus a hlelded cable lrom the RF output and run 11 to your 1V/computcr swttch, or directly to the 1V antenna termnals. Thm the pov.r on tothe RF modula tor nod turn your computer on in SO-column mode.

hnes as you hkc

2 Place the cursor a fe\\ hnes from the top of the screen. Pres ESC T to establish a \\1ndow. 3 Enter POKE 237,23 to protect one line; for eac h add11ional \inc protcc\ed, decrease \he value poked by one. 4 Clear the \\1ndo\\ \\ilh two HOMEs

For those a litt more ad�nturous, you can tap the needed power dtrectly from the C-128. There are �raJ location> avmlabl where the needed 5 volts can come from, indudmg: pin •2 from the user port, pin b-2 from the cassette port, and ptn i from ·her joystick port. It should be kept in mind, howeve r, that openang the case to makt• these connections wla l void any warrantieS, and so should not be done on a De\\'

That' it The bottom line() of the screen are now u ntouchable, C\"en if new wt� are t up and collapsed This works ln both 40- and SO-column mode, provided you set up the protected arc in both screens. Th protected area can be different for thetwo screens

C-12880-Column D pia)' OD a Telev\alon

•

machine.

I found thllt this solution was capable of producing a very good SO-cOlumn screen considering the equprnent used nod the fact you are using a television as an output device. Also I found the hookup was quiCk and easy to do and required no permanent changes to my computer.

BWWaJtoo

St. John, ·ew Brunswick

When I ftrst purchased m) C-128. one of the �� things I wanted to try w the CP/M mode. I soon found thai I needed lhe De\\ operating system (the mod m suppo rt version ) tf I wanted to get very far "ith 11 at all. At 1 he time I did not have the 1902 SO-column monitor nod was in fact usmg a small colour telc\ISlOTl asa momtor I found that! Y.CIS Ina catch 22 srtuation.l needed 80 columns to use th program "cpmrermI 28" ( needed to do¥.n load the De\\ operntutg system)and it only works n t SO column mode. My solution at the time was not to run out and purc h n 1902 monitor, but to hnd a workabl way to get 80 colu mns on m)'lV.I found a rather simp! and inexpellSI\"e way todo just thatand I thought I would pass it alongto readrs ofthe

1541 Half-Track Flx

Geoff Rob Victoria, Auat.ra.Ua

Disk read and write errors can arise whenth dr� gets stuck in between tracks from loa1mg programs that use half tracks as a means of copy protection. Before sendmg your dnveay.ay to be aligned, 1t ls worth running the following short program that steps the head half a track·

Transactor

10open 15,8,15, "10" 20 pr1111115, • m-w • chr${254)chr$(2)chr$(1)chr$(1) 30 close 15 end

All that as needed IS thr rather inexpellSI\"e pieces or hard ware. Y.htch I hon hsted below, and a coupl of �nps or scrap

v.ue to connect 11 all together.

1. 9-ptn 0-subm niature male plug (Radio Shack part 1537)

ll�lf).

Une 20 writes a I to PHASE (locahon S02FE). whldt is cheded during each interrupt by the code in disk ROM at $F'99C. If the value of PHASE h I, then the routine ancrcases PHASEto 2, and steps the head by half a track.

•276-

2 an RF-modulalor (RadiO Shack part • :!i7-221} (an o!d VIC RF modulator works v.ell, it's what I used) 3. A 5 to 7 volt f.lO\\"eT supply (Radio Shack part • 273-1454)

Check by validating a disk. If )'00 get a-en more errors niter running lhb program then you can just r er u n lhe program to r!turn to I he initial state. ,

Jvly 1917: VoUne I, l11ue 01

mand, tum your mon1tor off, and then hit Return Try changing room 1f you hav to Try your dri'e \\ith n friend's system U you can And if you ehm1nat the trouble. lm'Ok10g it again is not onl) excellent remforcement, but also sn you a feeling of nccomplishmerll Bel1C\ me, I kOO\\ .

Well, I wouldn t ha\'C behco.'Cd it unl 00\\ it has

it happened to me. and

I was havmg troub! wuh � 8050 dm 0 Loadmg programs \\ beconung a ral bother, espccialcy long ones The error LED woukl fbc r, and DOS would ocraslonally do a head-bump, creating fr some rather ngthy wa Program AVEs or \\riling an SEQ file had become impossibl on dnve 0, but I managed to cope USing dnv I lor narly ev1)1hmg

Karl Hildon, Edltor-ln-Chief

Ot.cure C-64 VAL bug

The prize for the most obscure bug in Commodore BASIC goes, \\'C thmk, to a rccentl}-diSCO\-ercd problm \\ith the VAL func tion. As )'OU kilO\\, VAL returns the numeriC \'alue of an ASCII numeral stnng, and most of us hB\ been using It for years \\ilh no troub! at all Yet th code for VAL conta10s a fundamental fla\\ that has been cy10g in wcut for the nght condition to manlf t 11 If

When I p&ured I cou1d 11\e \\ilhout m) 50 for a \\hde, I dcdded ii "' t1me to get her serviced The old sweetheart wen1

almost 7 years without so much as a peek und r the hood.l"' nt in to piCk her up and was told,'"\\ can t find an)1hing YOrong "1th it". DISr rdmg the SOillC\ha \ t impersonal ref renee, I 1mmed.at ly began a process of elimination that lasted all the way home '

Those conditions \\l're present 10 the sccond-la'>t version of th Help! program thar appeart..>d 10 the Transactor, Volume 7 I ue 6 8} the time the bug was traced \\'C"' rc nearly ready to go to press, there "'as time to correct th program, but not to update th artiCle. Hence there is a small but ignllicant discrepancy betYO n th text and rhe code.

··could I have been miStaken? Y.as I Just imag10ing all those read errors? No Ma�bc I just didn't hit h r hard enough at home and what�er ch1p wa loose got )arred on the way 10, enough to mak her start work10g in Maybe my diSkettes were bad. �o. they worked fine 10 dme I. Oh well. forget about 11 - it's baCk to normal now and I can get on With m} next task."

Here is \\hat the relevant part of th VAL routine looks hke on the Commodore 64 (1f )'OU warll to see the \\hole thing. it starts at $87AD) By the 11me "' get to the part of the routine st il ed below, th CHRGET po10ter has been sa\'Cd, and CHRGET now pouts to the start of the stnng being C\''llluatcd A po10ter to the b)1e JUst bc)'Ond the string h been set up 10 locations $24/25 The "JSR $BCF3" at $87DA ln\'ok a routtne that com'Crts a null-tcrmtnated string, oo through CHRGET, to a floattng pont \'nlue m FAC I.

Or so I thought I carted her downsta1rs, set her up, connected th ca • diSk 10, and Arghgh' ll's doing the same th10g as befor ' I"n1 back to Commodore and watched as they tested 11 "uh no apparenl problems So "h1 could It be? ' 'Check your env1ron· menl", id Ro} Since I didn 1 ha\ a bett r idea, that was\\ hall would do

87CF ldy 1$00 8701 Ida ($24),y ,got byte past end of stnng 8703 pha .save rt 8704 tya ,replace 11 temporarily 8705 sta {$24),y. With 0 8707 1sr chrgot ,Ida With fnst byte of st11ng 870A JSr $bcf3 ,convert stnng to noat ng pont 8700 pia ,recover byte past end of stnng 870E ldy #J$00 B7EO sta {$24),y ,put t back where 11 came from 87E2 ,restore chrget po1nter and exll

My 8050 sU on a shelf to the left of a B&W monitor that's connected to one of my C64's I ffiO\'Cd the 8050 as far left as I could, and the momtor as far to th nght as possible. Uke I said, I wouldn't ha\e bcl1C\cd 11 unl 11 happened to me. Just to be sure, I ffiO\ed the momtor back up to the 1de of the dn\'e agam, and the read error returned Turn off the momtor, �tart a LOAD no probl m until the Instant I turned the mon itor back .

on I don t kOO\\ \\hen It was that my momtor got too close to the 8050, or VICC 'er sa Alii do kOO\\'IS that I wasted two round trips to Commodore and countless hours denl10g "ith the absence of th sometimes \lltnl dm'C 0 Except for the aggravatiO,n the expennee was worth 11 and I'm glad I can pass it along. E\-en though m) troubles w r \\ilh an 8050,1 suspect an� dnve could fall prey to thiS tuat10n In fact tape, 'ideo, or any unit With a magnetiC Inrcdtcnt to it operatiOn could be affected. !} advtee? M) advxe

kk Sulli\"&D

Okay, the strategy here is to make the stnng temporarily null terminated so that the routine at $BCF3 "1ll kflO\\ when to stop, thn r ore the b}1e be}'Ond the stnng once the con\"Crslon to Jloatmg point Is done ThiS pproach 5a\ BASIC the extra time and troub!e of mak1ng a separal null-term1r.ated copy of the string SOIDC\\here else before doing the com.'Ctsion So do you see th bug.,

realcy m10c - cred1t goes to an astute Roy Robnson of Commodor Canada E'en if you haven't ffiO\"Cd your eQUipment you mght sa\ yoursclf a potential!) expcnsi\ tnp to your 'ICC center by slmpl� "checking your envuonment Espedal If read errors from diSk. Tr} ffiO\· mg )OUt dme aYOy from your mon r Try ent nng th comnot

The Help! program used a 17-b}1 Interrupt routine to S\\1tch out the 1/o chtps and charact r ROM so that the cod in the ThiS rout1ne could $0000 RAM could test for a special keyp go al l }'\\ here In RAM, but Its default locatiOn was at the top of It \\ protected from being BASIC, just above string stor I

JIAy 1917: Volume .. ..... 01

Sometimes whllc proofgen is making thts Iii the printer will suddenly become th output destination, printing exactly what

interfered \\ith l>y BASJC by lo\\ring th top-of-BASIC pointl'f by J 1 b}1 • as described In the article. This seemed like 8 completely saf thin to do

should be gong to dtsk The prOblem here could be in the proofgen program but it happens so rarely that I can't help suspeding the Ghnk. If nyone has notiCed a mtlar ' problem, let us know and w 11 go looking for 11 .

And It " . unl you happened to do 8 VAL on the first string created withtn a BASIC program What happened then is that the VAL routme dropped a zero on the flfst b}1 of the IRQ

routine to nu l-t l rr mnat the string then "nt off to com;rt 11. While this was gomg on an n i terrupt would happen and the IRQ n "ith a 0 (BRK) instead of a $7 (SEI) code, \\hich flO\\ waald be executed This a re-fire crash

w 00

The solutiOn, once the bu " ntifted, " Simp enough: " Just lo\\ red th top of BASIC by 18 b}1 instead of the 1 7 needed by th IRQ routm to gJV VAL the J b)1 of maneu\'t'T· ing room t1 required. And that IS why th Hclp! article and the Help! program 1u not qu1te tn r mem.

AH EM FO PN LJ HJ OL KK MH LE HL LJ HJ HP 01

300 fOfJ•57344 to 61439 rem g-1nk range 310 prmtl8,chr$(pe,ek(j)) 320 next : close 8 330 print 340 prmt • companng 'g nk 3187 $2000 350 pnnt ·tile With 'my g!mk rom' me 360 zS • chr${0) 370 open 8.8,8, • O.gl nk 3187 $2000 p,r 380 open 9,8,6, · o my ghnk rom,p.r 390 getl8,aS.aS gctl9,bS,b$ rem str.p start

Karl HUdon

FD KC AN CL MB GP HL

0\\nN I

In one " rsion I\ ootJCed that a mp!" SEQ hi read can bomb before reachmg the end of the rile W'tth the other I\ rte\'ef n the problem 1 don't know wh) it happcTJS, just that it does and it's anll0)1ng I also don't know why there are two versioTJS, or how it happened Howe\r, once I made all the EPROMs the same. the troubb"nt B W B\ ' • On Transactor Otsk 'J (for this I!; ) " 11 be including the G Unk ROM file should you \\ish to ro-bum your EPRO�I. II' a 4K PRG file and 11 LOADs to $2000. The program below "ill 1 II you if you need to do this update. You might think It looks rather long for uch a simple task.

Actually, Une I I 0 alone Is enough to determine which version you have. In fact, tf you switch )OUr Glmk to p��rallel mode: pnnt pcek(57625) should g1ve 173

LG LN AP HI OF

IM OP PK

"hole program Last!). I " ooticcd one other ghtch, but 11 \ry rarely occurs and only wtth one program th 1 001 many will ha\'C or use. The utiltty that creat program sti il n with the Verlfizer codes b roofen" Quue mpl), you load a program, I.J.)I 11 10 called "p diSk, then SYS to proof n. The V,n f ae rcod Is calculaled from the hne in memory and "ruten to an output fi Th n the same listmg

and

•

address $2000

addresses

If not, you �hould probably con r ding th update. Remem ber, I said earher that there are "at least" tv.'O version:. - th re may be more. but I doubt It Rc rd what \1llue the abo\·e PEEK rcturrts, th next part of the program will v.ril the content of your Glmk ROM to a disk file. and thn proceed to compare 11 "uh the ftle "ghnk 3/87 $2000" on Transactor Di>k you get Otsk J , ther • no point entr ing the I So un

ltne is mpul from the diSk

Wtth the g-1 nk rom file from 130 pnnt 140 pnnt • transactor disk I 18 1 50 prtnt 160 ptlnt " tf you would hke to compare the 170 pr nt • ent1re rom w1th the g-hnk rom 180 pnnt ·hie on transactor diSk 18, thiS 190 p11nt • ncx1 tcst Will wnte the contents 200 prmt · of your g-hnk rom to a diSk file 2t 0 pnnt · and proceed to compare the two 220 pnnt • f es we suggest using transactor s will be 230 prrnt • d 1 8 so that both fe 240 pnnt · on the same diskette • print 250 mput ·do you wish to contmuc (yfn} • a$ 260 if asc(aS)<>89 thcn end 270 print prnt • creatltlg f 'my gm k rom' 280 open 8,8,8, • O.my gnk rom,p,w • 290 printl8,chr$(0)chr$(32), rom make start

Hll\� any or you been experiencmg the odd ghtch \\1th your Ghnk? V< \ II so hB\c I. and I decided it was t1me to find out why. And to my complet surpr I found there are at least two versions of th Ghnk EPROM. Hey G-Unk

·I

re-burned"

G-Unk ROM Com�

1 00 rem g-lmk rom compare 1 1 0 if pcck(57625) • 173 then pnnt your g-1nk rom IS ok • goto 1 50 your g-1 n rom should be 120 prtnt •

EO MM JH AB KD

400 foq•57344 to61439

410 get,8,aS : a• st : llaS• • • then aS•zS 420 getl9,b$ . b•st . if b$• • • then bS•zS 430 if aS • bS then 470 4"0 x x + 1 pnnt difference at • ,J 450 pnnt • glnk 3187. • ;asc(a$),tab(19) ·my •

•

·I

glink. • :asc(b$)

460 prltlt

470 rf a or b then 490 480 next 490 close 8 • close 9 500 prmt • found • ,x, • dff ere nt Jocatons

51 0 print • g!nk 3187 &latus at end · a 520 pr nt ·my gl nk status at end • b

nt to the output me.

JWy 1917: vatume 1, 111'• ot

IDput lrtckery

Daruel J. Dyke

Bel Air, Maryland

Here IS 1 C-64 subroutine that I call be� any input .swement requinna the use of punctuation and the cursor keys.

•

8000 poke 198,5• poke 631 ,34: poke 632.34 8001 poke633,157. poke634,32: poke635,157 8002 return 1lle effect of thiS �brouctne is that 11 prints two quotation marks,

space. erases the second quote with a space. and backspaces again. When the data is entered, the input prompt appears to be followed by a quotation mark. Now any keyboard character, mcludang punctuation marks, can be en· tered as part or the input data. What is also important to note Is back spac

one

that u allows full usc of the left and right cursor keys. The computer is not in quote mode. but when the return key ls pressed, It lhtnks II b.

Ted Berh ArllnJton, VA

C-&1 Eftldent Keyboard-Chedldn ln Atumbler

Quite often we want to suspend a program's execution if the user presses a key. Here is a very simpl way to do this. Wherevr you � to pause the prosram, insert these two 10$lruc:tions

i the 64's screen editor. If the high bit of Here's a $lranse feature n the current character colour is set, like th�

• • .the DEL key will take on a whole new personality in quote mode: if there is any text to the right of the cursor, it wtll be hifted one character to the left, and the character under the cursor wdl be deleted. There is one ghtch, how·ever: the f11st time you hit DEL under these cond1hons, 1 garbage reo.er;e character wt11 be pnnted: subsequent DELs will perform as �nbed.

from BASIC

4 fo q 1 to 80 5 gettS.aS 6rS•rS+aS 7 next -

You can almost halve the time required by GET-'ing two �1cs With each GET• statements. Like this 4 foq - 1 to 40

5 get#S.aS,bS 6 rS • r S + aS + bS 7 next

No registers are used, and only the � are affected, so the

in$lruct10ns can be inserted al mo$l anywhere. If you want to pause a program until the user pteSSe$ a key, use these in$lruc· Sc5

B.tnoer Routine

In my t�ing l read 60 80-byte strini\ from a 20 block hie using each of the above methods. Here is the full hsting or the programs·

Version I

bvs nokey

C-64 Scrollln1

Andrew Mlller Atbeltoa, Quebec

Wh1le experimentmg wtth the MIDS function on my C-64. I constructed a scrolling "formula" which led to the following

program. ! find it an attract'i-"! attenlion-grabber, and not bad for 4 lines After RUNning h and typing n I your �. you'll be asked for the viewing area (the number of characte� of your message being displayed on the �reen at a time). Your messagt' 'Aill be automatically centred, and will begm to �roll. Here 1t 15·

Version 2

10 Input ·�· .mS: tnput • Vlewmg area · ,va : pnnt " : bS•mS+ • . . . • 20 a • 18-len(m$)12 If va < len(mS) then a - 20-va/2 1)+1efi$(b$,1): c$•left$(bS,va) 30 bS• : pnnt • • tab(a)c$ 40 for x • 1 to next goto 30 "

TM Ttwlsalar

•

Here is a �mple ItiCk that will double )OUr 1/0 throughput when doing GET•'s from a diSk file. Instead of doing a conventional GET• loop like thi:.

bvc wMkey

nokey bit

Eddie Anderson Orlando, Florida

Easy IDput Speedup

waakey bit Sc5

tions:

N ick SuJllvan

poke 646,peek(646) or 128

10 gosub 8000 20 1 nput aS 30 pnnt aS 40 goto 10 -

C-64 Undocumented Edltint Mode

1 open 5,8,5, • 0 datafde.s.r • 2 fon • 1 to 60 3 rS• • • 4 for j • 1 to 80 5 get#S,aS 6 rS•rS+aS 7 next 8 next 9 close 5 1 open 5.8.5, • 0 dataflle,s,r • 2 for ' • 1 to 60 3 r$ - • • 4 for 1 • 1 to 40 5 getl5.aS.bS 6rS•rS+aS+bS 7 next 8 next 9 close 5 .Niy 1917: ��-- .. ..... ot

The first vermn took 95 second to hnish. The second version took only 49 �s. I "" nt a couple of steJ)' further to see how much laster the program could be made to run Changmg the program to reid 4 byt at a ttme made 11 run in 44 seconds. Version that read and 16 byt at a tune ran m 40 and 36 seconds, respectlvcly.

Pte tames may be off by a second or so becaw I was timing the runs with a stopwatch. evenhel it seems that the biggest gain can be had mply by GET-'mg two byt instead ol one on

10. The systematic loop-variable names greatly help other peo ple to read and to grasp your programs, so it's \lery appropri ate lor published prog ra m. Contributors, take heed! When you've completed a J>«l8ram, etiminat unused l'- from the 01\1 n i line 1 10, and mr.;e the order ol the used l' so that BASIC finds the most time- nsuive, inner-loop l's first. for

example, if you never used more than the six nested loops (which is typical), the final form \\'OUld be: DIM L6.L5,L4,L3.l2,L1

eaCh GET• Ultement.

Syatrmatlc Loop-Variable Namln1

I've used this systematic loop-vanable nammg scheme for

se\'eral years. It's saved me so much time. effort, confusion, frustration, and grief that I wouldn't be ws t hout ll.

J.G. Krol

Anabelm, California

You can simplify FOR-NEXT loop programming and '>peed up

CralgEde Minneapolis, MN

loop execution time by codmg this hne beJore creating any other prOf!ram variables: 110 DIM L1,L2,l3,L4,L5.L6.L7,L8.L9.LA.LB.LC,LD.LE.LF

I recently changed word processorl>. moving from one which saves files in sequential format to one which normally saves files in program format My Yt'Ord processing file disks soon became full ol a mixture of different faletypes. In an effort to organize thin� I found out that 11 is possible to scratch all sequential fates from a dask (retaining all other filetypei) by using the following

Then as you wrate the p rog ra m: (I) use the low t-numbered currerllly-unused l as the loop-variable for each new FOR

NEXT loop you begin writing; (2) don't use these L's for anything else. Whenever thr are th� actave loops, for example. the L1 loop "ill be outermost. the l3 1oop innermost.

This )'Siematic loop-vanable namng scheme,

disk command:

though simple,

open 15,8,15 prantl15, · sO • • S · : close 15

ha.s many advaruages over the usual unplanned nammg ol loop

All program ftlcs can be scratched using.

variables.

I . The L-lor-loop names are mnemonic, apt, �rt. clear. and consistent, and they're eflortl to invoke when you need them. 2. The )t malic naming !Cherne eliminates the dreaded blun der of reusmg an act1ve loop-vanabte an another loop, thus wrecking the program. 3. The scheme ehminat all the usual head-scratching and "creatave" loop-variable naming aimed at avoiding that dreaded blunder. 4. Since unneeded loop-variables are eliminated, the total number of variable. is minimized, saving time and space. S. Loop- peed is maximized since BASIC finds the time sensltavc loop-variabl 81 1he front Of Its variable-table. 6. Loop- peed remains consistent no matter how many (hun dreds of) variables you aeate after the L's. 7. The nammg scheme provide$ a clear, convenierll, consistent way of thinking and talkang about your program. e.g. "the LS loop'', 8. The S )t ematlc names greatly clarify program structure: whenever you spot an LS in a listing, )'OU Instantly know )'OU're lnsid fn active loops - no matter how obscure that Clilical fact might otherwise be. 9. The sy�tematic names often reva1 program structure you \\eren't aware ol Eg. when you call a subroutine from within an l3 1oop, all elliS loops must be l4 or higher - and they might not be, nee you onginally wrote the subroutine you are n i voking from an Ll loop. RealaZJng that, you can easily revise the subroutine.

open 15.8.15· prmtl15, " sO • - p· : close 15

Wdh a DOS wedge of SOI'lle o;ort

place, the commands are

simpler:

@sO: • • s (101' SEQ fles) or @sO.• • p (fOI' PAG files)

(A more selectave scratch ol files can be done by using a filename pauem other than the '•')

This has proven very convenient in helping me separate the files from my word processors. I make two back-up copie$ of the file disk and mass-scratch all the program f1les from one and all the sequential fates from the other. It could also be used to delete sequential 'doc' files that are no toner � on a disk ol programs. Though I haven't tested It, I think this will work with user (USR) and relative (REl) flies also (check on a back-up disk fii'St)

the delele (DEl) faletype With the wildcard as it wi l l scratch all fa� from your dask. The folmmg � pocson:

WAR�ING:

Do oot use

OsO:• • d (pocson· do not use)

Nly 1tl7: ¥11MM I, 111ft 01

Amlp Biu Andrew N. Merder, Jr. Pope AFB, North CaroUna

Amlp Automalk: Up-Date

The Amiga prO\id a \'ery well maintained software dock, and since the Am runs a mulllUISking operattng S)�em, the fo lio\\ ing short routtnc may be used to kt..� the time and date on your SYS: dtSk as current as posst By wrftlng 10 the di:. once n i a while, th time won't be too far off whn you re-boot, �nee the system ts the time to when th dtSk w-as � last.

clicking th left button over the ones you want to select. When l l act as ff you finally release the menu button, the program wi you had selected each menu ophon normally, oneat a time. This i:. especially handy for menus with choices for many different modes or settings, hke a terminal program with options for parity, baud rat etc. Just click - click - dick to � up your choices without having to bring up the menu bar 0\-er and 0\"er again. This technique should work with most programs, i.e. those that handl mouse C\'Cnts the way the Intuition manual advises

Enter the tollowing command fil with an edllor or b)· typing 'copy • to ·saveDate' from th CU (pr CTRL- \ to end your mput if you usc the copy command)

Speedlnl Up IFF fUe Acceu It you are rcadmg an IFF hie from your own program you can c;peed up � and shorten the file b)· removmg any chunks that )our program <Joe:;n't care about For example, you may be incorporating graphiCs in a program by creating an image using an IFF-compatible paint program hke Deluxe Paint -the picture in IFF-ILBM form can then be read by your prosram uliing your own IFF-reading routines, or the standard public domain rou tines prov� by Electronic Arts and isted l in the Amiga R0�1 Kernel manual. ,

c.wat 720 m1ns c cd sys· c.date >sys:now c run >nI. c execute s·saveDate

Execute the command f1lc tn the background by typing "run execut saveDate". Th program wtll wait 720 minutes, or 12 hours, then wnte the current date lo disk and repeat the whole proc over again. The wait uses no CPU ttme as it run:. in the background, since It just waits for a signal from the timer device. If you wbh to have the dock updated more or � frequenlly, chan the numbef ot minutes In the first line to whate'\oer you want - e\'ery hour might be a reasonable choice.

i formation in the Th� approach works fine. but there may be n picture ftl that your program doesn't care about and tf you don't plan on using the picture ft for anything else. }OU mlght mpl that ot an ILBM ftle saV'ed by 8.\ wII remove it. In th ex a Deluxe Paint, The obvious chunks to remove are the CR'G chunks that describe colour-ran informatton, and the CRAB chunk that defines a uhot-spot", or potnl for grabbing the tmage. Removing these chunk \'es the 11me needed for the IFF reader to kip 0\Cl' them, \'Ohich can be considerable on floppy drhes due 10 r e ad /wn te head seek tune. ,

ote; the CD command is used so that DOS will put up a requester asking for the �em disk if it Is not n I the dn\'e. The redundant use ol c: nd s· lS to ensure that the correct com mai1Cb are used On the case of ltke-named programs residing in the current dtrectory)

To take the chunk out, you have to remove them from the file and modify the length of the FORM at the start ol the file accordn i gly. You could wntc a imple program in the language of )OUr choice to do thi�. but the easiest way is to use a text editor that lets you t'dit a binary file as hex. One such editor (perha� the only one?) b Aedtt by Joe Bo:.tic (ORM Programs, 1329 Arthur Ave., Las Veg;ts, NV 8910I). It lets you read a binary file and display it as hex and ASCII. You can edit the hex values, and they will be converted back to binary when the file i.s saved U ing Aed1t, 11 is a imp!� matter to remove all the CRNG chunks and the GRAB chunk, leaving ust j the initial FOR\t, the ILB\1, BMHD, and BODY. The longw'Urd alter the initial FORM >A111 have to modtficd to reflect the new size ol the file. For sunple ingle-picture IFF ftlcs, the FOR\1 1ength hould be eight b)1es less than the� of the file as It appears n i your du·ectory (using the CU Ust command).

Pattern Matchlnl With The Dlr Command

The CU command "Dir", a:> documented in the AmigaOOS manual, has qUite a few features. An e ... pec ia ll y valuable capabil· 11y of thts command, ho\\ever, isn't e\en documented: pattern matching Dir will allow an expl'i ion for a directory name like those used by the "PAr' option of the Ust command. and will display all ftlcs in the darcctorb that match the given pattern. So, for example, the command 'dir m· will d Lp la y the file:. in all directories whose name is three characters long; 'dir c-1' wi ll th the letter 'c': 'dir clfonts' display all director beginning w1 will display the 'c' and 'fonts' dtrectorles.

MuJtlple-meau Seltectlou

\hnimizmg your IFF' ftl bke this can yield dramatic reduction m reading ttme, especially tor small files.

l most applications, you can choose When using the menus n more than one menu option wuhout popping up the menu tor each choice. Whtle the mouse menu button is held down and the menu is displayed, 010\'C the po inter to the first option you want and dic.k the LEFT mouse button. Whil the menu button is held down, you can rno\ th pointt•rt oas many opeions as you wish, 12

� 1917: VolUme .. .... 01

Letters Wanted - Plus/4 TKhnkal lnfo: Can you or a read r help

i recursion nd AI, might"'nt You, or your readers Interested n

dtcr's books· Godel. EsdK!r. Bach and to look at Douglas H MeramagKal Themas.

me" I want memory map for the 6529 chpin the Plus/4. One ltke the cx cllcn t F'agurc C-1 0 in AppendiX C of J1m Butlerf�eld' fine book Machure Langua lor Commodore Machines would be ideal

John E Grham, Director EMC. Sinclair College. Dayton, Oh10 111arlks lor the lead, John And we'd also l1ke 10 endorse your

Also,"'h re and how can one get a copy of the drruil diagram of t P:lus/47 That would be a big help in understandmg the pr rammmg. machine and m machnc lan J1m Wc:lch, Santa Clara, California Wanted

recom

mcndotiOfl ofthe Hofsladter books One ofthe lhings that dislm uishes Hofsladter's AI work from mosJ ot� IS its mr p/lasis on the "mtrlllgence" m AI, he' interestoo "' mtelllgcnt machines. no1jUSI dcverprograms

IMG stripper for tape: CongratulatiOns on vejut discovered. "DownloaJmg your fine magazme, \\hich I ha -

Another IEEE for the 128: On page 14 of the Marth issue. n i

From CompuServ " by Christopher Dunn (Volume 7, Issue 4), has certain!) enlightned me "'ith a problem I ha� been encount ring.

l l Bennett, there was a request for a reply to n letter from Bi mformahon about a good IEEE interface for the C-128. The unit I am using Is an 1:-.TERPOD from England. I have been using this unit, first "'ith a C-64, and 1"10\\ \\1lh th C-128, without troubl for the past three yar. I use the INTERPOD With a four-po double-throw <witch so I can go bctw n the IEEE dk dm and the 150-2 and lSi I drives "'hen using the C12 .

I ha\ been downloading with nn XMODEM protocol terminal program on tape. The reason \\h the IMG files have refused to

run is now dear \\ould one of your technical staff, a contributor or reader be able to help me? I would hke to obtain a copy on tape of an XMOOEM protocol terminal program for the Commodore 64 capable of downloadmg both BIN and IMG Iiles with nn IMG bytc-stnppcr bu1lt 1nto th pt"CJSram !lowing IMG programs to run. Alterna· ttvely, a hstmg of same wou1d be most appreciated ty addr Australta.

ts:

I do not know lf the unil b st1ll available. I wrot a letter to the address in England about ordcnng another unit, but �c:r received a reply. I purchased the umt from: Oxford Co m putr S) ems (Software) lJd, Hensington Road, Woodstock, Oxford, England OX7 IJR John J. Schueler, K7QV, Sedona, Arizona

17 Sugarloaf Dnve. Chtrnsidc Park, V'K:Iona 3116, Philip Gahan

Ultimate frustration fix: After month and rnonth.s of playmg "e took a Slab at }'OUr dilemma, Plti/Jp, but quiCkly de/ermined Ultima IV (six to be exact), I finally made It into the Abyss. But that Wilhout a sample copy ofa tape, rt wouldn ) be WISe topnnl "'hen I got there and had to answer the IJt!l) losl questiOn m the aprogram thaistriPS on l'tfGjj f heoderbasedon speculat/011 It whole game, I got it "'rong h took me a couple of more month you hoor from someone that a/rood) ho th1 p10gram. then I to figure out what was wrong ther IS nn error In the visions you ng in the shrines Instead of getting. uess we don) needto re-uwenl the whccl IIyou don'· sendus a get when pr8)i 1ape wtth a BIN m on one sid and a .IMG 117e on the other, and we'lllo ke anolhcr shot at II .

ri' J!' I � I 1- f I

you should get th following

A lead on cables: A posstble suppli r for leuer writer Doug Hurd of Pentidon, British Columbia (Let te r, Volume 7, 1ssuc 6), who needed righl angl connectors and long rial cabl among othr things, is Value Sort, of 9513 S.W Barbur Boule\-ard t.l-56, Portland, Oregon 972 19. They have an d in Run ma�nine (3/ rial cab! for $995 (lJ!)l. 87) listing a 9-foot right an

'ow all or you who have bet>n beatmg your bran� out trying to ragure this out (as I was) can finally get on to your d iny. . . Paul Reev . Ham1lton, Ontano

Keep up the great work. Th Transactor with the TPUG lnsert has got to be the best deal nny"'here for Commodore freak ! Really enpy the cover art. Volume 7, Issue 6, \\ith the robot sculptmg aseU-portrail, ls perf ::t for an ue "'ith an article on

Ordinarily we don l publish game tipS, and this ISIJ � meanr to be a pf'f!Caknt (sc put doun your pens nsht nou:) Bul lhe ideo of Transoclor rroders beatmg their bmms out loT won1 ol this mformat100 was more than we could Sland

recursion The naneactor

Jut( 1tl7: VoUne .. .... 01

Greek drlla.: If any of your readers would want some drt l ls on Biblical Greek. have them nd me a diSk with some thing they think Is really useful. educational, or entertaining, and m 6change I �111 send them a diSk wuh the Greek on II. These are more than vocabulary drills. Included are exercises on identifying verbs, nouru; (5 case system), participles, infini· ttves, and adjecttves on the book of I John. II Thessalonians Is the next book of the 'ew Testament that wi l l be covered. 1y address IS 23 1 1 Creswell Road, Bcl Air, Maryland 21014. Oanlel J. Dyke

Hardware book blurb: I would like to inform you reader of a book I have wntten whiCh I believe may be of interest to them Entitled Electronic Com/XIttr Project), it is published by COM· PUTE! Public&tions loc., and is now a�. Electronic Compt�ter Proj«b is an introduction to computer interfacing and dtgatal electrontes. It is written for users of the Commodore 64, VIC 20 and C-128, as 'tliell as the eight-bit Atari computers.

As a computer and electronics hobbyist, I believe this book w1ll

be helpful to users who have done some exploring ol their machines programming-wise and are looking for new interest· mg &nd exoting than to do With their computers. This book introducet the reader to computer control and monitoring of items in "the outside world" through the constructiOn of projects consisting of a hard'tli'are and a software component. While the projects are useful in themselves, they also provide a ba$1$ lor readers to begin designang circuitS for projeCtS of their own. ,

The book is available from: C0�1PIJI'E! Books, P.O. Box 5038, FDR Statoo, 'ew York. New York 101SO (toll fr 1-800-3466767; n I New York, 212-887-8525); or in Canada from: McGraw-Hill Ryerson. Ltd 330 Progress Avenue, Scarborough, Ontario M I P 2Z5. The suggested retail price is S9.95 (US). .•

Soori Sivakumaran, Burlington. Ontario Groundlna to a halt: Your is.we on Gadgets and Gizmos

inspired this letter. I am an amateur radio operator, and use my C-64 mostly n i connection wllh my radio hobby. Some months ago I lost a 6526 ch1p and had qu1te a bit of trouble gettmg another from Commodore. I would like to caution your readers who ar interconncctang their computers wi.th orher equipment about one of the SfleUy problem that can spoil their fun. In my case I have my 64 on the beoch with my amateur radio equipment and neral test equ1pment. For safety's sake. one learns �rly to ground everythlna. so I have bare copper wtres running across the bench at 5'e'Veral spots where they are out of the way but easy to connect. All equ1pment is of course grounded. But originally not the Commodore ol course. It has a I S41, an 80I , and a monitor, all intrconnected. And each plug has a ground; what more could be needed? .

When I bought the monitor, my w1fe advised me to buy a colour 1V Instead of a Commodore momtor, Since we could also use It for another 1V if the need arose (not to mention how I would use a computer without a monttor!) Since he ha:. been advbing me wtsely for thirty )ears (and I know where my buttered bread comes from) I bought the colour 1V, a nice RCA 1 3 inch colour set. And It did well When I decided to connect my Commodore as a terminal for my R llY interfac I was afraid of damaging the OA chip, so I carefully studied the diagrams, and finally decided that a buffer was called for, to be alll'iolutely safe. So I mounted a couple ol 7404 TTL chips on a perf board, and �llh an edge connector on one side and a socket on the Olher it fit perfectly on the USER interface. and was powered from the Commodore. With diode clamping to TTL levels, and w1th the Commodore chip a CMOS (and able to take I 5 vdc), nolhmg could get through that buffr and hurt my computer. Or so it med. I connected the cable from the R'ITY interface to the buffer, turned the system on, and promptly burnt out two inputS on the CIA The computer would still work for pqranl) and games, but no more CompuServe! It's a good thing, although I didn't thmk so at the time. that 11 took two months to get a chip. I Wb ure the buffer had failed me. After all, electronic equ1pment is untrustworthy 1n general, and �imes tricky. Ung analyzers, oscilloscopes, and every technique I have learned over the years, I hunted for the elusi\e interm1ttent that had damaged my baby Commodore. Nothing. After a month ol part-time test.tng I gave up. Another month and the new ch1p came and I had had tune to use my last resort technique. I thought about ll. Then I connected a vobmeter between the R J"JY and the buffer input (wi t h no other connec tions) and turned on the radio. No potential d1ff reoce. I then turned on the Commodore. the I 541 , the 80 I , and the TV. When I switched on the 1V, the voltmeter immediately jumped up to 30 vdc. And an old memory urfaced. Solid state tuner sometunes put out a de voltage, which hurts them not at all, and is not noticeable, but which is enough to raise the ground on the Commodore to the same voltage. Then if connt� to other equipment which is truly grounded, you ha\-e a problem. The hx is simple. Be sure your Commodore system, when po'tliered up, has no differeoce n i ground potentta.l wllh the system you arc connecting tnto. Otherwise, you may, like me, be Wllltng for a chlp. I enjoy your mapzine generally, although many times your writers assume I know more about a subject than I do, and then I am lost and cannot follow what they are doing. Keep up the good work. You have the best magazine on the market. Carl L Henry, Bowling Green, Kentucky Hoe. in Inner Space: I would hke to take thl) opportunity to thank you and your excellent stalf for producing what is quite

certainly the most useful book currently in print for Commodore computers: � Complete Commodore Inner Spoc� Antlw>log_v. Thanks lor the C0\1AL memory rna�. those are the only

COMAL maps I've ever seen. And yes, I even use the periodiC Jlllly 1M7: ¥Illume l, fuye 01

tables! The Wordproc 'ng Reference Guide -A-as also a wonder· ful idea - t\en slightly mor accurate than the PaperCUp manual. I trust Speedscnpt commands wall be ancluded in Anthology II as -A ell. As I am sure you already know, CCISA is not entirely complete.

In Anthology II, I would nppre1.t1e a mall �lion detailing physics formulae. The current small section on forces is really only a start. I make regular use ol both the umt conversion table:. and the geometric volume tab�: however, I noliced the o mi sao n of the umversal volume equation from these fine table). v

41M

h /6

Area et top M • Area at midpo•nt B • Area at base h • he.ght -

OtGioia's otherwise excellent article. Perhaps the EXIT nn keyword could be modafiC'd to set a �o-varlable (like Sl) Wtth the value ol unn" b 'AII as exiting the structure normally. In this way we could know that we would alwa)'5 come back to the point we left when doing a CALL or GOSUB and �111 ha\e the flexibihty to decide what to do when we get back. Douglas Haurem, lansing, Michigan March 1987 issue containi an article m pa tibi h ty and Operabibty of the C-128 CP/M+ entttled ..Co Operating System" by Ralph Morril.l As the lcadang interna tional user group providing �uppon for CP/M, we at FOG were naturally plea.� to � the vastly under-explored CP/M+ side ol the C-128 being brought to light. Thousancls ol C-I 28 owners have joined our group �king just the type ol information Mr. 1orrill writ a bout. FOG � The

One point ol the article needs explanation. Mr. Mornll wntes, "Not one piece of Osborne software from the First Osborne Group's (FOG) public domain library that I have acquired will run on the C-128." As a matter ol fact, the vast majority ol our

This equation � particularly useful when de£1ing wuh iuegu larly shaped ftgUres (In case one should t\'er happen to forget how to calculate the volume ol a frwotum ol a cone.) Kevin Smtth, Edmonton, Alberta

currrnt library runs on the C-128, as attested to by our growing C-128 membership. FOG's library is tested, documented and well organazed. Program:. which are comput r-specifac are

Thanks for the input, K��;in As you know, we try not to leave anything out ?'el'haps )'OU could smd us a list oft� ph):.ICS l of the result:. they formula you mtntion, or maybe JUS1 a iSI produce so we could rnearch them lor you And 11anyone � has ideas for AtUIJoloey type 111/o, we'rp always opm lor

Our library was once davided into computer-specafic sections. including librarie:> for Televideo, Kaypro. Morrow and Osborne. It has come to our attention that d�ks ol our old library are being � by some poblic domain softWllre houses. Please warn your readt'rs (and writers) that the reliability of the software acqua� from many of these �rce5 is at best questionabl .It is dear that Mr. Morrill did nol acquire hb software from FOG.

Structurlnt Buk Protram•: I read w1th intere;t the article "Structured Programming on the Commodore 64" by Frank DiGIOia (Volume 7, Issue 5) I program on both large mainframe computers (for a iving) l and mall micros (for fun) and try to U$e the techniques ol top-down design and modular programming n i boch environments.

clearly labelled.

Another possible source of Mr. Morrill's problem may be that the d�ks he tried were Osborne single densit)· format. Our current library il. on double density formal dbks The 1571 drive will read Osborne format only if ti is double density. I really wish Mr. Momll had called our office when he had a problem. FOG has a full-tune technical support staff to help our members. We certainly would have made �ure Mr. Morrill had up to date information for his rtide.

While the extra structur� (WHILE-WEND, REPEAT-UNTIL. CAll.-PROC) can help your program be more structured, it is Basic 2.0 on certamly po ible to wrtte structured Basic wath ust j the C-64. Top-down design is possible n i most programming lan�. and Basic ls no exception. Modular programming is also possible providing we follow the cardinal rule ol"one entry, one exit . This rule is -Ahat has given the GOTO a bad name. If weonly usc the GOTO to branch to the RETURN ol a GOSUB or the NEXT of a FOR-NEXT (perhaps w1th a "CTR • MAX" statement to make our FOR CTR • 1 TO MAX loop end nicely) I great shape. The only other thing to watch for is nol w are n entering a GOSUB-RETUR� module except for one place: the

FOG welcomes C-128 owners to joan our ranks. Our award wanning FOGHORN newsletter is unmatched ti a source ol CPI M informataon. Our inttial of fr to C-128 owners ol a free disk ol CP/M software with membership has been such a tremendous success that we have extended the offer through December. Your rcad�r� may write to u:. for further information at P.O. Box 3474, Daly City, California 94015-0474, USA FOG 1.s a non profit corporation.

top.

Ronald V. Forsythe, FOG President, Daly Caty, California

If we need to go to one ol several places after exating a module (processing one ol several t� ol input records read by a common read routine for example) a uretum code'' can be set by the module to a value allowang an 0� GOSUB (nol GOTO. please') to direct us. This b the only problem I had with Mr. .

•

Thank .)'OU Mr. R:Jrs,)the! w�·ue b«n wottins lor a lrtter ltke )'OUrs a long time. I'm surt many ofour readers uti/tak� you up on )'OUr offer. esJ)«ially the one5 that have preuiou�ly 111quit?d

aboutJUSI such a sourr� of CP/M l!lformatiOI! 11

JWy 1917: YoUs• 1, 1 1... 01

SimpUfylnl the raJd: y m? I usc relative hies a lot, and that occasional bug driv me crazy. I vtelcome Shiloh's IWd (January 197) but I don 1 want to run an eight hour test, I just want th fil to work. I v spent 2 hours studymg the article and just want something simp Can you print just a small routine to be Inserted when positioning to a record? Max Chapman, Reno, Nevada Wei� maybe ll was a llttle Cf)ptK., Max However, '' our calculatiOflS are oorrect, the subroutine below should do thejob lor you \�1ren )OU open )'OUr TCiatu.K! file, S(>( the variables LF and SA to }'OUr file' logical m number andS«t>>ldaf) addres.s respedtLid), andset the vanable L to the record lenfl,th ofthe file. You should also uuuallze to zero the LIOriobles SR. R and \\� whic'h are used mternal(v by the subroutme. Belo� untmg a relative t!C O r , Jusl tthe varKJble N to the n.wrd numberyou d wont, and call the routme With GOSUB 9()()(J \l-Ith thi:. version you uY/1 have to Ulftle the u;llulc record. postllomng to mtd record :. i rlOI �upportf!d 8970 rem post1on to relat1ve record before wnte 8980 rem from shBoh's ra!d (c) 1987 dav1d shDoh 8990 rem edaptod from tho transactor, volume 7 •ssue 4 9000 if sr then r1 • sr + 1: r2 • sr +2. r • 2 9010 q • n•l. Q% • Qf254 Q• Q·Q%•254 sr - -q%·�>Q) 9020 If sr then sr • -q%•(q-l- 1) 9030 h%- n/256 lo • n-h%•256 9040 rem potnt tWICe and wat if needed 9050 tf r then r•r-1 Q%•r1 or Q%•r2 then gosub 9060 w• 162 9060 prtntlfl, • p • chr$(sa)chr$(1o)chr$(h%)chr$(0) 9070 1f w then poke w.2 watt w,32. w • 0

9080 return

Double Deoalty HR S&P: I \�.ish to expr� my thanks to Mr.

Bose (Let t e r, Volume 7, I uc 5) for hi kind comment:. on Hires Search and Pnnl. HIS ugg�ion to enhance the program's output w1th doubl density graphics i:. a good one and I have taken 11. Six IJytc.s mu!>l be altered and eight more added to the program to effect the change. This 1s a �mple ftx in the source code, and I include the mformat10n here for those who entered the program thts W'll)'.

Under CKMOR: tell prosram to send 800 in�tead of 400 bytes for large print LOAI32 replaces STA COOE+2 replaces LOAI3 replaces Und r END. reset stng b)1es LOAI1 STA COOE + 3 LOA 1144

LOAI144 STA COOE + 2 LOA I1

width cod for 400 rather than 200 (added code)

reptaoes replaces

STA CODE+ 3 LOA 1200

Under NXTBYf: pnnt each byte one more lime to compensate for double d nSily. ote this change ts required in two places

wilhm �XTBYT (ie. replace the two single "JSR CHROUT's with

double "JSR CHROur's)

JSA CHAOUT replaces JSA CHAOUT

JSA CHROUT

Under CODE· chan pnnt r cod from 200 to 400 b)1es per

line

OFB27,76,144,1 replaces OFB27,75.200,0 Unfortunately, no easy change ts availabl tor those usin� the Basic loader. Quite a few DATA numbers change after re �mbly due to addf1 altcratio� caused by enlarging the program. For those. I ha\e momtten the Ba« program 10 include the enhancement and have formallf:'d t i as a generator rather than a loadr. Thi \1.111 create a dtsk-bao;ed object file that loads much quickN and takes less disk c;pace. If there's room, perhap� 11 can be mcludf:'d on the The Transactor Disk in a future issue. Jack R. Farrah, Cincinnati, Ohio Thanks for taking the tTOfJble, Jack Though there C. unfortu· nattf.�· not mough room in the maqonne to pnnt the new pl'f)(lmm gene rotor, the double densit) uet'SIOn of Hi-Res S«Jrch andPrint u:il/inder!d appearon TransactorDi:.k •18 (this�)

"Fast flle" relocation: Th "Fait F'll

program (Volume i, absolute u j mp nst I ruction (JMP "

Issue 4) on page 6 contains an $COSO) and ls therefore not rloca ta bl as vt r it t e n .

The uncond1tiona1 jump can be transformed to a �lati\'e jump by replacement w11h: CLV BVC +7 where " + i" i:.the poslli\e displacen nt of the relatiVe branch instruction \1ake these chang in the original program: 60 if c<>1 1 584 then pnnt ·'data error! · : stop 180 data 8, 76, 249, 224, 132, 97, 184, 80 190 data 7, 1 45, 53, 200, 1 96, 252, 144, 232 It would be nice f i Rick N� furnished more information concern ing the undocumented parts of the SYS in.�ruction used in the proaram, along Wllh the �rce code to accompany the machine language data statements.

I "'OUid like to � U It is possibl to modify the �Fast File" uhlily for usc Wllh COMAL 0.14 Lewis C. Blown, Rowa)100, Connecticut A dl11ent1n1 �ote, for C Power: I am a programmer, experienct'd n i many languages. On of my favourite languages " i C. I own a Commodore 64 and enjoy programming il beau� e\lerythlng 1$ � occessible with so hule eflort! The Introduction of C comp1 r:. !or the C-64 was a great day Jar me. Naturally I J.;, 1tl7: VolUme .. laue 01

read with some interest Adam H rst' comparison of C comptl· er 10 Volume 7. I ue 5, and I feel I must take issue ''ith some of hi!> conclu..,ions I purchased both of th compiler wh n they were introduced, and quickly decided on the superior package C Pow r. Mr. Herst dl'CnCS several alll'ged hortcom10 of C Power, and ultmlately recommends Super C for novace to inter· mediate programmers, and says that at is a toss-up for experi enced programmers. This is unfortunate. I would hke to addre-;s h c o n cl uio ns and1vidually and provid my own �rvnlions

allo¥1 i/o reducction. and some standard UNIX uttlif are rfae . I find il stralghtfOf"''llrd included I like the command nt ic and functional. Indeed, functional is my descnption of the 0\ rail package. It is not fla.�hy, lt is not cute, it �mply does what il says 11 ¥>111 do. That s i extremely important when wn ting programs. as it allows me to c:oncentrat on the program being wruten, not on th environment in which I am ¥>Tiling In concJuc;ion, l can only recommend the C Power package. The non-tandard format ot the text hies used b)• Super C. the fact that programs can only be run from the shell, and the slow cxt.'Cutlon times 111akc it the less d rabl of the two packages.

First, there i£ the question of documentation. Mr. Hrst lamented the lack of a tutorial in th C Powr package. and the dearth of examples. I found that there were uffadent exampl of e1.ry· thing, especially in ltght of the clear explanations fli\Cn 10 the documentation. M� compiler that I have purchased do not come with languag tutorials A compiler i5 a tool. II hould amtam ilbtructions on how to use it A tutorial is extra (\\'ord processors don't contain lessons on gram111ar, do they?) I found the documentation that accompanied C Power to be quite compl(.'te and accurate. h i:. to Pro-l..ine's credit that the docu· mentation was clear and �rt. II ms to have been "'ntten for programmers, as 11 should be. I am nbl to find answers to all my questions quickly and the answrs are lllater-of-fact, t not tuto rial n i style. I hke that. M)' copy of C Power came with the C Primer Ptu book from SA�tS. Thi is an excellent text, and I find that I use 11 as my pri111ary C reference. Pro-line did Indeed drop but, as I ld before, 11 was extra to begin the text 1n later rei ¥>ith. I did hnd the C tutorial in the Super C package to be excellent. Indeed, I thought it was the best part of the package, but to condemn the C Powr pa • because It does not cont;un a tutoraal is missing the mark

Herb Ro.. e, Dale City, Virgmia

C Converter for per-C vi: I "' happy to Adam Herst's rticle on C for the C-64. I was beginning to wonder if I

was th

only C-64 owner working ¥>1th the languag

•

Unfortunately. I am u�ng SuJ>(.'r-C Version I . Adam's hie con· verter ¥>111 not compile and link as written with that ,.rsion. changes necessary to propcrly compile and hnk th pro gram ¥>1th Super-C vI are a) follows: The

In 111ain( )

l)•andude ·a dao h · to •mdud "stdio.c" 2) fgets(inbuff,254,inchan), to gets(inbuff 254,inchan), 3) r.tatus EOF; to status • EOI; 4) fputs(outbufl, outchan): to p u t s(o u tbuff, outchan). =

The lack of graphics functions In C Power i:. unfortunat but they arc \'el}' easy to implement. OtheNisc the library functions

In namefilc( ) 5) gets(raame. J 6), to gets(name,J6,5TDIO);

are complete for the vast 111ajorily of programmers. In convert( ) and copybuff( ) 6) char inbuff; to char •inbuff; 7) char outbuff; to char •outbuff,

The hnker optaoll5 m C Power are much more flex1ble than those

provided In Super C. You can link your C programs to be � and run as a Basic ft You can also hnk them to be loaded and run under th shell, ¥>ith romOland line arguments and I/o redirection. You can also hnk th m to a fuced addr to be mttiated w1th a SYS command (for "'ro� and otlt r nice things) Super C prosram.o; must be executed from the Super C

Chan 6 and 7 occur because Super-C \'I defmes undimen sioned arrays as ha•ting null elements, except where inatial values are set at defanllion. In the case of the Con\ rt prosram. moving element� bctwC(.'n the null array) produce. an O\Crllow error. Using pointers remedies th problem.

shell.

The one area that is most important to 111any programmer., is ext.'CUiion speed. He does mentaon that C Power hM the edge in that category. HAS THE EDGE?m?l!!! My version of the prime number �e program took I I limes M long with Super C compared to C Power. Ele\-en minutes compared to one manute. Super C code exeoot slo\o.-er than compiled Basic. The one bench111ark program that he f!l\ results for is i/o lnt nsrve (a file conversion program). That is not a \'alid test of program executaon peed. Th 1541 disk dme s i the slowest dri\'e on the lllarket and the 1571 ls not much better. H� program b limited by disk speed, not program executaon peed.

Chang library.

I through 5 are due to d1fferences

th standard

Thanks for a fine magazine.

Terry D. Decker, Oklahorraa City, Oklahollla Super C and the

RAM d.l.sk: In reference to Adam Herst's

artid A Tale ot Th'O Cs" (Volume 7, 1 ue 5): I hav taken the lib(.'rty ot modifying his •Seq/Usr convert" program (for Super q to alloW' it to be used from the A or 8 disk dm·es or th RAM (H) diSk. I also deleted the printing portion ol the program as I found thi:. savt..>d a lot of time in the con\crsioru..

The C Last, let me comment on the m:erall f I of th pack Po\lter shell ls UNIX-hke, in that it is comrraand-linc driven,

Jllly 1917: �l ite I, IIITJie 01

Con\'el'ling a 30 block file I got the lollowing tunes onginal (a disk to a diSk) with fa printing new (a or b: to a: or b:) no ft print nev.· (a or b. to ram disk) new (ram disk to a: or b.) new {ram diSk to ram disk)

Or I can use �tiX (which, by the way, � a \lery good implernenta· tton of C), which works bt>autifully on the RAM disk in CP/M. I will now get off the � box. I hope all ofth� has been of some interest to )'OU and the rest of your readers

I �21 OA6 0.25 0.37 0.18

Joe FaUSI, Lompoc. California

lJnfortunatel)� we don 1 hatJe pace here lorM!. mJision olthe

I feel that these times make it worth the trouble to copy the program to be convertrd to the RAM disk. In regard to the RAM di.5k,l contacted Abacus Software and they provided me with a program to increase the use of expansion RAM to 128K Aft r expenmcnttng wath it for a while. I finally found out how to expand the RAM d�k to 1985 blocks or 496.25K. using the followtng program: 1 lltlCiude • h.stdiO h • 2 t.le outchan: 3 4 man( ) 5{ 6 •(char •)Oxed06 • Ox7e, 7 8 outchan -open(15, 15, · u: " ): 9 close (outchan), 10 }

$7e $7f

pphlns on one acreen: The TransBASIC graphing module by Paul Adams ls the answer to a prayer -

TrauBASIC

almost. The program I want to use 11 in 15 so large that I just can't afford the luxury of two hi-ll!$ �reens Is it po ·i b l e to modify the graphiC routtnes so that they only write to one screen and leave the other 9k available to Basic?

I don't have any idea how bag a pro)eCt that would be. I hope someone wtll take 11 on, and I hope you will be inclined to print the chang 10 an early issue. The Transactor b great. Please keep on doing what you're doing. E.D. Berners, South Bend, Indiana It look$ from the code Cb though the sunplesl way 10 make the

The following hex number poked into Sed06 by line six of that program result in these oo nfiurations of the RA\t disk: S30 $40 $60

Convtrtprogrom Hower;er, 11 ui/ 1 be lllCiudedon the Transactor disk for this �ue

737 block free (the expansion �ggt5ted by Abacus)

993 blocks free 1505 blocks free 1985 block free

chanqe you wantmoolves allt>nng exactly lour ilieS l of code m the orig�nal module. This IS going to ltove you u:llh a module that b much la�r than nectsSOry (it uv11 slt71 contam all the now-redundant code to handle SWitching betWf!'en the scnms). but a uAolesole re un t e b unfortunately beyond our I?:SOUI'Ct:S He" ore the modifteotiOft you would havt to make:

13002 : sta (t4),y 1 3038 ld)( 13 13502 1400 byte $8f,$48,$00,$00,$00 15146 hate .word SeOOO

0 block free

After $7f the count ecms to tart back up agatn. It is interesting to note that although at $7f the blocks fn.-e were 'lhown to be zero. nothing in the current RAM disk was erased.

you tllat t/11� set of chanses ts untested; howe�Rr. we thmk tht>y'/1 do theJOb foryou. Good luck We should

So much for the good news We muSI now deal (again) wtth copy protection. When I tried to copy the Super C edttor, compiler and linker to my big new RAM disk, I found I could not. When I asked Abacus wh)', I \lt"a.S told because it was copy protected They said there was nothtng they could do about it .

•

Bundllnl l'rauBASIC dlalect.a: I would hke to get )Orne instructions for the use of TransBASIC, if I could. I ordered the � a few months ago from the Transactor, and have found it a worthwhile, cost-effectiVe program HO\\-ever, I do not understand how to hnk my own programs to the TransBASIC dialect that I have used to wnte the program.

• •

CL'Om

Wdl, in my othr C-12 mode, CP/M, a friend loaned me his tiX C Compler to try. I wnt out and bought It although I could huve just oopied 11, as 11 was not copy p rotect ed It \lt'OUid of . . .

first of all, I mus1 explain that I am not a hll(ker or a �tech�"; I am a high school English and history toc he r and am interested n i wriling some mple software for u in my classes. I nave found Basic 2.0 10 be cumbersome, so I hav been looking for a Ba:.IC extension that I can use wt th my program wnich \ltoold not ha\-e to be loaded prior to loading my program.

course not have been much usc without the very large manual that oomcs With the program Super C would be �en less use without its manual because of its norHtandard features So I guess the thing to do now i so out and pend 'lOme more money on a program breaker that will allow me to use the program I ha\e already purchased tn the way ft should be uc;ed. 11

Jl/kf 1tl7: Volume .. .... 01

Is it possible to do this with TransBASIC? If so, could you explain to me in simple, layman's terms how to do it? I have read the manual several times and, as far as I can figure, I have to use the Datafier to make data statements. Beyond that, I have no idea what to do. Bob Irving, Brockville, Ontario

that promise. The system it uses for placing notes on the staff is a lot more flexible. . . although it seems odd to me that they wouldn't use the even more elegant method established in the Macintosh version (where you place the note on the score, and then drag to the right to choose the timing value - what could be simpler?)

After you have assembled your TransBASIC dialect, and noted

I have the Mimetics "Soundscape Pro Midi Studio". As a multi tasking work tool, this could be a big help to me some day. . . but at this point the sequencer section - which s i what I have the most need of - is lacking in any of the sophisticated editing features most other sequencers coming on the market have. Still, I remain optimistic on this one.

the hexadecimal start and end addresses of the object code as given by the assembler, you should load and run the Datafier.

After the run, your dialect will be in memory in the form of a

loader subroutine beginning at line 9000 (you can renumber it if it will conflict with the Basic code you have written). •

The next step

s i

to merge this subroutine with your Basic program. First save it to disk as a temporary file (e.g. SAVE •

TBTEMP • . When

ground-breaking things people were predicting for the Amiga, all I have at this point is EA's "Instant Music". This is a wonderfully entertaining program, loads of fun at a party. Although not really a composer's tool. I still applaud the authors for a job well done. I wish there were more music programs as imaginative.

is to add the follo wing lines to the

And while I'm wishing, here are some other wishes. Why is the Amiga the only major computer on the market today to not have:

TBTEMP • ,8). The easiest way to do the merge is with the ADD

fast merge command on the TransBASIC disk. You can enable

this command by loading and running the TransBASIC program again as though you were about to create a new dialect. Now load your Basic program and type, ADD

•

you get your READY prompt back you should have both your original program and the Datafied dialect in memory as one program. All that

remains

beginning of the program:

As an example of a clever music program which does the sort of

a full-featured midi sequencer • a voice librarian, at least for the DX7, preferably for others, and • a vi sual editing program for the Mirage. •

1 if peek(773)<192 goto 3 2 exit 3 gosub 9000 i will cause the custom dialect to be poked into memory and Ths

enabled on each run ofthe program. Save the modified program

back to disk and you're done.

Amiga music software shortage: I am a professional com

Nothing would please me more than to hear that I am wrong, and that programs like these are available already. However, after many months of perusing the various computer and music related magazines with not so much as a rumour, it would be quite a surprise. So how about it. Does anybody have any surprises? Rob Bryanton, Regina, Saskatchewan

poser and musician, and the proud owner of an Amiga since October, 1985.

More Superkit sorrows: I would like to add yet another voice

to that of Roger Detaille, Therese, Quebec (Letters, Volume 7, Issue 5). I also purchased a copy of Superkit 1541 during the summer of 1 986, after reading your glowing review (your review is still 'glowing'!) 1 suffered some real problems with this pro gram. Many of the functions did not work correctly. I have written two letters to Prism in Waco, and have never received any acknowledgement that I had even written! In short, "little boy, don't bother us", seemed to be their attitude. I realize that the program only cost $29.95, but one should receive some value for the money. I also realize that I am a 'hotdog eater' subscriber to Transactor. I notice that you have accepted adver tising from Prism and suppose that that will make all reviews sound very good! I have written them twice. even about whether the new version, which I am supposed to be able to purchase for $10, was a significant improvement over the first version; complete silence!

When I purchased this computer, it was on the basis of the immense promise it held. The combination of power, expand ability, and ease of operation in a multitasking environment, with standardized storage of graphics, text and sound files to accommodate transfer between programs made the Amiga my obvious choice. Oh sure, I knew there would be a bit of a wait for the software. Programs like the complete rewrite of Roger Powell's "Texture" sequencer or the numerous other music packages from Cherry Lane Technologies might not arrive for a few months yet. . . but the wait was bound to be worth it. Here I am, well over a year down the road. What have I got to show for my patience? Well, there's Activision's "The Music Studio". Although not bad as a music toy, its laborious system for entry of notes (the Amiga version doesn't even allow you to use midi for this) makes their boast of it being "a professional quality music composition tool" seem strange. Electronic Arts' "Deluxe Music Construction Set" comes much closer to fulfilling The Transactor

Another comment: the reply which you gave Mr. Detaille was the worst "baloney" I've read in a long time! The line, "we don't think you'll be disappointed with the quality of Prism's after19

July 1987: Volume 8, Issue 01

r sales support to registered owners" is really off beam. They don't even answer letters to their "registered owners".

TransBloopurz Cap Meter

Another comment: on page 17, you seem to be orgasmic about the fact that CompuServe Jets you upload without fee. Yes, but

Norm Herman of Oregon City, Oregon, writes: "The "Cap

all those uploaded programs are downloaded at CompuServe's

Meter" schematic in your January 1987 issue worked per

regular on-line charges, and become a source of 'free' materi.als which they, in turn, sell at a profit. Why don't you tell the whole

fectly. . . There was a small problem with the program,

story?

two ranges of values calculated out in scientific notation, both

however. The calculation throughout was superb, but since employing the E, and since the ASC(P$) is 69 for both ranges, both came up as PF. The E-03 had to be split off, which can

You might think that I am a dissatisfied customer of Transactor, but I'm not! I love the magazine and would like to see it become

be done by adding a line 565, thus:

(if it's not already) the ultimate Commodore mag in both countries. I have dropped my subscriptions to some other "junk" •

565 if p$ =

Commodore mags, subscribe to COMAL Today & Disks and

•

e-03 •

then print

" .00

•

x$ • uf· :

return

Bits

might try a Transactor Disk Subscription soon. I was upset about TPUG's handling of my subscription (6 months of no communi

Shirley Karish of Hicksville, NY noted a slight error in last issue's bits section: "in "Printer output from an ML monitor",

cation) but hopefully that is resolved now. Keep up the good work and take a closer look at SuperKit 1541. I have used me on the same system. My two drives can't be that far out if I

the very first line of the program should be LOX *'$04 instead of LOA *$04. With that little change, she reports, it works

have never had any problem; the alignment program also says

just fine."

FastHackem and DiSector, and both have done a better job for

so! N-Body Simulator on Transactor Disk

Robert L. Manchester, HOE, East Aurora, New York The "N-Body Simulator" program was fine as listed in the

That was a welcome change of pace in your last paragraph,

magazine, but the program on the Transactor Disk (disk 17) had a few problems: lines 220 and 2350 are missing and prevent the program from running. To correct the program,

Robert. We 're sorry you've had trouble with SuperKit and with Prism, but anything you've read about them in this magazine

has been strictly in good faith. It doesn 't surprise us when people

just LOAD it and enter these lines from the listing on page 33

have the odd problem with the SuperKit program - it is definitely

of Volume 7, Issue 6.

sensitive to bad alignment, and probably to discrepancies in i rotation speed, as well. But on a good drive, our experience s

Some Notes on Transactor Disk 1 7

that it works as advertised. As for Prism s support ofusers, most of what we hear is positive. But we don 'l have any institutional relationship with Prism, and no inside knowledge of how they

There are two PRG files on Disk 1 7 that have raised a couple of questions. "ATOM" is loaded by "REVERS!", and

treat their customers. (By the way, what is a "hotdog eater

"ROCKET" is loaded by "FENCE". Loading ATOM or

subscriber"? )

ROCKET themselves s i meaningless.

If somebody at Prism would like to respond to Robert's letter,

The N-Body Simulator program was submitted with ready-to

we'd be glad to pn'nt that response, and Interested to hear why

load files that would've saved you from typing in the values from the charts. We regret not including these on Disk 17. so

hs i letters have gone unanswered. You there, Mr. Domengeaux?

we've decided to put them on Disk 18, along with some extra As for our not telling "the whole story about CompuSerue: you 'II have to excuse us for not realizing that CompuServe

systems that we've come up with ourselves. The files can be

identified by the ".NB" suffix, but don't enter the suffix when

charging for downloading time is a newsworthy item. At one

specifying the filename for a load. For convenience we'll put another copy of the simulator on Disk 18 too.

time, uploading programs to CompuServe was chargeable online time - and submissions were frequent.

A Two-Button Mouse On reflection, we now realize that, by not making a point ofthis, we were being unfair to all those other world-wide online

Charles McCarthy from St. Paul MN, wrote with the following

services who operate as public charities. Sorry, guys.

correction: "This concerns the nifty article about the C-1350 mouse (volume 7, s i sue 6, pages 36-38). There is an error in the code for the procedure TEST on page 38: at BTN I + 2, there should be an RTS, not a .BYT $2c. The code as published will change the desired .Z=O to .Z= I if location $01 A9 is zero, and will change the desired .N = I to .N 0 if =

bit 7 of $01A9 is 0."

The Transactor

July 1987: Volume 8, 1eaue 01

TeleColt•mn Transactor Online Conference •

Sunday, April 26, 8:00 PM EST on CompuServe. Subject: Writing Articles that GET PUBLISHED!

We get dozens of articles every month, many we can't use. Why? The reasons come up as fast as the articles come in. But it doesn't have to be that way. Much of this is covered in our Transactor Writer's Guide, which was four years in the making (available free - send SASE). However, since printing the guide we've acquired enough new criteria for '86'ing an article to make the next guide double the size of the first, and we're quite sure we'll find more. At this conference we'll discuss everything from topic ideas to preparing the package. Typesetting is one of most major tasks, and many programs we receive are good, but too difficult to typeset. We'll discuss how you can adjust programs you've already written to reduce our preparation efforts and increase your chances for seeing them in print. And if they make it into print, YOU get paid. . . and isn't that what it's all about? Darn right.

The Commodore Programming Forum. Data Library 1 6 of CBMPRG will contain all of the programs that have been published in the Bits section, and those few that have appeared in the Letters column. Since filenames on CompuServe are limited to six characters (the extension will always be ".BIN" ie. uploaded with Xmo dem), they won't always be very descriptive. So unless you know the exact name we chose to upload the file, it might get difficult locating a specific program. Therefore, we carefully designed a format of keywords that makes them easy to find. Here's an example:

V7 104 P70 JAN87 C64 TRACE44.SRC HI RES TRACER PAL SOURCE The keywords start with the Volume, Issue, and Page numbers, followed by the date on the cover. The Page number is the page that the listing starts on, NOT the first page of the article.

Never written an article before? Many articles we print are the author's first attempt. Writing is often easier than talking, because you have time to think about what you'll say. So if you've been considering a writing hobby for some extra cash, join us in this conference. Even if y.ou're not planning to write computer related material, we'll help you put together a submis sion that will be irresistible at any publication.

Next is the machine(s) the program will run on. Some programs will run on any machine, in which case this will be "BASIC". The exact name of the file as it appears on the Transactor Disk comes next ("TRACE44.SRC"), and we suggest you use this name once it's downloaded to make it more identifiable when talking with others who have the program, but obtained it elsewhere. At the moment we're not sure how to show where the "exact filename" ends, so this will be duplicated in the file description that s i displayed below the keywords. Following the filename are some extra keywords that will describe the general purpose of the file if the filename leaves a little too much to the imagination.

The conference will be held in CBMCOM, The Commodore Communications Forum. Once on CompuServe, type "GO CBMCOM" and enter "CO" at the main function prompt. It starts at8:00 PM EST on Sunday, April 26, and myself, Rich, Chris and Nick will see you there! Transactor Programs on CompuServe

Now when you're reading a Transactor, and you just can't wait to get a copy of a program, sign on to CompuServe, "GO CBMPRG", and enter DL17 at the main function prompt (DLI6 for Bits). If "Mini-Tracer" s i the program you want, as in the

We're gradually getting all of the Transactor Disks uploaded to CompuServe. You can find them in Data Library 17 of CBMPRG, The Transactor

July 1987: Volu.,. 8, ltsue 01

above example, enter the following at the DL prompt:

CAD is actually a package of eighty-three short programs. The command function programs are linked together by a command bro /key:v? i04 p70 processor, and only one is loaded at a time. The use of linked programs keeps the amount of memory needed by BASIC to a . . .and the file should appear instantly. The above would show minimum and allows a virtually unlimited command set. Since you the source file. If you only want the Loader, you would enter: the CAD programs only need to pass numeric variables, the linking process is a simple one; it s i only necessary to ensure bro /key:v7 i04 p69 that the first program loaded is the longest in the package. Occasionally there may be two or three programs that start on The pre-drawn figure access was a simple programming prob the same page. If the one you want doesn't show up first, just lem. The figures are stored on disk as X and Y displacements keep hitting Return at the prompts and eventually it will. from a reference point. When the figure is recalled, these displacements are added to the present position of the cursor HOWEVER, please note that although the above is an accurate and the pixel at that location s i set. The size of the figure is example, Mini-Tracer had not been uploaded as of this writing. limited to plus or minus 127 pixels and a total of 255 'on' pixels can be included in each figure. The number of figures on a disk is limited only by the number of available directory entries. The Magazine Display Area Thanks to user support there are now over thirty figure libraries. including furniture for floorplans, USGS map symbols, electronic After starting work on the Display Area that we've been men schematic symbols, plumbing fixtures, and a number of font sets tioning over the last four issues, we soon realized that if we were for lettering hires screens. going to refer to programs from within the articles on the service, we should know what the name is before we refer to it. A package that has not received as much attention as CAD, but We could have chose names prior to uploading the programs, is closely related, is GRAPH. This package allows drawing high but then the articles would refer to files in the DLs that aren't yet resolution pie charts, bar charts, and line plots. Using a dynamic there. So we decided that the programs should be safely in the keyboard technique it even allows graphing of a user-input DLs before we refer to them by name. When all the Transactor equation. Since GRAPH initially boots the entire CAD support programs are uploaded, work will resume on the Display Area, library, it is possible to move from GRAPH to CAD by simply which should be sometime in April. changing the disk. This allows the user to modify, letter, and otherwise manipulate the graph. •

CAD30.BIN

by Steve Nye (70366,1316]

a drawing/drafting program for the Commodore 64

Did you ever wish you could try out that new floorplan before moving all the furniture? Or print a map to your house for those out-of-town guests? Need to create a bar or pie chart for that sales meeting tomorrow? All this and more is available for the price of downloading from CompuServe's CBMART SIG. CAD s i a drawing/drafting program for the Commodore 64. Originally designed to do electronic schematics, it has evolved into one of the most complete drawing packages available. The ease with which it is modified and expanded has allowed the users of the package to be major contributors to its development.

The CAD and GRAPH packages are available from CBMART Data Library 12 under the filenames CAD30.BIN and GRAPHV .BIN. There are numerous support files, such as the figure sets, and a number of CADGames designed to be played using CAD. In fact, the support files for CAD became so numerous that now Data Library 12 is devoted exclusively to CAD. Support for the package s i available through regularly scheduled conferences and the message section of the SIG.

Another Online Odyssey by Marte Brengle, Glendale, CA

Check out The Source and expand your online world.

Ranjan Bose's article in the May '87 Transactor gave a good overview of three of the most popular national online services Aside from the usual drawing functions Oine, box, circle, erase, for Commodore owners. One other large national service whose etc.), there were from the outset three main requirements for the name doesn't usually come up when one thinks of topics of package, an easily expanded and modified command set, three interest to Commodore owners is The Source. hires screens resident in RAM, and the ability to access a library of pre-designed figures. In the past, The Source's target "audience" has been business oriented and mostly IBM-using, rather than the kinds of people The ease with which BASIC is modified made it the obvious who use the "consumer" services provided by CompuServe or choice for a programming language, but the lack of high resolu QuantumLink. That is changing these days, and a large factor tion commands had to be overcome. A package of USR calls influencing that change is the new Commodore-oriented Spe from the old Commodore SIG, USRML, made it possible to access cial Interest Group (SIG). Any of you who used to visit The machine language routines for hires work while keeping the Transactor on Viewtron may already be familiar with the folks main structure of the program in BASIC. who run the Commodore SIG on The Source. It's the lndepenThe Transactor

July 1987: Volume 8, laaue 01

C term -half;icug chat.101 5 -s -al marte -di me -j 31

dent Computer User Group (ICUG), the same crew who ran Speakeasy, Inner Works, and For Starters on Viewtron.

More complete instructions for setting up personal command The Source provides the same kinds of services as the other

keys are found in the Source manual, and also in Parti under the

major networks - information, public domain software, games,

topic "Custom Keys."

and the like - and has just added a real-time conferencing area,

called Chat. Those of you who have used CompuServe's "CB

You can also set up a file to run automatically each time you sign

Simulator" or any of the "CO" areas in the Forums may find that

onto The Source, if there are certain things you'd like to do every

Chat is even easier to use.

time you sign on. For example, my file turns my "custom keys"

CompuServe's interactive conferences are an exercise in mental

on, and then checks to see what's in my mailbox. But that's not all you can do. Ever get tired of seeing the system's "what next"

gymnastics, unless you are using a terminal program with a split

prompts? You can reprogram even that to suit your mood.

screen, since your messages can get totally tangled up with

Instead of the standard "arrow" that The Source uses for a

other people's on the screen. One of the first things CIS CB users

Command Level prompt, I have it set up to say "What now?"

learn to do is press ctrl-V (repeatedly!) to straighten out their

And instead of the question-mark-and-arrow combination that

messages so they can see what they've typed so far. No need to

means you made a mistake somewhere, my prompt says "Uh

do that in Source Chat. Since The Source is accessed primarily

oh!" My sign-on file sets that up as well. You can find instruc

through packet-switching networks like Telenet and Tymnet, a few simple keystrokes will take you back to "network level," switch you to half duplex, return to Chat and show you your own

tions for all that in the Source manual under "Customizing The Command Level Prompt," or in Parti in the "Custom Keys" topic.

messages without their being overrun by everyone else's. And with Source's command structure, you can even set yourself up

Although I've mentioned the Source manual several times here,

a "personal command key" (as was possible on Viewtron) to do all that "preparation" automatically as it takes you into Chat.

and it is for the most part a good investment, the fastest way to

(More about that in a moment.)

It's like getting the best of

someone. The Parti section in the manual, for example, is out of

QuantumLink or PlayNET (each message is an entity unto itself

date (as is the Parti section in Charlie Bowen and Dave Peyton's

and you don't have to unscramble them) with the best of the

excellent book "How to Get The Most Out Of The Source"). And

ASCII networks (no proprietary software required). And nicer

ICUGSIG is a great place to find all kinds of help with using the

still, you don't pay extra for using higher baud rates in Source

system. There are quite a few "help with Parti" topics set up

1 Chat. It's billed at the 300 baud rate no matter how fast you

under ICUGSIG Exchange in Parti, and the SIG also provides a

choose to go (up to 2400 baud at present).

find help for what you need to do on line is generally to ask

"New User Survival Kit" under the main SIG menu that's a gold mine of information. It covers such things as navigation com

The Source also features one of the most sophisticated "message-board" systems around, called Participate(tm). You

mands, "how to download/upload," how to use SourceMail, how to use the Members' Directory, and a complete and thor

may be surprised at the kinds of things that are possible in

ough tutorial on how to use Parti. And there's a new "Ask The

Participate, or Parti as it's called. Much like CIS, messages follow

Experts" section that's much like the one on Viewtron, where

each other in "threads", but on CIS, only the Sysops can move

Commodore users can get information on hardware, software,

messages from one topic to another. Not so in Parti. Messages can be branched off, moved around, sent to other topics, used to

or any other computer-related problem.

begin new topics, or whatever your imagination desires - no special Sysop powers required. There are private topics on both

You can upload to and download from the software libraries with a variety of protocols, including two variations on "capture

CIS and Parti, but on Parti anyone can start one, and can invite

buffer," Xmodem, Kermit, and, for Amiga users, Sliding Window

anyone of his or her own choosing.

Kermit in ATerm (which is also available for downloading from the ICUG library).

One of the nicest things about the late, lamented Viewtron was that it allowed you to set up your own personal "command

ICUGSIG on The Source provides software, advice, and informa

keys" to take you anywhere in the system. If you didn't feel like

tion for all Commodore computer users. There's a large library of

typing ICUGSIG SPEAKEASY every time, for example, you

C64, CJ28, and Amiga software, and a large group of sysops

S to take you there. The

who can provide help with almost anything imaginable. You can

Source lets you do the same thing. You can program as many

recognize the Sysops online by their ID numbers, which all have

commands into a sequence as you need, to get you anywhere on the system with just one keystroke, if you choose. Here's an

a SIG prefix. The ICUG Sysops' ID numbers range from SIGOJS to SIG025.

letter C to switch me to half duplex, take me into ICUGSIG Chat

As Ranjan Bose's article pointed out, there is a wealth of

(the special Chat area run by the Commodore SIG), check to see

information and services available online for Commodore own ers. But it's not all on CompuServe and QuantumLink! Check

could program the combination

1 example of one of my own custom keys. I've programmed the

who else is there, give me an "alias" (or "handle"), make sure I can

see my own messages, and enter the ICUG Reception

out The Source and expand your online world.

channel. The listing looks really complex when you see it on the screen, but it works like a charm:

The Transactor

July 1987: Volume 8, Issue 01

A Real Shuffle Subroutine How many times have you ever played Blackjack where the dealer

Thomas W. Gurley Wills Point, Texas

AH MN

threw all the cards up in the air and then picked them up in random order and dealt them out? Not very many, I'm sure But that is just

about the way most computer programs shuffle cards. The shuffle subroutine of the program uses a pseudo-random number genera tor to rearrange the order of the cards each time they are dealt. On

the other 1land, a human dealer would not shuffle like that. He would divide the deck into two packets and riffle one half with the other. Most deale rs will let one to five cards fall from each packet until all the cards are riffled. He will then split the pack again and

BF CL ED EC EH FP Nl

repeat the shufne several times. Each new deal thus depends (in a complicated way) upon all previous hands. The card shuffle subroutine presented here more nearly approxi mates the actions of a human dealer.

FE NF

This subroutine starts with a "fresh deck" by assigning the order to

the cards from I to 52 when first run. It then shuffles several times just as a real dealer would do. Before each new deal, the cards will be shuffled a random number of times from 3to 13. You can change

EC DB JB AD OM Fl KB MD EG FP AH

th1s feature (and others) to suit yourself. I wanted to analyze the game of Blackjack to find out why "runs" seem to occur. In real-life Blackjack, the cards will sometimes hit in runs and eventually they will "patternize" so that one of the players (or the dealer) will always hit. It may require hundreds of deals before a "run" will occur but it will happen in total defiance of all logic. This subroutine will do exactly the same thing! All you need do to obtain more realisic t hands is substitute this subroutine for the one currently being used in your card game. You

It works really well and the hands seem to appear more like those in

LH MM HC CK AL GO EP JF BN co JE OG

real Blackjack games I've been in. I hope you can use this subrou tine as well.

will have to adjust the array names to match your program, but that should be easy. The Blackjack program I modified had two calls to a shuffle subroutine. It randomly filled an array with numbers from I to 52 each time. It then went on to assign card values to the numbers in

the arra. All that was necessary to implement the new shuffle subroutine was to put a GOSUB 8000 as the first line of the original randomizer and then jump past it (on return) to the "card value" routine.

8000 rem • •shuffle subrout1ne• • PA 8010 rem 8/27/86 AE 8020 rem • •dimension arrays• • EO 8030 dim c%(52),c1 (26),c2(26):rem (0) not used Gl 8040 print· it f1 to start " MM 8050 if peek(1 97)<>4 then 8050: rem time is part of random factor

The Transactor

JN HE Jl EE 24

8060 rem set up the deck 8070 forx = 1 to52:c%(x) = x:nextformm • 1 to1 0 :gosub8130:next 8080 x = rnd(-ti) rem enter here for all subsequent shuffles 8090 sh = int(1 O•rnd(x) + 1 ) + 2: rem change the '1 0' to suit yourself 8100 formm = 11osh:gosub8130 d - o rem shuffle random t1mes 81 1 0 next 8120 end: replace th1s w1th 'return' 8130 rem .. a real shuffle• • 81 40 c = O:ca - o:cb = O:cc = O:cd o 8150 print· . . . shuffle. . ..shuffle . . • 81 60 fon 1 to26:c1 (i) = c%(i)·c2(1) - c%(i + 26):next :rem split deck into two 8170 gosub8400 gosub8250:1fcb> =26then8360 8171 rem deal 1 st card from right packet so 1st card changes uust like real!) 8180 gosub8400: gosub8200: ifca> - 26then8300 8190 goto81 70 8200 rem . . nffle cards from left half. . 8210 fore = 1tor:ca=ca+ 1 :ifca>26thenc = 7 return 8220 cd = cd + 1 8230 co/o(cd) = c1 (ca) 8240 next:return 8250 rem ..riffle cards from right half. . 8260 fore = 1 tor:cb = cb + 1 :ifcb>26thenc = 5: return 8270 cd = cd + 1 8280 cO/o(cd) -c2(cb):next 8290 return 8300 rem • •shuffle balance of left. . 8310 fore = cbto26:cb = cb + 1 :lfcb>26thenreturn 8320 cd =Cd + 1 8330 c%(cd) = c2(cb):next 8340 return 8350 rem ••shuffle balance of right. . 8360 fore = cato26:ca = ca + 1 ·ifca>26thenreturn 8370 cd =cd+ 1 8380 cOA>(cd) = c1 (ca):next 8390 return 8400 X = rnd( I� 8410 r=4•rnd(x) + 1 8420 return 9000 rem • • •this is for you to venfy there IS one and only one of each 9010 rem number 1n the array co/o(x). use 'goto 9000' and note that 9020 rem each left hand number occurs once only. 9030 forx = 1 to56:forjj 1 to52:ifc%(jj) xthen printx;jj 9040 next.next.end -

Juty 1987: Volume I, tuue 01

•

Function Manipulation: Roots and Integrals

Eric Giguere Waterloo, Ontario

One of the computer's strongest points s i its mathematical

computer comes in. Several methods have been perfected over

prowess. In terms of speed alone, computers have revolution ized modern mathematics. Things which used to be drudgery

the years to yield accurate root estimates for a given function. The one I will be presenting you with is called the bisection

for human mathematicians are handled without complaint by a

method.

properly programmed computer. The following article deals with two useful applications of computers: estimation of function

BISECT

roots and integrals. The idea behind the bisection method is very simple. Take a function f(x) that has a root somewhere in the interval [A,B]

Roots

(that is, it has a root at a point x such that A < = X < =

B), as in

A function is a way of expressing the fact that one quantity

Figure I b. We then divide this interval into two equal subinter

depends upon another. By definition, the dependent quantity

vals and throw away the subinterval that doesn't contain the

must be unique. We usually see a function expressed in the

root (see Figure I c). We then repeat the process on the remain

form:

ing subinterval, and continue on in this fashion until we are within a certain distance (or tolerance) of the root. This gives us

f(x) = x + 1

the approximation for the root. For a certain value of x, out pops another value, in this case

x + I. If the function is to be plotted, we may see it expressed in the following form:

y = X+ 1 Thus given a point x, we can find a related point y and plot the I a.

MID

corresponding coordinate on a graph such as the one in Figure

5 4

root or zero of f(x)

3 2

•

(2,3) X-axis

I -5 -4 -3 -2 -1

Figure 1 b): BISECT algorithm

-2 -3 (-3,-4) .

I I I I I I t I I I I

-4 -5

Figure Ia: The Catesian Coordinate System

New left endpoint

A root or zero of a function s i defined as the point where the function is zero, or where the graph of the function crosses the

MID

x-axis. A function may have one root, several roots, or no roots.

x + I has a root at the point x = - I , since y = (But a function such as y = x2 + I has no root, since y

The function y

1) + I

Y-axis

B New midpoint

will never be zero no matter what value of x we choose. There are times when it s i useful to know where the roots of a function are, if it has any. Some functions are particularly easy in this respect, but others are a lot harder. This is where the

Figure lc): Blow-up of lb)

The Ttansactor

July 1917: Volume I, Issue 01

We need to know one thing before going ahead and writing the

base and height, we simply sum the individual rectangle areas to

algorithm for this method: how do we know if an interval contains a zero or not? The easiest way is to compare the

get an approximation for the entire area under the curve. The

function values at the two endpoints of a specific interval. If

(and hence the base length decreases).

approximation gets better as the number of rectangles increases

there is a root in the interval, then one y-value will lie below the x-axis and the other will be above it. Thus if we are looking at the interval [A,B], there will be a root if the following condition holds:

Area under

(Remember that if you multiply a negative number by a positive

the curve

one you get a negative answer, and a positive one otherwise.) This is the test we will

use

in the algorithm.

NOTE: The above test is not accurate for all intervals of a function. If, for example, a function crosses the x-axis twice on the interval [A,B), then f(A)â&#x20AC;˘f(B) > 0, even though there are two roots in the interval. Thus you must be careful of which interval you choose to get an accurate example. Plotting the graph over a large interval can often give you a good idea where the roots are

approximately, and you can then use the bisection method to get

an accurate estimate from the intervals shown on the graph.

Figure 2: Area under the curve between points A and B

A BASIC subroutine to find a root using the bisection method is shown in Listing #J, lines 380-430. The function should be defined in the calling program with a DEFFNF statement. Set the variables A and B to be the left and right endpoints of the

The actual area-finding routine described in this article is a

interval you wish to test, and set TL to be the desired tolerance

variation of the approximation method detailed above called

(something like 0.00005, say). A GOSUB 380 will then find the

Simpson's Rule. I won't go into the theory as to how the rule

root, if any, on the interval. If a root is found, ER will be zero and the root location will be stored in MID. If ER is I, then no root

works here, but you can find it in any good computer textbook dealing with area-finding problems. Listing '*2 shows the actual

was found on that interval -- but remember this is not necessarÂ

BASIC subroutine, from lines 450 to 520. As in the bisection

ily a definitive answer. The rest of the program in the listing is an

subroutine, the function should be defined with a DEF FN

example of how to use the routine. (None of the REM statements

statement, and the endpoints of the interval stored in the

are necessary, so you don't have to type them in.)

variables A and B. The variable NP is the desired number of integration panels (rectangles) that the subroutine should use.

Integration

This sets the desired estimate accuracy for the subroutine - the larger NP is, the better the estimate. (There's a tradeoff in time taken to calculate the area, of course.) Actually, if your function

the method to rind the area under a given curve. Refer to Figure

FNF has no powers of x greater than 3, then you need only set NP to a small number such as 16, because Simpson's Rule gives

2. The area under the curve on the interval [A,B} is shown as the

an exact value for the area. For functions of degree greater than

shaded area. Note that the we consider the term "under the

3 (ie. they have powers of x that are greater than three),

curve" to mean "from a point on the curve to the corresponding

Simpson's Rule gives an estimate, an estimate which improves

point on the x-axis", in other words the area between the curve

with larger values of NP. As before, the rest of Listing *'2 gives an

and the x-axis. (Even if a function is below the x-axis, this

example of how to use the subroutine.

Integration is the term used, at the most basic level, to describe

definition is valid and we still use the term "under the curve", even though it's a bit inaccurate in this situation.)

Final Notes Many methods have been developed over the years to calculate areas, and the one we will use here s i based upon approximaÂ

Computer algorithms such as the above have made themselves

tion. One way of estimating the area in such a fashion is to divide

very useful for solving many physical problems. Examples

the area into many rectangles of equal base length. Each rectangle will have a height determined by the function itself.

abound that require a person to know the roots or integrals of a function, and sometimes the most efficient way to find these is to

Since we know that the area of a rectangle is the product of its

use a computer. While the answers such algorithms may give are

The Transactor

July 1987: Volume 8, Issue 01

•

limited both by the computer's accuracy (usually found as round-off errors) and the inherent inaccuracy of the algorithms, they are usually good enough for the task (especially since the time required to find an accurate answer using manual methods may outweigh the benefits of having such an accurate answer). If you're interested in other such approximation techniques, many computer science textbooks are good sources of such informa tion and usually the algorithms they give may be converted to BASIC without much trouble. I know that I've found the integra tion routine particularly useful in checking my answers in my university calculus courses. Maybe you can find a good use for them, too. •

•

Listing 2: Approximate Area using Simpson's RuJe LE NE EK AK 01

EL AO MO 01

MD GO lJ AF BC EG CC MB Cl HE HO MC KK OF CG CH

Usting 1: BISECT

•

CD FL GJ IG KK NE OL IC PH CD LB EA Fl DA MC MC HM ON NA GJ IE KK KF EB BC AB JB AJ CC PB FO EK lA PM JK

100 rem sample program to find the 1 1 0 rem roots of the function 120 rem 130 rem y = (x-3)(x-1 )(x + 4) 140 rem 150 rem which we know are x = 1 ,3, and -4. 160 rem 170 rem try the intervals (0,2), (2,0) 180 rem and (-5,-3) 190 : (x-3)•(x-1 )•(x + 4) 200 def fnf(x) 210 print 220 input " left endpoint · ;a 230 input · right endpoint · ;b 240 input · tolerance · ;II 250 print 260 gosub 380 270 if er 1 then print ·no zero was found between · ;a; · and · ; b: goto 210 280 print • root is at: · ;mid: goto 2 1 0 290 : 300 rem • • • • • • • • • • • • • • • • • • • • • • • • • • 310: 320 rem bisect subroutine, used to 330 rem find the zero of a function 340 rem between points a and b, with 350 rem tolerance tl. if no zero 360 rem exists, er = 1 . 370 rem 380 fl= fnf(a): fr= fnf(b): er=O 390 if fl•fr > 0 then er = 1 : return 400 mid (a+ b)/2 41 0 if abs(a-mid) < = tl then return 420 fm = fnf(mid) 430 if fl•fm < = 0 then b = mid: goto 400 440 a = mid: fl = tm: goto 400

The Transactor

Gl MJ LM JD MH ll PO NE GN FE BC OG CG

ON GO EC

100 rem program example using simpson's 1 1 0 rem rule to find the area under 120 rem the curve 130 rem 140 rem y = 1 + x + xt2 150 rem 160 rem from x = 0 to x = 2. by direct 170 rem integration the answer we 180 rem should get will be 20/3, or 190 rem approx. 6.66667 200 rem 210 rem first define the function 220 : 230 deffnf(x) = 1 + x + x•x 240 : 250 rem now call the subroutine to 260 rem find the area 270 : 280 a = 0: b = 2: np = 16: gosub 450 290 print ·the area from · ;a; · to" ;b; ·is:· ;ar 300end 310: 320 rem 330 rem • • • • • • • • • • • • • • • • • • • • • • • • • • • • • 340 rem 350 rem simpson's rule subroutine 360 rem 370 rem returns the area under the curve 380 rem defined by fnf, from endpoints 390 rem a to b. set np to the desired 400 rem number of integration panels 410 rem 420 rem the area is returned as a value 430 rem in the variable 'ar' 440 rem 450 h = (b-a)/(2 •np): se=O: so=fnf(a+h) 460 for i = 1 to np-1 470: x = a + 2•i•h 480 : se = se + fnf(x) 490 : so = so + fnf(x +h) 500 next i 510 ar (h/3)•(fnf(a) + 4•so + 2•se + fnf(b)) 520 return =

July 1917: Volu,. I, luue 01

Full Array Math Operations On The 64

Richard Richmond Springfield, Ohio

. . . When manipulating large arrays or carrying out repetitive operations, these routines can significantly reduce the execution time of a program. This article describes a group of math functions that perform the

When working on an array, two add resses are used by the routines.

basic math-operations like "add, subtract, multiply and divide" on

The address for the end of the array in the second argument is found

an entire array with just one SYS command. Using these routines, code like the following;

by the program and used to determine when the operation s i completed. The other address s i used to tell the procedure where in the second array to start the operation. In Table I , the array

1 00 for i 0 to 1 00 1 1 0 a(O = a(O•c 1 20 next i •

elements are x (such as a(x)). Normally, x would be - 0. In that case,

the procedure begins with the first, or (0), element of the array and operates on every element in the array. A non-zero element would

i the name of an can be reduced to SYS SA+ 18,C,A(O), where A s

cause the routine to skip some of the elements. For example, SYS

do these routines

SA,V,A(O) would cause every element in A to be set equal to V. But,

array and C is a separate variable. Not only

provide simpler code, but they are faster than the corresponding

SYS SA,V,A(2) would leave A(O) and A( I) unchanged and all of the

operation in

rest of the elements would be equal to V.

BASIC statements. These routines are written n i ma

chine language and will carry out the operations from ten to fifty times faster than BASIC. When manipulating large arrays or carry

With this type of flexibility, some precaution is necessary. For the

ing out repetitive operations, these routines can significantly reduce

two array operations, the number of elements in the first argument

the execution time of a program.

from the element specified to the end of array must be, at least

Because this program makes extensive use of the floating point routines in ROM, it also provides

examples of how to use those routines in your own programs.

equal to the number of elements in the second argument from the

specified element to the end of that array. The routines only look for the ending address

11te New Functions

of the second array. If the utility runs out of

elements in the first array before reaching the end of the second array, the program continues but the results from that point on will

Table I lists the SYS commands for these new utilities. Also listed

not be valid. No error or system crash

should result, just useless

are the math functions performed by each of the functions. You can

data.

see from functions

Arrays must be dimensioned and the elements should be defined

the list that the program can perform the four math

+ , -, •, and

I on either two arrays or one array and a

separate variable. Some of the routines

are

provided to take into

before the utilities are called. The utility can be used to define

account the non-reciprocity of certain operations. For example,

elements if they are all the same value. Variables do not have to be

same mathematically, as "A= B +A". But, "A=A-C" is not the same as "A =C-A". Table I shows that separate

predefined. But if they are not, they will be set to zero the first time

routines are provided for the following non-reciprocal operations.

depends heavily upon the floating point routines in ROM. There

"A= A+ B" is the

that they are

used

in a SYS to one

of the routines. This program

fore, the rules for math operations in

A = A-V A = V-A A=AN A=V/A

A = A-8 A = B-A A=AIB A = B/A

BASIC

still apply and the

routine will return error messages such as "DIVISION BY ZERO" if illegal operations are attempted. As mentioned earlier, there are exceptions to the above guidelines.

Two of the routines are

not

limited to floating point numbers.

Throughout this article and in the examples, the labels A and B will

"EQUB" works on all three types of variables (integer, string and

be used to indicate arrays and the label V to indicate a single

floating point) and sets one array equal to a second. "INSERT" is the

variable. Note that when a variable is indicated that variable could also be one of the elements of an array. Tbe Rules and

Exceptions

also works with all variable types. This routine puts the value of the first argument into the array at the location specified, A(x). All of the following elements are shifted down one. That is, A(x+ I)=A(x),A(x+2)=A(x+ 1) and so on. The last ele second utility that

ment in the array is lost. Because most of these routines follow the

same conventions and

format, we will first discuss those and later point out the exceptions.

Two arguments, separated by a comma, are passed to the utility. The second argument will be one of the arrays that will be operated •

Also, notice that "SQUARE" has only one argument. The elements

of the array are squared and stored back into the array so no second argument is needed.

on and the array in which the results will be stored. These routines

For most of these routines, the value of the first argument is not

ar e written to operate on floating point arrays and variables.

changed and should be defined before being used in one of the

1_ _ _ _ I'-:: :-TM ::T I'Q n l4 _ a _ -c -:tor --:: 27

July 1917: Volume I, Issue 01

routines, unless that value is to be zero. The exceptions are 'mn' and 'mx' used in "MIN" and "MAX". The minimum (mn) or maximum (mx) value of the array will be returned and the initial value of the variable does not matter.

A Look At The Program

with the previous one and you will see that the first 4 elements (x = 0

to 3) are not changed and the remaining elements (x = 4 to I 0) have •

been squared. The examples in Program 1 should give you a good starting point for your

own

experiments in how to use these

routines. Some of the routines, such as "MIN" and "MAX" are especially

The source code for these routines s i listed in Program 3. Rather

useful when graphing. Using these routines, the maximum and

than discuss it line-by-line, we will look at some general character

minimum values of an array could be used to "scale" the data before

istics and some of the subroutines or modules used by almost all of

it is displayed.

the routines. The labels at the beginning of the listing refer to the ROM routines that do the bulk of the floating point math. Next in the

These utilities are fast. They are reasonably "goof proof" yet still

listing is the "JUMP" table. This technique makes it much easier to

allow a good deal of flexibility. Any program that manipulates large

insert or delet� code or to make changes in the routines because the

arrays should benefit from the increased speed possible with these

"SYS" statement in BASIC does not change. Also, the "SYS" address

utilities. The use of jump tables and a modular approach to program

for new routines that may be added later can be easily determined.

ming the different operations make it fairly simple to add other functions to the program. Obvious ideas for additional routines

To obtain as much speed as possible, zero page addressing is used

would be a square root function and one to raise the array to a given

extensively. But, there is not enough zero page free memory for our

power. Because both EQUB and INSERT work on all three types of

purposes. Therefore, "SZPAGE" saves the contents of a block of zero

variables, you might want to write another program that only has

page memory to a safe location and "RESTOREZ" loads the values

these two routines in it.

back to zero page before returning to BASIC.

The "TEST' routines are used to step through the array five bytes at

Although I first thought of these routines as aids for graphics programs, they would be equally useful in a database or spread

a time (5 bytes are used to store a floating point number) and to set a

sheet type of program. For that type of use, another possible

flag when the end of the array is reached. "MOD ! " looks for the first

function would return the sum of an array. I would be interested in

argument in the variable or array storage area and creates it if not

hearing from anyone who has suggestions for improvements or

found. The address of this variable is then saved. Next, "MOD2"

additions to this program.

finds the address of the array element in the second argument and

TABLE 1: Summary of Commands

the address of the end of this array. These values are also stored for

use by the routines. In general, the steps followed when one of the

SYS SA,V,A(X) EOUV SYS SA +3,B(Y),A(X) EOUB SYS SA+ 6,V,A(X) PLUV PLUB SYS SA + 9,B(Y),A(X) SYS SA+ 1 2,V,A(X) SUBV SYS SA+ 15,B(Y).A(X) SUBB SYS SA+ 1 8,V,A(X) MULV SYS SA+ 21 ,B(Y),A(X) MULB SYS SA+ 24,V,A(X) DIW SYS SA+ 27, B(Y),A(X) DIVB SBUV SYS SA+30,V.A(X) SYS SA+ 33,B(Y),A(X) SBUB DVIV SYS SA+ 36,V.A(X) SYS SA+ 39,B(Y),A(X) DVIB SYS SA+ 42,MX,A(X) MAX SYS SA+ 45,MN,A(X) MIN SQUARE SYS SA+ 48,A(X) INSERT SYS SA + 51,V.A(X)

I . Save zero page values 2. Use "MOD" routine to find the arguments

3. Addresses are loaded to the registers

4. Numbers are loaded into the Floating Point Accumulator (FAC)

5. The required math is performed between the FAC and memory

Routine

Format

routines is called are:

6. Results in FAC are stored in memory 7. Steps 3-6 are repeated for entire array 8. Zero page is restored and control returned to BASIC

Using The Program First, type in and save Program 2. When this program is run, a ML program file is written to disk with the name "ARRAY.FNC". Load this program with:

LOAD " ARRAY.FNC " ,8,1 Because these utilities were conceived to provide time savings for

A=V A=B A=A+V A=A+B A = A-V A = A-B A=A•V A=A•B A=AN A = A/B A = V-A A = B-A A = V/A A = B/A MAX(A) MIN(A) A = At2 A(X) = V

NOTE: SA starting address (51800) IF X or Y>O in SYS command, routine will skip over elements in array to (X). Elements with (a)<X will be unmodified. =

graphics programs, they are located to be compatible with graphics utility programs that load at $COOO (49152). The starting address (SA) for these utilities is 51800. Once these utilities are loaded, type "NEW" and enter or load your BASIC program. Near the beginning

Program 1: Example

of your program, define SA=51800. SA can then be used for the SYS statements listed in Table 1.

AK IE

For examples of how these routines work, look at Program I . Not

every routine is illustrated in Program I , but if you run the program

CM II

and examine the output, you will get a good idea of what these routines do. Note that in the next to last example array B s i squared,

but the element (x) in the SYS command is 4. Compare that print out

The Transactor

Operation

1 0 sa=51800: dim a(10),b(10) 20 print: for i 0 to 10: a(i) = i: next 30 print: print ·set b = a · : sys sa+ 3,a(O),b(O) 40 print: for i = 0 to 10: print b(i);: next 50 v1 2: sys sa+ 6,v1 ,b(O): print: print • set b = b + 2 • =

July 1917: Volume a, luue 01

ED MC FE CP MF OA FP El NM JD

AK · 550data 182, 32, 162, 187, 1 65. 183, 164, 184 HC 560 data 32, 80, 184, 32, 185, 202, 32, 206 DH 570 data 202, 176, 230, 76, 173, 202, 32, 161 MC 580data202, 32, 20, 205, 165, 185, 133, 181 BK 590data 164, 1 86, 132, 182, 32, 162, 187, 165 LP 600data 183, 1 64, 184, 32, 40, 186, 32, 185 BK 610 data 202, 32, 206, 202, 176, 230, 76, 173 HM 620data202, 32, 161 , 202, 32, 20, 205, 165 JO 630 data 183, 164, 184, 32, 162, 187, 165, 185 IN 640 data 133, 181 , 164, 186, 132, 182, 32, 15 KL 650 data 187, 32, 185, 202. 32, 206, 202, 176 PA 660 data 230, 76, 173, 202, 32, 161, 202, 32 HP 670 data 20, 205, 165, 185, 133, 1 8 1 , 164, 186 FA 680 data 132, 182, 32, 162, 187, 165, 183, 164 OM 690 data 184, 32, 15, 187, 32, 185, 202, 32 JP 700 data 206, 202. 176, 230, 76, 173, 202, 32 BM 710 data 1 6 1 , 202, 32, 20, 205, 165, 183, 164 LD 720 data 184, 32, 162, 187, 165, 185, 133, 181 HD 730 data 164, 186, 132, 182, 32, 103, 184, 32 IE 740 data 185, 202. 32, 193, 202, 176, 230, 76 LF 750 data 1 73, 202, 32, 1 6 1 , 202, 32, 20, 205 JF 760 data 165, 183, 164, 184, 32, 162, 187, 1 65 NC 770 data 185, 133, 1 81 , 1 64, 186, 132, 182, 32 OH 780 data 80, 184, 32, 185, 202, 32, 193, 202 HE 790 data 176, 230, 76, 173, 202, 32, 1 6 1 , 202 LH 800 data 32, 20,205, 165, 183, 164, 184, 32 FK 8 1 0 data 162, 187, 165, 185, 133, 181 , 164, 186 JK 820 data 132, 182, 32, 40, 186, 32, 185, 202 Cl 830 data 32, 193, 202, 176, 230, 76, 173, 202 JK 840 data 32, 1 6 1 , 202, 32, 20, 205, 165, 183 KL 850data 164, 184, 32, 162, 187, 1 65, 1 85, 133 AM 860data 181, 164, 1 86, 132, 182, 32, 15, 187 EH 870data 32, 185, 202, 32, 193, 202, 176, 230 NH 880 data 76, 173, 202, 32, 161, 202, 32, 20 KM 890data205, 165, 1 85, 164, 186, 133, 1 8 1 , 132 OP 900data 182. 32, 162, 187, 165, 183, 164, 184 DK 910 data 32, 80, 184, 32, 185, 202, 32, 193 BN 920 data 202, 176, 230, 76, 173, 202, 32, 161 Kl 930data202, 32, 20,205, 165, 1 85, 133, 181 PP 940 data 164, 186, 132, 182, 32, 162, 187, 165 FG 950data 183, 164, 1 84, 32, 15, 1 87, 32, 185 MA 960 data 202, 32, 193, 202, 176, 230, 76, 173 LB 970 data 202, 32, 1 6 1 , 202, 32, 20, 205, 160 0, 1 77, 1 83, 145, 185, 230, 183, 208 MM 980data NL 990 data 2, 230, 184, 230, 185, 208, 2, 230 AD 1000 data 186, 165, 186, 32, 219, 202, 176, 231 II 1010 data 76, 1 73, 202, 32, 253, 174, 32, 158 OG 1020 data 173, 165, 7 1 , 133, 185, 165, 72, 133 Dl 1030 data 186, 165, 47, 133,251, 165, 48, 133 MJ 1040 data 252, 160, 0, 1 77 , 251 , 1 97, 69, 208 HG 1050 data 1 1 , 200, 177,251, 197, 70, 208, 5 01 1060 data 32, 251, 204, 96, 200, 32, 251, 204 LG 1070 data 76, 225.204, 200, 177, 251 , 1 33, 253 GD 1080 data 200, 177,251, 24, 1 0 1 , 252, 133, 252 GF 1090 data 165,251, 24, 1 01 , 253, 133,251 , 1 44 CC 1 1 00 data 2, 230, 252, 96, 32, 253, 1 74, 32 DN 1 1 1 0 data 139, 176, 1 65, 71 , 133, 183, 165, 72 II 1 1 20 data 133. 1 84, 76, 203, 204, 32, 1 6 1 , 202 BN 1 1 30 data 32, 20, 205, 165, 185, 164, 186, 32 CH 1 1 40 data 162, 187, 162, 142, 1 60, 202, 32, 212 DO 1 1 50 data 187. 32, 206, 202, 165, 185, 164, 186 CM 1 1 60 data 32, 162, 187, 162, 142, 160, 202, 138

60 for i = 0 to 10: printb(i);: next 70 v2 = 25: print: print· insert 25 at a(5) · : sys sa+ 51 ,v2,a(5) 80 for i = 0 to 10: printa(i);: next 90 print: print · set b = b•a · : sys sa+ 21 ,a(O),b(O) 100 for i= 0 to 10: print b(i);: next 1 1 0 print print · square b - (b = bt2) ' 130 print · starting with element x = 4 sys sa+48,b(4) 140 for i = 0 to 10: print b(i);: next 150 print: print ·using an undefined variable·: sys sa,v3,a(O) 160 print: for i= 0 to 1 0 : printa(i);: next • .

•

Program 2: Creates disk file • ARRAY.FNC " IK BE JH ED IP

HB PO MM 01 NN FK KP

DA PC BJ GE EE PJ GG GE JL HG MN DN PN AN

100 rem m/l loader for array math 1 1 0 forj=51800to 52778 1 20 read x : ch = ch + x : next 130 if ch<> 14161 0 then print checksum error· : end 140 print ·data ok. . . creating 'array.fnc' 150 hi= int(51800/256):1o = 51 800-hi•256 160 open 1 ,8, 1 , O:array.fnc 170 print#1 ,chr$(1o)chr$(h0; 180 restore 190 for i = 51800 to 52778 200 read x : print#1 ,chr$(x); : next 210 close1 220 rem •

•

230 data 76, 233, 202, 76, 169, 204, 76, 5 240 data 203, 76, 215, 203, 76, 40, 203, 76 250 data 250, 203, 76, 1 10, 203, 76, 29, 204 260 data 76, 145, 203, 76, 64, 204, 76, 75 270 data 203, 76, 99, 204, 76, 180, 203, 76 280 data 134, 204, 76, 37, 205. 76, 107, 205 290 data 76, 177, 205, 76, 212, 205, 255, 1 13 300 data 255, 255, 255, 255, 0, 88, 202 0, 310 data 1, 8, 64, 0, 0, 3, 0, 3 320data 64, 160, 12, 185, 1 9 1 , 0, 153, 148 330 data 202, 136, 16, 247, 96, 160, 12. 185 0, 136, 16, 247 340 data 148, 202, 153, 191, 350 data 96, 166, 1 8 1 , 164, 182, 32,212, 187 360 data 96, 165, 183, 24, 105, 5, 133, 183 370 data 165, 184, 105, o, 133, 184, 165, 185 II BP 380 data 24, 105, 5, 133, 185, 165, 186, 105 0, 133, 186, 197, 252, 208, 8, 165 DJ 390 data 2, 24, 96, 56 CM 400data 185, 197,251, 208, BK 410 data 96, 32, 161, 202, 32, 20, 205. 165 LB 420data 183, 164, 1 84, 32, 162, 187, 166, 185 00 430data 164, 1 86, 32, 212, 1 87, 32,206, 202 BP 440 data 176, 244, 76, 173, 202, 32, 1 6 1 , 202 CM 450 data 32, 20,205, 165, 185, 164, 186, 133 FC 460 data 1 8 1 , 132, 182, 32, 162, 187, 165, 183 DB 470data 164, 1 84, 32, 103, 1 84, 32, 185, 202 HB 480 data 32, 206, 202, 176, 230, 76, 173, 202 LE 490data 32, 1 6 1 , 202, 32, 20, 205, 165, 183 MF 500 data 164, 184, 32, 162, 187, 165, 185, 133 IF 510 data 1 8 1 , 1 64, 1 86. 132, 182, 32, 80, 184 OA 520 data 32, 185, 202, 32, 206, 202, 1 76, 230 PB 530 data 76, 173, 202, 32, 1 6 1 , 202, 32, 20 MG 540 data 205, 165, 185, 133, 181, 164, 186, 132

The Transactor

July 1987: Volume 8, Issue 01

DA HM

PA LO

IC IC Gl I EA JE

KJ BG

HL MH

OL FL 01

E!!_

1 1 70 data 32, 91, 188 48 7, 162, 142, 160 1 1 80 data 202, 32. 212 187 32, 206,202, 176 1 1 90 data 227, 162, 142 160. 202, 138, 32, 162 1200 data 187. 166, 183 164, 184, 32,212, 187 1210 data 76. 173. 202 32, 161, 202, 32, 20 1220 data 205, 165, 185, 164, 186, 32, 162, 187 1230 data 162, 142, 160, 202, 32, 212, 187, 32 1240 data 206, 202, 165, 185, 164, 1 86, 32, 162 1250 data 1 87. 162. 142. 160. 202. 138, 32. 91 1260 data 188, 16, 7, 162, 142, 160, 202, 32 1270 data 212, 187, 32, 206. 202, 176, 227, 162 1280 data 142, 160, 202 138 32, 162, 187, 166 1290 data 183, 164, 184, 32 212, 187 76. 173 1300 data 202, 32, 161 202 32. 203, 204, 165 1310 data 185. 1 64, 1 86 133 1 8 1 , 132, 182, 32 1320 data 162, 187. 165 185 164, 186, 32, 40 1330 data 186, 32, 185, 202. 32, 206,202. 176 1340 data 230, 76, 173 202. 32, 161, 202. 32 1350 data 20, 205, 169, 5, 133, 191, 165. 70 1360 data 10, 144, 1 1 , 169, 2, 133, 1 9 1 . 165 1370 data 69. 10, 1 76. 2, 230, 1 9 1 , 165.251 1380 data 56, 229, 191, 133. 251, 165, 252, 233 1390 data 0, 1 33, 252. 165.251, 56,229. 191 1400 data 133, 253, 165. 252,233, 0, 133. 254 1410 data 164, 1 9 1 , 136 177, 253, 145. 251 , 136 1420 data 16. 249. 165, 252. 197, 186, 208, 214 1430 data 165.251 197. 185. 208, 208, 164. 191 1440 data 136, 177 183, 145, 251 , 1 36, 16, 249 1450 data 76, 173, 202

rAK lA

KC KC BF EL GO LH HN AA AH JM PK LH ML

BB PN JG II CP

JG Fl Fl NL LK

GN EN KP JN KB AP NP

Program 3: PAL Source Code 100 rem array math funct1ons 1 tO rem c richard nchmond 120 rem 308 rosewood ave 130 rem s p ... ng f eld. oh1o 140 rem 45506 t50 rem t60 open8,8.1,"0 auayobj" 170 sys700 t80 opt o8 t90 · Sca58 · 200memfac • Sbba2 210 facmem • Sbbd4 220 compar a SbcSb 230 memplu • Sb867 240 memmul • Sba28 250 memsub • Sb850 260 memd1v SbbOf 270 lfTIP eqv 280 JITlP eqb 290 lfTIP ptv 300 jllP plb 310 lfTIP sbv 320 ,-np sbb 330 ,-np mv 340 ,-np nvb ,-np dw 350 360 ,-np dvb 370 ,-np bsv 380 ,-np bsb =

390 400 410 420 430 440

Jf!IP Jf!IP Jmp 1mp Jf!IP Jf!IP

vdv

vdb max

min square

CN Insert KO 450 dummy • • • +6 AH 460 zpage • • + 13 470 LG szpage HM 480 ldy #SOc •

CG 490 SZ1 BC 500 FC 510

Ida SOObl.y S!a zpage.y

.metnofytofact ,fac1 to memory :compare memory to fact :add memory to fact :mtAt fact by memory :sub lac t from memory ;d1111de fact by memory ; a() • v 'start1ng address ; a () • b( ) ' S8 + 3 : a () • a( ) + v ' sa + 6 : a( ) • a( ) + b( ) ' sa + 9 ; a()•a()-v'sa+12 : l( ) •a()·b()'sa+t5 : l( ) •l()•v 'sa• 18 .a()•a()•b()'sa•21 ; d( )•a()lv'sa•24 ;a()•a0'b()'S8+27 ; a( )•v-a()'aa+30 , a () • b()·b() 's<J+33 : a () • vla()'sa+36 ; a() • b( )Ia( ) sa + 39 : v• max(a( )) 'sa + 42 : v • mln{a())'sat45 ; a() • a( )12 'sa+ 48 :r nsortvata() 'sa+51

AF lA

540

550 rewt

KP FO

NC JL

DB 600 GE 610 NJ LO KB

620 630store 640 650 660 670 680 I&SII

6 90

BP OM

700 710 720 730 740 750 760 test 770 780

EO CJ JP

EO EF

AH BF OB 790 KO 800 NP 810 JE 820 PE

830 840teSl2 850

JP LC

860

BC 870 OJ 880 GJ 890 KP 900

910

JB 920cont

oc 930 IJ

940 950eqv BJ 960 DE 970 CH . 980 10 990 AH 1000 IP 1010 eqvt CE 1020 BO t030 JH 1040 IG 1050 Ot t060 BO t070

OJ 00 MJ

EG JB 10

GG GH GP

HN LJ

GL PA

GM MB Of

MD LO OL

LO PL HN

MN NF

GF KJ

GG OA DC

bpi ns

sz1

560 ldy #SOc 570 res10rez 580 Ida zpage.y 590 sta $00bl.y

PH : roullne to savo : zero page memory

530

I080 plv

t090 t100 t 1 1 0 ptv2 t120 t130 t 140 1150 tt60 1110 1180 tt90 t200 t2t0 1220 1230 1240sbv 1250 1260 1270sbvt 1280 1290 1300 1310 t320 1330 1340 1350 1360 1370 1380 1390 1400 bsv 1410

dey

bpi restorez rts ldx $b5 ldy Sb6 JSI facmem

rts

Ida $b7 de adc ts05 sta Sb7 Ida Sb8 adc ISOO Sla Sb8 Ida Sb9 clc adc NSOS sta $b9 Ida Sba adc noo sta $ba cmpSfc boe cont Ida Sb9 cmpSfb boe COlli de rts

Ida ldy

szpage modi

$b7 Sb8 JSt memfac

ldx ldy JSI jS( bcs ,-np

Sb9 Sba facmem tesl eqv1 reset

jS( JSI

szpage

store

jS( test bcs plv2 ,-np reset J6f

,sr

th" portOO I ,oncrements the •

;second arrey .potnten by .5

I :

,routone to

,oncrement ,f•rst atray

:po.ntera by

:and ched<

,tortheend

.of array

' .�not to end sat carry bol

;a( )•V ;store zero page ;get addresses

;address o

load v to tact

address of a()

,faci iOa(x)

.Check d done

.no cont.nue

;yes ext roultle .a( )• l( )+ v

modt

Ida Sb9 ldy Sba sta SbS sty $b6 151 memfac Ida Sb7 ldy $b8 JS1 memplu

rsr

•

rts JSI JSf

,eXIt ;store fac1 ;to memory , specollod at : $b5.$b6

:load addretB

,ol next a( )

,po1ntor for ,.store rout•ne 1st element to fact

,address of .v

.add v to lact

,results 10 a( )

,a() • a( )-v

szpage modi

Ida $b7 ldy $b8 J'll memfac Ida Sb9 $18 $b5 ldy Sba sty Sb6

151 memsub JSI store fSI lest

,load address .otv , v to lacl

,load address ,

:a() .a( )added to tact ,resuh to a( )

bcs sbvl JTIP reset JSf

szpage

��

OM 520 � � � �-� � � � 1420 � JSf � mOO � � M N ---� � ---------------= � � � � � � � � � � � The nansactor 3 1

J uty 9 117 :

Volu me I, s Isue 0 1

MJ LF

I 1430 bsv1

HJ HO

OA BD ED NL BM

QP LE

GA PG OM MH NO LP EO KN

OK BN EN NF HO

BC GJ 10

MB 00 MB JO NE LM HK

GG IE

PL BM GO

GE EO

OA ML HH 10 KM HM 00

BB EB NJ

EH BG GN

GO JP OK

Cl fJ OJ

JP ·

IN MK

HE PI

Gl Al D E MP LF

cc ID

00 JJ

Cl IH

1440 1450 1460 1470 1480 1490 1500 1510 1520 1530 1540 1550 1560mlv 1570 1580 1590 mfv1 1600 )610 16 20

1630 1640 1650 1680 1670 1680 1690 1700 1710 1720dvv 173 0 1740 1750dvv1 1760 1770 1780 1790 1800 1810 1820 1830 1840 1850 1860 1870 1880vdv 1890 1900 1910 vdv1 1920 1930 1940 1950 1960 1970 1980 1990 2000

2010 2020 2030 2040 plb 2050 2060 2070 plb1 2080 2090 2100 2110 2120 2130 2140 2150 2160 2170 2180 2190 2200 sbb 2210 2220 22305bb1 2240 2250 2260 2270 228 0 2290

ME 2300 GL 2310 HH 2320

The Traneactor

Ida lla ldy &ly jsr fda ldy

j$(

/Sf Jl(

Sb9 SbS Sba Sb6 memtac Sb7 Sb8 memsub store

szpage

ldy lly j$( Ida ldy /Sf )81 JSI bcs JlllP )Sr

)81

SbS Sba Sb6 memfac Sb7 Sb8 memmlA store test mlv1 reset

memfac

sta SbS

ldy Sba sty Sb6 )Sr memdov JBr store )Sr test bcs dvv1 JlllP reset ,.,

ldy sty J6f Ida ldy Jl( J6f

SbS Sba Sb6 memfac Sb7 Sb8 rnemdov Store

szpage

memfac

Ida Sb9

Sta Sb5

ldy Sba sty Sb6 18r memplu jsr store jsr Jasti bca plbl JlllP reset Jl(

1ft

BH DC

.addr-

.of a( )

Sb5

IIOte

2650

2660 2670 2680 bsb 2690

MN 2700 ME 2710 bsbl LF 2720 Kl 2730 EP 2740 OA 2750 80 2760 EO 2770 KE 2780

;fact • a( )lv ,a()•fac1

;a()•via( )

HJ Bl NH

;address ,of a( )

GA OA

OM MH HO LP

;fact - a() .address .oh ,fact -vllac1 :a()•fac1

K N

;a()•a()•b()

;address ;ot b() .facl •b() ;of a( J

;lac1 •facl•a() :a()-fac1

;InCrement b poonter then a

:a( )• a()-b( )

FO HL MP FO BL AJ PB OB JF HP

,address

;of a{ J

;fact • a( )-tact ;8( )•1

2 890 2900

2920

.address ,of b( ) :fac1 •b()

2810 2820 2830 2840vdb 2850 2860 2870vdb1 2880

BN EN KO PB

IG 00 MB Ml 00 Nl CE Gl JL HH ON

address

2800

2910

FK GK

2790

BC HM

modi

ldy Sba Sty Sb6 1ft memsub 1ft

NN HH

,adress .ofv :fac1 • v

szpage

Ida Sb7 ldy Sb8 fSI memfac Ida Sb9 Ita

.a()•a(Yv

modi

Ida Sb7 ldy Sb8 Jl(

.fact -a() :addr.ofv ,fact • a( )•v :a( J •lac1

modi

J&f test bcs vdv1 ,np reset JSr fSI

address ,of a() ,

szpage

Ida Sb9 sta

;a( )• a() •V

mod!

Ida Sb9

/Sf

szpage

Ida Sb7 ldy Sb8 Jl(

00 2370 MJ 2380 NA 2390mlb1 CM 2400 IN 2410 ON 2420 JD 2430 cc 2440 18 2450 MO. 2460 EO 2470 BE 2480 NO 2490 MM 2500 GM 2510 AO 2520dvb 01 2530 MD 2 540 JL 2550dvb1 CG 2560 IH 2 570 OH 2580 JN 2590 CM 2600 IL 2610 Ml 2620 IG 2630 80 2640

:tac1 •11() ;address ,of v .fact v-1() a()•fac1

modi

Ida Sb9 sta

GC , 2350

DO . 2360 mlb

te.t

bcs bsv1 ,np reset j$( j$(

AN 1 2330

O B 2340

2930 2940 2950 2960 2970 2980 2990 3000 eqb 3010 30 20 3030eqbt 3040 3050 3060 3070 3080 3090 3100eqb2 3110 3120 3130 3140eqb3 3150 3160 3170 3180 3190 mod2 3200

3210 AB 3 220

j$( test1 bcs lbb1 1flp reset )Sr

)Sr

SlPIIQe modi

Ida Sb7

ldy Sb8

Jl(

memfac

Ida S1a ldy Sly J$1 J$1 jSr bCs JlllP

Sb9 SbS Sba Sb6 memmlA store test1 mlb1

J$1 j$(

szpege

Ida ldy J$1 Ida

bcs JlllP

Sb7 Sb8 memfac Sb9 SbS Sba Sb8 memdov store test1 dvbl resat

J6f

szpage

sta

ldy sty j$( J6f Jl(

:increment b then a .a() • a( J·b( J

address

.of b() .fact • b( J .addt-

.of a( )

;tachlacloa( J .a( J. tacl

:Increment polnJers

roset

.a()•a()/b()

modi

.addr,of b() ,fact b() •

:address :of a( J :fact -facioa() ;a( J ·facl :oncrement

poonlo)ra

:a()•b()-1()

JSI modi

Ida Sb9 ldy Sba Sta SbS sty Sb6 fSI memfac Ida Sb7 ldy Sb8 fSI memsub ,., store J&f tesll bcs bsbl ,np reset fSI lSI

szpage

;address ;of a() ,faCI•a(J

;address :ot b() f,ac1 •b()-tact ;a()•fact ;oncrement poontars ;a()•b()/a()

modi

Ida Sb9 lla Sb5

ldy Sba sty Sb6 Jl(

memfac

Ida Sb7 ldy Sb8 18r memdiv

jsr store

J$1 taSil bcs vdbl JTIP resat J&f jSt

szpage

ldy Ida sta Inc boa one

Al$00 (Sb7).y ($b9) y Sb7 eqb2 Sb8

.address

;of a()

,fact -a() :address

;of b()

:fac1 ·b()lfac1 :a( )• fact

;a()• b()

modi

one Sb9 boa eqb3 one Sba Ida Sba fSI

test2

fSI

Saeld

bcs eqb1 1mp reset

)SI Sad9e Ida $47

,1st byte of b ,onto a ,oncrement

;address ;of b .

oncrement ;address :of a

,ho byte ole .end ot array ;no continue ;yes exot routine

;lond address ot a

;skip comma

· rounne

.lo byteol

July 1917: VolunM a. Issue 01

,, '

I I !I I

•

DE 3230 HB 3240 PG 3250 ED 3260 co 3270 00 3280 JP 3290 LC 3300agaln BH 3310 GO 3320 PB 3330 OM 3340 GP 3350 OF 3360 AD 3370 BH 3380 Bl 3390 PA 340 0 KD .:3410 step2 MD 3420 IL 3430step AF 3440 JD 3450 IN 3460 step1 KF 3470 JP 3480 GN 3490 0 00 350 EP 3510 GO 3520 NJ 3530 DP 3540 ML 3550 OF 3560 I M 3570 0 IB 358 A P 3590 BB 3600 El 3610 sl2 AB 3620 GJ 3630mod1 BB 3640 00 3650 3660 AJ NC 3670 HJ 3680 CP 3690 OK 3700 MG 3710max JC 3720 co 3730 HF 3740 JN 3750 CN 3760 PI 3770 DC 3780 EE 3790 EN 3800 BN 3810max2 EJ 3820 MH 3830 JG 3840 JG 3850 DH 3860 CN 3870 AG 3880 IJ 3890 FK 3900 FK 39t0 Jl 3920 KE 3930max3 KO 3940 KM 3950 PJ 3960 BO 397 0 BF 3980 lA 3990 OF 4000 Ll 4010 EH 4020 30 GL 40 4040m•n KJ DH 4050 MC 4060 OE 4070 PM 4080 AI 4090 HG 4t00 NG 4 1 1 0

4t20

The Tranaactor

sta Ida sta Ida sta Ida sta

$b9 $48 $ba $21 Sib $30 Sic

ldy N$00 Ida (Sib),y cmp$45 bne step2 1ny Ida ($fb),y cmp$46 bne step JSf step1 CIS

; a address ,h1 byte of .a address ;start of

AC PH HI OE NL MB NJ BK EH PO BO El KK BE BC LC Kl DC NO MJ AI

,array storage :search array Storage ;for name

:of

,'a' array ;routine returns :w•th ending address ;of a( �n Sfb,Sic

•ny JSr step1 JITlP ag81n •ny Ida sta lny Ida clc adc sta Ida clc adc sta

($1b),y $1d (Sib),y

:routine to ;skip through :array memory ;from one ;array to next

IP NL KH OE CK KM LD IK BG HC JK LH EA LH P O AK GO MB HD JO OJ FB BF EB BD MC NK LJ CK LP EN IC AC PC EE GO MG GK PG LM HM 00 BH KL AB AF JJ CD JN EB KC EP KB IE AH DP NO CF CN LB IL MG KF

Sfc Sic Sib

$1d Sib bee sl2 •nc Sic rts

fSr ISr Ida sta Ida sta

fCTlP

$aeld $b08b $47 $b7 $48 $b8 mod2

:routine to find b() ;slup comma : rout•ne :to find v,b :or create :var.able :II not found ;v maximum of a() •

fSr )Sf

Ida ldy fSr ldx ldy iS' JSf

szpage modt Sb9 Sba memlac *<dummy N>dummy lacmem tesl

:tact • a(O) ;store •n ;'dummy'

Ida $b9 ;next address ldy $ba :of a () ;fact•a() memfac JSC ldx M<dummy ldy l>dummy txa (Sf compar ;compare bmi max3 ;a() with 'dummy' ldx l<dummy ;fac1 larger ldy #>dummy ;then 'dummy' =fact ISC facmem !Sf

test bcs max2 ldx #<dummy ldy #>dummy txe

sr j ldx ldy jsr 1mp

memlac $b7 $b8 facmem reset

JSf

szpage

jsr Ida ldy jsr ldx ldy jsr

;done ;noconunue ;yes ;fac1 • 'dummy' ;address ;of v ;v fact •

;v = minimum of a( )

modi $b9 :address ;of a(O) $ba memfac ,store l<dummy :a(O) onto I>dummy lacmem :'dummy'

4130 4140min2 4150 4160 4170 4180 4190 4200 4210 4220 4230 4240 4250 4260min3 4270 4280 4290 4300 4310 4320 4 33 0 4340 4350 4360 4370square 4380 4390 4400squ1 4410 4420 4430 4440 4450 4460 4470 4480 4490 4500

4510 4520 4530 insert 4540 4550 4580 4570 4580 4590

4600 46t0 4620

4630 Ins!

4640 4650 4660 4670 4680 4690 4700 4710 4720 4730 4740 4750 4760 4770 4780 4790 4800 1Cls2 4810 4820 4830 4840 4850 4860 4870 4880 4890 4900 49t0 4920 4930 •ns3 4940 4950 4960 4970 4980 4990.end

IS'

test

Ida ldy jsr ldx ldy txa IS' bpi ldx ldy ISr

$b9 $ba memfac .f<dummy N>dummy

:address of :next a () ;load into fact ;and

compar min3 *<dummy #>dummy facmem

;compare wlt/l 'dummy' ;fact<'dummy ;then 'dummy'

jsr test bcs min2 ldx lf<dummy ldy lf>dummy txa JSf memlac ldx $b7 ldy $b8 jsr facmem JITlP reset jsr jsr

szpage mod2

Ida ldy sta sty jSr Ida ldy IS' IS' ISr bcs jmp

$b9 Sba $b5 $b6

fac

mem

$b9 $ba memmul store test squt reset

szpage modi 1$05 $bl $46 a bee inst Ida 11'$02 sta $bf Ida $1b sbc sta Ida sbc sta Ida etc sbc Sta Ida sbc sta ldy dey

:'dummy =mln(a)

;transfer ;'dummy' ;io ;v ;8•8•8

;address :of a()

jsr JSC Ida sta Ida asl

clc

: - fact

$bf $1b $1c 11$00 Sic $fb

,8() to tact ;fac1 •a•a ;increment po1nter ;a(x) •v ;following :elements :moved down :a(max)•a(max-t) :cont•nue ;untd :a(X + t)• a(x) ;then a(x) • v :routine wil ;automaiJcally :use proper offset :lor variable type ;wOfkswith ;stnngs (a$) :•ntegers (a%) ;or ;floating po•nt

Sbf $fd Sic noo Sfe $bf

Ida ($fd).y Sta ($1b),y dey bpi ins2 Ida Ste cmp$ba bne ins1 Ida Sid cmpSb9 bne 1nst ldy $bf dey Ida sta dey bpi jmp

($b7),y (Sfb),y ins3 reset

July 1987: Volume a, 111ue 01

Faster SqtJare Root For The Commodore 64

E.J. Schmahl Bowie, Maryland

. . . not only is it fast, it is much more accurate! •

If you time the C-64 functions built into your C-64 BASIC, you will find that the SQR function is very much slower than + ,-,• ,

For those interested in the algorithm used for computing the

or /. In fact it slower than EXP or LOG because it uses both of

square root, it is Newton's method, with a good first approxima· tion from a 16-entry table. In BASIC, the equivalent program

those functions, which are rather slow themselves. However,

would be:

1 0 input a 20 tf a = 0 then 90 30 tf a<O then 120 40 mput • ftrst approx • ,approx 50 x =approx 60 x = (x + a/x)/2 70 k = k + 1 80 if k<4 then 60 90a=x 1 00 print · sqr = · a 1 1 0 k = 0 goto 10 120 print · illegal quantity error ·

you don't have to be resigned to slow square roots, because it turns out that there are well-known algorithms that run faster than the SQR built into your C-64 ROM. To make this possible, I have written a short machine language square root routine which takes the first variable in the BASIC variable area of memory and replaces it with its square root. The program uses the BASIC ROM floating point functions which move, add and divide numbers. (No LOGs or EXPs are used.)

This routine can be run and compared with the standard SQR function in ROM:

1 0 mput a 20 print sqr(a);:sys49152 30 print a: goto 1 0 You will find that the new square root is about 2.5 times faster than the SQR in ROM, quite an improvement! But not only is it fast, it is much more accurate. Just try printing out the square roots of these squares: 26569, 21316689, 84309124, and

Enthusiasts of greater speed in the C-64 should note that there is room for improvement in most of the other BASIC functions. The favored method for approximating functions in the C-64 ROM seems to be power series. As the present example shows,

there are sometimes better ways to generate functions. A chal· lenge to you programmers out there: try some new methods and speed up your programs!

0.779689. The new square root gives the exact answers (I 63, 4617, 9182, and 0.883), but the ROM SQR routine does not! The i that the EXP function is not very accurate (6 to 8 digits reason s instead of 9) for certain numbers. {This inaccuracy problem has been cured in the C- I 28.) Note that, to keep things simple, (and fast) the new SQR operates

BASIC Loader

MC 1 00 rem a = 64 1 sys49152.pnnt a CP 1 1 0 rem where a is the first variable HI

only on the very first variable in BASIC. Thus whatever variable

appears first in the program is changed into its square root.

Make sure you declare your desired variable first with an

equality (e.g. 1 x = 1) or a DIMension statement (e.g. I dim x).

The BASIC loader loads the machine language into the area starting at 49152. You can change the variable AD in line 60 to 828 or 9•4096 or whatever you like. Line 70 of the loader

program will modify the non-relocatable machine language command "Ida tabl,x" appropriately for the new starting ad· dress.

L The Traneactor

JB JB AP PG

120 rem result of sqr will be in a 130ad = 491 52:ch • O 140 for 1 = 0 to 122: read x 150 poke ad+ t,x:ch = ch + x:next 160 if ch<>13691 then pnnt · error in data statements • end 170 hi= int((ad + 1 07)/256) 180 poke ad +59,ht.poke ad+ 58, ad+ 107-hi•256 190 rem new table address for relocated p 200data 160, 3, 177, 45, 48, 98, 136, 177 210 data 45, 240, 92, 165, 45, 24, 105, 2 220 data 133, 170, 165, 46, 105, 0, 133, 171

July 1917: Volume a. Issue 01

•

230 data 160, 0, 132, 93, 132, 94, 132, 95 LN 240 data 132, 96, 177, 170, 106, 1 76, 4, 1 62 MH 250 data 128, 134, 93, 105, 64, 133, 92, 200 ON 260 data 177, 1 70, 5, 93, 74, 74, 74, 74 IF 270 data 1 70, 189, 107, 32, 1 33, 93, 169, 4 DG 280 data 133, 172, 169, 92, 160, 0, 32, 162 Ml 290 data 187, 165, 170, 164, 1 7 1 , 32, 15, 187 01 300 data 169, 92, 1 60, 0, 32, 103, 184, 198 Kl 310 data 97, 32, 1 99, 187, 198, 1 72, 208,233 OM 320 data 166, 170, 164, 1 7 1 , 32, 212, 187, 96 Kl 330 data 76, 72, 1 78, 3, 1 1 , 18, 25, 32 FP 340 data 38, 44, 50, 58, 69, 79, 89, 98 ll 350 data 107, 1 1 5, 123 GN

DA PA LB

PAL Source Code

100 rem faster square root pal source 1 1 0 open8,8, 1 , •O:fast sqr.obj

200.

120 sys 700 FK 130 .opt o8 NH 140 • = $c000 BP 150 ; faster square root BH 160 , takes first bas1c vanable and LP 170 , returns square root in its place IG 180; uses newton's method with a good KG 190 ; first approximation. LA

DE PK

AH FB

AG JD

IL Nl

AM BK

NC JC

OK BD

AB HF

FC HN

JD MH HP

210 var = $2d ; start of variables $aa ; points to vanable 220 ptr ; iterat1on counter 230ctr $ac ; temp store for fit pt # 240temp - $5c 250 : 260 : rom routines 270 temf1 = $bba2 ; unpack 5c to fact1 280 diVId $bb0f ; facl1 -var/fac#1 290 plus = $b867 ;fac#1 • fac#2 + fac#1 300 f1tem "' $bbc7 ; pack fac#1 to 5c $bbd4 ; pack fac#1 to memory 310 f1mem 320 pnnt - $ffd2 ; chrout routine 330 : ;get variable's mantissa ldy #$03 340 Ida (var),y ;check if negative 350 bmi errorexit 360 dey 370 Ida (var),y ;get vanable's exponent 380 beq return ;return If var = zero 390 Ida var ;points to var name 400 clc 41 0 adc #$02 ;add 2 so ptr 420 sta ptr ; points to variable 430 Ida var+ 1 ;and store it 440 adc #$00 450 sta ptr + 1 460 ;fill temp with zeroes 470 ldy #$0 sty temp+ 1 480

The Tronsaetor

500

510 OH 520 10 530 ; now find a first approximation LO 540 : to the square root AI 550 ; exponent= exponent/2 + 40.5 KE 560 ; mantissa found from table HG 570 Ida (ptr),y ;get exponent (y • 0) GM 580 ;a= ala, pop low bit ror LO 590 , carry .. 1 when exponent odd bcs add HO 600 ;no flag set rf odd JB 610 ldx #$80 ;even, so set a flag btl PH 620 stx temp+ 1 ND 630 add adc #$40 ;a= exponent of 1st appr ML 640 sta temp ;store exponent BD 650 1ny ;y= 1 LN 660 Ida (ptr),y ;mantissa of vanable EH 670 ora temp+ 1 ;if expon odd add 80 JF 680 lsr ;sh1ft nybble nght lsr Ll 690 lsr FJ 700 PJ 710 tsr LJ 720 tax DO 730 Ida tabl,x ;get approx from table PK 740 sta temp + 1 ;store tt in temp mantissa GM 750 ; now use newton's method BN 760 : x"' (x + var/x)/2 Ida #$04 FD 770 sta ctr ;set counter to 4 MD 780 EA 790 Ida #<temp LG 800 ldy #0 ;load fac#1 from temp IF 810 JSr temf1 LJ 820 loop Ida ptr ldy ptr + 1 NM 830 JSr divid ;d1v1de facl1 1nto var NG 840 AE 850 Ida #<temp HK 860 ldy #0 ;add temp to facl1 jsr plus AJ 870 DG 880 ;divide fac#1 by 2 dec $61 OB 890 ;pack fac#1 to temp jsr f1tem dec ctr ON 900 ;decrement the counter PL 910 ;loop tf not zero bne loop KE 920 ldx ptr BD 930 ldy ptr + 1 NA 940 jsr f1mem ;pack fac#1 to memory LG 950 return rts Kl 960 errorexik:ja #$31 ; ·? JSr print ;print · ? · El 970 AM 980 rts HB 990 tabl .byte 03, 1 1 , 1 8,25,32,38.44,50 GM 1000 .byte 58,69,79,89,98, 1 07,115,123 OM I 10 10end

•

sty temp + 2 sty temp +3 sty temp + 4

490

· '

•

July 1917: Volu,. I, luue 01

Complex NtJtnber Arithmetic For The Commodore 64 BASIC 2.0 of the Commodore 64 supports three simple data

types. These are integers, floating point numbers and strings. With the addition of a simple machine language routine, it s i easy to add a fourth type: complex numbers. The routine described)n this article allows the representation of complex numbers by ordered pairs, and additionally supports the four basic operations of addition, subtraction, multiplication and division. The left-bracket, [, s i used to alert the Commodore 64 that you wish to perform some complex number arithmetic. A corres ponding right-bracket, ), allows the system to go back to normal floating point operation. The method by which these brackets switch the system over to complex number arithmetic is based upon Brian Munshaw's article, "A New Wedge for the Commo dore 64", which appeared in The Transactor, Volume 5, Issue 6, pp. 22-25 Refer to Brian's article to learn how new commands may be added to the 64 by means of the "Error Wedge".

Thomas Henry North Mankato, MN

On the other hand, if you simply wish to get down to business and use the program, then Program 1 is the listing you'll want. This s i a BASIC generator program which creates a working copy of the complex number routine on disk, ready for use. First, enter this program into your Commodore 64. Now run it. A checksum handler will halt the program if there are errors in the DATA statements. Proofread the program and make any correc tions as needed. If you make it past the checksum detector, then the complex number routine will be written to disk under the name of "COMPLEX.ML". This is the program that you will use from now on. You may discard Program 1 now, as it has served its purpose. Using The Complex Number Package

At this point you can load the package into memory with:

Before seeing how to punch this new routine into your computer, let's consider the details of representation and syntax. As men tioned above, complex numbers are represented in this system by ordered pairs. Whereas highschool algebra books might i denote a complex number by a+ bi, the ordered pair (a,b) s used hereinafter. The first entry s i always assumed to be the real part, while the second entry is the imaginary part. The syntax for a complex number operation s i (here shown for addition): ((X,Y) = (A,B) + (C,D)]

load • complex.ml " 8 1 ,

The program will load into memory from $COOO through $CJ C6. You should enter NEW at this point, then activate the routine with:

sys49152 This engages the complex number commands, making them available for use until you shut the computer off. To become familiar with the syntax, try out some examples. Here are a couple to get you started:

1 00 input a, b 1 1 0 1nput c,d 120 [(e,f) = (a,b)-(c,d)] 130 print e,f

The left-bracket signifies the complex number mode, while the right-bracket signifies the end of this mode. The variables X and Y are set equal to the results of A+ C and B + 0, respectively. Similar syntax holds for the other three operations. A, B, C and 0 may be any valid combination of values, variables or operands, but X and Y (which hold the resulting complex number) must of course be variables only. Adding The New Commands To Your Computer

Program 2 shows the complete assembly language listing. While it's not necessary to understand this listing to use the system, you will still find it to be quite interesting. In particular, the source code illustrates how to manipulate variables and perform rtoating point operations from within machine language. Also, the source code will be of inestimable value should you desire to add some new operations (like complex number conjugation, for example). So, give the code a quick glance over to become familiar with the several novel actions it performs. The Transoc:tor

100 P = 12: Q = 13.1 1 1 0 r=54.1: s=3.14 120 [(w,y) = (2•p,3•q)/(r/1 2,s)] 130 pnnt w,y In the first example, the complex numbers (A,B) and (C,D) are input. The latter is subtracted from the former and the result is printed out. In this case, all of the parts of all of the complex numbers are variables (i.e., A, B, C, D. E and F). Example two demonstrates that the parts of the complex num bers may actually be quite complicated. Here the complex number (2•P,3•Q) is divided by (R/12,S) and the result is left in the pair of variables W and Y (W is the real part and Y is the imaginary part).

July 1917: Volume I, luue 01

HH GJ LD PN JM JP PC OC Fl GN MO

Some Interesting Details

The real and imaginary parts of the two operands may be any valid combination of values, variables and ordinary numeric operators. Both integers and floating point numbers may be used. The real and imaginary parts of the result must be variables (since they store the final result). These too may be integer or floating point types. Be forewarned, however, that in general the product or difference of two complex numbers made up of integer components rarely lead to complex numbers with integer components. In this case, the Commodore 64 will truncate the fractional part.

BD FB AL IJ LG DG EM DE HB GJ

All of the values of the components in the complex numbers must, of course, be numeric in type. Attempting to use a string will lead to a TYPE MISMATCH ERROR. And as s i the case with integers and floating point numbers, division by zero is unde fined and will yield a DIVISION BY ZERO ERROR. The algorithms used to compute these various results are: (a, b)+ (c,d) =(a+ c,b +d) (a,b)-(c,d) = (a-c,b-d) (a,b)•(c,d) = (a•c-b•d,a•d + b•c) (a,b)/(c,d) = ((a•c + b•d)/(c•c + d•d),(b•c-a•d)/(c•c + d•d))

IK KG CO FL

JI LJ GO LM PO OK GB AG LL DC HA GB HD IF HK HP

Program 1: Creates disk file 'COMPLEX.ML ' -

AG EM EE Dl LB MG FP Gl MM Kl LO KL KP MA AP PA CB OE DA MD EL HC HK JC CO BP OM

1 00 rem prg file gen for complex.ml 1 1 0 ch = O 120 for a= 49152 to 49606 130 read x: ch = ch + x: next 140 if ch = 55928 then 160 150 print· error in data statements · :end 160 open8,8,8, " O:complex.ml,p,w • 170 print#8,chr$(0);chr$(192); 180 restore 190 for a= 49152 to 49606 200 read x: print#8,chr$(x);: next 2 1 0 close 8 220 rem 230 data 169, 1 1 , 1 4 1 , 0, 3, 169, 192, 141 240 data 1 , 3, 96, 224, 1 1 , 240, 3, 76 250 data 139, 227, 32, 1 2 1 , 0, 201, 91, 208 260 data 246, 104, 104, 32, 1 1 5, 0, 32, 250 270 data 174, 32, 139, 1 76, 32, 1 4 1 , 173, 141 280 data 168, 2, 140, 169, 2, 165, 14, 141 290 data 167, 2, 32, 253, 174, 32, 139, 176 300 data 32, 141, 173, 1 4 1 , 1 7 1 , 2, 140, 172 3 1 0 data 2, 165, 14, 1 4 1 , 170, 2, 32, 247 320 data 1 74, 169, 1 78, 32,255, 1 74, 32, 250 330 data 174, 32, 1 38, 1 73, 162, 173, 1 60, 2 340 data 32, 212, 187, 32, 253, 1 74, 32, 138 350 data 173, 162, 178, 160, 2, 32, 212, 187 360data 32, 247, 1 74, 141, 193, 2, 32, 1 1 5

The Tranaactor

370 data 0, 32, 250, 174, 32, 138, 173, 162 380 data 183, 160, 2, 32, 212, 187, 32, 253 390 data 17 4, 32, 138, 173, 32, 167, 193, 32 400 data 247, 1 74, 169, 93, 32, 255, 1 74, 173 410 data 193, 2, 201, 170, 240, 2 1 , 201, 171 420 data 240, 1 7 , 201, 172, 208, 3, 76, 1 430 data 193, 201, 173, 208, 3, 76, 216, 192 440 data 76, 8, 175, 32, 1 6 1 , 193, 169, 173 450 data 160, 2, 32, 135, 193, 174, 168, 2 460 data 172, 169, 2, 1 73, 167, 2, 32, 128 470 data 1 93, 32, 155, 1 93, 1 69, 178, 160, 2 480 data 32, 1 35, 1 93, 174, 1 7 1 , 2, 1 72, 172 490 data 2, 173, 1 70, 2, 32, 1 28, 193, 96 500 data 32, 180, 1 9 1 , 32, 167, 193, 32, 1 2 510 data 188, 32. 184, 193, 32, 202, 187, 32 520 data 1 6 1 , 193, 32, 12, 188, 32, 184, 193 530 data 169, 87, 160, 0, 32, 103, 184, 165 540 data 97, 208, 3, 76, 138, 187, 32, 202 550 data 187, 169, 173, 160, 2, 32, 162, 187 560 data 32, 12, 188, 32, 161, 1 93, 32, 184 570 data 193, 32, 199, 1 87, 32, 155, 1 93, 32 580 data 184, 1 93, 174, 1 68, 2, 1 72, 1 69, 2 590 data 32,212, 187, 32, 148, 193, 1 69, 188 600 data 160, 2, 32, 40, 186, 1 69, 92, 1 60 610 data o, 32, 80, 184, 32, 199, 187, 32 620 data 148, 1 93, 1 69, 183, 160, 2, 32, 40 630 data 1 86, 173, 1 68, 2, 172, 169, 2, 32 640 data 1 03, 184, 173, 1 93, 2, 201, 172, 240 650 data 28, 32, 12, 188, 32, 17 4, 193, 32 660 data 190, 193, 32, 18, 187, 32,203, 192 670 data 32, 1 74, 1 93, 169, 92, 160, 0, 32 680 data 15, 187, 76, 1 1 5, 193, 32, 203, 192 690 data 32, 177, 193, 174, 168, 2, 172, 169 700 data 2, 173, 167, 2, 32, 128, 193, 96 710 data 134, 73, 132, 74, 76, 1 94, 169, 174 720 data 193, 2, 224, 170, 208, 3, 76, 103 730 data 184, 76, 80, 184, 169, 1 78, 160, 2 740 data 76, 162, 187, 169, 188, 160, 2, 208 750 data 247, 169, 183, 1 60, 2, 208,241 , 1 62 760 data 188, 160, 2, 76, 212, 187, 169, 87 770 data 44, 169, 92, 160, 0, 76, 162, 187 780 data 32, 190, 193, 76, 43, 186, 165, 102 790 data 69, 1 1 0, 133, 1 1 1 , 165, 97, 96

Program 2: PAL Source Code LC

LB JE

130 .opt o8

EC> KM

140; 150:••••••••••••••••••••••••••••••••••••••• • 160;•

CA ID

ON 37

1 00 rem complex number arithmetic pal source 1 1 0 open8,8,1 , • O:complex.ml 120 sys700

170 ;• 180 ;• 190;• 200 ;•

•

complex number arithmetic for the commodore 64

•

+,-, • and I are all supported as

•

July 1987: Volume 8, lnue 01

•

HP 210 :• well as complex numbers OM 220 ;• (represented as ordered pairs). • AB 230 :• NH 240 ;• thomas henry EC 250 :• • CF 260; ······································· El 270 ; = $0e ON 280 intflg ;$00 fltpt, $80 = integer FP 290 forpnt = $49 ;temp pointer in list EK 3001acexp $61 ;fltpnt accum, exponent CF 310 1acsgn $66 ;fltpnt accum, srgn KM 320argsgn = $6e ;fltpnt accum #2, sign HD 330 aroisgn = $6f ;fac1 & fac2 sign cmp flag DL 340 chrget = $73 ;basic character get rtn OL 350 chrgot = $79 ;re-get old character FJ 360 realot $02a7 ;real part output pnt IF 370 imagot = realot+ 3 ;rmg part output pnt = imago!+ 3 ; 1st number real part 10 380 real1 MP 390imag1 real1 +5 ;1st number img part JM 400 real2 = imag1 + 5 ;2nd number real part FP 410 imag2 real2+5 ;2nd number img part GJ 420cmxop imag2 +5 ;complex # operator ON 430 ierror = $0300 ;vector to error routine BM 440 varstr $a9c2 ;store numeric variable CN 450frmnum = $ad8a ;evaluate a numeric CH 460 chknum = $ad8d ;check for number LP 470 chkcls $aef7 ;check for close paren DB 480chkopn $aefa ;check for open paren BC 490chkcom = $aeld ;check for comma 01 500chkchr $aeff ;check for chr in ace = $af08 FD 510 snerr ;do 'syntax error' 10 520 ptrget $b08b ;find variable EJ 530fsub $b850 ;fac1 = (a:lsb,y:msb) - fac1 KD 540fadd $b867 ;fact = (a:lsb,y:msb) + fac1 GP 550 faddt = $b86a ;fac1 fac2 + fac1 (setup) = $ba28 MF 560 tmult ;fac1 (a:lsb,y:msb) • fac1 = $bb0t LL 570 ldiv ;fac1 = (a:lsb,y:msb) I fac1 = $bb12 GK 580 fdivt ;fac1 = fac2 / fac1 DC 590 divzer $bb8a ;'division by zero' KJ 600 movfm $bba2 ;fac1 = (a:lsb.y:msb) = $bbc7 IK 610 flt5c ;read fac1 to $5c-$60 = $bbca NM 620 flt57 :read fac1 to $57-$5b FD 630movmf = $bbd4 ;(x:lsb,y:msb) = fac1 NN 640movaf = $bc0c ;lac2 = fac1 DH 650 negop $bfb4 ;fact = -fac1 FM 660 olderr $e38b ;continue old error routine EB 670 ; JJ 680 · = $c000 IC 690 ; HI 700in� Ida #<cmxrtn ;change error vector NC 710 sta ierror KO 720 Ida #>cmxrtn IC 730 sta ierror + 1 AN 740 rts EG 750 ; AN 760 cmxrtn cpx #$0b ; · syntax-error ? GE 770 beq cmx1 ;yes. move FD 780cmx0 jmp olderr ;no, do regular error routine Ml 790; EA BOO cmx1 jsr chrgot ;reget olfend1ng character MF 810 cmp #'[' ; " left-bracket? EC 820 bne cmxo ;no, ordinary error IP 830 pla ;pop junk from stack AN 840 pla

Fl 850 KA 860 BH 870 OM 880 AP 890 ; Gl 900 GP 910 JF 920 OA 930 FK 940 co 950 OB 960 BC 970 PI 980 HI 990 BG 1000 IH 1010 CA 1020 HI 1030 OL 1040 PA 1050 HO 1060 BP 1070 MN 1080 LD 1090 PL 1 100 EB 1 1 10 OB 1 1 20 OA 1t30 KP 1t40 PB 1 1 50 PH 1 1 60 AE 1170 EJ 1180 MG 1 1 90 GH 1200 OF 1210 NL 1220 DE 1230 DA 1240 IG 1250 ON 1260 HH 1270 GH 1280 ; FF 1290 HA 1300 DB 1310 OJ 1320 ; PC 1330 BD 1340 ML 1350; IE 1360 CM 1370 EO 1380 EO 1390 ; Cl 1400 cmx2 1410 EA 1420 MA 1430 ; NP 1440 cmx3 AC 1450 ; FM 1460cmx4 FC t470 Ll 1480

• •

•

on.

The baniGCtor

jsr jsr

chrget chkopn jSr ptrget jSf chknum

;fetch next character ;check lor open paren ;lind real output ;check if numeric

sta realot + 1 :lsb sty realot +2 ;msb Ida intftg ;save integer flag sta realot jsr chkcom ;check for comma jsr ptrget ;find img output jsr chknum ;check rf numeric sta imagot + 1 ;lsb sty imago!+ 2 ;msb Ida intflg sta imagot ;save integer flag jsr chkcls ;check for close paren Ida #$b2 ;check for ' = jsr chkchr . JSr chkopn ;check for open paren jsr frmnum ;evaluate real #1 ldx N<real1 ldy #>real1 jsr movmf ;save it for later jsr chkcom ;check lor comma jsr frmnum ;evaluate img #1 ldx #<imag1 ldy N>imag1 jsr movmf ;save it for later jsr chkcls ;check for close paren sta cmxop ;save operator jsr chrget ;get next character jsr chkopn ;check for open paren jsr frmnum :evaluate real #2 ldx N<real2 ldy #>real2 jsr movmf ;save it for later jsr chkcom ;check for comma jsr frmnum ;evaluate img #2 jsr otimg2 :save 11 for later JSr chkcls ;check lor close paren Ida #'] ;check for ']' jSr chkchr '

Ida cmxop cmp#$aa beq cmx4

;restore operator ; " isit + ? ;branch 1f it is

cmp#$ab beq cmx4

;"isit-? ;branch 1f it is

cmp#$ac bne cmx2 jmp cmx8

;"is� · ? ;branch 1f not

cmp#$ad bne cmx3 jmp cmx6

;"is�/? ;branch if not

jmp snerr

;'syntax error'

jsr inrel2 Ida #<real1 ldy #>real1

; bring 1n real /12

July 1987: Volume 8, 111ue 01

•

PK IC KD KE BM CD AH GN BN pp

OA JP BP AE

NO BK GA AM PF FM IC GA FE AE KA AM IH KG

OG EH

FH PD FP MK EL GB MM OK AM MB AE PO

JB GC FD FH

EN AJ

EE KK HG 10 GF EH CF IB 10 JL KD JE

1490 1500 1510 1520 1530 1540 1550 1560 1570 1580cmx5 1590 1600 1610 1620 1630 ; 1640 cmx6 1650 1660 1670 1680 1690 1700 1710 1720 1730 1740 1750 1760 1770 1780 ; 1790 cmx7 1800 cmx8 1810 1820 1830 1840 1850 1860 1870 1880 1890 1900 1910 1920 1930 1940 1950 1960 1970 1980 1990 2000 2010 2020 2030 2040 2050 2060 2070 2080 2090 2100 2110 2120 •

The Tronaoctor

jsr ldx ldy Ida jsr JSr Ida ldy jsr ldx ldy Ida jsr rts

addsub ;do + or-. realot + 1 realot+ 2 realot ;integer flag storfp ;store real result inimg2 ;bring in img K2 K<imag1 #>1mag1 addsub ;do + orimago!+ 1 lmagot+ 2 imago! ;integer flag storfp ;store img result

Jsr jsr jsr jsr jsr jsr jsr JSr Ida ldy jsr Ida bne jmp

negop otimg2 movaf cmult flt57 inrel2 movaf cmult #$57 11$00 tadd lacexp cmx7 divzer

jsr flt57 Ida N<real1 ldy ll>real1 jsr movfm jsr movaf jsr inrel2 JSr cmult jsr flt5c J5r inimg2 J5r cmult ldx realot+ 1 ldy realot + 2 jsr movmf jsr 1nimg1 Ida ll<imag2 ldy ll>imag2 jsr tmult Ida #$5c ldy #$00 jsr lsub J5r flt5c jsr in1mg1 Ida K<real2 ldy #>real2 Jsr tmult Ida realot+ 1 ldy realot + 2 jsr fadd Ida cmxop cmp 11$ac beq cmx9 jsr movaf jsr 11157 Jsr adjsgn .

GF KH CG

NP IE

OA GM

GJ EB EC OE KM OF AE CH FO NH HK KJ FO EF OD

;negate d for conJugate ;saved ;fac2 d ;fac1 d•d ;saved•d ;bring inc ;tac2 c ;tac1 c•c =

;fac1 c•c + d•d ;check tor zero ;branch if okay ;'division by zero'

MM OE AO GH MD LP lA EK HG NK AD OP EJ FN IF HL HL NE AI BD

;save c•c + d•d

;bring in a ;tac2 a ;bring 1n c ;fac1 a•c ;save it ;bring 1n d ;fac1 a•d =

;save a•d ;bring 1n b

;fac1

b•d

JG FL AC ML MH JL KN GB CB IL JH Cl GB Gl

;fac1 a•c- b•d ;save it back ;bring in b

;fac1

b•c

;fac1 a•d + b•c ;check operator : is it • ? ;yes, branch ;fac2 a•d + b•c ;fac1 mag squared ;adjust sign •

2130 jsr fdivt ;fac1 (a•d + b•c)/(c•c+d•d) 2140 jsr cmx5 ; store imaginary part jsr flf57 2150 ;fac1 mag squared 2160 Ida K$5c ;fac1 (a•c-b•d)/(c•C+d•d) 2170 ldy K$00 2180 jsr fdiv ;final result 2190 jmp cmx10 2200 ; 2210 cmx9 jsr cmx5 ;store imaginary part 2220 jsr flf5c ;fac1 real part 2230 cmx1 0 ldx realot+ 1 2240 ldy realot+ 2 2250 Ida realot ;integer flag 2260 jsr storfp ;store real part rts 2270 2280 ; 2290 ;Ill complex number utilities Ill 2300 . 2310 storfp stx forpnt 2320 sty forpnt+ 1 2330 jmp varstr ;go store value 2340; 2350 addsub ldx cmxop ;check operator 2360 cpx #$aa : ' isit + ? 2370 bne as1 2380 Jmp tadd ;go do + 2390; 2400as1 Jmp lsub 2410 ; 2420 inimg1 Ida ll<imag1 :bring in imag1 2430 ldy ll>imag1 2440 cmovfmjmp movfm 2450 ; 2460inimg2 Ida K<imag2 ;bnng in imag2 2470 ldy K>imag2 2480 bne cmovfm ;branch always 2490; 2500 inrel2 Ida #<real2 ; bring 1n real2 2510 ldy ll>real2 2520 bne cmovfm ;branch always 2530; 2540 otimg2 ldx K<imag2 ;store imag2 2550 ldy N>imag2 2560 jmp movmf ;branch always 2570 ; 2580 flf57 Ida #$57 2590 .byte $2c 2600 flf5c Ida K$5c 2610 ldy #$00 2620 JffiP movfm ;move to fac1 2630 · 2640 cmun jsr adjsgn ;set up tor multiply 2650 jmp fmult +3 ;fac1 fac1 • tac2 2660; 2670 adjsgn Ida facsgn ;adjust sign 2680 ear argsgn 2690 sta arisgn 2700 Ida facexp 2710 rts 2720 ; 2730.end =

�

July 1917: Volume I, l11ue 01

FAC I Facts

John Houghton Collingwood, Ontario $bbc7: move FACI to memory.

QUESTION: In machine language, how do you multiply 3 x 4 ? ANSWER:

-This routine has several entry points depending on where FACt

Well, )OU take the multiplicand {3) and add it to itself. the

s i

to be stored.

-Enter at Sbbc7 and FACt goes to S5c-S60 (and will get clobbered if

number oflimes m the mulllplier {4).

Sbcf3 is called again).

QUESTION: OK! Then how do you multiply 10. 125 x 6.375 ?

-Enter at Sbbca and FACt goes to S57-S5b (and is immune to Sbcf3

â&#x20AC;˘

calls).

ANSWER: Sorry, anythmg past mteger artthmetic m M.L. gets left

-Enter at Sbbd4 and FACt goes to the address pointed to by the .X

alone. Either do it in Basic or not at all.

(low) and .Y (high) registers.

"The time has come" the walrus said, "to think of many things.

$bba2: move memory to FAC I.

Like. . ." floating point arithmetic.

-Point the .A (low) and .Y (high) registers at memory and this routine loads the 5 byte floating point number into FACt.

Remember way back when, in high school algebra, something called logarithms was discussed? Well, floating point notation is

$baSe: move memory to FAC2.

similar in nature. Instead of base 1 0 notation, F.P. on the computer

-Same as above for FAC2.

uses

base 2. Therefore, a number s i the equivalent of the Mantissa

$bc0c: round and move FAC t to FAC2. $bc0f: move FACt to FAC2 no rounding. $bbfc: move FAC2 to FAC t $bclb: round FAC I

times 2 to the power of the Exponent (In simplified terms). Sounds confusing, and it can be, especially when it s i time to explain how to

add, multiply etc , but exact knowledge

of how F.P. works is not

needed to be able to use 11 tn a machine language program. In fact the best advice s i to cheat and let ye olde trusty micro-processor do the work. All that is needed to be known are the ground rules by

$bc5b: compare FAC 1 to memory. -Point the .A (low) and Y (high) registers to an F.P. number in

which to operate.

memory. and this routine will return a 0 in .A if they are the same.

The information discussed in this article pertains directly to the

a I in .A if FACI s i greater than memory and Sff in .A if memory is

Commodore 64 but other Commodore machines will have similar

greater than FACt .

routines in their ROM. just check the ROM memory maps. After a

discuss1on of these ROM routines, a short PAL source code program

$b7f7: convert FAC I to 2 byte Integer. -.A and Y as well asS 14/S 1 5 contain the integer.

will run through some of the operations

(Note: this only works for pos1tive values. II you know the value in

There are two floating point accumulators in the 64. FACt at S61 to

FACI is positive. set the sign bit at $66 to zero. Otherwise.

use

SbI bf to convert to a signed integer. or Sbc9b to get a 4 byte signed

$65 and FAC2 at $69 to S6e. S61 and S69 contain the exponents,

$62 to S65 and S6a to 6d contain the 4 byte mantissa and $66 and S6f contain the signs lor each number. There is a main work/

integer.)

storage area at S57 to 560 used for F.P. crunching. As well there are

$bc9b: convert FAC I to 4 byte integer.

some miscellaneous but important locations at $67/$68 and S6f to

-stored in FACt mantissa area $62 to S65.

$72.

$bddd: convert lac t to ascii string. -The ascii string is stored at SO I 00 with a 0 after the string and the

Now here is a list of some of the routines lor manipulating floating point numbers.

.A (low) and Y (high) registers pointing to the string address. In the process. FACt is altered as well as memory area S5d and SSe. To

$bcf3: convert ascll string to FAC t

print the string after th1s routine make a direct call to Sab I e.

-To use this routine place an asc1i numeric string, with a 0 after the string, in a buffer. Point the CHRGET pointers at S7a/S7b to the

first character and call CHRGOT before entry. -This routtne IS called by Sad9e and Sae83 routines. -It clears FACt. FAC2 and numeric work area S5d to S60 before converting the string to F.P. notation. Therefore preserve anything

in these three areas that are needed later. -It works like the VAL function in

basic. indeed VAL calls this

routine. and will ignore alphabetic entry after an ascii numeric

The next routines

need

the address of the floating point number

stored in the .A and Y registers before being called They all move that number to FAC2 and then perform the appropriate operation.

$b850: subtract memory form FACI $b867: add memory to FAC I $ba28: muhlply FACl by memory $bb0f: divide memory by FAC I

string.

-It will accept scientific notation incorporating an 'e' and a leading t + ' or ' ' -

TM Transactor

An alternative to these arithmetic operations is to move the needed

number to FAC2 by one of the previously listed move routines. Then

July 1917: Volume I, Issue 01

0 1\ 100 rtiTl •••

for the add and divide routines load the A or X register with $61, and call one of the following: $b853: $b86a: $ba30: $bb12: $bnb:

MG MG KK ED LH GC

subtract FAC2 from FACl add FAC2 to FAC l multiply FAC l by FAC2 divide FAC2 by FACl raise FAC2 to the power of FACI

OM CF

1\0

CN NO LB El LD

Other useful routines are listed below. $b849: $bccc: $bae2: $bate: $e264: $e26b: $e2b4: $e30e:

add .5 to FACl (no pointers needed) perform INT (calls $bc9b and reconverts to F.P.) m6ltiply FAC I by 10. divide FACI by 10. perform COS to FACI. perform SIN to FAC I. perform TAN to FACI. perform ATN to FACI.

HH BN BB KA

Cl FH FA KH IH JB l;lJ

The trigonometry functions above need the angle, expressed in radians, stored in FACI.

MM Cl PE AM

And there are some five byte floatmg point constants stored in ROM that you might want to use. $bfl l: $b9bc: $bal9: $aea8: $e2e0: $e2e5: $e2ea:

01.. PF

constant .5 constant I constant 10 constant pi constant pi/2 constant 2•pi constant 1/4

220 .

230 .a routtne to dem

onstrate the use

240 .ot ftoatong poont numbers. the 250 .assocoated ftoat•no poont 260 .eccumulators and rom roullnes 270 . 280 Ida 1$00 290 sta count ;clear •nleger 300 818 count+ 1 :storage ;store chrget Ida $78 310 ;pointers 320 6la oetlo 330 Ida $7b 340 sta gethi 350 Ida l<bulfr1 ,poont chrget to ;1st number 360 6la S7a 370 Ida l>bulfr1 380 81a $7b 390 lsr $0079 ;call chrgot :ascii to tac1 400 jsr $bcf3 410 1sr Sbbca ;fac1 to mem $57 Ida l<bulfr2 ;point chrget to 420 .2nd number 430 81a S7a Ida l>bulfr2 440 618 $7b 450 460 J&r $0079 ;caDchrgot ,ascii to lac1 470 ,., Sbcf3 480 J$r $bbc7 ,tact to mem S5c Ida 1$57 490 ldy 1$00 500 510 jsr $ba28 ;$57 to lac2 & mull 520 jsr $bbca ;product to $57 -

GP PF co 8C

BN Nl JC Ml DE DH CD BH BC PG CN

Now onto a short d1scussion of the program. first, BUFFRI is converted from an ascii string to an F.P. number in FACI and moved to memory location S57. Then BUFFR2 is similarly converted and stored at SSe. The two numbers are then multiplied and stored in $57. Finally the two original numbers are added together and a check to see if the sum is less than the product. If it is less, then keep adding until the sum exceeds the product. The program will then print the sum to the screen, print the product to the screen and print the number of ltmes it added the two numbers together.

640 .

650 nex 660

670

680

690

700 710 720 730 740 750 760 770 780 Jl 790 JL 800 ED 810 NA 820 PC 830 CB 840 AO 850 GB 860 KN 870

Here are some alterations to the program. Try messing around with the ascii numbers and see what other values will be produced. Change the arithmetic operations in lines 510 or 590. Maybe use the move routine at SbcOc in hne 600 instead, to see what effect takes place on a lot of additions. Use large original numbers to find out when scientific notation displays take over.

GG KP NK HO NM

880

890

900

.SSe to fact

.exponent fac1 ;add fac2 to fact ;sum to fac2 :•nc number of ;additions

• Ida 1$57 ldy 1$00 ,., $bc5b bml �

;compare sum & prod ;fact < $57

JSt

,pnnt aum

)SI'

Ida

sr j

Ida ldy

jsr

Sbddd Sable 1$0d $Hd2 1$57 1$00 $bba2 Sbddd Sable

jsr Ida ISOd

fSI

Ida ldx

sr j jsr Ida 818

Ida 818

rts

,fact to asco

,$57 to lac! ;feel to asci1

:pnnt product

$ffd2 count+ 1 count Sbdcd Sable getlo $7a geth• $7b

:get count of ;addrttOnS conv«t .1111 to ascu ;pnnt count ;restore chrget

910 count • • • + 2 920getlo • • • + 1 930geth• • • • + 1 cc 940. PP 950 bulfrI .asc • 10. 125 • AI 960 .byte$00 AE 970. ON sao bulfr2 asc • 6 375 • OJ 990 byte $00

That's probably enough to make the old wood start burning, but t i will be interesting to learn who will be the first to convert Chris Zamara's SPRITE ROTATE from VOL. 5 ISS. I entirely Into M.L.???

The Transac:tof

·-

JN ID HH PH LD II 530 . El 540add • EK 5 50 Ida l$5c DL 560 ldy 1$00 PG 570 J$r $bba2 NN 580 ldx S6t JG 590 JSt $b86a JH 600 J$r SbcOI 1nc count FD 610 620 IF bne nex Ino count+ 1 BF 630

There are some other routines in ROM that perform overflow checking. exponent addition, and sign checking that will need to be accessed when getting into long and complex formulas but for now the routines outlined will get the fear of using rloating point numbers from a machine language program out of the way.

••• fac1 facts 110 rem ... by JOhn houghton ... 120 rem • • • COihngwood ont • •• 140 rem 150 rem pal source code 170 sys700 190 optoo 200. $c000 210

Jvly 1917: Volume .

..... 01

High-Speed Integer Multiplies and Divides

Donald A. Branson St. Louis, Missouri

. . .If your processor has multiply/divide commands, no problem. However, if it does not. . .

If you have written any amount of assembler code, you have probably encountered a situation where you wanted to do a multipli· cation or a division. If your processor has multiply/divide com· mands, no problem. However, if it does not (as in the case of the 6502-series CPU in Commodore's 8-bit computers), you may have done a multiply by adding an operand to itself, decrementing the operand at the same time until it reaches zero.

•

• •

This s i probably the most straightforward way to do a multiply, but a binary multiply can be done the same way a person multiplies a decimal number by hand. This way s i as easy to do and, in all but a few cases, is quite a bit faster.

When we multiply decimal, we have this table in our heads. However, the table s i simplifiedwhen we do binary multiplication. If fact, it is simplified to the point that the result of a multiply can be one of two thin�: a zero bit or a one bit.

Multiplication

A result table does not need to be kept for binary multiplication. The table is effectively implied in the operands.

First, let's look at the way a decimal multiply IS done, in order to draw attention to some key elements in any multiply. The procedure s i expanded on the right to show more specifically what is happening here.

35 15 175 350 525

1) 2) 3) 4)

5. 5 5 • 30 10.5 1 0 . 30

= "' =

For example:

15 35

.. =

$OF $23

= =

%0000 1 1 1 1 o/o0010 0011

150 50

300 525

It can be seen that 35 has not been added to itself 15 times or 15 added to itself 35 times. Doing It that way would take longer and, if you're doing it by hand, more prone to error.

00001 1 1 1 X 00100011 0000 1 1 1 1 0000 1 1 1 1 00000000 00000000 00000000 0000 1 1 1 1 00000000

M1 M2

000001 000001 101 ($0200 .. 525)

OOOOQQQQ

What has been done s i to multiply each digit in the first number against all the digits in the other number This same method can be appled i to binary multiplication.

Now to look at the process in a way that can be easily represented in a computer. We'll call the multiplicand MI, the multiplier M2, and the f.eld where the result s i left R, like this:

In order to look at one binary digit (bit) at a time, a combination ol the L.SR and ROR operations is used to shift the bit n i to the carry bit, where it can be examined with a BCC or BCS operation. In this way, one digit can be multiplied at a lime. If this were a decimal multiply, we would have to have a table of results for each possible combina tion of one digit multiplies, like this: TM franaactor

M1: 0000 0000 0000 1 1 1 1 M2: 0000 0000 0010 0011 A: 0000 0000 0000 0000 42

July 1917: Volume I, luue 01

•

Since the result will be sixteen bits (525 > 255), all the fields are

Division

represented as sixteen bits. Now we'll take a look at division. Binary division can also be done First, M I is shifted right, so that each bit can be looked at from right to left as in the decimal multiply shown before. Asyou can see in the

by mimicking the way decimal division is done. Let's look at an

example of binary multiplication above, the digit can be either one or zero, and the result of the single-digit multiply is either zero, or a

Here's how it would be done by hand, in decimal.

example of how to compute 43/5, giving a result of 8 remainder 3.

shifted into the carry bit, M2 is added to R if the carry is one, then

M2 is shifted left, in preparation for the next digit. Here, 'SR' stands for shift right, 'SL' for shift left.

1·

carry

SR M 1 : 0000 0000 0000 0 1 1 1 1 R = R + M2: 0000 0000 0010 0011 SL M2: 0000 0000 0100 01 1 0 SR M 1 : 0000 0000 0000 0011 1 R = R + M2: 0000 0000 0110 1001 SL M2: 0000 0000 1000 1 1 00 SR M 1 : 0000 0000 0000 0001 1 R = R + M2: 0000 0000 1 1 1 1 0101 SL M2: 0000 0001 0001 1000 SR M 1 : 0000 0000 0000 0000 R = A + M2: 0000 0010 0000 1101 SL M2: 0000 0010 0011 0000

Note that we can stop here, because M 1 is zero, and the carry bit will no longer be set as a result of shifting M 1, and therefore M2 will not be added to R any more times. At this point, the result of the

M1 A1

Here s i how this p rocess looks in assembler: ;in PAL- MLOOP = • MLOOP EQU • LSA M1 ;SA M1 AOA M1 + 1 ;the carry from M1 ...... M 1 + 1 BCC SHIFT ;add on carry set ;A=A+M2 CLC LOA M2 + 1 ADC A + 1 STA R + 1 LOA M2 AOC A STA A SHIFT EQU • ASL M2 + 1 ;SL M2 AOL M2 LOA M1 + 1 BNE MLOOP LOA M1 ;if M1 and M1 + 1 = 0 BNE MLOOP ;when we are done ATS ;or .BYTE $00,$23 M1 HEX 0023 HEX OOOF ;or .BYTE $00,$0F M2 A ;or .BYTE $00,$00 HEX 0000

The Transoctor

= =

M2 = 43 0010 1011 A2 = 0000 0000 =

5 = 0000 0101 0000 0000

In the case of division, two result fields are needed, one for the quotient, the other for the remainder. Specifically·

M1 / M2

A1 rem A2

M2 will be shifted left into R2, and R2 will then be compared to MI. If R2 s i greater than or equal to Ml, then Ml will fit into R2. The result of a binary divide can be only a zero or a one, again saving us

the trouble of having a result table, as is necessary for decimal division. If M I will fit into R2, then we subtract MI from R2, leaving the result in R2. Finally, R1 s i shifted left, with the carry bit from the compare going into the least significant bit. pass

SL M2 into A2 A2 = 0000 0000 M2 = 0101 0110 CMP A2-M1 (carry clear) A1 = 0000 0000 SLA1

SL M2 into A2 A2 = 0000 0000 M2 = 1 01 0 1 1 00 CMP A2-M1 (carry clear) A1 = 00000000 SL A1

SL M2 into A2 A2 = 0000 0001 M2 CMP R2-M1 (carry clear) 0000 0000 SLA1 R1

multiply s i left in R.

•

1 ) 8 . 5 40 2) 43 - 40 = 3

•

pass

8 5 ) 43 40 3

duplicate of M2, properly shifted to the left. After each digit in M I is

0101 1000

SL M2 into A2 R2 = 0000 0010 M2 = 1 0 1 1 0000 CMP R2-M1 (carry clear) A1 = 0000 0000 SL R1

SL M2 into R2 R2 = 0000 0101 M2 = 0 1 1 0 0000 CMP A2-M1 (carry clear) SLA1 R1 0000 0001 R2 = A2-M1 R2 = 0000 0000 =

SL M2 into A2 A2 = 0000 0000 CMP R2-M1 (carry clear) SL R1 A1 0000 0010

M2 = 1 1 00 0000

SL M2 1nto R2 R2 = 0000 0001 M2 = 1000 0000 CMP A2-M1 (carry clear) 0000 0100 SLR1 A1 (. . . cont'd on page 45) =

July 1917: Volume I, luue 01

•

Secondary Address Bits

Jim Butterfield Toronto, Ontario

. . . a characteristic of secondary addresses that s i not well known. . . •

i 4 or more, you are When you work a device whose number s allowed (sometimes required) to use an extra number called a secondary address. The purpose of the secondary address is to choose a channel within the device. In other words, if I'm using the disk (usually device 8), I may want to have several things going at one time: one file might be in the process of being read, with another separate file being written at the same time. Although these are happening in the same device (the disk, number 8), we want to keep them separate. To do this, we supply unique secondary add resses for each process. This article documents a characteristic of secondary addresses that is not well known, plus an oddity in the way it is sometimes used. The characteristic is this: Commodore Basic always adds 96 to the SA (secondary address) used by an OPEN command before storing this value. Machine language routines, however, don't do this, and you may want to add in the value to keep operation consistent. The oddity is this: despite documentation, the number you supply to go with a LOAD command is not a secondary address. It's just a flag, and will later be replaced by a SA of 0 (plus the extra 96). Try It l}'pe the following direct Basic command on your computer: OPEN 2,8,15 . . . now you can check the three values you have supplied by PEEK-ing them directly from the tables where they have been stored. Assuming this s i your only active file, you should see the three values at: VIC-20, Commodore 64: Most PET/CBM: B-128 C-16, Plus-4 Commodore 128

601, 593, 820, 1289, 866,

6 1 1 , 621 603, 613 830. 840 1299, 1309 876, 886

Using the PEEK address from your machine, if you PEEK the first address, you'll see the value 2 from the command that was entered. PEEK the second value and you'll see the 8. . . but when you PEEK the third value. the I S has mysteriously changed to I l l . The computer has added 96 Why? I don't know. . . but I do know that the Basic side of the computer is quite specific about doing this. And if there is no secondary

address, the Basic handler carefully sets the SA to a value of 255. . . a flag value which signals to the various parts of the kernal that there is no secondary address. If a secondary address is being used, it's sent out every time we wish to connect to a file. When we call the device (usually the disk drive) we signal which sub-channel we are using via the SA. And there's more: the SA s i also used to signal an OPEN or CLOSE as well as a normal data transmission. Here's the system: When we open a file, we send the original SA, plus 240, to the device, followed by the file name. When the disk sees this value (240 to 255), it knows to expect a file name to follow - not data. When we close a file, we send the original SA, plus 224, to the device. When the disk sees this value (224 to 239), it knows to close the file. Finally, when we send or receive data, we send the SA as it is stored in memory (which includes the added value of 96). The disk sees that the SA is neither an OPEN nor a CLOSE, and handles the data as desired. Now. . . when Basic puts the SA away for you, all the above happens automatically (add 96 to value supplied, or set 255 if there s i no secondary address) But if you do it yourself in machine language, you must do it all. So. . . ifyou're going to call SETLFS as a first step towards calling OPEN, set up the secondary address correctly. In other words, if you were planning to OPEN in a similar manner to the above command (OPEN2,8,15), I'd suggest you code: LOA #$02 LOX #$08 LOY #$6F JSR $FFBA ;(SETLFS) Note that the secondary address of 15 (hex #$OF) has had a value of 96 (hex $60) added to 11, to make a total of $6F. And if you want to open to the printer with the equivalent of OPEN3,4 . . I recommend: .

LOA#$03 LOX #$04 LOY #$FF JSR $FFBA ;(SETLFS) July 1917: Votume I, 111ue 01

··

To signal that no secondary address is called for, put 255 (hex FF) into the Y register. Both of the above calls should be followed soon by a call to OPEN ($FFCO). Because here's the catch: the above setup does NOT work as expected if you're going to call LOAD ($FFD5).

•

The documentation doesn't tell you this. . . but if you are going to make a call to LOAD, your prior call to SETLFS does not set a secondary address. Instead, it sets a flag. A value of binary zero allows the program to relocate as it is loaded; any other (non-zero) value triggers a load to a fixed address, with no relocation. This last is what is most often wanted. And in the case of LOAD, you do NOT want to add 96. If your objective is relocation, the only value that works in the Y register is zero. . . add 96 and it isn't zero any more, and you will NOT relocate. I don't use calls to LOAD much. In most cases, it seems to me to be as easy to OPEN and read the bytes myself, stacking them away under program control after examining them. But if you wish to use LOAD, go ahead. . . just remember that the SETLFS secondary address is really not a secondary address at all. One other related subject, to do with relative files. If you want to position to a particular record in a file, you must use the secondary address of that file in the "P" command. Again, I recommend that you use an added 96 as part of the value. Thus, if you have coded:

OPEN 15,8,15 OPEN 1 ,2,3, "O:RELDATA,L, + CHR$(75) •

. . .opening a file, then to position to record number five, I'd suggest:

(Cont'd from page 43)

8·

. =

SL M2 into R2 R2 0000 0011 M2 CMP R2-M1 (carry clear) SL R1 0000 1000 R1

0000 0000

Now we can stop, because all eight bits of M2 have been processed. Here is how this process looks in assembler. To compare R2 and M1, a subtract is used. The result of this subtract is saved in registers X and Y, so that the subtract does not have to be repeated, thus saving a few cycles. DLOOP

EQU • ASL M2 + 1 ROL M2 ROL M2 + 1 ROL R2 SEC LOA R2+1 SBC M1 + 1 ;save low byte TAX LOA R2 SBC M1 ;save high byte TAY BCC SKIPSAVE ;store saved bytes STX R2+1 STY R2 ;in R2 SKIPSAVE EQU • ;shift carry from ROL R1 + 1 ;subtract into R1 ROL R1 LOA M2+ 1 BNE DLOOP LOA M2 BNE DLOOP RTS HEX 0005 M1 HEX 002B M2 HEX 0000 R1 HEX 0000 R2

PRINT#15, "P" +CHR$(99) + CHR$(5) +CHR$(0) +CHR$(1) Conclusion The secondary address for the file is three, as shown in the OPEN 1,2,3.

. . statement. But I'd suggest that your position command add 96 as shown to specify a secondary address of 99.

To make these routines even faster, use zero page memory for all the fields. They will also take less memory this way.

Do you need to carefully do all this, every time? I honestly don't

Where will these routines come in handy? Well, for starters, here

know for sure. Sometimes everything seems to work when you

are some ideas.

don't worry about the extra bits. But when you carefully trace Basic code (especially the 4.0 and 7.0 versions), you see that Commodore always puts these extra values in. Maybe they know something.

- Graphics programs,

for calculating the position of a dot, plotting a line, or drawing a circle, or drawing a ci rcle - Compilers, for calculating memory needed for arrays, or for .

finding a specific element in an array. Also good for fast integer

•

And with the wide variety...of disk drives and programs, you can never be sure when you might come up with a combination that

multiplyIdivides.

- Calculating prime numbers.

needs those extra bits to be exactly right. I don't know about '

you. . . but my data files are too important for unnecessary chances.

to take any

There are many places where multiplies or divides are used,

and

anywhere one is used, one of these routines can make your code from a few times to hundreds of times faster.

The Tranaaetor

July 1917: Volume I, luue 01

•

Interfacing and Controlling the tron Robot

J.J. Barbarello Englishtown, NJ

. . . the original Armatron from Radio Shack was both agony and ecstacy. .

For those of us interested in experimenting with robotics, the

with seven low current relays. These relays are activated by

original Armatron from Radio Shack was both agony and

seven transistors which are in turn controlled by seven of the

ecstacy. Still available, armatron s i a low cost, fully functioning

eight available C-64 user port lines. Low current relays insure that the 100 milliamp maximum allowable current drain from

robot arm with six degrees of freedom (meaning there are six

different portions of the arm whose

movement

can be con

the user port is not exceeded.

trolled). For robotics experimentation its serious shortcomings

Figure 1: Schematic Diagram

include the inability to lift anything of measurable weight and its totally mechanical controls. While many different articles ap peared describing modifications to allow computer linkup of Armatron, all (including one I did) required a substantial amount

WIR�� n.CM CONTU>LLE� 1'\0DVLE

SO.L

of mechanical skill.

These problems have been overcome in a newer version called

0 BL,..C..\l..

Mobile Armatron. This under $40.00 robot has enough power to lift items in the one pound range while retaining six degrees of

i electrically controlled As its name freedom. Best of all, it s

implies the robot can move on its two wheels. On the negative

side, the elbow joint is not controllable (but you can manually move it).

R.'2.

If the thought of experimenting with a computer controlled robotics device s i appealing, this project s i for you. The project

consists of a simple interface and a comprehensive control program for the C-64. Including the cost of the robot, the total

�4

0 PINK. �-- - -

project cost should be around $60.00.

Q!)

The Interface

Mobile Armatron has a control module that is simply a series of switches. It can select one of four directions (forward, back, left

�b ..

and right), arm up, arm down, wrist up, wrist down, wrist turn

and fingers open/clamp. The robot is powered by four D size

batteries that provide plus and minus three volts for the internal motors. By changing the polarity of voltage applied, alternating functions (such as

arm

: - -� I ,- - -� r:- -�

r: : �

I I

0 'I'E"LLCW &RE.EN 0 B.U.l€"

up and arm down) are obtained. The

control module can actuate the left wheel, the right wheel, the arm movement, the wrist movement, and the wrist turn/fingers.

Construction

Its seven control lines include one for each of the five motions

just mentioned plus one each for positive and negative voltage.

Begin construction by fabricating a doubled sided printed circuit

As shown in the schematic diagram of Figure I , the interface is a

prefer, you can fabricate a single sided PCB by eliminating the

board (PCB) using the circuit patterns shown in Figure 2. U you

straightforward design that replaces the control module switches

top circuit pattern. In this instance, you will have to connect a

Jliy 1917: Volume I, I111M 01

•

Location of wires on Controller PC Board

jumper wire between hole A and connector pin 2 ( + 5 volts). While this method does not provide as much rigidity (only half as many connector pins soldered to the PCB), it is somewhat less intimidating. If you opt for the double sided PCB, be sure to insert a short length of wire into hole A and solder it to the pads on either side of the PCB. This replaces the wire jumper used on the single sided version .

•

C-(.-4 MO� H... i: A�AnvN !>o.,..,.0 . ""

co a>

00 00 00

:t�T��Fta.C.E"

�� -.) 0 � '"

�l.

� � �

•

�'

\(.�

�4

�i'

�-

IC..1

Q 1

Figure 2: PC Layout

Mount the components on the PCB as shown in Figure 3, being sure not to apply excessive heat during the soldering process. When all components have been soldered in place, slide the connector onto the edge of the board so the pins are over the edgeboard pads. Solder each pad to its associated connector pin. Place the controller module face down and remove the six screws holding it together. Remove the rear case half and note the PCB held in place by a single screw. Remove that screw and the PCB. Turn the PCB over (circuit side) and note the seven wires soldered to the upper edge. Starting from the left they are black, brown, red, pink, yellow, green and blue. Unsolder the wires from the PCB and discard the controller module. Solder these wires to the seven remaining holes as shown in Figure 3. This completes construction.

The Tranaac:tor

• Double Sided: Wire through hole soldered to pads on both sides. Single Sided: Wire jumper soldered to pad on other side and Pin 2 (see dotted line). Figure 3: Component Placement Use

Install four D size batteries in the Mobile Armatron. Connect the interface to the user port (rear left of the C-64) such that the component side of the PCB is on top. Power up your C-64 and, if you haven't already, type in the program shown in the Program

July 1987: Volume 8, ,,_ 01

Listing and save it using the name ROBOT. When you RUN the program the main menu will appear with the five options Learn, Do, Save, Retrieve and Quit (End). To better understand what these options do and how the program operates, Jet's discuss each of them separately.

Learn allows you to "teach" the robot to perform a series of functions in a specific manner. Together these functions form a procedure. Once created, the procedure can be saved, retrieved, added to and executed at any time. Select Learn by pressing Fl. The Learn screen defines the keys to select the twelve possible movement functions. To perform one of the functions described, press the associated key. To end movement, press any key. The program remembers each function selected and the length of time the function s i performed. To end the teaching session, press the F l key to return to the main menu.

Do executes a procedure resident in memory. Select Do by pressing F3. If a procedure is resident in memory, you will be asked to press any key to begin execution. Otherwise, you will be informed that there is no procedure in memory and asked to press any key to return to the main menu.

Save allows you to copy a procedure in memory to a disk file using a name that you specify. Select Save by pressing F5. If i no procedure in memory, you are so informed and asked there s to press any key to return to the main menu. If you specify the name of a file that already exists, you are asked if you want to continue. Continuing erases the existing disk file and replaces it with the current memory contents.

Retrieve copies the contents of a disk me into memory, erasing any procedure in memory at the time. Select Retrieve by pressing F7. If you specify the name of a file that doesn't exist, you will be so informed and asked to press any key to return to the main menu. If memory already contains a procedure you will be so advised and asked if you want to continue. Continuing erases the current memory contents and replaces it with the

Each procedure step is saved as a movement function number and a time count. The movement function s i specified by a number between one and twelve (corresponding to the twelve function definitions listed on the Learn screen). The time count is a number that indicates how long the function should be performed. As the robot's batteries drain, the time count may produce slightly different results, since the robot will now move at a slower speed. For precise procedures, then, always use a fresh set of batteries.

List Of Materials RI-R7

:10,000 ohm, 114 watt fixed resistor (such as Radio Shack PIN 271-1 335). Q J-Q7 :2N2222A NPN Silicon Transistor (such as Radio Shack PIN 276-2009). Kl-K7 :5 volt, 250 ohm coil reed relay with I amp SPST

SO I

PCB

(22 position connector) can be used as an alternate by cutting it to a 12 position length. :Printed Circuit Board (see text).

ROBOT :Mobile Armatron (Radio Shack P/N 60-2396). MISCELLANEOUS: Solder, short length of wire (see text), four D cell batteries.

NOTE: A disk containing the ROBOT program plus a series of demonstration procedures is available for $6.00 US ($6.36 for New Jersey residents) from B&BTC, RD,. I , Box 241 H, Tennent Road, Manalapan, NJ, 07726. Mobile Annatron Program

NL IC CA GK OJ Jl OM IF

procedure saved on disk.

Quit s i selected by pressing both the CTRL and Q keys. This ends the program, insures all files are closed and prints a message "To re-enter, type GOTO 50". If you end prematurely without saving a procedure in memory, executing a GOTO 50

allows you to re-enter the program with memory intact. You can then save memory contents to a disk file.

1 rem • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • •• 2 rem • • mobile armatron software •• 3 rem • • name: robot •• 4 rem . . (c) 1986, jjb •• 5 rem • • manalapan, nj 07726 .. 6 rem • • v 860928 7 rem • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • 10 dim a(12), b(250, 1 ):gosub 3000 :gosub 5000:poke 56579,255:poke 56577,0 20 a(1 ) 38:a(2) 70:a(3) 36:a(4) 34 :a(5) 33:a(6) 65 30 a(?) = 40:a(8) = 72:a(9) = 48:a(1 0) 80 :a(1 1 ) 66:a(1 2) 68 40 ss$ • 1234567890 + - • :rc$ chr$(5) + chr$(1 8) 50 gosub 3000:ro 6:co 1 O:gosub 5050 : printrc$; • m a i n m e n u • 60 print:printtab(12); • < f 1 >: learn " :print :printtab(12); • < f3 >: do· 70 print:printtab(12); • < f5 >: save· :print :printtab(12); • < f7 >: retrieve · 80 print:printtab{1 0); • <ctrl> q: quit (end) 90 ro 1 9:co 1 O:gosub 5050:print " which. . . • • • then 100 1 00 get sr$:if sr$ 1 1 0 sr asc(sr$)-1 32:if sr = - 1 1 5 then sr =5 120 if sr<1 or sr>5 then 90 130 on sr gosub 200,300,400,600,800 =

Experimenting Tips

Each movement you specify is called a step. After loading a procedure from disk, you can add steps to it in the Learn mode. This allows you to build a procedure a part at a time, add to it, test it, and save the revised procedure if it proves acceptable. You can also have standard procedures on file rather than having to build them manually each time.

CJ IJ

DA KL OM HJ NO IM AM

You should always start a procedure with the robot in the same initial position. To do this, save any procedure in memory and enter the Learn mode. Perform the functions necessary to get the robot to the initial position. Then retrieve the procedure you wish to perform. The Tramactor

contacts (Radio Shack PIN 272-232). :Standard user port 12 position female connector with 0.156" spacing. NOTE- Radio Shack PIN 276-1551

....

Juty 1917: VolunM a, lnue 01

NP KL GC KA

PM NJ DD 8N KN LA GA PG MD GE PK CG PG HM MF JA JL PN CK FA OD

•

EJ Jl FO CG A8 JC MC AF LA PD AD OM LO EC 18 FL

MA JF BM GG BK

IM DB CO IG

140 goto 50 200 gosub 1 OOO:j = b(O,O):x = O:rem.. • learn mode • • • 210 geta$:ifa$= • • then 210 220 if asc(a$) = 133 then return 230 gosub 2000:if i 0 then poke 56577,0 :goto 210 240 poke 56577,a(i) 250 get a$:if a$= • • then x = x + 1 :goto 250 260 poke 56577,0 270 j = j + 1 :b(j,O) = i:b(j, 1) = x:x = O:b(O,O) = j 280 ro = i + 1 O:co = 5:gosub 5050 :print mid$(ss$,i,1 ); :goto 210 300 rem.. do procedure 310 printchr$(1 47):printbl$:print • [13 spcs]do procedure · :printbl$:print 320 if b(O,O) = 0 then print · no procedure in memory. · :goto 375 330 print · press any key to begin procedure. • 340 get a$: fi a$= • • then 340 350 print· procedure execution in progress · 355 for i = 1 to b(O,O):poke 56577,a(b(i,O)) 360for j = 1 tob(i,1) 365 get a$:if a$= . . then x = x + 1 :next j 370 poke 56577,O:for j = 1 to 500:next j:next i :print· procedure done. • 375 ro= 18:co = 0:gosub5050:print · press any key to return to the menu. • 380 get a$:if a$= • • then 380 390 return 400 rem .. save procedure 410 printchr$(147):printbl$:print • [13 spcs]save procedure · :printbl$:print 420 if b(O,O) = 0 then print · no procedure in memory. · :goto 480 430 input · enter file name to save · ;f$ 440 open 1 ,8,1 5:open 2,8,2, • @0: • + f$ + • ,s,r • :inputlf1 ,e,ed$,tn,bl:close 1 :close 2 450 if e = 62 then 500 460 print· file exists. continue (y/n). . . ; :gosub 1 500 470 if a$= • y • then 500 480 print· abort. press any key . . • 490 get a$:if a$= • • then 490 495 return 500 open 2,8,2, • @0: • + f$ + • ,s,w · :print :print· saving procedure. wait. · 510 for i = 0 to b(O,O):printlf2,b(i,O):printlf2,b(i, 1) :next i:close 2:close 1 5 520 print: print· procedure saved. press any key. · :goto 490 600 rem .. retrieve procedure 610 printchr$(147):printbl$:print • [ 1 1 spcs]retrieve procedure · :printbl$:print 620 if b(O,O) = 0 then 650 630 print · procedure in memory. continue (y/n)? • ; :gosub 1 500 640 if a$= • n • then print · abort. • ;:goto 700 650 input· enter file name to retrieve· ;f$ 660 open 1 ,8,1 5:open 2,8,2, • @0: • + f$ + • ,s,r • :input#1 ,e,ed$,tn,bl:close 1 :close 2 670 if e = 0 then 720 680 if e "" 62 then print · file doesn't exist. · ;

The Transactor

JO PG C8 8B AI GL CM IC HK MH AH OC HM CF

690 print· press any key. • ' 700 get a$:if a$ ... • • then 700 7 1 0 return 720 print· retrieving procedure. wait. • :open 2,8,2, • @0: • + f$ + • ,s,r • 730 inputlf2,b(O,O):inputlf2,b(0,1) 740 for i = 1 to b(O,O):input#2,b(i,O):input#2,b(i,1) :next:close 2 750 print · retrieval complete. • ;:goto 690 800 rem.. end 810 ro = 5:co 1 O:gosub 5050:for q - 1 to 1 6 :print tab(1 O);b$:next 820 ro = 1 O:co = O:gosub 5050:close1 :close2 830 print· program ended. to re-enter, type goto 50 • ; 840 print:end 1000 rem .. learn mode screen 1005 printch r$(147):printbl$ 1006 print· [3 spes]mobile armatron robot learn mode[3 spes] · : printbl$:print 1007 print· [4 spcs]press key to do function. press any other key to stop. · ; 1 008 print · press <f1 > to return to menu. · :print 1009 print · (4 spcs]key function · :print · [4 spes] • 1010 printtab(S); " 1 forward· :printtab(5); • 2 "" backward • 1020 printtab(5); • 3 ... right forward turn· :printtab(5); • 4 = left forward turn· 1030 printtab{5); • 5 = arm up· :printtab{5); • 6 arm down· 1 040 printtab(5); • 7 = wrist up • :printtab(5); • 8 = wrist down • hand turn · 1 050 printtab(5); • 9 :printtab(5); • 0 = fingers move in/out • 1 060 printtab(5); " + = right reverse turn· = left reverse turn • 1070 printtab(5); 1080 return 1 500 get a$: if a$= • • then 1500 1 5 1 0 a$= chr$(asc(a$) and 223) 1520 if a$<> • y • and a$<> • n • then 1 500 1530 print a$: return 2000 remu position in string 2010 for i = 1 to 12:if a$= mid$(ss$,i, 1) then 2030 2020 next:i =O:return 2030 ro = i + 1 0:co = 5:gosub 5050:printrc$;a$:return 3000 rem .. format screen= 3010 poke 53280,6:poke 53281 ,6:printchr$(147) :b$ = chr$(5) + chr$(1 8) 3020 bl$ = b$ + • [39 spes] · :print bl$ 3030 print b$; • mobile armatron robot controller • 3040 printbl$ 3050 b$ = • [29 spes] · 3060 return 5000 rem• cursor control using plot kernel ($fff0) 501 0 data 162,0,1 60,0,24,32,240,255,96,999 5020 a = 49300:sc = a 5030 read b:if b<>999 then poke a,b:a = a + 1 :goto 5030 5040 return 5050 poke sc+3,col:poke sc+ 1 ,row:sys sc 5060 return =

---

MM IL MH

-----------·�------

FD AH OH FP EF HP ID FC FN CE DN CL HB 18 KN

MM DB MC lA A8 OP NO FK HI MM NK AO 49

·-

July 1917: Volume I, luue 01

John A. Spencer Edwardsville, IL

Symlister A List Fot·matter for SyntaSs -

. . . Symlister will automatically detect spelling effors in opcodes. . •

Symass is a first class assembler for the C-64 but one feature s i noticeably absent. You cannot indent the opcodes to make the labels more easily identified. This is not the "fault" of Symass but rather stems from the fact that the normal Basic operating system is used to manipulate the program. When a line is crunched, the spaces between the line number and what follows are always removed. On listing, a single space is uniformly inserted after each line number to make the program more "readable". But when working with assembly code it is very helpful to have the labels separated to the left of the opcodes. The lack of this formatting can lead, at the least, to eye strain or even worse, to inadvertent duplication of labels. Symlister solves this problem. This short utility routine, when assembled with Symass 3.13 and enabled, will tidy up your code by automatically indenting each line that begins with a 6510 mnemonic. Because Symlister uses the IQPLOP vector ($306), it also works with listings to a printer in the CMD mode. With Symlister active, enter your assembly code as usual. You need not indent on lines starting with opcodes. When the program is listed, they will be indented. When editing, it is most sensible to align the opcodes appearing after the labels since the indents are fixed for the other lines. Since Symlister affects only the listing of a program, it does not change the amount of disk space required to store the PRG file. To conserve programming space, this utility has been designed to hide in the tape buffer. It can be assembled below Symass in memory but when calculating a new starting address, be sure to include an extra 180 bytes or so to allow for the Sy mass symbol table required during its assembly. Add the following lines to protect the formatter from being overwritten by new Symass symbol tables after it is enabled:

1401 Ida #<vecset : protect code 1402 sta $37 : from symass 1 403 Ida #>vecset 1 404 sta $38 ; reset memory pointers 1405 jsr $a65e

The Transactor

Of course, new enable and disable SYS addresses will have to be calculated for alternate locations. For example, f i you load Symass first, it will reside at $952C and Symlister will assemble properly with a starting address of $9400. Then to enable, SYS3788S, and disable, SY$37891 (enable+3) This routine automatically adjusts for variations in the load address of Symass. If you install another utility (eg. C-64 Tiny Aid) before Symass the starting address changes. This adjust ment s i important because the routine calls two procedures within Symass itself- WORD and FINDOP. A very useful result of this is that Symlister will automatically detect spelling errors in opcodes by not indenting them when you re-list the line. This does not apply to opcodes on lines with labels. The program is written to automatically vector to whatever was originally in IQPLOP, so if you are using a cartridge that alters this vector it should continue to work normally. However, be careful to disable Symlister with the appropriate SYS before disabling your other utility. As presented here, Symlister indents eight spaces. This figure works very well with Unassembler files generated from the STP program that converts the SEQ disk files to Symass compatible PRG form. If you favor a different spacing, change the "SPACES" variable before assembling. H Symlister is already active, you can change the spacing by a POKE to location 917 with the desired value. This program is compatible with Tiny Aid to make it easy to revise the 'ADxxxx' labels from Unassembler. But note that Tiny Aid uses its own display routine so it will not indent the results of FIND or CHANGE operations. Once changes are made, re-list the lines in question to see them formatted. This version of Symlister is not compatible with Verifizer since they both use the tape buffer. Assembly at $COOO (change line 1 1 60 to • = SCOOO) would be a simple alternative provided you are careful to disable it before Symass does any assembling into this region. In this case enable is SYS49 152 and disable SY$49155.

July 1987: Volume 8, Issue 01

' '''

•

Symlister Source Code In Symass Format

Gl OH CJ AM ..

CD CK PE KP ME KM DO EG 10

•

PE BM lA KK EL NA GF HD DG FM KJ EJ MG NG MO Kl AB MP JN DG AG BK FO KD KG KN FL LK KB DC KJ IF ' DE

FA HF JC GJ

1 000 rem save" O:symlister • ,8 1 0 1 0 rem • 21 feb 87 - j.a.spencer 1 020 rem • indents all lines starting 1 030 rem • with 651 0 opcodes 1 040 rem • symass must be installed 1 050 : 1 060 if peek(700) = 76 then 1 1 20 1070 : 1080 print • • symass not installed • • • 1 090'print " load/run symass first · 1 100 end 1 1 10 : 1 1 20 print sys 828 to enable · 1130 print • sys 831 to restore previous list vector · 1 1 40 : 1 1 50 sys700 1 160 • =$033c 1 1 70 ; ;# spaces to indent 1 1 80 spaces = $08 ;code address 1 1 90 srcad $51 1200 ad = $7a ;chrgot & symass $0306 ;std list jmp vee 1 2 1 0 iqplop 1 220 symptr $02bd ;symass vector $a71a ;normal list code 1230 reglst $ab47 ;print char 1240 outdo $0000 ;dummy value 1250 findop 1260 word $0000 1 270 ; 1280 ;enable jmp vecset 1290 ;disable jmp lisdis 1300 ; 1 3 1 0 ;alter the list vector (iqplop) 1320 vecset = • Ida iqplop ;pick up 1330 1 340 ;current sta rgl + 1 1 350 Ida iqplop+ 1 ;'list' sta rgl + 2 ;vector 1 360 ;install new 1370 Ida #<lvec sta iqplop ·'list' 1380 Ida #>lvec ;vector 1390 sta iqplop + 1 1400 Ida symptr ;calc addr of 1410 clc ; 'findop' 1 420 adc #$9d 1430 ;routine sta opfd + 1 1440 Ida symptr + 1 ;& insert tn 1450 adc #$03 ;code below 1460 sta opfd + 2 1470 clc 1480 ;calc addr of Ida symptr 1490 adc #$fa ;'word' 1 500 sta wrd + 1 ;routine 1510 Ida symptr + 1 ;in symass 1 520

The Transactor

DC LE KP 01

AG El JE GL PI KM KH ON OM PM MP GC MF KB

•

Nl 10

DB ME PA DB LK LH OH BH PE MJ HD

CM HM MO FP LN JJ JM LL AI EB CH EL

•

OG GN MD AN EG EN

1 530 adc #$05 sta wrd + 2 1 540 1 550 rts 1 560 ; 1 570 ;new routine for listing 1 580 lvec cpy #$04 ;check only beq opsrch 1 590 ;1 st word 1600 ; 1610 reg Ida (srcad),y ;on line 1620; 1630 rgl jmp reglst 1640 ; 1 650 opsrch sty $49 1 660 )Sf calcad 1 670 ; ;get len of JSr word 1680 wrd 1690 jsr calcad ;word ($59) 1 700 ; 1 7 1 0 opfd jsr findop ;not mnemonic 1 720 bee jreg 1 730 ; ldx #spaces 1 740 1 750 ; ;insert spaces 1 760 con2 Ida #$20 1770 )Sf outdo dex 1 780 1 790 bne con2 1800 ; ;restore y reg ldy $49 1810 1reg 1820 bne reg 1830 ; 1840 ;subrouttne to set up search 1850 ;address 'ad' in symass • 1 860 calcad = ;add .y to 1870 Ida $49 ;current 1880 clc adc srcad ;addr 1890 1900 sta ad 1910 Ida #$00 adc srcad + 1 1920 1930 sta ad + 1 1 940 rts 1950 ; 1960 ;sys to disable list formatter • 1970 lisdis Ida rgl + 1 ; restore last 1980 ;vector sta iqplop 1 990 2000 Ida rgl +2 2010 sta iqplop + 1 2020 rts 2030 ; 2040 .end -

July 1987: Volume 8, Issue 01

XREF for the Commodore 64

David Archibald I Flint, Michigan I

An indispensible BASIC programming aid •

When I'm writing a BASIC program, I find that there are certain

XREF@ var-# <cr> XREF•@ var-# <cr>

programming aids that I use over and over again. The fact is, these programs save me so much time and aggravation that I would find

myself hard pressed to get along without them. These commands list

all references from the variable or line

One of these indispensable programs is my variable and line

number onwards. If, for example, you entered the variable "CB$",

number cross reference program, XREF. What is does, for those

then the variable CBS (if it exists) and those alphabetically greater

who are unfamiliar with this type of program , is create a listing of I )

will be listed. You can also use these commands to separately list

program lines that are referenced by other program lines, and 2) all

either the line number or the variable cross reference. In other

variables have been used, and on what program lines they appear.

words, when you enter a line number, then only line number cross references are listed, and the same goes for the variables. Using zero

Learning to use Xref is quite simple, since there are only two

will display all line number cross references, and "A" will display all

commands: XREF, and HELP. There are also, only two items of

variables.

syntax: @ and •. Altogether, there are seven different combinations of these commands and syntax, but I'm sure you won't have any

XREF var-# <cr>

XREF• var-# <cr>

problem remembering them. With this command, only the single variable or line number that use

But before we get into the explanations of these commands, let's get

you enter is cross referenced. I like to make

the basics of running Xref out of the way. All of the commands listed

before using a new variable, so I can make sure it hasn't already

here must be at the beginning of the command line. If they are not,

been used.

you will get a SYNTAX ERROR. These commands will work only in

of this command

XREF <cr>

direct mode; they will not work from within a Basic program. All spaces in the command line will be ignored. The output, which can

Each time the command XREF is entered, it will consecutively list a

be sent to the screen or your printer, is listed in numerical or

Basic line where the previous "var-..." appears. Lets say for example

alphabetical order. For this program to

you enter the command "XREF C$", and you get a listing saying CS

do anything, you must of

course have a Basic program in memory. To pause the listing, press

appears on these line numbers: I 0,30,1 00, and

and hold down the "P" key, until the listing stops. You can restart

enter the command XREF, Iine I0 will be listed. If you enter it again,

the listing by pressing any key Gust close your eyes, and hit any key

then line 30 will be listed. Each time the command XREF is entered,

that catchs your fancy). You can abort the listing, by pressing RUN/

the next Basic line where C$ appears is listed. After the last line is

STOP.

listed (in this case

165.

If you then

165), subsequent XREF commands will give you

the message "END OF TEXT". And now that you have committed all that to memory, we can start on the commands.

This command is especially handy for editing. Say for example you have ten Basic lines that reference a subroutine at line 1500, and

In the following commands, "var-..... can equal any variable name,

you need to change six of them to call a new subroutine at line

or line number up to five characters long. Anything over this five

2000. Well, you can either try to remember the six line numbers,

character limit is ignored. The symbol <cr> represents pressing the

and then list them one at a time, or you can simply enter the

Return key.

command XREF

XREF @ <cr>

1500, and then follow it with XREF until the six

lines pop up. I think I prefer second method, thank you!

HELP <cr>

This command sends a complete line number and variable cross reference to your screen.

This is the last command, and the most important. Why is it the

XREF• @ <cr>

most important? Because if you forget everything you have just read, you can enter this command, and get an abbreviated descrip

This is the same as the above command, except the output is sent to

tion of these instructions. So if you only remember one command,

the printer.

make it this one.

The Transactor

July 1987: Volume 8, Issue 01

Technical Notes

XREF 64: BASIC Loader •

in machine language, but since It's loaded with a Basic loader, you do not need to know anything about machine language to use it. Before the Basic loader pokes Xref mto memory, it gets the address of the top of Basic memory from locations 55 and 56. It then subtracts 214 (the number of bytes used by XreQ from this address, and Pokes Xref into memory starting from there. What this all means s i that Xref is a relocatable program. If for example you already have a machine language program at the top of Basic memory, then the Basic loader will relocate Xref below this other program.

30 rem..

LF CX)

•• 40 rem.. (313) 736-0239 SO renn•••••••••••••••••••••••••••••••••

60 rem

70 rem

90 pnnt • [CLR] • pnnt:pnnt:pnnt:pnnt:pnnt:pnnt:print

JF BN

100 pnntspc(8) • (RVS)poking xref 1nto memory. · :pnnt 1 1 0 pnntspc(6) · please watt approx. two m1n. •

120 rem

130 rem-- save border color.

140 rem

150m1 · 53280.11• 1 5:p4 • 1

160bc•peek(m1)

170 rem

IC NE

180 rem-- get top of free memory and 190 rem-- where to put start of prog.

200rem

••

OG 80rem

•

10 rem••••••••••••••••••••••••••••••••• •• 20 remo o xref

Xref is written completely

IMPORTANT NOTE! Be sure you save the Basic loader before you

run it, because it executes a NEW command after it pokes Xref into memory. Are you wondering how Xref manages to use only 214 bytes of memory? Well, it actually uses over 2000 bytes of memory. So where's the rest? It's hidden under the Basic ROM.

210 ea- peek(55) + peek(56)• 256-1 :sa .. ea-21 4 :exe=sa

This is made possible because of the Commodore 64's unique memory architecture What makes it unique is that underneath the ROM for the Basic interpreter and the Kernal is a whole bunch of unused RAM. You can write to this RAM from Basic, but to read it, you really have to use machine language. To read this RAM, you first have to "switch out" the BasiC mterpreter's ROM. And of course when you switch out the BasiC mterpreter - which s i after all, just a machine language program - it no longer exists in memory, so it is not there to read any memory locations!

220 rem

230 rem-- check tf start of xref ts

240 rem-- lower then end of bas1c prog.

250 rem

270 1f bm>sa then print.pnnt · there isn't enough free

00 ' 260 bm = peek(45) + peek(46)•256 + 100 memory ' .end GO

i WhiCh memory the computer "sees" - the ROM or the RAM - s controlled by the value in zero page memory location one. If bits zero and one in this byte equal zero, then the computer sees RAM at add resses 40960-4915 I (SAOOO-SBFFF), and 57344-65535 (SEOOO-SFFFF). If these bits equal one, then the computer sees ROM at these addresses.

290 rem-- convert start of xref 1nto

300 rem- spht dec1mal.

310rem

320 th • mt(sa/256).tl • sa-th•256

330 for pa =sa to ea

340 read by:tst .. by-tnt(by)

350rem

360 rem-- randomly change border color.

Xref uses this switching act between RAM and ROM to its advan tage, and by doing so saves Basic programming memory. The majority of the Xref program, doesn't care if the Basic interpreter is switched in or out so most of it is hidden under the ROM. The 214 bytes that are in the Basic programming memory consist mainly of subroutines that switch the ROM back in, and then call other subroutines in the Kernal. When the Kernal subroutine is finished. the Xref subroutine switches the ROM back out, then returns to the part of the main program that called it.

280rem

370 rem 380 em =cm+p4

ifcm •20 then p1 •rnd(1)•1t+p4

:pokem1 ,p1 :em • 0 EK

390 rem

400 rem-- if byte followed by .1 then

410 rem-- lower byte of absolute addr.

MA LB

420 rem-- add lower byte of start to it 430 rem-- so 11 points to relocated addr

440rem

450 1f tst>O and tst<.2 then carry - O:by =by+ II

460rem

470 rem-- 1f lower byte IS greater than

Ooce Xref s i in memory, you don't have to worry that pressing RUN/STOP and RESTORE will kill it, because only turning your computer off will do that.

480 rem-- 255 then a carry IS generated

490 rem-- so add 1 to h1gh byte.

500 rem

If you'd rather

510 tf by>255.5 then by• by-256:carry= 1

520rem

530 rem-- tf byte followed by .2 then

540 rem-- h1gh byte of absolute add 550 rem

not type in the program, you can get this issue's Transactor disk, or send $3, a formatted diskette, and a self addressed, stamped mailer to:

David Archibald 3717 Aldon Lane Flint. Ml 48506 The Transactor

I HB 53

560 1f tst>. 19 then by• by+ th + carry:carry -0 570 poke pa,by

Jllly 1917: Volume .. ...... 01

MD MG GH NM MO EK

PC GO IK GA AB JJ LB

PI ID CE

CP AN FJ CL PM OF KM OP JK MF EH AN EH OM OA CE IC FD IL KA AH MD EG PI 1 KF EJ

JP IH DO EE IH NL lA MA DG KL FB HE

MM BC HN

580 next pa 590 rem 600rem 610 rem-- starling addr ($a000) & endtng 620 rem-- addr ($a71 e) of matn program 630 rem-- under basic's rom. 640 rem 650 If a .. 0 then a • 1 :sa= 40960·ea = 42781 :goto 330 660 pokem1,bc 670 sys exe: new 1000 rem 1010 rem 1 020 rem- relocatable section of the 1030'rem- program ts not poked under 1040 rem-- basic's rom. 1050 rem 1060 rem

CL NA BP HO LH EP

1070 data 32,31 1 , 0.2, 76, 234, 166, 70, 1080 data 0, 80, 76, 69, 160, 0, 132, 1090 data 122, 164, 32, 166, 33, 201, 58, 1 1 00 data 76, 128, 0, 96, 120. 165, 1, 1 1 1 0 data 208, 5, 88, 165, 1, 9. 1. 1120 data 96, 72. 32. 38. 1 , 0.2, 104, 32, 1130 data 76, 31 1 , 0.2, 32, 38. 1, 0.2, 169, 1 1 40 data 195, 255, 32, 204, 255, 108, 2, 1 1 50 data 38.1, 0.2, 76, 167, 166, 32, 38. 1 , 1 1 60 data 228, 255, 72, 32, 3 1 . 1 , 2, 104, 1 1 70 data 32. 134, 33, 166, 157, 16, 178, 1180 data 208, 174, 201, 88, 240, 10, 160, 1190 data 9.1, 201, 72, 240, 6, 208, 160, 1200 data 162, 6.1, 142,126 1, .2, 32, 1 1 5, 1210 data 6.1, 2, 208, 139, 136, 16, 245, 1220 data .2, 201, 6.1, 240, 6, 32, 31.1, 1230 data 14, 161, 169, 163, 133, 26, 32, 1240 data 201, 0, 208, 6, 32, 31.1, .2, 1250 data 161, 72, 169. 4. 32, 195, 255, 1260 data 3, 160, 36. 201, 42, 208, 7, 1270 data 0, 162, 4, 160, 76, 140, 166. 1280 data 169, 4, 160, 255, 32, 186, 255, 1290 data 32, 189, 255, 32, 192, 255, 162, 1300 data 201, 255, 32, 31. 1. 0.2. 76, o, 1 3 1 0 rem 1320 rem -- start of matn program 1330 rem -- under basic rom 1340 rem

OM AL PN GK CD MK OL BH AA HO FB DA CE

69 82 122, 177 176, 3 41, 254 133, 1 210. 255 4, 32 3, 32 0.2, 32 96, 132 166, 122 3, 162 160, 2 0, 217 173, 126.1 .2, 76 o 115, 76, 40 104, 162 32, 1 1 5 162, 72 169, 0 4, 32 160

1350 data 166, 43, 232,232, 228, 45,208, 9, 166 1360 data 44, 228, 46,208, 3. 76, 20, 167, 32 1370 data 95, 163, 104, 160, 0, 132, 75, 230, 76 1380 data 201, 64, 208, 1 1 . 230, 75, 132, 76, 32 1390 data 1 1 5, 0,201, 0,240, 1 1 , 153, 197, 163 1400 data 153, 203, 163, 200, 192. 5, 208, 238, 140 1410 data 196, 163, 140, 202, 163, 152. 240, 6, 169 1420 data 0, 133. 75, 240, 1 1 , 162, 1 1 , 189, 9 1430 data 164, 157, 196, 163, 202, 16, 247, 166, 43 0 1440 data202, 134, 32, 165, 44, 133, 33, 169, 1450 data 1 4 1 , 91 161, 230, 30,133 2 , 1 4 1 , 193 1460 data 162, 169, 29, 133,251, 169, 167, 133, 252 1470 data 173, 197, 163,201, 58, 176, 8, 238, 91 1480 data 161, 169, o. 1 4 1 , 187, 160, 32, 4, 162 1490 data 166, 2. 240, 3, 76, 71, 162, 162, 0 6, 201 1500 data 201, 143, 240, 10, 201, 131, 240, 1510 data 34, 208, 18, 162, 34, 142, 160, 160, 32

GL OH NK FF

GM GH AJ

KE MK 10

DB PB Ll

CJ 00 KN FA CB ON

NF BH BC GK AI IC PF Kl NC MB PM HB KL ML AI AH HC PH EM IJ

1520 data 4, 162, 201, 0, 240, 223, 201, 0, 208 1530data245, 240, 217, 174, 91 , 1 6 1 , 240, 40,201 1540 data 138, 240, 20, 201. 137, 240. 16. 201. 141 1550 data 240, 12. 201. 167. 240, a. 162 o. 240 1560 data 189, 201, 44, 208, 180, 141, 187, 160, 32 1570 data 4, 162,201, 58, 176, 170,201, 48,144 1580 data 166, 1 76, 8, 201, 65, 144, 165, 201, 91 1590 data 176, 161. 169. 202. 133, 25. 32. 75. 161 1 600 data 240. 37, 166, 76,208,148, 144, 5,141 1610 data 193, 162, 176, 1 4 1 , 169, 196, 133, 25. 32 ' 1620 data 145, 161, 144, 20, 240, 18, 169, 202, 133 1630 data 25, 32, 185, 161, 169, 29, 133,251, 169 I 1640 data 167, 133, 252, 32, 201, 161, 76, 123, 160 0, 185, 21 1650 data 169, 164. 1 4 1 , 23. 161, 160, 1660 data 164, 240, 1 1 , 32, 210, 255, 200, 208, 245 1670 data 238, 23, 161, 208, 240, 76, 20. 167, 32 1680 data 84, 163, 240. 27, 32, a. 163, 240, 14 1690 data 160, 0, 1 77, 253, 133, 20,200, 1 77,253 1700 data 133, 21, 76, 23. 167, 169, 29, 1 33,251 1710 data 169, 167, 133, 252, 76, 0, 163, 165, 32 1720 data 133, 27, 165, 33, 133, 28, 169, 1 , 133 1730 data 29. 32, 4, 162, 162. 0. 208, 24,201 1740 data 91. 176, 32, 201. 65, 176, 24, 201, 36 4, 201, 40, 208 1750 data 240, 8, 201, 37, 240, 1760 data 4, 230, 29, 208, 12, 201, 58, 176, 8 1770 data 201, 48. 144, 4, 230, 29, 208, 213, 165 1780 data 30, 208, 1 1 , 56, 165, 32, 233, 1 . 133 1790 data 32, 176, 2, 198, 33, 173, 91, 1 6 1 , 240 1800 data 5, 32, 1 78, 161, 208, 29, 160, 0, 177 · 181 o data 25. 197. 29, 144, 2. 165, 29, 170. 240 1820 data 10. 177, 27.200, 209, 25, 208, 9, 202 1830 data 208, 246, 160, 0, 165, 29, 209, 25, 96 0, 165, 29, 145, 25, 170, 177. 27 1840 data 160 1850 data 200, 145, 25, 202, 208, 248, 96, 32, 84 1860 data 163. 240, 24, 160, 0, 177, 251, 197, 20 1870 data 208. 16, 200, 177,251, 197, 2 1 , 208, 9 1880 data 200, 169, 1 , 24, 1 1 3, 251, 145,251, 96 1890 data 24, 165,251, 105, 3, 133,251, 165,252 1900 data 105, 0, 133, 252, 160, 0, 165, 20, 145 1910 data 251, 200, 165, 21, 1 45,25 1 , 200, 169, 1 1920 data 145,251, 96, 169, 1, 141, 35,162,165 1930 data 30, 240, 18, 198, 30, 160, 3, 177 32 5 1940 data 133, 20. 200, 177, 32,133, 2 1 , 169, 1950 data 1 4 1 , 35, 1 62, 24, 165, 32, 105, 1 , 133 0 1960 data 32, 165, 33, 105, 0, 133, 33, 160, 1970 data 177, 32, 240, 5, 201, 32, 240, 206, 96 3, 230, 30, 96 200 1980 data 200, 209, 32, 240, 2. 96, 32. 84 1990 data 209, 32, 208, 248, 230, 2000 data 163, 240, 1 16, 32, 230, 1 6 1 , 169, 13, 32 2010 data 17, 167, 174, 202, 163, 160, 1 , 185, 202 2020data 163, 32, 17, 167,200, 202, 208 246, 32 2030data 32, 163, 1 69, 32, 133, 253. 169 167, 1 33 2040data 254, 160, 0, 177, 253, 1 4 1 , 174, 163,200 2050 data 177, 253, 141, 175, 163, 200, 177. 253, 72 2060data 32, 108, 163, 104, 1 4 1 , 174, 163,201 1 2070data240, 18, 238, 168, 162, 169 47 157,176 2080data 163, 232, 169, 0, 1 4 1 , 175, 163, 168, 32 2090 data 120, 163, 169, 32, 157, 176, 163, 232, 238 2100 data 168, 162, 169, 0,201, 0, 176, 10, 169 2110 data 13, 32. 17, 167,160, 1 32, 32, 163 8, 1 63 2120 data 32, 51, 163, 32, 64, 163 32 2130 data 208, 174, 169, 0, 240, 26, 174, 202, 163

July 1917: VoiWM I, lasue 01

AI ML NH BN AG FK AM JK LJ BC KP CE CM FP PO EC

OG 10 DB KE BN EF OH HF LK

co CM PK DB EM GM

â&#x20AC;˘

PM I

iI I I'

DP ON PN IG FO AO IL KA

EE BF LC NH FG FH

HE LG LH BJ OK JK OJ

00 '

PK NP CP OM

co lA

KP KD

2140 data 189, 202, 163, 157, 196, 163, 202, 1 6 , 247 5, 189, 15, 164, 157, 202, 1 63, 202 2150 data 162, 2160 data 16, 247, 76, 79, 160, 165, 75, 240, 22 2170 data 198, 75, 32, 95, 163, 169, 64, 141 , 1 97 2, 76 1 , 141, 196, 163, 162, 2180 data 163, 169, 2190 data 208, 162, 104, 104, 169, 29, 133, 253, 169 2200 data 167, 133, 254, 160, 40, 32, 97, 163, 76 3, 133, 253 2210 data 20, 167, 24, 165. 253, 105, 0, 133, 254, 165, 251, 197 2220 data 165, 254, 105, 4, 165, 252, 197, 254, 96, 138 2230 data 253, 208, 2240 data 72, 169, 32, 32, 17, 167,232, 200, 192 2250 data 1 1 , 208, 245, 142, 168, 162, 104, 170, 96 2260 data 160, 0, 185, 176, 163, 32, 17, 167,200 2270 c!ata 202, 208, 246, 96, 32, 26, 167, 201, 80 6, 32, 26, 167, 1 70, 240,250,201 2280 data 208, 2290 data 3, 208, 13, 76,246, 162, 169, 29, 197 4, 169, 167, 197, 252, 96,160 2300 data 251 , 208, 2310 data 0, 185, 208, 163, 240,248, 32, 17, 167 0, 169, 48 2320data200, 208, 245,160, 10, 162, 2330data 153, 1 75, 163, 136, 208, 248, 142, 153,163 2340 data 56, 173, 174, 163, 249, 186, 163, 72, 173 2350 data 1 75, 163, 249, 187, 163, 144, 12, 141, 175 2360data 163, 104, 14 1, 174, 163, 254, 176,163,176 7, 189, 176, 163 2370 data 228, 104, 224, 0, 208, 4, 232,238, 168, 162, 200 2380 data 201, 48, 240, 0, 0, 48 2390 data 200, 192, 10, 208. 206, 96, 2400 data 48, 48, 48, 48, 48, 48, 48, 48, 48 1 0, 0, 10, 3, 100, 2410 data 16, 39, 232, 2420 data 0, 78, 85, 77, 66, 69, 82, 78, 85 2430 data 77, 66, 69, 82, 13 , 13 , 18, 86, 65 2440 data 82, 47, 78, 85, 77, 32, 45, 32, 65 2450 data 80, 80, 69, 65, 82, 83, 32, 79, 78 2460 data 32, 76, 73, 78, 69, 32, 78, 85, 77 0, 13 2470data 66, 69, 82, 40, 83, 41. 13 , 2480data 13, 18, 69, 78, 68, 32, 79, 70, 32 1 48 0, 2490data 84, 69, 88, 84, 13, 13, 5, 90, 90, 90, 90 2500 data 32, 32, 32, 32, 2510 data 90, 147, 32, 32, 32, 32, 32, 32, 32 2520 data 32, 32, 32, 32, 32, 32, 32, 18, 88 2530 data 82, 69, 70, 54, 52, 32, 72, 69, 76 2540 data 80, 13, 13 , 34, 88, 34, 32, 67, 65 2550 data 78, 32, 69, 81, 85, 65, 76, 32, 65 2560 data 32, 86, 65, 82, 73, 65, 66, 76, 69 2570 data 32, 85, 80, 32, 84, 79, 32, 70, 73 2580 data 86, 69, 13, 76, 69, 84, 84, 69, 82 2590 data 83, 32, 76, 79, 78, 71, 44, 32, 79 2600 data 82, 32, 65, 32, 78, 85, 77, 66, 69 2610 data 82, 32, 66, 69, 84, 87, 69, 69, 78 2620 data 13, 48, 45, 54,. 53, 53. 51, 53, 46 2630 data 13, 13, 18, 34, 88, 82, 69, 70, 64 2640 data 32, 60, 67, 82, 62, 34, 146, 32, 58 2650 data 80, 82, 73, 78, 84, 83, 32, 65, 76 2660 data 76, 32, 82, 69, 70, 69, 82, 69, 78 2670 data 67, 69, 83, 46, 13, 18, 34, 88, 82 2680 data 69, 70, 42, 64, 32, 60, 67, 82, 62 2690 data 34. 146, 32, 58, 80, 82, 73, 78, 84 2700 data 83, 32, 65, 76, 76, 32, 82, 69, 70 2710 data 69, 82, 69, 78, 67, 69, 83, 32, 84 2720 data 79, 13, 89, 79, 85, 82, 32, 80, 82 2730 data 73, 78, 84, 69, 82, 46, 13, 18. 34 2740 data 88, 82. 69, 70, 64, 32, 88, 32, 60 2750 data 67, 82, 62, 34, 146, 32, 58, 80, 82

The Transactor

CA NB EC AF GE BF NG KF AH LF Bl HG II KJ OM GL AL GP CN GO LL NC JB MB HA EB AB PA HA GG CF PE Kl DH IG OJ Ml JJ DH CB HC HJ ID

â&#x20AC;˘

JL BO FM Dl FP OP EK IN KC IC GG OA ON MP KP MB PI 55

2760 data 73, 78, 84, 2770 data 82, 69, 70, 2780 data 83, 44, 13 , 2790data 88, 34, 32, 2800data 88, 82, 69, 2810 data 60, 67, 82, 2820data 65, 77, 69, 2830data 79, 86, 69, 2840 data 84, 72, 69, 2850 data 84, 32, 73, 2860 data 32, 84, 79, 2870 data 80, 82, 73, 2880 data 18, 34, 88, 2890 data 32, 79, 82, 2900data 42, 32, 88, 2910 data 73, 78, 84, 2920data 72, 69, 13, 2930 data 32, 79, 82, 2940 data 80, 82, 73, 2950 data 76, 76, 32, 2960 data 78, 67, 69, 2970data 88, 34, 46, 2980data 70, 32, 60, 2990 data 58, 67, 79, 3000 data 73, 86, 69, 3010 data 84, 83, 32, 3020 data 83, 73, 67, 3030 data 32, 87, 72, 3040 data 34, 32, 65, 3050 data 46, 13, 13, 3060 data 84, 72, 69, 3070 data 69, 89, 32, 3080 data 83, 69, 32, 3090 data 83, 84, 73, 3100 data 68, 32, 65, 311 o data 32, 84, 79, 3120 data 78, 85, 69, 3130 data 83, 32, 82, 3140 data 80, 44, 32, 3150 data 67, 69, 76, 3160 data 73, 83, 84, 0, 147, 13, 3170 data 3180 data 32, 32, 32, 3190 data 32, 18, 88, 3200 data 13, 13 , 32, 3210 data 32, 65, 32, 3220 data 76, 69, 32, 3230 data 32, 78, 85, 3240 data 32, 32, 32, 3250 data 79, 83, 83, 3260 data 69, 78, 67, 3270 data 82, 65. 77, 3280 data 32, 32, 18, 3290 data 56, 53, 32, 3300 data 73, 68, 32, 3310 data 65, 76, 68, 3320 data 0.2. 134, 55, 3330 data 160, 0.2, 133, 0, 185, 103, 3340data 3350 data 200, 208, 245, 3360 data 76,46.1, 0.2, 3370 data 76,77.1, 0.2,

83, 32, 65, 59, 82, 69, 70, 82, 79, 79, 78, 46, 70, 42, 64, 62, 34, 146, 32, 65, 83, 44, 32, 66, 13, 79, 85, 83, 32, 83, 32, 89, 79 , 78, 84, 69, 82, 69, 70, 32, 34, 88, 34, 146, 32, 83, 32, 84, 83, 67, 82, 32, 89, 79, 78, 84, 69, 82, 69, 70, 83, 13, 84, 13. 18, 34, 67, 78, 76, 79, 32, 69, 80, 80, 32, 84,

84,

78, 78, 32, 46, 85, 84, 32, 73, 32, 32, 82, 32, 86,

82, 83, 89, 78, 76, 82, 80, 82, 34, 79, 72, 71, 89, 67, 13 , 78, 79, 84, 78, 32, 32, 69, 32, 65,

38, 32, 77, 66, 32, 32, 32, 82, 69, 32, 13 , 13 , 40, 67, 66, 89, 65, 82, 13 , 13 , 132, 56, 124, 134, 166, 240, 76,3 1 . 1 ' 76,57.1, 0

62, 69, 32, 69, 73, 69, 69, 69, 80, 32, 69, 44, 32, 79, 80, 47, 32, 72, 71, 32, 32, 70,

76, 67, 32, 18, 88, 58, 65, 85, 84, 76, 78, 77, 13, 32, 32, 32,

84, 80,

69, 78, 85, 82, 82, 46,

32, 88, 82, 69, 58, 80, 79, 32, 69, 69, 85, 82, 82, 32, 69, 82, 79, 32, 88, 82, 34, 146, 67, 85, 76, 73, 13, 66, 78, 69, 32, 34, 65, 82, 83, 83, 34, 32, 80, 65, 13, 76, 32, 65, 75, 69, 78, 84, 82, 69, 83, 84, 67, 65, 69, 32. 46, 13, 32, 32, 32, 32, 54, 52, 32, 32, 73, 65, 73, 78, 82, 13, 32, 67, 70, 69,

32 69 34 34 32 83 66 32 85 84 32 13 34 70 82 84 78 32 65 69 34 69 32 84 83 65 44

83 32 75 85 73 78 89 73 83 79 78 76 13 32 32 13 32 32, 66 82, 76, 69 32 69, 82 32, 69, 82 80, 82, 79, 71 32, 32, 32, 32 41 , 32, 49, 57 32. 68, 65, 86 67. 72, 73, 66 0, 162, 6.1, 160 169, 76, 162,89.1 125, 132, 126, 160 9, 32, 17, 167 0.2, 76,38.1' 0.2 0.2, 76,71.1, 0.2

July 1987: Volume a, lillie 01

Beyond COMPARE

David Lathrop Fremont, California

Find the differences between two files of any kind BASIC, assembler, text, database records, or hexadecimal! Utilities are usually pretty dull subjects. So a file compare program probably will not generate a lot of excitement - until you need it. When you ao need one, you may discover that there are not many of them available, and they do not handle inserted or deleted records very well. Furthermore, if you compare BASIC or machine language program files, these other compare programs show file differences in binary or ASCII data as they are stored on disk, not as BASIC statements or ML instructions.

3. The name of the NEW file- For comparisons, this is the name of the second me. But if you want to list the OLD file, enter an asterisk ( â&#x20AC;˘) as the NEW file name. 4. The destination of the comparison report - Choose a for screen,

COMPARE is a file comparison utility that does not suffer from these shortcomings. It recognizes inserted and deleted lines and makes adjustments before continuing with the comparison. If the files are BASIC programs, COMPARE will list the program files as the UST command does (that is, the line numbers and tokens will be interpreted). If the mes are 6502 machine language programs, they can be disassembled. If the files are text or data, they may be shown as either ASCII text or hexadecimal data.

i a sequential, user or relative file, you may choose a If the OLD file s (ASCII text) or x (hexadecimal data) format.

A simple BASIC program is shown in Figure I . A modified version of i shown in Figure 2. Can you easily see the differences? A report it s created by COMPARE is shown in Figure 3, and this report clearly shows how the two programs differ. A nice fringe benefit of COMPARE s i the ability to list a file in a variety of formats. To do this, the me is compared with "nothing". All the differences between the file and "nothing" are reported, and these differences represent the entire contents of the file. We'll discuss how to do this shortly.

Program Preparation First enter and save Program I. This BASIC program, named COMPARE, is the main program which loads ML routines and prompts for information such as file names and report formats. It then calls the ML routines to do the comparison. Next enter, save and run Program 2. This BASIC program creates an ML program named CMP.ML6800. This ML program reads the files, compares them, and reports the differences. How to uae COMPARE

After saving the BASIC and ML programs on disk, load and run COMPARE. After loading the ML routines, COMPARE will prompt you for the following: 1 . The address of the drive you wish to

use - this s i usually 8 or 9. 2 The name of the OLD file - COMPARE assumes that one of the two files pre-dates the other, so the earlier one is called the OLD il the file. If you are in doubt about the file's name you can st diskette directory by entering $ as the file name ,

or p for printer. 5. The report format - If the OLD file s i a program file, you may choose a(ASCII text), b (BASIC list), d (disassembled 6502 list), or x (hexadecimal data) formats.

The choice of format tells COMPARE how to process the file's

records, and how to prepare the display of non-<:omparing records If you request either a BASIC or 6502 machine language report, that is sufficient information for the compare to begin. However if you request either ASCII text or hexadecimal data formats, you must tell COMPARE what kind of records these files have. Ifyou don't know what the internalstructure ofthe file s, i

COMPARE

can help you by listing the files for inspection. Pick one ofthe files for

the OW file name, specify â&#x20AC;˘ for the NEW file name, select report format x for hexadecimal, choose I for fixed record length, and specify a record length ol/27 bytes. With a lillie investigati on, you should be able to determine how records are defined n i the file.

COMPARE can work with fixed (f) or variable (v) length records. If the record length is fixed, COMPARE will ask you what that length is. But if the length s i variable, COMPARE will ask how it can determine the end of each record. Three possibilities are allowed: I . The length of the record is contained in the data. For example, suppose the first byte indicates how long the record is. In this case you would choose option I and indicate that the position of the length value is one. 2 The end of the record s i marked by a special character. For example, many text files terminate a line or paragraph with a carriage return. In this case you would choose option c and indicate that the decimal value of the special character is 13. 3. The end of the record is marked by special bits, the value of which IS called a mask. To use this option, you need to understand how eight bit bytes can be expressed as decimal values from 0 to 255. For example, many text files mark the end of a record by setting the most significant bit. In this case you would choose option m and indicate that the mask s i 128. For option corm, you will be asked for a minimum record length. This s i because it is possible that the special character or mask may appear in the first few bytes of a record For example, a BASIC program file has a minimum record length of four because a zero marks the end of a statement, but a zero may also appear in the first 56

July 1917: VOlume a, Issue 01

four bytes as e1ther part of the line number or the line link. This prompt allows you to tell COMPARE to g i nore any occurrence of the i this special character or mask at the start of a record Specify zero f is not the case.

ob% -file starting track & sector (to/from ML} oy% -file type I .. seq,2 = prg,3 = usr,4 = rei (from ML)

At the completion of th1s step, you will have described to COMPARE the nature of the files to compare and the format of the comparison report you wish to see. Now the comparison will start. Figure 3 shows an example of a comparison between two BASIC program files. Figures 4 and 5 show a 6502 disassembly and a hexadecimal list of another program. Report types a. d. and x show the ASCII representation of data, but all Commodore graphics characters, cursor movement and color characters are shown as periods.

nn$ n??

•

When the comparison begins, a report heading is printed which shows the names of the two files. Following the header, each mismatch between files s i grouped into blocks. The records in the OLD file which do not compare are listed first followed by a dashed line ( --). The corresponding part of the NEW file is then listed followed by a line of equal signs ( = = = = = = = ). You will note that the last line printed for both files in each block of mismatched records (except possibly the very last block) are identical. This is the point where COMPARE has determined that the files are the same, has realigned them and continued the comparison A count of the mismatched blocks is shown at the end of the report.

NEW file - file name padded with shifted spaces - see OLD file variables above

The COMPARE ML program resides between $6800 and $8000, so it should be able to co-exist peacefully with expansion cartridges i used heavily, but it s i and most other ML programs. Page zero s saved and subsequently restored before the ML ends. Two 4K file buffers fit between $4000 and $6000, so the BASIC program lowers MEMTOP accordmgly (see line I0}. If you wish to 1ncrease the RAM available to BASIC, you can move the buffers up under BASIC ROM between SAOOO and SCOOO by setting of$ chr$(1 60): nfS=chr$(176). •

While the comparison is taking place, you may press any of the following keys:

The BASIC program may be modified to suit your tastes if you take care to define the variables shown above before you SYS to any of the ML routines. If you wish to make modifications, the following will be of interest: If pn% '"'3, a 40 column report is created to fit on the screen, otherwise an 80 column report is produced. If you have an 80 column cartndge. you can show 80 columns on the screen by opening a file to the screen such as pn% = 5:open5,3,0. as

CTRL slows the scrolling speed if the comparison report s i dis played on your monitor screen.

You

F3 terminates the comparison immediately. F7 pauses the comparison. This is useful if the report s i displayed on the screen and you wish to study it before letting it scroll by. Press any other key to resume.

If you wish to display or compare files which do not have entries in the diskette directory, you may do so by setting ob% and nb% equal to the files' begmning track and sector. For example, to list a diskette BAM and directory blocks, set nb%=0: ob%= 18•256 before the sys26624.

TechnJcal Note.

Beyond Compare

The BASIC and ML programs communicate with each other via variables. Variables associated with the OLD file begin with an "o", and variables associated with the NEW file begin with an "n". The variables are defined before the ML program is called, and are used as follows:

As good as COMPARE is, it is not foolproof. If two Iiles have a number of identical records in them such as blank lines in a text file or REM statements without any text in a BASIC program, COMPARE can be fooled into thinking it has found a point where two dissimilar files are the same and a block of non-comparing records may be printed prematurely. This is usually not a serious problem, but if these "trivial" records disrupt the comparison, you may wish to make copies of the two files with these records deleted.

General variables dn% - disk unit address (input to ML) pn% - printer or screen address (to ML) pc% - printer secondary address (to ML) mm% - mis-match count (output from ML) rc% - return code (from ML) OLD file ooS ov$ otS ozS os$

of$

- file name padded with shifted spaces (to ML) - report format a,b,d,x (to ML) - record type f,v,l,c,m (to ML) - rec. length, length position, character or mask (to ML} - minimum record length (to ML) - 4K buffer RAM page nr (to ML)

The Tl'ansactor

may also write a report to disk by opening a file such pn% = 2:open2,8,2,"comp.report,s,w".

All of the records lor each file which do not compare are held in RAM unhl they are printed. If there is a large block of records in either file which does not correspond to any records m the other file, COMPARE may run out of space to hold the records. When this happens, a warning message will be printed, all records currently in memory will be printed and the comparison will continue from that point. This event may cause COMPARE to subsequently report differences between the files when in fact they do not exist. After you have used COMPARE, you may find it very valuable as a file listing utility. You can use it to examine database files and see how they are structured. It is very helpful m listing BASIC programs with REM statements which confuse the UST command. Machine

July 1917: Volume I, laue 01

se bled and listed directly from language programs may be disasm disk. But COMPARE's main function is to compare two files. When you need to do that, there is little else around that works as well. In those situations, this little utility is beyond compare.

Figure 1: UNNEW.BASIC Program Fl.le Listing

Figure 4: Machine l..angul}ge Program Dbusembly (Editor's Note: COMPARE prints a character representaion t of the bytes in the column down the right. Some of the characters are graphics that we can't typeset. However, they aren't critical for the example reports, so we've replaced them with a § )

100 poke53281 ,O:pnnt • sys525 1 1 0 i = 525 120 reada: ifa = 256then 130 130 pokei,a:i = i + 1 :goto1 20 140 poke43,525 and 255:poke44,2 150 poke45,578 and 255:poke46,2 l60 pnnt • · :save · O:unnew • ,8 170 rem for tape use save · unnew • ,1, 1 180 data 160, 3,200 1 77, 43, 208, 251 190 data 200, 200, 152, 160, 0, 145, 43 200data 165, 44, 200, 145, 43, 133, 60 210 data 160, 0, 132, 59, 162, 0, 200 220 data 208, 2, 230, 60, 177, 59, 208 230 data 245, 232, 224, 3, 208, 242, 200 240 data 208, 2. 230, 60, 132, 45, 164 250 data 60, 132, 46, 96, 256 ..

•

••••••••••••••••••••••••••••••••••••••••••••

OLD Name: unnew NEW Name: • 020d02010210021202140215021602170219021b021d021e022002220224022602280229022b022d0221023102320234023602370239023b023d02310241-

1 1 0 i = 525

120 reada:ifa = 256then130 130 pokei,a:i i + 1 :goto1 20 140 poke43,525 and 255:poke44,2 150 poke45,578 and 255:poke46,2 160 print · . · :save · O:unnew • ,8 170 data 160, 3, 200, 177, 43, 208, 215 180 data200, 200, 152, 1 60, 0, 145, 43 190 data 165, 44, 200, 145, 43, 133, 60 0. 200 200 data 160, o. 132, 59, 162, 2. 230, 60, 177, 59. 208 210 data 208, 220 data 245, 232, 224, 3, 208, 242, 200 230 data 208, 2, 230, 60, 132, 45, 164 240 data 60, 132, 46, 96, 256 =

Figure 3: BASIC Program Fl.lea Compari8on Report ••••••••••••••••••••••••••••••••••••••••••••

File Comparison Ut•lity V3.4

•

••••••••••••••••••••••••••••••••••••••••••••

Figure 2: UNNEW.BASIC2 Program Fl.le Listing

•

File Comparison Utility V3.4

•

aO 03 c8 b1 2b dO fb c8 c8 98 ao oo 91 2b as 2c c8 91 2b 85 3c ao oo 84 3b a2 00 c8 dO 02 e6 3c b1 3b dO 15 e8 eO 03 dO 12 c8 dO 02 e6 3c 84 2d a4 3c 84 2e 60

ldy iny Ida bne my my tya ldy sta Ida my sta sta ldy

#$03 ($2b),y $0201

#$00 ($2b),y $2c

<. .> <H> < § +> <P§> <H> <H> <.> > < < +> <§ ' > <H> < . +> < . <> > < < . ;> < § .> <H> <P.> <§<> <§ ; > <P§> <§> < .> <P§> <H> <P. > <§<> < . -> <§* < . .> < > •

•

($2b),y $3c #$00 sty $3b ldx #$00 my bne $022d inc $3c Ida ($3b),y bne $0226 . 1nx cpx #$03 bne $0228 my bne $023b InC $3c sty $2d ldy $3c sty $2e rts

•

••••••••••••••••••••••••••••••••••••••••••••

OLD Name: unnew.basic

F"agure 5: Hexadecimal Listing

NEW Name: unnew bas•c2

•••••••••••••••••••••••••••••••••••••••••••••••

100 poke53281 .0 print · ..sys525 • 1 1 0 i ·525 --------------- ---------------1 1 0 i = 525 ----

File Companson Ullhty V3 4

•

•••••••••••••••••••••••••• • ••••••••••••••••••••

OLD Name unnew

NEW Name:

0000

170 rem for tape use save · unnew • , 1 ,1 180 data 160, 3, 200, 177, 43,208,251 190 data 200, 200, 152, 160, 0, 145, 43 170 data 160, 3, 200, 177, 43, 208, 215 0, 145, 43 180 data 200, 200, 1 52, 160,

0020

Compare ftnished. 2 mismatches found 5I

•

2bd0 912b 3ca0 d002

< H § +P> <§HH +> <§ , H . + . < . > < . . ; § . HP . >

e63c b13b d015 e8e0 03d0 f2c8 d002 e63c 842d a43c 842e 60

<§<§ , P §§ > < . P § H P . § <> < . - §< . . >

Od02 fbc8 a52c 0084

a003 c898 c891 3ba2

c8b1 aOOO 2b85 00c8

•

Juty 1917: Volume I, luue 01

AF CP PF JE

COMPARE: BASIC Portion CN GI

IC 10 10

EL OG HK BK EB

PG Gl

FD JH

JA DP HA Ml PB

OP DL LL MN KK JF BK LK PB IH KF FJ GN EL KM FM ON JC AC EG KE AP HL I DA JJ Jl KL •

1 0 poke56,64:clr:co • 06:cr = 02:cb = 1 :poke646,co :poke53280,cr:poke53281 ,cb 20 if peek(26636) 51 and peek(26638) - 52 then100 30 gosub940·pnnt • ML Subrout1nes 40 dn% = peek(1 86) load · cmp.ml.6800 • ,dn%,1 100 hd$ = • • File Companson Utility V3.4 • • 1 1 0 bx$= '(34 •'s]" 120 rem of$ = chr$(1 60):nf$ = chr$(1 76) 130 mm% = O:rc% - O:cr$ chr$(13):ze$ • chr$(0) :fori = 1to16:sp$ ... sp$ + chr$(160)·next oz$ = • ':os$- • • 140ov$= · ' ot$:ob%=0:oy<lA> • O 150nv$= • '.nt$• • '·nz$= • '·ns$• • • :nbo/o = o·nyoA> "" 0 160. 170 gosub940 180 dn% = O"input · Disk unit nr (8-1 1 ) • ,dn% :if dn% = 0 then end 190 if dn%<8 or dn%>1 1 then pnnt' Unit nr must be 8 1 1 • goto180 200 ol$"' • • mput ·OLD file name • ;ol$ 210 if • then gosub970:goto200 220 11 ol$ = ' ' then170 230 nu$ = • · :input ' NEW file name or · ;nu$ 240 if nu$ = • $ ' then gosub970:gosub940:goto200 250 1f nu$ = • • then200 s 260 pd$ = • • : • Report to · · ,pd$ orlp 270 if pd$ = then230 280 1f pd$ = • s • then pn% = 3:pc% = 0 goto31 0 290 1f pd$ = • p • then pn% = 4:pc% = 7:goto31 0 300 goto260 310: 320 ·rem--- get file type. trk, sector 330 oo$ lelt$(ol$ + sp$, 16) 340 nn$ lelt$(nu$ + sp$,16) 350 sys26627:11 nu$- • • • then ny% 1 nbOA> = 0 360 If rc0AK128 then400 370 1f rcDAK255 then a$= · failed. · :goto390 380 a$ = ·cancelled. • 390 print· Directory search • ;a$.goto440 400 1f oy%<>0 and ny%<>0 then480 410 if oy% = 0 then pnnt ·OLD file not found. • · NEW file not found. • 420 if ny% = 0 430 print · Enter to list the disk d1rectory. • 440 print · Press any to continue · 450 get a$:if a$ • • • then450 460 goto200 470 : 480 :rem--- get report and r�o_W 490 os$ ze$:pnnt · Choose = 2 then print • 500 d • 51 0 ov$= ' . 1nput' ' ;ov$ 520 if ov$ = · a · or ov$ = x then580 530 if oy% = 2 and ov$ = • b • then ot$ - • c • :oz$ = chr$(0):goto820 540 if oy<l/o = 2 and ov$ = • d • then ot$ • · I · :oz$ = chr$(1 ) goto820

The Tranaac:tor

•

FL LA FK NC NK OH IE AN LE

KC LG CL OE FP IN

I•

DH HK CH GC ML

80 BE

PA OL GH EM CJ MA ML LK KC LO LA

•

EJ CF GF lA Ml GK

IE JL KC

LK EN PE BN Dl AE

550 if ov$ = • • then goto820 560 goto490 570 ·rem--- record specification 'Is record length I 580 ot$ = • • · • ;ot$ orlv 590 if ot$ = then630 600 if ot$ = • v • then660 610 1f ot$ = • • then490 620 goto580 630 x 0:1nput • Spec1fy record length (1-255) • ;x :1f x<1 or x>255 then580 640 oz$ chr$(x):goto820 650 :rem--- variable In record 660 print · Choose end of record indicator. . . • """'•h c 670 ot$ = • • input· or m • ;ot$ 680 1f ot$ c then a$= ·character · :goto730 690 if ot$ = • m • then a$= ·mask· :goto730 700 if ot$ = T then790 710 if ot$ = • • then580 720 goto660 730 x$ = • · :print· Enter value of · ;a$, · (0 255) · ; :1nput x$:if x$ • • • then660 740 x =val(x$) if x<O or x>255 then730 750 oz$ = chr$(x) 760 x$ = • · :input · Enter minimum record length (0-255) ' ;x$:1f x$ = • • then730 770 x = val(x$):if x<O or x>255 then760 780 os$ = chr$(x).goto820 790 x$ • · :input · Specify the location (1 -255) • ;x$ ·if x$ = • • then760 800 x = val(x$):if x<1 or x>255 then790 81 0 oz$ = chr$(x) 820 if ov$ = • • then260 830 nv$=ov$.nt$ .. ot$ nz$=oz$:ns$- os$ 840 . 850 :rem--- produce comparison report 860 a$ =chr$(147):b$ = • [3 spes] ' :if pn%<>3 then a$=chr$(12):b$= '[16 spcs] " 870 open pnOA>,pn%,pcOA> 880 pnnt#pn%,a$;b$;bx$;cr$;b$;hd$;cr$;b$;bx$;cr$ 890 pnnt#pn%,b$, ·OLD Name. • ;ol$ 900 print#pn%,b$, • NEW Name: • ,nu$;cr$ 910 sys26624:gosub990:goto200 920 : 930 :--- a1sr:•1a screen header 940 print · • chr$(1 4)tab(3)hd$cr$cr$:return 950 : 960 list d1rectory 970 pn%=3.nu$• • • · .open pn%,pno-i>,pc% :sys26630 980 : 990 a$= 'Compare · :if nu$ = • • • then a$ = • Listing 1000 b$ = " fin1shed. • :1f rcOAJ>99 then b$- • fa1led. • :if rc0Al = 255 then b$ = ·cancelled • 1010 if nu$<> • • then b$ = b$ + str$(mm%) + • mismatches. • 1020 print#pn%,cr$cr$a$b$:pnnt#pn% close pno/o 1030if pno/o<>3 then1060 1040 print • Press any key to continue. ' 1050 get a$:if a$- • • or a$= chr$(136) then1 050 1060 return

.11

�-

•

July 1917: Volume I, lasue 01

COMPARE: Creates Machine Language file 8H

EM JG CO NH GJ EF LG NM FA

IN PO MC

OC OC GF MK JP KN

NG NC Cl Gl

J8 JA HN AI

KG EH OH II CJ MJ GK AL KL

EM OM IN CO MO GP AA KA E8

MD OM PF OM JM KM GG HF AJ FA

GM FF JN PM L8

CP IF JJ FL CM CJ EJ NM FL MM PM

1 0 rem• data loader for ·compare· • 20 for 1 = 26624 to 31 790:read a 30 cs = cs + a: next i 40 if cs<>523626 then print· !data errorl " : end 50 open 1 ,8, 1 , • cmp.ml.6800,p,w 55 print#l ,chr$(0)chr$(1 04); 60 restore 70for i = 1 to5167 80 read a: print#l ,chr$(a);: nex1 i 90 close 1 : print " ok, ml file has been written. • : end 100: 1000 data 76, 38, 105, 76, 2 1 , 106, 76, 92 1010 data 107, 99, 109, 1 1 2, 5 1 , 46, 52. 76 1020 data 1 5 1 , 108, 76, 194, 1 09, 76, 19, 1 1 0 1030 data 76, 79, 1 1 0 , 76, 1 1 1 , 110, 76, 151 1040 data 1 1 0, 76, 230, 1 1 0 , 76, 1 1 , 1 1 2, 76 1050 data 245, 1 1 2, 76, 48, 1 1 3, 76, 83, 114 1060 data 76, 1 0 1 , 1 1 4 , 76, 1 1 0, 115, 76, 209 1070 data 1 1 6, 76, 218, 1 1 7 , 76, 246, 1 1 7 , 76 1080 data 6 1 , 1 1 8 , 76, 128, 1 1 8, 76, 252, 1 1 8 1090 data 76, 50, 119, 76, 86, 1 1 9 , 76, 103 1 1 00 data 1 1 9 , 76, 129, 1 1 9, 76, 165, 1 1 9 , 76 1 1 1 0 data 26, 1 20. o, 0, 0, 8, 15, 7 1 1 20 data 3, 85, 49, 58, 55, 44, 48, 44 1 1 30 data 84, 84, 44, 83, 83, 0, 102, 105 1 1 40 data 108, 1 01 , 1 10, 97, 109, 1 0 1 , 46, 46 1 1 50 data 46, 46, 46, 46, 46, 46, 1 19, 1 1 4 1160 data 107, 50, 0, 64, 0, 80, 15, 0 1 1 70 data 0, 0, 0, 0, 0, 0, 0, 0 1180 data 0, 0, 0, 0, 0, 0, 0, 0 1 1 90 data 0, 0, 0, 0, 0, 0, 0, 0 0, 1200 data 0, 0, 0, 0, 0, 0, 0 1210 data 0, 0, 0, 0, 0, 0, 0, 0 0, 0, 0, 1220 data 0, 0 0, 0, 0, 1230 data 0, 0, 0, o, 0, 0, 0, o 1240 data 0, 0, 0, 0, 0, 0, 0, 0 1250 data 0, 0, 0, 0, 0, 0. 0, o 0, 0, 0, o. 0 1260 data 0, 0, 0, 1270 data 0, 0, 0, 0, 0, 0, 0, 0 1280 data 0, o. 0, o, 0, o. o, 0 1290 data 0, o. 0, 0, 0, 0, 0, o 1300 data 0, 0, 0, 0, 0, 0, 0, 0 1310 data 0, 0, 0, 0, 0, 0, 0, o 0 1320 data 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 0, 0, 0, 1330 data 0, 0, 1340 data 0, 0, 0, 0, 0, 0, 0, 0 1350 data 0, o. o, o, o. 0, o, o 0, 0, 0, 0, 32, 15 1360 data 0, 0, 1370 data 104, 169, 124, 133, 79, 169, 94, 133 1380 data 78, 173, 90, 1 04, 208, 52, 32, 30 1390 data 104, 32, 27, 1 04, 173, 90, 104, 208 1400 data 41, 166, 78, 1 8 1 , 0, 240, 8, 166 1410 data 79, 1 8 1 , 0, 240, 13, 208, 27, 32 1420 data 60, 1 04, 240, 14, 166, 79, 1 8 1 , 0 1430 data 208, 220, 165, 78, 134, 78, 133, 79 1440 data 208, 212, 32, 42, 104, 32, 66, 104 1450 data 208, 204, 166, 79, 1 8 1 , 8, 133, 80 1460 data 181, 9, 133, 81, 173, 90, 104, 201 1470 data 253,208, 40, 162, 124, 1 8 1 , 16, 21 1480 data 17, 240, 25, 174, 96, 104, 32, 201 1490 data 255, 1 62, 0, 189, 170, 105, 240, 6 1500 data 157, 194, 104, 232, 208,245, 32, 57 1510 data 104, 32, 204, 255, 169, 0, 1 4 1 , 90

TM TransactOf'

•

EA HJ EA JH OM

CL 08

8M HF JP NC CM EN KP

OM EJ CH OJ

PF Fl

LM AJ

CN FD

FM ME GO DP PO KA

GP NP LO

AP NC

AL FE

MK EL

1520 data 104, 240, 19), 32, 42, 104, 32, 1 8 1530 data 104, 96, 13, 13, 1 09, 73, 83, 77 1540 data 65, 84, 67, 72, 69, 68, 32, 82 1550 data 69, 67, 79, 82. 68, 83, 32, 79 1560d• 86, 69, 82, ro, 76, 79, 87, W 1570 data 68, 32, 66, 85, 70, 70, 69, 82 1580 data 46, 13, 98, 85, 70, 70, 69, 82 1 590 data 32, 67, 79, 78, 84, 69, 78, 84 1600 data 83, 32, 87, 73, 76, 76, 32, 66 161 o data 69, 32, 80, 82, 73, 78, 84, 69 1620 data 68, 32, 65, 78, 68, 13, 84, 72 1630 data 69, 32, 67, 79, 77, 80, 65, 82 1640 data 73, 83, 79, 78, 32, 87, 73, 76 1650 data 76, 32, 67, 79, 78, 84, 73, 78 1660 data 85, 69, 46, 13, 0, 32, 15, 104 1670 data 1 73, 90, 104, 208, 123, 162, 79, 169 1680 data 207, 32, 21, 1 04, 176, 1 09, 160, 3 1690 data 177, 251, 133, 124, 200, 177,251, 133 1 700 data 125,162,207,169,217, 32, 2 1 , 104 1710 data 176, 89, 165, 251, 133, 126, 165, 252 3, 145, 251 1720 data 133, 127, 169, 0, 1 60, 1730 data 169, 194, 32, 2 1 , 104, 176, 68, 165 1740 data 251, 133, 128, 165, 252, 133, 129, 162 1750 data 78, 169, 206, 32, 2 1 , 104, 176, 51 1760 data 160, 3, 177,251, 133, 130, 200, 177 1770 data 251, 133, 131, 162, 206, 169, 217, 32 1780 data 2 1 , 104, 176, 3 1 , 165,251 , 133, 132 1790 data 165, 252, 133, 133, 169, 0, 160, 3 1800 data 145,251, 169, 194, 32, 2 1 , 104, 1 76 1810 data 10, 165,251, 133, 134, 165, 252, 133 1820 data 135, 144, 5, 169, 254, 141, 90, 104 1830 data 173, 90, 1 04, 208, 75, 32, 204, 255 1840 data 162, 94, 134, 78, 169, 18, 149, 16 1 1850 data 169, 1 , 149, 1 7 , 169, 65, 149, 1860 data 169, 70, 149, 2, 169, 30, 149, 3 1870 data 169, 255, 149, 14, 166, 78, 180, 1 0 1880 data 136, 148, 8, 180, 1 1 , 136, 148, 9 1890 data 32, 30, 1 04, 166, 78, 1 8 1 , 0, 208 7, 240, 6, 32 1900 data 23, 1 8 1 , 5, 4 1 , 1 9 1 0 data 36, 1 04, 32, 36, 104, 32, 236, 106 1920 data 32, 27, 104, 173, 90, 104,240 , 2 1 2 1930 data 32, 18, 104, 96, 1 8 1 , 10, 133,251 1940 data 181, 1 1 , 1 33, 252, 169, 153, 133, 253 1950 data 169, 104, 133, 254, 162, 33, 160, 0 1960 data 32, 69, 104, 173, 1 56, 104, 16, 83 1970 data 41, 127, 1 70, 160, 3, 177, 126, 208 1980 data 28, 160, 15, 185, 1 59, 104, 209, 124 1990 data 208, 19, 136, 16, 246, 160, 3, 138 2000 data 145, 126, 173, 158, 104, 145, 1 28, 1 36 2010 data 173, 157, 104, 1 45, 1 28, 160, 3, 177 2020data 132, 208, 31, 160, 15, 185, 159, 1 04 2030 data 209, 130, 208, 31, 136, 16, 246, 160 2040data 3, 138, 145, 132, 1 73, 158, 104, 1 45 2050data 134, 136, 173, 157, 104, 145, 134, 24 2060 data 144, 9, 177, 126, 240, 5, 169, 1 2070data 1 4 1 , 90, 104, 96, 32, 1 5 , 1 0 4 , 1 7 3 2080data 90, 104, 240, 4, 32, 18, 104, 96 2090 data 32, 204, 255, 162, 94, 134, 78, 169 2100 data 18, 149, 16, 169, o. 149, 17, 169 2 1 1 0 data 65, 149, 1 , 169, 70, 1 49, 2, 169 2120 data 30, 149, 3, 169, 255, 149, 14, 32 2130 data 36, 104, 173, 90, 104, 208, 124, 166 2140 data 78, 169, 142, 149, 14, 32, 30, 104 2150 data 173, 90, 104, 208, 110, 32, 105, 108 2160 data 160, 17, 185, 156, 104, 153, 204, 104 2170 data 136, 16, 247, 173, 174, 1 04, 141, 224

July 1987: Volume 8, Issue 01

IJ NJ AL MM NP PM LM HN AO KO LM NN DH

DB OH

GF EF PM EJ LJ IJ lA KM EH OH NP GH Gl MB CP EJ CP AN GA FO EC KC OE IF AN

ON KL GJ CE PI OP LJ Gl

NO PL PK CM IM PM LM OC LL MD II Ll EC OH

MI BO BE HG KG LG AL GH Nl FF HE CK EF CD AK GF JP OD KO EC PA BC DL MM HL LK PM GG NJ

2180 data 104. 173. 175. 104, 141. 225, 104, 169 2190 data 13, 141 , 231, 104, 1 4 1 , 232, 104, 169 3. 240, 2 2200 data 147 174, 96, 104, 224, 2210 data 169 12, 141, 194, 104 32,201, 255 2220 data 162. 39, 32, 57, 104, 166, 78, 169 2230 data 0 149, 5, 169, 255, 1 49, 14, 166 2240data 78, 180, 10, 1 36, 148, 8. 180, 1 1 2250data 136, 148, 9, 32, 30, 1 04, 166, 78 2260 data 181, 0, 208, 23, 181, 5, 41, 7 2270 data240, 6, 32, 36, 104, 32. 36, 104 2280data 32. 15, 108, 32, 27, 104, 1 73, 90 2290data 104, 16,212, 32, 18, 104, 96, 32 2300data 105, 108, 1 73, 1 56, 104, 16. 81, 41 2310 data 127. 10, 10, 105. 3, 168, 162, 3 2320data 185, 1 3 1 , 108, 157,216, 104 136. 202 2330data 16, 246, 1 62, 15, 189, 1 59 104, 157 2340 data 199, 104. 202. 16, 247. 173, 185, 104 2350data 170, 173, 184, 104, 32, 84, 104, 160 2360data 5, 185, 87, 0, 1 53,219, 104, 1 36 2370data 16, 247, 160, 3, 185, 1 3 1 , 108. 153 2380 data 226, 104, 136, 16, 247, 169, 13, 141 2390data 232, 104, 32, 204, 255. 174, 96, 104 2400 data 32, 201, 255, 162, 39. 32, 57. 104 2410 data 96, 1 66, 78, 181, 10, 133, 251 , 181 2420data 1 1 , 133, 252. 169. 153, 133, 253, 169 2430 data 104, 133, 254, 160, o. 162. 33, 32 2440data 69, 104, 96, 66. 76, 75. 83, 83 2450 data 69, 81, 32, 80. 82. 71, 32, 85 2460 data 83, 82, 32. 82. 69, 76, 32, 169 2470data 0 , 1 4 1 , 91, 104 141, 92, 104, 141 2480data 90, 104, 141, 26.208, 141, 13. 221 2490data 169, 32, 162, 99, 157,194,104,202 2500 data 16, 250, 162. 208. 169, 206, 32, 21 2510 data 104, 1 76, 7, 160, 3, 177,251 , 1 41 2520data 96, 104, 162, 1 96, 169,206, 32, 21 2530data 104, 1 76, 7, 160, 3, 177 , 251 , 141 2540data 93, 104, 169, 1 24, 133,251, 169, 0 2550 data 133, 252. 169, 135, 133. 253, 169, 104 2560data 133, 254, 162, 18, 160, 0, 32, 69 2570data 104, 1 73, 94, 104 174, 93, 104 172 2580 data 94, 104, 32. 186, 255, 169, 2 162 2590data 58, 160, 109, 32, 1 89, 255, 32, 192 2600 data 255, 32, 39. 104, 208, 51, 173, 95 2610 data 104,174, 93, 104, 172, 95, 104, 32 2620 data 186, 255, 169, 1 , 162. 60, 160, 109 2630 data 32, 189, 255, 32, 192, 255, 32, 39 2640 data 104, 208, 22, 160, 94, 173, 1 3 1 , 104 2650 data 162, 79, 32. 61, 109, 208, 10. 160 2660 data 124, 1 73, 133, 104, 162, 78, 32, 61 2670 data 109, 96, 73, 48, 35, 141, 126. 104 2680 data 169, 198, 32, 24. 104, 201, o. 208 2690 data 3, 173, 1 26, 104, 24, 153, 1 1 , 0 2700data 109, 1 34, 104. 1 53, 13, 0,237 134 2710 data 104, 1 53, 9, 0, 169,214, 32. 24 2720data 104, 1 53, 1, 0, 1 69,212, 32, 24 2730 data 104, 1 53, 2, 0. 169, 218, 32, 24 3, 0 , 1 6 9 , 2 1 1 . 32. 24 2740 data 104, 153, 2750 data 104, 1 53, 4, 0, 138, 9, 1 28, 170 2760 data 169. 194, 32. 21, 1 04, 152. 170, 160 2770data 2, 177,251 , 1 49, 16, 200, 1 77, 251 2780 data 149, 17. 169, 0, 149, 0, 149, 5 2790 data 149, 6, 149, 7, 149, 15, 149, 10 2800 data 149, 12. 169, 255, 149, 8, 169, 66 2810 data 213, 1 , 240, 6. 169, 68, 213 1 2820 data208. 12, 1 34, 78, 32, 36, 104 149 2830 data 5, 32. 36, 104, 149, 6. 173. 90

HD CL NE ON JO NK MD KN KL FK

AM PO CD OM BG MD DC IM

LC IM

08 EE PC LD

LD OF NP GK JO AM IL PI NB

2840 data 104. 96, 32. 204, 255, 173, 95, 104 2850data 32, 1 95, 255, 1 73, 94, 104, 32, 195 2860 data 255, 162. 205, 169, 205, 32. 21. 104 2870data 176, 13, 160, 3, 173. 9 1 , 104, 145 2880 data 251 , 136, 173, 92, 104, 145,251, 162 2890data210, 169, 1 95, 32, 2 1 , 104, 176, 7 2900data 160, 3, 1 73, 90, 104, 145, 251 , 1 69 2910 data 124, 133, 253, 169, 0, 133,254,169 2920data 135, 133, 251 , 1 69, 104, 133, 252, 162 2930data 18, 160, o. 32, 69, 104, 169, 0 2940data 133, 198, 96, 1 34, 87, 133. 88, 152 0, 165. 45, 166, 46, 134 2950data 72. 160. 2960 data 252, 133,251, 228, 48, 208, 4, 197 2970data 47, 240, 25, 1 65, 87, 209, 251, 208 2980 data 8, 1 65, 88,200,209 251 240, 1 5 2990data 136, 24, 165,251 105, 7, 1 44, 225 3000 data 230,252, 208, 221, 56, 1 76, 1. 24 3010 data 104, 168, 166, 87, 1 65. 88, 96, 32 3020 data 2 1 , 104, 169, 0, 176, 24. 132. 87 3030 data 160, 2. 177,251, 240. 14, 200, 177 3040 data 251, 133, 253, 200, 177, 251, 133, 254 3050data 160, 0, 1 77, 253, 164, 87, 96, 165. 3060 data 198, 240, 35, 169, o. 133, 198, 173 3070data 119, 2, 72,201 , 1 34, 240, 17, 201 3080data 136, 208, 18, 104, 205, 1 1 9 , 2, 208 3090 data 234. 72, 169, o. 133, 198, 240, 243 3100 data 169. 255, 141, 90, 104, 104, 96, 32 3 1 1 0 data 33. 104, 166, 78. 173. 90, 104, 48 7, 240, 64, 165, 253, 149 3120 data 68, 181, 3130 data 8, 165, 254, 149, 9, 160, 0,181 3140 data 5, 145, 253.200. 181, 6, 145. 253 3150 data200, 181, 7, 145, 253, 56, 101, 253 3160 data 133. 253, 169, o. 1 0 1 . 254, 133, 254 3170 data 1 8 1 , 12, 229, 253, 133,253, 181, 13 3180 data 229, 254, 133, 254, 144, 10. 201. o 3190 data208. 1 1 , 165, 253, 201, 85, 176, 5 3200data 169, 253, 1 4 1 , 90, 104, 96, 164, 78 9, o 3210 data 185, 8, 0. 133, 253, 185, 3220data 133, 254, 1 62, 253. 32, 63, 104, 182 3230data 1 , 224, 66, 208. 28, 32, 36, 104 3240 data 32, 36, 104. 32, 36, 104, 153, 5 3250 data 0, 32, 36, 104. 1 53, 6, 0, 185 3260 data 0, 0, 240, 94, 162, 0, 240, 127 3270data 96. 185, 7, 0. 224, 65, 208, 4 3280 data 169, 1 , 208, 18, 224, 88,208, 14 3290 data 182, 2. 224, 67, 208, 6, 201, 0 3300 data240, 2, 105, 0, 182, 1 , 24, 121 o. 153, 5, 0, 144, 3310 data 8. 169 5, 3320data 0, 1 2 1 , 6, 0, 153. 6, 0, 224 3330 data 68, 208. 39. 162, 0, 32, 36. 104 3, 145, 253, 32, 72 3340 data 176, 69, 160, 3, 133 3350data 104, 1 62. 0 , 1 6 1 , 251, 41, 3360data 251 , 1 62, 1 , 228, 251, 240, 48, 32 3370data 36, 104, 176, 43, 200, 145, 253, 232 3380data208, 241 , 182, 3, 1 42, 126, 104, 1 82 3390 data 2, 224, 76, 208, 42, 162. 0, 160 3400data 3, 32, 36, 104, 1 76, 17, 145, 253 3410 data200, 232, 236, 126, 104,208,242, 205 3420 data 126, 104, 1 4 1 , 126, 104, 16, 24, 164 3430data 78, 150, 7, 96,164, 78, 169, 254 3440 data 1 4 1 , 90, 104, 153, 0, 0, 96, 224 3450 data 70, 208, 20, 160, 3, 162, 0, 32 3460 data 36, 104, 176, 227, 145, 253. 200. 232 3470data236, 126, 104, 144, 242, 176, 216, 1 85 3480data 4. 0, 1 4 1 , 127, 104, 224. 67, 208 3490 data 28, 160, 3, 162, o. 32. 36. 104

1-----------------------TM Transoctot'

---

July 1917: Volume I, Issue 01

â&#x20AC;˘

JN EJ LM JO DP LD IM PB CK LF LD HB BF AH BL NE DE AH KM KG LG EK OJ FN JN FO

DB JO HB CL DB HD MB EJ LL Ml CL HH BD FK HM AG GE Gl KK JM PJ CD PG AG DF EK KB NP IL

NJ BA KD PK II MM NO IF JM

CH PI AI IF BG

3500 data 176, 197. 145, 253, 200, 236, 127, 104 5, 205, 126, 1 04, 240, 184, 232 3510 data 144, 3520 data 208, 235, 202, 208, 178, 224, 77, 208 3530 data 179, 160, 3, 162, 0, 32, 36, 1 04 3540 data 176, 165, 145, 253, 200, 236, 127, 104 8, 45, 126, 104, 205, 126, 104 3550 data 144, 6, 232, 208, 232, 202, 208, 143 3560 data 240, 3570data 232, 208, 140, 1 38, 72, 152, 72, 164 3580 data 78, 56, 185, o, 0, 208, 59, 185 3590data 14, 0, 217, 15, 0, 144, 10, 185 3600 data 16, 0, 240, 40, 32, 89, 1 1 2 , 176 3610 data 41, 24, 1 85, 12. o. 121. 14, o 0, 105, 0, 133 3620 data 133, 87, 185, 13, 3630 data 88, 32, 75, 104, 162, 0, 1 6 1 , 87 364Qdata 133, 87, 32, 75, 104, 1 52, 170, 246 3650 data 14, 24, 144, 6, 169, 1 , 153, 0 3660 data 0, 56, 104, 168, 104, 170, 165, 87 3670 data 96, 32, 81, 104, 32, 78, 104, 1 42 3680 data 104, 104, 1 4 1 , 105, 104, 185, 17, 0 3690data 32. 81 , 1 04, 32, 78,104,142,107 3700 data 104, 141, 108, 104, 152, 72, 32, 204 371 0 data 255, 1 74, 94, 104, 32, 201, 255, 160 3720data 0, 185, 97, 1 04, 240, 6, 32, 168 3730 data 255, 200, 208, 245, 32, 174, 255, 32 3740 data 39, 104, 208, 80, 1 74, 95, 104, 32 3750 data 198, 255, 104, 168, 32, 165, 255, 153 3760 data 16, 0, 32, 183, 255, 208, 65, 32 3770 data 165, 255, 153, 17, 0, 32, 183, 255 3780 data 208, 54, 169, 0, 153, 14, 0, 162 3790 data 254,217, 16, 0, 208, 3, 182, 17 3800 data 202, 150, 15, 1 52, 72, 185, 12. o 3810 data 133, 89, 185, 13, 0, 133, 90, 134 3820data 87, 1 60, 0, 32, 1 65, 255, 145, 89 3830 data 32, 183, 255, 4 1 , 1 91 , 208, 5, 200 3840 data 196, 87, 208,239, 170, 104, 168, 138 3850 data 153, o. o. 32, 1 7 1 , 255, 185, o 3860 data 0, 240, 1 , 56, 96, 32, 183, 255 3870data208, 53, 174, 94, 104, 32, 1 98, 255 3880 data 160, 0, 32, 165, 255, 153, 194, 104 3890 data 200, 201, 13, 208, 245, 140, 193, 104 3900data 32, 204, 255, 173, 194, 104, 13, 195 3910 data 104, 201, 48, 208, 12, 169, 32, 160 3920 data 100, 136, 153, 194, 104, 208,250, 240 3930 data 6, 174, 193, 104, 32, 57, 104, 96 3940 data 166, 78, 56, 1 8 1 , 10, 245, 8, 133 3950 data 82, 1 8 1 , 1 1 , 245, 9, 144, 2 1 , 56 3960 data 166, 79, 181, 10, 229, 80, 133, 83 3970data 1 8 1 , 1 1 , 229, 8 1 , 144, 6, 165, 82 3980 data 197, 83, 240, 73, 238, 91, 104, 208 3990 data 3, 238, 92, 104, 174, 96, 104, 32 4000 data 201 , 255, 166, 78, 224, 94, 208, 25 4010 data 32,216, 1 1 3 , 162, 124, 181 , 16, 21 4020 data 17. 240, 39, 173, 90, 104, 48, 31 4030data 32, 181 , 1 13, 32, 230, 1 1 3 , 76, 151 4040data 1 1 3 , 32, 230, 113, 162, 124, 181, 16 4050 data 21, 17. 240, 14, 173, 90, 104, 48 4060 data 6, 32. 1 8 1 , 1 1 3, 32. 216, 1 1 3 , 32 4070 data 169, 1 1 3 , 32,204, 255, 96, 169, 1 3 4080 data 1 4 1 , 194, 104, 1 62, 1 , 32, 57, 104 4090 data 96, 32. 1 58, 113, 1 69, 61, 32. 1 83 4100 data 1 1 3 , 32, 158, 113, 96, 169, 45, 1 62 41 1 0 data 79, 157, 194, 104, 202, 208,250, 169 4120 data 32, 141, 194, 104, 169, 13, 141, 18 4130 data 105, 1 62, 81 , 1 73, 96, 104,201, 3 4140 data 208, 2, 162, 40, 32, 57, 104, 96 4150 data 166, 78, 1 8 1 , 8, 133, 85, 1 8 1 , 9

The Transactor

LA Fl GO Ml HJ Kl JL BN JB CM LN ON

BA AC IH FP LF CA Ll JC HH KL AD PD NK

EL LH LL PO KK DO

EM PO DP AE

JC LD Dl GF KN BF

MJ Fl LN EM KO PK LP HA MN MC CB AK ON HB

4160 data 133, 86, 32,244, 1 1 3, 96, 166, 79 4170 data 165, 80, 133, 85,165, 8 1 , 1 33, 86 4180 data 32,244, 1 1 3 , 96, 1 8 1 , 10, 133, 82 4190 data 181, 1 1 , 133, 83, 1 8 1 , 1 , 1 4 1 , 82 4200 data 114, 32, 27. 104, 173, 90, 104, 48 4210 data 58, 56, 165, 85, 229, 82, 165, 86 4220 data 229, 83, 144, 47, 173, 82, 1 1 4, 201 4230 data 65, 240, 26, 201, 66, 240, 17, 201 4240 data 68, 240, 8, 32, 1 58, 1 13, 32, 54 4250 data 104, 240, 16, 32, 51, 104, 208, 1 1 4260 data 32, 48, 104, 240, 6, 32, 158, 1 13 4270 data 32, 45, 104, 162, 82, 32, 63, 104 4280data 76, 1 , 1 1 4 , 173, 82, 1 1 4 , 201, 66 4290 data 240, 7, 201, 68, 240, 3, 32, 158 4300data 1 1 3, 96, 0, 173, 8, 1 15, 72, 173 4310 data 1 00, 1 1 4, 1 4 1 , 8, 1 15, 32, 48, 1 04 4320data 104, 1 4 1 , 8, 1 15, 96, 32, 208, 1 1 4 4330 data 32, 75, 104, 160, 1 , 1 77, 82, 170 4340 data 136, 177. 82, 32, 75, 104, 32, 84 4350 data 104, 160, 5, 185, 87, 0, 153, 194 4360data 104, 136, 16, 247, 1 60, 2, 32, 75 4370data 104, 177, 82, 32, 75, 104, 1 4 1 , 200 4380data 1 1 4 , 141 , 202, 1 1 4 , 200, 173, 200, 1 1 4 4390 data 240, 45, 173, 205, 114, 133, 253, 173 4400 data 203, 1 1 4 , 141, 201 , 1 1 4, 32,247, 1 1 4 4410 data 32, 87, 1 04, 32, 1 01 , 1 1 5, 206, 202 4420 data 1 14, 240, 5, 206, 201, 1 1 4 , 208, 237 4430 data 1 74, 204, 114, 134, 253, 169, 13, 32 4440 data 1 0 1 , 1 1 5, 32, 57, 104, 208, 206, 96 4450 data 0, o. o. o. 0, 0, o. o 4460 data 169, 0, 141, 206, 1 1 4 , 1 4 1 , 207, 1 1 4 3, 240, 6, 169 4470 data 173, 96, 104, 201, 4480 data 64, 162. 8, 208, 4, 169, 32. 162 4490data 7, 1 4 1 , 203, 1 14, 142, 205, 1 1 4 , 24 4500data 109, 205, 1 14 , 1 41 , 204, 114, 96, 174 4510 data 206, 1 1 4 , 208, 38, 206, 200, 114, 32 4520 data 75, 104, 177. 82, 32, 75, 104, 200 4530 data 1 74, 207, 1 1 4 , 208, 28, 201, 255, 240 4540 data 24, 201, 128, 144, 20, 32, 56, 1 1 5 4550 data 202, 138, 24, 109, 202, 1 1 4, 14 1 , 202 4560 data 1 1 4, 232, 202, 142, 206, 1 1 4, 1 89, 1 1 0 4570data 104,201, 34, 208, 10, 72, 173, 207 4580 data 1 1 4, 73, 1, 1 4 1 , 207. 114, 104, 96 4590 data 56, 233, 127, 170, 152, 72, 160, 255 4600data 169, 158, 133,251 , 169, 1 60, 1 33, 252 4610 data 200, 177, 251, 16, 251, 202, 208, 248 4620data 4 1 , 127, 1 57, 1 1 0 , 104, 232, 136, 192 4630data255, 240, 4, 177,251, 16, 243, 142 4640 data 206, 1 1 4 , 1 04, 168, 96, 166, 253, 157 4650 data 194, 104, 232, 134, 253, 96, 32, 75 0 4660 data 104, 160, 5, 177, 82, 153, 87, 4670 data 136, 16, 248, 32, 75, 104, 169, 1 4680 data 133, 253, 165, 88, 32, 187, 1 1 6, 165 4690 data 87, 32, 187, 1 1 6, 169, 45, 32, 200 4700 data 1 1 6, 169, 8, 133, 253, 1 64, 89, 165 4710 data 90, 32, 187, 116, 136, 240, 23, 230 4720data253, 1 65, 91 , 1 4 1 , 178, 1 1 6 , 32,187 4730 data 1 1 6 , 136, 240, 10, 230, 253, 165, 92 4740 data 1 4 1 , 179, 1 16, 32, 187, 1 1 6 , 169, 20 4750data 133, 253, 165, 90, 32, 72, 104, 1 60 4760data 0, 177,251 , 1 33, 93, 200, 177,251 4770 data 32, 200, 1 1 6 , 192, 3, 208, 246, 230 4780 data 253, 165, 89, 201, 1 , 240, 85, 1 69 8, 36, 93, 208, 18, 169, 48, 37 4790 data 4800 data 93, 240, 86, 201, 16, 240, 21, 165 4810 data 89, 201. 2, 240, 8 1 , 208, 49, 169

July 1987: Volume 8, Issue 01

Fl AP NC EC CM BF NB ME PL

HM JF CG GP LO GH KH PJ AO AN PM FF AF FL MN KP KD CC NO NC

MH NN

BL EJ GN JJ JD

DA lA

PJ MJ GO HM PC NO EJ

CK GB PB FN MF

OH AK El

BJ JF GL KH

4820 data 40, 4830 data 240, 4840 data 87, 4850data 88, 4860data 9 1 , 4870 data 88,

32, 200, 68, 208, 133, 87, 165, 87, 16, 7, 24, 165,

1 1 6, 36, 169, 101, 165, 88,

1 65, 89,201, 2 24, 169, 2, 101 o. 1 0 1 . 88, 133 9 1 , 36, 9 1 , 133 88,233, 0, 133 105, 0, 133, 92

KM MK MD KC EM PK Ml IM FB FH AI JP LC GO BG LK AC OF OG

4880 data 169, 36, 32, 200, 1 1 6, 165, 92, 32 4890data 187, 1 1 6, 208, 23, 169, 4, 36, 93 4900 data 240, 80, 169, 65, 32, 200, 1 1 6 , 208 4910 data 73, 169, 35, 32, 200, 1 1 6, 169, 36 4920data 32, 200, 1 1 6, 1 65, 9 1 , 32, 187, 1 1 6 4930 data 169, 48, 37, 93, 201, 48, 208, 1 6 4940data 1 69, 64, 36, 93, 240, 23, 169, 44 4950 data 32, 200, 1 1 6 , 169, 88, 32, 200, 1 1 6 4960 data 169, 8, 36, 93, 240, 28, 169, 41 4970 data 32, 200, 1 1 6, 208, 2 1 , 169, 8, 36 4980 data 93, 240, 5. 169, 4 1 , 32, 200, 1 1 6 4990 data 169, 44, 32. 200, 1 1 6 , 169, 89, 32 5000 data 200, 1 1 6 , 1 69, 34, 133, 253, 169. 60 5010data 32, 200, 1 1 6, 164, 89, 165, 90, 32 5020 data 180, 1 1 6 , 136, 240, 15, 1 73, 178, 1 1 6 5030 data 32, 180, 1 1 6 , 136, 240, 6, 173, 179 5040 data 1 1 6 , 32, 180, 1 1 6, 169, 62, 32, 200 5050 data 1 1 6 , 169, 13, 32, 200, 1 1 6, 32, 57 5060 data 104. 96, 0, 0, 32, 87, 104, 32 5070data200, 1 1 6 , 96, 32, 78, 1 04, 72, 138 5080 data 32,200, 1 1 6 , 104, 32,200, 1 1 6 , 96 5090 data 166, 253, 157, 194, 104, 232, 134, 253 5100 data 96, 32, 98, 1 1 7 , 1 60, 1 , 1 32, 253 5 1 1 0 data 32. 1 7 1 , 1 1 7 , 160, o, 32, 1 71 , 1 1 7 5120 data 160, 2, 32, 75, 104, 1 77, 82, 32 5130 data 75, 1 04, 1 4 1 , 93, 1 1 7 , 200, 1 40, 92 5140 data 1 1 7, 172, 92, 1 1 7 , 169, 6, 133, 253 5150 data 173, 93, 1 1 7 , 240, 94, 56,237, 95 5160 data 1 1 7 , 170, 1 76, 8, 174, 93. 1 1 7 , 142 5170 data 95, 1 1 7 , 162, 0, 142, 93, 1 1 7 , 174 5180 data 95, 1 1 7 , 142, 94, 1 1 7 , 230,253, 32 5190 data 137, 1 1 7 , 173, 94, 1 1 7 , 208, 246, 174 5200data 96, 1 1 7 , 134, 253, 169, 60, 32, 209 5210 data 1 1 7, 1 74, 95, 1 1 7, 142, 94, 1 1 7, 173 5220 data 92, 1 1 7 , 140, 92, 1 1 7 , 168, 32, 193 5230 data 1 1 7, 206, 94, 1 1 7, 208, 248, 174, 97 5240 data 1 1 7 , 202, 134, 253, 169, 62, 32, 209 5250data 1 1 7 , 169, 13, 32, 209, 1 1 7 , 32, 57 5260data 104,169, 32, 157, 194, 1 04, 202, 1 6 5270 data 250, 48, 150, 96, 0, 0, 0, 0 3, 240 5280 data 0, o. 173, 96, 104, 201, 5290data 16, 169, 1 6 , 1 4 1 , 95, 1 1 7, 169, 50 5300data 1 4 1 , 96, 1 17, 169, 68, 1 4 1 , 97, 1 1 7 5310 data 96, 169, 8, 1 4 1 , 95, 1 1 7 , 1 69, 28 5320data 1 4 1 , 96, 1 17, 169, 38, 141, 97, 1 1 7 5330 data 96, 173, 94, 1 1 7 , 201, 5, 144, 3 5340data 32, 147, 1 1 7 , 173, 94, 1 1 7 , 20 1 , 3 5350 data 144, 3, 32, 157, 1 1 7 , 230, 253, 32 5360 data 1 7 1 , 1 17 , 206, 94, 1 1 7, 208, 1 , 96 5370 data 206, 94, 1 1 7 , 32, 75, 104 , 1 77, 82 5380 data 32, 75, 104, 32, 78, 104, 72, 138 5390data 32,209, 1 1 7, 104, 32, 209. 1 1 7 , 200 5400 data 96, 32, 75, 104, 177, 82, 32, 75 5410 data 104. 32, 87, 104, 32.209, 1 1 7 , 200 5420 data 96. 166. 253, 157, 194, 104, 232, 134 5430 data 253, 96, 72, 138, 72, 152, 72, 160 5440 data 0, 185, 194, 104, 32, 210, 255, 169 5450 data 32, 153, 194, 104, 200, 202, 208, 241 5460data 1 04 , 1 68, 104, 1 70, 104, 96, 1 66, 78 5470 data 1 8 1 , 8. 133, 253, 181, 9, 133. 254

The Transactor

00 Kl

BO NJ

LB IK LL KK Cl KL GM AN Ll DB CP NF PE

GH NL AF LB JB

OJ BJ

ML OH DG Gl AM GO GB

DO II

PH NA EJ AN GK GE OH LH

5480 data 166, 79, 1 8 1 , 10, 133, 80, 1 8 1 , 1 1 5490data 133, 8 1 , 1 8 1 , 9, 197, Âˇ81, 48, 44 5500 data 208, 6, 181, 8, 197, 80, 144, 36 5510 data 32, 75, 104, 160, 2, 177, 253, 170 5520 data 232, 177, 253, 209, 80, 208, 6, 202 5530 data 240, 15, 200, 208, 244, 32, 75, 104 5540 data 162, 80, 32, 63. 104, 166, 79, 208 5550 data 209, 32, 75, 104, 96, 72, 152, 72 5560 data 164, 78, 185. 10, 0, 24, 245, 0 5570 data 208, 7, 1 8 1 , 1 . 217, 1 1 , 0. 48 5580 data 29, 1 8 1 , 0, 133, 87, 1 8 1 , 1 , 133 5590data 88, 160, 2, 32, 75, 104, 177, 87 5600 data 32, 75, 104, 24, 105, 3, 176, 8 5610 data 1 1 7 , 0, 208, 8, 240, 6, 169, 1 5620 data 24, 1 1 7 , 0, 56, 149, 0, 169, 0 5630data 1 1 7, 1 , 1 49, 1 , 104, 168, 104, 96 5640 data 164, 79, 1 65, 80, 217, 8, 0, 208 5650data 19, 1 65, 8 1 , 2 1 7 , 9, 0, 208, 12 5660data 182, 10, 202, 1 50, 8, 182, 1 1 202 5670 data 150, 9, 208, 83, 162, 80. 32, 63 5680 data 104, 165, 80, 133,251, 165, 8 1 , 133 5690 data 252, 185, 10, 0, 133, 253, 185, 1 1 5700 data 0, 133, 254, 185, 8, 0, 133. 80 5710 data 185, 9, 0, 133, 8 1 , 32, 63, 104 5720data 56, 165, 80, 229, 251, 72. 1 65. 81 5730 data 229, 252, 72, 56, 165, 251, 229, 253 5740 data 133, 87, 165, 252, 229, 254, 133. 88 8, 0 5750 data 185, 8, 0, 229, 87, 153, 5760 data 185, 9, 0, 229, 88, 153, 9, 0 5770data 104, 168, 104, 1 70, 32, 69, 1 04, 1 64 5780 data 78, 182, 10, 202. 1 50, 8, 182, 1 1 5790 data 202, 150, 9. 96, 134, 87, 132, 88 0, 166, 88, 240, 20, 32, 75 5800 data 1 60, 5810 data 104, 177,251, 145,253,200. 208 249 5820 data 32, 75, 104, 230, 252, 230. 254 202 5830 data 208, 236, 165, 87, 240, 15, 32, 75 5840data 104, 177,251, 145, 253, 200, 196, 87 5850 data 208, 247, 32, 75, 104, 166, 87, 164 5860 data 88, 96, 72, 169, 45, 133, 251, 169 5870 data 120. 133, 252, 104, 72. 10, 144, 4 5880 data 230, 252, 230, 252, 10, 144, 2, 230 5890data252, 24, 1 0 1 , 2 51 , 1 33,251 , 1 69, 0 5900 data 1 0 1 , 252, 133, 252, 104, 96. 8, 72 5910 data 165, 0, 9, 1 , 133, 0 165, 1 1 , 133, 1 , 104, 40, 96, 8 5920 data 73, 5930 data 120, 248, 170, 24, 4 1 , 15, 105, 144 5940data 105, 64, 72, 138, 74, 74, 74, 74 5950 data 24, 105, 144, 105, 64, 1 70, 104, 40 8, 120, 248, 134, 87, 132. 88 5960 data 96, 5970data 1 70, 4 1 , 15, 24, 1 05, 0 168, 138 5980data 74, 74, 74, 74, 1 70, 232. 24, 152 5990 data 202, 240, 4, 105, 22, 208 249, 164 6000 data 88, 166, 87, 40, 96, 133, 87, 134 6010 data 88, 1 69, 0, 1 4 1 , 127, 104, 1 4 1 , 128 6020 data 104, 141, 129, 104, 1 20, 248, 1 62, 16 6030 data 6, 87. 38, 88, 173, 127, 104, 109 6040 data 127, 104, 1 4 1 , 127, 104, 1 73. 128, 104 6050 data 109, 128, 104, 1 41 , 1 28, 104. 173. 129 6060 data 104, 109, 129, 104, 1 4 1 , 129 104, 202 6070 data 208. 222, 216, 88, 1 69, 48, 1 4 1 , 126 6080 data 104, 162, 0, 134, 93, 160, 3. 185 6090 data 126. 104, 32, 78, 104, 72, 138, 32 6100 data 4, 120,104, 32, 4, 120, 136,208 6 1 1 0 data 238, 169, 32, 197, 92, 208, 4, 169 6120 data 48, 133, 92, 96, 205, 126, 1 04, 208 6130 data 0. 142 4, 169, 32, 208, 5, 162,

July 1987: Volume a, Issue 01

KE HA HI FF HH

6140 data 126, 1 04, 166, 93, 149, 87, 232. 134 6150 data 93, 96, 201, 32, 144, 1 2 , 2 0 1 , 128 6160 data 144, 10,201, 1 6 1 , 144, 4,201, 255 6170 data 208, 2, 169, 46, 96, 1 , 66, 82 6180 data 75, 122, 79, 82, 65, 1 63, 63 01 6190 data 63, 1 63, 63, 63, 1 63, 63 MK 6200 data 63, 34, 79, 82, 65, 34, 65, 83 KK 6210 data 76, 1 , 63, 63, 63, 1 80, 72 2, 79, 82, 65, KM 6220 data 80, 5, 65, 83 FM 6230 data 76, 1 63, 63, 63, 1 , 63, 63 KN 6240 data 63, 35, 79, 82, 65, 35. 65, 83 EK 6250 data 76, 1 , 63, 63, 63, 18, 66, 80 FN 6260 data 76, 58, 79, 82, 65, 1 . 63, 63 ON 6270 data 63, 1 63, 63, 63, 1 63, 63 FP 6280 data 63, 1 1 4 , 79, 82, 65, 1 1 4 65, 83 MB 6290 data 76, 1 , 63, 63, 63, 1 67, 76 JO 6300 data 67, 5 1 , 79, 82, 65, 1 . 63, 63 GA 631 o data 63, 1 , 63, 63, 63, 1 63, 63 cc 6320 data 63, 1 1 5 79, 82, 65, 1 1 5 65, 83 OP 6330 data 76, 1 63, 63, 63, 35, 74, 83 OA 6340 data 82, 122. 65, 78, 68, 1 . 63, 63 MP 6350 data 63, 1 . 63, 63, 63, 34, 66, 73 JF 6360 data 84, 34, 65, 78, 68, 34, 82, 79 GF 6370 data 76, 1 63, 63, 63, 1 80, 76 Kl 6380 data 80, 2. 65, 78, 68, 5, 82, 79 FD 6390 data 76, 1 , 63, 63, 63, 35, 66, 73 HI 6400 data 84, 35, 65, 78, 68, 35, 82, 79 NF 6410 data 76, 1 63, 63, 63, 18, 66, 77 OG 6420data 73, 58. 65, 78, 68, 1 . 63, 63 OH 6430data 63, 1 63, 63, 63, 1 63, 63 PJ 6440 data 63, 1 14, 65, 78, 68, 114, 82, 79 JL 6450 data 76, 1 . 63, 63, 63, 1 83. 69 01 6460data 67, 5 1 , 65, 78, 68, 1 63, 63 GK 6470 data 63, 1 , 63, 63, 63, 1 , 63, 63 MM 6480 data 63, 1 1 5 , 65, 78, 68, 1 1 5 , 82, 79 CN 6490data 76, 1 , 63, 63. 63, 1 . 82, 84 PL 6500data 73, 122, 69, 79, 82, 1 63, 63 OM 6510 data 63, 1 , 63, 63, 63, 1 . 63, 63 LO 6520 data 63, 34, 69, 79, 82, 34, 76, 83 NN 6530 data 82, 1 , 63, 63, 63, 1 80, 72 PC 6540 data 65, 2, 69, 79, 82, 5, 76, 83 KN 6550 data 82, 1 , 63, 63, 63, 35, 74, 77 DB 6560data 80, 35, 69, 79, 82, 35, 76, 83 PO 6570 data 82, 1 . 63, 63, 63, 18, 66, 86 CB 6580data 67, 58, 69, 79, 82, 1 63, 63 08 6590 data 63, 1 , 63, 63, 63, 1 , 63, 63 ME 6600 data 63, 1 1 4 , 69, 79, 82, 114, 76, 83 PE 661 0 data 82, 1 63, 63, 63, 1 , 67, 76 18 6620 data 73, 5 1 , 69, 79, 82, 1 63, 63 GE 6630 data 63, 1 , 63, 63, 63, 1 63, 63 JH 6640 data 63, 1 1 5 , 69. 79, 82, 115, 76, 83 FG 6650 data 82, 1 82, 84 1 63, 63, 63, AF 6660 data 83, 122, 65, 68, 67, 1 , 63, 63 OG 6670data 63, 1 . 63, 63, 63, 1 63, 63 HI 6680 data 63, 34, 65, 68, 67, 34, 82, 79 Jl 6690data 82, 1 63, 63, 63, 1 . 80, 76 CN 6700data 65, 2, 65, 68. 67, 5, 82, 79 HH 6710 data 82, 1 . 63, 63, 63, 43, 74, 77 PK 6720 data 80, 35, 65, 68, 67, 35, 82, 79 PI 6730 data 82, 1 63, 63, 63, 18, 66, 86 JK 6740 data 83, 58, 65, 68, 67, 1 , 63, 63 OL 6750 data 63, 1 63, 63, 63, 1 63, 63 NN 6760 data 63, 1 1 4, 65, 68, 67, 1 1 4, 82, 79 MO 6770data 82, 1 1 . 83, 69 63, 63, 63, JL 6780data 73, 51 , 65, 68, 67, 1 , 63. 63 GO 6790 data 63, 1 , 63, 63, 63, 1 . 63, 63 •

•

• •

•

The Tranaactor

•

KA MP AO

6800 data 6810 data 6820 data 10 6830 data AE 6840 data CG 6850 data HG 6860 data KB 6870data OG 6880 data FE 6890 data NE 6900 data LE 6910 data NN 6920data MK 6930 data LH 6940 data Ml 6950data FH 6960data JL 6970 data KL 6980 data LK 6990data co 7000 data MO 7010 data NB 7020data FN 7030data AB 7040data FO 7050 data EO 7060 data MO 7070 data HJ 7080 data HE 7090data CB 7100 data 80 7 1 1 0 data DH 7120 data AG 7130 data OE 7140 data EB 7150 data MH 7160 data Gl 7170 data EM 7180 data IF 7190 data KK 7200 data Cl 7210 data Ml 7220 data OJ 7230 data cc 7240 data NN 7250data 7260 data LJ GM 7270 data AA 7280data GP 7290 data ON 7300 data EL 7310 data NB 7320data GC 7330data DH 7340 data IN 7350data LE 7360data DC 7370 data NB 7380 data 00 7390data IK 7400 data KH 7410 data GE 7420 data GG 7430 data 7440 data Cl 1 KH 7450data ...

63, 82, 63, 63, 89, 88, 89, 65, 89, 88, 67, 63, 89, 88, 65, 83, 63, 63, 89, 88, 89, 88, 89, 88, 89, 88, 83, 63,

115, 1. 122, 1 34, 1 1 •

•

1•

35, 1, 58, 1, 114, 1 51, 1 115, 1, 122, 1, 34, 1 2, 1, 35, 1 58, 1, 89, 1 1 4, 88, 1 86, 51 , 1 88, 89, 1 1 5, 88, 1. 89, 122, 1' 63, 89, 34, 67, 1. 89, 2, 88, 1, 89, 35, 1, 67, 69, 58, 1, 63, 63, 1 14, 67, 1, 68, 5 1 , 1 63, 63, 1 1 5, 67, 1' 88, 122, 1. 63, 88, 34, 1 67, 88, 2, 80, 1 88, 35, 67, 1 8 1 , 58, 1. 63, 63, 1 1 4, 67, 1 68, 5 1 , 1 63, 63, 1 1 5, 1, 67,

•

65, 63, 83, 63, 83, 63, 63, 63, 83, 63, 83, 63, 83, 63, 83, 63, 83, 63, 76, 63, 76, 63, 76, 63, 76, 63, 76, 63, 76, 63, 76, 63, 76, 63, 67, 63, 67, 63, 67, 63, 67, 63, 67, 63, 67, 63. 67, 63, 67, 63. 83, 63, 83, 63, 83, 63, 83, 63, 83, 63, 83, 63. 83, 63, 83, 63,

68, 63, 84, 63, 84, 63, 63, 63, 84, 63, 84, 63, 84, 63, 84, 63, 84, 63, 68, 63, 68, 63, 68, 63, 68, 63, 68, 63, 68, 63, 68, 63, 68, 63, 77, 63, 77, 63, 77, 63, 77. 63, 77, 63, 77, 63. 77, 63, 77 63, 66, 63, 66, 63, 66, 63, 66, 63, 66, 63, 66, 63, 66, 63, 66, 63,

67, 115, 1, ·63, 65, 1, 63, 34, 65, 34, 63, 1 63, 1, 63, 35, 65, 35, 63, 18, 65, 1, 63, 1 1 4 65, 50, 1 63, 1 65, 63, 1 65, 1 63, 2, 2. 65, 63, 34, 65, 34, 63, 1. 1, 65, 63, 35 65, 35 63, 18, 1. 65, 63, 1 1 4 65. 50, 63, 1 65, 1. 63. 1 1 5, 65, 1 1 5, 2. 63, 1 80, 63 34. 80, 34, 1, 63. 1 80, 63, 35, 80, 35, 63, 18, 80, 1, 1 63, 80, 50, 63, 1, 80, 1. 1. 63. 80. 1 15, 63, 2, 67, 1, 63, 34, 67, 34, 63, 1 67, 1 63, 35, 67, 35, 63, 18, 67, 1. 1 63, 67, 50, 1. 63, 67, 1 63, 1 67. 1 1 5, 63, 0,

•

82, 63, 63, 83, 83, 68, 84, 83, 83, 66, 63, 83 83, 84, 84, 63, 63, 76, 76, 76, 76, 84, 84, 76, 76, 66, 63, 76, 76, 67, 84, 76, 76, 67, 63, 67, 68, 73, 68, 67, 68, 66, 63, 63, 68, 67, 63, 63, 68, 67, 63, 67, 73, 73, 78, 67, 73, 66, 63, 63, 73, 83, 63, 63, 73, 0

63 63 84 84 69 88 84 84 67 63 84 84 89 88 63 63 68 68 68 68 65 65 68 68 67 63 68 68 76 83 68 68 80 63 80 69 78 .69 80 69 78 63 63 69 76 63 63 69 80 63 80 78 78 79 80 78 69 63 63 78

69 63 63 78

July 1917: VolunM I, Issue 01

Bryce Nesbitt Ber��9�l'ce£� •

PopToFront for the Amiga

Have you ev�r found a corner of a window you wished to work

The handler gazes lightly into the meaning of each input.device

to the front? This utility provides a quick shortcut: simply

the pointer to the active Window & Screen from their known

event that passes by. When the correct one is detected it finds

with, but had to play some sort of electronic shell game to bring it activate any window in any screen by clicking into any part of it,

locations in the lntuitionBase structure, and calls the Intuition

hit left Amiga-F and that window will come forward. PopTo

ScreenToFront() and WindowToFront() routines. The Left

Front is written entirely in 68000 for the Am1ga. In addition to

Amiga-F keystroke is then removed from the input stream.

being a useful utility, the code provides a valuable example of adding a keyboard handler to the system and includes a version of the

;PopToFront (C)1987 Bryce Nesbitt. Unhm1ted free non·e�clusive licence .hereby granted to any sentient being to use or abuse th1s code 1n any way whatsoever provided that this and any other copyright notiCes rema1n fully ,attached and are reproduced n i any Slll'lultaneously d1SIT1buted pnnted maller :and w1th the exceptoo that. Without pnor wnlten pefmiSSJOn. t not .be ut11zed by any ent1ty that has been commonly referred to as Robert W Skyles. Skyles Electnc Works. Jim Drew Regl8 Warren or any organrzatoon founded by, controlled. employmg or prol111ng any such ent,ty, 1\s :offspr,ng or spouses ,Author correspondence, bug or stuptd1ty reports may be dlfected to. Bryce Nesbitt 1712 Mar1n Ave. Berkeley. Ca 94707-2902

• exec_support ' library, a set of routines normally availa

ble only to C programmers. Getting it running The source code in listing I can be

typed mto any editor and

assembled with the Metacomco 68000 assembler. (If you are

•

lazy. a copy is available on the new Transactor Amiga disk). An

icon can be created by modifying an existing icon or type · tool

• using the editor in the system drawer or the workbench disk.

•••••••••••••••••••••••••

To activate PopToFront, double-click on its icon from Work bench or type 'run PopToFront' from the CU. To test it out, push a window to the back with the back gadget, press and hold the

Left Amiga key and tap • F • - the window will pop up to the front Once installed. PopToFront stays resident until the Amiga is turned off. While it is possible to install several PopToFronts at once, no benefit resuIts. How it works The program consists of three parts: The exec...support routines,

Jsrlib

the startup code and the keyboard handler itself. The startup code and exec...support routines exist only to get the handler installed. This is done in three parts:

J111phb

I) The intuillon.library is opened and its address placed in the handler code for later use. Note that since the handler uses it,

the intuition.library s i never closed.

• •••••••••••••••••••••••••

2) The startup code allocates some PUBLIC memory to contain

startup.

the handler PUBLIC is used so that, on a future version of the Amiga with a memory-management unit, there is no possibil ity that the handler will ever be swapped out to disk.

3) Once the handler s i in its new home, the startup code adds it to the handler list by sending to the input.device an 1/0 Request block of type IND...ADDHANDLER Its purpose thus •

NOUST INCLUDE '�ecltypes i' INCLUDE '�ec/mernory.i' INCLUDE 'exec/Interrupts 1' INCLUDE ·�ec110.i' INCLUDE 'hbrarl8Sidosextens1' INCLUDE 'deviCeslinputevents1' INCLUDE 'dev!Cesf111pull' INCLUDE 'lntuitJonfll'ltult,ba on se 1' INCLUDE 'workbenchlstartup.i' ;ef,minates l1nk w1th amiga lib .INCLUDE 'l,blexec_lib.i' ,INCLUDE 'hbldosJ1b.1' ,non-standard, and very speedy! ,INCLUDE 'hblintuitiO"-hb i' ;See exec/exec_hb ' & fd.f,les LIST macro _LV0\1 xref _LVO\1 (a6) J5r endm macro xrel _LV0\1 _LVO\1{a6) ,np endm

fulfilled and errors checked for, it terminates, leaving the handler in place.

CODE move.I suba.l JSrlib move.I moveq move.I bne.s

a1 ,a1 F1ndTask dO,a5 HO,dO pr_CLI{a5),d1 lromCU

;Get THIS task ,Set zero for later :Po1nter to CLI only structure ,II not zero, then save a zero. . .

, II called from Workbench a message wl be sent Th•s wa•ts for •t. ; and saves 1ts poonter to be returned to Workbench tater

•

lea

The Tronaactof

4.a6

pr_MsgPort(aS).ao

July 1917: Volume I, Issue 01

JSrhb lea

jSI'I1b

lromCU

move.l

WartPort pr_MsgPort(aS),aQ ,Message po.nter 111 DO GetMsg d0.-{a7) ,Save message for later. . . [A6-ExecBase][a5•thlstask)

•

move.I

JSrhb

move.I

••••••••••••••••••••••••••••••••

fallcoda portsava

aqur equr equr

IOReqsava

moveq ;---Prepare StdiO-moveq bsr

beq

•

move.l bsr

beq move I

d7 a5 a4

NotWB lntUIName

125.failcoda

;Default fail code

#O,dO

,priority ,(dO• Port]

_CreatePortE ExitToOOS dO,portsave _CreateStdiOE .(a1 •loRequest) e_StdiO a1,10Reqsave

;---Open lllpuldiMCe-,Un1t moveq IO,dO dO,d1 ,Flags move.l devname(pc),ao lea ,(loRequest is in A1) OpenOev1ce ;(dO· zero if ok] JSflib tst.l dO bne e_Open ;---Copy Handler-- IO,dO ,Any versiOn moveq lntUJName(pc),a1 lea Openl!brary ,(dO • Base) JSrlib move.I dO.IBASE+2 ;modlfycode e.Jntut beq.s move.l move I

JSCiib move.l move.l tst.l beq.s lea

moveq

e_tntUI

e..Open e..StdiO

•

'111tuit1on.hbrary',O '1nput.device',O

0,2

,WORO ahgn

•

; port- _CreatePorl(pr�

; dO

dO.b

• •

.FUNCTION Create a nameless message port wtt h a specdl8d prooty.

, (exec/ports �

,RESULT The port po.nter or Z 1 rl an error oocurred ;REGISTERS a6 IS destroyed unless _CreatePortE IS called, , 1n whiCh case a6 must conta1n ExecBasa. ;EXAMPLE. ,Set Pnonty moveq 13,d0 _CreatePort 1sr noport beq.s ;Not enough memory or Signals •

;xref ;xref ,_CreatePort move.l _CreatePortE move.l move b move.I

moveq

JSrhb move I tst.l beq.s moveq jsrhb moveq cmp.l bnes move.I

IMEMF_PUBLIC,d1 AJiocMem dO.a2 ,locatiOn of block

dO,a1

dO e_nomem Start(pc),aO

I((DownEnd-Start)/4),d 1 ;Length tn LONGS (aO)+ ,(a1) + ,Copy handleno Pubhc Memory

moveq

JSChb

cp_nomemory addq.l moveq

bras

_CreatePort _CreatePortE 4,a6

a2.-{a7) d0,-{a7) IMEMF..PUBLIC+ MEMF_CLEAR,d1 #MP_SIZE.dO AJiocMem dO,a2 dO cp_nomemory 1-1,d0 AllocSignal .dO -return #-1,d1 dO,d1 ;-1 1nd1Cates bad SlQnal cp_S!Qok a2,a1 IMP_SIZE.dO FreeMem 12.a7 :Unpush byle IO,dO ;set z • 1 cp...xrt

move b dO,MP_SIGBIT(a2) move b #PA_SIGNAL,MP_FLAGS(a2) move.b #NT_MSGPORT,LN_TYPE(a2) move b (a7) +.LN_PRI(a2) suba.l a1,a1 ;a1•0/Findthlstask jsrlib FindTask ;[dO •this task) move.l dO,MP_SIGTASK(a2) lea MP_MSGLIST(a2),aQ ,Poot to hst header NEWUST ao ,lnlt new st li macro move.l a2.d0 · move.I (a7) + ,a2 ;cc s NOT affected . • •• •

rts

exec_support/OeletePort

•••

•

move.I JSChb move.I bsr bsr

10Reqsave,a1 CloseDevice IOReqsave,a1 _OeleteStdiOE portsave,a1 _DeletePortE

move.I beq.s

(a7) + ,d6 NOIWB

move.I

•••••••••••••••••••••••••••••••

EXJt ToOOS

,Set '18Jlat • code

e..nomem a_DolO

move.I rts dc.b dc.b cnop

ReplyMsg d7,d0

.message potnter

;.... exec_supporVCreatePort •••

fDownEnd-Start.dO

move I d1,copytp dbra .68010 Loop mode• ;---Prepare IOReq wtth proper addressesHandlercode-Starl(a2).ao ;offset + memblock lea move.l ao,IS_OATA(a2) ,unused move.l ao,IS_CODE(a2) ;where code IS lea PopName-Start(a2),aO ,optiOnal ascii name move.l ao,LN..NAME(a2) ;---Send ADDHANDLER-move.l 10Reqsave,a1 move w IIND...ADDHANOLER,IO_COMMANO(a1) move.l a2,10...DATA(a1) ;(IOReq tn a1) ,dO • (IOReq-80) JSrhb DolO dO tst.t bne s e..OoiO .zero•ok' IO,d7 ,set return code to zero moveq

copylp

devname

JSrhb

4.86 Forbid d6.a1

,_OeletePorl(por1) 81 . ;FUNCTION. Deletes the port by first setting some ; f1elds to 1llegal values then calling FreeMem ;RESULT none ,REGISTERS· a6 IS destroyed unless _OeleteStdiOE IS called, 1n whiCh case a6 must contaln ExecBase •

(a7)+ •message d7• returncode

,If saved potnter IS zero. exit to CU.

,xret ;xref

Return the startup message to the parent Workbench tool The forbod IS needed so Workbench can't UnloadSeg() the code too early.

_DeletePort 66

move I

_Dele t e Por t

_OeletePortE 4,86

Jllly 1917: Volume •• ··-01

_OeletePortE move.l

a1.-(a7) moveq 1-t,dO move.b dO,LN_TYPE(a1) move.I dO.MP_MSGLIST + LH_HEAD(at) ,Clear upper 3/4 of dO moveq IO.dO move b MP_SIGBIT(a1 ).dO FreeSognal jS(Irb move.I (a7)+.a1 moveq IMP_SIZE.dO FreeMem ,nplib

;Compare class AND subclass. $0100 IS a combinatiOn Of IECLASS..RAWKEY ;for le_Ciass and IECLASS_NULL for te_SubClass beq.s move.I bne.s rts

move I andt.w

hurcle1

hurdle! (aO),dt MoreEvents

;Get }18..NextEvent( pointer ,Ifany.

,8Xll (w•th no changes made) te_Code(aO).d1 ;Code & Oualrter. l%0001000 1 1 1 1 11011.d1

.Mask off the bits of the qualfter field that we do not care about These are IEOUALIFER..RELATIVEMOUSE. _MULTIBROADCAST, _INTERRUPT

,loStdReq-CreateStdiO(IOReplyPort) dO ; at

•

Funcoo t : Alocate a loRequest block of standard SIZe .Example: m011e.l MyPOI't,dO _CreateStdiO ; JSf badnews beq.s ,

_CAPSLOCK. _LBUTTON. _RBUTTON and _MBUTTON

•

:xref :xref _CreateStdiO move.l _CreateStdiOE move.I moveq move.I s j rlib move.I tsU

nomem ,• • •

beq.s move b move.I rts

_CreateStdiOE _CreateStdiO 4,86 d0,-(87) IIOSTO_SIZE.dO IMEMF_PUBLIC+ MEMF_CLEAR,d1 AllocMem dO,et dO

cmp1l

,The upper word of thiS companson ($0023) IS the RAW key code for 'F'

, the lower IS IEOUALIFIEFLLCOMMAND beq.s Keeplooktng move.! bne.s rts

•

cmpiW

•

cmpt.l

•

.FUNCTION Deletes an ioStdReq by seltii'IQ some ftelds to legal values then caDIIlQ FreeMem. RESULT: none REGISTERS a6 IS destroyed unless_OeleteStdiOE 1s called, Ill which case a6 must contaill ExecBase ;xref _OeleteStdiO :xref _OeleteStdiOE _DeleteStdiO move.! 4,a6 ,Get ExecBase _OeleteStdiOE moveq 11-t.dO ;Set telds f to ilegal value move.b dO.LN_TYPE(at) move.! dO,IO_OEVICE(a1) move.I dO.IO_UNIT(a1) moveq *IOSTO_SIZE.dO jmplib FreeMem

Start

1nts

ltlle

cnop

0,4

·--

------

;LONG wOI'd altgn

,Move th1s event's �e_NextEvent potnter to that of the previOUs event. ; thereby unlinl<ing thiS one from the chan move I move.! bra.s

move I cmpt.w

The Tron10etor

(aO).(a1) d0,-(a7) hurdle3

,Move pointer to NEXT to prevoos ,Po.nter to be passed back ,Go dOll •

.The poonter to the currently ac\ive Screen and WindoWS are available at a positive offset from the IntUitiOn base po111ter These wil be brought to the front. Note that 11 may not be proper under the Amoga system to ; do th1s 1n the actual handler. It may be safer to have another task , lying around 1n the background to do the actual work. The descnptlon ; of the Intuition W1ndowToFront commands indiCates that 11 w�l not ta.ke effect until the NEXT 1nput event. whiCh (of course) Will not happen ; until th1s one ex1ts. ·

•

hurdle2 hurdle3 IBASE

.This IS an 1nterrupt structure (exec/interrupts.i) de.l 0 ;succ dc.l 0 ,pred deb 0 1noscreen ,type 51 ,Pnonty (One step h.gher than ln tu tion) de b ,Name del 0 de.l 0 .Data dc.l 0 ;Code

,When the handler is entered ao will pc��nt to a linked hst of tnpul ; events olthe type defllled n the 1ncude file (deviCesflllPUtevent.•) :When done mangling the lllput sueam 11 returns a new poonter tn dO ,Note All references to (80) below refer to le_NextEvent(aO) The : offset equates to zero and was elminated fOI' eff.c:tency : Handlercode

bnes

,Temporary for unlinking aO,e1 ;Look here next. d 1,80 IS0100.18_Ciass(a0) KeepLOOklng JB..Code(a0).d1 l%0001000 1 1 1 1 11011.d1 l$00230,040 d1 KeeplookJng

•

·------------------•

move.! move.I bne.s move.I and1w

_DeleteStdiO(IOStdReq) a1

:Seeabove . ;See above. . . :ex1t (no changes)

;MoreEvents handles the case where several events may be linked and can extract one of them from the middle.

IINT_MESSAGE.LN_TYPE(a1) (a7) + ,MN_REPLYPORT(at)

exec_suppori/DeleteStdiO

hurdte2 (aO).d1 MoreEvents

•

MoreEvents

nomem

1$00230,040 d1

move.l move.I move.! move.I beq.s move.I JSrlib move.I beq.s move I JSfhb move.l move.I

,Unlink ftrst event. )ie_NextEvent( (80).-(a7) a6,-(a7) IIO,a6 ,Self-modrly1ng-> lntUitlonbase goes here •b..ActiveScreen(a6).d0 1noSCfeen dO.ao ScreenToFront tb..ActtveWilldow(a6).dO 1nowtndow dO,aO WindowToFront (a7)+ .86 (87} + .dO ,POtl'lter to new. shorter ll'lput stream

deb

'PopToFront'.O 0.4 .Pad out to Longword boundary

rts

PopName OownEnd

cnop

END

;Save pomter to start of cha1n aO.dO N$0100,1e_Ctass(a0)

July 1917: Volume t, lnue 01

•

TrapSnapper:

Adding A Trap Handler to Yot•r C PrograttlS by Chris Zamara and Nick Sullivan

That bug in your program could cost you a visit from the Guru. . TrapSnapper helps keep the oldgeezer at bay! If you've spent any amount of time with the Amiga, you are probably not unfamiliar with the following message: "Software Error - Task Held. Click on Cancel to Reset/Debug". Thiss i an annoying message. If you accept the invitation to "Click on Cancel", you'll reset the machine, bringing down not only the task that failed but any others you may have going at the time. You can ignore the message, if you want (providing you have Workbench up or access to an extra CLI), but the "Software Error" requester keeps coming relentlessly back every time you swap disks or shuffle windows. Furthermore, all visible traces of the program that died - like its windows and screens - will still be around, getting in your way and using up memory. •

There's a way to deal with software errors, at least in your own programs, but before we get into that let's look at what these errors are and why the Amiga handles them as it does.

Tasks, Traps and Exceptions As you probably know, the programs that you run on the Amiga are

treated as separate tasks under Exec, which is the name given to the set of operating system routines that are responsible lor multitasking, device, library and I/0 management. Only one task can have control of the CPU at any one instant of course; that task s i said to be in the "running" state. Other tasks will at the same time be either "waiting" for their turn at the CPU, or lying dormant ("sleeping") until they are awoken by an external event such as a mouse movement, keypress, or timer signal. Sleeping tasks require only a tiny proportion of processor time to service. If its wake-up event never comes, such a task could sleep for ever without perceptibly affecting the operation of the ma chine. One difficulty with a multitasking system is that any task in the running state can crash due to a bug in the program. Since there may be other, viable, tasks in the system when this occurs, it is important that they should be allowed to continue unhindered if at all possible. This is where a Software Error differs from a Guru Meditation Error - Software Errors are polite bugs that don't step on outside tasks; Gurus are barbarian bugs that destroy everyone else along with themselves. Software Errors are actually detected by the microprocessor itself, not by the operating system. In 68000 jargon, they are called "exceptions", for they are conditions that the processor cannot handle by ordinary means. An example is the undefined result of a division by zero, using one of the 68000 divide instructions DIVS or DIVU. If this operation is requested (usually by accident), the 68000 does not know how to proceed, and invokes an exception.

containing a copy of the Condition Code Register (CCR), and a long word containing the value of the program counter, which for most exceptions is the address of the instruction following the one that caused the exception. On the case of certain exceptions, other data are also pushed, but we'll get to that later.) Finally, control is turned over to an exception-handling routine that is accessed via a table of vectors keyed to the "exception number'' of the exceptional condition. For example, division by zero s i exception 5; hence, its exception routine is entered through vector number 5 of the table. It is at this point that Exec takes over. Exec pushes a long-word on the stack corresponding to the exception vector number- this is called the trap number. (In Amiga jargon, the term "exception" has been appropriated to another purpose, and exceptions are known as "traps", from the exception-generating TRAP and TRAPV instructions of the 68000 - see the list of trap numbers at the end of this article). It then branches through a vector that is specific to the task that caused the exception. Unless this vector has been changed by the task itself, it points to the default trap handler. Since Exec cannot on its own know what actions would be appropriate to take to rescue a given task from a given exception, its default handler does nothing more than put the task to sleep (permanently), and put up the "Software Error" requester to tell the user what is going on and provide him or her with the opportunity to reset if desired. Any resources (primarily RAM) allocated to the errant task remain allocated, and there is no reasonable way of getting them back. However, it is not very difficult to create and enable your own trap handling routine in a program that you write, and there are considera ble advantages to doing so. For one thing, you can provide a graceful exit in the event that your program bombs out; more importantly, you can hand back your allocated RAM to the system, to be made available to other tasks. You can close any windows or screens that the program may have opened so that they don't continue to get in the way and use up memory. You also avoid the "Software Error" message that will otherwise be haunting you until you reset your machine. There is a slight risk involved: if the event that caused the trap had trashed your handler code before the 68000 intervened, you're off to Guru City; this risk is small enough to be acceptable. We now have to consider how to write a handler routine that will get you through the trap and into your de-allocation code, and how to link this routine into the system so that it will be invoked when a trap occurs. We will outline what we believe to be the simplest approach to this problem in the following sections. Writing a Trap-Handler

At this stage, several things happen. The 68000 goes into "supervisor" mode, which enables the status register (SR) and several privileged opcodes, and switches over to the supervisor stack from the user stack. Six bytes of data are pushed onto the supervisor stack: a word

The Transactor

As described above, the 68000's behaviour during a trap involves

entering supervisor mode, pushing the CCR and the program counter, and jumping into the system handler code through a vector. If this were

JuJy 1987: Volume I, Issue 01

the Commodore 64 rather than the Amiga, the obvious approach would be to change that vector to point to our own code. In a multitasking system, however, we can't take that kind of liberty; if we did, any task that encountered a trap would end up using the handler written for our task alone. (Besides, we'd have to change not just one, but all the vectors in the table - one for each kind of trap.) Instead, we have to use another vector, one that is specific to our task. This is provided in the "Task Control Block", a structure that Exec maintains for each task in the system. A task can get a pointer to its task control block (a "Task" structure) by calling the Exec function "FindTask( )" with a parameter of zero. Once we have the pointer to our task control block, we can change the member called "tc...TrapCode" to point to the code to be executed when an exception occurs. •

Changing tc...TrapCode to point to our own routine is very simple. Unfortunately, we can't leave it at that, because our trap code will be executed from within a CPU exception, and trap routines, like interrupt routines, are limited in their capabilities. For example, trap or interrupt code can't call any function that requires multitasking to do its job - this includes "print!( )", commonly used inC programs to print text to the console. Another problem is that during an exception, the stack pointer (A7) points to the supervisor stack, not our task's private user stack, and we don't want to go messing with the supervisor stack (usually). Finally, an exception handler must end with an RTE instruction (ReTurn from Exception), but we probably want to finish execution of our cleanup routine with an 'Exit( )', to remove our process (Amiga DOS's higher-level view of our task) from the system.

As you may have guessed, now comes the fun part where you get to find the solution to these problems. What we have to do is exit from our exception code with an RTE instruction, and then have control passed to our special cleanup and exit code. To do that, we have to "mess with the system stack", which, as you may have heard before, you usually don't want to do. In this case, the saved address of the program counter on the stack can be modified so that when the RTE instruction is executed, the CPU will run the program of our choice (the cleanup routine) instead of continuing with the nasty code that caused the exception in the first place. Before the RTE, we have to pull the trap number from the stack, which the system trap handler put there for us. This tells us why the CPU generated the exception - the list of possible trap numbers appears at the end of this article. A small complication is that the exceptions for "bus error" (trap number 2) and "address error" (trap number 3) push an extra 8 bytes of data onto the supervisor stack. One way to handle this in the trap code s i by checking the trap number and advancing the stack pointer past the 8 bytes for trap numbers less than 4. Another issue that should be addressed by a truly general trap handler s i the fact that other members of the 68000 microprocessor family arrange their stacks differently on an exception. Some Amiga users are replacing their 68000s with a 680 I 0 or even a 68020 for added speed. The Amiga's operating system is designed to work with these CPUs, and so should application software, if possible. The trap code could check the CPU type (Exec provides a field for this purpose in the ExecBase structure) and adjust the stack pointer accordingly.

(i) Change the program counter on the stack to point to your "clean up and exit" routine. (ii) pull the trap number from the stack (iii) perform an RTE instruction to exit the exception handler and pass control to the clean up function. •

Your "clean up and exit" function should free any memory your task allocated, close any screens, windows, fonts, libraries, devices, etc. that it opened, and then call "exit( )" (from C) or the equivalent to end and kill the task.

Our Solution: TrapSoapper Lucky for you, all of this has been done for you in the short program presented here called "TrapSnapper". TrapSnapper s i set up for C language trap handling, which takes a bit more set-up than doing it in assembler, since there is some code that has to be in assembler. All you need to do to put a decent trap-handler in your program is: 1) Put a structure template declaration at the start of your file or in a header file that you *include (see listing) 2) Declare an instance of that structure at the top of your file and initialize it with I 5 words making up a short machine language routine (see listing). 3) Call the function SetTrap( ) early in the program's execution to initialize the trap handler. The C code presented here is a simple program that shows how to do this, and demonstrates the elfectiveness of the trap handler by general· ing two kinds of CPU exceptions that would normally result in a Software Error. The program itself just takes the argument supplied on the command line (when the program is invoked from the CLQ and converts it to an integer. If the value is 1, the program forces an address error by attempting to read a word (16 bits) from an odd address. If the value is not 1, the program tries to divide the value into 100- causing a divide by zero exception, of course, if the value entered was zero. If this program was compiled without the call to SetTrap( ), it would cause a software error if it was run and given zero or one as an argument. As it stands. with the TrapSnapper in place, it just prints a warning message and the trap number, and exits gracefully, removing tiself from the system without a trace. Here's how the trap code works in C. The initial trap code must be in assembler so that we can access the stack pointer A7 directly and perform an RTE instruction. To do this in C, the machine code is set up as a static array of words and a pointer to this array is put into the Task structure's "tc_TrapCode" member. The machine code needs a pointer to the clean up code (the CleanUpAndExit( ) function in this example), and a place to store the trap number. These long-words are stored immediately before the machine code itself through the use of the "TrapData" structure defined at the beginning of the program. Include this structure template declaration at the top of your file or in a header file that you "include. The assembly code appears as comments in the C listing for TrapSnap per. The code is fairly straightforward: it pulls the trap number from the stack and stores it in the MyTrap structure where the C code can get at it; adjusts the stack pointer if the trap number was less than 4 to allow for bus and address errors; then replaces the program counter on the stack with the address of the clean-up routine (which was put in the MyTrap structure by the SetTrap( ) function). Finally, it ends with an

So, to recap the above,

the following steps are required to have your task clean up and leave gracefully when a CPU exception occurs:

•

I) Call FindTask( ) to get a pointer to the task's "Task" structure. _Ta r pCode" member of the Task structure to point to 2) Change the "tc a short machine language routine that does the following: The Transactor

July 1917: Volume I, luue 01

RTE instruction. As you may recall, we mentioned that the excepon it

stack frame was CPU-dependent, and a general trap-handler should work for the 680 I0 and 68020 as well as the 68000. Well, we're good at giving advice, but this trap-handler sn't i that general. Sorry, 680 I 0/ 68020 users, if this routine doesn't work on your machine. An instance of a TrapData structure (MyTrap) is then declared and initialized - this is where the machine language is created. The pointer to the clean-up code will be put into this structure by the SetTrap( ) function.

I•• TrapSnapper From The Transactor • • ThiS program shows an aasy way to handle CPU exceploos from • a C program. Just Include lhe structs below, and put your error • message and/or cleanup code en the lunctoo CleanUpAnctEx•t( ) •

long TrapNum. tnt (

CodeX l: · USHORT Mlcode(13);

The SetTrap() function finds the pointer to the task's Task control block,

then puts a pointer to the trap machine code into the "tc_TrapCode" member. f.inally, it puts a pointer to the function called CleanUpAn dExit( ) into the TrapData structure called MyTrap. The CleanUpAndExit( ) function is where all of the clean-up code for the program goes In this case, it just prints a message and performs the C function exit( ) (The DOS Exit( ) function could be used instead.) It also prints the exception that was encountered by looking at the TrapNum member of the MyTrap structure. In a more typical program, the CleanUpAndExit function would close any Intuition screens and windows that the program had opened, free any memory it had allocated (including graphics memory like rasters). and close open fonts, devices, and libraries. In short, anything that the program would do to clean up after itself before it exits should be done in CleanUpAn dExit( ). Whether you fully understand the details of the trap handler or not, you can easily add 11 to your own Cor assembler programs Every program should have its own trap handler to spare the user from the plague of the Software Error when things go wrong. You can't always guarantee that a program is free of bugs, but with TrapSnapper, at least you can make them less harmful. U.t ol Trap Numben: 2 - Bus Error externally generated signal from Amiga Hardware

(

a supervisor-state operaon it was attempted in user state 9 - lnttructJoo trace generated after each instruction while in trace mode 10- 1010 Emulator an

op-code starting with the bit-pattern 1010 was encountered

(

I • commented �bier code is below� • 1 • errnum� OS L .below code Will put trap number here ,poenter to clean-up roubne goes here • errfunc: OS L 1 ,pun trap number ott stack • start MOVE.L (An + ,00 • errnum.AO .force PC-relative addr mode LEA • MOVE.L OO,(AO) ,puttrap II in errnum for C • check tor bus or address etror CMP L 13,00 .� trapS (4 or greater) • BHI o1hef • AOOO IS,A7 slop extra info on stack • other. MOVE L errfunc(PC).2(An .pOint PC on stack to user routene ,exit from trap-handler • ATE •I .

extern .nt CleanUpAnctExrt( ); I• your clean-up function •I

mam (argc.

In( argc;

an op-code starting with the bit-pattern

argv)

char •argvf )

}

int n1, n2; int 12, ·11 • 1,

SetTrap( ); If (argc I

}

(

•

I• set up trap handler •I 2)

pmtf(. Usage %s <n>\n • • 81gviO)). exit (0). •

n1 - atoi(argv{1) •

I• If 8/g- 1 let's get an address error by referenceng an odd address •I W (n1 1) • •

•11

I• il n1 IS zero we'l get a divide by zero trap •I n2 1001 n1, ,

•

print!(" 100 devlded by %d equals %<1\n ·, n1, n2),

{ SetTrap()

I• ntJalize trap handler •I

}

MyTask • FllldTask(;Ol) MyTask->lc...TrapCode (APTR)MyTrap MLcode; MyTrap. Code CteanUpAndElClt; •

•

{ CleanUpAnctEJCJt ( )

I• warn ot error, free memory, close up everything, and exrt •I

}

11 - 1111 Emulator

I• dean-up routine address - wil be I� en latet •I 0x201F, •I I• MOVE L (An+ .00 I• LEA •-$A,AO •I Ox41FA OxFFF4, I• MOVE L OO.(AO) •I 0x2080. OxBOBC. OXOOO,O OxOOO.O I• CMPL 13.00 •I Ox6202, I• BHI.S • +4 •I OlCS04F. I• ADOO W 118.A7 •I Ol<2F7A, OxFFE8, OX0002, I• MOVE.L errfunc(PC),2(An •I Ox4E73 I• ATE •I NULL,

8 - Privilete violatJoo

I• trap runbef � be stored here •I I• poenlet 1o user trap hancier function •I I• trap-hander machene codegoes hate •I

struct TrapData MyTrap - }

3 - Add.reu Error word or longword instruction attempted at odd address 4 - 111egal lnttructJon a meaningless op-code was encountered 5 - Division by zero the source operand of a DIVS or DIVU instruction was zero 6 - CHK l.natructioo operand of a CHK instruction fell outside of specified bounds 7 TRAPV lnstructJoo overflow (V) set when a TRAPV instruction was executed

••

1 1 1 1 was encountered

pmtf( ·Hey- watch Ill If I weren t a sophlstleated\n ). print!( · Transactor program, I WOIJd have bombed outl\n ) •

print!(·{The problem was. f gol a trap number %1d)\n MyTrap TrapNum), •

•

32 through 47- TRAP l.natructJooa

ex1t(O);

•

{ 70

Jvly 1917: Volume I, laue 01

•

Amiga Dispatches by Tim Grantham. Toronto, Ontario

i required, no worry about FCC is required. no power supply s i necessary. But there are a couple ol and CSA RFI standards s factors in the 1OOO's favour. First, Zorro card makers will be competing with Commodore; makers of expansion units for the I 000 will not. Second, the 500 will have almost the same 86-pin expansion slot as the

1000:

the differences would tnvolve only minor changes to I 000 expansion products - an incentive for manufacturers to main tain their 1000 product lines. Finally, there are still 150,000 1 000's out there - not a bad market. I think that, after some shake-out, we will see plenty of products for the 1000 still available. Furthermore, I believe we will

see

expansion boxes

for both the 500 and 1 000 that wtll let one plug in Zorro cards,

I'm sure that by now you have all pored over the numerous

and perhaps even the so-called Bridge and PC cards, designed

articles describing the new Amiga 2000. 1'm pleased to see that it

for the 2000.

is pretty much as I described in this column several months ago,

also believe there will be continuing demand for the

1000,

with the exception of the lesser amount of RAM. I hope to have an evaluation unit soon, and then I will file my own report. The

though obviously not as much as there has been. The detach

are

able keyboard and internal power supply are better than their

essentially the same machine as the I 000, with the same OS, the

counterparts on the 500 And peripherals like the Genlock and

same chips, and the same software. Only the packaging is

Digiview are currently only available for the

fundamentally different.

the 1000 will fade out of the pteture, but certainly not in the same fashion as such orphans as the PC Jr. or the 128K

Amiga 500 (at $649 US) and the 2000 (at $1 499

What

US)

I do find particularly intriguing about the 2000 are slots

1000. Eventually

Macintosh.

that apparently will enable one to upgrade the machine to not

Software News

only faster CPUs like the 68020 and 68881 , but also to newer versions of the custom graphics chips. The latter. as I have

Dropping around at an Amiga dealer's store,

was surprised again by the quantity and quality of the software available for the

mentioned in previous columns, will provide access to larger amounts of video RAM and higher resolutions.

Arniga. But even more will come along as the 500 opens up the Not much is known about the 500, except that it s i intended to

home market, and the2000 finds a niche for itself in the business

provide competition lor the Atari I 040 and is packaged in a very

and scientific world.

similar style, with a built-in disk drive, non-detachable key board and, for another $ I 50 US, I

meg. of RAM and a real-time

At the Club-Amiga meeting here in Toronto, John Skeel, Vice President of marketing for Aegis Development, demoed their

clock/calendar.