Commit | Line | Data |
---|---|---|
3e7ee490 HJ |
1 | /* |
2 | * | |
3 | * Copyright (c) 2009, Microsoft Corporation. | |
4 | * | |
5 | * This program is free software; you can redistribute it and/or modify it | |
6 | * under the terms and conditions of the GNU General Public License, | |
7 | * version 2, as published by the Free Software Foundation. | |
8 | * | |
9 | * This program is distributed in the hope it will be useful, but WITHOUT | |
10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for | |
12 | * more details. | |
13 | * | |
14 | * You should have received a copy of the GNU General Public License along with | |
15 | * this program; if not, write to the Free Software Foundation, Inc., 59 Temple | |
16 | * Place - Suite 330, Boston, MA 02111-1307 USA. | |
17 | * | |
18 | * Authors: | |
19 | * Haiyang Zhang <haiyangz@microsoft.com> | |
20 | * Hank Janssen <hjanssen@microsoft.com> | |
b2a5a585 | 21 | * K. Y. Srinivasan <kys@microsoft.com> |
3e7ee490 HJ |
22 | * |
23 | */ | |
0a46618d | 24 | #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
3e7ee490 | 25 | |
a0086dc5 GKH |
26 | #include <linux/kernel.h> |
27 | #include <linux/mm.h> | |
46a97191 | 28 | #include <linux/hyperv.h> |
011a7c3c | 29 | #include <linux/uio.h> |
3f335ea2 | 30 | |
0f2a6619 | 31 | #include "hyperv_vmbus.h" |
3e7ee490 | 32 | |
6fdf3b21 S |
33 | void hv_begin_read(struct hv_ring_buffer_info *rbi) |
34 | { | |
35 | rbi->ring_buffer->interrupt_mask = 1; | |
35848f68 | 36 | mb(); |
6fdf3b21 S |
37 | } |
38 | ||
39 | u32 hv_end_read(struct hv_ring_buffer_info *rbi) | |
40 | { | |
41 | u32 read; | |
42 | u32 write; | |
43 | ||
44 | rbi->ring_buffer->interrupt_mask = 0; | |
35848f68 | 45 | mb(); |
6fdf3b21 S |
46 | |
47 | /* | |
48 | * Now check to see if the ring buffer is still empty. | |
49 | * If it is not, we raced and we need to process new | |
50 | * incoming messages. | |
51 | */ | |
52 | hv_get_ringbuffer_availbytes(rbi, &read, &write); | |
53 | ||
54 | return read; | |
55 | } | |
56 | ||
98fa8cf4 S |
57 | /* |
58 | * When we write to the ring buffer, check if the host needs to | |
59 | * be signaled. Here is the details of this protocol: | |
60 | * | |
61 | * 1. The host guarantees that while it is draining the | |
62 | * ring buffer, it will set the interrupt_mask to | |
63 | * indicate it does not need to be interrupted when | |
64 | * new data is placed. | |
65 | * | |
66 | * 2. The host guarantees that it will completely drain | |
67 | * the ring buffer before exiting the read loop. Further, | |
68 | * once the ring buffer is empty, it will clear the | |
69 | * interrupt_mask and re-check to see if new data has | |
70 | * arrived. | |
71 | */ | |
72 | ||
73 | static bool hv_need_to_signal(u32 old_write, struct hv_ring_buffer_info *rbi) | |
74 | { | |
35848f68 | 75 | mb(); |
98fa8cf4 S |
76 | if (rbi->ring_buffer->interrupt_mask) |
77 | return false; | |
78 | ||
e91e84fa JW |
79 | /* check interrupt_mask before read_index */ |
80 | rmb(); | |
98fa8cf4 S |
81 | /* |
82 | * This is the only case we need to signal when the | |
83 | * ring transitions from being empty to non-empty. | |
84 | */ | |
85 | if (old_write == rbi->ring_buffer->read_index) | |
86 | return true; | |
87 | ||
88 | return false; | |
89 | } | |
90 | ||
c2b8e520 S |
91 | /* |
92 | * To optimize the flow management on the send-side, | |
93 | * when the sender is blocked because of lack of | |
94 | * sufficient space in the ring buffer, potential the | |
95 | * consumer of the ring buffer can signal the producer. | |
96 | * This is controlled by the following parameters: | |
97 | * | |
98 | * 1. pending_send_sz: This is the size in bytes that the | |
99 | * producer is trying to send. | |
100 | * 2. The feature bit feat_pending_send_sz set to indicate if | |
101 | * the consumer of the ring will signal when the ring | |
102 | * state transitions from being full to a state where | |
103 | * there is room for the producer to send the pending packet. | |
104 | */ | |
105 | ||
106 | static bool hv_need_to_signal_on_read(u32 old_rd, | |
107 | struct hv_ring_buffer_info *rbi) | |
108 | { | |
109 | u32 prev_write_sz; | |
110 | u32 cur_write_sz; | |
111 | u32 r_size; | |
112 | u32 write_loc = rbi->ring_buffer->write_index; | |
113 | u32 read_loc = rbi->ring_buffer->read_index; | |
114 | u32 pending_sz = rbi->ring_buffer->pending_send_sz; | |
115 | ||
116 | /* | |
117 | * If the other end is not blocked on write don't bother. | |
118 | */ | |
119 | if (pending_sz == 0) | |
120 | return false; | |
121 | ||
122 | r_size = rbi->ring_datasize; | |
123 | cur_write_sz = write_loc >= read_loc ? r_size - (write_loc - read_loc) : | |
124 | read_loc - write_loc; | |
125 | ||
126 | prev_write_sz = write_loc >= old_rd ? r_size - (write_loc - old_rd) : | |
127 | old_rd - write_loc; | |
128 | ||
129 | ||
130 | if ((prev_write_sz < pending_sz) && (cur_write_sz >= pending_sz)) | |
131 | return true; | |
132 | ||
133 | return false; | |
134 | } | |
3e7ee490 | 135 | |
b2a5a585 S |
136 | /* |
137 | * hv_get_next_write_location() | |
138 | * | |
139 | * Get the next write location for the specified ring buffer | |
140 | * | |
141 | */ | |
4d643114 | 142 | static inline u32 |
2b8a912e | 143 | hv_get_next_write_location(struct hv_ring_buffer_info *ring_info) |
3e7ee490 | 144 | { |
fc8c72eb | 145 | u32 next = ring_info->ring_buffer->write_index; |
3e7ee490 | 146 | |
3e7ee490 HJ |
147 | return next; |
148 | } | |
149 | ||
b2a5a585 S |
150 | /* |
151 | * hv_set_next_write_location() | |
152 | * | |
153 | * Set the next write location for the specified ring buffer | |
154 | * | |
155 | */ | |
3e7ee490 | 156 | static inline void |
2b8a912e | 157 | hv_set_next_write_location(struct hv_ring_buffer_info *ring_info, |
fc8c72eb | 158 | u32 next_write_location) |
3e7ee490 | 159 | { |
fc8c72eb | 160 | ring_info->ring_buffer->write_index = next_write_location; |
3e7ee490 HJ |
161 | } |
162 | ||
b2a5a585 S |
163 | /* |
164 | * hv_get_next_read_location() | |
165 | * | |
166 | * Get the next read location for the specified ring buffer | |
167 | */ | |
4d643114 | 168 | static inline u32 |
2b8a912e | 169 | hv_get_next_read_location(struct hv_ring_buffer_info *ring_info) |
3e7ee490 | 170 | { |
fc8c72eb | 171 | u32 next = ring_info->ring_buffer->read_index; |
3e7ee490 | 172 | |
3e7ee490 HJ |
173 | return next; |
174 | } | |
175 | ||
b2a5a585 S |
176 | /* |
177 | * hv_get_next_readlocation_withoffset() | |
178 | * | |
179 | * Get the next read location + offset for the specified ring buffer. | |
180 | * This allows the caller to skip | |
181 | */ | |
4d643114 | 182 | static inline u32 |
2b8a912e | 183 | hv_get_next_readlocation_withoffset(struct hv_ring_buffer_info *ring_info, |
1ac58644 | 184 | u32 offset) |
3e7ee490 | 185 | { |
fc8c72eb | 186 | u32 next = ring_info->ring_buffer->read_index; |
3e7ee490 | 187 | |
fc8c72eb HZ |
188 | next += offset; |
189 | next %= ring_info->ring_datasize; | |
3e7ee490 HJ |
190 | |
191 | return next; | |
192 | } | |
193 | ||
b2a5a585 S |
194 | /* |
195 | * | |
196 | * hv_set_next_read_location() | |
197 | * | |
198 | * Set the next read location for the specified ring buffer | |
199 | * | |
200 | */ | |
3e7ee490 | 201 | static inline void |
2b8a912e | 202 | hv_set_next_read_location(struct hv_ring_buffer_info *ring_info, |
fc8c72eb | 203 | u32 next_read_location) |
3e7ee490 | 204 | { |
fc8c72eb | 205 | ring_info->ring_buffer->read_index = next_read_location; |
3e7ee490 HJ |
206 | } |
207 | ||
208 | ||
b2a5a585 S |
209 | /* |
210 | * | |
211 | * hv_get_ring_buffer() | |
212 | * | |
213 | * Get the start of the ring buffer | |
214 | */ | |
8282c400 | 215 | static inline void * |
2b8a912e | 216 | hv_get_ring_buffer(struct hv_ring_buffer_info *ring_info) |
3e7ee490 | 217 | { |
fc8c72eb | 218 | return (void *)ring_info->ring_buffer->buffer; |
3e7ee490 HJ |
219 | } |
220 | ||
221 | ||
b2a5a585 S |
222 | /* |
223 | * | |
224 | * hv_get_ring_buffersize() | |
225 | * | |
226 | * Get the size of the ring buffer | |
227 | */ | |
4d643114 | 228 | static inline u32 |
2b8a912e | 229 | hv_get_ring_buffersize(struct hv_ring_buffer_info *ring_info) |
3e7ee490 | 230 | { |
fc8c72eb | 231 | return ring_info->ring_datasize; |
3e7ee490 HJ |
232 | } |
233 | ||
b2a5a585 S |
234 | /* |
235 | * | |
236 | * hv_get_ring_bufferindices() | |
237 | * | |
238 | * Get the read and write indices as u64 of the specified ring buffer | |
239 | * | |
240 | */ | |
59471438 | 241 | static inline u64 |
2b8a912e | 242 | hv_get_ring_bufferindices(struct hv_ring_buffer_info *ring_info) |
3e7ee490 | 243 | { |
fc8c72eb | 244 | return (u64)ring_info->ring_buffer->write_index << 32; |
3e7ee490 HJ |
245 | } |
246 | ||
8f1136ae S |
247 | /* |
248 | * | |
249 | * hv_copyfrom_ringbuffer() | |
250 | * | |
251 | * Helper routine to copy to source from ring buffer. | |
252 | * Assume there is enough room. Handles wrap-around in src case only!! | |
253 | * | |
254 | */ | |
255 | static u32 hv_copyfrom_ringbuffer( | |
256 | struct hv_ring_buffer_info *ring_info, | |
257 | void *dest, | |
258 | u32 destlen, | |
259 | u32 start_read_offset) | |
260 | { | |
261 | void *ring_buffer = hv_get_ring_buffer(ring_info); | |
262 | u32 ring_buffer_size = hv_get_ring_buffersize(ring_info); | |
263 | ||
264 | u32 frag_len; | |
265 | ||
266 | /* wrap-around detected at the src */ | |
267 | if (destlen > ring_buffer_size - start_read_offset) { | |
268 | frag_len = ring_buffer_size - start_read_offset; | |
269 | ||
270 | memcpy(dest, ring_buffer + start_read_offset, frag_len); | |
271 | memcpy(dest + frag_len, ring_buffer, destlen - frag_len); | |
272 | } else | |
273 | ||
274 | memcpy(dest, ring_buffer + start_read_offset, destlen); | |
275 | ||
276 | ||
277 | start_read_offset += destlen; | |
278 | start_read_offset %= ring_buffer_size; | |
279 | ||
280 | return start_read_offset; | |
281 | } | |
282 | ||
283 | ||
7581578d S |
284 | /* |
285 | * | |
286 | * hv_copyto_ringbuffer() | |
287 | * | |
288 | * Helper routine to copy from source to ring buffer. | |
289 | * Assume there is enough room. Handles wrap-around in dest case only!! | |
290 | * | |
291 | */ | |
292 | static u32 hv_copyto_ringbuffer( | |
fc8c72eb HZ |
293 | struct hv_ring_buffer_info *ring_info, |
294 | u32 start_write_offset, | |
295 | void *src, | |
7581578d S |
296 | u32 srclen) |
297 | { | |
298 | void *ring_buffer = hv_get_ring_buffer(ring_info); | |
299 | u32 ring_buffer_size = hv_get_ring_buffersize(ring_info); | |
300 | u32 frag_len; | |
301 | ||
302 | /* wrap-around detected! */ | |
303 | if (srclen > ring_buffer_size - start_write_offset) { | |
304 | frag_len = ring_buffer_size - start_write_offset; | |
305 | memcpy(ring_buffer + start_write_offset, src, frag_len); | |
306 | memcpy(ring_buffer, src + frag_len, srclen - frag_len); | |
307 | } else | |
308 | memcpy(ring_buffer + start_write_offset, src, srclen); | |
3e7ee490 | 309 | |
7581578d S |
310 | start_write_offset += srclen; |
311 | start_write_offset %= ring_buffer_size; | |
312 | ||
313 | return start_write_offset; | |
314 | } | |
3e7ee490 | 315 | |
b2a5a585 S |
316 | /* |
317 | * | |
318 | * hv_ringbuffer_get_debuginfo() | |
319 | * | |
320 | * Get various debug metrics for the specified ring buffer | |
321 | * | |
322 | */ | |
a75b61d5 | 323 | void hv_ringbuffer_get_debuginfo(struct hv_ring_buffer_info *ring_info, |
80682b7a | 324 | struct hv_ring_buffer_debug_info *debug_info) |
3e7ee490 | 325 | { |
fc8c72eb HZ |
326 | u32 bytes_avail_towrite; |
327 | u32 bytes_avail_toread; | |
3e7ee490 | 328 | |
fc8c72eb | 329 | if (ring_info->ring_buffer) { |
2b8a912e | 330 | hv_get_ringbuffer_availbytes(ring_info, |
fc8c72eb HZ |
331 | &bytes_avail_toread, |
332 | &bytes_avail_towrite); | |
3e7ee490 | 333 | |
fc8c72eb HZ |
334 | debug_info->bytes_avail_toread = bytes_avail_toread; |
335 | debug_info->bytes_avail_towrite = bytes_avail_towrite; | |
82f8bd40 | 336 | debug_info->current_read_index = |
fc8c72eb | 337 | ring_info->ring_buffer->read_index; |
82f8bd40 | 338 | debug_info->current_write_index = |
fc8c72eb | 339 | ring_info->ring_buffer->write_index; |
82f8bd40 | 340 | debug_info->current_interrupt_mask = |
fc8c72eb | 341 | ring_info->ring_buffer->interrupt_mask; |
3e7ee490 HJ |
342 | } |
343 | } | |
344 | ||
b2a5a585 S |
345 | /* |
346 | * | |
347 | * hv_ringbuffer_init() | |
348 | * | |
349 | *Initialize the ring buffer | |
350 | * | |
351 | */ | |
72a95cbc | 352 | int hv_ringbuffer_init(struct hv_ring_buffer_info *ring_info, |
fc8c72eb | 353 | void *buffer, u32 buflen) |
3e7ee490 | 354 | { |
4a1b3acc | 355 | if (sizeof(struct hv_ring_buffer) != PAGE_SIZE) |
3324fb40 | 356 | return -EINVAL; |
3e7ee490 | 357 | |
fc8c72eb | 358 | memset(ring_info, 0, sizeof(struct hv_ring_buffer_info)); |
3e7ee490 | 359 | |
fc8c72eb HZ |
360 | ring_info->ring_buffer = (struct hv_ring_buffer *)buffer; |
361 | ring_info->ring_buffer->read_index = | |
362 | ring_info->ring_buffer->write_index = 0; | |
3e7ee490 | 363 | |
fc8c72eb HZ |
364 | ring_info->ring_size = buflen; |
365 | ring_info->ring_datasize = buflen - sizeof(struct hv_ring_buffer); | |
3e7ee490 | 366 | |
fc8c72eb | 367 | spin_lock_init(&ring_info->ring_lock); |
3e7ee490 HJ |
368 | |
369 | return 0; | |
370 | } | |
371 | ||
b2a5a585 S |
372 | /* |
373 | * | |
374 | * hv_ringbuffer_cleanup() | |
375 | * | |
376 | * Cleanup the ring buffer | |
377 | * | |
378 | */ | |
2dba688b | 379 | void hv_ringbuffer_cleanup(struct hv_ring_buffer_info *ring_info) |
3e7ee490 | 380 | { |
3e7ee490 HJ |
381 | } |
382 | ||
b2a5a585 S |
383 | /* |
384 | * | |
385 | * hv_ringbuffer_write() | |
386 | * | |
387 | * Write to the ring buffer | |
388 | * | |
389 | */ | |
633c4dce | 390 | int hv_ringbuffer_write(struct hv_ring_buffer_info *outring_info, |
011a7c3c | 391 | struct kvec *kv_list, u32 kv_count, bool *signal) |
3e7ee490 | 392 | { |
4408f531 | 393 | int i = 0; |
fc8c72eb HZ |
394 | u32 bytes_avail_towrite; |
395 | u32 bytes_avail_toread; | |
396 | u32 totalbytes_towrite = 0; | |
3e7ee490 | 397 | |
66a60543 | 398 | u32 next_write_location; |
98fa8cf4 | 399 | u32 old_write; |
fc8c72eb | 400 | u64 prev_indices = 0; |
a98f96ee | 401 | unsigned long flags; |
3e7ee490 | 402 | |
011a7c3c S |
403 | for (i = 0; i < kv_count; i++) |
404 | totalbytes_towrite += kv_list[i].iov_len; | |
3e7ee490 | 405 | |
fc8c72eb | 406 | totalbytes_towrite += sizeof(u64); |
3e7ee490 | 407 | |
fc8c72eb | 408 | spin_lock_irqsave(&outring_info->ring_lock, flags); |
3e7ee490 | 409 | |
2b8a912e | 410 | hv_get_ringbuffer_availbytes(outring_info, |
fc8c72eb HZ |
411 | &bytes_avail_toread, |
412 | &bytes_avail_towrite); | |
3e7ee490 | 413 | |
3e7ee490 | 414 | |
4408f531 B |
415 | /* If there is only room for the packet, assume it is full. */ |
416 | /* Otherwise, the next time around, we think the ring buffer */ | |
454f18a9 | 417 | /* is empty since the read index == write index */ |
fc8c72eb | 418 | if (bytes_avail_towrite <= totalbytes_towrite) { |
fc8c72eb | 419 | spin_unlock_irqrestore(&outring_info->ring_lock, flags); |
d2598f01 | 420 | return -EAGAIN; |
3e7ee490 HJ |
421 | } |
422 | ||
454f18a9 | 423 | /* Write to the ring buffer */ |
2b8a912e | 424 | next_write_location = hv_get_next_write_location(outring_info); |
3e7ee490 | 425 | |
98fa8cf4 S |
426 | old_write = next_write_location; |
427 | ||
011a7c3c | 428 | for (i = 0; i < kv_count; i++) { |
2b8a912e | 429 | next_write_location = hv_copyto_ringbuffer(outring_info, |
fc8c72eb | 430 | next_write_location, |
011a7c3c S |
431 | kv_list[i].iov_base, |
432 | kv_list[i].iov_len); | |
3e7ee490 HJ |
433 | } |
434 | ||
454f18a9 | 435 | /* Set previous packet start */ |
2b8a912e | 436 | prev_indices = hv_get_ring_bufferindices(outring_info); |
3e7ee490 | 437 | |
2b8a912e | 438 | next_write_location = hv_copyto_ringbuffer(outring_info, |
fc8c72eb HZ |
439 | next_write_location, |
440 | &prev_indices, | |
b219b3f7 | 441 | sizeof(u64)); |
3e7ee490 | 442 | |
98fa8cf4 | 443 | /* Issue a full memory barrier before updating the write index */ |
35848f68 | 444 | mb(); |
3e7ee490 | 445 | |
454f18a9 | 446 | /* Now, update the write location */ |
2b8a912e | 447 | hv_set_next_write_location(outring_info, next_write_location); |
3e7ee490 | 448 | |
3e7ee490 | 449 | |
fc8c72eb | 450 | spin_unlock_irqrestore(&outring_info->ring_lock, flags); |
98fa8cf4 S |
451 | |
452 | *signal = hv_need_to_signal(old_write, outring_info); | |
3e7ee490 HJ |
453 | return 0; |
454 | } | |
455 | ||
456 | ||
b2a5a585 S |
457 | /* |
458 | * | |
459 | * hv_ringbuffer_peek() | |
460 | * | |
461 | * Read without advancing the read index | |
462 | * | |
463 | */ | |
a89186c2 | 464 | int hv_ringbuffer_peek(struct hv_ring_buffer_info *Inring_info, |
fc8c72eb | 465 | void *Buffer, u32 buflen) |
3e7ee490 | 466 | { |
fc8c72eb HZ |
467 | u32 bytes_avail_towrite; |
468 | u32 bytes_avail_toread; | |
469 | u32 next_read_location = 0; | |
a98f96ee | 470 | unsigned long flags; |
3e7ee490 | 471 | |
fc8c72eb | 472 | spin_lock_irqsave(&Inring_info->ring_lock, flags); |
3e7ee490 | 473 | |
2b8a912e | 474 | hv_get_ringbuffer_availbytes(Inring_info, |
fc8c72eb HZ |
475 | &bytes_avail_toread, |
476 | &bytes_avail_towrite); | |
3e7ee490 | 477 | |
454f18a9 | 478 | /* Make sure there is something to read */ |
fc8c72eb | 479 | if (bytes_avail_toread < buflen) { |
3e7ee490 | 480 | |
fc8c72eb | 481 | spin_unlock_irqrestore(&Inring_info->ring_lock, flags); |
3e7ee490 | 482 | |
d2598f01 | 483 | return -EAGAIN; |
3e7ee490 HJ |
484 | } |
485 | ||
454f18a9 | 486 | /* Convert to byte offset */ |
2b8a912e | 487 | next_read_location = hv_get_next_read_location(Inring_info); |
3e7ee490 | 488 | |
2b8a912e | 489 | next_read_location = hv_copyfrom_ringbuffer(Inring_info, |
4408f531 | 490 | Buffer, |
fc8c72eb HZ |
491 | buflen, |
492 | next_read_location); | |
3e7ee490 | 493 | |
fc8c72eb | 494 | spin_unlock_irqrestore(&Inring_info->ring_lock, flags); |
3e7ee490 HJ |
495 | |
496 | return 0; | |
497 | } | |
498 | ||
499 | ||
b2a5a585 S |
500 | /* |
501 | * | |
502 | * hv_ringbuffer_read() | |
503 | * | |
504 | * Read and advance the read index | |
505 | * | |
506 | */ | |
38397c8a | 507 | int hv_ringbuffer_read(struct hv_ring_buffer_info *inring_info, void *buffer, |
c2b8e520 | 508 | u32 buflen, u32 offset, bool *signal) |
3e7ee490 | 509 | { |
fc8c72eb HZ |
510 | u32 bytes_avail_towrite; |
511 | u32 bytes_avail_toread; | |
512 | u32 next_read_location = 0; | |
513 | u64 prev_indices = 0; | |
a98f96ee | 514 | unsigned long flags; |
c2b8e520 | 515 | u32 old_read; |
3e7ee490 | 516 | |
fc8c72eb | 517 | if (buflen <= 0) |
a16e1485 | 518 | return -EINVAL; |
3e7ee490 | 519 | |
fc8c72eb | 520 | spin_lock_irqsave(&inring_info->ring_lock, flags); |
3e7ee490 | 521 | |
2b8a912e | 522 | hv_get_ringbuffer_availbytes(inring_info, |
fc8c72eb HZ |
523 | &bytes_avail_toread, |
524 | &bytes_avail_towrite); | |
3e7ee490 | 525 | |
c2b8e520 S |
526 | old_read = bytes_avail_toread; |
527 | ||
454f18a9 | 528 | /* Make sure there is something to read */ |
fc8c72eb | 529 | if (bytes_avail_toread < buflen) { |
fc8c72eb | 530 | spin_unlock_irqrestore(&inring_info->ring_lock, flags); |
3e7ee490 | 531 | |
d2598f01 | 532 | return -EAGAIN; |
3e7ee490 HJ |
533 | } |
534 | ||
1ac58644 | 535 | next_read_location = |
2b8a912e | 536 | hv_get_next_readlocation_withoffset(inring_info, offset); |
3e7ee490 | 537 | |
2b8a912e | 538 | next_read_location = hv_copyfrom_ringbuffer(inring_info, |
fc8c72eb HZ |
539 | buffer, |
540 | buflen, | |
541 | next_read_location); | |
3e7ee490 | 542 | |
2b8a912e | 543 | next_read_location = hv_copyfrom_ringbuffer(inring_info, |
fc8c72eb | 544 | &prev_indices, |
4408f531 | 545 | sizeof(u64), |
fc8c72eb | 546 | next_read_location); |
3e7ee490 | 547 | |
454f18a9 | 548 | /* Make sure all reads are done before we update the read index since */ |
4408f531 B |
549 | /* the writer may start writing to the read area once the read index */ |
550 | /*is updated */ | |
35848f68 | 551 | mb(); |
3e7ee490 | 552 | |
454f18a9 | 553 | /* Update the read index */ |
2b8a912e | 554 | hv_set_next_read_location(inring_info, next_read_location); |
3e7ee490 | 555 | |
fc8c72eb | 556 | spin_unlock_irqrestore(&inring_info->ring_lock, flags); |
3e7ee490 | 557 | |
c2b8e520 S |
558 | *signal = hv_need_to_signal_on_read(old_read, inring_info); |
559 | ||
3e7ee490 HJ |
560 | return 0; |
561 | } |