_objects.c 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327
  1. /*
  2. * Copyright (C) 2009 Jelmer Vernooij <jelmer@samba.org>
  3. *
  4. * Dulwich is dual-licensed under the Apache License, Version 2.0 and the GNU
  5. * General Public License as public by the Free Software Foundation; version 2.0
  6. * or (at your option) any later version. You can redistribute it and/or
  7. * modify it under the terms of either of these two licenses.
  8. *
  9. * Unless required by applicable law or agreed to in writing, software
  10. * distributed under the License is distributed on an "AS IS" BASIS,
  11. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. * See the License for the specific language governing permissions and
  13. * limitations under the License.
  14. *
  15. * You should have received a copy of the licenses; if not, see
  16. * <http://www.gnu.org/licenses/> for a copy of the GNU General Public License
  17. * and <http://www.apache.org/licenses/LICENSE-2.0> for a copy of the Apache
  18. * License, Version 2.0.
  19. */
  20. #include <Python.h>
  21. #include <stdlib.h>
  22. #include <sys/stat.h>
  23. #if PY_MAJOR_VERSION >= 3
  24. #define PyInt_Check(obj) 0
  25. #define PyInt_CheckExact(obj) 0
  26. #define PyInt_AsLong PyLong_AsLong
  27. #define PyString_AS_STRING PyBytes_AS_STRING
  28. #define PyString_Check PyBytes_Check
  29. #define PyString_FromStringAndSize PyBytes_FromStringAndSize
  30. #endif
  31. #if defined(__MINGW32_VERSION) || defined(__APPLE__)
  32. size_t rep_strnlen(char *text, size_t maxlen);
  33. size_t rep_strnlen(char *text, size_t maxlen)
  34. {
  35. const char *last = memchr(text, '\0', maxlen);
  36. return last ? (size_t) (last - text) : maxlen;
  37. }
  38. #define strnlen rep_strnlen
  39. #endif
  40. #define bytehex(x) (((x)<0xa)?('0'+(x)):('a'-0xa+(x)))
  41. static PyObject *tree_entry_cls;
  42. static PyObject *object_format_exception_cls;
  43. static PyObject *sha_to_pyhex(const unsigned char *sha)
  44. {
  45. char hexsha[41];
  46. int i;
  47. for (i = 0; i < 20; i++) {
  48. hexsha[i*2] = bytehex((sha[i] & 0xF0) >> 4);
  49. hexsha[i*2+1] = bytehex(sha[i] & 0x0F);
  50. }
  51. return PyString_FromStringAndSize(hexsha, 40);
  52. }
  53. static PyObject *py_parse_tree(PyObject *self, PyObject *args, PyObject *kw)
  54. {
  55. char *text, *start, *end;
  56. int len, namelen, strict;
  57. PyObject *ret, *item, *name, *sha, *py_strict = NULL;
  58. static char *kwlist[] = {"text", "strict", NULL};
  59. #if PY_MAJOR_VERSION >= 3
  60. if (!PyArg_ParseTupleAndKeywords(args, kw, "y#|O", kwlist,
  61. &text, &len, &py_strict))
  62. #else
  63. if (!PyArg_ParseTupleAndKeywords(args, kw, "s#|O", kwlist,
  64. &text, &len, &py_strict))
  65. #endif
  66. return NULL;
  67. strict = py_strict ? PyObject_IsTrue(py_strict) : 0;
  68. /* TODO: currently this returns a list; if memory usage is a concern,
  69. * consider rewriting as a custom iterator object */
  70. ret = PyList_New(0);
  71. if (ret == NULL) {
  72. return NULL;
  73. }
  74. start = text;
  75. end = text + len;
  76. while (text < end) {
  77. long mode;
  78. if (strict && text[0] == '0') {
  79. PyErr_SetString(object_format_exception_cls,
  80. "Illegal leading zero on mode");
  81. Py_DECREF(ret);
  82. return NULL;
  83. }
  84. mode = strtol(text, &text, 8);
  85. if (*text != ' ') {
  86. PyErr_SetString(PyExc_ValueError, "Expected space");
  87. Py_DECREF(ret);
  88. return NULL;
  89. }
  90. text++;
  91. namelen = strnlen(text, len - (text - start));
  92. name = PyString_FromStringAndSize(text, namelen);
  93. if (name == NULL) {
  94. Py_DECREF(ret);
  95. return NULL;
  96. }
  97. if (text + namelen + 20 >= end) {
  98. PyErr_SetString(PyExc_ValueError, "SHA truncated");
  99. Py_DECREF(ret);
  100. Py_DECREF(name);
  101. return NULL;
  102. }
  103. sha = sha_to_pyhex((unsigned char *)text+namelen+1);
  104. if (sha == NULL) {
  105. Py_DECREF(ret);
  106. Py_DECREF(name);
  107. return NULL;
  108. }
  109. item = Py_BuildValue("(NlN)", name, mode, sha);
  110. if (item == NULL) {
  111. Py_DECREF(ret);
  112. Py_DECREF(sha);
  113. Py_DECREF(name);
  114. return NULL;
  115. }
  116. if (PyList_Append(ret, item) == -1) {
  117. Py_DECREF(ret);
  118. Py_DECREF(item);
  119. return NULL;
  120. }
  121. Py_DECREF(item);
  122. text += namelen+21;
  123. }
  124. return ret;
  125. }
  126. struct tree_item {
  127. const char *name;
  128. int mode;
  129. PyObject *tuple;
  130. };
  131. int cmp_tree_item(const void *_a, const void *_b)
  132. {
  133. const struct tree_item *a = _a, *b = _b;
  134. const char *remain_a, *remain_b;
  135. int ret, common;
  136. if (strlen(a->name) > strlen(b->name)) {
  137. common = strlen(b->name);
  138. remain_a = a->name + common;
  139. remain_b = (S_ISDIR(b->mode)?"/":"");
  140. } else if (strlen(b->name) > strlen(a->name)) {
  141. common = strlen(a->name);
  142. remain_a = (S_ISDIR(a->mode)?"/":"");
  143. remain_b = b->name + common;
  144. } else { /* strlen(a->name) == strlen(b->name) */
  145. common = 0;
  146. remain_a = a->name;
  147. remain_b = b->name;
  148. }
  149. ret = strncmp(a->name, b->name, common);
  150. if (ret != 0)
  151. return ret;
  152. return strcmp(remain_a, remain_b);
  153. }
  154. int cmp_tree_item_name_order(const void *_a, const void *_b) {
  155. const struct tree_item *a = _a, *b = _b;
  156. return strcmp(a->name, b->name);
  157. }
  158. static PyObject *py_sorted_tree_items(PyObject *self, PyObject *args)
  159. {
  160. struct tree_item *qsort_entries = NULL;
  161. int name_order, num_entries, n = 0, i;
  162. PyObject *entries, *py_name_order, *ret, *key, *value, *py_mode, *py_sha;
  163. Py_ssize_t pos = 0;
  164. int (*cmp)(const void *, const void *);
  165. if (!PyArg_ParseTuple(args, "OO", &entries, &py_name_order))
  166. goto error;
  167. if (!PyDict_Check(entries)) {
  168. PyErr_SetString(PyExc_TypeError, "Argument not a dictionary");
  169. goto error;
  170. }
  171. name_order = PyObject_IsTrue(py_name_order);
  172. if (name_order == -1)
  173. goto error;
  174. cmp = name_order ? cmp_tree_item_name_order : cmp_tree_item;
  175. num_entries = PyDict_Size(entries);
  176. if (PyErr_Occurred())
  177. goto error;
  178. qsort_entries = PyMem_New(struct tree_item, num_entries);
  179. if (!qsort_entries) {
  180. PyErr_NoMemory();
  181. goto error;
  182. }
  183. while (PyDict_Next(entries, &pos, &key, &value)) {
  184. if (!PyString_Check(key)) {
  185. PyErr_SetString(PyExc_TypeError, "Name is not a string");
  186. goto error;
  187. }
  188. if (PyTuple_Size(value) != 2) {
  189. PyErr_SetString(PyExc_ValueError, "Tuple has invalid size");
  190. goto error;
  191. }
  192. py_mode = PyTuple_GET_ITEM(value, 0);
  193. if (!PyInt_Check(py_mode) && !PyLong_Check(py_mode)) {
  194. PyErr_SetString(PyExc_TypeError, "Mode is not an integral type");
  195. goto error;
  196. }
  197. py_sha = PyTuple_GET_ITEM(value, 1);
  198. if (!PyString_Check(py_sha)) {
  199. PyErr_SetString(PyExc_TypeError, "SHA is not a string");
  200. goto error;
  201. }
  202. qsort_entries[n].name = PyString_AS_STRING(key);
  203. qsort_entries[n].mode = PyInt_AsLong(py_mode);
  204. qsort_entries[n].tuple = PyObject_CallFunctionObjArgs(
  205. tree_entry_cls, key, py_mode, py_sha, NULL);
  206. if (qsort_entries[n].tuple == NULL)
  207. goto error;
  208. n++;
  209. }
  210. qsort(qsort_entries, num_entries, sizeof(struct tree_item), cmp);
  211. ret = PyList_New(num_entries);
  212. if (ret == NULL) {
  213. PyErr_NoMemory();
  214. goto error;
  215. }
  216. for (i = 0; i < num_entries; i++) {
  217. PyList_SET_ITEM(ret, i, qsort_entries[i].tuple);
  218. }
  219. PyMem_Free(qsort_entries);
  220. return ret;
  221. error:
  222. for (i = 0; i < n; i++) {
  223. Py_XDECREF(qsort_entries[i].tuple);
  224. }
  225. PyMem_Free(qsort_entries);
  226. return NULL;
  227. }
  228. static PyMethodDef py_objects_methods[] = {
  229. { "parse_tree", (PyCFunction)py_parse_tree, METH_VARARGS | METH_KEYWORDS,
  230. NULL },
  231. { "sorted_tree_items", py_sorted_tree_items, METH_VARARGS, NULL },
  232. { NULL, NULL, 0, NULL }
  233. };
  234. static PyObject *
  235. moduleinit(void)
  236. {
  237. PyObject *m, *objects_mod, *errors_mod;
  238. #if PY_MAJOR_VERSION >= 3
  239. static struct PyModuleDef moduledef = {
  240. PyModuleDef_HEAD_INIT,
  241. "_objects", /* m_name */
  242. NULL, /* m_doc */
  243. -1, /* m_size */
  244. py_objects_methods, /* m_methods */
  245. NULL, /* m_reload */
  246. NULL, /* m_traverse */
  247. NULL, /* m_clear*/
  248. NULL, /* m_free */
  249. };
  250. m = PyModule_Create(&moduledef);
  251. #else
  252. m = Py_InitModule3("_objects", py_objects_methods, NULL);
  253. #endif
  254. if (m == NULL) {
  255. return NULL;
  256. }
  257. errors_mod = PyImport_ImportModule("dulwich.errors");
  258. if (errors_mod == NULL) {
  259. return NULL;
  260. }
  261. object_format_exception_cls = PyObject_GetAttrString(
  262. errors_mod, "ObjectFormatException");
  263. Py_DECREF(errors_mod);
  264. if (object_format_exception_cls == NULL) {
  265. return NULL;
  266. }
  267. /* This is a circular import but should be safe since this module is
  268. * imported at at the very bottom of objects.py. */
  269. objects_mod = PyImport_ImportModule("dulwich.objects");
  270. if (objects_mod == NULL) {
  271. return NULL;
  272. }
  273. tree_entry_cls = PyObject_GetAttrString(objects_mod, "TreeEntry");
  274. Py_DECREF(objects_mod);
  275. if (tree_entry_cls == NULL) {
  276. return NULL;
  277. }
  278. return m;
  279. }
  280. #if PY_MAJOR_VERSION >= 3
  281. PyMODINIT_FUNC
  282. PyInit__objects(void)
  283. {
  284. return moduleinit();
  285. }
  286. #else
  287. PyMODINIT_FUNC
  288. init_objects(void)
  289. {
  290. moduleinit();
  291. }
  292. #endif