2011-09-20 19:40:34 +00:00
|
|
|
/* divelist.c */
|
2013-04-07 03:49:06 +00:00
|
|
|
/* core logic for the dive list -
|
|
|
|
* accessed through the following interfaces:
|
2011-09-22 15:21:32 +00:00
|
|
|
*
|
2013-04-07 03:49:06 +00:00
|
|
|
* dive_trip_t *dive_trip_list;
|
|
|
|
* unsigned int amount_selected;
|
|
|
|
* void dump_selection(void)
|
|
|
|
* dive_trip_t *find_trip_by_idx(int idx)
|
|
|
|
* int trip_has_selected_dives(dive_trip_t *trip)
|
|
|
|
* void get_dive_gas(struct dive *dive, int *o2_p, int *he_p, int *o2low_p)
|
|
|
|
* int total_weight(struct dive *dive)
|
|
|
|
* int get_divenr(struct dive *dive)
|
|
|
|
* double init_decompression(struct dive *dive)
|
|
|
|
* void update_cylinder_related_info(struct dive *dive)
|
|
|
|
* void get_location(struct dive *dive, char **str)
|
|
|
|
* void get_cylinder(struct dive *dive, char **str)
|
|
|
|
* void get_suit(struct dive *dive, char **str)
|
|
|
|
* void dump_trip_list(void)
|
|
|
|
* dive_trip_t *find_matching_trip(timestamp_t when)
|
|
|
|
* void insert_trip(dive_trip_t **dive_trip_p)
|
|
|
|
* void remove_dive_from_trip(struct dive *dive)
|
|
|
|
* void add_dive_to_trip(struct dive *dive, dive_trip_t *trip)
|
|
|
|
* dive_trip_t *create_and_hookup_trip_from_dive(struct dive *dive)
|
|
|
|
* void autogroup_dives(void)
|
|
|
|
* void clear_trip_indexes(void)
|
|
|
|
* void delete_single_dive(int idx)
|
|
|
|
* void add_single_dive(int idx, struct dive *dive)
|
|
|
|
* void merge_dive_index(int i, struct dive *a)
|
|
|
|
* void select_dive(int idx)
|
|
|
|
* void deselect_dive(int idx)
|
2011-09-21 04:29:09 +00:00
|
|
|
* void mark_divelist_changed(int changed)
|
|
|
|
* int unsaved_changes()
|
2013-04-07 03:49:06 +00:00
|
|
|
* void remove_autogen_trips()
|
2011-09-20 19:40:34 +00:00
|
|
|
*/
|
2013-03-20 13:25:09 +00:00
|
|
|
#include <unistd.h>
|
2011-08-31 17:27:58 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
2011-09-04 18:14:33 +00:00
|
|
|
#include <string.h>
|
2011-08-31 17:27:58 +00:00
|
|
|
#include <time.h>
|
2011-09-22 20:45:53 +00:00
|
|
|
#include <math.h>
|
2012-10-11 00:42:59 +00:00
|
|
|
#include <glib/gi18n.h>
|
2012-11-10 18:51:03 +00:00
|
|
|
#include <assert.h>
|
2013-03-10 08:24:49 +00:00
|
|
|
#ifdef LIBZIP
|
|
|
|
#include <zip.h>
|
|
|
|
#endif
|
|
|
|
#ifdef XSLT
|
|
|
|
#include <libxslt/transform.h>
|
|
|
|
#endif
|
2011-08-31 17:27:58 +00:00
|
|
|
|
|
|
|
#include "dive.h"
|
2013-04-07 03:49:06 +00:00
|
|
|
#include "divelist.h"
|
2011-08-31 17:27:58 +00:00
|
|
|
#include "display.h"
|
2013-03-14 03:37:38 +00:00
|
|
|
#include "webservice.h"
|
2011-08-31 17:27:58 +00:00
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
static short dive_list_changed = FALSE;
|
2012-08-30 00:24:15 +00:00
|
|
|
|
2012-11-26 04:06:54 +00:00
|
|
|
dive_trip_t *dive_trip_list;
|
2012-08-08 16:35:38 +00:00
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
unsigned int amount_selected;
|
2012-08-08 16:35:38 +00:00
|
|
|
|
2012-08-16 23:31:53 +00:00
|
|
|
#if DEBUG_SELECTION_TRACKING
|
|
|
|
void dump_selection(void)
|
|
|
|
{
|
|
|
|
int i;
|
2012-08-20 12:48:07 +00:00
|
|
|
struct dive *dive;
|
2012-08-16 23:31:53 +00:00
|
|
|
|
2012-09-18 23:51:48 +00:00
|
|
|
printf("currently selected are %u dives:", amount_selected);
|
2012-08-21 22:51:34 +00:00
|
|
|
for_each_dive(i, dive) {
|
2012-08-20 12:48:07 +00:00
|
|
|
if (dive->selected)
|
|
|
|
printf(" %d", i);
|
|
|
|
}
|
2012-08-16 23:31:53 +00:00
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
dive_trip_t *find_trip_by_idx(int idx)
|
2013-02-19 21:46:37 +00:00
|
|
|
{
|
|
|
|
dive_trip_t *trip = dive_trip_list;
|
|
|
|
|
|
|
|
if (idx >= 0)
|
|
|
|
return NULL;
|
|
|
|
idx = -idx;
|
|
|
|
while (trip) {
|
|
|
|
if (trip->index == idx)
|
|
|
|
return trip;
|
|
|
|
trip = trip->next;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2013-04-07 04:28:03 +00:00
|
|
|
int dive_nr_sort(int idx_a, int idx_b, timestamp_t when_a, timestamp_t when_b)
|
|
|
|
{
|
|
|
|
struct dive *a, *b;
|
|
|
|
dive_trip_t *tripa = NULL, *tripb = NULL;
|
|
|
|
|
|
|
|
if (idx_a < 0) {
|
|
|
|
a = NULL;
|
|
|
|
tripa = find_trip_by_idx(idx_a);
|
|
|
|
} else {
|
|
|
|
a = get_dive(idx_a);
|
|
|
|
if (a)
|
|
|
|
tripa = a->divetrip;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (idx_b < 0) {
|
|
|
|
b = NULL;
|
|
|
|
tripb = find_trip_by_idx(idx_b);
|
|
|
|
} else {
|
|
|
|
b = get_dive(idx_b);
|
|
|
|
if (b)
|
|
|
|
tripb = b->divetrip;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Compare dive dates within the same trip (or when there
|
|
|
|
* are no trips involved at all). But if we have two
|
|
|
|
* different trips use the trip dates for comparison
|
|
|
|
*/
|
|
|
|
if (tripa != tripb) {
|
|
|
|
if (tripa)
|
|
|
|
when_a = tripa->when;
|
|
|
|
if (tripb)
|
|
|
|
when_b = tripb->when;
|
|
|
|
}
|
|
|
|
return when_a - when_b;
|
|
|
|
}
|
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
int trip_has_selected_dives(dive_trip_t *trip)
|
2012-08-20 13:27:04 +00:00
|
|
|
{
|
2013-02-19 21:46:37 +00:00
|
|
|
struct dive *dive;
|
|
|
|
for (dive = trip->dives; dive; dive = dive->next) {
|
2012-08-20 13:27:04 +00:00
|
|
|
if (dive->selected)
|
2013-02-19 21:46:37 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
2012-08-20 13:27:04 +00:00
|
|
|
}
|
|
|
|
|
2013-04-07 04:28:03 +00:00
|
|
|
/* Get the values as we want to show them. Whole feet. But meters with one decimal for
|
|
|
|
* values less than 20m, without decimals for larger values */
|
|
|
|
void get_depth_values(int depth, int *depth_int, int *depth_decimal, int *show_decimal)
|
|
|
|
{
|
|
|
|
int integer, frac;
|
|
|
|
|
|
|
|
*show_decimal = 1;
|
|
|
|
switch (prefs.units.length) {
|
|
|
|
case METERS:
|
|
|
|
/* To tenths of meters */
|
|
|
|
depth = (depth + 49) / 100;
|
|
|
|
integer = depth / 10;
|
|
|
|
frac = depth % 10;
|
|
|
|
if (integer < 20)
|
|
|
|
break;
|
|
|
|
if (frac >= 5)
|
|
|
|
integer++;
|
|
|
|
*show_decimal = 0;
|
|
|
|
break;
|
|
|
|
case FEET:
|
|
|
|
integer = mm_to_feet(depth) + 0.5;
|
|
|
|
*show_decimal = 0;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
/* can't happen */
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
*depth_int = integer;
|
|
|
|
if (*show_decimal)
|
|
|
|
*depth_decimal = frac;
|
|
|
|
}
|
|
|
|
|
2011-12-12 05:28:18 +00:00
|
|
|
/*
|
|
|
|
* Get "maximal" dive gas for a dive.
|
|
|
|
* Rules:
|
|
|
|
* - Trimix trumps nitrox (highest He wins, O2 breaks ties)
|
|
|
|
* - Nitrox trumps air (even if hypoxic)
|
|
|
|
* These are the same rules as the inter-dive sorting rules.
|
|
|
|
*/
|
2013-04-07 03:49:06 +00:00
|
|
|
void get_dive_gas(struct dive *dive, int *o2_p, int *he_p, int *o2low_p)
|
Add capability of custom sorts to divelist columns
.. and use this for the nitrox column, which can now be more complex
than just a single number.
The rule for the "nitrox" column is now:
- we look up the highest Oxygen and Helium mix for the dive
(Note: we look them up independently, so if you have a EAN50 deco
bottle, and a 20% Helium low-oxygen bottle for the deep portion, then
we'll consider the dive to be a "50% Oxygen, 20% Helium" dive, even
though you obviously never used that combination at the same time)
- we sort by Helium first, Oxygen second. So a dive with a 10% Helium
mix is considered to be "stronger" than a 50% Nitrox mix.
- If Helium is non-zero, we show "O2/He", otherwise we show just "O2"
(or "air"). So "21/20" means "21% oxygen, 20% Helium", while "40"
means "Ean 40".
- I got rid of the decimals. We save them, and you can see them in the
dive equipment details, but for the dive list we just use rounded
percentages.
Let's see how many bugs I introduced. I don't actually have any trimix
dives, but I edited a few for (very limited) testing.
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-12-11 22:38:58 +00:00
|
|
|
{
|
|
|
|
int i;
|
2011-12-12 17:20:22 +00:00
|
|
|
int maxo2 = -1, maxhe = -1, mino2 = 1000;
|
Add capability of custom sorts to divelist columns
.. and use this for the nitrox column, which can now be more complex
than just a single number.
The rule for the "nitrox" column is now:
- we look up the highest Oxygen and Helium mix for the dive
(Note: we look them up independently, so if you have a EAN50 deco
bottle, and a 20% Helium low-oxygen bottle for the deep portion, then
we'll consider the dive to be a "50% Oxygen, 20% Helium" dive, even
though you obviously never used that combination at the same time)
- we sort by Helium first, Oxygen second. So a dive with a 10% Helium
mix is considered to be "stronger" than a 50% Nitrox mix.
- If Helium is non-zero, we show "O2/He", otherwise we show just "O2"
(or "air"). So "21/20" means "21% oxygen, 20% Helium", while "40"
means "Ean 40".
- I got rid of the decimals. We save them, and you can see them in the
dive equipment details, but for the dive list we just use rounded
percentages.
Let's see how many bugs I introduced. I don't actually have any trimix
dives, but I edited a few for (very limited) testing.
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-12-11 22:38:58 +00:00
|
|
|
|
2013-03-18 14:22:14 +00:00
|
|
|
|
Add capability of custom sorts to divelist columns
.. and use this for the nitrox column, which can now be more complex
than just a single number.
The rule for the "nitrox" column is now:
- we look up the highest Oxygen and Helium mix for the dive
(Note: we look them up independently, so if you have a EAN50 deco
bottle, and a 20% Helium low-oxygen bottle for the deep portion, then
we'll consider the dive to be a "50% Oxygen, 20% Helium" dive, even
though you obviously never used that combination at the same time)
- we sort by Helium first, Oxygen second. So a dive with a 10% Helium
mix is considered to be "stronger" than a 50% Nitrox mix.
- If Helium is non-zero, we show "O2/He", otherwise we show just "O2"
(or "air"). So "21/20" means "21% oxygen, 20% Helium", while "40"
means "Ean 40".
- I got rid of the decimals. We save them, and you can see them in the
dive equipment details, but for the dive list we just use rounded
percentages.
Let's see how many bugs I introduced. I don't actually have any trimix
dives, but I edited a few for (very limited) testing.
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-12-11 22:38:58 +00:00
|
|
|
for (i = 0; i < MAX_CYLINDERS; i++) {
|
2011-12-12 17:20:22 +00:00
|
|
|
cylinder_t *cyl = dive->cylinder + i;
|
|
|
|
struct gasmix *mix = &cyl->gasmix;
|
2011-12-12 05:28:18 +00:00
|
|
|
int o2 = mix->o2.permille;
|
|
|
|
int he = mix->he.permille;
|
2013-03-18 14:22:14 +00:00
|
|
|
struct divecomputer *dc = &dive->dc;
|
2013-03-18 14:50:47 +00:00
|
|
|
int used = 0;
|
|
|
|
int first_gas_explicit = 0;
|
2013-03-18 14:22:14 +00:00
|
|
|
|
|
|
|
while (dc){
|
|
|
|
struct event *event = dc->events;
|
|
|
|
while(event){
|
|
|
|
if (event->value) {
|
|
|
|
if (event->name && !strcmp(event->name, "gaschange")) {
|
|
|
|
unsigned int event_he = event->value >> 16;
|
|
|
|
unsigned int event_o2 = event->value & 0xffff;
|
|
|
|
|
2013-03-18 14:50:47 +00:00
|
|
|
if (event->time.seconds < 30)
|
|
|
|
first_gas_explicit = 1;
|
2013-03-18 14:22:14 +00:00
|
|
|
if (is_air(o2, he)){
|
|
|
|
if (is_air(event_o2 * 10, event_he * 10))
|
|
|
|
used = 1;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
if (he == event_he*10 && o2 == event_o2*10)
|
|
|
|
used = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
event = event->next;
|
|
|
|
}
|
|
|
|
dc = dc->next;
|
|
|
|
}
|
2013-03-18 14:50:47 +00:00
|
|
|
|
|
|
|
/* Unless explicity set, the first gas to use has index 0 */
|
|
|
|
if (i == 0 && !first_gas_explicit)
|
|
|
|
used = 1;
|
|
|
|
|
2013-03-18 14:22:14 +00:00
|
|
|
if (!used)
|
|
|
|
continue;
|
2011-12-12 05:28:18 +00:00
|
|
|
|
2011-12-12 17:20:22 +00:00
|
|
|
if (cylinder_none(cyl))
|
|
|
|
continue;
|
|
|
|
if (!o2)
|
2013-01-14 22:53:38 +00:00
|
|
|
o2 = O2_IN_AIR;
|
2011-12-12 17:20:22 +00:00
|
|
|
if (o2 < mino2)
|
|
|
|
mino2 = o2;
|
2011-12-12 05:28:18 +00:00
|
|
|
if (he > maxhe)
|
|
|
|
goto newmax;
|
|
|
|
if (he < maxhe)
|
|
|
|
continue;
|
|
|
|
if (o2 <= maxo2)
|
|
|
|
continue;
|
|
|
|
newmax:
|
|
|
|
maxhe = he;
|
|
|
|
maxo2 = o2;
|
Add capability of custom sorts to divelist columns
.. and use this for the nitrox column, which can now be more complex
than just a single number.
The rule for the "nitrox" column is now:
- we look up the highest Oxygen and Helium mix for the dive
(Note: we look them up independently, so if you have a EAN50 deco
bottle, and a 20% Helium low-oxygen bottle for the deep portion, then
we'll consider the dive to be a "50% Oxygen, 20% Helium" dive, even
though you obviously never used that combination at the same time)
- we sort by Helium first, Oxygen second. So a dive with a 10% Helium
mix is considered to be "stronger" than a 50% Nitrox mix.
- If Helium is non-zero, we show "O2/He", otherwise we show just "O2"
(or "air"). So "21/20" means "21% oxygen, 20% Helium", while "40"
means "Ean 40".
- I got rid of the decimals. We save them, and you can see them in the
dive equipment details, but for the dive list we just use rounded
percentages.
Let's see how many bugs I introduced. I don't actually have any trimix
dives, but I edited a few for (very limited) testing.
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-12-11 22:38:58 +00:00
|
|
|
}
|
2011-12-12 17:20:22 +00:00
|
|
|
/* All air? Show/sort as "air"/zero */
|
2013-01-14 22:53:38 +00:00
|
|
|
if (!maxhe && maxo2 == O2_IN_AIR && mino2 == maxo2)
|
2011-12-12 17:20:22 +00:00
|
|
|
maxo2 = mino2 = 0;
|
2012-01-05 16:16:08 +00:00
|
|
|
*o2_p = maxo2;
|
|
|
|
*he_p = maxhe;
|
|
|
|
*o2low_p = mino2;
|
Add capability of custom sorts to divelist columns
.. and use this for the nitrox column, which can now be more complex
than just a single number.
The rule for the "nitrox" column is now:
- we look up the highest Oxygen and Helium mix for the dive
(Note: we look them up independently, so if you have a EAN50 deco
bottle, and a 20% Helium low-oxygen bottle for the deep portion, then
we'll consider the dive to be a "50% Oxygen, 20% Helium" dive, even
though you obviously never used that combination at the same time)
- we sort by Helium first, Oxygen second. So a dive with a 10% Helium
mix is considered to be "stronger" than a 50% Nitrox mix.
- If Helium is non-zero, we show "O2/He", otherwise we show just "O2"
(or "air"). So "21/20" means "21% oxygen, 20% Helium", while "40"
means "Ean 40".
- I got rid of the decimals. We save them, and you can see them in the
dive equipment details, but for the dive list we just use rounded
percentages.
Let's see how many bugs I introduced. I don't actually have any trimix
dives, but I edited a few for (very limited) testing.
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-12-11 22:38:58 +00:00
|
|
|
}
|
|
|
|
|
2013-01-02 20:16:42 +00:00
|
|
|
int total_weight(struct dive *dive)
|
2012-08-07 18:24:40 +00:00
|
|
|
{
|
|
|
|
int i, total_grams = 0;
|
|
|
|
|
|
|
|
if (dive)
|
|
|
|
for (i=0; i< MAX_WEIGHTSYSTEMS; i++)
|
|
|
|
total_grams += dive->weightsystem[i].weight.grams;
|
|
|
|
return total_grams;
|
|
|
|
}
|
|
|
|
|
First step in cleaning up cylinder pressure sensor logic
This clarifies/changes the meaning of our "cylinderindex" entry in our
samples. It has been rather confused, because different dive computers
have done things differently, and the naming really hasn't helped.
There are two totally different - and independent - cylinder "indexes":
- the pressure sensor index, which indicates which cylinder the sensor
data is from.
- the "active cylinder" index, which indicates which cylinder we actually
breathe from.
These two values really are totally independent, and have nothing
what-so-ever to do with each other. The sensor index may well be fixed:
many dive computers only support a single pressure sensor (whether
wireless or wired), and the sensor index is thus always zero.
Other dive computers may support multiple pressure sensors, and the gas
switch event may - or may not - indicate that the sensor changed too. A
dive computer might give the sensor data for *all* cylinders it can read,
regardless of which one is the one we're actively breathing. In fact, some
dive computers might give sensor data for not just *your* cylinder, but
your buddies.
This patch renames "cylinderindex" in the samples as "sensor", making it
quite clear that it's about which sensor index the pressure data in the
sample is about.
The way we figure out which is the currently active gas is with an
explicit has change event. If a computer (like the Uemis Zurich) joins the
two concepts together, then a sensor change should also create a gas
switch event. This patch also changes the Uemis importer to do that.
Finally, it should be noted that the plot info works totally separately
from the sample data, and is about what we actually *display*, not about
the sample pressures etc. In the plot info, the "cylinderindex" does in
fact mean the currently active cylinder, and while it is initially set to
match the sensor information from the samples, we then walk the gas change
events and fix it up - and if the active cylinder differs from the sensor
cylinder, we clear the sensor data.
[Dirk Hohndel: this conflicted with some of my recent changes - I think
I merged things correctly...]
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Signed-off-by: Dirk Hohndel <dirk@hohndel.org>
2012-12-31 04:00:51 +00:00
|
|
|
static int active_o2(struct dive *dive, struct divecomputer *dc, duration_t time)
|
|
|
|
{
|
|
|
|
int o2permille = dive->cylinder[0].gasmix.o2.permille;
|
|
|
|
struct event *event = dc->events;
|
|
|
|
|
|
|
|
if (!o2permille)
|
2013-01-14 22:53:38 +00:00
|
|
|
o2permille = O2_IN_AIR;
|
First step in cleaning up cylinder pressure sensor logic
This clarifies/changes the meaning of our "cylinderindex" entry in our
samples. It has been rather confused, because different dive computers
have done things differently, and the naming really hasn't helped.
There are two totally different - and independent - cylinder "indexes":
- the pressure sensor index, which indicates which cylinder the sensor
data is from.
- the "active cylinder" index, which indicates which cylinder we actually
breathe from.
These two values really are totally independent, and have nothing
what-so-ever to do with each other. The sensor index may well be fixed:
many dive computers only support a single pressure sensor (whether
wireless or wired), and the sensor index is thus always zero.
Other dive computers may support multiple pressure sensors, and the gas
switch event may - or may not - indicate that the sensor changed too. A
dive computer might give the sensor data for *all* cylinders it can read,
regardless of which one is the one we're actively breathing. In fact, some
dive computers might give sensor data for not just *your* cylinder, but
your buddies.
This patch renames "cylinderindex" in the samples as "sensor", making it
quite clear that it's about which sensor index the pressure data in the
sample is about.
The way we figure out which is the currently active gas is with an
explicit has change event. If a computer (like the Uemis Zurich) joins the
two concepts together, then a sensor change should also create a gas
switch event. This patch also changes the Uemis importer to do that.
Finally, it should be noted that the plot info works totally separately
from the sample data, and is about what we actually *display*, not about
the sample pressures etc. In the plot info, the "cylinderindex" does in
fact mean the currently active cylinder, and while it is initially set to
match the sensor information from the samples, we then walk the gas change
events and fix it up - and if the active cylinder differs from the sensor
cylinder, we clear the sensor data.
[Dirk Hohndel: this conflicted with some of my recent changes - I think
I merged things correctly...]
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Signed-off-by: Dirk Hohndel <dirk@hohndel.org>
2012-12-31 04:00:51 +00:00
|
|
|
|
|
|
|
for (event = dc->events; event; event = event->next) {
|
|
|
|
if (event->time.seconds > time.seconds)
|
|
|
|
break;
|
|
|
|
if (strcmp(event->name, "gaschange"))
|
|
|
|
continue;
|
|
|
|
o2permille = 10*(event->value & 0xffff);
|
|
|
|
}
|
|
|
|
return o2permille;
|
|
|
|
}
|
|
|
|
|
2013-02-08 06:48:07 +00:00
|
|
|
/* calculate OTU for a dive - this only takes the first diveomputer into account */
|
|
|
|
static int calculate_otu(struct dive *dive)
|
2011-09-22 20:45:53 +00:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
double otu = 0.0;
|
2013-02-08 06:48:07 +00:00
|
|
|
struct divecomputer *dc = &dive->dc;
|
2011-09-22 20:45:53 +00:00
|
|
|
|
2012-11-24 02:51:27 +00:00
|
|
|
for (i = 1; i < dc->samples; i++) {
|
2011-09-22 20:45:53 +00:00
|
|
|
int t;
|
2013-02-02 18:38:51 +00:00
|
|
|
int po2;
|
2012-11-24 02:51:27 +00:00
|
|
|
struct sample *sample = dc->sample + i;
|
2011-09-22 20:45:53 +00:00
|
|
|
struct sample *psample = sample - 1;
|
|
|
|
t = sample->time.seconds - psample->time.seconds;
|
2012-12-21 01:42:10 +00:00
|
|
|
if (sample->po2) {
|
2013-02-02 18:38:51 +00:00
|
|
|
po2 = sample->po2;
|
2012-12-21 01:42:10 +00:00
|
|
|
} else {
|
First step in cleaning up cylinder pressure sensor logic
This clarifies/changes the meaning of our "cylinderindex" entry in our
samples. It has been rather confused, because different dive computers
have done things differently, and the naming really hasn't helped.
There are two totally different - and independent - cylinder "indexes":
- the pressure sensor index, which indicates which cylinder the sensor
data is from.
- the "active cylinder" index, which indicates which cylinder we actually
breathe from.
These two values really are totally independent, and have nothing
what-so-ever to do with each other. The sensor index may well be fixed:
many dive computers only support a single pressure sensor (whether
wireless or wired), and the sensor index is thus always zero.
Other dive computers may support multiple pressure sensors, and the gas
switch event may - or may not - indicate that the sensor changed too. A
dive computer might give the sensor data for *all* cylinders it can read,
regardless of which one is the one we're actively breathing. In fact, some
dive computers might give sensor data for not just *your* cylinder, but
your buddies.
This patch renames "cylinderindex" in the samples as "sensor", making it
quite clear that it's about which sensor index the pressure data in the
sample is about.
The way we figure out which is the currently active gas is with an
explicit has change event. If a computer (like the Uemis Zurich) joins the
two concepts together, then a sensor change should also create a gas
switch event. This patch also changes the Uemis importer to do that.
Finally, it should be noted that the plot info works totally separately
from the sample data, and is about what we actually *display*, not about
the sample pressures etc. In the plot info, the "cylinderindex" does in
fact mean the currently active cylinder, and while it is initially set to
match the sensor information from the samples, we then walk the gas change
events and fix it up - and if the active cylinder differs from the sensor
cylinder, we clear the sensor data.
[Dirk Hohndel: this conflicted with some of my recent changes - I think
I merged things correctly...]
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Signed-off-by: Dirk Hohndel <dirk@hohndel.org>
2012-12-31 04:00:51 +00:00
|
|
|
int o2 = active_o2(dive, dc, sample->time);
|
2013-02-09 00:15:18 +00:00
|
|
|
po2 = o2 / 1000.0 * depth_to_mbar(sample->depth.mm, dive);
|
2012-12-21 01:42:10 +00:00
|
|
|
}
|
2013-02-02 18:38:51 +00:00
|
|
|
if (po2 >= 500)
|
|
|
|
otu += pow((po2 - 500) / 1000.0, 0.83) * t / 30.0;
|
2011-09-22 20:45:53 +00:00
|
|
|
}
|
2011-09-22 21:02:26 +00:00
|
|
|
return otu + 0.5;
|
2011-09-22 20:45:53 +00:00
|
|
|
}
|
2011-09-19 23:11:38 +00:00
|
|
|
/*
|
|
|
|
* Return air usage (in liters).
|
|
|
|
*/
|
|
|
|
static double calculate_airuse(struct dive *dive)
|
|
|
|
{
|
2013-02-25 23:23:16 +00:00
|
|
|
int airuse = 0;
|
2011-09-19 23:11:38 +00:00
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < MAX_CYLINDERS; i++) {
|
2011-11-09 15:51:00 +00:00
|
|
|
pressure_t start, end;
|
2011-09-19 23:11:38 +00:00
|
|
|
cylinder_t *cyl = dive->cylinder + i;
|
|
|
|
|
2011-11-09 15:51:00 +00:00
|
|
|
start = cyl->start.mbar ? cyl->start : cyl->sample_start;
|
|
|
|
end = cyl->end.mbar ? cyl->end : cyl->sample_end;
|
2011-09-19 23:11:38 +00:00
|
|
|
|
2013-02-25 23:23:16 +00:00
|
|
|
airuse += gas_volume(cyl, start) - gas_volume(cyl, end);
|
2011-09-19 23:11:38 +00:00
|
|
|
}
|
2013-02-25 23:23:16 +00:00
|
|
|
return airuse / 1000.0;
|
2011-09-19 23:11:38 +00:00
|
|
|
}
|
|
|
|
|
2013-02-08 06:48:07 +00:00
|
|
|
/* this only uses the first divecomputer to calculate the SAC rate */
|
|
|
|
static int calculate_sac(struct dive *dive)
|
2011-09-19 20:32:10 +00:00
|
|
|
{
|
2013-02-08 06:48:07 +00:00
|
|
|
struct divecomputer *dc = &dive->dc;
|
2011-09-19 23:11:38 +00:00
|
|
|
double airuse, pressure, sac;
|
2013-02-24 18:50:18 +00:00
|
|
|
int duration, meandepth;
|
2011-09-19 23:11:38 +00:00
|
|
|
|
|
|
|
airuse = calculate_airuse(dive);
|
|
|
|
if (!airuse)
|
2011-11-02 02:56:14 +00:00
|
|
|
return 0;
|
2013-02-24 18:50:18 +00:00
|
|
|
|
2013-02-24 19:39:51 +00:00
|
|
|
duration = dc->duration.seconds;
|
2013-02-24 18:50:18 +00:00
|
|
|
if (!duration)
|
|
|
|
return 0;
|
2013-02-08 06:48:07 +00:00
|
|
|
|
2013-02-24 19:39:51 +00:00
|
|
|
meandepth = dc->meandepth.mm;
|
|
|
|
if (!meandepth)
|
|
|
|
return 0;
|
|
|
|
|
Fix up SAC calculations for ATM/bar confusion
We even documented that we did SAC in bar*l/min, but the "S" in SAC
stands for "Surface". So we should normalize SAC rate to surface
pressure, not one bar.
It's a tiny 1% difference, and doesn't actually matter in practice, but
it's noticeable when you want to explicitly test for SAC-rate by
creating a test-dive that averages exactly 10m. Suddenly you don't get
the round numbers you expect.
[ Side note: 10m is not _exactly_ one extra atmosphere according to our
calculations, but it's darn close in sea water: the standard salinity
of 1.03 kg/l together with the standard acceleration of 9.81m/s^2
gives an additional pressure of 1.01 bar, which is within a fraction
of a percent of one ATM.
Of course, divers have likely chosen that value exactly for the math
to come out that way, since the true average salinity of seawater is
actually slightly lower ]
So here's a few test-dives, along with the SAC rate fixup to make them
look right.
(There's also a one-liner to dive.c that makes the duration come out
right if the last sample has a non-zero depth, and the previous sample
did not: one of my original test-dives did the "average 10m depth" by
starting at 0 and ending at 20m, and dive.c got a tiny bit confused
about that ;)
[ The rationale for me testing our SAC rate calculations in the first
place was that on snorkkeli.net user "Poltsi" reported that our SAC rate
calculations differ from the ones that Suunto DM4 reports. So I wanted
to verify that we did things right.
Note that Poltsi reported differences larger than the difference of
BAR/ATM, so this is not the cause. I'll continue to look at this. ]
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Signed-off-by: Dirk Hohndel <dirk@hohndel.org>
2013-02-24 18:01:18 +00:00
|
|
|
/* Mean pressure in ATM (SAC calculations are in atm*l/min) */
|
2013-02-24 18:50:18 +00:00
|
|
|
pressure = (double) depth_to_mbar(meandepth, dive) / SURFACE_PRESSURE;
|
2011-11-21 21:23:13 +00:00
|
|
|
sac = airuse / pressure * 60 / duration;
|
2011-09-19 23:11:38 +00:00
|
|
|
|
|
|
|
/* milliliters per minute.. */
|
2011-11-02 02:56:14 +00:00
|
|
|
return sac * 1000;
|
2011-09-20 02:13:36 +00:00
|
|
|
}
|
2011-09-19 23:11:38 +00:00
|
|
|
|
2013-01-04 04:45:20 +00:00
|
|
|
/* for now we do this based on the first divecomputer */
|
|
|
|
static void add_dive_to_deco(struct dive *dive)
|
|
|
|
{
|
|
|
|
struct divecomputer *dc = &dive->dc;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (!dc)
|
|
|
|
return;
|
2013-02-09 15:41:15 +00:00
|
|
|
for (i = 1; i < dc->samples; i++) {
|
2013-01-04 04:45:20 +00:00
|
|
|
struct sample *psample = dc->sample + i - 1;
|
|
|
|
struct sample *sample = dc->sample + i;
|
|
|
|
int t0 = psample->time.seconds;
|
|
|
|
int t1 = sample->time.seconds;
|
|
|
|
int j;
|
|
|
|
|
|
|
|
for (j = t0; j < t1; j++) {
|
2013-01-08 23:48:23 +00:00
|
|
|
int depth = interpolate(psample->depth.mm, sample->depth.mm, j - t0, t1 - t0);
|
2013-02-09 00:15:18 +00:00
|
|
|
(void) add_segment(depth_to_mbar(depth, dive) / 1000.0,
|
2013-02-02 18:38:51 +00:00
|
|
|
&dive->cylinder[sample->sensor].gasmix, 1, sample->po2, dive);
|
2013-01-04 04:45:20 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
int get_divenr(struct dive *dive)
|
2013-01-14 04:41:48 +00:00
|
|
|
{
|
|
|
|
int divenr = -1;
|
|
|
|
while (++divenr < dive_table.nr && get_dive(divenr) != dive)
|
|
|
|
;
|
|
|
|
return divenr;
|
|
|
|
}
|
|
|
|
|
2013-01-14 22:53:38 +00:00
|
|
|
static struct gasmix air = { .o2.permille = O2_IN_AIR };
|
2013-01-04 04:45:20 +00:00
|
|
|
|
|
|
|
/* take into account previous dives until there is a 48h gap between dives */
|
2013-01-05 07:11:42 +00:00
|
|
|
double init_decompression(struct dive *dive)
|
2013-01-04 04:45:20 +00:00
|
|
|
{
|
|
|
|
int i, divenr = -1;
|
2013-01-14 03:37:41 +00:00
|
|
|
unsigned int surface_time;
|
|
|
|
timestamp_t when, lasttime = 0;
|
2013-01-04 04:45:20 +00:00
|
|
|
gboolean deco_init = FALSE;
|
2013-01-14 03:37:41 +00:00
|
|
|
double tissue_tolerance, surface_pressure;
|
2013-01-04 04:45:20 +00:00
|
|
|
|
|
|
|
if (!dive)
|
2013-01-05 07:11:42 +00:00
|
|
|
return 0.0;
|
2013-01-14 04:41:48 +00:00
|
|
|
divenr = get_divenr(dive);
|
2013-01-04 04:45:20 +00:00
|
|
|
when = dive->when;
|
|
|
|
i = divenr;
|
2013-01-14 04:57:52 +00:00
|
|
|
while (i && --i) {
|
2013-01-04 04:45:20 +00:00
|
|
|
struct dive* pdive = get_dive(i);
|
2013-01-14 03:37:41 +00:00
|
|
|
/* we don't want to mix dives from different trips as we keep looking
|
|
|
|
* for how far back we need to go */
|
|
|
|
if (dive->divetrip && pdive->divetrip != dive->divetrip)
|
|
|
|
continue;
|
2013-02-09 15:12:30 +00:00
|
|
|
if (!pdive || pdive->when > when || pdive->when + pdive->duration.seconds + 48 * 60 * 60 < when)
|
2013-01-04 04:45:20 +00:00
|
|
|
break;
|
|
|
|
when = pdive->when;
|
2013-02-09 15:12:30 +00:00
|
|
|
lasttime = when + pdive->duration.seconds;
|
2013-01-04 04:45:20 +00:00
|
|
|
}
|
|
|
|
while (++i < divenr) {
|
|
|
|
struct dive* pdive = get_dive(i);
|
2013-01-14 03:37:41 +00:00
|
|
|
/* again skip dives from different trips */
|
|
|
|
if (dive->divetrip && dive->divetrip != pdive->divetrip)
|
|
|
|
continue;
|
2013-02-08 20:49:12 +00:00
|
|
|
surface_pressure = get_surface_pressure_in_mbar(pdive, TRUE) / 1000.0;
|
2013-01-04 04:45:20 +00:00
|
|
|
if (!deco_init) {
|
|
|
|
clear_deco(surface_pressure);
|
|
|
|
deco_init = TRUE;
|
2013-01-04 19:56:43 +00:00
|
|
|
#if DECO_CALC_DEBUG & 2
|
2013-01-04 04:45:20 +00:00
|
|
|
dump_tissues();
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
add_dive_to_deco(pdive);
|
2013-01-04 19:56:43 +00:00
|
|
|
#if DECO_CALC_DEBUG & 2
|
2013-01-04 04:45:20 +00:00
|
|
|
printf("added dive #%d\n", pdive->number);
|
|
|
|
dump_tissues();
|
|
|
|
#endif
|
2013-01-14 03:37:41 +00:00
|
|
|
if (pdive->when > lasttime) {
|
|
|
|
surface_time = pdive->when - lasttime;
|
2013-02-09 15:12:30 +00:00
|
|
|
lasttime = pdive->when + pdive->duration.seconds;
|
2013-02-02 18:38:51 +00:00
|
|
|
tissue_tolerance = add_segment(surface_pressure, &air, surface_time, 0, dive);
|
2013-01-14 03:37:41 +00:00
|
|
|
#if DECO_CALC_DEBUG & 2
|
|
|
|
printf("after surface intervall of %d:%02u\n", FRACTION(surface_time,60));
|
|
|
|
dump_tissues();
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* add the final surface time */
|
|
|
|
if (lasttime && dive->when > lasttime) {
|
|
|
|
surface_time = dive->when - lasttime;
|
2013-02-08 20:49:12 +00:00
|
|
|
surface_pressure = get_surface_pressure_in_mbar(dive, TRUE) / 1000.0;
|
2013-02-02 18:38:51 +00:00
|
|
|
tissue_tolerance = add_segment(surface_pressure, &air, surface_time, 0, dive);
|
2013-01-04 19:56:43 +00:00
|
|
|
#if DECO_CALC_DEBUG & 2
|
2013-01-04 04:45:20 +00:00
|
|
|
printf("after surface intervall of %d:%02u\n", FRACTION(surface_time,60));
|
|
|
|
dump_tissues();
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
if (!deco_init) {
|
2013-02-08 20:49:12 +00:00
|
|
|
double surface_pressure = get_surface_pressure_in_mbar(dive, TRUE) / 1000.0;
|
2013-01-04 04:45:20 +00:00
|
|
|
clear_deco(surface_pressure);
|
2013-01-04 19:56:43 +00:00
|
|
|
#if DECO_CALC_DEBUG & 2
|
2013-01-04 04:45:20 +00:00
|
|
|
printf("no previous dive\n");
|
|
|
|
dump_tissues();
|
|
|
|
#endif
|
|
|
|
}
|
2013-01-05 07:11:42 +00:00
|
|
|
return tissue_tolerance;
|
2013-01-04 04:45:20 +00:00
|
|
|
}
|
|
|
|
|
2011-11-13 17:29:07 +00:00
|
|
|
void update_cylinder_related_info(struct dive *dive)
|
|
|
|
{
|
2011-11-13 17:51:34 +00:00
|
|
|
if (dive != NULL) {
|
2013-02-08 06:48:07 +00:00
|
|
|
dive->sac = calculate_sac(dive);
|
|
|
|
dive->otu = calculate_otu(dive);
|
2011-11-13 17:29:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-09-20 03:06:54 +00:00
|
|
|
static void get_string(char **str, const char *s)
|
|
|
|
{
|
|
|
|
int len;
|
|
|
|
char *n;
|
|
|
|
|
|
|
|
if (!s)
|
|
|
|
s = "";
|
2012-10-02 16:46:25 +00:00
|
|
|
len = g_utf8_strlen(s, -1);
|
2011-11-16 18:29:38 +00:00
|
|
|
if (len > 60)
|
|
|
|
len = 60;
|
2012-10-02 16:46:25 +00:00
|
|
|
n = malloc(len * sizeof(gunichar) + 1);
|
|
|
|
g_utf8_strncpy(n, s, len);
|
2011-09-20 03:06:54 +00:00
|
|
|
*str = n;
|
|
|
|
}
|
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
void get_location(struct dive *dive, char **str)
|
2011-09-20 02:13:36 +00:00
|
|
|
{
|
2011-09-20 03:06:54 +00:00
|
|
|
get_string(str, dive->location);
|
|
|
|
}
|
2011-09-19 23:11:38 +00:00
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
void get_cylinder(struct dive *dive, char **str)
|
2011-09-20 03:06:54 +00:00
|
|
|
{
|
|
|
|
get_string(str, dive->cylinder[0].type.description);
|
2011-09-19 20:32:10 +00:00
|
|
|
}
|
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
void get_suit(struct dive *dive, char **str)
|
2012-08-14 23:07:25 +00:00
|
|
|
{
|
|
|
|
get_string(str, dive->suit);
|
|
|
|
}
|
|
|
|
|
2013-04-18 20:18:09 +00:00
|
|
|
#define MAX_DATE_STRING 256
|
|
|
|
/* caller needs to free the string */
|
|
|
|
char *get_dive_date_string(struct tm *tm) {
|
|
|
|
char *buffer = malloc(MAX_DATE_STRING);
|
|
|
|
if (buffer)
|
|
|
|
snprintf(buffer, MAX_DATE_STRING,
|
|
|
|
/*++GETTEXT 60 char buffer weekday, monthname, day of month, year, hour:min */
|
|
|
|
_("%1$s, %2$s %3$d, %4$d %5$02d:%6$02d"),
|
|
|
|
weekday(tm->tm_wday),
|
|
|
|
monthname(tm->tm_mon),
|
|
|
|
tm->tm_mday, tm->tm_year + 1900,
|
|
|
|
tm->tm_hour, tm->tm_min);
|
|
|
|
return buffer;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* caller needs to free the string */
|
|
|
|
char *get_trip_date_string(struct tm *tm, int nr) {
|
|
|
|
char *buffer = malloc(MAX_DATE_STRING);
|
|
|
|
if (buffer)
|
|
|
|
snprintf(buffer, MAX_DATE_STRING,
|
|
|
|
/*++GETTEXT 60 char buffer weekday, monthname, day of month, year, nr dives */
|
|
|
|
ngettext("Trip %1$s, %2$s %3$d, %4$d (%5$d dive)",
|
|
|
|
"Trip %1$s, %2$s %3$d, %4$d (%5$d dives)", nr),
|
|
|
|
weekday(tm->tm_wday),
|
|
|
|
monthname(tm->tm_mon),
|
|
|
|
tm->tm_mday, tm->tm_year + 1900,
|
|
|
|
nr);
|
|
|
|
return buffer;
|
|
|
|
}
|
|
|
|
|
2012-09-20 16:56:48 +00:00
|
|
|
/*
|
|
|
|
* helper functions for dive_trip handling
|
|
|
|
*/
|
|
|
|
#ifdef DEBUG_TRIP
|
2013-04-07 03:49:06 +00:00
|
|
|
void dump_trip_list(void)
|
2012-09-20 16:56:48 +00:00
|
|
|
{
|
2012-11-26 04:06:54 +00:00
|
|
|
dive_trip_t *trip;
|
2012-09-20 16:56:48 +00:00
|
|
|
int i=0;
|
2012-09-20 19:30:58 +00:00
|
|
|
timestamp_t last_time = 0;
|
2012-11-26 04:06:54 +00:00
|
|
|
|
|
|
|
for (trip = dive_trip_list; trip; trip = trip->next) {
|
2012-09-20 20:08:50 +00:00
|
|
|
struct tm tm;
|
2012-11-26 04:06:54 +00:00
|
|
|
utc_mkdate(trip->when, &tm);
|
|
|
|
if (trip->when < last_time)
|
2012-09-20 16:56:48 +00:00
|
|
|
printf("\n\ndive_trip_list OUT OF ORDER!!!\n\n\n");
|
2012-11-10 18:51:03 +00:00
|
|
|
printf("%s trip %d to \"%s\" on %04u-%02u-%02u %02u:%02u:%02u (%d dives - %p)\n",
|
2012-11-26 18:04:14 +00:00
|
|
|
trip->autogen ? "autogen " : "",
|
2012-11-26 04:06:54 +00:00
|
|
|
++i, trip->location,
|
2012-11-10 18:51:03 +00:00
|
|
|
tm.tm_year + 1900, tm.tm_mon+1, tm.tm_mday, tm.tm_hour, tm.tm_min, tm.tm_sec,
|
2012-11-26 04:06:54 +00:00
|
|
|
trip->nrdives, trip);
|
|
|
|
last_time = trip->when;
|
2012-09-20 16:56:48 +00:00
|
|
|
}
|
|
|
|
printf("-----\n");
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* this finds the last trip that at or before the time given */
|
2013-04-07 03:49:06 +00:00
|
|
|
dive_trip_t *find_matching_trip(timestamp_t when)
|
2012-08-31 23:26:04 +00:00
|
|
|
{
|
2012-11-26 04:06:54 +00:00
|
|
|
dive_trip_t *trip = dive_trip_list;
|
|
|
|
|
|
|
|
if (!trip || trip->when > when) {
|
2012-09-20 03:42:11 +00:00
|
|
|
#ifdef DEBUG_TRIP
|
2012-09-20 16:56:48 +00:00
|
|
|
printf("no matching trip\n");
|
2012-09-20 03:42:11 +00:00
|
|
|
#endif
|
2012-08-31 23:26:04 +00:00
|
|
|
return NULL;
|
2012-09-20 03:42:11 +00:00
|
|
|
}
|
2012-11-26 04:06:54 +00:00
|
|
|
while (trip->next && trip->next->when <= when)
|
2012-08-31 23:26:04 +00:00
|
|
|
trip = trip->next;
|
2012-09-20 03:42:11 +00:00
|
|
|
#ifdef DEBUG_TRIP
|
|
|
|
{
|
2012-09-20 20:08:50 +00:00
|
|
|
struct tm tm;
|
2012-11-26 04:06:54 +00:00
|
|
|
utc_mkdate(trip->when, &tm);
|
2012-11-10 18:51:03 +00:00
|
|
|
printf("found trip %p @ %04d-%02d-%02d %02d:%02d:%02d\n",
|
2012-11-26 04:06:54 +00:00
|
|
|
trip,
|
2012-09-20 20:08:50 +00:00
|
|
|
tm.tm_year+1900, tm.tm_mon+1, tm.tm_mday,
|
|
|
|
tm.tm_hour, tm.tm_min, tm.tm_sec);
|
2012-09-20 03:42:11 +00:00
|
|
|
}
|
|
|
|
#endif
|
2012-08-31 23:26:04 +00:00
|
|
|
return trip;
|
|
|
|
}
|
|
|
|
|
2012-09-20 16:56:48 +00:00
|
|
|
/* insert the trip into the dive_trip_list - but ensure you don't have
|
|
|
|
* two trips for the same date; but if you have, make sure you don't
|
|
|
|
* keep the one with less information */
|
|
|
|
void insert_trip(dive_trip_t **dive_trip_p)
|
2012-08-31 23:26:04 +00:00
|
|
|
{
|
2012-09-20 16:56:48 +00:00
|
|
|
dive_trip_t *dive_trip = *dive_trip_p;
|
2012-11-26 04:06:54 +00:00
|
|
|
dive_trip_t **p = &dive_trip_list;
|
|
|
|
dive_trip_t *trip;
|
2012-12-06 21:04:37 +00:00
|
|
|
struct dive *divep;
|
2012-11-26 04:06:54 +00:00
|
|
|
|
|
|
|
/* Walk the dive trip list looking for the right location.. */
|
|
|
|
while ((trip = *p) != NULL && trip->when < dive_trip->when)
|
|
|
|
p = &trip->next;
|
|
|
|
|
|
|
|
if (trip && trip->when == dive_trip->when) {
|
|
|
|
if (! trip->location)
|
|
|
|
trip->location = dive_trip->location;
|
2012-12-06 21:04:37 +00:00
|
|
|
if (! trip->notes)
|
|
|
|
trip->notes = dive_trip->notes;
|
|
|
|
divep = dive_trip->dives;
|
|
|
|
while (divep) {
|
|
|
|
add_dive_to_trip(divep, trip);
|
|
|
|
divep = divep->next;
|
|
|
|
}
|
2012-11-26 04:06:54 +00:00
|
|
|
*dive_trip_p = trip;
|
2012-09-20 16:56:48 +00:00
|
|
|
} else {
|
2012-11-26 04:06:54 +00:00
|
|
|
dive_trip->next = trip;
|
|
|
|
*p = dive_trip;
|
2012-09-20 16:56:48 +00:00
|
|
|
}
|
|
|
|
#ifdef DEBUG_TRIP
|
|
|
|
dump_trip_list();
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2012-11-10 18:51:03 +00:00
|
|
|
static void delete_trip(dive_trip_t *trip)
|
|
|
|
{
|
2012-11-26 04:06:54 +00:00
|
|
|
dive_trip_t **p, *tmp;
|
2012-11-10 18:51:03 +00:00
|
|
|
|
2012-11-26 02:53:15 +00:00
|
|
|
assert(!trip->dives);
|
2012-11-26 04:06:54 +00:00
|
|
|
|
|
|
|
/* Remove the trip from the list of trips */
|
|
|
|
p = &dive_trip_list;
|
|
|
|
while ((tmp = *p) != NULL) {
|
|
|
|
if (tmp == trip) {
|
|
|
|
*p = trip->next;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
p = &tmp->next;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* .. and free it */
|
2012-11-10 18:51:03 +00:00
|
|
|
if (trip->location)
|
|
|
|
free(trip->location);
|
2012-12-28 13:43:03 +00:00
|
|
|
if (trip->notes)
|
|
|
|
free(trip->notes);
|
2012-11-10 18:51:03 +00:00
|
|
|
free(trip);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void find_new_trip_start_time(dive_trip_t *trip)
|
2012-11-09 18:46:39 +00:00
|
|
|
{
|
2012-11-26 02:53:15 +00:00
|
|
|
struct dive *dive = trip->dives;
|
|
|
|
timestamp_t when = dive->when;
|
2012-11-10 18:51:03 +00:00
|
|
|
|
2012-11-26 02:53:15 +00:00
|
|
|
while ((dive = dive->next) != NULL) {
|
|
|
|
if (dive->when < when)
|
|
|
|
when = dive->when;
|
2012-11-10 18:51:03 +00:00
|
|
|
}
|
2012-11-26 02:53:15 +00:00
|
|
|
trip->when = when;
|
2012-11-10 18:51:03 +00:00
|
|
|
}
|
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
void remove_dive_from_trip(struct dive *dive)
|
2012-11-10 18:51:03 +00:00
|
|
|
{
|
2012-11-26 02:53:15 +00:00
|
|
|
struct dive *next, **pprev;
|
2012-11-10 18:51:03 +00:00
|
|
|
dive_trip_t *trip = dive->divetrip;
|
|
|
|
|
|
|
|
if (!trip)
|
|
|
|
return;
|
2012-11-26 02:53:15 +00:00
|
|
|
|
|
|
|
/* Remove the dive from the trip's list of dives */
|
|
|
|
next = dive->next;
|
|
|
|
pprev = dive->pprev;
|
|
|
|
*pprev = next;
|
|
|
|
if (next)
|
|
|
|
next->pprev = pprev;
|
|
|
|
|
2012-11-10 18:51:03 +00:00
|
|
|
dive->divetrip = NULL;
|
2013-02-19 17:57:54 +00:00
|
|
|
dive->tripflag = NO_TRIP;
|
2012-11-10 18:51:03 +00:00
|
|
|
assert(trip->nrdives > 0);
|
|
|
|
if (!--trip->nrdives)
|
|
|
|
delete_trip(trip);
|
|
|
|
else if (trip->when == dive->when)
|
|
|
|
find_new_trip_start_time(trip);
|
|
|
|
}
|
|
|
|
|
|
|
|
void add_dive_to_trip(struct dive *dive, dive_trip_t *trip)
|
|
|
|
{
|
|
|
|
if (dive->divetrip == trip)
|
|
|
|
return;
|
|
|
|
assert(trip->when);
|
|
|
|
remove_dive_from_trip(dive);
|
|
|
|
trip->nrdives++;
|
|
|
|
dive->divetrip = trip;
|
2012-11-26 04:06:54 +00:00
|
|
|
dive->tripflag = ASSIGNED_TRIP;
|
2012-11-26 02:53:15 +00:00
|
|
|
|
|
|
|
/* Add it to the trip's list of dives*/
|
|
|
|
dive->next = trip->dives;
|
|
|
|
if (dive->next)
|
|
|
|
dive->next->pprev = &dive->next;
|
|
|
|
trip->dives = dive;
|
|
|
|
dive->pprev = &trip->dives;
|
|
|
|
|
2012-11-10 18:51:03 +00:00
|
|
|
if (dive->when && trip->when > dive->when)
|
|
|
|
trip->when = dive->when;
|
2012-11-09 18:46:39 +00:00
|
|
|
}
|
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
dive_trip_t *create_and_hookup_trip_from_dive(struct dive *dive)
|
2012-08-31 23:26:04 +00:00
|
|
|
{
|
2012-09-20 03:42:11 +00:00
|
|
|
dive_trip_t *dive_trip = calloc(sizeof(dive_trip_t),1);
|
2012-08-31 23:26:04 +00:00
|
|
|
dive_trip->when = dive->when;
|
|
|
|
if (dive->location)
|
|
|
|
dive_trip->location = strdup(dive->location);
|
2012-09-05 20:54:22 +00:00
|
|
|
insert_trip(&dive_trip);
|
2012-11-10 18:51:03 +00:00
|
|
|
|
2012-08-31 23:26:04 +00:00
|
|
|
dive->tripflag = IN_TRIP;
|
2012-11-10 18:51:03 +00:00
|
|
|
add_dive_to_trip(dive, dive_trip);
|
2012-08-31 23:26:04 +00:00
|
|
|
return dive_trip;
|
|
|
|
}
|
|
|
|
|
2012-11-26 04:06:54 +00:00
|
|
|
/*
|
|
|
|
* Walk the dives from the oldest dive, and see if we can autogroup them
|
|
|
|
*/
|
2013-04-07 03:49:06 +00:00
|
|
|
void autogroup_dives(void)
|
2012-09-10 18:04:58 +00:00
|
|
|
{
|
2012-11-26 04:06:54 +00:00
|
|
|
int i;
|
|
|
|
struct dive *dive, *lastdive = NULL;
|
2012-09-10 18:04:58 +00:00
|
|
|
|
2012-11-26 04:06:54 +00:00
|
|
|
for_each_dive(i, dive) {
|
|
|
|
dive_trip_t *trip;
|
2012-09-10 18:04:58 +00:00
|
|
|
|
2012-11-26 04:06:54 +00:00
|
|
|
if (dive->divetrip) {
|
|
|
|
lastdive = dive;
|
|
|
|
continue;
|
2012-09-10 18:04:58 +00:00
|
|
|
}
|
2012-11-26 04:06:54 +00:00
|
|
|
|
|
|
|
if (!DIVE_NEEDS_TRIP(dive)) {
|
|
|
|
lastdive = NULL;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Do we have a trip we can combine this into? */
|
|
|
|
if (lastdive && dive->when < lastdive->when + TRIP_THRESHOLD) {
|
|
|
|
dive_trip_t *trip = lastdive->divetrip;
|
|
|
|
add_dive_to_trip(dive, trip);
|
|
|
|
if (dive->location && !trip->location)
|
|
|
|
trip->location = strdup(dive->location);
|
|
|
|
lastdive = dive;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
lastdive = dive;
|
|
|
|
trip = create_and_hookup_trip_from_dive(dive);
|
2012-11-26 18:04:14 +00:00
|
|
|
trip->autogen = 1;
|
2012-09-10 18:04:58 +00:00
|
|
|
}
|
2012-11-26 04:06:54 +00:00
|
|
|
|
|
|
|
#ifdef DEBUG_TRIP
|
|
|
|
dump_trip_list();
|
|
|
|
#endif
|
2012-09-10 18:04:58 +00:00
|
|
|
}
|
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
void clear_trip_indexes(void)
|
Allow overlapping (and disjoint) dive trips
We used to have the rule that a dive trip has to have all dives in it in
sequential order, even though our XML file really is much more flexible,
and allows arbitrary nesting of dives within a dive trip.
Put another way, the old model had fairly inflexible rules:
- the dive array is sorted by time
- a dive trip is always a contiguous slice of this sorted array
which makes perfect sense when you think of the dive and trip list as a
physical activity by one person, but leads to various very subtle issues
in the general case when there are no guarantees that the user then uses
subsurface that way.
In particular, if you load the XML files of two divers that have
overlapping dive trips, the end result is incredibly messy, and does not
conform to the above model at all.
There's two ways to enforce such conformance:
- disallow that kind of behavior entirely.
This is actually hard. Our XML files aren't date-based, they are
based on XML nesting rules, and even a single XML file can have
nesting that violates the date ordering. With multiple XML files,
it's trivial to do in practice, and while we could just fail at
loading, the failure would have to be a hard failure that leaves the
user no way to use the data at all.
- try to "fix it up" by sorting, splitting, and combining dive trips
automatically.
Dirk had a patch to do this, but it really does destroy the actual
dive data: if you load both mine and Dirk's dive trips, you ended up
with a result that followed the above two technical rules, but that
didn't actually make any *sense*.
So this patch doesn't try to enforce the rules, and instead just changes
them to be more generic:
- the dive array is still sorted by dive time
- a dive trip is just an arbitrary collection of dives.
The relaxed rules means that mixing dives and dive trips for two people
is trivial, and we can easily handle any XML file. The dive trip is
defined by the XML nesting level, and is totally independent of any
date-based sorting.
It does require a few things:
- when we save our dive data, we have to do it hierarchically by dive
trip, not just by walking the dive array linearly.
- similarly, when we create the dive tree model, we can't just blindly
walk the array of dives one by one, we have to look up the correct
trip (parent)
- when we try to merge two dives that are adjacent (by date sorting),
we can't do it if they are in different trips.
but apart from that, nothing else really changes.
NOTE! Despite the new relaxed model, creating totally disjoing dive
trips is not all that easy (nor is there any *reason* for it to be
easty). Our GUI interfaces still are "add dive to trip above" etc, and
the automatic adding of dives to dive trips is obviously still based on
date.
So this does not really change the expected normal usage, the relaxed
data structure rules just mean that we don't need to worry about the odd
cases as much, because we can just let them be.
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Signed-off-by: Dirk Hohndel <dirk@hohndel.org>
2012-12-30 19:00:37 +00:00
|
|
|
{
|
|
|
|
dive_trip_t *trip;
|
|
|
|
|
|
|
|
for (trip = dive_trip_list; trip != NULL; trip = trip->next)
|
|
|
|
trip->index = 0;
|
|
|
|
}
|
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
/* this implements the mechanics of removing the dive from the table,
|
|
|
|
* but doesn't deal with updating dive trips, etc */
|
|
|
|
void delete_single_dive(int idx)
|
2011-09-07 19:01:37 +00:00
|
|
|
{
|
2013-04-07 03:49:06 +00:00
|
|
|
int i;
|
|
|
|
struct dive *dive = get_dive(idx);
|
|
|
|
if (!dive)
|
|
|
|
return; /* this should never happen */
|
|
|
|
remove_dive_from_trip(dive);
|
|
|
|
for (i = idx; i < dive_table.nr - 1; i++)
|
|
|
|
dive_table.dives[i] = dive_table.dives[i+1];
|
|
|
|
dive_table.dives[--dive_table.nr] = NULL;
|
|
|
|
if (dive->selected)
|
|
|
|
amount_selected--;
|
|
|
|
/* free all allocations */
|
|
|
|
free(dive->dc.sample);
|
|
|
|
if (dive->location)
|
|
|
|
free((void *)dive->location);
|
|
|
|
if (dive->notes)
|
|
|
|
free((void *)dive->notes);
|
|
|
|
if (dive->divemaster)
|
|
|
|
free((void *)dive->divemaster);
|
|
|
|
if (dive->buddy)
|
|
|
|
free((void *)dive->buddy);
|
|
|
|
if (dive->suit)
|
|
|
|
free((void *)dive->suit);
|
|
|
|
free(dive);
|
2011-08-31 17:27:58 +00:00
|
|
|
}
|
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
void add_single_dive(int idx, struct dive *dive)
|
2011-08-31 17:27:58 +00:00
|
|
|
{
|
2013-04-07 03:49:06 +00:00
|
|
|
int i;
|
|
|
|
dive_table.nr++;
|
|
|
|
if (dive->selected)
|
|
|
|
amount_selected++;
|
|
|
|
for (i = idx; i < dive_table.nr ; i++) {
|
|
|
|
struct dive *tmp = dive_table.dives[i];
|
|
|
|
dive_table.dives[i] = dive;
|
|
|
|
dive = tmp;
|
|
|
|
}
|
2011-09-05 19:12:58 +00:00
|
|
|
}
|
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
void merge_dive_index(int i, struct dive *a)
|
2012-12-29 06:04:43 +00:00
|
|
|
{
|
2013-04-07 03:49:06 +00:00
|
|
|
struct dive *b = get_dive(i+1);
|
|
|
|
struct dive *res;
|
2012-12-29 06:04:43 +00:00
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
res = merge_dives(a, b, b->when - a->when, FALSE);
|
|
|
|
if (!res)
|
|
|
|
return;
|
2012-12-29 06:04:43 +00:00
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
add_single_dive(i, res);
|
|
|
|
delete_single_dive(i+1);
|
|
|
|
delete_single_dive(i+1);
|
2012-12-29 06:04:43 +00:00
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
dive_list_update_dives();
|
|
|
|
mark_divelist_changed(TRUE);
|
2012-12-29 06:04:43 +00:00
|
|
|
}
|
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
void select_dive(int idx)
|
2011-09-20 04:39:15 +00:00
|
|
|
{
|
2013-04-07 03:49:06 +00:00
|
|
|
struct dive *dive = get_dive(idx);
|
|
|
|
if (dive && !dive->selected) {
|
|
|
|
dive->selected = 1;
|
|
|
|
amount_selected++;
|
|
|
|
selected_dive = idx;
|
2012-08-13 22:07:38 +00:00
|
|
|
}
|
2011-09-22 17:28:57 +00:00
|
|
|
}
|
|
|
|
|
2013-04-07 03:49:06 +00:00
|
|
|
void deselect_dive(int idx)
|
Don't deselect all dives on all selection "change" events
gtk sends the selection change events all the time, for pretty much any
"divelist changed - so selection changed". The expansion of a trip, the
switch to a new model, yadda yadda. But we actually want selections to
be sticky across these events, so we can't just forget all of our old
selection state and repopulate it.
So we re-introduce the "am I allowed to change this row" callback, which
we used to use to create a list of every actual selection that was
changed. But instead of remembering the list (and having the stale
entries issue with that remembered list that caused problems), we now
just use that as a "that *particular* selection cleared" event.
So this callback works as the "which part of the visible, currently
selected state got cleared" notifier, and handles unselection.
Then, when the selection is over, we use the new model of "let's just
traverse the list of things gtk thinks are selected" and use that to
handle new selections in the visible state that gtk actually tracks
well. So that logic handles the new selections.
This way, dives that aren't visible to gtk don't ever get modified: gtk
won't ask about them being selected or not, and gtk won't track them in
its selection logic, so with this model their state never changes for
us.
gtk selections are annoying. They are simple for the case gtk knows
about (ie they are *visually* selected in the GUI), but since we very
much want to track selection across events that change the visual state,
we need to have this insane "impedance match".
Reported-by: Dirk Hohdnel <dirk@hohndel.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Signed-off-by: Dirk Hohndel <dirk@hohndel.org>
2013-01-29 19:15:23 +00:00
|
|
|
{
|
|
|
|
struct dive *dive = get_dive(idx);
|
|
|
|
if (dive && dive->selected) {
|
|
|
|
dive->selected = 0;
|
|
|
|
amount_selected--;
|
2013-01-29 20:05:30 +00:00
|
|
|
if (selected_dive == idx && amount_selected > 0) {
|
|
|
|
/* pick a different dive as selected */
|
2013-01-29 21:10:46 +00:00
|
|
|
while (--selected_dive >= 0) {
|
2013-01-29 20:05:30 +00:00
|
|
|
dive = get_dive(selected_dive);
|
|
|
|
if (dive && dive->selected)
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
selected_dive = idx;
|
2013-01-29 21:10:46 +00:00
|
|
|
while (++selected_dive < dive_table.nr) {
|
2013-01-29 20:05:30 +00:00
|
|
|
dive = get_dive(selected_dive);
|
|
|
|
if (dive && dive->selected)
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (amount_selected == 0)
|
|
|
|
selected_dive = -1;
|
Don't deselect all dives on all selection "change" events
gtk sends the selection change events all the time, for pretty much any
"divelist changed - so selection changed". The expansion of a trip, the
switch to a new model, yadda yadda. But we actually want selections to
be sticky across these events, so we can't just forget all of our old
selection state and repopulate it.
So we re-introduce the "am I allowed to change this row" callback, which
we used to use to create a list of every actual selection that was
changed. But instead of remembering the list (and having the stale
entries issue with that remembered list that caused problems), we now
just use that as a "that *particular* selection cleared" event.
So this callback works as the "which part of the visible, currently
selected state got cleared" notifier, and handles unselection.
Then, when the selection is over, we use the new model of "let's just
traverse the list of things gtk thinks are selected" and use that to
handle new selections in the visible state that gtk actually tracks
well. So that logic handles the new selections.
This way, dives that aren't visible to gtk don't ever get modified: gtk
won't ask about them being selected or not, and gtk won't track them in
its selection logic, so with this model their state never changes for
us.
gtk selections are annoying. They are simple for the case gtk knows
about (ie they are *visually* selected in the GUI), but since we very
much want to track selection across events that change the visual state,
we need to have this insane "impedance match".
Reported-by: Dirk Hohdnel <dirk@hohndel.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Signed-off-by: Dirk Hohndel <dirk@hohndel.org>
2013-01-29 19:15:23 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-09-21 04:29:09 +00:00
|
|
|
void mark_divelist_changed(int changed)
|
|
|
|
{
|
2013-04-07 03:49:06 +00:00
|
|
|
dive_list_changed = changed;
|
2011-09-21 04:29:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int unsaved_changes()
|
|
|
|
{
|
2013-04-07 03:49:06 +00:00
|
|
|
return dive_list_changed;
|
2011-09-21 04:29:09 +00:00
|
|
|
}
|
2012-09-03 04:48:30 +00:00
|
|
|
|
|
|
|
void remove_autogen_trips()
|
|
|
|
{
|
2012-11-26 03:04:45 +00:00
|
|
|
int i;
|
|
|
|
struct dive *dive;
|
2012-09-03 04:48:30 +00:00
|
|
|
|
2012-11-26 03:04:45 +00:00
|
|
|
for_each_dive(i, dive) {
|
|
|
|
dive_trip_t *trip = dive->divetrip;
|
|
|
|
|
2012-11-26 18:04:14 +00:00
|
|
|
if (trip && trip->autogen)
|
2012-11-26 03:04:45 +00:00
|
|
|
remove_dive_from_trip(dive);
|
2012-09-20 03:42:11 +00:00
|
|
|
}
|
2012-09-03 04:48:30 +00:00
|
|
|
}
|
2013-01-01 16:22:46 +00:00
|
|
|
|