SG: clear termination bit in sg_chain()
[deliverable/linux.git] / include / linux / scatterlist.h
1 #ifndef _LINUX_SCATTERLIST_H
2 #define _LINUX_SCATTERLIST_H
3
4 #include <asm/types.h>
5 #include <asm/scatterlist.h>
6 #include <linux/mm.h>
7 #include <linux/string.h>
8 #include <asm/io.h>
9
10 /*
11 * Notes on SG table design.
12 *
13 * Architectures must provide an unsigned long page_link field in the
14 * scatterlist struct. We use that to place the page pointer AND encode
15 * information about the sg table as well. The two lower bits are reserved
16 * for this information.
17 *
18 * If bit 0 is set, then the page_link contains a pointer to the next sg
19 * table list. Otherwise the next entry is at sg + 1.
20 *
21 * If bit 1 is set, then this sg entry is the last element in a list.
22 *
23 * See sg_next().
24 *
25 */
26
27 #define SG_MAGIC 0x87654321
28
29 /**
30 * sg_assign_page - Assign a given page to an SG entry
31 * @sg: SG entry
32 * @page: The page
33 *
34 * Description:
35 * Assign page to sg entry. Also see sg_set_page(), the most commonly used
36 * variant.
37 *
38 **/
39 static inline void sg_assign_page(struct scatterlist *sg, struct page *page)
40 {
41 unsigned long page_link = sg->page_link & 0x3;
42
43 /*
44 * In order for the low bit stealing approach to work, pages
45 * must be aligned at a 32-bit boundary as a minimum.
46 */
47 BUG_ON((unsigned long) page & 0x03);
48 #ifdef CONFIG_DEBUG_SG
49 BUG_ON(sg->sg_magic != SG_MAGIC);
50 #endif
51 sg->page_link = page_link | (unsigned long) page;
52 }
53
54 /**
55 * sg_set_page - Set sg entry to point at given page
56 * @sg: SG entry
57 * @page: The page
58 * @len: Length of data
59 * @offset: Offset into page
60 *
61 * Description:
62 * Use this function to set an sg entry pointing at a page, never assign
63 * the page directly. We encode sg table information in the lower bits
64 * of the page pointer. See sg_page() for looking up the page belonging
65 * to an sg entry.
66 *
67 **/
68 static inline void sg_set_page(struct scatterlist *sg, struct page *page,
69 unsigned int len, unsigned int offset)
70 {
71 sg_assign_page(sg, page);
72 sg->offset = offset;
73 sg->length = len;
74 }
75
76 #define sg_page(sg) ((struct page *) ((sg)->page_link & ~0x3))
77
78 /**
79 * sg_set_buf - Set sg entry to point at given data
80 * @sg: SG entry
81 * @buf: Data
82 * @buflen: Data length
83 *
84 **/
85 static inline void sg_set_buf(struct scatterlist *sg, const void *buf,
86 unsigned int buflen)
87 {
88 sg_set_page(sg, virt_to_page(buf), buflen, offset_in_page(buf));
89 }
90
91 /*
92 * We overload the LSB of the page pointer to indicate whether it's
93 * a valid sg entry, or whether it points to the start of a new scatterlist.
94 * Those low bits are there for everyone! (thanks mason :-)
95 */
96 #define sg_is_chain(sg) ((sg)->page_link & 0x01)
97 #define sg_is_last(sg) ((sg)->page_link & 0x02)
98 #define sg_chain_ptr(sg) \
99 ((struct scatterlist *) ((sg)->page_link & ~0x03))
100
101 /**
102 * sg_next - return the next scatterlist entry in a list
103 * @sg: The current sg entry
104 *
105 * Description:
106 * Usually the next entry will be @sg@ + 1, but if this sg element is part
107 * of a chained scatterlist, it could jump to the start of a new
108 * scatterlist array.
109 *
110 **/
111 static inline struct scatterlist *sg_next(struct scatterlist *sg)
112 {
113 #ifdef CONFIG_DEBUG_SG
114 BUG_ON(sg->sg_magic != SG_MAGIC);
115 #endif
116 if (sg_is_last(sg))
117 return NULL;
118
119 sg++;
120 if (unlikely(sg_is_chain(sg)))
121 sg = sg_chain_ptr(sg);
122
123 return sg;
124 }
125
126 /*
127 * Loop over each sg element, following the pointer to a new list if necessary
128 */
129 #define for_each_sg(sglist, sg, nr, __i) \
130 for (__i = 0, sg = (sglist); __i < (nr); __i++, sg = sg_next(sg))
131
132 /**
133 * sg_last - return the last scatterlist entry in a list
134 * @sgl: First entry in the scatterlist
135 * @nents: Number of entries in the scatterlist
136 *
137 * Description:
138 * Should only be used casually, it (currently) scan the entire list
139 * to get the last entry.
140 *
141 * Note that the @sgl@ pointer passed in need not be the first one,
142 * the important bit is that @nents@ denotes the number of entries that
143 * exist from @sgl@.
144 *
145 **/
146 static inline struct scatterlist *sg_last(struct scatterlist *sgl,
147 unsigned int nents)
148 {
149 #ifndef ARCH_HAS_SG_CHAIN
150 struct scatterlist *ret = &sgl[nents - 1];
151 #else
152 struct scatterlist *sg, *ret = NULL;
153 int i;
154
155 for_each_sg(sgl, sg, nents, i)
156 ret = sg;
157
158 #endif
159 #ifdef CONFIG_DEBUG_SG
160 BUG_ON(sgl[0].sg_magic != SG_MAGIC);
161 BUG_ON(!sg_is_last(ret));
162 #endif
163 return ret;
164 }
165
166 /**
167 * sg_chain - Chain two sglists together
168 * @prv: First scatterlist
169 * @prv_nents: Number of entries in prv
170 * @sgl: Second scatterlist
171 *
172 * Description:
173 * Links @prv@ and @sgl@ together, to form a longer scatterlist.
174 *
175 **/
176 static inline void sg_chain(struct scatterlist *prv, unsigned int prv_nents,
177 struct scatterlist *sgl)
178 {
179 #ifndef ARCH_HAS_SG_CHAIN
180 BUG();
181 #endif
182 /*
183 * Set lowest bit to indicate a link pointer, and make sure to clear
184 * the termination bit if it happens to be set.
185 */
186 prv[prv_nents - 1].page_link = ((unsigned long) sgl | 0x01) & ~0x02;
187 }
188
189 /**
190 * sg_mark_end - Mark the end of the scatterlist
191 * @sgl: Scatterlist
192 * @nents: Number of entries in sgl
193 *
194 * Description:
195 * Marks the last entry as the termination point for sg_next()
196 *
197 **/
198 static inline void sg_mark_end(struct scatterlist *sgl, unsigned int nents)
199 {
200 sgl[nents - 1].page_link = 0x02;
201 }
202
203 static inline void __sg_mark_end(struct scatterlist *sg)
204 {
205 sg->page_link |= 0x02;
206 }
207
208 /**
209 * sg_init_one - Initialize a single entry sg list
210 * @sg: SG entry
211 * @buf: Virtual address for IO
212 * @buflen: IO length
213 *
214 * Notes:
215 * This should not be used on a single entry that is part of a larger
216 * table. Use sg_init_table() for that.
217 *
218 **/
219 static inline void sg_init_one(struct scatterlist *sg, const void *buf,
220 unsigned int buflen)
221 {
222 memset(sg, 0, sizeof(*sg));
223 #ifdef CONFIG_DEBUG_SG
224 sg->sg_magic = SG_MAGIC;
225 #endif
226 sg_mark_end(sg, 1);
227 sg_set_buf(sg, buf, buflen);
228 }
229
230 /**
231 * sg_init_table - Initialize SG table
232 * @sgl: The SG table
233 * @nents: Number of entries in table
234 *
235 * Notes:
236 * If this is part of a chained sg table, sg_mark_end() should be
237 * used only on the last table part.
238 *
239 **/
240 static inline void sg_init_table(struct scatterlist *sgl, unsigned int nents)
241 {
242 memset(sgl, 0, sizeof(*sgl) * nents);
243 sg_mark_end(sgl, nents);
244 #ifdef CONFIG_DEBUG_SG
245 {
246 int i;
247 for (i = 0; i < nents; i++)
248 sgl[i].sg_magic = SG_MAGIC;
249 }
250 #endif
251 }
252
253 /**
254 * sg_phys - Return physical address of an sg entry
255 * @sg: SG entry
256 *
257 * Description:
258 * This calls page_to_phys() on the page in this sg entry, and adds the
259 * sg offset. The caller must know that it is legal to call page_to_phys()
260 * on the sg page.
261 *
262 **/
263 static inline dma_addr_t sg_phys(struct scatterlist *sg)
264 {
265 return page_to_phys(sg_page(sg)) + sg->offset;
266 }
267
268 /**
269 * sg_virt - Return virtual address of an sg entry
270 * @sg: SG entry
271 *
272 * Description:
273 * This calls page_address() on the page in this sg entry, and adds the
274 * sg offset. The caller must know that the sg page has a valid virtual
275 * mapping.
276 *
277 **/
278 static inline void *sg_virt(struct scatterlist *sg)
279 {
280 return page_address(sg_page(sg)) + sg->offset;
281 }
282
283 #endif /* _LINUX_SCATTERLIST_H */
This page took 0.057842 seconds and 5 git commands to generate.