aboutsummaryrefslogtreecommitdiff
path: root/src/interp
diff options
context:
space:
mode:
authordos-reis <gdr@axiomatics.org>2011-10-30 16:38:47 +0000
committerdos-reis <gdr@axiomatics.org>2011-10-30 16:38:47 +0000
commitd76c902f18d1ee40c52372c37336631c0f81bfc8 (patch)
tree0a79d6ab8b42d9da5cb824f2871b0e355b21296c /src/interp
parentfe017bc0d4dfb95fa051aaa18188506c0857707d (diff)
downloadopen-axiom-d76c902f18d1ee40c52372c37336631c0f81bfc8.tar.gz
* interp/sys-macros.lisp (MKPF1): Tidy.
* interp/sys-constants.boot ($QueryVariables): New. * interp/define.boot ($whreDecls): Remove. (checkRepresentation): Take a DB as first parameter. Adjust Callers. (buildConstructorCondition): New (deduceImplicitParameters): Likewise (compDefineCategory2): Use it. (compDefineFunctor1): Likewise. (typeDependencyPath): Remove. (inferConstructorImplicitParameters): Likewise. * interp/compiler.boot (compTopLevel): Do not bind $whereDecls. (recordDeclarationInSideCondition): Take additional reference parameter to the list of processed decls. Adjust callers. (compWhere): Record any side decls in compilation environment. * interp/c-util.boot (makeCompilationData): Initialize implicit data. (dbParameters): New. (dbImplicitData): New accessor macro. (dbImplicitParameters): New. (dbImplicitConstraints): Likewise. (dbSubstituteFormals): Likewise. (dbSubstituteQueries): Likewise. * interp/database.boot (fixUpPredicate): Tidy. * boot/utility.boot (applySubst): Early exit on identity substitution. (applySubst!): Likewise. (applySubstNQ): Likewise. * boot/ast.boot (bfIS1): Accept pattern matching against Boolean constant true.
Diffstat (limited to 'src/interp')
-rw-r--r--src/interp/c-util.boot35
-rw-r--r--src/interp/compiler.boot17
-rw-r--r--src/interp/database.boot9
-rw-r--r--src/interp/define.boot113
-rw-r--r--src/interp/sys-constants.boot3
-rw-r--r--src/interp/sys-macros.lisp14
6 files changed, 119 insertions, 72 deletions
diff --git a/src/interp/c-util.boot b/src/interp/c-util.boot
index 20230eb9..815d791f 100644
--- a/src/interp/c-util.boot
+++ b/src/interp/c-util.boot
@@ -135,20 +135,47 @@ macro domainData d ==
--% Constructor Compilation Data.
--% Operational Semantics:
--% structure CompilationData ==
---% Record(formalSubst: Substitution)
+--% Record(formalSubst: Substitution,implicits: List Identifier)
--%
++ Make a fresh compilation data structure.
makeCompilationData() ==
- [nil]
+ [nil,nil]
+++ Subsitution that replaces parameters with formals.
macro dbFormalSubst db ==
first dbCompilerData db
-++ Apply the formal substitution or `db'to th form `x'.
-dbSubstituteFormals(db,x) ==
+++ Return source-level parameters of this constructor.
+dbParameters db ==
+ dbConstructorForm(db).args
+
+++ Return implicit parameter data associated to `db'. This
+++ information is active only during the elaboration of the
+++ constructor associated with `db'.
+macro dbImplicitData db ==
+ second dbCompilerData db
+
+++ Return the existential substitution of `db'.
+dbQuerySubst db ==
+ x := dbImplicitData db => first x
+ nil
+
+++ List of implicit parameters to the constructor.
+dbImplicitParameters db ==
+ ASSOCLEFT dbQuerySubst db
+
+dbImplicitConstraints db ==
+ x := dbImplicitData db => second x
+
+++ Apply the formal substitution or `db'to the form `x'.
+macro dbSubstituteFormals(db,x) ==
applySubst(dbFormalSubst db,x)
+++ Apply the query substitution of`db' to the form `x'.
+macro dbSubstituteQueries(db,x) ==
+ applySubst(dbQuerySubst db,x)
+
--%
$SetCategory ==
'(SetCategory)
diff --git a/src/interp/compiler.boot b/src/interp/compiler.boot
index 768e1b5b..4afa3d4f 100644
--- a/src/interp/compiler.boot
+++ b/src/interp/compiler.boot
@@ -98,7 +98,6 @@ compTopLevel(x,m,e) ==
$NRTderivedTargetIfTrue: local := false
$killOptimizeIfTrue: local:= false
$forceAdd: local:= false
- $whereDecls: local := nil
-- start with a base list of domains we may want to inline.
$optimizableConstructorNames: local := $SystemInlinableConstructorNames
x is ["DEF",:.] or x is ["where",["DEF",:.],:.] =>
@@ -943,27 +942,31 @@ compileQuasiquote(["[||]",:form],m,e) ==
++ The form `item' appears in a side condition of a where-expression.
++ Register all declarations it locally introduces.
-recordDeclarationInSideCondition(item,e) ==
+recordDeclarationInSideCondition(item,e,decls) ==
item is [":",x,t] =>
t := macroExpand(t,e)
- ident? x => $whereDecls := [[x,t],:$whereDecls]
+ ident? x => deref(decls) := [[x,t],:deref decls]
x is ['%Comma,:.] =>
- $whereDecls := [:[[x',t] for x' in x.args],:$whereDecls]
+ deref(decls) := [:[[x',t] for x' in x.args],:deref decls]
item is ['SEQ,:stmts,["exit",.,val]] =>
for stmt in stmts repeat
- recordDeclarationInSideCondition(stmt,e)
- recordDeclarationInSideCondition(val,e)
+ recordDeclarationInSideCondition(stmt,e,decls)
+ recordDeclarationInSideCondition(val,e,decls)
compWhere: (%Form,%Mode,%Env) -> %Maybe %Triple
compWhere([.,form,:exprList],m,eInit) ==
$insideExpressionIfTrue: local:= false
$insideWhereIfTrue: local := true
e := eInit
+ decls := ref get('%compilerData,'%whereDecls,e)
u :=
for item in exprList repeat
- recordDeclarationInSideCondition(item,e)
+ recordDeclarationInSideCondition(item,e,decls)
[.,.,e]:= comp(item,$EmptyMode,e) or return "failed"
u is "failed" => return nil
+ -- Remember side declaration constraints, if any.
+ if deref decls ~= nil then
+ e := put('%compilerData,'%whereDecls,deref decls,e)
$insideWhereIfTrue := false
[x,m,eAfter] := comp(macroExpand(form,eBefore := e),m,e) or return nil
eFinal :=
diff --git a/src/interp/database.boot b/src/interp/database.boot
index 8e764e50..b68c659b 100644
--- a/src/interp/database.boot
+++ b/src/interp/database.boot
@@ -455,11 +455,10 @@ fixUpPredicate(predClause, domainPreds, partial, sig) ==
-- merge the predicates in predClause and domainPreds into a
-- single predicate
[predicate, fn, :skip] := predClause
- if first predicate = "AND" then
- predicates := append(domainPreds,rest predicate)
- else if predicate ~= MKQ "T"
- then predicates:= [predicate, :domainPreds]
- else predicates := domainPreds or [predicate]
+ predicates :=
+ predicate is true => domainPreds or [predicate]
+ predicate is ["AND",:.] => [:domainPreds,:predicate.args]
+ [predicate,:domainPreds]
if #predicates > 1 then
pred := ["AND",:predicates]
[pred,:dependList]:=orderPredicateItems(pred,sig,skip)
diff --git a/src/interp/define.boot b/src/interp/define.boot
index 3a6ce68b..e65aec3b 100644
--- a/src/interp/define.boot
+++ b/src/interp/define.boot
@@ -88,9 +88,6 @@ $CapsuleDomainsInScope := nil
$signatureOfForm := nil
$addFormLhs := nil
-++ List of declarations appearing as side conditions of a where-expression.
-$whereDecls := nil
-
++ True if the current functor definition refines a domain.
$subdomain := false
@@ -718,8 +715,8 @@ compDefine(form,m,e) ==
++ per: Rep -> %
++ rep: % -> Rep
++ as local inline functions.
-checkRepresentation: (%Form,%List %Form,%Env) -> %Env
-checkRepresentation(addForm,body,env) ==
+checkRepresentation: (%Thing, %Form,%List %Form,%Env) -> %Env
+checkRepresentation(db,addForm,body,env) ==
domainRep := nil
hasAssignRep := false -- assume code does not assign to Rep.
viewFuns := nil
@@ -740,7 +737,7 @@ checkRepresentation(addForm,body,env) ==
stackWarning('"Consider using == definition for %1b",["Rep"])
return hasAssignRep := true
stmt is ["IF",.,:l] or stmt is ["SEQ",:l] or stmt is ["exit",:l] =>
- checkRepresentation(nil,l,env)
+ checkRepresentation(db,nil,l,env)
stmt isnt ["DEF",lhs,sig,val] => nil -- skip for now.
op := opOf lhs
op in '(rep per) =>
@@ -752,7 +749,7 @@ checkRepresentation(addForm,body,env) ==
viewFuns ~= nil =>
stackAndThrow('"You cannot define both %1b and %2b",["Rep",:viewFuns])
-- A package has no "%".
- $functorKind = "package" =>
+ dbConstructorKind db = "package" =>
stackAndThrow('"You cannot define %1b in a package",["Rep"])
-- It is a mistake to define Rep in category defaults
$insideCategoryPackageIfTrue =>
@@ -773,7 +770,7 @@ checkRepresentation(addForm,body,env) ==
-- Domain extensions with no explicit Rep definition have the
-- the base domain as representation (at least operationally).
else if null domainRep and addForm ~= nil then
- if $functorKind = "domain" and addForm isnt ["%Comma",:.] then
+ if dbConstructorKind db = "domain" and addForm isnt ["%Comma",:.] then
domainRep :=
addForm is ["SubDomain",dom,.] =>
$subdomain := true
@@ -997,6 +994,46 @@ mkCategoryPackage(form is [op,:argl],cat,def) ==
$categoryPredicateList := substitute(nameForDollar,'$,$categoryPredicateList)
substitute(nameForDollar,'$,['DEF,[packageName,:packageArgl],packageSig,def])
+++ Subroutine of compDefineFunctor1 and compDefineCategory2.
+++ Given a constructor definition defining `db', compute implicit
+++ parameters and store that list in `db'.
+deduceImplicitParameters(db,e) ==
+ parms := dbParameters db
+ nonparms := [x for [x,:.] in get('%compilerData,'%whereDecls,e)
+ | not symbolMember?(x,parms)]
+ nonparms = nil => true
+ -- Collect all first-order dependencies.
+ preds := nil
+ qvars := $QueryVariables
+ subst := nil
+ for p in parms for i in 1.. repeat
+ m := getXmode(p,e)
+ ident? m and symbolMember?(m,nonparms) =>
+ stackAndThrow('"Parameter %1b cannot be of type implicit parameter %2pb",
+ [p,m])
+ m isnt [.,:.] => nil
+ q :=
+ isCategoryForm(m,e) => 'ofCategory
+ 'isDomain
+ preds := [[q,dbSubstituteFormals(db,p),m],:preds]
+ st := [[a,:v] for a in m.args for [v,:qvars] in tails qvars
+ | ident? a and symbolMember?(a,nonparms)]
+ subst := [:st,:subst]
+ -- Now, build the predicate for implicit parameters.
+ for s in nonparms repeat
+ x := [rest y for y in subst | symbolEq?(s,first y)]
+ x = nil =>
+ stackAndThrow('"Implicit parameter %1b has no visible constraint",[s])
+ x is [.] => nil -- OK.
+ stackAndThrow("Too many constraints for implicit parameter %1b",[s])
+ dbImplicitData(db) := [subst,preds]
+
+buildConstructorCondition db ==
+ dbImplicitData db is [subst,cond] =>
+ ['%exist,ASSOCRIGHT subst,mkpf(applySubst(subst,cond),'AND)]
+ true
+
+
compDefineCategory2(form,signature,body,m,e,$prefix,$formalArgList) ==
--1. bind global variables
$insideCategoryIfTrue: local := true
@@ -1013,6 +1050,7 @@ compDefineCategory2(form,signature,body,m,e,$prefix,$formalArgList) ==
dbCompilerData(db) := makeCompilationData()
dbFormalSubst(db) := pairList(form.args,$TriangleVariableList)
dbInstanceCache(db) := true
+ deduceImplicitParameters(db,e)
e:= addBinding("$",[['mode,:$definition]],e)
-- 2. obtain signature
@@ -1056,19 +1094,19 @@ compDefineCategory2(form,signature,body,m,e,$prefix,$formalArgList) ==
body:=
["%bind",[[g:= gensym(),body]],
['%store,['%tref,g,0],mkConstructor $form],g]
- fun:= compile [op',["LAM",sargl,body]]
+ fun := compile [op',["LAM",sargl,body]]
-- 5. give operator a 'modemap property
pairlis := pairList(argl,$FormalMapVariableList)
- parSignature:= applySubst(pairlis,signature')
- parForm:= applySubst(pairlis,form)
+ parSignature := applySubst(pairlis,dbSubstituteQueries(db,signature'))
+ parForm := applySubst(pairlis,form)
-- 6. put modemaps into InteractiveModemapFrame
$domainShell := eval [op',:[MKQ f for f in sargl]]
- dbConstructorModemap(db) := [[parForm,:parSignature],[true,$op]]
+ dbConstructorModemap(db) :=
+ [[parForm,:parSignature],[buildConstructorCondition db,$op]]
dbDualSignature(db) :=
- [isCategoryForm(t,e) for t in dbConstructorModemap(db).mmSource]
- dbDualSignature(db) := [true,:dbDualSignature db]
+ [true,:[isCategoryForm(t,e) for t in dbConstructorModemap(db).mmSource]]
dbPrincipals(db) := getParentsFor(db,$FormalMapVariableList)
dbAncestors(db) := computeAncestorsOf($form,nil)
dbModemaps(db) := modemapsFromCategory([op',:sargl],formalBody,signature')
@@ -1299,29 +1337,7 @@ AMFCR_,redefined(opname,u) ==
substituteCategoryArguments(argl,catform) ==
argl := substitute("$$","$",argl)
- arglAssoc := [[INTERNL("#",STRINGIMAGE i),:a] for i in 1.. for a in argl]
- applySubst(arglAssoc,catform)
-
-++ Subroutine of inferConstructorImplicitParameters.
-typeDependencyPath(m,path,e) ==
- ident? m and assoc(m,$whereDecls) =>
- get(m,'value,e) => nil -- parameter was given value
- [[m,:reverse path],:typeDependencyPath(getmode(m,e),path,e)]
- atomic? m => nil
- [ctor,:args] := m
- -- We don't expect implicit parameters in builtin constructors.
- builtinConstructor? ctor => nil
- -- FIXME: assume constructors cannot be parameters
- not constructor? ctor => nil
- [:typeDependencyPath(m',[i,:path],e) for m' in args for i in 0..]
-
-++ Given the list `parms' of explicit constructor parameters, compute
-++ a list of pairs `(p . path)' where `p' is a parameter implicitly
-++ introduced (either directly or indirectly) by a declaration of
-++ one of the explicit parameters.
-inferConstructorImplicitParameters(parms,e) ==
- removeDuplicates
- [:typeDependencyPath(getmode(p,e),[i],e) for p in parms for i in 0..]
+ applySubst(pairList($FormalMapVariableList,argl),catform)
compDefineFunctor(df,m,e,prefix,fal) ==
$domainShell: local := nil -- holds the category of the object being compiled
@@ -1357,6 +1373,7 @@ compDefineFunctor1(df is ['DEF,form,signature,body],
dbConstructorForm(db) := form
dbCompilerData(db) := makeCompilationData()
dbFormalSubst(db) := pairList(form.args,$FormalMapVariableList)
+ deduceImplicitParameters(db,$e)
$formalArgList:= [:argl,:$formalArgList]
-- all defaulting packages should have caching turned off
dbInstanceCache(db) := not isCategoryPackageName $op
@@ -1366,12 +1383,8 @@ compDefineFunctor1(df is ['DEF,form,signature,body],
if null signature'.target then signature':=
modemap2Signature getModemap($form,$e)
$functorTarget := target := signature'.target
- $functorKind: local :=
- $functorTarget is ["CATEGORY",key,:.] => key
- "domain"
$e := giveFormalParametersValues(argl,$e)
- $implicitParameters: local := inferConstructorImplicitParameters(argl,$e)
- [ds,.,$e]:= compMakeCategoryObject(target,$e) or return
+ [ds,.,$e] := compMakeCategoryObject(target,$e) or return
stackAndThrow('" cannot produce category object: %1pb",[target])
$domainShell: local := copyVector ds
attributeList := categoryAttributes ds --see below under "loadTimeAlist"
@@ -1385,22 +1398,24 @@ compDefineFunctor1(df is ['DEF,form,signature,body],
$NRTdeltaListComp: local := nil --list of compiled forms for $NRTdeltaList
$NRTdeltaLength: local := 0 -- =length of block of extra entries in vector
$functionLocations: local := nil --locations of defined functions in source
- -- generate slots for arguments first, then for $NRTaddForm in compAdd
+ -- Generate slots for arguments first, then implicit parameters,
+ -- then for $NRTaddForm (if any) in compAdd
for x in argl repeat NRTgetLocalIndex x
+ for x in dbImplicitParameters db repeat NRTgetLocalIndex x
[.,.,$e] := compMakeDeclaration("$",target,$e)
if not $insideCategoryPackageIfTrue then
$e := augModemapsFromCategory('_$,'_$,target,$e)
$e := put('$,'%form,form,$e)
- $signature:= signature'
- parSignature := dbSubstituteFormals(db,signature')
+ $signature := signature'
+ parSignature := dbSubstituteFormals(db,dbSubstituteQueries(db,signature'))
parForm := dbSubstituteFormals(db,form)
-- 3. give operator a 'modemap property
- modemap := [[parForm,:parSignature],[true,$op]]
+ modemap := [[parForm,:parSignature],[buildConstructorCondition db,$op]]
dbConstructorModemap(db) := modemap
dbCategory(db) := modemap.mmTarget
- dbDualSignature(db) := [isCategoryForm(t,$e) for t in modemap.mmSource]
- dbDualSignature(db) := [false,:dbDualSignature db]
+ dbDualSignature(db) :=
+ [false,:[isCategoryForm(t,$e) for t in modemap.mmSource]]
-- (3.1) now make a list of the functor's local parameters; for
-- domain D in argl,check its signature: if domain, its type is Join(A1,..,An);
@@ -2148,7 +2163,7 @@ compCapsule(['CAPSULE,:itemList],m,e) ==
$insideExpressionIfTrue: local:= false
$useRepresentationHack := true
clearCapsuleFunctionTable()
- e := checkRepresentation($addFormLhs,itemList,e)
+ e := checkRepresentation(constructorDB $form.op,$addFormLhs,itemList,e)
compCapsuleInner(constructorDB $form.op,itemList,m,addDomain('_$,e))
compSubDomain(["SubDomain",domainForm,predicate],m,e) ==
diff --git a/src/interp/sys-constants.boot b/src/interp/sys-constants.boot
index 8349e810..e92391e5 100644
--- a/src/interp/sys-constants.boot
+++ b/src/interp/sys-constants.boot
@@ -272,6 +272,9 @@ $TriangleVariableList ==
$AtVariables ==
[makeSymbol strconc('"@",toString i) for i in 1..50]
+$QueryVariables ==
+ [makeSymbol strconc('"?",toString i) for i in 1..50]
+
++ List of basic predicates the system has a built-in optimization
++ support for.
$BasicPredicates ==
diff --git a/src/interp/sys-macros.lisp b/src/interp/sys-macros.lisp
index 10357fdc..966626d2 100644
--- a/src/interp/sys-macros.lisp
+++ b/src/interp/sys-macros.lisp
@@ -442,20 +442,20 @@
(CAR L))
((CONS 'EXPT L)) ))
(OR
- (COND ((MEMBER 'T L)
- ''T)
+ (COND ((MEMBER T L)
+ T)
((EQL 0 (SETQ X (LENGTH (SETQ L (REMOVE NIL L)))))
NIL)
((EQL 1 X)
(CAR L))
((CONS 'OR L)) ))
(|or|
- (COND ((MEMBER 'T L) 'T)
+ (COND ((MEMBER T L) T)
((EQL 0 (SETQ X (LENGTH (SETQ L (REMOVE NIL L)))))
NIL)
((EQL 1 X)
(CAR L))
- ((CONS 'or L)) ))
+ ((CONS '|or| L)) ))
(NULL
(COND ((CDR L)
(FAIL))
@@ -469,15 +469,15 @@
(|and|
(COND ((EQL 0 (SETQ X
(LENGTH
- (SETQ L (REMOVE T (REMOVE '|true| L))))))
+ (SETQ L (REMOVE T L)))))
T)
((EQL 1 X)
(CAR L))
((CONS '|and| L)) ))
(AND
(COND ((EQL 0 (SETQ X (LENGTH
- (SETQ L (REMOVE T (REMOVE '|true| L))))))
- ''T)
+ (SETQ L (REMOVE T L)))))
+ T)
((EQL 1 X)
(CAR L))
((CONS 'AND L)) ))