1 files changed, 9 insertions, 9 deletions
diff --git a/src/nvim/mark_extended_defs.h b/src/nvim/mark_extended_defs.h
index b9475d46f5..565c599d06 100644
--- a/src/nvim/mark_extended_defs.h
+++ b/src/nvim/mark_extended_defs.h
@@ -6,21 +6,21 @@
 #include "nvim/lib/kbtree.h"
 #include "nvim/lib/kvec.h"
 
-struct ExtMarkLine;
+struct ExtmarkLine;
 
-typedef struct ExtendedMark
+typedef struct Extmark
 {
   uint64_t ns_id;
   uint64_t mark_id;
-  struct ExtMarkLine *line;
+  struct ExtmarkLine *line;
   colnr_T col;
-} ExtendedMark;
+} Extmark;
 
 
 // We only need to compare columns as rows are stored in a different tree.
 // Marks are ordered by: position, namespace, mark_id
 // This improves moving marks but slows down all other use cases (searches)
-static inline int extmark_cmp(ExtendedMark a, ExtendedMark b)
+static inline int extmark_cmp(Extmark a, Extmark b)
 {
   int cmp = kb_generic_cmp(a.col, b.col);
   if (cmp != 0) {
@@ -35,16 +35,16 @@ static inline int extmark_cmp(ExtendedMark a, ExtendedMark b)
 
 
 #define markitems_cmp(a, b) (extmark_cmp((a), (b)))
-KBTREE_INIT(markitems, ExtendedMark, markitems_cmp, 10)
+KBTREE_INIT(markitems, Extmark, markitems_cmp, 10)
 
-typedef struct ExtMarkLine
+typedef struct ExtmarkLine
 {
   linenr_T lnum;
   kbtree_t(markitems) items;
-} ExtMarkLine;
+} ExtmarkLine;
 
 #define EXTMARKLINE_CMP(a, b) (kb_generic_cmp((a)->lnum, (b)->lnum))
-KBTREE_INIT(extmarklines, ExtMarkLine *, EXTMARKLINE_CMP, 10)
+KBTREE_INIT(extmarklines, ExtmarkLine *, EXTMARKLINE_CMP, 10)
 
 
 typedef struct undo_object ExtmarkUndoObject;