mifr/subsurface
1
0
Fork 0
mirror of https://github.com/subsurface/subsurface.git synced 2025-02-19 22:16:15 +00:00
Code Issues Projects Releases Packages Wiki Activity

Turn tail recursion back into a loop

Browse source 
I still think there should be some way to partition the space
automatically, but the algorithm that worked best was the simple
tail-recursive one.

Which might as well be expressed as a loop.

Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
This commit is contained in:
Linus Torvalds 2011-09-07 16:38:22 -07:00
parent 95a051e164
commit 11641095ae
1 changed files with 10 additions and 15 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

23
profile.c
View file

@ -95,7 +95,7 @@ static void plot_text(struct graphics_context *gc, text_render_options_t *tro,
} }
/* /*
* Find the next maximum point in a 10-minute window. * Find the next minimum/maximum point.
* *
* We exit early if we hit "enough" of a depth reversal, * We exit early if we hit "enough" of a depth reversal,
* which is roughly 10 feet. * which is roughly 10 feet.
@ -164,21 +164,16 @@ static void render_depth_sample(struct graphics_context *gc, struct sample *samp
static void plot_text_samples(struct graphics_context *gc, struct sample *a, struct sample *b) static void plot_text_samples(struct graphics_context *gc, struct sample *a, struct sample *b)
{ {
struct sample *max, *min; for (;;) {
if (b <= a) if (b <= a)
break;
a = next_minmax(a, b, 1);
if (!a)
return; return;
if (b[-1].time.seconds - a->time.seconds < 3*60) render_depth_sample(gc, a);
return; a = next_minmax(a, b, 0);
if (!a)
max = next_minmax(a, b, 1); break;
if (max) {
render_depth_sample(gc, max);
min = next_minmax(max, b, 0);
if (min) {
plot_text_samples(gc, min, b);
return;
}
} }
} }