aboutsummaryrefslogtreecommitdiffstats
path: root/eval
Commit message (Collapse)AuthorAgeFilesLines
* improve type resolving for 'if'Håvard Pettersen2018-01-198-18/+89
| | | | also verify inferred types against actual result in conformance test
* run cross-language tensor conformance tests using tensor functionsHåvard Pettersen2018-01-1813-54/+59
| | | | also pass tensor engine to tensor function eval function
* run all tests from test_spec as tensor functionsHåvard Pettersen2018-01-181-16/+32
|
* added initial version of make_tensor_functionHåvard Pettersen2018-01-184-0/+325
|
* test new tensor IR nodesHåvard Pettersen2018-01-171-11/+126
|
* added 'const_value' and 'if_node' to tensor IRHåvard Pettersen2018-01-162-12/+83
|
* add 'concat' and 'rename' tensor operationsHåvard Pettersen2018-01-162-41/+137
| | | | also add intermediate Leaf/Op1/Op2 classes
* tweak tensor IR semantics and add more encapsulationHåvard Pettersen2018-01-168-140/+170
|
* move more param stuff to lazy_params.hHåvard Pettersen2018-01-169-36/+41
|
* Use lazy parameters in tensor functions.Håvard Pettersen2018-01-1617-79/+67
|
* move LazyParams to separate fileHåvard Pettersen2018-01-166-12/+44
|
* added test for push_children (tensor IR nodes)Håvard Pettersen2018-01-151-0/+24
|
* tensor function compilation based on bottom-up in-place optimizationHåvard Pettersen2018-01-154-12/+75
|
* separate optimize and compile conceptsHåvard Pettersen2018-01-1510-77/+85
| | | | | | | | optimize: tensor function -> tensor function compile: node tree -> tensor function node trees now contain tensor functions to support direct recursive mixed-mode evaluation.
* Merge pull request #4612 from vespa-engine/balder/some-misc-old-cleanupHenning Baldersheim2018-01-112-17/+13
|\ | | | | Use c++11 for loops and alignment.
| * Avoid using temporaries.Henning Baldersheim2018-01-102-17/+13
| |
* | Merge pull request #4595 from vespa-engine/balder/track-common-cell-indexHenning Baldersheim2018-01-113-66/+93
|\ \ | |/ |/| Balder/track common cell index
| * Put the address back in the combiner.Henning Baldersheim2018-01-103-25/+24
| |
| * Add comment explaining a bit about the right address.Henning Baldersheim2018-01-101-0/+2
| |
| * Move the right address context on the outside.Henning Baldersheim2018-01-103-75/+68
| |
| * Use the same AddressContext for the combinedAddress and compute the ↵Henning Baldersheim2018-01-103-30/+45
| | | | | | | | combinedIdx inline too.
| * Hide the calculation inside the address context.Henning Baldersheim2018-01-091-2/+3
| |
| * Make and address context to keep code together.Henning Baldersheim2018-01-092-30/+47
| |
| * Rename to indicate it refers to right side.Henning Baldersheim2018-01-092-10/+10
| |
* | Revert earlier reorder.Henning Baldersheim2018-01-101-2/+2
| |
* | Use cheap and_modulator instead of prime modulator to avoid costly division.Henning Baldersheim2018-01-102-2/+4
| |
* | Different hashing gives different order.Henning Baldersheim2018-01-101-2/+2
| |
* | Add missing newline at eof and align members.Henning Baldersheim2018-01-101-2/+3
| |
* | Use XXH32 for hashing.Henning Baldersheim2018-01-101-9/+4
|/
* Go back to using a single combiner.Henning Baldersheim2018-01-093-98/+58
|
* Allow for building index on the outside.Henning Baldersheim2018-01-091-1/+4
|
* Use bracesHenning Baldersheim2018-01-091-1/+3
|
* _mutable -> _rightHenning Baldersheim2018-01-092-5/+5
|
* combiner not needed in lambdaHenning Baldersheim2018-01-091-1/+1
|
* Remove unused code.Henning Baldersheim2018-01-092-35/+10
|
* Remove unused code.Henning Baldersheim2018-01-091-25/+0
|
* Initialize membersHenning Baldersheim2018-01-091-1/+4
|
* No need to update the right address, as we update cellIdx inline.Henning Baldersheim2018-01-091-7/+6
|
* Specialize add and mulHenning Baldersheim2018-01-091-0/+12
|
* Update the combined adress inline.Henning Baldersheim2018-01-093-28/+27
|
* Split in 2 methods to avoid if in inner loop.Henning Baldersheim2018-01-092-8/+36
|
* Iterate only the valid dimensions.Henning Baldersheim2018-01-093-6/+109
|
* Combine address in steps to reduce amount of work in inner loop.Henning Baldersheim2018-01-093-5/+28
|
* Inline simple method called in innerloop.Henning Baldersheim2018-01-092-22/+11
|
* Add an inner unconditional reduce to avoid temporary vector.Henning Baldersheim2018-01-092-2/+10
|
* Add newline at eofHenning Baldersheim2018-01-091-1/+2
|
* Move implementation form headerfile to implementationfile.Henning Baldersheim2018-01-094-49/+70
|
* Inline Mul and Add in reduceHenning Baldersheim2018-01-091-0/+6
|
* Unify alignment.Henning Baldersheim2018-01-091-4/+4
|
* Cache the size in a 32 bit variableHenning Baldersheim2018-01-092-8/+10
|