Type inference prototype based on static analysis #92
Commits on Jun 18, 2016
-
Adds BranchNode for easy operation on branches
Also branch optimization technique is proposed, however it is currently lead to a malformed graph Issue: #32
-
-
-
Refactors GraphWalker to use node colors
This allows us to classify graph edges during graph walk.
-
-
-
-
-
-
Fixes tau optimizer by handling nodes by pairs
Previous version of optimizer merged taus incorrectly. Method which produced error was Interval>>do: Producer1 \ { Aggregator <- Consumer } x 3 / Producer2 \ { Aggregator <- Consumer } x 3 Producer3 / Correct solution should be Producer1 \ / Consumer1 Aggregator - Consumer2 / \ Consumer3 Producer2 \ / Consumer4 Aggregator - Consumer5 Producer3 / \ Consumer6 but due to incorrect handling of pending nodes lists algorithm yielded the following result: Producer1 \ Producer2 - Aggregator <- Consumer x 6 Producer3 / So there was a single aggregator node that was referred by all six consumers. -
-
-
Fixes graph linker in case of assign node first in the domain
AssignX instructions leave their argument on the stack. That was causing problems during processing of argument requests.
-
-
-
Adds order, comparison and composition operators to the Type
It allows to compare any two types, store them in STL container such as std::set, use them as a key in std::map and use composition operators during type inference procedure. Operator | is a disjunction-like operator used to get sum of several possible types within a type. For example: 2 | 2 -> 2 2 | 3 -> (2, 3) 2 | * -> (2, *) (Object) | (SmallInt) -> ((Object), (SmallInt)) This operator may be used to aggregate possible types within a linear sequence where several type outcomes are possible: x <- y isNil ifTrue: [ nil ] ifFalse: [ 42 ]. In this case x will have composite type (nil, 42). On the other hand, when dealing with loops we need some kind of a reduction operator that will act as a conjunction: 2 & 2 -> 2 2 & 3 -> (SmallInt) 2 & (SmallInt) -> (SmallInt) <any type> & * -> * (SmallInt) & (Object) -> * This operator is used during induction run of the type analyzer to prove that variable does not leave it's local type domain, i.e it's type is not reduced to a *. Issue: #17 -
-
Adds meta information to control graph
Meta info is very useful during type analysis. It helps to make decisions based on graph structure. In future, more flags will be added. Issue: #17
-
-
-
Adds temporary solution for several SmallInt primitives
This code need to be refactored properly. In case if both operands are literal, then result may be defined as literal too. Otherwise primitive should "fail" by allowing control flow to pass further. For literal calculation it is best to use existing code for software VM. Issue: #17
-
Collects graph meta info during graph construction
This information is very useful during type inference. It may be gathered on-demand, but that would require additional pass. It is very cheap to collect meta info on the fly, so why not? Issue: #17
-
std::set here is an overkill. Index arrays are at most 10 entries big, unique vector is ok here. Issue: #17
-
Adds inference of the captured context
This logic provides a way to propagate captured context to the block across the call stack and collect types of the temporary variables that may be assigned in the closure block. This information will be used to update the method's control flow graph and introduce nontrivial tau nodes. Issue: #17
-
Commits on Jun 19, 2016
Commits on Jun 20, 2016
Commits on Jun 23, 2016
Commits on Jun 24, 2016
Commits on Jun 26, 2016
Commits on Jun 28, 2016
Commits on Jul 1, 2016
-
-
-
Adds special handling of messages that do not return normally
Some methods like Object>>error: do not return a value in a usual way. In that case control flow is interrupted and all call chain aborts. Type analyzer uses an empty composite type () to mark such special case. Please note that () is not equal to * or ? types that still return a value. Issue: #17 Issue: #92
Commits on Jul 2, 2016
Commits on Jul 5, 2016
Commits on Jul 9, 2016
Commits on Jul 10, 2016
Commits on Jul 17, 2016
Commits on Jul 21, 2016
-
Adds special handling of dynamically inferred blocks
Unlike statically inferred block, dynamic ones need to create and carry their closure environment. Two blocks with the same set of argument types may have different closure types even if their closure context is the same. We add closure types to a dynamic block's cache key and to block function name to disambiguate calls. Issue: #17 Issue: #92
Commits on Jul 25, 2016
Commits on Aug 2, 2016
Commits on Aug 6, 2016
Commits on Aug 12, 2016
Commits on Aug 13, 2016
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.