GitLab

Adds a color format that stores 3 channel RGB colors as floats. This is
really only good for z-buffer compositing.

Update finding glfw

See merge request icet/icet!8

For the latest version of the glfw library, you need to find a packaged
named glfw3 (not GLFW).

Fix warnings on MSVC

See merge request icet/icet!5

The GNU compiler is being strict about POSIX compliance. Explicitly
port those things outside of POSIX (like snprintf).

Most of the warnings are about using "unsafe" functions. In addition to
replacing string functions like strcpy with counting strncpy versions,
which makes sense, older MSVC versions for some reason don't support
POSIX versions of these functions. Instead, they have their weird
offshoots, which is a pain.

Fix issues with unused variables

See merge request icet/icet!7

Update the diagnostics macros

See merge request icet/icet!6

The new version now uses variadic template macros to allow you to do
printf-style messages. This is how I wanted it to begin with, but as I
recall variadic templates were not supported on all compilers at the
time I started IceT. At this point, I think they are supported on pretty
much any compiler in the last 10 years.

You have to set up a target property to say the "runtime" should go in
the build directory, which is annoying.

Fix dashboard warning when glut is not found.



See merge request !4

Fix compilation errors

Compilation error on Visual Studio 10 Win 64.
Fix undefined symbol: TEST_NOT_PASSED

See merge request !3

Compilation error on Visual Studio 10 Win 64.
Fix undefined symbol: TEST_NOT_PASSED

Add off-screen rendering through EGL



See merge request !2

Update README

Moving README to README.md and updating formatting.

See merge request !1

When you render a dense image, the load balancing should be pretty
even. At any rate, it probably won't help to shift around pixels when
there are the same amount of pixels everywhere, so ultimately this
is a waste of time.

IceT insists on using sparse images most of the time because they are
almost always better (at least at the beginning part of the
compositing). Add an option to SimpleTiming to draw images that have no
background pixels so that the "sparse" images are equivalent to dense
images. This is done by making the depth of background pixels slightly
above and the opacity never 0.

The camera angles in SimpleTiming are more-or-less perfect for IceT's
image compositing. It is a fairly common case to want to zoom into the
data, especially if there is some intersting detail. This could add
extra work and load imbalance and could make the tests more interesting.

Hopefully this can be used to test odd process group sizes. Randomly
picked group sizes should commonly have large factors.

This is added for comparison purposes only. The telescoping binary swap
(just named binary swap) is generally faster (but maybe not always).

There is now a radix-kr algorithm that should handle odd factors better
than telescoping (plus supports non-power-of-2 factors).

There was an issue with how radix-kr was iterating over images to send
where it was trying to send images that did not exist.

When dealing with a factor that does not divide evenly, there was an
error that made the process in the remainder think it still had an
image.

I had meant to add it earlier, but I did it wrong.

The radix-kr is essentially the radix-k algorithm with some ideas from
2-3 swap added in. Rather than forcing all the k's in radix-k to be
factors, radix-kr allows the k to have a remainder when splitting the
process. The remaining processes participate in that round by splitting
their image and sending them off, but they receive nothing that round
and then go idle. Although this adds some imbalance, it does not add
much. It also makes keeping track of partitions easier than 2-3 swap.

Previously, if a state buffer was needed and the existing one did not
match the size and type exactly, the old buffer was freed and a new
buffer was malloced. However, malloc can be slow and it is possible to
reuse a buffer if the new one being asked for is smaller than the old
one. Thus, change the semantics to use a previously allocated buffer if
it is at least as big as needed. This might leave pools of data larger
than what we need, but will reduce the overall number of malloc calls
needed.

I'm sure this is from a mistaken keypress while navigating the file a
while ago.