1 (* Copyright (C) 2004-2005, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://helm.cs.unibo.it/
31 ~host:(Helm_registry.get "db.host")
32 ~user:(Helm_registry.get "db.user")
33 ~database:(Helm_registry.get "db.database")
36 fun () -> Lazy.force dbd
39 let xpointer_RE = Pcre.regexp "#.*$"
41 let clean_owner_environment () =
42 let dbd = instance () in
43 let owner = (Helm_registry.get "matita.owner") in
44 let obj_tbl = MetadataTypes.obj_tbl () in
45 let sort_tbl = MetadataTypes.sort_tbl () in
46 let rel_tbl = MetadataTypes.rel_tbl () in
47 let name_tbl = MetadataTypes.name_tbl () in
48 let count_tbl = MetadataTypes.count_tbl () in
50 (obj_tbl,`RefObj) ; (sort_tbl,`RefSort) ; (rel_tbl,`RefRel) ;
51 (name_tbl,`ObjectName) ; (count_tbl,`Count) ]
54 (SqlStatements.drop_tables tbls) @ (SqlStatements.drop_indexes tbls)
59 with Mysql.Error _ as exn ->
60 match Mysql.errno dbd with
61 | Mysql.No_such_table -> []
66 let uri = Pcre.replace ~rex:xpointer_RE ~templ:"" uri in
69 (*prerr_endline ("unregistering " ^ uri ^ suffix);*)
70 Http_getter.unregister (uri ^ suffix))
72 [""; ".body"; ".types"])
74 List.iter (fun statement ->
76 ignore (Mysql.exec dbd statement)
77 with Mysql.Error _ as exn ->
78 match Mysql.errno dbd with
79 | Mysql.Bad_table_error
80 | Mysql.No_such_index | Mysql.No_such_table -> ()
85 let create_owner_environment () =
86 let dbd = instance () in
87 let obj_tbl = MetadataTypes.obj_tbl () in
88 let sort_tbl = MetadataTypes.sort_tbl () in
89 let rel_tbl = MetadataTypes.rel_tbl () in
90 let name_tbl = MetadataTypes.name_tbl () in
91 let count_tbl = MetadataTypes.count_tbl () in
93 (obj_tbl,`RefObj) ; (sort_tbl,`RefSort) ; (rel_tbl,`RefRel) ;
94 (name_tbl,`ObjectName) ; (count_tbl,`Count) ]
97 (SqlStatements.create_tables tbls) @ (SqlStatements.create_indexes tbls)
99 List.iter (fun statement ->
101 ignore (Mysql.exec dbd statement)
104 let status = Mysql.status dbd in
106 | Mysql.StatusError Mysql.Table_exists_error -> ()
107 | Mysql.StatusError _ -> raise exn
112 (* removes uri from the ownerized tables, and returns the list of other objects
113 * (theyr uris) that ref the one removed.
114 * AFAIK there is no need to return it, since the MatitaTypes.staus should
115 * contain all defined objects. but to double ckeck we do not garbage the
119 let obj_tbl = MetadataTypes.obj_tbl () in
120 let sort_tbl = MetadataTypes.sort_tbl () in
121 let rel_tbl = MetadataTypes.rel_tbl () in
122 let name_tbl = MetadataTypes.name_tbl () in
123 (*let conclno_tbl = MetadataTypes.conclno_tbl () in
124 let conclno_hyp_tbl = MetadataTypes.fullno_tbl () in*)
125 let count_tbl = MetadataTypes.count_tbl () in
127 let dbd = instance () in
128 let suri = UriManager.string_of_uri uri in
129 let query table suri = sprintf
130 "DELETE FROM %s WHERE source LIKE '%s%%'" table (Mysql.escape suri)
134 ignore (Mysql.exec dbd (query t suri))
136 exn -> raise exn (* no errors should be accepted *)
138 [obj_tbl;sort_tbl;rel_tbl;name_tbl;(*conclno_tbl;conclno_hyp_tbl*)count_tbl];
139 (* and now the debug job *)
141 sprintf "SELECT source FROM %s WHERE h_occurrence LIKE '%s%%'" obj_tbl suri
144 let rc = Mysql.exec dbd dbg_q in
146 Mysql.iter rc (fun a -> match a.(0) with None ->()|Some a -> l := a:: !l);
147 let l = List.sort Pervasives.compare !l in
148 let rec uniq = function
151 | h1::h2::tl when h1 = h2 -> uniq (h2 :: tl)
152 | h1::tl (* when h1 <> h2 *) -> h1 :: uniq tl
156 exn -> raise exn (* no errors should be accepted *)