2011-08-28 23:58:26 +00:00
|
|
|
#include <stdio.h>
|
2011-08-30 00:51:54 +00:00
|
|
|
#include <ctype.h>
|
|
|
|
#include <string.h>
|
2011-08-28 23:58:26 +00:00
|
|
|
#include <libxml/parser.h>
|
|
|
|
#include <libxml/tree.h>
|
|
|
|
|
2011-08-30 20:48:05 +00:00
|
|
|
/*
|
|
|
|
* Some silly typedefs to make our units very explicit.
|
|
|
|
*
|
|
|
|
* Also, the units are chosen so that values can be expressible as
|
|
|
|
* integers, so that we never have FP rounding issues. And they
|
|
|
|
* are small enough that converting to/from imperial units doesn't
|
|
|
|
* really matter.
|
|
|
|
*
|
|
|
|
* We also strive to make '0' a meaningless number saying "not
|
|
|
|
* initialized", since many values are things that may not have
|
|
|
|
* been reported (eg tank pressure or temperature from dive
|
|
|
|
* computers that don't support them). But sometimes -1 is an even
|
|
|
|
* more explicit way of saying "not there".
|
|
|
|
*
|
|
|
|
* Thus "millibar" for pressure, for example, or "millikelvin" for
|
|
|
|
* temperatures. Doing temperatures in celsius or fahrenheit would
|
|
|
|
* make for loss of precision when converting from one to the other,
|
|
|
|
* and using millikelvin is SI-like but also means that a temperature
|
|
|
|
* of '0' is clearly just a missing temperature or tank pressure.
|
|
|
|
*
|
|
|
|
* Also strive to use units that can not possibly be mistaken for a
|
|
|
|
* valid value in a "normal" system without conversion. If the max
|
|
|
|
* depth of a dive is '20000', you probably didn't convert from mm on
|
|
|
|
* output, or if the max depth gets reported as "0.2ft" it was either
|
|
|
|
* a really boring dive, or there was some missing input conversion,
|
|
|
|
* and a 60-ft dive got recorded as 60mm.
|
|
|
|
*
|
|
|
|
* Doing these as "structs containing value" means that we always
|
|
|
|
* have to explicitly write out those units in order to get at the
|
|
|
|
* actual value. So there is hopefully little fear of using a value
|
|
|
|
* in millikelvin as Fahrenheit by mistake.
|
|
|
|
*
|
|
|
|
* We don't actually use these all yet, so maybe they'll change, but
|
|
|
|
* I made a number of types as guidelines.
|
|
|
|
*/
|
|
|
|
typedef struct {
|
|
|
|
int seconds;
|
|
|
|
} duration_t;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
int mm;
|
|
|
|
} depth_t;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
int mbar;
|
|
|
|
} pressure_t;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
int mkelvin;
|
|
|
|
} temperature_t;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
int mliter;
|
|
|
|
} volume_t;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
int permille;
|
|
|
|
} fraction_t;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
int grams;
|
|
|
|
} weight_t;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
fraction_t o2;
|
|
|
|
fraction_t n2;
|
|
|
|
fraction_t he2;
|
|
|
|
} gasmix_t;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
volume_t size;
|
|
|
|
pressure_t pressure;
|
|
|
|
} tank_type_t;
|
|
|
|
|
|
|
|
struct sample {
|
|
|
|
duration_t time;
|
|
|
|
depth_t depth;
|
|
|
|
temperature_t temperature;
|
|
|
|
pressure_t tankpressure;
|
|
|
|
int tankindex;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct dive {
|
|
|
|
time_t when;
|
|
|
|
depth_t maxdepth, meandepth;
|
|
|
|
duration_t duration, surfacetime;
|
|
|
|
depth_t visibility;
|
|
|
|
temperature_t airtemp, watertemp;
|
|
|
|
pressure_t beginning_pressure, end_pressure;
|
|
|
|
int samples;
|
|
|
|
struct sample sample[];
|
|
|
|
};
|
|
|
|
|
|
|
|
static void record_dive(struct dive *dive)
|
|
|
|
{
|
|
|
|
static int nr;
|
|
|
|
|
|
|
|
printf("Recording dive %d with %d samples\n", ++nr, dive->samples);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* We're in samples - try to convert the random xml value to something useful */
|
|
|
|
static void try_to_fill_sample(struct sample *sample, const char *name, int size, const char *buffer)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/* We're in the top-level dive xml. Try to convert whatever value to a dive value */
|
|
|
|
static void try_to_fill_dive(struct dive *dive, const char *name, int size, const char *buffer)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Dive info as it is being built up..
|
|
|
|
*/
|
|
|
|
static int alloc_samples;
|
|
|
|
static struct dive *dive;
|
|
|
|
static struct sample *sample;
|
|
|
|
|
|
|
|
static unsigned int dive_size(int samples)
|
|
|
|
{
|
|
|
|
return sizeof(struct dive) + samples*sizeof(struct sample);
|
|
|
|
}
|
|
|
|
|
2011-08-30 04:32:27 +00:00
|
|
|
/*
|
|
|
|
* File boundaries are dive boundaries. But sometimes there are
|
|
|
|
* multiple dives per file, so there can be other events too that
|
|
|
|
* trigger a "new dive" marker and you may get some nesting due
|
|
|
|
* to that. Just ignore nesting levels.
|
|
|
|
*/
|
|
|
|
static void dive_start(void)
|
|
|
|
{
|
2011-08-30 20:48:05 +00:00
|
|
|
unsigned int size;
|
|
|
|
|
|
|
|
alloc_samples = 5;
|
|
|
|
size = dive_size(alloc_samples);
|
|
|
|
dive = malloc(size);
|
|
|
|
if (!dive)
|
|
|
|
exit(1);
|
|
|
|
memset(dive, 0, size);
|
2011-08-30 04:32:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void dive_end(void)
|
|
|
|
{
|
2011-08-30 20:48:05 +00:00
|
|
|
if (!dive)
|
|
|
|
return;
|
|
|
|
record_dive(dive);
|
|
|
|
dive = NULL;
|
2011-08-30 04:32:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void sample_start(void)
|
|
|
|
{
|
2011-08-30 20:48:05 +00:00
|
|
|
int nr;
|
|
|
|
|
|
|
|
if (!dive)
|
|
|
|
return;
|
|
|
|
nr = dive->samples;
|
|
|
|
if (nr >= alloc_samples) {
|
|
|
|
unsigned int size;
|
|
|
|
|
|
|
|
alloc_samples = (alloc_samples * 3)/2 + 10;
|
|
|
|
size = dive_size(alloc_samples);
|
|
|
|
dive = realloc(dive, size);
|
|
|
|
if (!dive)
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
sample = dive->samples + nr;
|
2011-08-30 04:32:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void sample_end(void)
|
|
|
|
{
|
2011-08-30 20:48:05 +00:00
|
|
|
sample = NULL;
|
|
|
|
if (!dive)
|
|
|
|
return;
|
|
|
|
dive->samples++;
|
2011-08-30 04:32:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void entry(const char *name, int size, const char *buffer)
|
|
|
|
{
|
2011-08-30 20:48:05 +00:00
|
|
|
if (sample) {
|
|
|
|
try_to_fill_sample(sample, name, size, buffer);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (dive) {
|
|
|
|
try_to_fill_dive(dive, name, size, buffer);
|
|
|
|
return;
|
|
|
|
}
|
2011-08-30 04:32:27 +00:00
|
|
|
}
|
|
|
|
|
2011-08-30 00:51:54 +00:00
|
|
|
static const char *nodename(xmlNode *node, char *buf, int len)
|
2011-08-28 23:58:26 +00:00
|
|
|
{
|
2011-08-30 00:51:54 +00:00
|
|
|
/* Don't print out the node name if it is "text" */
|
|
|
|
if (!strcmp(node->name, "text")) {
|
|
|
|
node = node->parent;
|
|
|
|
if (!node || !node->name)
|
|
|
|
return "root";
|
|
|
|
}
|
|
|
|
|
|
|
|
buf += len;
|
|
|
|
*--buf = 0;
|
|
|
|
len--;
|
|
|
|
|
|
|
|
for(;;) {
|
|
|
|
const char *name = node->name;
|
|
|
|
int i = strlen(name);
|
|
|
|
while (--i >= 0) {
|
|
|
|
unsigned char c = name[i];
|
|
|
|
*--buf = tolower(c);
|
|
|
|
if (!--len)
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
node = node->parent;
|
|
|
|
if (!node || !node->name)
|
|
|
|
return buf;
|
|
|
|
*--buf = '.';
|
|
|
|
if (!--len)
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#define MAXNAME 64
|
|
|
|
|
2011-08-30 04:32:27 +00:00
|
|
|
static void visit_one_node(xmlNode *node)
|
2011-08-30 00:51:54 +00:00
|
|
|
{
|
|
|
|
int len;
|
|
|
|
const unsigned char *content;
|
|
|
|
char buffer[MAXNAME];
|
|
|
|
const char *name;
|
|
|
|
|
|
|
|
content = node->content;
|
|
|
|
if (!content)
|
|
|
|
return;
|
|
|
|
|
|
|
|
/* Trim whitespace at beginning */
|
|
|
|
while (isspace(*content))
|
|
|
|
content++;
|
|
|
|
|
|
|
|
/* Trim whitespace at end */
|
|
|
|
len = strlen(content);
|
|
|
|
while (len && isspace(content[len-1]))
|
|
|
|
len--;
|
|
|
|
|
|
|
|
if (!len)
|
|
|
|
return;
|
|
|
|
|
|
|
|
name = nodename(node, buffer, sizeof(buffer));
|
2011-08-28 23:58:26 +00:00
|
|
|
|
2011-08-30 04:32:27 +00:00
|
|
|
entry(name, len, content);
|
2011-08-28 23:58:26 +00:00
|
|
|
}
|
|
|
|
|
2011-08-30 04:32:27 +00:00
|
|
|
static void traverse(xmlNode *node)
|
2011-08-28 23:58:26 +00:00
|
|
|
{
|
|
|
|
xmlNode *n;
|
|
|
|
|
|
|
|
for (n = node; n; n = n->next) {
|
2011-08-30 04:32:27 +00:00
|
|
|
/* XML from libdivecomputer: 'dive' per new dive */
|
|
|
|
if (!strcmp(n->name, "dive")) {
|
|
|
|
dive_start();
|
|
|
|
traverse(n->children);
|
|
|
|
dive_end();
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* At least both libdivecomputer and Suunto
|
|
|
|
* agree on "sample".
|
|
|
|
*
|
|
|
|
* Well - almost. Ignore case.
|
|
|
|
*/
|
|
|
|
if (!strcasecmp(n->name, "sample")) {
|
|
|
|
sample_start();
|
|
|
|
traverse(n->children);
|
|
|
|
sample_end();
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Anything else - just visit it and recurse */
|
|
|
|
visit_one_node(n);
|
|
|
|
traverse(n->children);
|
2011-08-28 23:58:26 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void parse(const char *filename)
|
|
|
|
{
|
|
|
|
xmlDoc *doc;
|
|
|
|
|
|
|
|
doc = xmlReadFile(filename, NULL, 0);
|
|
|
|
if (!doc) {
|
|
|
|
fprintf(stderr, "Failed to parse '%s'.\n", filename);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2011-08-30 04:32:27 +00:00
|
|
|
dive_start();
|
|
|
|
traverse(xmlDocGetRootElement(doc));
|
|
|
|
dive_end();
|
2011-08-28 23:58:26 +00:00
|
|
|
xmlFreeDoc(doc);
|
|
|
|
xmlCleanupParser();
|
|
|
|
}
|
|
|
|
|
|
|
|
int main(int argc, char **argv)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
LIBXML_TEST_VERSION
|
|
|
|
|
|
|
|
for (i = 1; i < argc; i++)
|
|
|
|
parse(argv[i]);
|
|
|
|
return 0;
|
|
|
|
}
|