fitabmon.gml

开放源码的编译器open watcom 1.6.0版的源代码

.ix 'intrinsic function' DLGAMA
.ix GAMMA
.ix ALGAMA
.ix DLGAMA
.note LGAMMA &generic.
R&arrow.LGAMMA(R),
D&arrow.LGAMMA(D)
.note ALGAMA
R&arrow.ALGAMA(R)
.note DLGAMA
D&arrow.DLGAMA(D)
.endnote
.*
.cp 18
.section Error Function
.*
.begnote $setptnt 12
.note Definition:
.mono erf(a)
.nameuse
.ix 'generic function' ERF
.ix 'intrinsic function' ERF
.ix 'intrinsic function' DERF
.ix ERF
.ix DERF
.note ERF &generic.
R&arrow.ERF(R),
D&arrow.ERF(D)
.note ERF
R&arrow.ERF(R)
.note DERF
D&arrow.DERF(D)
.endnote
.*
.cp 18
.section Complement of Error Function
.*
.begnote $setptnt 12
.note Definition:
.mono 1-erf(a)
.nameuse
.ix 'generic function' ERFC
.ix 'intrinsic function' ERFC
.ix 'intrinsic function' DERFC
.ix ERFC
.ix DERFC
.note ERFC &generic.
R&arrow.ERFC(R),
D&arrow.ERFC(D)
.note ERFC
R&arrow.ERFC(R)
.note DERFC
D&arrow.DERFC(D)
.endnote
.*
.cp 18
.section Lexically Greater Than or Equal
.*
.begnote $setptnt 12
.note Definition:
a1>=a2
.nameuse
.ix 'intrinsic function' LGE
.ix LGE
.note LGE
L&arrow.LGE(CH,CH)
.note Notes:
.im finote9
.endnote
.*
.cp 18
.section Lexically Greater Than
.*
.begnote $setptnt 12
.note Definition:
a1>a2
.nameuse
.ix 'intrinsic function' LGT
.ix LGT
.note LGT
L&arrow.LGT(CH,CH)
.note Notes:
.im finote9
.endnote
.*
.cp 18
.section Lexically Less Than or Equal
.*
.begnote $setptnt 12
.note Definition:
a1<=a2
.nameuse
.ix 'intrinsic function' LLE
.ix LLE
.note LLE
L&arrow.LLE(CH,CH)
.note Notes:
.im finote9
.endnote
.*
.cp 18
.section Lexically Less Than
.*
.begnote $setptnt 12
.note Definition:
a1<a2
.nameuse
.ix 'intrinsic function' LLT
.ix LLT
.note LLT
L&arrow.LLT(CH,CH)
.note Notes:
.im finote9
.endnote
.*
.cp 18
.section Binary Pattern Processing Functions: Boolean AND
.*
.begnote $setptnt 12
.note Definition:
.mono iand(i,j)
Boolean AND
.nameuse
.ix 'generic function' IAND
.ix IAND
.ix 'intrinsic function' IAND
.ix IAND
.ix 'intrinsic function' I1AND
.ix I1AND
.ix 'intrinsic function' I2AND
.ix I2AND
.note IAND &generic
I&arrow.IAND(I,I),
I1&arrow.IAND(I1,I1),
I2&arrow.IAND(I2,I2)
.note IAND
I&arrow.IAND(I,I)
.note I1AND
I1&arrow.I1AND(I1,I1)
.note I2AND
I2&arrow.I2AND(I2,I2)
.endnote
.*
.cp 18
.section Binary Pattern Processing Functions: Boolean Inclusive OR
.*
.begnote $setptnt 12
.note Definition:
.mono ior(i,j)
Boolean inclusive OR
.nameuse
.ix 'generic function' IOR
.ix IOR
.ix 'intrinsic function' IOR
.ix IOR
.ix 'intrinsic function' I1OR
.ix I1OR
.ix 'intrinsic function' I2OR
.ix I2OR
.note IOR &generic
I&arrow.IOR(I,I),
I1&arrow.IOR(I1,I1),
I2&arrow.IOR(I2,I2)
.note IOR
I&arrow.IOR(I,I)
.note I1OR
I1&arrow.I1OR(I1,I1)
.note I2OR
I2&arrow.I2OR(I2,I2)
.endnote
.*
.cp 18
.section Binary Pattern Processing Functions: Boolean Exclusive OR
.*
.begnote $setptnt 12
.note Definition:
.mono ieor(i,j)
Boolean exclusive OR
.nameuse
.ix 'generic function' IEOR
.ix IEOR
.ix 'intrinsic function' IEOR
.ix IEOR
.ix 'intrinsic function' I1EOR
.ix I1EOR
.ix 'intrinsic function' I2EOR
.ix I2EOR
.note IEOR &generic
I&arrow.IEOR(I,I),
I1&arrow.IEOR(I1,I1),
I2&arrow.IEOR(I2,I2)
.note IEOR
I&arrow.IEOR(I,I)
.note I1EOR
I1&arrow.I1EOR(I1,I1)
.note I2EOR
I2&arrow.I2EOR(I2,I2)
.endnote
.*
.cp 18
.section Binary Pattern Processing Functions: Boolean Complement
.*
.begnote $setptnt 12
.note Definition:
.mono not(i)
Boolean complement
.nameuse
.ix 'generic function' NOT
.ix NOT
.ix 'intrinsic function' NOT
.ix NOT
.ix 'intrinsic function' I1NOT
.ix I1NOT
.ix 'intrinsic function' I2NOT
.ix I2NOT
.note NOT &generic
I&arrow.NOT(I),
I1&arrow.NOT(I1),
I2&arrow.NOT(I2)
.note NOT
I&arrow.NOT(I)
.note I1NOT
I1&arrow.I1NOT(I1)
.note I2NOT
I2&arrow.I2NOT(I2)
.endnote
.*
.cp 18
.section Binary Pattern Processing Functions: Logical Shift
.*
.begnote $setptnt 12
.note Definition:
.mono ishl(j,n)
Logical shift
.nameuse
.ix 'generic function' ISHL
.ix 'intrinsic function' ISHL
.ix ISHL
.ix 'intrinsic function' I1SHL
.ix I1SHL
.ix 'intrinsic function' I2SHL
.ix I2SHL
.note ISHL &generic.
I&arrow.ISHL(I,I),
I1&arrow.ISHL(I1,I1),
I2&arrow.ISHL(I2,I2)
.note ISHL
I&arrow.ISHL(I,I)
.note I1ISHL
I1&arrow.I1SHL(I1,I1)
.note I2ISHL
I2&arrow.I2SHL(I2,I2)
.endnote
.*
.cp 18
.*
.begnote $setptnt 12
.note Definition:
.mono ishft(j,n)
Logical shift
.nameuse
.ix 'generic function' ISHFT
.ix 'intrinsic function' ISHFT
.ix ISHFT
.ix 'intrinsic function' I1SHFT
.ix I1SHFT
.ix 'intrinsic function' I2SHFT
.ix I2SHFT
.note ISHFT &generic.
I&arrow.ISHFT(I,I),
I1&arrow.ISHFT(I1,I1),
I2&arrow.ISHFT(I2,I2)
.note ISHFT
I&arrow.ISHFT(I,I)
.note I1ISHFT
I1&arrow.I1SHFT(I1,I1)
.note I2ISHFT
I2&arrow.I2SHFT(I2,I2)
.note Notes:
.im finote10
.endnote
.*
.cp 18
.section Binary Pattern Processing Functions: Arithmetic Shift
.*
.begnote $setptnt 12
.note Definition:
.mono isha(j,n)
Arithmetic shift
.nameuse
.ix 'generic function' ISHA
.ix 'intrinsic function' ISHA
.ix ISHA
.ix 'intrinsic function' I1SHA
.ix I1SHA
.ix 'intrinsic function' I2SHA
.ix I2SHA
.note ISHA &generic.
I&arrow.ISHA(I,I),
I1&arrow.ISHA(I1,I1),
I2&arrow.ISHA(I2,I2)
.note ISHA
I&arrow.ISHA(I,I)
.note I1ISHA
I1&arrow.I1SHA(I1,I1)
.note I2ISHA
I2&arrow.I2SHA(I2,I2)
.note Notes:
.im finote10
.endnote
.*
.cp 18
.section Binary Pattern Processing Functions: Circular Shift
.*
.begnote $setptnt 12
.note Definition:
.mono ishc(j,n)
Circular shift
.nameuse
.ix 'generic function' ISHC
.ix 'intrinsic function' ISHC
.ix ISHC
.ix 'intrinsic function' I1SHC
.ix I1SHC
.ix 'intrinsic function' I2SHC
.ix I2SHC
.note ISHC &generic.
I&arrow.ISHC(I,I),
I1&arrow.ISHC(I1,I1),
I2&arrow.ISHC(I2,I2)
.note ISHC
I&arrow.ISHC(I,I)
.note I1ISHC
I1&arrow.I1SHC(I1,I1)
.note I2ISHC
I2&arrow.I2SHC(I2,I2)
.note Notes:
.im finote10
.endnote
.*
.cp 18
.section Binary Pattern Processing Functions: Bit Testing
.*
.begnote $setptnt 12
.note Definition:
Test bit - a2'th bit of a1 is tested.
If it is 1, .TRUE. is returned.
If it is 0, .FALSE. is returned.
.nameuse
.ix 'generic function' BTEST
.ix 'intrinsic function' BTEST
.ix BTEST
.ix 'intrinsic function' I1BTEST
.ix I1BTEST
.ix 'intrinsic function' I2BTEST
.ix I2BTEST
.note BTEST &generic.
L&arrow.BTEST(I,I),
L&arrow.BTEST(I1,I1),
L&arrow.BTEST(I2,I2)
.note BTEST
L&arrow.BTEST(I,I)
.note I1BTEST
L&arrow.I1BTEST(I1,I1)
.note I2BTEST
L&arrow.I2BTEST(I2,I2)
.endnote
.*
.cp 18
.section Binary Pattern Processing Functions: Set Bit
.*
.begnote $setptnt 12
.note Definition:
Set bit - Return a1 with a2'th bit set.
.nameuse
.ix 'generic function' IBSET
.ix 'intrinsic function' IBSET
.ix IBSET
.ix 'intrinsic function' I1BSET
.ix I1BSET
.ix 'intrinsic function' I2BSET
.ix I2BSET
.note IBSET &generic.
I&arrow.IBSET(I,I),
I1&arrow.IBSET(I1,I1),
I2&arrow.IBSET(I2,I2)
.note IBSET
I&arrow.IBSET(I,I)
.note I1IBSET
I1&arrow.I1BSET(I1,I1)
.note I2IBSET
I2&arrow.I2BSET(I2,I2)
.endnote
.*
.cp 18
.section Binary Pattern Processing Functions: Clear Bit
.*
.begnote $setptnt 12
.note Definition:
Clear bit - Return a1 with a2'th bit cleared.
.nameuse
.ix 'generic function' IBCLR
.ix 'intrinsic function' IBCLR
.ix IBCLR
.ix 'intrinsic function' I1BCLR
.ix I1BCLR
.ix 'intrinsic function' I2BCLR
.ix I2BCLR
.note IBCLR &generic.
I&arrow.IBCLR(I,I),
I1&arrow.IBCLR(I1,I1),
I2&arrow.IBCLR(I2,I2)
.note IBCLR
I&arrow.IBCLR(I,I)
.note I1IBCLR
I1&arrow.I1BCLR(I1,I1)
.note I2IBCLR
I2&arrow.I2BCLR(I2,I2)
.endnote
.*
.cp 18
.section Binary Pattern Processing Functions: Change Bit
.*
.begnote $setptnt 12
.note Definition:
Change bit - Return a1 with a2'th bit complemented.
.nameuse
.ix 'generic function' IBCHNG
.ix 'intrinsic function' IBCHNG
.ix IBCHNG
.ix 'intrinsic function' I1BCHNG
.ix I1BCHNG
.ix 'intrinsic function' I2BCHNG
.ix I2BCHNG
.note IBCHNG &generic.
I&arrow.IBCHNG(I,I),
I1&arrow.IBCHNG(I1,I1),
I2&arrow.IBCHNG(I2,I2)
.note IBCHNG
I&arrow.IBCHNG(I,I)
.note I1IBCHNG
I1&arrow.I1BCHNG(I1,I1)
.note I2IBCHNG
I2&arrow.I2BCHNG(I2,I2)
.endnote
.*
.cp 18
.section Binary Pattern Processing Functions: Arithmetic Shifts
.*
.begnote $setptnt 12
.note Definition:
.mono lshift(j,n)
Arithmetic left shift
.nameuse
.ix 'generic function' LSHIFT
.ix 'intrinsic function' LSHIFT
.ix LSHIFT
.ix 'intrinsic function' I1LSHIFT
.ix I1LSHIFT
.ix 'intrinsic function' I2LSHIFT
.ix I2LSHIFT
.note LSHIFT &generic.
I&arrow.LSHIFT(I,I),
I1&arrow.LSHIFT(I1,I1),
I2&arrow.LSHIFT(I2,I2)
.note LSHIFT
I&arrow.LSHIFT(I,I)
.note I1LSHIFT
I1&arrow.I1LSHIFT(I1,I1)
.note I2LSHIFT
I2&arrow.I2LSHIFT(I2,I2)
.endnote
.*
.begnote $setptnt 12
.note Definition:
.mono rshift(j,n)
Arithmetic right shift
.nameuse
.ix 'generic function' RSHIFT
.ix 'intrinsic function' RSHIFT
.ix RSHIFT
.ix 'intrinsic function' I1RSHIFT
.ix I1RSHIFT
.ix 'intrinsic function' I2RSHIFT
.ix I2RSHIFT
.note RSHIFT &generic.
I&arrow.RSHIFT(I,I),
I1&arrow.RSHIFT(I1,I1),
I2&arrow.RSHIFT(I2,I2)
.note RSHIFT
I&arrow.RSHIFT(I,I)
.note I1RSHIFT
I1&arrow.I1RSHIFT(I1,I1)
.note I2RSHIFT
I2&arrow.I2RSHIFT(I2,I2)
.note Notes:
.im finote11
.endnote
.*
.cp 18
.section Allocated Array
.*
.begnote $setptnt 12
.note Definition:
Is array A allocated?
.nameuse
.ix 'intrinsic function' ALLOCATED
.ix ALLOCATED
.note ALLOCATED
L&arrow.ALLOCATED(A)
.endnote
.*
.cp 18
.section Memory Location
.*
.begnote $setptnt 12
.note Definition:
Location of A where A is any variable, array or array element
.nameuse
.ix 'intrinsic function' LOC
.ix LOC
.note LOC
I&arrow.LOC(A)
.endnote
.*
.cp 18
.section Size of Variable or Structure
.*
.begnote $setptnt 12
.note Definition:
Size of A in bytes where A is any constant, variable, array, or
structure
.nameuse
.ix 'intrinsic function' ISIZEOF
.ix ISIZEOF
.note ISIZEOF
I&arrow.ISIZEOF(A)
.note Notes:
The size reported for a constant or simple variable is based on its
type.
The size of a CHARACTER constant is the number of characters in the
constant.
The size reported for an array is the size of the storage area
required for the array.
The size reported for a structure is the size of the storage area
required for the structure.
An assumed-size CHARACTER variable, assumed-size array, or allocatable
array has size 0.
.endnote
.*
.cp 18
.section Volatile Reference
.*
.begnote $setptnt 12
.note Definition:
A is a volatile reference
.nameuse
.ix 'intrinsic function' VOLATILE
.ix VOLATILE
.note VOLATILE
A&arrow.VOLATILE(A)
.note Notes:
A volatile reference to a symbol indicates that the value of the symbol
may be modified in ways that are unknown to the subprogram.
For example, a symbol in common being referenced in a subprogram may be
modified by another subprogram that is processing an asynchronous interrupt.
Therefore, any subprogram that is referencing the symbol to determine its
value should reference this symbol using the
.id VOLATILE
intrinsic function so that the value currently being evaluated agrees with
the value last stored.
.endnote