2013-07-28 22:08:34 +00:00
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
// Routines to write and read our .slvs file format.
|
|
|
|
//
|
|
|
|
// Copyright 2008-2013 Jonathan Westhues.
|
|
|
|
//-----------------------------------------------------------------------------
|
2008-04-18 11:11:48 +00:00
|
|
|
#include "solvespace.h"
|
|
|
|
|
2013-09-19 06:35:56 +00:00
|
|
|
#define VERSION_STRING "\261\262\263" "SolveSpaceREVa"
|
2008-05-29 10:10:12 +00:00
|
|
|
|
2013-08-26 18:58:35 +00:00
|
|
|
static int StrStartsWith(const char *str, const char *start) {
|
2009-05-19 07:26:38 +00:00
|
|
|
return memcmp(str, start, strlen(start)) == 0;
|
|
|
|
}
|
|
|
|
|
2010-02-28 19:23:01 +00:00
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
// Clear and free all the dynamic memory associated with our currently-loaded
|
|
|
|
// sketch. This does not leave the program in an acceptable state (with the
|
|
|
|
// references created, and so on), so anyone calling this must fix that later.
|
|
|
|
//-----------------------------------------------------------------------------
|
2015-03-23 17:49:04 +00:00
|
|
|
void SolveSpaceUI::ClearExisting(void) {
|
2010-02-28 19:23:01 +00:00
|
|
|
UndoClearStack(&redo);
|
|
|
|
UndoClearStack(&undo);
|
|
|
|
|
2016-02-17 10:03:07 +00:00
|
|
|
for(int i = 0; i < SK.groupOrder.n; i++) {
|
|
|
|
Group *g = SK.GetGroup(SK.groupOrder.elem[i]);
|
2010-02-28 19:23:01 +00:00
|
|
|
g->Clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
SK.constraint.Clear();
|
|
|
|
SK.request.Clear();
|
|
|
|
SK.group.Clear();
|
2016-02-17 10:03:07 +00:00
|
|
|
SK.groupOrder.Clear();
|
2010-02-28 19:23:01 +00:00
|
|
|
SK.style.Clear();
|
|
|
|
|
|
|
|
SK.entity.Clear();
|
|
|
|
SK.param.Clear();
|
|
|
|
}
|
|
|
|
|
2015-03-23 17:49:04 +00:00
|
|
|
hGroup SolveSpaceUI::CreateDefaultDrawingGroup(void) {
|
2015-03-27 15:31:23 +00:00
|
|
|
Group g = {};
|
2008-06-02 11:43:27 +00:00
|
|
|
|
|
|
|
// And an empty group, for the first stuff the user draws.
|
|
|
|
g.visible = true;
|
2016-02-17 10:03:07 +00:00
|
|
|
g.name = "sketch-in-plane";
|
2008-06-02 11:43:27 +00:00
|
|
|
g.type = Group::DRAWING_WORKPLANE;
|
|
|
|
g.subtype = Group::WORKPLANE_BY_POINT_ORTHO;
|
2016-02-17 10:03:07 +00:00
|
|
|
g.order = 1;
|
2008-06-02 11:43:27 +00:00
|
|
|
g.predef.q = Quaternion::From(1, 0, 0, 0);
|
|
|
|
hRequest hr = Request::HREQUEST_REFERENCE_XY;
|
|
|
|
g.predef.origin = hr.entity(1);
|
2009-04-19 05:53:16 +00:00
|
|
|
SK.group.AddAndAssignId(&g);
|
|
|
|
SK.GetGroup(g.h)->activeWorkplane = g.h.entity(0);
|
2008-06-02 11:43:27 +00:00
|
|
|
return g.h;
|
|
|
|
}
|
|
|
|
|
2015-03-23 17:49:04 +00:00
|
|
|
void SolveSpaceUI::NewFile(void) {
|
2010-02-28 19:23:01 +00:00
|
|
|
ClearExisting();
|
2008-04-24 06:22:16 +00:00
|
|
|
|
|
|
|
// Our initial group, that contains the references.
|
2015-03-27 15:31:23 +00:00
|
|
|
Group g = {};
|
2008-04-30 04:52:34 +00:00
|
|
|
g.visible = true;
|
2015-11-06 08:40:12 +00:00
|
|
|
g.name = "#references";
|
2008-05-11 10:40:37 +00:00
|
|
|
g.type = Group::DRAWING_3D;
|
2016-02-17 10:03:07 +00:00
|
|
|
g.order = 0;
|
2008-04-24 06:22:16 +00:00
|
|
|
g.h = Group::HGROUP_REFERENCES;
|
2009-04-19 05:53:16 +00:00
|
|
|
SK.group.Add(&g);
|
2008-04-24 06:22:16 +00:00
|
|
|
|
|
|
|
// Let's create three two-d coordinate systems, for the coordinate
|
|
|
|
// planes; these are our references, present in every sketch.
|
2015-03-27 15:31:23 +00:00
|
|
|
Request r = {};
|
2008-04-27 03:26:27 +00:00
|
|
|
r.type = Request::WORKPLANE;
|
2008-04-24 06:22:16 +00:00
|
|
|
r.group = Group::HGROUP_REFERENCES;
|
2008-04-27 03:26:27 +00:00
|
|
|
r.workplane = Entity::FREE_IN_3D;
|
2008-04-24 06:22:16 +00:00
|
|
|
|
|
|
|
r.h = Request::HREQUEST_REFERENCE_XY;
|
2009-04-19 05:53:16 +00:00
|
|
|
SK.request.Add(&r);
|
2008-04-24 06:22:16 +00:00
|
|
|
|
|
|
|
r.h = Request::HREQUEST_REFERENCE_YZ;
|
2009-04-19 05:53:16 +00:00
|
|
|
SK.request.Add(&r);
|
2008-04-24 06:22:16 +00:00
|
|
|
|
|
|
|
r.h = Request::HREQUEST_REFERENCE_ZX;
|
2009-04-19 05:53:16 +00:00
|
|
|
SK.request.Add(&r);
|
2008-04-24 06:22:16 +00:00
|
|
|
|
2008-06-02 11:43:27 +00:00
|
|
|
CreateDefaultDrawingGroup();
|
2008-05-27 02:22:20 +00:00
|
|
|
}
|
2008-04-24 06:22:16 +00:00
|
|
|
|
2015-03-23 17:49:04 +00:00
|
|
|
const SolveSpaceUI::SaveTable SolveSpaceUI::SAVED[] = {
|
2008-05-27 02:22:20 +00:00
|
|
|
{ 'g', "Group.h.v", 'x', &(SS.sv.g.h.v) },
|
|
|
|
{ 'g', "Group.type", 'd', &(SS.sv.g.type) },
|
2008-02-07 09:53:52 +00:00
|
|
|
{ 'g', "Group.order", 'd', &(SS.sv.g.order) },
|
2015-11-06 08:40:12 +00:00
|
|
|
{ 'g', "Group.name", 'S', &(SS.sv.g.name) },
|
2008-05-27 02:22:20 +00:00
|
|
|
{ 'g', "Group.activeWorkplane.v", 'x', &(SS.sv.g.activeWorkplane.v) },
|
|
|
|
{ 'g', "Group.opA.v", 'x', &(SS.sv.g.opA.v) },
|
2008-06-21 10:18:20 +00:00
|
|
|
{ 'g', "Group.opB.v", 'x', &(SS.sv.g.opB.v) },
|
2008-06-14 08:43:38 +00:00
|
|
|
{ 'g', "Group.valA", 'f', &(SS.sv.g.valA) },
|
2008-06-23 08:25:17 +00:00
|
|
|
{ 'g', "Group.valB", 'f', &(SS.sv.g.valB) },
|
|
|
|
{ 'g', "Group.valC", 'f', &(SS.sv.g.valB) },
|
2013-11-03 23:09:17 +00:00
|
|
|
{ 'g', "Group.color", 'c', &(SS.sv.g.color) },
|
2008-05-27 02:22:20 +00:00
|
|
|
{ 'g', "Group.subtype", 'd', &(SS.sv.g.subtype) },
|
2008-06-12 04:36:33 +00:00
|
|
|
{ 'g', "Group.skipFirst", 'b', &(SS.sv.g.skipFirst) },
|
2008-05-27 02:22:20 +00:00
|
|
|
{ 'g', "Group.meshCombine", 'd', &(SS.sv.g.meshCombine) },
|
2009-05-21 09:06:26 +00:00
|
|
|
{ 'g', "Group.forceToMesh", 'd', &(SS.sv.g.forceToMesh) },
|
2008-06-01 08:29:59 +00:00
|
|
|
{ 'g', "Group.predef.q.w", 'f', &(SS.sv.g.predef.q.w) },
|
|
|
|
{ 'g', "Group.predef.q.vx", 'f', &(SS.sv.g.predef.q.vx) },
|
|
|
|
{ 'g', "Group.predef.q.vy", 'f', &(SS.sv.g.predef.q.vy) },
|
|
|
|
{ 'g', "Group.predef.q.vz", 'f', &(SS.sv.g.predef.q.vz) },
|
|
|
|
{ 'g', "Group.predef.origin.v", 'x', &(SS.sv.g.predef.origin.v) },
|
|
|
|
{ 'g', "Group.predef.entityB.v", 'x', &(SS.sv.g.predef.entityB.v) },
|
|
|
|
{ 'g', "Group.predef.entityC.v", 'x', &(SS.sv.g.predef.entityC.v) },
|
|
|
|
{ 'g', "Group.predef.swapUV", 'b', &(SS.sv.g.predef.swapUV) },
|
|
|
|
{ 'g', "Group.predef.negateU", 'b', &(SS.sv.g.predef.negateU) },
|
|
|
|
{ 'g', "Group.predef.negateV", 'b', &(SS.sv.g.predef.negateV) },
|
2008-05-27 02:22:20 +00:00
|
|
|
{ 'g', "Group.visible", 'b', &(SS.sv.g.visible) },
|
2008-02-15 11:35:15 +00:00
|
|
|
{ 'g', "Group.suppress", 'b', &(SS.sv.g.suppress) },
|
2009-10-01 11:22:56 +00:00
|
|
|
{ 'g', "Group.relaxConstraints", 'b', &(SS.sv.g.relaxConstraints) },
|
2016-01-21 15:01:43 +00:00
|
|
|
{ 'g', "Group.allowRedundant", 'b', &(SS.sv.g.allowRedundant) },
|
2010-05-10 01:06:09 +00:00
|
|
|
{ 'g', "Group.allDimsReference", 'b', &(SS.sv.g.allDimsReference) },
|
2009-12-15 12:26:22 +00:00
|
|
|
{ 'g', "Group.scale", 'f', &(SS.sv.g.scale) },
|
2008-05-27 02:22:20 +00:00
|
|
|
{ 'g', "Group.remap", 'M', &(SS.sv.g.remap) },
|
2016-05-07 05:27:54 +00:00
|
|
|
{ 'g', "Group.impFile", 'S', &(SS.sv.g.linkFile) },
|
|
|
|
{ 'g', "Group.impFileRel", 'S', &(SS.sv.g.linkFileRel) },
|
2008-05-27 02:22:20 +00:00
|
|
|
|
|
|
|
{ 'p', "Param.h.v.", 'x', &(SS.sv.p.h.v) },
|
|
|
|
{ 'p', "Param.val", 'f', &(SS.sv.p.val) },
|
|
|
|
|
|
|
|
{ 'r', "Request.h.v", 'x', &(SS.sv.r.h.v) },
|
|
|
|
{ 'r', "Request.type", 'd', &(SS.sv.r.type) },
|
2009-10-21 04:46:01 +00:00
|
|
|
{ 'r', "Request.extraPoints", 'd', &(SS.sv.r.extraPoints) },
|
2008-05-27 02:22:20 +00:00
|
|
|
{ 'r', "Request.workplane.v", 'x', &(SS.sv.r.workplane.v) },
|
|
|
|
{ 'r', "Request.group.v", 'x', &(SS.sv.r.group.v) },
|
|
|
|
{ 'r', "Request.construction", 'b', &(SS.sv.r.construction) },
|
2009-07-20 01:47:59 +00:00
|
|
|
{ 'r', "Request.style", 'x', &(SS.sv.r.style) },
|
2015-11-06 08:40:12 +00:00
|
|
|
{ 'r', "Request.str", 'S', &(SS.sv.r.str) },
|
|
|
|
{ 'r', "Request.font", 'S', &(SS.sv.r.font) },
|
2008-05-27 02:22:20 +00:00
|
|
|
|
|
|
|
{ 'e', "Entity.h.v", 'x', &(SS.sv.e.h.v) },
|
|
|
|
{ 'e', "Entity.type", 'd', &(SS.sv.e.type) },
|
|
|
|
{ 'e', "Entity.construction", 'b', &(SS.sv.e.construction) },
|
2009-07-20 01:47:59 +00:00
|
|
|
{ 'e', "Entity.style", 'x', &(SS.sv.e.style) },
|
2015-11-06 08:40:12 +00:00
|
|
|
{ 'e', "Entity.str", 'S', &(SS.sv.e.str) },
|
|
|
|
{ 'e', "Entity.font", 'S', &(SS.sv.e.font) },
|
2008-05-27 02:22:20 +00:00
|
|
|
{ 'e', "Entity.point[0].v", 'x', &(SS.sv.e.point[0].v) },
|
|
|
|
{ 'e', "Entity.point[1].v", 'x', &(SS.sv.e.point[1].v) },
|
|
|
|
{ 'e', "Entity.point[2].v", 'x', &(SS.sv.e.point[2].v) },
|
|
|
|
{ 'e', "Entity.point[3].v", 'x', &(SS.sv.e.point[3].v) },
|
2009-10-21 04:46:01 +00:00
|
|
|
{ 'e', "Entity.point[4].v", 'x', &(SS.sv.e.point[4].v) },
|
|
|
|
{ 'e', "Entity.point[5].v", 'x', &(SS.sv.e.point[5].v) },
|
|
|
|
{ 'e', "Entity.point[6].v", 'x', &(SS.sv.e.point[6].v) },
|
|
|
|
{ 'e', "Entity.point[7].v", 'x', &(SS.sv.e.point[7].v) },
|
|
|
|
{ 'e', "Entity.point[8].v", 'x', &(SS.sv.e.point[8].v) },
|
|
|
|
{ 'e', "Entity.point[9].v", 'x', &(SS.sv.e.point[9].v) },
|
|
|
|
{ 'e', "Entity.point[10].v", 'x', &(SS.sv.e.point[10].v) },
|
|
|
|
{ 'e', "Entity.point[11].v", 'x', &(SS.sv.e.point[11].v) },
|
|
|
|
{ 'e', "Entity.extraPoints", 'd', &(SS.sv.e.extraPoints) },
|
2008-05-27 02:22:20 +00:00
|
|
|
{ 'e', "Entity.normal.v", 'x', &(SS.sv.e.normal.v) },
|
|
|
|
{ 'e', "Entity.distance.v", 'x', &(SS.sv.e.distance.v) },
|
|
|
|
{ 'e', "Entity.workplane.v", 'x', &(SS.sv.e.workplane.v) },
|
2008-05-29 10:10:12 +00:00
|
|
|
{ 'e', "Entity.actPoint.x", 'f', &(SS.sv.e.actPoint.x) },
|
|
|
|
{ 'e', "Entity.actPoint.y", 'f', &(SS.sv.e.actPoint.y) },
|
|
|
|
{ 'e', "Entity.actPoint.z", 'f', &(SS.sv.e.actPoint.z) },
|
|
|
|
{ 'e', "Entity.actNormal.w", 'f', &(SS.sv.e.actNormal.w) },
|
|
|
|
{ 'e', "Entity.actNormal.vx", 'f', &(SS.sv.e.actNormal.vx) },
|
|
|
|
{ 'e', "Entity.actNormal.vy", 'f', &(SS.sv.e.actNormal.vy) },
|
|
|
|
{ 'e', "Entity.actNormal.vz", 'f', &(SS.sv.e.actNormal.vz) },
|
|
|
|
{ 'e', "Entity.actDistance", 'f', &(SS.sv.e.actDistance) },
|
2008-06-12 04:36:33 +00:00
|
|
|
{ 'e', "Entity.actVisible", 'b', &(SS.sv.e.actVisible), },
|
2008-05-29 10:10:12 +00:00
|
|
|
|
2008-05-27 02:22:20 +00:00
|
|
|
|
|
|
|
{ 'c', "Constraint.h.v", 'x', &(SS.sv.c.h.v) },
|
|
|
|
{ 'c', "Constraint.type", 'd', &(SS.sv.c.type) },
|
|
|
|
{ 'c', "Constraint.group.v", 'x', &(SS.sv.c.group.v) },
|
|
|
|
{ 'c', "Constraint.workplane.v", 'x', &(SS.sv.c.workplane.v) },
|
2008-06-14 08:43:38 +00:00
|
|
|
{ 'c', "Constraint.valA", 'f', &(SS.sv.c.valA) },
|
2008-05-27 02:22:20 +00:00
|
|
|
{ 'c', "Constraint.ptA.v", 'x', &(SS.sv.c.ptA.v) },
|
|
|
|
{ 'c', "Constraint.ptB.v", 'x', &(SS.sv.c.ptB.v) },
|
|
|
|
{ 'c', "Constraint.entityA.v", 'x', &(SS.sv.c.entityA.v) },
|
|
|
|
{ 'c', "Constraint.entityB.v", 'x', &(SS.sv.c.entityB.v) },
|
2008-07-20 12:24:43 +00:00
|
|
|
{ 'c', "Constraint.entityC.v", 'x', &(SS.sv.c.entityC.v) },
|
|
|
|
{ 'c', "Constraint.entityD.v", 'x', &(SS.sv.c.entityD.v) },
|
2008-07-13 12:44:05 +00:00
|
|
|
{ 'c', "Constraint.other", 'b', &(SS.sv.c.other) },
|
2010-05-10 04:14:06 +00:00
|
|
|
{ 'c', "Constraint.other2", 'b', &(SS.sv.c.other2) },
|
2008-06-11 04:22:52 +00:00
|
|
|
{ 'c', "Constraint.reference", 'b', &(SS.sv.c.reference) },
|
2015-11-06 08:40:12 +00:00
|
|
|
{ 'c', "Constraint.comment", 'S', &(SS.sv.c.comment) },
|
2008-05-27 02:22:20 +00:00
|
|
|
{ 'c', "Constraint.disp.offset.x", 'f', &(SS.sv.c.disp.offset.x) },
|
|
|
|
{ 'c', "Constraint.disp.offset.y", 'f', &(SS.sv.c.disp.offset.y) },
|
|
|
|
{ 'c', "Constraint.disp.offset.z", 'f', &(SS.sv.c.disp.offset.z) },
|
2009-07-20 01:47:59 +00:00
|
|
|
{ 'c', "Constraint.disp.style", 'x', &(SS.sv.c.disp.style) },
|
2008-05-27 02:22:20 +00:00
|
|
|
|
2009-09-17 07:32:36 +00:00
|
|
|
{ 's', "Style.h.v", 'x', &(SS.sv.s.h.v) },
|
2015-11-06 08:40:12 +00:00
|
|
|
{ 's', "Style.name", 'S', &(SS.sv.s.name) },
|
2009-09-17 07:32:36 +00:00
|
|
|
{ 's', "Style.width", 'f', &(SS.sv.s.width) },
|
2009-09-24 15:52:48 +00:00
|
|
|
{ 's', "Style.widthAs", 'd', &(SS.sv.s.widthAs) },
|
|
|
|
{ 's', "Style.textHeight", 'f', &(SS.sv.s.textHeight) },
|
|
|
|
{ 's', "Style.textHeightAs", 'd', &(SS.sv.s.textHeightAs) },
|
2009-09-29 11:35:19 +00:00
|
|
|
{ 's', "Style.textAngle", 'f', &(SS.sv.s.textAngle) },
|
2009-09-24 15:52:48 +00:00
|
|
|
{ 's', "Style.textOrigin", 'x', &(SS.sv.s.textOrigin) },
|
2013-11-03 23:09:17 +00:00
|
|
|
{ 's', "Style.color", 'c', &(SS.sv.s.color) },
|
2013-11-03 23:41:11 +00:00
|
|
|
{ 's', "Style.fillColor", 'c', &(SS.sv.s.fillColor) },
|
2009-10-22 17:16:20 +00:00
|
|
|
{ 's', "Style.filled", 'b', &(SS.sv.s.filled) },
|
2009-09-17 07:32:36 +00:00
|
|
|
{ 's', "Style.visible", 'b', &(SS.sv.s.visible) },
|
|
|
|
{ 's', "Style.exportable", 'b', &(SS.sv.s.exportable) },
|
2016-02-23 18:00:39 +00:00
|
|
|
{ 's', "Style.stippleType", 'd', &(SS.sv.s.stippleType) },
|
|
|
|
{ 's', "Style.stippleScale", 'f', &(SS.sv.s.stippleScale) },
|
2009-09-17 07:32:36 +00:00
|
|
|
|
2013-08-26 20:54:04 +00:00
|
|
|
{ 0, NULL, 0, NULL }
|
2008-04-24 06:22:16 +00:00
|
|
|
};
|
|
|
|
|
2016-01-15 12:30:53 +00:00
|
|
|
struct SAVEDptr {
|
|
|
|
IdList<EntityMap,EntityId> &M() { return *((IdList<EntityMap,EntityId> *)this); }
|
|
|
|
std::string &S() { return *((std::string *)this); }
|
|
|
|
bool &b() { return *((bool *)this); }
|
|
|
|
RgbaColor &c() { return *((RgbaColor *)this); }
|
|
|
|
int &d() { return *((int *)this); }
|
|
|
|
double &f() { return *((double *)this); }
|
|
|
|
uint32_t &x() { return *((uint32_t *)this); }
|
2013-11-13 05:46:40 +00:00
|
|
|
};
|
|
|
|
|
2015-03-23 17:49:04 +00:00
|
|
|
void SolveSpaceUI::SaveUsingTable(int type) {
|
2008-04-24 06:22:16 +00:00
|
|
|
int i;
|
|
|
|
for(i = 0; SAVED[i].type != 0; i++) {
|
|
|
|
if(SAVED[i].type != type) continue;
|
2008-05-29 10:10:12 +00:00
|
|
|
|
|
|
|
int fmt = SAVED[i].fmt;
|
2016-01-15 12:30:53 +00:00
|
|
|
SAVEDptr *p = (SAVEDptr *)SAVED[i].ptr;
|
2008-05-29 10:10:12 +00:00
|
|
|
// Any items that aren't specified are assumed to be zero
|
2016-01-15 12:30:53 +00:00
|
|
|
if(fmt == 'S' && p->S().empty()) continue;
|
|
|
|
if(fmt == 'd' && p->d() == 0) continue;
|
|
|
|
if(fmt == 'f' && EXACT(p->f() == 0.0)) continue;
|
|
|
|
if(fmt == 'x' && p->x() == 0) continue;
|
2008-05-29 10:10:12 +00:00
|
|
|
|
|
|
|
fprintf(fh, "%s=", SAVED[i].desc);
|
|
|
|
switch(fmt) {
|
2016-01-15 12:30:53 +00:00
|
|
|
case 'S': fprintf(fh, "%s", p->S().c_str()); break;
|
|
|
|
case 'b': fprintf(fh, "%d", p->b() ? 1 : 0); break;
|
|
|
|
case 'c': fprintf(fh, "%08x", p->c().ToPackedInt()); break;
|
|
|
|
case 'd': fprintf(fh, "%d", p->d()); break;
|
|
|
|
case 'f': fprintf(fh, "%.20f", p->f()); break;
|
|
|
|
case 'x': fprintf(fh, "%08x", p->x()); break;
|
2008-04-27 10:01:23 +00:00
|
|
|
|
|
|
|
case 'M': {
|
|
|
|
int j;
|
|
|
|
fprintf(fh, "{\n");
|
2016-01-15 12:30:53 +00:00
|
|
|
for(j = 0; j < p->M().n; j++) {
|
|
|
|
EntityMap *em = &(p->M().elem[j]);
|
2015-03-29 00:30:52 +00:00
|
|
|
fprintf(fh, " %d %08x %d\n",
|
2008-04-27 10:01:23 +00:00
|
|
|
em->h.v, em->input.v, em->copyNumber);
|
|
|
|
}
|
|
|
|
fprintf(fh, "}");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2008-04-24 06:22:16 +00:00
|
|
|
default: oops();
|
|
|
|
}
|
|
|
|
fprintf(fh, "\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-12-27 01:03:24 +00:00
|
|
|
bool SolveSpaceUI::SaveToFile(const std::string &filename) {
|
2008-06-13 04:41:27 +00:00
|
|
|
// Make sure all the entities are regenerated up to date, since they
|
2016-05-07 05:27:54 +00:00
|
|
|
// will be exported. We reload the linked files because that rewrites
|
|
|
|
// the linkFileRel for our possibly-new filename.
|
2015-03-18 17:02:11 +00:00
|
|
|
SS.ScheduleShowTW();
|
2015-05-21 12:26:29 +00:00
|
|
|
SS.ReloadAllImported();
|
2016-01-27 09:09:45 +00:00
|
|
|
SS.GenerateAll(SolveSpaceUI::GENERATE_ALL);
|
2008-06-13 04:41:27 +00:00
|
|
|
|
2015-12-27 08:09:00 +00:00
|
|
|
fh = ssfopen(filename, "wb");
|
2015-03-29 00:30:52 +00:00
|
|
|
if(!fh) {
|
2015-12-27 01:03:24 +00:00
|
|
|
Error("Couldn't write to file '%s'", filename.c_str());
|
2008-04-18 11:11:48 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2008-05-29 10:10:12 +00:00
|
|
|
fprintf(fh, "%s\n\n\n", VERSION_STRING);
|
2008-04-18 11:11:48 +00:00
|
|
|
|
2009-05-19 07:26:38 +00:00
|
|
|
int i, j;
|
2009-04-19 05:53:16 +00:00
|
|
|
for(i = 0; i < SK.group.n; i++) {
|
|
|
|
sv.g = SK.group.elem[i];
|
2008-04-24 06:22:16 +00:00
|
|
|
SaveUsingTable('g');
|
2008-04-18 11:11:48 +00:00
|
|
|
fprintf(fh, "AddGroup\n\n");
|
|
|
|
}
|
|
|
|
|
2009-04-19 05:53:16 +00:00
|
|
|
for(i = 0; i < SK.param.n; i++) {
|
|
|
|
sv.p = SK.param.elem[i];
|
2008-04-24 06:22:16 +00:00
|
|
|
SaveUsingTable('p');
|
2008-04-18 11:11:48 +00:00
|
|
|
fprintf(fh, "AddParam\n\n");
|
|
|
|
}
|
|
|
|
|
2009-04-19 05:53:16 +00:00
|
|
|
for(i = 0; i < SK.request.n; i++) {
|
|
|
|
sv.r = SK.request.elem[i];
|
2008-04-24 06:22:16 +00:00
|
|
|
SaveUsingTable('r');
|
2008-04-18 11:11:48 +00:00
|
|
|
fprintf(fh, "AddRequest\n\n");
|
|
|
|
}
|
|
|
|
|
2009-04-19 05:53:16 +00:00
|
|
|
for(i = 0; i < SK.entity.n; i++) {
|
|
|
|
(SK.entity.elem[i]).CalculateNumerical(true);
|
|
|
|
sv.e = SK.entity.elem[i];
|
2008-04-24 06:22:16 +00:00
|
|
|
SaveUsingTable('e');
|
2008-04-18 11:11:48 +00:00
|
|
|
fprintf(fh, "AddEntity\n\n");
|
|
|
|
}
|
|
|
|
|
2009-04-19 05:53:16 +00:00
|
|
|
for(i = 0; i < SK.constraint.n; i++) {
|
|
|
|
sv.c = SK.constraint.elem[i];
|
2008-04-24 06:22:16 +00:00
|
|
|
SaveUsingTable('c');
|
2008-04-18 11:11:48 +00:00
|
|
|
fprintf(fh, "AddConstraint\n\n");
|
|
|
|
}
|
|
|
|
|
2009-09-17 07:32:36 +00:00
|
|
|
for(i = 0; i < SK.style.n; i++) {
|
|
|
|
sv.s = SK.style.elem[i];
|
|
|
|
if(sv.s.h.v >= Style::FIRST_CUSTOM) {
|
|
|
|
SaveUsingTable('s');
|
|
|
|
fprintf(fh, "AddStyle\n\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-21 09:06:26 +00:00
|
|
|
// A group will have either a mesh or a shell, but not both; but the code
|
|
|
|
// to print either of those just does nothing if the mesh/shell is empty.
|
|
|
|
|
2016-02-17 10:03:07 +00:00
|
|
|
Group *g = SK.GetGroup(SK.groupOrder.elem[SK.groupOrder.n - 1]);
|
|
|
|
SMesh *m = &g->runningMesh;
|
2008-05-29 10:10:12 +00:00
|
|
|
for(i = 0; i < m->l.n; i++) {
|
|
|
|
STriangle *tr = &(m->l.elem[i]);
|
2015-03-26 10:30:12 +00:00
|
|
|
fprintf(fh, "Triangle %08x %08x "
|
2008-06-04 06:39:32 +00:00
|
|
|
"%.20f %.20f %.20f %.20f %.20f %.20f %.20f %.20f %.20f\n",
|
Replaced RGB-color integers with dedicated data structure
RGB colors were represented using a uint32_t with the red, green and blue
values stuffed into the lower three octets (i.e. 0x00BBGGRR), like
Microsoft's COLORREF. This approach did not lend itself to type safety,
however, so this change replaces it with an RgbColor class that provides
the same infomation plus a handful of useful methods to work with it. (Note
that sizeof(RgbColor) == sizeof(uint32_t), so this change should not lead
to memory bloat.)
Some of the new methods/fields replace what were previously macro calls;
e.g. RED(c) is now c.red, REDf(c) is now c.redF(). The .Equals() method is
now used instead of == to compare colors.
RGB colors still need to be represented as packed integers in file I/O and
preferences, so the methods .FromPackedInt() and .ToPackedInt() are
provided. Also implemented are Cnf{Freeze,Thaw}Color(), type-safe wrappers
around Cnf{Freeze,Thaw}Int() that facilitate I/O with preferences.
(Cnf{Freeze,Thaw}Color() are defined outside of the system-dependent code
to minimize the footprint of the latter; because the same can be done with
Cnf{Freeze,Thaw}Bool(), those are also moved out of the system code with
this commit.)
Color integers were being OR'ed with 0x80000000 in some places for two
distinct purposes: One, to indicate use of a default color in
glxFillMesh(); this has been replaced by use of the .UseDefault() method.
Two, to indicate to TextWindow::Printf() that the format argument of a
"%Bp"/"%Fp" specifier is an RGB color rather than a color "code" from
TextWindow::bgColors[] or TextWindow::fgColors[] (as the specifier can
accept either); instead, we define a new flag "z" (as in "%Bz" or "%Fz") to
indicate an RGBcolor pointer, leaving "%Bp"/"%Fp" to indicate a color code
exclusively.
(This also allows TextWindow::meta[][].bg to be a char instead of an int,
partly compensating for the new .bgRgb field added immediately after.)
In array declarations, RGB colors could previously be specified as 0 (often
in a terminating element). As that no longer works, we define NULL_COLOR,
which serves much the same purpose for RgbColor variables as NULL serves
for pointers.
2013-10-16 20:00:58 +00:00
|
|
|
tr->meta.face, tr->meta.color.ToPackedInt(),
|
2008-05-29 10:10:12 +00:00
|
|
|
CO(tr->a), CO(tr->b), CO(tr->c));
|
|
|
|
}
|
|
|
|
|
2016-02-17 10:03:07 +00:00
|
|
|
SShell *s = &g->runningShell;
|
2009-05-19 07:26:38 +00:00
|
|
|
SSurface *srf;
|
|
|
|
for(srf = s->surface.First(); srf; srf = s->surface.NextAfter(srf)) {
|
|
|
|
fprintf(fh, "Surface %08x %08x %08x %d %d\n",
|
Replaced RGB-color integers with dedicated data structure
RGB colors were represented using a uint32_t with the red, green and blue
values stuffed into the lower three octets (i.e. 0x00BBGGRR), like
Microsoft's COLORREF. This approach did not lend itself to type safety,
however, so this change replaces it with an RgbColor class that provides
the same infomation plus a handful of useful methods to work with it. (Note
that sizeof(RgbColor) == sizeof(uint32_t), so this change should not lead
to memory bloat.)
Some of the new methods/fields replace what were previously macro calls;
e.g. RED(c) is now c.red, REDf(c) is now c.redF(). The .Equals() method is
now used instead of == to compare colors.
RGB colors still need to be represented as packed integers in file I/O and
preferences, so the methods .FromPackedInt() and .ToPackedInt() are
provided. Also implemented are Cnf{Freeze,Thaw}Color(), type-safe wrappers
around Cnf{Freeze,Thaw}Int() that facilitate I/O with preferences.
(Cnf{Freeze,Thaw}Color() are defined outside of the system-dependent code
to minimize the footprint of the latter; because the same can be done with
Cnf{Freeze,Thaw}Bool(), those are also moved out of the system code with
this commit.)
Color integers were being OR'ed with 0x80000000 in some places for two
distinct purposes: One, to indicate use of a default color in
glxFillMesh(); this has been replaced by use of the .UseDefault() method.
Two, to indicate to TextWindow::Printf() that the format argument of a
"%Bp"/"%Fp" specifier is an RGB color rather than a color "code" from
TextWindow::bgColors[] or TextWindow::fgColors[] (as the specifier can
accept either); instead, we define a new flag "z" (as in "%Bz" or "%Fz") to
indicate an RGBcolor pointer, leaving "%Bp"/"%Fp" to indicate a color code
exclusively.
(This also allows TextWindow::meta[][].bg to be a char instead of an int,
partly compensating for the new .bgRgb field added immediately after.)
In array declarations, RGB colors could previously be specified as 0 (often
in a terminating element). As that no longer works, we define NULL_COLOR,
which serves much the same purpose for RgbColor variables as NULL serves
for pointers.
2013-10-16 20:00:58 +00:00
|
|
|
srf->h.v, srf->color.ToPackedInt(), srf->face, srf->degm, srf->degn);
|
2009-05-19 07:26:38 +00:00
|
|
|
for(i = 0; i <= srf->degm; i++) {
|
|
|
|
for(j = 0; j <= srf->degn; j++) {
|
|
|
|
fprintf(fh, "SCtrl %d %d %.20f %.20f %.20f Weight %20.20f\n",
|
|
|
|
i, j, CO(srf->ctrl[i][j]), srf->weight[i][j]);
|
|
|
|
}
|
|
|
|
}
|
2015-03-29 00:30:52 +00:00
|
|
|
|
2009-05-19 07:26:38 +00:00
|
|
|
STrimBy *stb;
|
|
|
|
for(stb = srf->trim.First(); stb; stb = srf->trim.NextAfter(stb)) {
|
|
|
|
fprintf(fh, "TrimBy %08x %d %.20f %.20f %.20f %.20f %.20f %.20f\n",
|
|
|
|
stb->curve.v, stb->backwards ? 1 : 0,
|
|
|
|
CO(stb->start), CO(stb->finish));
|
|
|
|
}
|
|
|
|
|
|
|
|
fprintf(fh, "AddSurface\n");
|
|
|
|
}
|
|
|
|
SCurve *sc;
|
|
|
|
for(sc = s->curve.First(); sc; sc = s->curve.NextAfter(sc)) {
|
|
|
|
fprintf(fh, "Curve %08x %d %d %08x %08x\n",
|
|
|
|
sc->h.v,
|
|
|
|
sc->isExact ? 1 : 0, sc->exact.deg,
|
|
|
|
sc->surfA.v, sc->surfB.v);
|
|
|
|
|
|
|
|
if(sc->isExact) {
|
|
|
|
for(i = 0; i <= sc->exact.deg; i++) {
|
|
|
|
fprintf(fh, "CCtrl %d %.20f %.20f %.20f Weight %.20f\n",
|
|
|
|
i, CO(sc->exact.ctrl[i]), sc->exact.weight[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
SCurvePt *scpt;
|
|
|
|
for(scpt = sc->pts.First(); scpt; scpt = sc->pts.NextAfter(scpt)) {
|
|
|
|
fprintf(fh, "CurvePt %d %.20f %.20f %.20f\n",
|
|
|
|
scpt->vertex ? 1 : 0, CO(scpt->p));
|
|
|
|
}
|
|
|
|
|
|
|
|
fprintf(fh, "AddCurve\n");
|
|
|
|
}
|
|
|
|
|
2008-04-18 11:11:48 +00:00
|
|
|
fclose(fh);
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2015-03-23 17:49:04 +00:00
|
|
|
void SolveSpaceUI::LoadUsingTable(char *key, char *val) {
|
2008-04-27 10:01:23 +00:00
|
|
|
int i;
|
|
|
|
for(i = 0; SAVED[i].type != 0; i++) {
|
|
|
|
if(strcmp(SAVED[i].desc, key)==0) {
|
2016-01-15 12:30:53 +00:00
|
|
|
SAVEDptr *p = (SAVEDptr *)SAVED[i].ptr;
|
Use C99 integer types and C++ boolean types/values
This change comprehensively replaces the use of Microsoft-standard integer
and boolean types with their C99/C++ standard equivalents, as the latter is
more appropriate for a cross-platform application. With matter-of-course
exceptions in the Win32-specific code, the types/values have been converted
as follows:
QWORD --> uint64_t
SQWORD --> int64_t
DWORD --> uint32_t
SDWORD --> int32_t
WORD --> uint16_t
SWORD --> int16_t
BYTE --> uint8_t
BOOL --> bool
TRUE --> true
FALSE --> false
The following related changes are also included:
* Added C99 integer type definitions for Windows, as stdint.h is not
available prior to Visual Studio 2010
* Changed types of some variables in the SolveSpace class from 'int' to
'bool', as they actually represent boolean settings
* Implemented new Cnf{Freeze,Thaw}Bool() functions to support boolean
variables in the Registry
* Cnf{Freeze,Thaw}DWORD() are now Cnf{Freeze,Thaw}Int()
* TtfFont::Get{WORD,DWORD}() are now TtfFont::Get{USHORT,ULONG}() (names
inspired by the OpenType spec)
* RGB colors are packed into an integer of type uint32_t (nee DWORD), but
in a few places, these were represented by an int; these have been
corrected to uint32_t
2013-10-02 05:45:13 +00:00
|
|
|
unsigned int u = 0;
|
2008-04-27 10:01:23 +00:00
|
|
|
switch(SAVED[i].fmt) {
|
2016-01-15 12:30:53 +00:00
|
|
|
case 'S': p->S() = val; break;
|
|
|
|
case 'b': p->b() = (atoi(val) != 0); break;
|
|
|
|
case 'd': p->d() = atoi(val); break;
|
|
|
|
case 'f': p->f() = atof(val); break;
|
|
|
|
case 'x': sscanf(val, "%x", &u); p->x()= u; break;
|
2008-04-27 10:01:23 +00:00
|
|
|
|
2013-11-03 23:09:17 +00:00
|
|
|
case 'c':
|
|
|
|
sscanf(val, "%x", &u);
|
2016-01-15 12:30:53 +00:00
|
|
|
p->c() = RgbaColor::FromPackedInt(u);
|
2013-11-03 23:09:17 +00:00
|
|
|
break;
|
|
|
|
|
2008-05-29 10:10:12 +00:00
|
|
|
case 'P':
|
2016-01-15 12:30:53 +00:00
|
|
|
p->S() = val;
|
2008-05-29 10:10:12 +00:00
|
|
|
break;
|
|
|
|
|
2008-04-27 10:01:23 +00:00
|
|
|
case 'M': {
|
2008-05-11 06:09:46 +00:00
|
|
|
// Don't clear this list! When the group gets added, it
|
|
|
|
// makes a shallow copy, so that would result in us
|
|
|
|
// freeing memory that we want to keep around. Just
|
|
|
|
// zero it out so that new memory is allocated.
|
2016-01-15 12:30:53 +00:00
|
|
|
p->M() = {};
|
2008-04-27 10:01:23 +00:00
|
|
|
for(;;) {
|
|
|
|
EntityMap em;
|
|
|
|
char line2[1024];
|
2013-08-26 20:48:41 +00:00
|
|
|
if (fgets(line2, (int)sizeof(line2), fh) == NULL)
|
|
|
|
break;
|
2008-04-27 10:01:23 +00:00
|
|
|
if(sscanf(line2, "%d %x %d", &(em.h.v), &(em.input.v),
|
|
|
|
&(em.copyNumber)) == 3)
|
|
|
|
{
|
2016-01-15 12:30:53 +00:00
|
|
|
p->M().Add(&em);
|
2008-04-27 10:01:23 +00:00
|
|
|
} else {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
default: oops();
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2009-12-15 12:26:22 +00:00
|
|
|
if(SAVED[i].type == 0) {
|
|
|
|
fileLoadError = true;
|
|
|
|
}
|
2008-04-27 10:01:23 +00:00
|
|
|
}
|
|
|
|
|
2015-12-27 01:03:24 +00:00
|
|
|
bool SolveSpaceUI::LoadFromFile(const std::string &filename) {
|
2008-06-25 05:14:49 +00:00
|
|
|
allConsistent = false;
|
2009-12-15 12:26:22 +00:00
|
|
|
fileLoadError = false;
|
2008-06-25 05:14:49 +00:00
|
|
|
|
2015-12-27 08:09:00 +00:00
|
|
|
fh = ssfopen(filename, "rb");
|
2015-03-29 00:30:52 +00:00
|
|
|
if(!fh) {
|
2015-12-27 01:03:24 +00:00
|
|
|
Error("Couldn't read from file '%s'", filename.c_str());
|
2008-04-18 11:11:48 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2010-02-28 19:23:01 +00:00
|
|
|
ClearExisting();
|
2008-06-12 07:31:41 +00:00
|
|
|
|
2015-03-27 15:31:23 +00:00
|
|
|
sv = {};
|
2009-12-15 12:26:22 +00:00
|
|
|
sv.g.scale = 1; // default is 1, not 0; so legacy files need this
|
2016-02-27 06:15:15 +00:00
|
|
|
Style::FillDefaultStyle(&sv.s);
|
2008-04-24 06:22:16 +00:00
|
|
|
|
|
|
|
char line[1024];
|
2013-08-26 20:09:15 +00:00
|
|
|
while(fgets(line, (int)sizeof(line), fh)) {
|
2008-04-24 06:22:16 +00:00
|
|
|
char *s = strchr(line, '\n');
|
|
|
|
if(s) *s = '\0';
|
2009-01-10 08:18:54 +00:00
|
|
|
// We should never get files with \r characters in them, but mailers
|
|
|
|
// will sometimes mangle attachments.
|
|
|
|
s = strchr(line, '\r');
|
|
|
|
if(s) *s = '\0';
|
2008-04-24 06:22:16 +00:00
|
|
|
|
|
|
|
if(*line == '\0') continue;
|
2015-03-29 00:30:52 +00:00
|
|
|
|
2008-04-24 06:22:16 +00:00
|
|
|
char *e = strchr(line, '=');
|
|
|
|
if(e) {
|
|
|
|
*e = '\0';
|
|
|
|
char *key = line, *val = e+1;
|
2008-04-27 10:01:23 +00:00
|
|
|
LoadUsingTable(key, val);
|
2008-04-24 06:22:16 +00:00
|
|
|
} else if(strcmp(line, "AddGroup")==0) {
|
2016-05-07 05:27:54 +00:00
|
|
|
// legacy files have a spurious dependency between linked groups
|
2016-02-02 05:43:41 +00:00
|
|
|
// and their parent groups, remove
|
2016-05-07 05:27:54 +00:00
|
|
|
if(sv.g.type == Group::LINKED)
|
2016-02-02 05:43:41 +00:00
|
|
|
sv.g.opA.v = 0;
|
|
|
|
|
2009-04-19 05:53:16 +00:00
|
|
|
SK.group.Add(&(sv.g));
|
2015-03-27 15:31:23 +00:00
|
|
|
sv.g = {};
|
2009-12-15 12:26:22 +00:00
|
|
|
sv.g.scale = 1; // default is 1, not 0; so legacy files need this
|
2008-04-24 06:22:16 +00:00
|
|
|
} else if(strcmp(line, "AddParam")==0) {
|
|
|
|
// params are regenerated, but we want to preload the values
|
|
|
|
// for initial guesses
|
2009-04-19 05:53:16 +00:00
|
|
|
SK.param.Add(&(sv.p));
|
2015-03-27 15:31:23 +00:00
|
|
|
sv.p = {};
|
2008-04-24 06:22:16 +00:00
|
|
|
} else if(strcmp(line, "AddEntity")==0) {
|
|
|
|
// entities are regenerated
|
|
|
|
} else if(strcmp(line, "AddRequest")==0) {
|
2009-04-19 05:53:16 +00:00
|
|
|
SK.request.Add(&(sv.r));
|
2015-03-27 15:31:23 +00:00
|
|
|
sv.r = {};
|
2008-04-24 06:22:16 +00:00
|
|
|
} else if(strcmp(line, "AddConstraint")==0) {
|
2009-04-19 05:53:16 +00:00
|
|
|
SK.constraint.Add(&(sv.c));
|
2015-03-27 15:31:23 +00:00
|
|
|
sv.c = {};
|
2009-09-17 07:32:36 +00:00
|
|
|
} else if(strcmp(line, "AddStyle")==0) {
|
|
|
|
SK.style.Add(&(sv.s));
|
2015-03-27 15:31:23 +00:00
|
|
|
sv.s = {};
|
2016-02-27 06:15:15 +00:00
|
|
|
Style::FillDefaultStyle(&sv.s);
|
2008-05-29 10:10:12 +00:00
|
|
|
} else if(strcmp(line, VERSION_STRING)==0) {
|
2008-04-24 06:22:16 +00:00
|
|
|
// do nothing, version string
|
2009-05-19 07:26:38 +00:00
|
|
|
} else if(StrStartsWith(line, "Triangle ") ||
|
|
|
|
StrStartsWith(line, "Surface ") ||
|
|
|
|
StrStartsWith(line, "SCtrl ") ||
|
|
|
|
StrStartsWith(line, "TrimBy ") ||
|
|
|
|
StrStartsWith(line, "Curve ") ||
|
|
|
|
StrStartsWith(line, "CCtrl ") ||
|
|
|
|
StrStartsWith(line, "CurvePt ") ||
|
|
|
|
strcmp(line, "AddSurface")==0 ||
|
|
|
|
strcmp(line, "AddCurve")==0)
|
|
|
|
{
|
|
|
|
// ignore the mesh or shell, since we regenerate that
|
2008-04-24 06:22:16 +00:00
|
|
|
} else {
|
2009-12-15 12:26:22 +00:00
|
|
|
fileLoadError = true;
|
2008-04-24 06:22:16 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fclose(fh);
|
|
|
|
|
2009-12-15 12:26:22 +00:00
|
|
|
if(fileLoadError) {
|
|
|
|
Error("Unrecognized data in file. This file may be corrupt, or "
|
|
|
|
"from a new version of the program.");
|
2010-01-25 01:32:36 +00:00
|
|
|
// At least leave the program in a non-crashing state.
|
|
|
|
if(SK.group.n == 0) {
|
|
|
|
NewFile();
|
|
|
|
}
|
2009-12-15 12:26:22 +00:00
|
|
|
}
|
|
|
|
|
2008-04-18 11:11:48 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2015-12-27 01:03:24 +00:00
|
|
|
bool SolveSpaceUI::LoadEntitiesFromFile(const std::string &filename, EntityList *le,
|
2015-03-27 15:31:23 +00:00
|
|
|
SMesh *m, SShell *sh)
|
2009-05-19 07:26:38 +00:00
|
|
|
{
|
2015-03-27 15:31:23 +00:00
|
|
|
SSurface srf = {};
|
|
|
|
SCurve crv = {};
|
2009-05-19 07:26:38 +00:00
|
|
|
|
2015-12-27 08:09:00 +00:00
|
|
|
fh = ssfopen(filename, "rb");
|
2008-05-29 10:10:12 +00:00
|
|
|
if(!fh) return false;
|
|
|
|
|
|
|
|
le->Clear();
|
2015-03-27 15:31:23 +00:00
|
|
|
sv = {};
|
2008-05-29 10:10:12 +00:00
|
|
|
|
|
|
|
char line[1024];
|
2013-08-26 20:09:15 +00:00
|
|
|
while(fgets(line, (int)sizeof(line), fh)) {
|
2008-05-29 10:10:12 +00:00
|
|
|
char *s = strchr(line, '\n');
|
|
|
|
if(s) *s = '\0';
|
2009-01-10 08:18:54 +00:00
|
|
|
// We should never get files with \r characters in them, but mailers
|
|
|
|
// will sometimes mangle attachments.
|
|
|
|
s = strchr(line, '\r');
|
|
|
|
if(s) *s = '\0';
|
2008-05-29 10:10:12 +00:00
|
|
|
|
|
|
|
if(*line == '\0') continue;
|
2015-03-29 00:30:52 +00:00
|
|
|
|
2008-05-29 10:10:12 +00:00
|
|
|
char *e = strchr(line, '=');
|
|
|
|
if(e) {
|
|
|
|
*e = '\0';
|
|
|
|
char *key = line, *val = e+1;
|
|
|
|
LoadUsingTable(key, val);
|
|
|
|
} else if(strcmp(line, "AddGroup")==0) {
|
2008-06-04 10:22:30 +00:00
|
|
|
// Don't leak memory; these get allocated whether we want them
|
|
|
|
// or not.
|
|
|
|
sv.g.remap.Clear();
|
2008-05-29 10:10:12 +00:00
|
|
|
} else if(strcmp(line, "AddParam")==0) {
|
|
|
|
|
|
|
|
} else if(strcmp(line, "AddEntity")==0) {
|
|
|
|
le->Add(&(sv.e));
|
2015-03-27 15:31:23 +00:00
|
|
|
sv.e = {};
|
2008-05-29 10:10:12 +00:00
|
|
|
} else if(strcmp(line, "AddRequest")==0) {
|
|
|
|
|
|
|
|
} else if(strcmp(line, "AddConstraint")==0) {
|
2008-06-14 08:43:38 +00:00
|
|
|
|
2009-09-24 15:52:48 +00:00
|
|
|
} else if(strcmp(line, "AddStyle")==0) {
|
|
|
|
|
2008-05-29 10:10:12 +00:00
|
|
|
} else if(strcmp(line, VERSION_STRING)==0) {
|
|
|
|
|
2009-05-19 07:26:38 +00:00
|
|
|
} else if(StrStartsWith(line, "Triangle ")) {
|
2015-03-27 15:31:23 +00:00
|
|
|
STriangle tr = {};
|
2015-03-26 10:30:12 +00:00
|
|
|
unsigned int rgba = 0;
|
2008-05-30 06:09:41 +00:00
|
|
|
if(sscanf(line, "Triangle %x %x "
|
|
|
|
"%lf %lf %lf %lf %lf %lf %lf %lf %lf",
|
2015-03-26 10:30:12 +00:00
|
|
|
&(tr.meta.face), &rgba,
|
2015-03-29 00:30:52 +00:00
|
|
|
&(tr.a.x), &(tr.a.y), &(tr.a.z),
|
|
|
|
&(tr.b.x), &(tr.b.y), &(tr.b.z),
|
2015-03-26 10:30:12 +00:00
|
|
|
&(tr.c.x), &(tr.c.y), &(tr.c.z)) != 11) {
|
2008-05-29 10:10:12 +00:00
|
|
|
oops();
|
|
|
|
}
|
2015-07-10 11:54:39 +00:00
|
|
|
tr.meta.color = RgbaColor::FromPackedInt((uint32_t)rgba);
|
2008-05-29 10:10:12 +00:00
|
|
|
m->AddTriangle(&tr);
|
2009-05-19 07:26:38 +00:00
|
|
|
} else if(StrStartsWith(line, "Surface ")) {
|
2015-03-26 10:30:12 +00:00
|
|
|
unsigned int rgba = 0;
|
2009-05-19 07:26:38 +00:00
|
|
|
if(sscanf(line, "Surface %x %x %x %d %d",
|
2015-03-26 10:30:12 +00:00
|
|
|
&(srf.h.v), &rgba, &(srf.face),
|
|
|
|
&(srf.degm), &(srf.degn)) != 5) {
|
2009-05-19 07:26:38 +00:00
|
|
|
oops();
|
|
|
|
}
|
2015-07-10 11:54:39 +00:00
|
|
|
srf.color = RgbaColor::FromPackedInt((uint32_t)rgba);
|
2009-05-19 07:26:38 +00:00
|
|
|
} else if(StrStartsWith(line, "SCtrl ")) {
|
|
|
|
int i, j;
|
|
|
|
Vector c;
|
|
|
|
double w;
|
|
|
|
if(sscanf(line, "SCtrl %d %d %lf %lf %lf Weight %lf",
|
|
|
|
&i, &j, &(c.x), &(c.y), &(c.z), &w) != 6)
|
|
|
|
{
|
|
|
|
oops();
|
|
|
|
}
|
|
|
|
srf.ctrl[i][j] = c;
|
|
|
|
srf.weight[i][j] = w;
|
|
|
|
} else if(StrStartsWith(line, "TrimBy ")) {
|
2015-03-27 15:31:23 +00:00
|
|
|
STrimBy stb = {};
|
2009-05-19 07:26:38 +00:00
|
|
|
int backwards;
|
|
|
|
if(sscanf(line, "TrimBy %x %d %lf %lf %lf %lf %lf %lf",
|
|
|
|
&(stb.curve.v), &backwards,
|
|
|
|
&(stb.start.x), &(stb.start.y), &(stb.start.z),
|
|
|
|
&(stb.finish.x), &(stb.finish.y), &(stb.finish.z)) != 8)
|
|
|
|
{
|
|
|
|
oops();
|
|
|
|
}
|
|
|
|
stb.backwards = (backwards != 0);
|
|
|
|
srf.trim.Add(&stb);
|
|
|
|
} else if(strcmp(line, "AddSurface")==0) {
|
|
|
|
sh->surface.Add(&srf);
|
2015-03-27 15:31:23 +00:00
|
|
|
srf = {};
|
2009-05-19 07:26:38 +00:00
|
|
|
} else if(StrStartsWith(line, "Curve ")) {
|
|
|
|
int isExact;
|
|
|
|
if(sscanf(line, "Curve %x %d %d %x %x",
|
|
|
|
&(crv.h.v),
|
|
|
|
&(isExact),
|
|
|
|
&(crv.exact.deg),
|
|
|
|
&(crv.surfA.v), &(crv.surfB.v)) != 5)
|
|
|
|
{
|
|
|
|
oops();
|
|
|
|
}
|
|
|
|
crv.isExact = (isExact != 0);
|
|
|
|
} else if(StrStartsWith(line, "CCtrl ")) {
|
|
|
|
int i;
|
|
|
|
Vector c;
|
|
|
|
double w;
|
|
|
|
if(sscanf(line, "CCtrl %d %lf %lf %lf Weight %lf",
|
|
|
|
&i, &(c.x), &(c.y), &(c.z), &w) != 5)
|
|
|
|
{
|
|
|
|
oops();
|
|
|
|
}
|
|
|
|
crv.exact.ctrl[i] = c;
|
|
|
|
crv.exact.weight[i] = w;
|
|
|
|
} else if(StrStartsWith(line, "CurvePt ")) {
|
|
|
|
SCurvePt scpt;
|
|
|
|
int vertex;
|
|
|
|
if(sscanf(line, "CurvePt %d %lf %lf %lf",
|
|
|
|
&vertex,
|
|
|
|
&(scpt.p.x), &(scpt.p.y), &(scpt.p.z)) != 4)
|
|
|
|
{
|
|
|
|
oops();
|
|
|
|
}
|
|
|
|
scpt.vertex = (vertex != 0);
|
|
|
|
crv.pts.Add(&scpt);
|
|
|
|
} else if(strcmp(line, "AddCurve")==0) {
|
|
|
|
sh->curve.Add(&crv);
|
2015-03-27 15:31:23 +00:00
|
|
|
crv = {};
|
2008-05-29 10:10:12 +00:00
|
|
|
} else {
|
|
|
|
oops();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fclose(fh);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2015-12-27 06:35:46 +00:00
|
|
|
//-----------------------------------------------------------------------------
|
2016-05-07 05:27:54 +00:00
|
|
|
// Handling of the relative-absolute path transformations for links
|
2015-12-27 06:35:46 +00:00
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
static std::vector<std::string> Split(const std::string &haystack, const std::string &needle)
|
|
|
|
{
|
|
|
|
std::vector<std::string> result;
|
|
|
|
|
|
|
|
size_t oldpos = 0, pos = 0;
|
|
|
|
while(true) {
|
|
|
|
oldpos = pos;
|
|
|
|
pos = haystack.find(needle, pos);
|
|
|
|
if(pos == std::string::npos) break;
|
|
|
|
result.push_back(haystack.substr(oldpos, pos - oldpos));
|
|
|
|
pos += needle.length();
|
|
|
|
}
|
|
|
|
|
|
|
|
if(oldpos != haystack.length() - 1)
|
|
|
|
result.push_back(haystack.substr(oldpos));
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
static std::string Join(const std::vector<std::string> &parts, const std::string &separator)
|
|
|
|
{
|
|
|
|
bool first = true;
|
|
|
|
std::string result;
|
|
|
|
for(auto &part : parts) {
|
|
|
|
if(!first) result += separator;
|
|
|
|
result += part;
|
|
|
|
first = false;
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool PlatformPathEqual(const std::string &a, const std::string &b)
|
|
|
|
{
|
|
|
|
// Case-sensitivity is actually per-volume on both Windows and OS X,
|
|
|
|
// but it is extremely tedious to implement and test for little benefit.
|
|
|
|
#if defined(WIN32)
|
|
|
|
std::wstring wa = Widen(a), wb = Widen(b);
|
|
|
|
return std::equal(wa.begin(), wa.end(), wb.begin(), /*wb.end(),*/
|
|
|
|
[](wchar_t wca, wchar_t wcb) { return towlower(wca) == towlower(wcb); });
|
|
|
|
#elif defined(__APPLE__)
|
|
|
|
return !strcasecmp(a.c_str(), b.c_str());
|
|
|
|
#else
|
|
|
|
return a == b;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
static std::string MakePathRelative(const std::string &base, const std::string &path)
|
|
|
|
{
|
|
|
|
std::vector<std::string> baseParts = Split(base, PATH_SEP),
|
|
|
|
pathParts = Split(path, PATH_SEP),
|
|
|
|
resultParts;
|
|
|
|
baseParts.pop_back();
|
|
|
|
|
2016-02-12 05:25:19 +00:00
|
|
|
size_t common;
|
2015-12-27 06:35:46 +00:00
|
|
|
for(common = 0; common < baseParts.size() && common < pathParts.size(); common++) {
|
|
|
|
if(!PlatformPathEqual(baseParts[common], pathParts[common]))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2016-02-12 05:25:19 +00:00
|
|
|
for(size_t i = common; i < baseParts.size(); i++)
|
2015-12-27 06:35:46 +00:00
|
|
|
resultParts.push_back("..");
|
|
|
|
|
|
|
|
resultParts.insert(resultParts.end(),
|
|
|
|
pathParts.begin() + common, pathParts.end());
|
|
|
|
|
|
|
|
return Join(resultParts, PATH_SEP);
|
|
|
|
}
|
|
|
|
|
|
|
|
static std::string MakePathAbsolute(const std::string &base, const std::string &path)
|
|
|
|
{
|
|
|
|
std::vector<std::string> resultParts = Split(base, PATH_SEP),
|
|
|
|
pathParts = Split(path, PATH_SEP);
|
|
|
|
resultParts.pop_back();
|
|
|
|
|
|
|
|
for(auto &part : pathParts) {
|
|
|
|
if(part == ".") {
|
|
|
|
/* do nothing */
|
|
|
|
} else if(part == "..") {
|
|
|
|
if(resultParts.empty()) oops();
|
|
|
|
resultParts.pop_back();
|
|
|
|
} else {
|
|
|
|
resultParts.push_back(part);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return Join(resultParts, PATH_SEP);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void PathSepNormalize(std::string &filename)
|
|
|
|
{
|
2016-02-12 05:25:19 +00:00
|
|
|
for(size_t i = 0; i < filename.length(); i++) {
|
2015-12-27 06:35:46 +00:00
|
|
|
if(filename[i] == '\\')
|
|
|
|
filename[i] = '/';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static std::string PathSepPlatformToUNIX(const std::string &filename)
|
|
|
|
{
|
|
|
|
#if defined(WIN32)
|
|
|
|
std::string result = filename;
|
2016-02-12 05:25:19 +00:00
|
|
|
for(size_t i = 0; i < result.length(); i++) {
|
2015-12-27 06:35:46 +00:00
|
|
|
if(result[i] == '\\')
|
|
|
|
result[i] = '/';
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
#else
|
|
|
|
return filename;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
static std::string PathSepUNIXToPlatform(const std::string &filename)
|
|
|
|
{
|
|
|
|
#if defined(WIN32)
|
|
|
|
std::string result = filename;
|
2016-02-12 05:25:19 +00:00
|
|
|
for(size_t i = 0; i < result.length(); i++) {
|
2015-12-27 06:35:46 +00:00
|
|
|
if(result[i] == '/')
|
|
|
|
result[i] = '\\';
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
#else
|
|
|
|
return filename;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2016-01-11 12:18:18 +00:00
|
|
|
bool SolveSpaceUI::ReloadAllImported(bool canCancel)
|
2015-12-27 06:35:46 +00:00
|
|
|
{
|
2016-05-07 05:27:54 +00:00
|
|
|
std::map<std::string, std::string> linkMap;
|
2008-06-25 05:14:49 +00:00
|
|
|
allConsistent = false;
|
|
|
|
|
2008-05-29 10:10:12 +00:00
|
|
|
int i;
|
2009-04-19 05:53:16 +00:00
|
|
|
for(i = 0; i < SK.group.n; i++) {
|
|
|
|
Group *g = &(SK.group.elem[i]);
|
2016-05-07 05:27:54 +00:00
|
|
|
if(g->type != Group::LINKED) continue;
|
2008-05-29 10:10:12 +00:00
|
|
|
|
2016-05-07 05:27:54 +00:00
|
|
|
if(isalpha(g->linkFile[0]) && g->linkFile[1] == ':') {
|
|
|
|
// Make sure that g->linkFileRel always contains a relative path
|
2015-12-27 06:35:46 +00:00
|
|
|
// in an UNIX format, even after we load an old file which had
|
|
|
|
// the path in Windows format
|
2016-05-07 05:27:54 +00:00
|
|
|
PathSepNormalize(g->linkFileRel);
|
2015-03-30 00:09:28 +00:00
|
|
|
}
|
|
|
|
|
2008-05-29 10:10:12 +00:00
|
|
|
g->impEntity.Clear();
|
|
|
|
g->impMesh.Clear();
|
2009-05-19 07:26:38 +00:00
|
|
|
g->impShell.Clear();
|
2008-06-25 05:14:49 +00:00
|
|
|
|
2016-05-07 05:27:54 +00:00
|
|
|
if(linkMap.count(g->linkFile)) {
|
|
|
|
std::string newPath = linkMap[g->linkFile];
|
2016-01-11 12:18:18 +00:00
|
|
|
if(!newPath.empty())
|
2016-05-07 05:27:54 +00:00
|
|
|
g->linkFile = newPath;
|
2016-01-11 12:18:18 +00:00
|
|
|
}
|
|
|
|
|
2016-05-17 14:44:33 +00:00
|
|
|
std::string rel = PathSepUNIXToPlatform(g->linkFileRel);
|
|
|
|
std::string fromRel = MakePathAbsolute(SS.saveFile, rel);
|
|
|
|
FILE *test = ssfopen(fromRel, "rb");
|
2008-06-25 05:14:49 +00:00
|
|
|
if(test) {
|
2016-05-17 14:44:33 +00:00
|
|
|
fclose(test);
|
|
|
|
// Okay, exists; update the absolute path.
|
|
|
|
g->linkFile = fromRel;
|
2008-06-25 05:14:49 +00:00
|
|
|
} else {
|
2016-05-17 14:44:33 +00:00
|
|
|
// It doesn't exist. Perhaps the file was moved but the tree wasn't, and we
|
|
|
|
// can use the absolute filename to get us back. The relative path will be
|
|
|
|
// updated below.
|
2008-06-25 05:14:49 +00:00
|
|
|
}
|
|
|
|
|
2016-01-11 12:18:18 +00:00
|
|
|
try_load_file:
|
2016-05-07 05:27:54 +00:00
|
|
|
if(LoadEntitiesFromFile(g->linkFile, &(g->impEntity), &(g->impMesh), &(g->impShell)))
|
2009-05-19 07:26:38 +00:00
|
|
|
{
|
2015-12-27 01:03:24 +00:00
|
|
|
if(!SS.saveFile.empty()) {
|
2016-05-07 05:27:54 +00:00
|
|
|
// Record the linked file's name relative to our filename;
|
2008-06-25 05:14:49 +00:00
|
|
|
// if the entire tree moves, then everything will still work
|
2016-05-07 05:27:54 +00:00
|
|
|
std::string rel = MakePathRelative(SS.saveFile, g->linkFile);
|
|
|
|
g->linkFileRel = PathSepPlatformToUNIX(rel);
|
2008-06-25 05:14:49 +00:00
|
|
|
} else {
|
2015-12-27 06:35:46 +00:00
|
|
|
// We're not yet saved, so can't make it absolute.
|
|
|
|
// This will only be used for display purposes, as SS.saveFile
|
|
|
|
// is always nonempty when we are actually writing anything.
|
2016-05-07 05:27:54 +00:00
|
|
|
g->linkFileRel = g->linkFile;
|
2008-06-25 05:14:49 +00:00
|
|
|
}
|
2016-05-07 05:27:54 +00:00
|
|
|
} else if(!linkMap.count(g->linkFile)) {
|
|
|
|
switch(LocateImportedFileYesNoCancel(g->linkFileRel, canCancel)) {
|
2016-01-11 12:18:18 +00:00
|
|
|
case DIALOG_YES: {
|
2016-05-07 05:27:54 +00:00
|
|
|
std::string oldImpFile = g->linkFile;
|
|
|
|
if(!GetOpenFile(&g->linkFile, "", SlvsFileFilter)) {
|
2016-01-11 12:18:18 +00:00
|
|
|
if(canCancel)
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
} else {
|
2016-05-07 05:27:54 +00:00
|
|
|
linkMap[oldImpFile] = g->linkFile;
|
2016-01-11 12:18:18 +00:00
|
|
|
goto try_load_file;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
case DIALOG_NO:
|
2016-05-07 05:27:54 +00:00
|
|
|
linkMap[g->linkFile] = "";
|
2016-01-11 12:18:18 +00:00
|
|
|
/* Geometry will be pruned by GenerateAll(). */
|
|
|
|
break;
|
|
|
|
|
|
|
|
case DIALOG_CANCEL:
|
|
|
|
return false;
|
|
|
|
}
|
2008-06-25 05:14:49 +00:00
|
|
|
} else {
|
2016-01-11 12:18:18 +00:00
|
|
|
// User was already asked to and refused to locate a missing
|
2016-05-07 05:27:54 +00:00
|
|
|
// linked file.
|
2008-05-29 10:10:12 +00:00
|
|
|
}
|
|
|
|
}
|
2016-01-11 12:18:18 +00:00
|
|
|
|
|
|
|
return true;
|
2008-05-29 10:10:12 +00:00
|
|
|
}
|
|
|
|
|