When doing jacobians of nonlinear systems, the inames used for
a given sum factorization kernel output depend on the accumulation
context.

We havent got a nonlinear sumfact test case so far, so this one did not break.
test coming soon.

By using loopys group mechanism. Each sum factorization kernel
defines a group that conflicts with all other sum factorization
groups.

Conflicts:
	python/dune/perftool/sumfact/realization.py
	python/dune/perftool/sumfact/vectorization.py

Save all stage 1 sum factorization kernels that are used in
accumulation expression in the cache during the dry run. Discard all
inactive sum factorization kernels in decide_vetorization_strategy.

We recently learned that usage of sub_elements in UFL is ambiguous...

It will be necessary to correctly do fastdg for systems

Make anisotropic quadrature order possible for non DG examples.

- Use TensorProductElement in one example.

- We still use the sumfact option to swicth to the sum factorization
  code branch. This way it is still possible to easily swicth between
  sumfact and non sumfact code.

- Only TensorProductElements with the same degree in all directions
  will work. Anisotropie and adaption of quadrature rule will happen
  in the next commits.

The y ar enot properly implemented right now, do not seem
to be necessary and conflict with recent changes in loopy.

The old Python2 vs. Python3 problem: non-deterministic hash produces the best bugs!!!

The introduction of FunctionView turned out to be a major problem
with more complicated forms. The original idea was to preserver the
structure of the finite element in a way, that loops over components
of a mixed element are realized by actual loops (treating them with
free indices and such). However, this causes quite some nightmares and
was never implemented as generically as needed (I even doubt that is
possible).

However, there is another option, which is to unroll any such loops
on a symbolic level. While this may sound like a bad idea at first
there is some really positive aspects about it:
* ListTensor and ComponentTensor nodes collapse completely (and would
  otherwise have a big nightmare potential)
* Symbolic zeroes do not generate code - important in hyperbolic problems
  where the system matrices are quite sparse or for axiparallel grids,
  where geometric quantities have many zeroes.
* The compiler would unroll these small loops anyway.
* TSFC (and I guess also FFC) do it the same way.

Implementing this required me to redo the form splitting algorithm.
I rethought it and integrated it into the main ufl->loopy visitor.