Show More
@@ -1,115 +1,115 b'' | |||
|
1 | 1 | // copymap.rs |
|
2 | 2 | // |
|
3 | 3 | // Copyright 2019 Raphaël Gomès <rgomes@octobus.net> |
|
4 | 4 | // |
|
5 | 5 | // This software may be used and distributed according to the terms of the |
|
6 | 6 | // GNU General Public License version 2 or any later version. |
|
7 | 7 | |
|
8 | 8 | //! Bindings for `hg::dirstate::dirstate_map::CopyMap` provided by the |
|
9 | 9 | //! `hg-core` package. |
|
10 | 10 | |
|
11 | 11 | use cpython::{PyBytes, PyClone, PyDict, PyObject, PyResult, Python}; |
|
12 | 12 | use std::cell::RefCell; |
|
13 | 13 | |
|
14 | 14 | use crate::dirstate::dirstate_map::{DirstateMap, DirstateMapLeakedRef}; |
|
15 | 15 | use hg::CopyMapIter; |
|
16 | 16 | |
|
17 | 17 | py_class!(pub class CopyMap |py| { |
|
18 | 18 | data dirstate_map: DirstateMap; |
|
19 | 19 | |
|
20 | 20 | def __getitem__(&self, key: PyObject) -> PyResult<PyBytes> { |
|
21 | 21 | (*self.dirstate_map(py)).copymapgetitem(py, key) |
|
22 | 22 | } |
|
23 | 23 | |
|
24 | 24 | def __len__(&self) -> PyResult<usize> { |
|
25 | 25 | self.dirstate_map(py).copymaplen(py) |
|
26 | 26 | } |
|
27 | 27 | |
|
28 | 28 | def __contains__(&self, key: PyObject) -> PyResult<bool> { |
|
29 | 29 | self.dirstate_map(py).copymapcontains(py, key) |
|
30 | 30 | } |
|
31 | 31 | |
|
32 | 32 | def get( |
|
33 | 33 | &self, |
|
34 | 34 | key: PyObject, |
|
35 | 35 | default: Option<PyObject> = None |
|
36 | 36 | ) -> PyResult<Option<PyObject>> { |
|
37 | 37 | self.dirstate_map(py).copymapget(py, key, default) |
|
38 | 38 | } |
|
39 | 39 | |
|
40 | 40 | def pop( |
|
41 | 41 | &self, |
|
42 | 42 | key: PyObject, |
|
43 | 43 | default: Option<PyObject> = None |
|
44 | 44 | ) -> PyResult<Option<PyObject>> { |
|
45 | 45 | self.dirstate_map(py).copymappop(py, key, default) |
|
46 | 46 | } |
|
47 | 47 | |
|
48 | 48 | def __iter__(&self) -> PyResult<CopyMapKeysIterator> { |
|
49 | 49 | self.dirstate_map(py).copymapiter(py) |
|
50 | 50 | } |
|
51 | 51 | |
|
52 | 52 | // Python's `dict()` builtin works with either a subclass of dict |
|
53 | 53 | // or an abstract mapping. Said mapping needs to implement `__getitem__` |
|
54 | 54 | // and `keys`. |
|
55 | 55 | def keys(&self) -> PyResult<CopyMapKeysIterator> { |
|
56 | 56 | self.dirstate_map(py).copymapiter(py) |
|
57 | 57 | } |
|
58 | 58 | |
|
59 | 59 | def items(&self) -> PyResult<CopyMapItemsIterator> { |
|
60 | 60 | self.dirstate_map(py).copymapitemsiter(py) |
|
61 | 61 | } |
|
62 | 62 | |
|
63 | 63 | def iteritems(&self) -> PyResult<CopyMapItemsIterator> { |
|
64 | 64 | self.dirstate_map(py).copymapitemsiter(py) |
|
65 | 65 | } |
|
66 | 66 | |
|
67 | 67 | def __setitem__( |
|
68 | 68 | &self, |
|
69 | 69 | key: PyObject, |
|
70 | 70 | item: PyObject |
|
71 | 71 | ) -> PyResult<()> { |
|
72 | 72 | self.dirstate_map(py).copymapsetitem(py, key, item)?; |
|
73 | 73 | Ok(()) |
|
74 | 74 | } |
|
75 | 75 | |
|
76 | 76 | def copy(&self) -> PyResult<PyDict> { |
|
77 | 77 | self.dirstate_map(py).copymapcopy(py) |
|
78 | 78 | } |
|
79 | 79 | |
|
80 | 80 | }); |
|
81 | 81 | |
|
82 | 82 | impl CopyMap { |
|
83 | 83 | pub fn from_inner(py: Python, dm: DirstateMap) -> PyResult<Self> { |
|
84 | 84 | Self::create_instance(py, dm) |
|
85 | 85 | } |
|
86 | 86 | fn translate_key( |
|
87 | 87 | py: Python, |
|
88 | 88 | res: (&Vec<u8>, &Vec<u8>), |
|
89 | 89 | ) -> PyResult<Option<PyBytes>> { |
|
90 | 90 | Ok(Some(PyBytes::new(py, res.0))) |
|
91 | 91 | } |
|
92 | 92 | fn translate_key_value( |
|
93 | 93 | py: Python, |
|
94 | 94 | res: (&Vec<u8>, &Vec<u8>), |
|
95 | 95 | ) -> PyResult<Option<(PyBytes, PyBytes)>> { |
|
96 | 96 | let (k, v) = res; |
|
97 | 97 | Ok(Some((PyBytes::new(py, k), PyBytes::new(py, v)))) |
|
98 | 98 | } |
|
99 | 99 | } |
|
100 | 100 | |
|
101 |
py_shared_iterator |
|
|
101 | py_shared_iterator!( | |
|
102 | 102 | CopyMapKeysIterator, |
|
103 | 103 | DirstateMapLeakedRef, |
|
104 | 104 | CopyMapIter<'static>, |
|
105 | 105 | CopyMap::translate_key, |
|
106 | 106 | Option<PyBytes> |
|
107 | 107 | ); |
|
108 | 108 | |
|
109 |
py_shared_iterator |
|
|
109 | py_shared_iterator!( | |
|
110 | 110 | CopyMapItemsIterator, |
|
111 | 111 | DirstateMapLeakedRef, |
|
112 | 112 | CopyMapIter<'static>, |
|
113 | 113 | CopyMap::translate_key_value, |
|
114 | 114 | Option<(PyBytes, PyBytes)> |
|
115 | 115 | ); |
@@ -1,130 +1,130 b'' | |||
|
1 | 1 | // dirs_multiset.rs |
|
2 | 2 | // |
|
3 | 3 | // Copyright 2019 Raphaël Gomès <rgomes@octobus.net> |
|
4 | 4 | // |
|
5 | 5 | // This software may be used and distributed according to the terms of the |
|
6 | 6 | // GNU General Public License version 2 or any later version. |
|
7 | 7 | |
|
8 | 8 | //! Bindings for the `hg::dirstate::dirs_multiset` file provided by the |
|
9 | 9 | //! `hg-core` package. |
|
10 | 10 | |
|
11 | 11 | use std::cell::RefCell; |
|
12 | 12 | use std::convert::TryInto; |
|
13 | 13 | |
|
14 | 14 | use cpython::{ |
|
15 | 15 | exc, ObjectProtocol, PyBytes, PyClone, PyDict, PyErr, PyObject, PyResult, |
|
16 | 16 | Python, |
|
17 | 17 | }; |
|
18 | 18 | |
|
19 | 19 | use crate::dirstate::extract_dirstate; |
|
20 | 20 | use crate::ref_sharing::{PySharedRefCell, PySharedState}; |
|
21 | 21 | use hg::{ |
|
22 | 22 | DirsMultiset, DirsMultisetIter, DirstateMapError, DirstateParseError, |
|
23 | 23 | EntryState, |
|
24 | 24 | }; |
|
25 | 25 | |
|
26 | 26 | py_class!(pub class Dirs |py| { |
|
27 | 27 | data inner: PySharedRefCell<DirsMultiset>; |
|
28 | 28 | data py_shared_state: PySharedState; |
|
29 | 29 | |
|
30 | 30 | // `map` is either a `dict` or a flat iterator (usually a `set`, sometimes |
|
31 | 31 | // a `list`) |
|
32 | 32 | def __new__( |
|
33 | 33 | _cls, |
|
34 | 34 | map: PyObject, |
|
35 | 35 | skip: Option<PyObject> = None |
|
36 | 36 | ) -> PyResult<Self> { |
|
37 | 37 | let mut skip_state: Option<EntryState> = None; |
|
38 | 38 | if let Some(skip) = skip { |
|
39 | 39 | skip_state = Some( |
|
40 | 40 | skip.extract::<PyBytes>(py)?.data(py)[0] |
|
41 | 41 | .try_into() |
|
42 | 42 | .map_err(|e: DirstateParseError| { |
|
43 | 43 | PyErr::new::<exc::ValueError, _>(py, e.to_string()) |
|
44 | 44 | })?, |
|
45 | 45 | ); |
|
46 | 46 | } |
|
47 | 47 | let inner = if let Ok(map) = map.cast_as::<PyDict>(py) { |
|
48 | 48 | let dirstate = extract_dirstate(py, &map)?; |
|
49 | 49 | DirsMultiset::from_dirstate(&dirstate, skip_state) |
|
50 | 50 | } else { |
|
51 | 51 | let map: Result<Vec<Vec<u8>>, PyErr> = map |
|
52 | 52 | .iter(py)? |
|
53 | 53 | .map(|o| Ok(o?.extract::<PyBytes>(py)?.data(py).to_owned())) |
|
54 | 54 | .collect(); |
|
55 | 55 | DirsMultiset::from_manifest(&map?) |
|
56 | 56 | }; |
|
57 | 57 | |
|
58 | 58 | Self::create_instance( |
|
59 | 59 | py, |
|
60 | 60 | PySharedRefCell::new(inner), |
|
61 | 61 | PySharedState::default() |
|
62 | 62 | ) |
|
63 | 63 | } |
|
64 | 64 | |
|
65 | 65 | def addpath(&self, path: PyObject) -> PyResult<PyObject> { |
|
66 | 66 | self.borrow_mut(py)?.add_path( |
|
67 | 67 | path.extract::<PyBytes>(py)?.data(py), |
|
68 | 68 | ); |
|
69 | 69 | Ok(py.None()) |
|
70 | 70 | } |
|
71 | 71 | |
|
72 | 72 | def delpath(&self, path: PyObject) -> PyResult<PyObject> { |
|
73 | 73 | self.borrow_mut(py)?.delete_path( |
|
74 | 74 | path.extract::<PyBytes>(py)?.data(py), |
|
75 | 75 | ) |
|
76 | 76 | .and(Ok(py.None())) |
|
77 | 77 | .or_else(|e| { |
|
78 | 78 | match e { |
|
79 | 79 | DirstateMapError::PathNotFound(_p) => { |
|
80 | 80 | Err(PyErr::new::<exc::ValueError, _>( |
|
81 | 81 | py, |
|
82 | 82 | "expected a value, found none".to_string(), |
|
83 | 83 | )) |
|
84 | 84 | } |
|
85 | 85 | DirstateMapError::EmptyPath => { |
|
86 | 86 | Ok(py.None()) |
|
87 | 87 | } |
|
88 | 88 | } |
|
89 | 89 | }) |
|
90 | 90 | } |
|
91 | 91 | def __iter__(&self) -> PyResult<DirsMultisetKeysIterator> { |
|
92 | 92 | let (leak_handle, leaked_ref) = unsafe { self.leak_immutable(py)? }; |
|
93 | 93 | DirsMultisetKeysIterator::create_instance( |
|
94 | 94 | py, |
|
95 | 95 | RefCell::new(Some(leak_handle)), |
|
96 | 96 | RefCell::new(leaked_ref.iter()), |
|
97 | 97 | ) |
|
98 | 98 | } |
|
99 | 99 | |
|
100 | 100 | def __contains__(&self, item: PyObject) -> PyResult<bool> { |
|
101 | 101 | Ok(self |
|
102 | 102 | .inner(py) |
|
103 | 103 | .borrow() |
|
104 | 104 | .contains(item.extract::<PyBytes>(py)?.data(py).as_ref())) |
|
105 | 105 | } |
|
106 | 106 | }); |
|
107 | 107 | |
|
108 | 108 | py_shared_ref!(Dirs, DirsMultiset, inner, DirsMultisetLeakedRef,); |
|
109 | 109 | |
|
110 | 110 | impl Dirs { |
|
111 | 111 | pub fn from_inner(py: Python, d: DirsMultiset) -> PyResult<Self> { |
|
112 | 112 | Self::create_instance( |
|
113 | 113 | py, |
|
114 | 114 | PySharedRefCell::new(d), |
|
115 | 115 | PySharedState::default(), |
|
116 | 116 | ) |
|
117 | 117 | } |
|
118 | 118 | |
|
119 | 119 | fn translate_key(py: Python, res: &Vec<u8>) -> PyResult<Option<PyBytes>> { |
|
120 | 120 | Ok(Some(PyBytes::new(py, res))) |
|
121 | 121 | } |
|
122 | 122 | } |
|
123 | 123 | |
|
124 |
py_shared_iterator |
|
|
124 | py_shared_iterator!( | |
|
125 | 125 | DirsMultisetKeysIterator, |
|
126 | 126 | DirsMultisetLeakedRef, |
|
127 | 127 | DirsMultisetIter<'static>, |
|
128 | 128 | Dirs::translate_key, |
|
129 | 129 | Option<PyBytes> |
|
130 | 130 | ); |
@@ -1,509 +1,509 b'' | |||
|
1 | 1 | // dirstate_map.rs |
|
2 | 2 | // |
|
3 | 3 | // Copyright 2019 Raphaël Gomès <rgomes@octobus.net> |
|
4 | 4 | // |
|
5 | 5 | // This software may be used and distributed according to the terms of the |
|
6 | 6 | // GNU General Public License version 2 or any later version. |
|
7 | 7 | |
|
8 | 8 | //! Bindings for the `hg::dirstate::dirstate_map` file provided by the |
|
9 | 9 | //! `hg-core` package. |
|
10 | 10 | |
|
11 | 11 | use std::cell::RefCell; |
|
12 | 12 | use std::convert::TryInto; |
|
13 | 13 | use std::time::Duration; |
|
14 | 14 | |
|
15 | 15 | use cpython::{ |
|
16 | 16 | exc, ObjectProtocol, PyBool, PyBytes, PyClone, PyDict, PyErr, PyObject, |
|
17 | 17 | PyResult, PyTuple, Python, PythonObject, ToPyObject, |
|
18 | 18 | }; |
|
19 | 19 | use libc::c_char; |
|
20 | 20 | |
|
21 | 21 | use crate::{ |
|
22 | 22 | dirstate::copymap::{CopyMap, CopyMapItemsIterator, CopyMapKeysIterator}, |
|
23 | 23 | dirstate::{decapsule_make_dirstate_tuple, dirs_multiset::Dirs}, |
|
24 | 24 | ref_sharing::{PySharedRefCell, PySharedState}, |
|
25 | 25 | }; |
|
26 | 26 | use hg::{ |
|
27 | 27 | DirsMultiset, DirstateEntry, DirstateMap as RustDirstateMap, |
|
28 | 28 | DirstateParents, DirstateParseError, EntryState, StateMapIter, |
|
29 | 29 | PARENT_SIZE, |
|
30 | 30 | }; |
|
31 | 31 | |
|
32 | 32 | // TODO |
|
33 | 33 | // This object needs to share references to multiple members of its Rust |
|
34 | 34 | // inner struct, namely `copy_map`, `dirs` and `all_dirs`. |
|
35 | 35 | // Right now `CopyMap` is done, but it needs to have an explicit reference |
|
36 | 36 | // to `RustDirstateMap` which itself needs to have an encapsulation for |
|
37 | 37 | // every method in `CopyMap` (copymapcopy, etc.). |
|
38 | 38 | // This is ugly and hard to maintain. |
|
39 | 39 | // The same logic applies to `dirs` and `all_dirs`, however the `Dirs` |
|
40 | 40 | // `py_class!` is already implemented and does not mention |
|
41 | 41 | // `RustDirstateMap`, rightfully so. |
|
42 | 42 | // All attributes also have to have a separate refcount data attribute for |
|
43 | 43 | // leaks, with all methods that go along for reference sharing. |
|
44 | 44 | py_class!(pub class DirstateMap |py| { |
|
45 | 45 | data inner: PySharedRefCell<RustDirstateMap>; |
|
46 | 46 | data py_shared_state: PySharedState; |
|
47 | 47 | |
|
48 | 48 | def __new__(_cls, _root: PyObject) -> PyResult<Self> { |
|
49 | 49 | let inner = RustDirstateMap::default(); |
|
50 | 50 | Self::create_instance( |
|
51 | 51 | py, |
|
52 | 52 | PySharedRefCell::new(inner), |
|
53 | 53 | PySharedState::default() |
|
54 | 54 | ) |
|
55 | 55 | } |
|
56 | 56 | |
|
57 | 57 | def clear(&self) -> PyResult<PyObject> { |
|
58 | 58 | self.borrow_mut(py)?.clear(); |
|
59 | 59 | Ok(py.None()) |
|
60 | 60 | } |
|
61 | 61 | |
|
62 | 62 | def get( |
|
63 | 63 | &self, |
|
64 | 64 | key: PyObject, |
|
65 | 65 | default: Option<PyObject> = None |
|
66 | 66 | ) -> PyResult<Option<PyObject>> { |
|
67 | 67 | let key = key.extract::<PyBytes>(py)?; |
|
68 | 68 | match self.inner(py).borrow().get(key.data(py)) { |
|
69 | 69 | Some(entry) => { |
|
70 | 70 | // Explicitly go through u8 first, then cast to |
|
71 | 71 | // platform-specific `c_char`. |
|
72 | 72 | let state: u8 = entry.state.into(); |
|
73 | 73 | Ok(Some(decapsule_make_dirstate_tuple(py)?( |
|
74 | 74 | state as c_char, |
|
75 | 75 | entry.mode, |
|
76 | 76 | entry.size, |
|
77 | 77 | entry.mtime, |
|
78 | 78 | ))) |
|
79 | 79 | }, |
|
80 | 80 | None => Ok(default) |
|
81 | 81 | } |
|
82 | 82 | } |
|
83 | 83 | |
|
84 | 84 | def addfile( |
|
85 | 85 | &self, |
|
86 | 86 | f: PyObject, |
|
87 | 87 | oldstate: PyObject, |
|
88 | 88 | state: PyObject, |
|
89 | 89 | mode: PyObject, |
|
90 | 90 | size: PyObject, |
|
91 | 91 | mtime: PyObject |
|
92 | 92 | ) -> PyResult<PyObject> { |
|
93 | 93 | self.borrow_mut(py)?.add_file( |
|
94 | 94 | f.extract::<PyBytes>(py)?.data(py), |
|
95 | 95 | oldstate.extract::<PyBytes>(py)?.data(py)[0] |
|
96 | 96 | .try_into() |
|
97 | 97 | .map_err(|e: DirstateParseError| { |
|
98 | 98 | PyErr::new::<exc::ValueError, _>(py, e.to_string()) |
|
99 | 99 | })?, |
|
100 | 100 | DirstateEntry { |
|
101 | 101 | state: state.extract::<PyBytes>(py)?.data(py)[0] |
|
102 | 102 | .try_into() |
|
103 | 103 | .map_err(|e: DirstateParseError| { |
|
104 | 104 | PyErr::new::<exc::ValueError, _>(py, e.to_string()) |
|
105 | 105 | })?, |
|
106 | 106 | mode: mode.extract(py)?, |
|
107 | 107 | size: size.extract(py)?, |
|
108 | 108 | mtime: mtime.extract(py)?, |
|
109 | 109 | }, |
|
110 | 110 | ); |
|
111 | 111 | Ok(py.None()) |
|
112 | 112 | } |
|
113 | 113 | |
|
114 | 114 | def removefile( |
|
115 | 115 | &self, |
|
116 | 116 | f: PyObject, |
|
117 | 117 | oldstate: PyObject, |
|
118 | 118 | size: PyObject |
|
119 | 119 | ) -> PyResult<PyObject> { |
|
120 | 120 | self.borrow_mut(py)? |
|
121 | 121 | .remove_file( |
|
122 | 122 | f.extract::<PyBytes>(py)?.data(py), |
|
123 | 123 | oldstate.extract::<PyBytes>(py)?.data(py)[0] |
|
124 | 124 | .try_into() |
|
125 | 125 | .map_err(|e: DirstateParseError| { |
|
126 | 126 | PyErr::new::<exc::ValueError, _>(py, e.to_string()) |
|
127 | 127 | })?, |
|
128 | 128 | size.extract(py)?, |
|
129 | 129 | ) |
|
130 | 130 | .or_else(|_| { |
|
131 | 131 | Err(PyErr::new::<exc::OSError, _>( |
|
132 | 132 | py, |
|
133 | 133 | "Dirstate error".to_string(), |
|
134 | 134 | )) |
|
135 | 135 | })?; |
|
136 | 136 | Ok(py.None()) |
|
137 | 137 | } |
|
138 | 138 | |
|
139 | 139 | def dropfile( |
|
140 | 140 | &self, |
|
141 | 141 | f: PyObject, |
|
142 | 142 | oldstate: PyObject |
|
143 | 143 | ) -> PyResult<PyBool> { |
|
144 | 144 | self.borrow_mut(py)? |
|
145 | 145 | .drop_file( |
|
146 | 146 | f.extract::<PyBytes>(py)?.data(py), |
|
147 | 147 | oldstate.extract::<PyBytes>(py)?.data(py)[0] |
|
148 | 148 | .try_into() |
|
149 | 149 | .map_err(|e: DirstateParseError| { |
|
150 | 150 | PyErr::new::<exc::ValueError, _>(py, e.to_string()) |
|
151 | 151 | })?, |
|
152 | 152 | ) |
|
153 | 153 | .and_then(|b| Ok(b.to_py_object(py))) |
|
154 | 154 | .or_else(|_| { |
|
155 | 155 | Err(PyErr::new::<exc::OSError, _>( |
|
156 | 156 | py, |
|
157 | 157 | "Dirstate error".to_string(), |
|
158 | 158 | )) |
|
159 | 159 | }) |
|
160 | 160 | } |
|
161 | 161 | |
|
162 | 162 | def clearambiguoustimes( |
|
163 | 163 | &self, |
|
164 | 164 | files: PyObject, |
|
165 | 165 | now: PyObject |
|
166 | 166 | ) -> PyResult<PyObject> { |
|
167 | 167 | let files: PyResult<Vec<Vec<u8>>> = files |
|
168 | 168 | .iter(py)? |
|
169 | 169 | .map(|filename| { |
|
170 | 170 | Ok(filename?.extract::<PyBytes>(py)?.data(py).to_owned()) |
|
171 | 171 | }) |
|
172 | 172 | .collect(); |
|
173 | 173 | self.borrow_mut(py)? |
|
174 | 174 | .clear_ambiguous_times(files?, now.extract(py)?); |
|
175 | 175 | Ok(py.None()) |
|
176 | 176 | } |
|
177 | 177 | |
|
178 | 178 | // TODO share the reference |
|
179 | 179 | def nonnormalentries(&self) -> PyResult<PyObject> { |
|
180 | 180 | let (non_normal, other_parent) = |
|
181 | 181 | self.inner(py).borrow().non_normal_other_parent_entries(); |
|
182 | 182 | |
|
183 | 183 | let locals = PyDict::new(py); |
|
184 | 184 | locals.set_item( |
|
185 | 185 | py, |
|
186 | 186 | "non_normal", |
|
187 | 187 | non_normal |
|
188 | 188 | .iter() |
|
189 | 189 | .map(|v| PyBytes::new(py, &v)) |
|
190 | 190 | .collect::<Vec<PyBytes>>() |
|
191 | 191 | .to_py_object(py), |
|
192 | 192 | )?; |
|
193 | 193 | locals.set_item( |
|
194 | 194 | py, |
|
195 | 195 | "other_parent", |
|
196 | 196 | other_parent |
|
197 | 197 | .iter() |
|
198 | 198 | .map(|v| PyBytes::new(py, &v)) |
|
199 | 199 | .collect::<Vec<PyBytes>>() |
|
200 | 200 | .to_py_object(py), |
|
201 | 201 | )?; |
|
202 | 202 | |
|
203 | 203 | py.eval("set(non_normal), set(other_parent)", None, Some(&locals)) |
|
204 | 204 | } |
|
205 | 205 | |
|
206 | 206 | def hastrackeddir(&self, d: PyObject) -> PyResult<PyBool> { |
|
207 | 207 | let d = d.extract::<PyBytes>(py)?; |
|
208 | 208 | Ok(self.borrow_mut(py)? |
|
209 | 209 | .has_tracked_dir(d.data(py)) |
|
210 | 210 | .to_py_object(py)) |
|
211 | 211 | } |
|
212 | 212 | |
|
213 | 213 | def hasdir(&self, d: PyObject) -> PyResult<PyBool> { |
|
214 | 214 | let d = d.extract::<PyBytes>(py)?; |
|
215 | 215 | Ok(self.borrow_mut(py)? |
|
216 | 216 | .has_dir(d.data(py)) |
|
217 | 217 | .to_py_object(py)) |
|
218 | 218 | } |
|
219 | 219 | |
|
220 | 220 | def parents(&self, st: PyObject) -> PyResult<PyTuple> { |
|
221 | 221 | self.borrow_mut(py)? |
|
222 | 222 | .parents(st.extract::<PyBytes>(py)?.data(py)) |
|
223 | 223 | .and_then(|d| { |
|
224 | 224 | Ok((PyBytes::new(py, &d.p1), PyBytes::new(py, &d.p2)) |
|
225 | 225 | .to_py_object(py)) |
|
226 | 226 | }) |
|
227 | 227 | .or_else(|_| { |
|
228 | 228 | Err(PyErr::new::<exc::OSError, _>( |
|
229 | 229 | py, |
|
230 | 230 | "Dirstate error".to_string(), |
|
231 | 231 | )) |
|
232 | 232 | }) |
|
233 | 233 | } |
|
234 | 234 | |
|
235 | 235 | def setparents(&self, p1: PyObject, p2: PyObject) -> PyResult<PyObject> { |
|
236 | 236 | let p1 = extract_node_id(py, &p1)?; |
|
237 | 237 | let p2 = extract_node_id(py, &p2)?; |
|
238 | 238 | |
|
239 | 239 | self.borrow_mut(py)? |
|
240 | 240 | .set_parents(&DirstateParents { p1, p2 }); |
|
241 | 241 | Ok(py.None()) |
|
242 | 242 | } |
|
243 | 243 | |
|
244 | 244 | def read(&self, st: PyObject) -> PyResult<Option<PyObject>> { |
|
245 | 245 | match self.borrow_mut(py)? |
|
246 | 246 | .read(st.extract::<PyBytes>(py)?.data(py)) |
|
247 | 247 | { |
|
248 | 248 | Ok(Some(parents)) => Ok(Some( |
|
249 | 249 | (PyBytes::new(py, &parents.p1), PyBytes::new(py, &parents.p2)) |
|
250 | 250 | .to_py_object(py) |
|
251 | 251 | .into_object(), |
|
252 | 252 | )), |
|
253 | 253 | Ok(None) => Ok(Some(py.None())), |
|
254 | 254 | Err(_) => Err(PyErr::new::<exc::OSError, _>( |
|
255 | 255 | py, |
|
256 | 256 | "Dirstate error".to_string(), |
|
257 | 257 | )), |
|
258 | 258 | } |
|
259 | 259 | } |
|
260 | 260 | def write( |
|
261 | 261 | &self, |
|
262 | 262 | p1: PyObject, |
|
263 | 263 | p2: PyObject, |
|
264 | 264 | now: PyObject |
|
265 | 265 | ) -> PyResult<PyBytes> { |
|
266 | 266 | let now = Duration::new(now.extract(py)?, 0); |
|
267 | 267 | let parents = DirstateParents { |
|
268 | 268 | p1: extract_node_id(py, &p1)?, |
|
269 | 269 | p2: extract_node_id(py, &p2)?, |
|
270 | 270 | }; |
|
271 | 271 | |
|
272 | 272 | match self.borrow_mut(py)?.pack(parents, now) { |
|
273 | 273 | Ok(packed) => Ok(PyBytes::new(py, &packed)), |
|
274 | 274 | Err(_) => Err(PyErr::new::<exc::OSError, _>( |
|
275 | 275 | py, |
|
276 | 276 | "Dirstate error".to_string(), |
|
277 | 277 | )), |
|
278 | 278 | } |
|
279 | 279 | } |
|
280 | 280 | |
|
281 | 281 | def filefoldmapasdict(&self) -> PyResult<PyDict> { |
|
282 | 282 | let dict = PyDict::new(py); |
|
283 | 283 | for (key, value) in |
|
284 | 284 | self.borrow_mut(py)?.build_file_fold_map().iter() |
|
285 | 285 | { |
|
286 | 286 | dict.set_item(py, key, value)?; |
|
287 | 287 | } |
|
288 | 288 | Ok(dict) |
|
289 | 289 | } |
|
290 | 290 | |
|
291 | 291 | def __len__(&self) -> PyResult<usize> { |
|
292 | 292 | Ok(self.inner(py).borrow().len()) |
|
293 | 293 | } |
|
294 | 294 | |
|
295 | 295 | def __contains__(&self, key: PyObject) -> PyResult<bool> { |
|
296 | 296 | let key = key.extract::<PyBytes>(py)?; |
|
297 | 297 | Ok(self.inner(py).borrow().contains_key(key.data(py))) |
|
298 | 298 | } |
|
299 | 299 | |
|
300 | 300 | def __getitem__(&self, key: PyObject) -> PyResult<PyObject> { |
|
301 | 301 | let key = key.extract::<PyBytes>(py)?; |
|
302 | 302 | let key = key.data(py); |
|
303 | 303 | match self.inner(py).borrow().get(key) { |
|
304 | 304 | Some(entry) => { |
|
305 | 305 | // Explicitly go through u8 first, then cast to |
|
306 | 306 | // platform-specific `c_char`. |
|
307 | 307 | let state: u8 = entry.state.into(); |
|
308 | 308 | Ok(decapsule_make_dirstate_tuple(py)?( |
|
309 | 309 | state as c_char, |
|
310 | 310 | entry.mode, |
|
311 | 311 | entry.size, |
|
312 | 312 | entry.mtime, |
|
313 | 313 | )) |
|
314 | 314 | }, |
|
315 | 315 | None => Err(PyErr::new::<exc::KeyError, _>( |
|
316 | 316 | py, |
|
317 | 317 | String::from_utf8_lossy(key), |
|
318 | 318 | )), |
|
319 | 319 | } |
|
320 | 320 | } |
|
321 | 321 | |
|
322 | 322 | def keys(&self) -> PyResult<DirstateMapKeysIterator> { |
|
323 | 323 | let (leak_handle, leaked_ref) = unsafe { self.leak_immutable(py)? }; |
|
324 | 324 | DirstateMapKeysIterator::from_inner( |
|
325 | 325 | py, |
|
326 | 326 | Some(leak_handle), |
|
327 | 327 | leaked_ref.iter(), |
|
328 | 328 | ) |
|
329 | 329 | } |
|
330 | 330 | |
|
331 | 331 | def items(&self) -> PyResult<DirstateMapItemsIterator> { |
|
332 | 332 | let (leak_handle, leaked_ref) = unsafe { self.leak_immutable(py)? }; |
|
333 | 333 | DirstateMapItemsIterator::from_inner( |
|
334 | 334 | py, |
|
335 | 335 | Some(leak_handle), |
|
336 | 336 | leaked_ref.iter(), |
|
337 | 337 | ) |
|
338 | 338 | } |
|
339 | 339 | |
|
340 | 340 | def __iter__(&self) -> PyResult<DirstateMapKeysIterator> { |
|
341 | 341 | let (leak_handle, leaked_ref) = unsafe { self.leak_immutable(py)? }; |
|
342 | 342 | DirstateMapKeysIterator::from_inner( |
|
343 | 343 | py, |
|
344 | 344 | Some(leak_handle), |
|
345 | 345 | leaked_ref.iter(), |
|
346 | 346 | ) |
|
347 | 347 | } |
|
348 | 348 | |
|
349 | 349 | def getdirs(&self) -> PyResult<Dirs> { |
|
350 | 350 | // TODO don't copy, share the reference |
|
351 | 351 | self.borrow_mut(py)?.set_dirs(); |
|
352 | 352 | Dirs::from_inner( |
|
353 | 353 | py, |
|
354 | 354 | DirsMultiset::from_dirstate( |
|
355 | 355 | &self.inner(py).borrow(), |
|
356 | 356 | Some(EntryState::Removed), |
|
357 | 357 | ), |
|
358 | 358 | ) |
|
359 | 359 | } |
|
360 | 360 | def getalldirs(&self) -> PyResult<Dirs> { |
|
361 | 361 | // TODO don't copy, share the reference |
|
362 | 362 | self.borrow_mut(py)?.set_all_dirs(); |
|
363 | 363 | Dirs::from_inner( |
|
364 | 364 | py, |
|
365 | 365 | DirsMultiset::from_dirstate( |
|
366 | 366 | &self.inner(py).borrow(), |
|
367 | 367 | None, |
|
368 | 368 | ), |
|
369 | 369 | ) |
|
370 | 370 | } |
|
371 | 371 | |
|
372 | 372 | // TODO all copymap* methods, see docstring above |
|
373 | 373 | def copymapcopy(&self) -> PyResult<PyDict> { |
|
374 | 374 | let dict = PyDict::new(py); |
|
375 | 375 | for (key, value) in self.inner(py).borrow().copy_map.iter() { |
|
376 | 376 | dict.set_item(py, PyBytes::new(py, key), PyBytes::new(py, value))?; |
|
377 | 377 | } |
|
378 | 378 | Ok(dict) |
|
379 | 379 | } |
|
380 | 380 | |
|
381 | 381 | def copymapgetitem(&self, key: PyObject) -> PyResult<PyBytes> { |
|
382 | 382 | let key = key.extract::<PyBytes>(py)?; |
|
383 | 383 | match self.inner(py).borrow().copy_map.get(key.data(py)) { |
|
384 | 384 | Some(copy) => Ok(PyBytes::new(py, copy)), |
|
385 | 385 | None => Err(PyErr::new::<exc::KeyError, _>( |
|
386 | 386 | py, |
|
387 | 387 | String::from_utf8_lossy(key.data(py)), |
|
388 | 388 | )), |
|
389 | 389 | } |
|
390 | 390 | } |
|
391 | 391 | def copymap(&self) -> PyResult<CopyMap> { |
|
392 | 392 | CopyMap::from_inner(py, self.clone_ref(py)) |
|
393 | 393 | } |
|
394 | 394 | |
|
395 | 395 | def copymaplen(&self) -> PyResult<usize> { |
|
396 | 396 | Ok(self.inner(py).borrow().copy_map.len()) |
|
397 | 397 | } |
|
398 | 398 | def copymapcontains(&self, key: PyObject) -> PyResult<bool> { |
|
399 | 399 | let key = key.extract::<PyBytes>(py)?; |
|
400 | 400 | Ok(self.inner(py).borrow().copy_map.contains_key(key.data(py))) |
|
401 | 401 | } |
|
402 | 402 | def copymapget( |
|
403 | 403 | &self, |
|
404 | 404 | key: PyObject, |
|
405 | 405 | default: Option<PyObject> |
|
406 | 406 | ) -> PyResult<Option<PyObject>> { |
|
407 | 407 | let key = key.extract::<PyBytes>(py)?; |
|
408 | 408 | match self.inner(py).borrow().copy_map.get(key.data(py)) { |
|
409 | 409 | Some(copy) => Ok(Some(PyBytes::new(py, copy).into_object())), |
|
410 | 410 | None => Ok(default), |
|
411 | 411 | } |
|
412 | 412 | } |
|
413 | 413 | def copymapsetitem( |
|
414 | 414 | &self, |
|
415 | 415 | key: PyObject, |
|
416 | 416 | value: PyObject |
|
417 | 417 | ) -> PyResult<PyObject> { |
|
418 | 418 | let key = key.extract::<PyBytes>(py)?; |
|
419 | 419 | let value = value.extract::<PyBytes>(py)?; |
|
420 | 420 | self.borrow_mut(py)? |
|
421 | 421 | .copy_map |
|
422 | 422 | .insert(key.data(py).to_vec(), value.data(py).to_vec()); |
|
423 | 423 | Ok(py.None()) |
|
424 | 424 | } |
|
425 | 425 | def copymappop( |
|
426 | 426 | &self, |
|
427 | 427 | key: PyObject, |
|
428 | 428 | default: Option<PyObject> |
|
429 | 429 | ) -> PyResult<Option<PyObject>> { |
|
430 | 430 | let key = key.extract::<PyBytes>(py)?; |
|
431 | 431 | match self.borrow_mut(py)?.copy_map.remove(key.data(py)) { |
|
432 | 432 | Some(_) => Ok(None), |
|
433 | 433 | None => Ok(default), |
|
434 | 434 | } |
|
435 | 435 | } |
|
436 | 436 | |
|
437 | 437 | def copymapiter(&self) -> PyResult<CopyMapKeysIterator> { |
|
438 | 438 | let (leak_handle, leaked_ref) = unsafe { self.leak_immutable(py)? }; |
|
439 | 439 | CopyMapKeysIterator::from_inner( |
|
440 | 440 | py, |
|
441 | 441 | Some(leak_handle), |
|
442 | 442 | leaked_ref.copy_map.iter(), |
|
443 | 443 | ) |
|
444 | 444 | } |
|
445 | 445 | |
|
446 | 446 | def copymapitemsiter(&self) -> PyResult<CopyMapItemsIterator> { |
|
447 | 447 | let (leak_handle, leaked_ref) = unsafe { self.leak_immutable(py)? }; |
|
448 | 448 | CopyMapItemsIterator::from_inner( |
|
449 | 449 | py, |
|
450 | 450 | Some(leak_handle), |
|
451 | 451 | leaked_ref.copy_map.iter(), |
|
452 | 452 | ) |
|
453 | 453 | } |
|
454 | 454 | |
|
455 | 455 | }); |
|
456 | 456 | |
|
457 | 457 | impl DirstateMap { |
|
458 | 458 | fn translate_key( |
|
459 | 459 | py: Python, |
|
460 | 460 | res: (&Vec<u8>, &DirstateEntry), |
|
461 | 461 | ) -> PyResult<Option<PyBytes>> { |
|
462 | 462 | Ok(Some(PyBytes::new(py, res.0))) |
|
463 | 463 | } |
|
464 | 464 | fn translate_key_value( |
|
465 | 465 | py: Python, |
|
466 | 466 | res: (&Vec<u8>, &DirstateEntry), |
|
467 | 467 | ) -> PyResult<Option<(PyBytes, PyObject)>> { |
|
468 | 468 | let (f, entry) = res; |
|
469 | 469 | |
|
470 | 470 | // Explicitly go through u8 first, then cast to |
|
471 | 471 | // platform-specific `c_char`. |
|
472 | 472 | let state: u8 = entry.state.into(); |
|
473 | 473 | Ok(Some(( |
|
474 | 474 | PyBytes::new(py, f), |
|
475 | 475 | decapsule_make_dirstate_tuple(py)?( |
|
476 | 476 | state as c_char, |
|
477 | 477 | entry.mode, |
|
478 | 478 | entry.size, |
|
479 | 479 | entry.mtime, |
|
480 | 480 | ), |
|
481 | 481 | ))) |
|
482 | 482 | } |
|
483 | 483 | } |
|
484 | 484 | |
|
485 | 485 | py_shared_ref!(DirstateMap, RustDirstateMap, inner, DirstateMapLeakedRef,); |
|
486 | 486 | |
|
487 |
py_shared_iterator |
|
|
487 | py_shared_iterator!( | |
|
488 | 488 | DirstateMapKeysIterator, |
|
489 | 489 | DirstateMapLeakedRef, |
|
490 | 490 | StateMapIter<'static>, |
|
491 | 491 | DirstateMap::translate_key, |
|
492 | 492 | Option<PyBytes> |
|
493 | 493 | ); |
|
494 | 494 | |
|
495 |
py_shared_iterator |
|
|
495 | py_shared_iterator!( | |
|
496 | 496 | DirstateMapItemsIterator, |
|
497 | 497 | DirstateMapLeakedRef, |
|
498 | 498 | StateMapIter<'static>, |
|
499 | 499 | DirstateMap::translate_key_value, |
|
500 | 500 | Option<(PyBytes, PyObject)> |
|
501 | 501 | ); |
|
502 | 502 | |
|
503 | 503 | fn extract_node_id(py: Python, obj: &PyObject) -> PyResult<[u8; PARENT_SIZE]> { |
|
504 | 504 | let bytes = obj.extract::<PyBytes>(py)?; |
|
505 | 505 | match bytes.data(py).try_into() { |
|
506 | 506 | Ok(s) => Ok(s), |
|
507 | 507 | Err(e) => Err(PyErr::new::<exc::ValueError, _>(py, e.to_string())), |
|
508 | 508 | } |
|
509 | 509 | } |
@@ -1,392 +1,392 b'' | |||
|
1 | 1 | // macros.rs |
|
2 | 2 | // |
|
3 | 3 | // Copyright 2019 Raphaël Gomès <rgomes@octobus.net> |
|
4 | 4 | // |
|
5 | 5 | // This software may be used and distributed according to the terms of the |
|
6 | 6 | // GNU General Public License version 2 or any later version. |
|
7 | 7 | |
|
8 | 8 | //! Macros for use in the `hg-cpython` bridge library. |
|
9 | 9 | |
|
10 | 10 | use crate::exceptions::AlreadyBorrowed; |
|
11 | 11 | use cpython::{PyResult, Python}; |
|
12 | 12 | use std::cell::{Cell, Ref, RefCell, RefMut}; |
|
13 | 13 | |
|
14 | 14 | /// Manages the shared state between Python and Rust |
|
15 | 15 | #[derive(Default)] |
|
16 | 16 | pub struct PySharedState { |
|
17 | 17 | leak_count: Cell<usize>, |
|
18 | 18 | mutably_borrowed: Cell<bool>, |
|
19 | 19 | } |
|
20 | 20 | |
|
21 | 21 | impl PySharedState { |
|
22 | 22 | pub fn borrow_mut<'a, T>( |
|
23 | 23 | &'a self, |
|
24 | 24 | py: Python<'a>, |
|
25 | 25 | pyrefmut: RefMut<'a, T>, |
|
26 | 26 | ) -> PyResult<PyRefMut<'a, T>> { |
|
27 | 27 | if self.mutably_borrowed.get() { |
|
28 | 28 | return Err(AlreadyBorrowed::new( |
|
29 | 29 | py, |
|
30 | 30 | "Cannot borrow mutably while there exists another \ |
|
31 | 31 | mutable reference in a Python object", |
|
32 | 32 | )); |
|
33 | 33 | } |
|
34 | 34 | match self.leak_count.get() { |
|
35 | 35 | 0 => { |
|
36 | 36 | self.mutably_borrowed.replace(true); |
|
37 | 37 | Ok(PyRefMut::new(py, pyrefmut, self)) |
|
38 | 38 | } |
|
39 | 39 | // TODO |
|
40 | 40 | // For now, this works differently than Python references |
|
41 | 41 | // in the case of iterators. |
|
42 | 42 | // Python does not complain when the data an iterator |
|
43 | 43 | // points to is modified if the iterator is never used |
|
44 | 44 | // afterwards. |
|
45 | 45 | // Here, we are stricter than this by refusing to give a |
|
46 | 46 | // mutable reference if it is already borrowed. |
|
47 | 47 | // While the additional safety might be argued for, it |
|
48 | 48 | // breaks valid programming patterns in Python and we need |
|
49 | 49 | // to fix this issue down the line. |
|
50 | 50 | _ => Err(AlreadyBorrowed::new( |
|
51 | 51 | py, |
|
52 | 52 | "Cannot borrow mutably while there are \ |
|
53 | 53 | immutable references in Python objects", |
|
54 | 54 | )), |
|
55 | 55 | } |
|
56 | 56 | } |
|
57 | 57 | |
|
58 | 58 | /// Return a reference to the wrapped data with an artificial static |
|
59 | 59 | /// lifetime. |
|
60 | 60 | /// We need to be protected by the GIL for thread-safety. |
|
61 | 61 | /// |
|
62 | 62 | /// # Safety |
|
63 | 63 | /// |
|
64 | 64 | /// This is highly unsafe since the lifetime of the given data can be |
|
65 | 65 | /// extended. Do not call this function directly. |
|
66 | 66 | pub unsafe fn leak_immutable<T>( |
|
67 | 67 | &self, |
|
68 | 68 | py: Python, |
|
69 | 69 | data: &PySharedRefCell<T>, |
|
70 | 70 | ) -> PyResult<&'static T> { |
|
71 | 71 | if self.mutably_borrowed.get() { |
|
72 | 72 | return Err(AlreadyBorrowed::new( |
|
73 | 73 | py, |
|
74 | 74 | "Cannot borrow immutably while there is a \ |
|
75 | 75 | mutable reference in Python objects", |
|
76 | 76 | )); |
|
77 | 77 | } |
|
78 | 78 | let ptr = data.as_ptr(); |
|
79 | 79 | self.leak_count.replace(self.leak_count.get() + 1); |
|
80 | 80 | Ok(&*ptr) |
|
81 | 81 | } |
|
82 | 82 | |
|
83 | 83 | /// # Safety |
|
84 | 84 | /// |
|
85 | 85 | /// It's unsafe to update the reference count without knowing the |
|
86 | 86 | /// reference is deleted. Do not call this function directly. |
|
87 | 87 | pub unsafe fn decrease_leak_count(&self, _py: Python, mutable: bool) { |
|
88 | 88 | self.leak_count |
|
89 | 89 | .replace(self.leak_count.get().saturating_sub(1)); |
|
90 | 90 | if mutable { |
|
91 | 91 | self.mutably_borrowed.replace(false); |
|
92 | 92 | } |
|
93 | 93 | } |
|
94 | 94 | } |
|
95 | 95 | |
|
96 | 96 | /// `RefCell` wrapper to be safely used in conjunction with `PySharedState`. |
|
97 | 97 | /// |
|
98 | 98 | /// Only immutable operation is allowed through this interface. |
|
99 | 99 | #[derive(Debug)] |
|
100 | 100 | pub struct PySharedRefCell<T> { |
|
101 | 101 | inner: RefCell<T>, |
|
102 | 102 | } |
|
103 | 103 | |
|
104 | 104 | impl<T> PySharedRefCell<T> { |
|
105 | 105 | pub const fn new(value: T) -> PySharedRefCell<T> { |
|
106 | 106 | Self { |
|
107 | 107 | inner: RefCell::new(value), |
|
108 | 108 | } |
|
109 | 109 | } |
|
110 | 110 | |
|
111 | 111 | pub fn borrow(&self) -> Ref<T> { |
|
112 | 112 | // py_shared_state isn't involved since |
|
113 | 113 | // - inner.borrow() would fail if self is mutably borrowed, |
|
114 | 114 | // - and inner.borrow_mut() would fail while self is borrowed. |
|
115 | 115 | self.inner.borrow() |
|
116 | 116 | } |
|
117 | 117 | |
|
118 | 118 | pub fn as_ptr(&self) -> *mut T { |
|
119 | 119 | self.inner.as_ptr() |
|
120 | 120 | } |
|
121 | 121 | |
|
122 | 122 | pub unsafe fn borrow_mut(&self) -> RefMut<T> { |
|
123 | 123 | // must be borrowed by self.py_shared_state(py).borrow_mut(). |
|
124 | 124 | self.inner.borrow_mut() |
|
125 | 125 | } |
|
126 | 126 | } |
|
127 | 127 | |
|
128 | 128 | /// Holds a mutable reference to data shared between Python and Rust. |
|
129 | 129 | pub struct PyRefMut<'a, T> { |
|
130 | 130 | inner: RefMut<'a, T>, |
|
131 | 131 | py_shared_state: &'a PySharedState, |
|
132 | 132 | } |
|
133 | 133 | |
|
134 | 134 | impl<'a, T> PyRefMut<'a, T> { |
|
135 | 135 | // Must be constructed by PySharedState after checking its leak_count. |
|
136 | 136 | // Otherwise, drop() would incorrectly update the state. |
|
137 | 137 | fn new( |
|
138 | 138 | _py: Python<'a>, |
|
139 | 139 | inner: RefMut<'a, T>, |
|
140 | 140 | py_shared_state: &'a PySharedState, |
|
141 | 141 | ) -> Self { |
|
142 | 142 | Self { |
|
143 | 143 | inner, |
|
144 | 144 | py_shared_state, |
|
145 | 145 | } |
|
146 | 146 | } |
|
147 | 147 | } |
|
148 | 148 | |
|
149 | 149 | impl<'a, T> std::ops::Deref for PyRefMut<'a, T> { |
|
150 | 150 | type Target = RefMut<'a, T>; |
|
151 | 151 | |
|
152 | 152 | fn deref(&self) -> &Self::Target { |
|
153 | 153 | &self.inner |
|
154 | 154 | } |
|
155 | 155 | } |
|
156 | 156 | impl<'a, T> std::ops::DerefMut for PyRefMut<'a, T> { |
|
157 | 157 | fn deref_mut(&mut self) -> &mut Self::Target { |
|
158 | 158 | &mut self.inner |
|
159 | 159 | } |
|
160 | 160 | } |
|
161 | 161 | |
|
162 | 162 | impl<'a, T> Drop for PyRefMut<'a, T> { |
|
163 | 163 | fn drop(&mut self) { |
|
164 | 164 | let gil = Python::acquire_gil(); |
|
165 | 165 | let py = gil.python(); |
|
166 | 166 | unsafe { |
|
167 | 167 | self.py_shared_state.decrease_leak_count(py, true); |
|
168 | 168 | } |
|
169 | 169 | } |
|
170 | 170 | } |
|
171 | 171 | |
|
172 | 172 | /// Allows a `py_class!` generated struct to share references to one of its |
|
173 | 173 | /// data members with Python. |
|
174 | 174 | /// |
|
175 | 175 | /// # Warning |
|
176 | 176 | /// |
|
177 | 177 | /// The targeted `py_class!` needs to have the |
|
178 | 178 | /// `data py_shared_state: PySharedState;` data attribute to compile. |
|
179 | 179 | /// A better, more complicated macro is needed to automatically insert it, |
|
180 | 180 | /// but this one is not yet really battle tested (what happens when |
|
181 | 181 | /// multiple references are needed?). See the example below. |
|
182 | 182 | /// |
|
183 | 183 | /// TODO allow Python container types: for now, integration with the garbage |
|
184 | 184 | /// collector does not extend to Rust structs holding references to Python |
|
185 | 185 | /// objects. Should the need surface, `__traverse__` and `__clear__` will |
|
186 | 186 | /// need to be written as per the `rust-cpython` docs on GC integration. |
|
187 | 187 | /// |
|
188 | 188 | /// # Parameters |
|
189 | 189 | /// |
|
190 | 190 | /// * `$name` is the same identifier used in for `py_class!` macro call. |
|
191 | 191 | /// * `$inner_struct` is the identifier of the underlying Rust struct |
|
192 | 192 | /// * `$data_member` is the identifier of the data member of `$inner_struct` |
|
193 | 193 | /// that will be shared. |
|
194 | 194 | /// * `$leaked` is the identifier to give to the struct that will manage |
|
195 | 195 | /// references to `$name`, to be used for example in other macros like |
|
196 |
/// `py_shared_iterator |
|
|
196 | /// `py_shared_iterator`. | |
|
197 | 197 | /// |
|
198 | 198 | /// # Example |
|
199 | 199 | /// |
|
200 | 200 | /// ``` |
|
201 | 201 | /// struct MyStruct { |
|
202 | 202 | /// inner: Vec<u32>; |
|
203 | 203 | /// } |
|
204 | 204 | /// |
|
205 | 205 | /// py_class!(pub class MyType |py| { |
|
206 | 206 | /// data inner: PySharedRefCell<MyStruct>; |
|
207 | 207 | /// data py_shared_state: PySharedState; |
|
208 | 208 | /// }); |
|
209 | 209 | /// |
|
210 | 210 | /// py_shared_ref!(MyType, MyStruct, inner, MyTypeLeakedRef); |
|
211 | 211 | /// ``` |
|
212 | 212 | macro_rules! py_shared_ref { |
|
213 | 213 | ( |
|
214 | 214 | $name: ident, |
|
215 | 215 | $inner_struct: ident, |
|
216 | 216 | $data_member: ident, |
|
217 | 217 | $leaked: ident, |
|
218 | 218 | ) => { |
|
219 | 219 | impl $name { |
|
220 | 220 | fn borrow_mut<'a>( |
|
221 | 221 | &'a self, |
|
222 | 222 | py: Python<'a>, |
|
223 | 223 | ) -> PyResult<crate::ref_sharing::PyRefMut<'a, $inner_struct>> |
|
224 | 224 | { |
|
225 | 225 | // assert $data_member type |
|
226 | 226 | use crate::ref_sharing::PySharedRefCell; |
|
227 | 227 | let data: &PySharedRefCell<_> = self.$data_member(py); |
|
228 | 228 | self.py_shared_state(py) |
|
229 | 229 | .borrow_mut(py, unsafe { data.borrow_mut() }) |
|
230 | 230 | } |
|
231 | 231 | |
|
232 | 232 | /// Returns a leaked reference and its management object. |
|
233 | 233 | /// |
|
234 | 234 | /// # Safety |
|
235 | 235 | /// |
|
236 | 236 | /// It's up to you to make sure that the management object lives |
|
237 | 237 | /// longer than the leaked reference. Otherwise, you'll get a |
|
238 | 238 | /// dangling reference. |
|
239 | 239 | unsafe fn leak_immutable<'a>( |
|
240 | 240 | &'a self, |
|
241 | 241 | py: Python<'a>, |
|
242 | 242 | ) -> PyResult<($leaked, &'static $inner_struct)> { |
|
243 | 243 | // assert $data_member type |
|
244 | 244 | use crate::ref_sharing::PySharedRefCell; |
|
245 | 245 | let data: &PySharedRefCell<_> = self.$data_member(py); |
|
246 | 246 | let static_ref = |
|
247 | 247 | self.py_shared_state(py).leak_immutable(py, data)?; |
|
248 | 248 | let leak_handle = $leaked::new(py, self); |
|
249 | 249 | Ok((leak_handle, static_ref)) |
|
250 | 250 | } |
|
251 | 251 | } |
|
252 | 252 | |
|
253 | 253 | /// Manage immutable references to `$name` leaked into Python |
|
254 | 254 | /// iterators. |
|
255 | 255 | /// |
|
256 | 256 | /// In truth, this does not represent leaked references themselves; |
|
257 | 257 | /// it is instead useful alongside them to manage them. |
|
258 | 258 | pub struct $leaked { |
|
259 | 259 | inner: $name, |
|
260 | 260 | } |
|
261 | 261 | |
|
262 | 262 | impl $leaked { |
|
263 | 263 | // Marked as unsafe so client code wouldn't construct $leaked |
|
264 | 264 | // struct by mistake. Its drop() is unsafe. |
|
265 | 265 | unsafe fn new(py: Python, inner: &$name) -> Self { |
|
266 | 266 | Self { |
|
267 | 267 | inner: inner.clone_ref(py), |
|
268 | 268 | } |
|
269 | 269 | } |
|
270 | 270 | } |
|
271 | 271 | |
|
272 | 272 | impl Drop for $leaked { |
|
273 | 273 | fn drop(&mut self) { |
|
274 | 274 | let gil = Python::acquire_gil(); |
|
275 | 275 | let py = gil.python(); |
|
276 | 276 | let state = self.inner.py_shared_state(py); |
|
277 | 277 | unsafe { |
|
278 | 278 | state.decrease_leak_count(py, false); |
|
279 | 279 | } |
|
280 | 280 | } |
|
281 | 281 | } |
|
282 | 282 | }; |
|
283 | 283 | } |
|
284 | 284 | |
|
285 | 285 | /// Defines a `py_class!` that acts as a Python iterator over a Rust iterator. |
|
286 | 286 | /// |
|
287 | 287 | /// TODO: this is a bit awkward to use, and a better (more complicated) |
|
288 | 288 | /// procedural macro would simplify the interface a lot. |
|
289 | 289 | /// |
|
290 | 290 | /// # Parameters |
|
291 | 291 | /// |
|
292 | 292 | /// * `$name` is the identifier to give to the resulting Rust struct. |
|
293 | 293 | /// * `$leaked` corresponds to `$leaked` in the matching `py_shared_ref!` call. |
|
294 | 294 | /// * `$iterator_type` is the type of the Rust iterator. |
|
295 | 295 | /// * `$success_func` is a function for processing the Rust `(key, value)` |
|
296 | 296 | /// tuple on iteration success, turning it into something Python understands. |
|
297 | 297 | /// * `$success_func` is the return type of `$success_func` |
|
298 | 298 | /// |
|
299 | 299 | /// # Example |
|
300 | 300 | /// |
|
301 | 301 | /// ``` |
|
302 | 302 | /// struct MyStruct { |
|
303 | 303 | /// inner: HashMap<Vec<u8>, Vec<u8>>; |
|
304 | 304 | /// } |
|
305 | 305 | /// |
|
306 | 306 | /// py_class!(pub class MyType |py| { |
|
307 | 307 | /// data inner: PySharedRefCell<MyStruct>; |
|
308 | 308 | /// data py_shared_state: PySharedState; |
|
309 | 309 | /// |
|
310 | 310 | /// def __iter__(&self) -> PyResult<MyTypeItemsIterator> { |
|
311 | 311 | /// let (leak_handle, leaked_ref) = unsafe { self.leak_immutable(py)? }; |
|
312 | 312 | /// MyTypeItemsIterator::create_instance( |
|
313 | 313 | /// py, |
|
314 | 314 | /// RefCell::new(Some(leak_handle)), |
|
315 | 315 | /// RefCell::new(leaked_ref.iter()), |
|
316 | 316 | /// ) |
|
317 | 317 | /// } |
|
318 | 318 | /// }); |
|
319 | 319 | /// |
|
320 | 320 | /// impl MyType { |
|
321 | 321 | /// fn translate_key_value( |
|
322 | 322 | /// py: Python, |
|
323 | 323 | /// res: (&Vec<u8>, &Vec<u8>), |
|
324 | 324 | /// ) -> PyResult<Option<(PyBytes, PyBytes)>> { |
|
325 | 325 | /// let (f, entry) = res; |
|
326 | 326 | /// Ok(Some(( |
|
327 | 327 | /// PyBytes::new(py, f), |
|
328 | 328 | /// PyBytes::new(py, entry), |
|
329 | 329 | /// ))) |
|
330 | 330 | /// } |
|
331 | 331 | /// } |
|
332 | 332 | /// |
|
333 | 333 | /// py_shared_ref!(MyType, MyStruct, inner, MyTypeLeakedRef); |
|
334 | 334 | /// |
|
335 |
/// py_shared_iterator |
|
|
335 | /// py_shared_iterator!( | |
|
336 | 336 | /// MyTypeItemsIterator, |
|
337 | 337 | /// MyTypeLeakedRef, |
|
338 | 338 | /// HashMap<'static, Vec<u8>, Vec<u8>>, |
|
339 | 339 | /// MyType::translate_key_value, |
|
340 | 340 | /// Option<(PyBytes, PyBytes)> |
|
341 | 341 | /// ); |
|
342 | 342 | /// ``` |
|
343 |
macro_rules! py_shared_iterator |
|
|
343 | macro_rules! py_shared_iterator { | |
|
344 | 344 | ( |
|
345 | 345 | $name: ident, |
|
346 | 346 | $leaked: ident, |
|
347 | 347 | $iterator_type: ty, |
|
348 | 348 | $success_func: expr, |
|
349 | 349 | $success_type: ty |
|
350 | 350 | ) => { |
|
351 | 351 | py_class!(pub class $name |py| { |
|
352 | 352 | data inner: RefCell<Option<$leaked>>; |
|
353 | 353 | data it: RefCell<$iterator_type>; |
|
354 | 354 | |
|
355 | 355 | def __next__(&self) -> PyResult<$success_type> { |
|
356 | 356 | let mut inner_opt = self.inner(py).borrow_mut(); |
|
357 | 357 | if inner_opt.is_some() { |
|
358 | 358 | match self.it(py).borrow_mut().next() { |
|
359 | 359 | None => { |
|
360 | 360 | // replace Some(inner) by None, drop $leaked |
|
361 | 361 | inner_opt.take(); |
|
362 | 362 | Ok(None) |
|
363 | 363 | } |
|
364 | 364 | Some(res) => { |
|
365 | 365 | $success_func(py, res) |
|
366 | 366 | } |
|
367 | 367 | } |
|
368 | 368 | } else { |
|
369 | 369 | Ok(None) |
|
370 | 370 | } |
|
371 | 371 | } |
|
372 | 372 | |
|
373 | 373 | def __iter__(&self) -> PyResult<Self> { |
|
374 | 374 | Ok(self.clone_ref(py)) |
|
375 | 375 | } |
|
376 | 376 | }); |
|
377 | 377 | |
|
378 | 378 | impl $name { |
|
379 | 379 | pub fn from_inner( |
|
380 | 380 | py: Python, |
|
381 | 381 | leaked: Option<$leaked>, |
|
382 | 382 | it: $iterator_type |
|
383 | 383 | ) -> PyResult<Self> { |
|
384 | 384 | Self::create_instance( |
|
385 | 385 | py, |
|
386 | 386 | RefCell::new(leaked), |
|
387 | 387 | RefCell::new(it) |
|
388 | 388 | ) |
|
389 | 389 | } |
|
390 | 390 | } |
|
391 | 391 | }; |
|
392 | 392 | } |
General Comments 0
You need to be logged in to leave comments.
Login now