plus.c 9.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466
  1. /**
  2. * \file plus.c
  3. *
  4. * \brief Vector library - update topo structure (lower level functions)
  5. *
  6. * Lower level functions for reading/writing/manipulating vectors.
  7. *
  8. * This program is free software under the GNU General Public License
  9. * (>=v2). Read the file COPYING that comes with GRASS for details.
  10. *
  11. * \author CERL (probably Dave Gerdes), Radim Blazek
  12. *
  13. * \date 2001-2006
  14. */
  15. #include <grass/config.h>
  16. #include <sys/types.h>
  17. #include <unistd.h>
  18. #include <stdlib.h>
  19. #include <stdio.h>
  20. #include <grass/gis.h>
  21. #include <grass/vector.h>
  22. #include <grass/glocale.h>
  23. /*!
  24. * \brief Initialize Plus_head structure
  25. *
  26. * \param[in,out] Plus pointer to Plus_head structure
  27. *
  28. * \return 1
  29. */
  30. int dig_init_plus(struct Plus_head *Plus)
  31. {
  32. G_debug(3, "dig_init_plus()");
  33. Plus->Version_Major = 0;
  34. Plus->Version_Minor = 0;
  35. Plus->Back_Major = 0;
  36. Plus->Back_Minor = 0;
  37. Plus->off_t_size = 0;
  38. Plus->box.N = 0;
  39. Plus->box.S = 0;
  40. Plus->box.E = 0;
  41. Plus->box.W = 0;
  42. Plus->box.T = 0;
  43. Plus->box.B = 0;
  44. Plus->built = GV_BUILD_NONE;
  45. Plus->Node = NULL;
  46. Plus->Line = NULL;
  47. Plus->Area = NULL;
  48. Plus->Isle = NULL;
  49. Plus->n_nodes = 0;
  50. Plus->n_edges = 0;
  51. Plus->n_lines = 0;
  52. Plus->n_areas = 0;
  53. Plus->n_isles = 0;
  54. Plus->n_volumes = 0;
  55. Plus->n_holes = 0;
  56. Plus->alloc_nodes = 0;
  57. Plus->alloc_edges = 0;
  58. Plus->alloc_lines = 0;
  59. Plus->alloc_areas = 0;
  60. Plus->alloc_isles = 0;
  61. Plus->alloc_volumes = 0;
  62. Plus->alloc_holes = 0;
  63. Plus->n_plines = 0;
  64. Plus->n_llines = 0;
  65. Plus->n_blines = 0;
  66. Plus->n_clines = 0;
  67. Plus->n_flines = 0;
  68. Plus->n_klines = 0;
  69. Plus->Node_offset = 0L;
  70. Plus->Line_offset = 0L;
  71. Plus->Area_offset = 0L;
  72. Plus->Isle_offset = 0L;
  73. Plus->Volume_offset = 0L;
  74. Plus->Hole_offset = 0L;
  75. Plus->Node_spidx_offset = 0L;
  76. Plus->Line_spidx_offset = 0L;
  77. Plus->Area_spidx_offset = 0L;
  78. Plus->Isle_spidx_offset = 0L;
  79. Plus->Face_spidx_offset = 0L;
  80. Plus->Volume_spidx_offset = 0L;
  81. Plus->Hole_spidx_offset = 0L;
  82. dig_spidx_init(Plus);
  83. dig_cidx_init(Plus);
  84. return 1;
  85. }
  86. /*!
  87. * \brief Free Plus->Node structure
  88. *
  89. * \param[in] Plus pointer to Plus_head structure
  90. */
  91. void dig_free_plus_nodes(struct Plus_head *Plus)
  92. {
  93. int i;
  94. struct P_node *Node;
  95. G_debug(2, "dig_free_plus_nodes()");
  96. /* Nodes */
  97. if (Plus->Node) { /* it may be that header only is loaded */
  98. for (i = 1; i <= Plus->n_nodes; i++) {
  99. Node = Plus->Node[i];
  100. if (Node == NULL)
  101. continue;
  102. dig_free_node(Node);
  103. }
  104. G_free(Plus->Node);
  105. }
  106. Plus->Node = NULL;
  107. Plus->n_nodes = 0;
  108. Plus->alloc_nodes = 0;
  109. }
  110. /*!
  111. * \brief Free Plus->Line structure
  112. *
  113. * \param[in] Plus pointer to Plus_head structure
  114. */
  115. void dig_free_plus_lines(struct Plus_head *Plus)
  116. {
  117. int i;
  118. struct P_line *Line;
  119. G_debug(2, "dig_free_plus_lines()");
  120. /* Lines */
  121. if (Plus->Line) { /* it may be that header only is loaded */
  122. for (i = 1; i <= Plus->n_lines; i++) {
  123. Line = Plus->Line[i];
  124. if (Line == NULL)
  125. continue;
  126. dig_free_line(Line);
  127. }
  128. G_free(Plus->Line);
  129. }
  130. Plus->Line = NULL;
  131. Plus->n_lines = 0;
  132. Plus->alloc_lines = 0;
  133. Plus->n_plines = 0;
  134. Plus->n_llines = 0;
  135. Plus->n_blines = 0;
  136. Plus->n_clines = 0;
  137. Plus->n_flines = 0;
  138. Plus->n_klines = 0;
  139. }
  140. /*!
  141. * \brief Free Plus->Area structure
  142. *
  143. * \param[in] Plus pointer to Plus_head structure
  144. */
  145. void dig_free_plus_areas(struct Plus_head *Plus)
  146. {
  147. int i;
  148. struct P_area *Area;
  149. G_debug(2, "dig_free_plus_areas()");
  150. /* Areas */
  151. if (Plus->Area) { /* it may be that header only is loaded */
  152. for (i = 1; i <= Plus->n_areas; i++) {
  153. Area = Plus->Area[i];
  154. if (Area == NULL)
  155. continue;
  156. dig_free_area(Area);
  157. }
  158. G_free(Plus->Area);
  159. }
  160. Plus->Area = NULL;
  161. Plus->n_areas = 0;
  162. Plus->alloc_areas = 0;
  163. }
  164. /*!
  165. * \brief Free Plus->Isle structure
  166. *
  167. * \param[in] Plus pointer to Plus_head structure
  168. */
  169. void dig_free_plus_isles(struct Plus_head *Plus)
  170. {
  171. int i;
  172. struct P_isle *Isle;
  173. G_debug(2, "dig_free_plus_isles()");
  174. /* Isles */
  175. if (Plus->Isle) { /* it may be that header only is loaded */
  176. for (i = 1; i <= Plus->n_isles; i++) {
  177. Isle = Plus->Isle[i];
  178. if (Isle == NULL)
  179. continue;
  180. dig_free_isle(Isle);
  181. }
  182. G_free(Plus->Isle);
  183. }
  184. Plus->Isle = NULL;
  185. Plus->n_isles = 0;
  186. Plus->alloc_isles = 0;
  187. }
  188. /*!
  189. * \brief Free Plus structure.
  190. *
  191. * Structure is not inited and dig_init_plus() should follow.
  192. *
  193. * \param[in] Plus pointer to Plus_head structure
  194. */
  195. void dig_free_plus(struct Plus_head *Plus)
  196. {
  197. G_debug(2, "dig_free_plus()");
  198. dig_free_plus_nodes(Plus);
  199. dig_free_plus_lines(Plus);
  200. dig_free_plus_areas(Plus);
  201. dig_free_plus_isles(Plus);
  202. dig_cidx_free(Plus);
  203. }
  204. /*!
  205. * \brief Reads topo file to topo structure.
  206. *
  207. * \param[in,out] Plus pointer to Plus_head structure
  208. * \param[in] plus topo file
  209. * \param[in] head_only read only head
  210. *
  211. * \return 1 on success
  212. * \return 0 on error
  213. */
  214. int dig_load_plus(struct Plus_head *Plus, struct gvfile * plus, int head_only)
  215. {
  216. int i;
  217. G_debug(1, "dig_load_plus()");
  218. /* TODO
  219. if (do_checks)
  220. dig_do_file_checks (map, map->plus_file, map->digit_file);
  221. */
  222. /* free and init old */
  223. dig_init_plus(Plus);
  224. /* Now let's begin reading the Plus file nodes, lines, areas and isles */
  225. if (dig_Rd_Plus_head(plus, Plus) == -1)
  226. return 0;
  227. if (head_only)
  228. return 1;
  229. dig_set_cur_port(&(Plus->port));
  230. /* Nodes */
  231. if (dig_fseek(plus, Plus->Node_offset, 0) == -1)
  232. G_fatal_error(_("Unable read topology for nodes"));
  233. dig_alloc_nodes(Plus, Plus->n_nodes);
  234. for (i = 1; i <= Plus->n_nodes; i++) {
  235. if (dig_Rd_P_node(Plus, i, plus) == -1)
  236. G_fatal_error(_("Unable to read topology for node %d"), i);
  237. }
  238. /* Lines */
  239. if (dig_fseek(plus, Plus->Line_offset, 0) == -1)
  240. G_fatal_error(_("Unable read topology for lines"));
  241. dig_alloc_lines(Plus, Plus->n_lines);
  242. for (i = 1; i <= Plus->n_lines; i++) {
  243. if (dig_Rd_P_line(Plus, i, plus) == -1)
  244. G_fatal_error(_("Unable to read topology for line %d"), i);
  245. }
  246. /* Areas */
  247. if (dig_fseek(plus, Plus->Area_offset, 0) == -1)
  248. G_fatal_error(_("Unable to read topo for areas"));
  249. dig_alloc_areas(Plus, Plus->n_areas);
  250. for (i = 1; i <= Plus->n_areas; i++) {
  251. if (dig_Rd_P_area(Plus, i, plus) == -1)
  252. G_fatal_error(_("Unable read topology for area %d"), i);
  253. }
  254. /* Isles */
  255. if (dig_fseek(plus, Plus->Isle_offset, 0) == -1)
  256. G_fatal_error(_("Unable to read topology for isles"));
  257. dig_alloc_isles(Plus, Plus->n_isles);
  258. for (i = 1; i <= Plus->n_isles; i++) {
  259. if (dig_Rd_P_isle(Plus, i, plus) == -1)
  260. G_fatal_error(_("Unable to read topology for isle %d"), i);
  261. }
  262. return (1);
  263. }
  264. /*!
  265. * \brief Writes topo structure to topo file
  266. *
  267. * \param[in,out] fp_plus topo file
  268. * \param[in] Plus pointer to Plus_head structure
  269. *
  270. * \return 0 on success
  271. * \return -1 on error
  272. */
  273. int dig_write_plus_file(struct gvfile * fp_plus, struct Plus_head *Plus)
  274. {
  275. dig_set_cur_port(&(Plus->port));
  276. dig_rewind(fp_plus);
  277. if (dig_Wr_Plus_head(fp_plus, Plus) < 0) {
  278. G_warning(_("Unable to write head to plus file"));
  279. return (-1);
  280. }
  281. if (dig_write_nodes(fp_plus, Plus) < 0) {
  282. G_warning(_("Unable to write nodes to plus file"));
  283. return (-1);
  284. }
  285. if (dig_write_lines(fp_plus, Plus) < 0) {
  286. G_warning(_("Unable to write lines to plus file"));
  287. return (-1);
  288. }
  289. if (dig_write_areas(fp_plus, Plus) < 0) {
  290. G_warning(_("Unable to write areas to plus file"));
  291. return (-1);
  292. }
  293. if (dig_write_isles(fp_plus, Plus) < 0) {
  294. G_warning(_("Unable to write isles to plus file"));
  295. return (-1);
  296. }
  297. dig_rewind(fp_plus);
  298. if (dig_Wr_Plus_head(fp_plus, Plus) < 0) {
  299. G_warning(_("Unable to write head to plus file"));
  300. return (-1);
  301. }
  302. dig_fflush(fp_plus);
  303. return (0);
  304. } /* write_plus_file() */
  305. /*!
  306. * \brief Writes topo structure (nodes) to topo file
  307. *
  308. * \param[in,out] fp_plus topo file
  309. * \param[in] Plus pointer to Plus_head structure
  310. *
  311. * \return 0 on success
  312. * \return -1 on error
  313. */
  314. int dig_write_nodes(struct gvfile * plus, struct Plus_head *Plus)
  315. {
  316. int i;
  317. Plus->Node_offset = dig_ftell(plus);
  318. for (i = 1; i <= Plus->n_nodes; i++) {
  319. if (dig_Wr_P_node(Plus, i, plus) < 0)
  320. return (-1);
  321. }
  322. return (0);
  323. } /* write_nodes() */
  324. /*!
  325. * \brief Writes topo structure (lines) to topo file
  326. *
  327. * \param[in,out] fp_plus topo file
  328. * \param[in] Plus pointer to Plus_head structure
  329. *
  330. * \return 0 on success
  331. * \return -1 on error
  332. */
  333. int dig_write_lines(struct gvfile * plus, struct Plus_head *Plus)
  334. {
  335. int i;
  336. Plus->Line_offset = dig_ftell(plus);
  337. for (i = 1; i <= Plus->n_lines; i++) {
  338. if (dig_Wr_P_line(Plus, i, plus) < 0)
  339. return (-1);
  340. }
  341. return (0);
  342. } /* write_line() */
  343. /*!
  344. * \brief Writes topo structure (areas) to topo file
  345. *
  346. * \param[in,out] fp_plus topo file
  347. * \param[in] Plus pointer to Plus_head structure
  348. *
  349. * \return 0 on success
  350. * \return -1 on error
  351. */
  352. int dig_write_areas(struct gvfile * plus, struct Plus_head *Plus)
  353. {
  354. int i;
  355. Plus->Area_offset = dig_ftell(plus);
  356. for (i = 1; i <= Plus->n_areas; i++) {
  357. if (dig_Wr_P_area(Plus, i, plus) < 0)
  358. return (-1);
  359. }
  360. return (0);
  361. } /* write_areas() */
  362. /*!
  363. * \brief Writes topo structure (isles) to topo file
  364. *
  365. * \param[in,out] fp_plus topo file
  366. * \param[in] Plus pointer to Plus_head structure
  367. *
  368. * \return 0 on success
  369. * \return -1 on error
  370. */
  371. int dig_write_isles(struct gvfile * plus, struct Plus_head *Plus)
  372. {
  373. int i;
  374. Plus->Isle_offset = dig_ftell(plus);
  375. for (i = 1; i <= Plus->n_isles; i++) {
  376. if (dig_Wr_P_isle(Plus, i, plus) < 0)
  377. return (-1);
  378. }
  379. return (0);
  380. } /* write_isles() */