2 * Copyright (c) 2016 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
7 * http://www.apache.org/licenses/LICENSE-2.0
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.
16 #include <svm/svm_fifo.h>
17 #include <vppinfra/cpu.h>
20 position_lt (svm_fifo_t * f, u32 a, u32 b)
22 return (ooo_segment_distance_from_tail (f, a)
23 < ooo_segment_distance_from_tail (f, b));
27 position_leq (svm_fifo_t * f, u32 a, u32 b)
29 return (ooo_segment_distance_from_tail (f, a)
30 <= ooo_segment_distance_from_tail (f, b));
34 position_gt (svm_fifo_t * f, u32 a, u32 b)
36 return (ooo_segment_distance_from_tail (f, a)
37 > ooo_segment_distance_from_tail (f, b));
41 position_diff (svm_fifo_t * f, u32 posa, u32 posb)
43 return ooo_segment_distance_from_tail (f, posa)
44 - ooo_segment_distance_from_tail (f, posb);
48 ooo_segment_end_pos (svm_fifo_t * f, ooo_segment_t * s)
50 return (s->start + s->length) % f->nitems;
54 format_ooo_segment (u8 * s, va_list * args)
56 svm_fifo_t *f = va_arg (*args, svm_fifo_t *);
57 ooo_segment_t *seg = va_arg (*args, ooo_segment_t *);
58 u32 normalized_start = (seg->start + f->nitems - f->tail) % f->nitems;
59 s = format (s, "[%u, %u], len %u, next %d, prev %d", normalized_start,
60 (normalized_start + seg->length) % f->nitems, seg->length,
61 seg->next, seg->prev);
66 svm_fifo_dump_trace (u8 * s, svm_fifo_t * f)
69 svm_fifo_trace_elem_t *seg = 0;
74 vec_foreach (seg, f->trace)
76 s = format (s, "{%u, %u, %u}, ", seg->offset, seg->len, seg->action);
90 svm_fifo_replay (u8 * s, svm_fifo_t * f, u8 no_read, u8 verbose)
94 svm_fifo_trace_elem_t *trace;
96 svm_fifo_t *dummy_fifo;
103 trace_len = vec_len (trace);
109 dummy_fifo = svm_fifo_create (f->nitems);
110 memset (f->data, 0xFF, f->nitems);
112 vec_validate (data, f->nitems);
113 for (i = 0; i < vec_len (data); i++)
116 for (i = 0; i < trace_len; i++)
118 offset = trace[i].offset;
119 if (trace[i].action == 1)
122 s = format (s, "adding [%u, %u]:", trace[i].offset,
124 trace[i].len) % dummy_fifo->nitems);
125 svm_fifo_enqueue_with_offset (dummy_fifo, trace[i].offset,
126 trace[i].len, &data[offset]);
128 else if (trace[i].action == 2)
131 s = format (s, "adding [%u, %u]:", 0, trace[i].len);
132 svm_fifo_enqueue_nowait (dummy_fifo, trace[i].len, &data[offset]);
137 s = format (s, "read: %u", trace[i].len);
138 svm_fifo_dequeue_drop (dummy_fifo, trace[i].len);
141 s = format (s, "%U", format_svm_fifo, dummy_fifo, 1);
144 s = format (s, "result: %U", format_svm_fifo, dummy_fifo, 1);
150 format_ooo_list (u8 * s, va_list * args)
152 svm_fifo_t *f = va_arg (*args, svm_fifo_t *);
153 u32 ooo_segment_index = f->ooos_list_head;
156 while (ooo_segment_index != OOO_SEGMENT_INVALID_INDEX)
158 seg = pool_elt_at_index (f->ooo_segments, ooo_segment_index);
159 s = format (s, " %U\n", format_ooo_segment, f, seg);
160 ooo_segment_index = seg->next;
167 format_svm_fifo (u8 * s, va_list * args)
169 svm_fifo_t *f = va_arg (*args, svm_fifo_t *);
170 int verbose = va_arg (*args, int);
175 s = format (s, "cursize %u nitems %u has_event %d\n",
176 f->cursize, f->nitems, f->has_event);
177 s = format (s, " head %d tail %d\n", f->head, f->tail);
181 (s, " server session %d thread %d client session %d thread %d\n",
182 f->master_session_index, f->master_thread_index,
183 f->client_session_index, f->client_thread_index);
187 s = format (s, " ooo pool %d active elts newest %u\n",
188 pool_elts (f->ooo_segments), f->ooos_newest);
189 if (svm_fifo_has_ooo_data (f))
190 s = format (s, " %U", format_ooo_list, f, verbose);
195 /** create an svm fifo, in the current heap. Fails vs blow up the process */
197 svm_fifo_create (u32 data_size_in_bytes)
200 u32 rounded_data_size;
202 /* always round fifo data size to the next highest power-of-two */
203 rounded_data_size = (1 << (max_log2 (data_size_in_bytes)));
204 f = clib_mem_alloc_aligned_or_null (sizeof (*f) + rounded_data_size,
205 CLIB_CACHE_LINE_BYTES);
209 memset (f, 0, sizeof (*f));
210 f->nitems = data_size_in_bytes;
211 f->ooos_list_head = OOO_SEGMENT_INVALID_INDEX;
217 svm_fifo_free (svm_fifo_t * f)
219 ASSERT (f->refcnt > 0);
221 if (--f->refcnt == 0)
223 pool_free (f->ooo_segments);
228 always_inline ooo_segment_t *
229 ooo_segment_new (svm_fifo_t * f, u32 start, u32 length)
233 pool_get (f->ooo_segments, s);
238 s->prev = s->next = OOO_SEGMENT_INVALID_INDEX;
244 ooo_segment_del (svm_fifo_t * f, u32 index)
246 ooo_segment_t *cur, *prev = 0, *next = 0;
247 cur = pool_elt_at_index (f->ooo_segments, index);
249 if (cur->next != OOO_SEGMENT_INVALID_INDEX)
251 next = pool_elt_at_index (f->ooo_segments, cur->next);
252 next->prev = cur->prev;
255 if (cur->prev != OOO_SEGMENT_INVALID_INDEX)
257 prev = pool_elt_at_index (f->ooo_segments, cur->prev);
258 prev->next = cur->next;
262 f->ooos_list_head = cur->next;
265 pool_put (f->ooo_segments, cur);
269 * Add segment to fifo's out-of-order segment list. Takes care of merging
270 * adjacent segments and removing overlapping ones.
273 ooo_segment_add (svm_fifo_t * f, u32 offset, u32 length)
275 ooo_segment_t *s, *new_s, *prev, *next, *it;
276 u32 new_index, s_end_pos, s_index;
277 u32 normalized_position, normalized_end_position;
279 ASSERT (offset + length <= ooo_segment_distance_from_tail (f, f->head));
280 normalized_position = (f->tail + offset) % f->nitems;
281 normalized_end_position = (f->tail + offset + length) % f->nitems;
283 f->ooos_newest = OOO_SEGMENT_INVALID_INDEX;
285 if (f->ooos_list_head == OOO_SEGMENT_INVALID_INDEX)
287 s = ooo_segment_new (f, normalized_position, length);
288 f->ooos_list_head = s - f->ooo_segments;
289 f->ooos_newest = f->ooos_list_head;
293 /* Find first segment that starts after new segment */
294 s = pool_elt_at_index (f->ooo_segments, f->ooos_list_head);
295 while (s->next != OOO_SEGMENT_INVALID_INDEX
296 && position_lt (f, s->start, normalized_position))
297 s = pool_elt_at_index (f->ooo_segments, s->next);
299 /* If we have a previous and we overlap it, use it as starting point */
300 prev = ooo_segment_get_prev (f, s);
302 && position_leq (f, normalized_position, ooo_segment_end_pos (f, prev)))
305 s_end_pos = ooo_segment_end_pos (f, s);
307 /* Since we have previous, normalized start position cannot be smaller
308 * than prev->start. Check tail */
309 ASSERT (position_lt (f, s->start, normalized_position));
313 s_index = s - f->ooo_segments;
314 s_end_pos = ooo_segment_end_pos (f, s);
316 /* No overlap, add before current segment */
317 if (position_lt (f, normalized_end_position, s->start))
319 new_s = ooo_segment_new (f, normalized_position, length);
320 new_index = new_s - f->ooo_segments;
322 /* Pool might've moved, get segment again */
323 s = pool_elt_at_index (f->ooo_segments, s_index);
324 if (s->prev != OOO_SEGMENT_INVALID_INDEX)
326 new_s->prev = s->prev;
327 prev = pool_elt_at_index (f->ooo_segments, new_s->prev);
328 prev->next = new_index;
333 f->ooos_list_head = new_index;
336 new_s->next = s_index;
338 f->ooos_newest = new_index;
341 /* No overlap, add after current segment */
342 else if (position_gt (f, normalized_position, s_end_pos))
344 new_s = ooo_segment_new (f, normalized_position, length);
345 new_index = new_s - f->ooo_segments;
347 /* Pool might've moved, get segment again */
348 s = pool_elt_at_index (f->ooo_segments, s_index);
350 /* Needs to be last */
351 ASSERT (s->next == OOO_SEGMENT_INVALID_INDEX);
353 new_s->prev = s_index;
355 f->ooos_newest = new_index;
365 if (position_lt (f, normalized_position, s->start))
367 s->start = normalized_position;
368 s->length = position_diff (f, s_end_pos, s->start);
369 f->ooos_newest = s - f->ooo_segments;
374 /* Overlapping tail */
375 if (position_gt (f, normalized_end_position, s_end_pos))
377 s->length = position_diff (f, normalized_end_position, s->start);
379 /* Remove the completely overlapped segments in the tail */
380 it = ooo_segment_next (f, s);
381 while (it && position_leq (f, ooo_segment_end_pos (f, it),
382 normalized_end_position))
384 next = ooo_segment_next (f, it);
385 ooo_segment_del (f, it - f->ooo_segments);
389 /* If partial overlap with last, merge */
390 if (it && position_leq (f, it->start, normalized_end_position))
392 s->length = position_diff (f, ooo_segment_end_pos (f, it),
394 ooo_segment_del (f, it - f->ooo_segments);
396 f->ooos_newest = s - f->ooo_segments;
401 * Removes segments that can now be enqueued because the fifo's tail has
402 * advanced. Returns the number of bytes added to tail.
405 ooo_segment_try_collect (svm_fifo_t * f, u32 n_bytes_enqueued)
408 u32 index, bytes = 0;
411 s = pool_elt_at_index (f->ooo_segments, f->ooos_list_head);
412 diff = ooo_segment_distance_to_tail (f, s->start);
414 ASSERT (diff != n_bytes_enqueued);
416 if (diff > n_bytes_enqueued)
419 /* If last tail update overlaps one/multiple ooo segments, remove them */
420 while (0 <= diff && diff < n_bytes_enqueued)
422 index = s - f->ooo_segments;
424 /* Segment end is beyond the tail. Advance tail and remove segment */
425 if (s->length > diff)
427 bytes = s->length - diff;
429 f->tail %= f->nitems;
430 ooo_segment_del (f, index);
434 /* If we have next go on */
435 if (s->next != OOO_SEGMENT_INVALID_INDEX)
437 s = pool_elt_at_index (f->ooo_segments, s->next);
438 diff = ooo_segment_distance_to_tail (f, s->start);
439 ooo_segment_del (f, index);
444 ooo_segment_del (f, index);
449 ASSERT (bytes <= f->nitems);
454 svm_fifo_enqueue_internal (svm_fifo_t * f, u32 max_bytes,
455 const u8 * copy_from_here)
457 u32 total_copy_bytes, first_copy_bytes, second_copy_bytes;
460 /* read cursize, which can only increase while we're working */
461 cursize = svm_fifo_max_dequeue (f);
462 f->ooos_newest = OOO_SEGMENT_INVALID_INDEX;
464 if (PREDICT_FALSE (cursize == f->nitems))
465 return SVM_FIFO_FULL;
469 /* Number of bytes we're going to copy */
470 total_copy_bytes = (nitems - cursize) < max_bytes ?
471 (nitems - cursize) : max_bytes;
473 if (PREDICT_TRUE (copy_from_here != 0))
475 /* Number of bytes in first copy segment */
476 first_copy_bytes = ((nitems - f->tail) < total_copy_bytes)
477 ? (nitems - f->tail) : total_copy_bytes;
479 clib_memcpy (&f->data[f->tail], copy_from_here, first_copy_bytes);
480 f->tail += first_copy_bytes;
481 f->tail = (f->tail == nitems) ? 0 : f->tail;
483 /* Number of bytes in second copy segment, if any */
484 second_copy_bytes = total_copy_bytes - first_copy_bytes;
485 if (second_copy_bytes)
487 clib_memcpy (&f->data[f->tail], copy_from_here + first_copy_bytes,
489 f->tail += second_copy_bytes;
490 f->tail = (f->tail == nitems) ? 0 : f->tail;
497 /* Account for a zero-copy enqueue done elsewhere */
498 ASSERT (max_bytes <= (nitems - cursize));
499 f->tail += max_bytes;
500 f->tail = f->tail % nitems;
501 total_copy_bytes = max_bytes;
504 svm_fifo_trace_add (f, f->head, total_copy_bytes, 2);
506 /* Any out-of-order segments to collect? */
507 if (PREDICT_FALSE (f->ooos_list_head != OOO_SEGMENT_INVALID_INDEX))
508 total_copy_bytes += ooo_segment_try_collect (f, total_copy_bytes);
510 /* Atomically increase the queue length */
511 ASSERT (cursize + total_copy_bytes <= nitems);
512 __sync_fetch_and_add (&f->cursize, total_copy_bytes);
514 return (total_copy_bytes);
517 #define SVM_ENQUEUE_CLONE_TEMPLATE(arch, fn, tgt) \
519 __attribute__ ((flatten)) \
520 __attribute__ ((target (tgt))) \
522 fn ## _ ## arch ( svm_fifo_t * f, u32 max_bytes, u8 * copy_from_here) \
523 { return fn (f, max_bytes, copy_from_here);}
526 svm_fifo_enqueue_nowait_ma (svm_fifo_t * f, u32 max_bytes,
527 const u8 * copy_from_here)
529 return svm_fifo_enqueue_internal (f, max_bytes, copy_from_here);
532 foreach_march_variant (SVM_ENQUEUE_CLONE_TEMPLATE,
533 svm_fifo_enqueue_nowait_ma);
534 CLIB_MULTIARCH_SELECT_FN (svm_fifo_enqueue_nowait_ma);
537 svm_fifo_enqueue_nowait (svm_fifo_t * f, u32 max_bytes,
538 const u8 * copy_from_here)
541 return svm_fifo_enqueue_nowait_ma (f, max_bytes, copy_from_here);
543 static int (*fp) (svm_fifo_t *, u32, const u8 *);
545 if (PREDICT_FALSE (fp == 0))
546 fp = (void *) svm_fifo_enqueue_nowait_ma_multiarch_select ();
548 return (*fp) (f, max_bytes, copy_from_here);
553 * Enqueue a future segment.
555 * Two choices: either copies the entire segment, or copies nothing
556 * Returns 0 of the entire segment was copied
557 * Returns -1 if none of the segment was copied due to lack of space
560 svm_fifo_enqueue_with_offset_internal (svm_fifo_t * f,
565 u32 total_copy_bytes, first_copy_bytes, second_copy_bytes;
566 u32 cursize, nitems, normalized_offset;
568 f->ooos_newest = OOO_SEGMENT_INVALID_INDEX;
570 /* read cursize, which can only increase while we're working */
571 cursize = svm_fifo_max_dequeue (f);
574 ASSERT (required_bytes < nitems);
576 normalized_offset = (f->tail + offset) % nitems;
578 /* Will this request fit? */
579 if ((required_bytes + offset) > (nitems - cursize))
582 svm_fifo_trace_add (f, offset, required_bytes, 1);
584 ooo_segment_add (f, offset, required_bytes);
586 /* Number of bytes we're going to copy */
587 total_copy_bytes = required_bytes;
589 /* Number of bytes in first copy segment */
590 first_copy_bytes = ((nitems - normalized_offset) < total_copy_bytes)
591 ? (nitems - normalized_offset) : total_copy_bytes;
593 clib_memcpy (&f->data[normalized_offset], copy_from_here, first_copy_bytes);
595 /* Number of bytes in second copy segment, if any */
596 second_copy_bytes = total_copy_bytes - first_copy_bytes;
597 if (second_copy_bytes)
599 normalized_offset += first_copy_bytes;
600 normalized_offset %= nitems;
602 ASSERT (normalized_offset == 0);
604 clib_memcpy (&f->data[normalized_offset],
605 copy_from_here + first_copy_bytes, second_copy_bytes);
613 svm_fifo_enqueue_with_offset (svm_fifo_t * f,
615 u32 required_bytes, u8 * copy_from_here)
617 return svm_fifo_enqueue_with_offset_internal (f, offset, required_bytes,
622 svm_fifo_overwrite_head (svm_fifo_t * f, u8 * data, u32 len)
625 ASSERT (len <= f->nitems);
626 if (len < f->nitems - f->head)
627 clib_memcpy (&f->data[f->head], data, len);
630 first_chunk = len - (f->nitems - f->head);
631 clib_memcpy (&f->data[f->head], data, first_chunk);
632 clib_memcpy (f->data, data + first_chunk, len - first_chunk);
637 svm_fifo_dequeue_internal (svm_fifo_t * f, u32 max_bytes, u8 * copy_here)
639 u32 total_copy_bytes, first_copy_bytes, second_copy_bytes;
642 /* read cursize, which can only increase while we're working */
643 cursize = svm_fifo_max_dequeue (f);
644 if (PREDICT_FALSE (cursize == 0))
645 return -2; /* nothing in the fifo */
649 /* Number of bytes we're going to copy */
650 total_copy_bytes = (cursize < max_bytes) ? cursize : max_bytes;
652 if (PREDICT_TRUE (copy_here != 0))
654 /* Number of bytes in first copy segment */
655 first_copy_bytes = ((nitems - f->head) < total_copy_bytes)
656 ? (nitems - f->head) : total_copy_bytes;
657 clib_memcpy (copy_here, &f->data[f->head], first_copy_bytes);
658 f->head += first_copy_bytes;
659 f->head = (f->head == nitems) ? 0 : f->head;
661 /* Number of bytes in second copy segment, if any */
662 second_copy_bytes = total_copy_bytes - first_copy_bytes;
663 if (second_copy_bytes)
665 clib_memcpy (copy_here + first_copy_bytes,
666 &f->data[f->head], second_copy_bytes);
667 f->head += second_copy_bytes;
668 f->head = (f->head == nitems) ? 0 : f->head;
674 /* Account for a zero-copy dequeue done elsewhere */
675 ASSERT (max_bytes <= cursize);
676 f->head += max_bytes;
677 f->head = f->head % nitems;
678 cursize -= max_bytes;
679 total_copy_bytes = max_bytes;
682 ASSERT (f->head <= nitems);
683 ASSERT (cursize >= total_copy_bytes);
684 __sync_fetch_and_sub (&f->cursize, total_copy_bytes);
686 return (total_copy_bytes);
690 svm_fifo_dequeue_nowait_ma (svm_fifo_t * f, u32 max_bytes, u8 * copy_here)
692 return svm_fifo_dequeue_internal (f, max_bytes, copy_here);
695 #define SVM_FIFO_DEQUEUE_CLONE_TEMPLATE(arch, fn, tgt) \
697 __attribute__ ((flatten)) \
698 __attribute__ ((target (tgt))) \
700 fn ## _ ## arch ( svm_fifo_t * f, u32 max_bytes, \
702 { return fn (f, max_bytes, copy_here);}
704 foreach_march_variant (SVM_FIFO_DEQUEUE_CLONE_TEMPLATE,
705 svm_fifo_dequeue_nowait_ma);
706 CLIB_MULTIARCH_SELECT_FN (svm_fifo_dequeue_nowait_ma);
709 svm_fifo_dequeue_nowait (svm_fifo_t * f, u32 max_bytes, u8 * copy_here)
712 return svm_fifo_dequeue_nowait_ma (f, max_bytes, copy_here);
714 static int (*fp) (svm_fifo_t *, u32, u8 *);
716 if (PREDICT_FALSE (fp == 0))
717 fp = (void *) svm_fifo_dequeue_nowait_ma_multiarch_select ();
719 return (*fp) (f, max_bytes, copy_here);
724 svm_fifo_peek_ma (svm_fifo_t * f, u32 relative_offset, u32 max_bytes,
727 u32 total_copy_bytes, first_copy_bytes, second_copy_bytes;
728 u32 cursize, nitems, real_head;
730 /* read cursize, which can only increase while we're working */
731 cursize = svm_fifo_max_dequeue (f);
732 if (PREDICT_FALSE (cursize < relative_offset))
733 return -2; /* nothing in the fifo */
736 real_head = f->head + relative_offset;
737 real_head = real_head >= nitems ? real_head - nitems : real_head;
739 /* Number of bytes we're going to copy */
740 total_copy_bytes = (cursize - relative_offset < max_bytes) ?
741 cursize - relative_offset : max_bytes;
743 if (PREDICT_TRUE (copy_here != 0))
745 /* Number of bytes in first copy segment */
747 ((nitems - real_head) < total_copy_bytes) ?
748 (nitems - real_head) : total_copy_bytes;
749 clib_memcpy (copy_here, &f->data[real_head], first_copy_bytes);
751 /* Number of bytes in second copy segment, if any */
752 second_copy_bytes = total_copy_bytes - first_copy_bytes;
753 if (second_copy_bytes)
755 clib_memcpy (copy_here + first_copy_bytes, &f->data[0],
759 return total_copy_bytes;
762 #define SVM_FIFO_PEEK_CLONE_TEMPLATE(arch, fn, tgt) \
764 __attribute__ ((flatten)) \
765 __attribute__ ((target (tgt))) \
767 fn ## _ ## arch ( svm_fifo_t * f, u32 relative_offset, u32 max_bytes, \
769 { return fn (f, relative_offset, max_bytes, copy_here);}
771 foreach_march_variant (SVM_FIFO_PEEK_CLONE_TEMPLATE, svm_fifo_peek_ma);
772 CLIB_MULTIARCH_SELECT_FN (svm_fifo_peek_ma);
775 svm_fifo_peek (svm_fifo_t * f, u32 relative_offset, u32 max_bytes,
779 return svm_fifo_peek_ma (f, relative_offset, max_bytes, copy_here);
781 static int (*fp) (svm_fifo_t *, u32, u32, u8 *);
783 if (PREDICT_FALSE (fp == 0))
784 fp = (void *) svm_fifo_peek_ma_multiarch_select ();
786 return (*fp) (f, relative_offset, max_bytes, copy_here);
791 svm_fifo_dequeue_drop (svm_fifo_t * f, u32 max_bytes)
793 u32 total_drop_bytes, first_drop_bytes, second_drop_bytes;
796 /* read cursize, which can only increase while we're working */
797 cursize = svm_fifo_max_dequeue (f);
798 if (PREDICT_FALSE (cursize == 0))
799 return -2; /* nothing in the fifo */
803 /* Number of bytes we're going to drop */
804 total_drop_bytes = (cursize < max_bytes) ? cursize : max_bytes;
806 svm_fifo_trace_add (f, f->tail, total_drop_bytes, 3);
808 /* Number of bytes in first copy segment */
810 ((nitems - f->head) < total_drop_bytes) ?
811 (nitems - f->head) : total_drop_bytes;
812 f->head += first_drop_bytes;
813 f->head = (f->head == nitems) ? 0 : f->head;
815 /* Number of bytes in second drop segment, if any */
816 second_drop_bytes = total_drop_bytes - first_drop_bytes;
817 if (second_drop_bytes)
819 f->head += second_drop_bytes;
820 f->head = (f->head == nitems) ? 0 : f->head;
823 ASSERT (f->head <= nitems);
824 ASSERT (cursize >= total_drop_bytes);
825 __sync_fetch_and_sub (&f->cursize, total_drop_bytes);
827 return total_drop_bytes;
831 svm_fifo_number_ooo_segments (svm_fifo_t * f)
833 return pool_elts (f->ooo_segments);
837 svm_fifo_first_ooo_segment (svm_fifo_t * f)
839 return pool_elt_at_index (f->ooo_segments, f->ooos_list_head);
843 * Set fifo pointers to requested offset
846 svm_fifo_init_pointers (svm_fifo_t * f, u32 pointer)
848 f->head = f->tail = pointer % f->nitems;
852 * fd.io coding-style-patch-verification: ON
855 * eval: (c-set-style "gnu")