vim: src/syntax.c comparison

comparison src/syntax.c @ 18814:7e7ec935e7c8 v8.1.2395

patch 8.1.2395: using old C style comments Commit: https://github.com/vim/vim/commit/0d6f5d9740dbad1b0207f3ab257de806169dd905 Author: Bram Moolenaar <Bram@vim.org> Date: Thu Dec 5 21:33:15 2019 +0100 patch 8.1.2395: using old C style comments Problem: Using old C style comments. Solution: Use // comments where appropriate.

author	Bram Moolenaar <Bram@vim.org>
date	Thu, 05 Dec 2019 21:45:04 +0100
parents	4cf69f8d1ec6
children	94eda51ba9ba

comparison

equal deleted inserted replaced

-:89d78230790e
+:7e7ec935e7c8
 #include "vim.h"
 #if defined(FEAT_SYN_HL) || defined(PROTO)
-#define SYN_NAMELEN	50		/* maximum length of a syntax name */
+#define SYN_NAMELEN	50		// maximum length of a syntax name
-/* different types of offsets that are possible */
+// different types of offsets that are possible
-#define SPO_MS_OFF	0	/* match  start offset */
+#define SPO_MS_OFF	0	// match  start offset
-#define SPO_ME_OFF	1	/* match  end	offset */
+#define SPO_ME_OFF	1	// match  end	offset
-#define SPO_HS_OFF	2	/* highl. start offset */
+#define SPO_HS_OFF	2	// highl. start offset
-#define SPO_HE_OFF	3	/* highl. end	offset */
+#define SPO_HE_OFF	3	// highl. end	offset
-#define SPO_RS_OFF	4	/* region start offset */
+#define SPO_RS_OFF	4	// region start offset
-#define SPO_RE_OFF	5	/* region end	offset */
+#define SPO_RE_OFF	5	// region end	offset
-#define SPO_LC_OFF	6	/* leading context offset */
+#define SPO_LC_OFF	6	// leading context offset
 #define SPO_COUNT	7
 static char *(spo_name_tab[SPO_COUNT]) =
 	    {"ms=", "me=", "hs=", "he=", "rs=", "re=", "lc="};
 *
 * Note that ordering of members is optimized to reduce padding.
 */
 typedef struct syn_pattern
 {
-char	 sp_type;		/* see SPTYPE_ defines below */
+char	 sp_type;		// see SPTYPE_ defines below
-char	 sp_syncing;		/* this item used for syncing */
+char	 sp_syncing;		// this item used for syncing
-short	 sp_syn_match_id;	/* highlight group ID of pattern */
+short	 sp_syn_match_id;	// highlight group ID of pattern
-short	 sp_off_flags;		/* see below */
+short	 sp_off_flags;		// see below
-int		 sp_offsets[SPO_COUNT];	/* offsets */
+int		 sp_offsets[SPO_COUNT];	// offsets
-int		 sp_flags;		/* see HL_ defines below */
+int		 sp_flags;		// see HL_ defines below
 #ifdef FEAT_CONCEAL
-int		 sp_cchar;		/* conceal substitute character */
+int		 sp_cchar;		// conceal substitute character
 #endif
-int		 sp_ic;			/* ignore-case flag for sp_prog */
+int		 sp_ic;			// ignore-case flag for sp_prog
-int		 sp_sync_idx;		/* sync item index (syncing only) */
+int		 sp_sync_idx;		// sync item index (syncing only)
-int		 sp_line_id;		/* ID of last line where tried */
+int		 sp_line_id;		// ID of last line where tried
-int		 sp_startcol;		/* next match in sp_line_id line */
+int		 sp_startcol;		// next match in sp_line_id line
-short	*sp_cont_list;		/* cont. group IDs, if non-zero */
+short	*sp_cont_list;		// cont. group IDs, if non-zero
-short	*sp_next_list;		/* next group IDs, if non-zero */
+short	*sp_next_list;		// next group IDs, if non-zero
-struct sp_syn sp_syn;		/* struct passed to in_id_list() */
+struct sp_syn sp_syn;		// struct passed to in_id_list()
-char_u	*sp_pattern;		/* regexp to match, pattern */
+char_u	*sp_pattern;		// regexp to match, pattern
-regprog_T	*sp_prog;		/* regexp to match, program */
+regprog_T	*sp_prog;		// regexp to match, program
 #ifdef FEAT_PROFILE
 syn_time_T	 sp_time;
 #endif
 } synpat_T;
-/* The sp_off_flags are computed like this:
+// The sp_off_flags are computed like this:
-* offset from the start of the matched text: (1 << SPO_XX_OFF)
+// offset from the start of the matched text: (1 << SPO_XX_OFF)
-* offset from the end	 of the matched text: (1 << (SPO_XX_OFF + SPO_COUNT))
+// offset from the end	 of the matched text: (1 << (SPO_XX_OFF + SPO_COUNT))
-* When both are present, only one is used.
+// When both are present, only one is used.
-*/
+#define SPTYPE_MATCH	1	// match keyword with this group ID
-#define SPTYPE_MATCH	1	/* match keyword with this group ID */
+#define SPTYPE_START	2	// match a regexp, start of item
-#define SPTYPE_START	2	/* match a regexp, start of item */
+#define SPTYPE_END	3	// match a regexp, end of item
-#define SPTYPE_END	3	/* match a regexp, end of item */
+#define SPTYPE_SKIP	4	// match a regexp, skip within item
-#define SPTYPE_SKIP	4	/* match a regexp, skip within item */
 #define SYN_ITEMS(buf)	((synpat_T *)((buf)->b_syn_patterns.ga_data))
-#define NONE_IDX	-2	/* value of sp_sync_idx for "NONE" */
+#define NONE_IDX	-2	// value of sp_sync_idx for "NONE"
 /*
 * Flags for b_syn_sync_flags:
 */
-#define SF_CCOMMENT	0x01	/* sync on a C-style comment */
+#define SF_CCOMMENT	0x01	// sync on a C-style comment
-#define SF_MATCH	0x02	/* sync by matching a pattern */
+#define SF_MATCH	0x02	// sync by matching a pattern
 #define SYN_STATE_P(ssp)    ((bufstate_T *)((ssp)->ga_data))
-#define MAXKEYWLEN	80	    /* maximum length of a keyword */
+#define MAXKEYWLEN	80	    // maximum length of a keyword
 /*
 * The attributes of the syntax item that has been recognized.
 */
-static int current_attr = 0;	    /* attr of current syntax word */
+static int current_attr = 0;	    // attr of current syntax word
 #ifdef FEAT_EVAL
-static int current_id = 0;	    /* ID of current char for syn_get_id() */
+static int current_id = 0;	    // ID of current char for syn_get_id()
-static int current_trans_id = 0;    /* idem, transparency removed */
+static int current_trans_id = 0;    // idem, transparency removed
 #endif
 #ifdef FEAT_CONCEAL
 static int current_flags = 0;
 static int current_seqnr = 0;
 static int current_sub_char = 0;
 #endif
 typedef struct syn_cluster_S
 {
-char_u	    *scl_name;	    /* syntax cluster name */
+char_u	    *scl_name;	    // syntax cluster name
-char_u	    *scl_name_u;    /* uppercase of scl_name */
+char_u	    *scl_name_u;    // uppercase of scl_name
-short	    *scl_list;	    /* IDs in this syntax cluster */
+short	    *scl_list;	    // IDs in this syntax cluster
 } syn_cluster_T;
 /*
 * Methods of combining two clusters
 */
-#define CLUSTER_REPLACE	    1	/* replace first list with second */
+#define CLUSTER_REPLACE	    1	// replace first list with second
-#define CLUSTER_ADD	    2	/* add second list to first */
+#define CLUSTER_ADD	    2	// add second list to first
-#define CLUSTER_SUBTRACT    3	/* subtract second list from first */
+#define CLUSTER_SUBTRACT    3	// subtract second list from first
 #define SYN_CLSTR(buf)	((syn_cluster_T *)((buf)->b_syn_clusters.ga_data))
 /*
 * Syntax group IDs have different types:
 * 20000 - 20999  ALLBUT indicator (current_syn_inc_tag added)
 * 21000 - 21999  TOP indicator (current_syn_inc_tag added)
 * 22000 - 22999  CONTAINED indicator (current_syn_inc_tag added)
 * 23000 - 32767  cluster IDs (subtract SYNID_CLUSTER for the cluster ID)
 */
-#define SYNID_ALLBUT	MAX_HL_ID   /* syntax group ID for contains=ALLBUT */
+#define SYNID_ALLBUT	MAX_HL_ID   // syntax group ID for contains=ALLBUT
-#define SYNID_TOP	21000	    /* syntax group ID for contains=TOP */
+#define SYNID_TOP	21000	    // syntax group ID for contains=TOP
-#define SYNID_CONTAINED	22000	    /* syntax group ID for contains=CONTAINED */
+#define SYNID_CONTAINED	22000	    // syntax group ID for contains=CONTAINED
-#define SYNID_CLUSTER	23000	    /* first syntax group ID for clusters */
+#define SYNID_CLUSTER	23000	    // first syntax group ID for clusters
-#define MAX_SYN_INC_TAG	999	    /* maximum before the above overflow */
+#define MAX_SYN_INC_TAG	999	    // maximum before the above overflow
 #define MAX_CLUSTER_ID  (32767 - SYNID_CLUSTER)
 /*
 * Annoying Hack(TM):  ":syn include" needs this pointer to pass to
 * expand_filename().  Most of the other syntax commands don't need it, so
 * When si_m_endpos.lnum is 0, the items other than si_idx are unknown.
 * (The end positions have the column number of the next char)
 */
 typedef struct state_item
 {
-int		si_idx;			/* index of syntax pattern or
+int		si_idx;			// index of syntax pattern or
-					   KEYWORD_IDX */
+					// KEYWORD_IDX
-int		si_id;			/* highlight group ID for keywords */
+int		si_id;			// highlight group ID for keywords
-int		si_trans_id;		/* idem, transparency removed */
+int		si_trans_id;		// idem, transparency removed
-int		si_m_lnum;		/* lnum of the match */
+int		si_m_lnum;		// lnum of the match
-int		si_m_startcol;		/* starting column of the match */
+int		si_m_startcol;		// starting column of the match
-lpos_T	si_m_endpos;		/* just after end posn of the match */
+lpos_T	si_m_endpos;		// just after end posn of the match
-lpos_T	si_h_startpos;		/* start position of the highlighting */
+lpos_T	si_h_startpos;		// start position of the highlighting
-lpos_T	si_h_endpos;		/* end position of the highlighting */
+lpos_T	si_h_endpos;		// end position of the highlighting
-lpos_T	si_eoe_pos;		/* end position of end pattern */
+lpos_T	si_eoe_pos;		// end position of end pattern
-int		si_end_idx;		/* group ID for end pattern or zero */
+int		si_end_idx;		// group ID for end pattern or zero
-int		si_ends;		/* if match ends before si_m_endpos */
+int		si_ends;		// if match ends before si_m_endpos
-int		si_attr;		/* attributes in this state */
+int		si_attr;		// attributes in this state
-long	si_flags;		/* HL_HAS_EOL flag in this state, and
+long	si_flags;		// HL_HAS_EOL flag in this state, and
-					 * HL_SKIP* for si_next_list */
+					// HL_SKIP* for si_next_list
 #ifdef FEAT_CONCEAL
-int		si_seqnr;		/* sequence number */
+int		si_seqnr;		// sequence number
-int		si_cchar;		/* substitution character for conceal */
+int		si_cchar;		// substitution character for conceal
 #endif
-short	*si_cont_list;		/* list of contained groups */
+short	*si_cont_list;		// list of contained groups
-short	*si_next_list;		/* nextgroup IDs after this item ends */
+short	*si_next_list;		// nextgroup IDs after this item ends
-reg_extmatch_T *si_extmatch;	/* \z(...\) matches from start
+reg_extmatch_T *si_extmatch;	// \z(...\) matches from start
-					 * pattern */
+					// pattern
 } stateitem_T;
-#define KEYWORD_IDX	-1	    /* value of si_idx for keywords */
+#define KEYWORD_IDX	-1	    // value of si_idx for keywords
-#define ID_LIST_ALL	(short *)-1 /* valid of si_cont_list for containing all
+#define ID_LIST_ALL	(short *)-1 // valid of si_cont_list for containing all
-				       but contained groups */
+				    // but contained groups
 #ifdef FEAT_CONCEAL
-static int next_seqnr = 1;		/* value to use for si_seqnr */
+static int next_seqnr = 1;		// value to use for si_seqnr
 #endif
 /*
 * Struct to reduce the number of arguments to get_syn_options(), it's used
 * very often.
 */
 typedef struct
 {
-int		flags;		/* flags for contained and transparent */
+int		flags;		// flags for contained and transparent
-int		keyword;	/* TRUE for ":syn keyword" */
+int		keyword;	// TRUE for ":syn keyword"
-int		*sync_idx;	/* syntax item for "grouphere" argument, NULL
+int		*sync_idx;	// syntax item for "grouphere" argument, NULL
-				   if not allowed */
+				// if not allowed
-char	has_cont_list;	/* TRUE if "cont_list" can be used */
+char	has_cont_list;	// TRUE if "cont_list" can be used
-short	*cont_list;	/* group IDs for "contains" argument */
+short	*cont_list;	// group IDs for "contains" argument
-short	*cont_in_list;	/* group IDs for "containedin" argument */
+short	*cont_in_list;	// group IDs for "containedin" argument
-short	*next_list;	/* group IDs for "nextgroup" argument */
+short	*next_list;	// group IDs for "nextgroup" argument
 } syn_opt_arg_T;
 /*
 * The next possible match in the current line for any pattern is remembered,
 * to avoid having to try for a match in each column.
 * If next_match_idx == -1, not tried (in this line) yet.
 * If next_match_col == MAXCOL, no match found in this line.
 * (All end positions have the column of the char after the end)
 */
-static int next_match_col;		/* column for start of next match */
+static int next_match_col;		// column for start of next match
-static lpos_T next_match_m_endpos;	/* position for end of next match */
+static lpos_T next_match_m_endpos;	// position for end of next match
-static lpos_T next_match_h_startpos;  /* pos. for highl. start of next match */
+static lpos_T next_match_h_startpos;	// pos. for highl. start of next match
-static lpos_T next_match_h_endpos;	/* pos. for highl. end of next match */
+static lpos_T next_match_h_endpos;	// pos. for highl. end of next match
-static int next_match_idx;		/* index of matched item */
+static int next_match_idx;		// index of matched item
-static long next_match_flags;		/* flags for next match */
+static long next_match_flags;		// flags for next match
-static lpos_T next_match_eos_pos;	/* end of start pattn (start region) */
+static lpos_T next_match_eos_pos;	// end of start pattn (start region)
-static lpos_T next_match_eoe_pos;	/* pos. for end of end pattern */
+static lpos_T next_match_eoe_pos;	// pos. for end of end pattern
-static int next_match_end_idx;		/* ID of group for end pattn or zero */
+static int next_match_end_idx;		// ID of group for end pattn or zero
 static reg_extmatch_T *next_match_extmatch = NULL;
 /*
 * A state stack is an array of integers or stateitem_T, stored in a
 * garray_T.  A state stack is invalid if its itemsize entry is zero.
 /*
 * The current state (within the line) of the recognition engine.
 * When current_state.ga_itemsize is 0 the current state is invalid.
 */
-static win_T	*syn_win;		/* current window for highlighting */
+static win_T	*syn_win;		// current window for highlighting
-static buf_T	*syn_buf;		/* current buffer for highlighting */
+static buf_T	*syn_buf;		// current buffer for highlighting
-static synblock_T *syn_block;		/* current buffer for highlighting */
+static synblock_T *syn_block;		// current buffer for highlighting
 #ifdef FEAT_RELTIME
-static proftime_T *syn_tm;		/* timeout limit */
+static proftime_T *syn_tm;		// timeout limit
 #endif
-static linenr_T current_lnum = 0;	/* lnum of current state */
+static linenr_T current_lnum = 0;	// lnum of current state
-static colnr_T	current_col = 0;	/* column of current state */
+static colnr_T	current_col = 0;	// column of current state
-static int	current_state_stored = 0; /* TRUE if stored current state
+static int	current_state_stored = 0; // TRUE if stored current state
-					   * after setting current_finished */
+					  // after setting current_finished
-static int	current_finished = 0;	/* current line has been finished */
+static int	current_finished = 0;	// current line has been finished
-static garray_T current_state		/* current stack of state_items */
+static garray_T current_state		// current stack of state_items
 		= {0, 0, 0, 0, NULL};
-static short	*current_next_list = NULL; /* when non-zero, nextgroup list */
+static short	*current_next_list = NULL; // when non-zero, nextgroup list
-static int	current_next_flags = 0; /* flags for current_next_list */
+static int	current_next_flags = 0; // flags for current_next_list
-static int	current_line_id = 0;	/* unique number for current line */
+static int	current_line_id = 0;	// unique number for current line
 #define CUR_STATE(idx)	((stateitem_T *)(current_state.ga_data))[idx]
 static void syn_sync(win_T *wp, linenr_T lnum, synstate_T *last_valid);
 static int syn_match_linecont(linenr_T lnum);
 synstate_T	*last_min_valid = NULL;
 synstate_T	*sp, *prev = NULL;
 linenr_T	parsed_lnum;
 linenr_T	first_stored;
 int		dist;
-static varnumber_T changedtick = 0;	/* remember the last change ID */
+static varnumber_T changedtick = 0;	// remember the last change ID
 #ifdef FEAT_CONCEAL
 current_sub_char = NUL;
 #endif
 /*
 * Allocate syntax stack when needed.
 */
 syn_stack_alloc();
 if (syn_block->b_sst_array == NULL)
-	return;		/* out of memory */
+	return;		// out of memory
 syn_block->b_sst_lasttick = display_tick;
 /*
 * If the state of the end of the previous line is useful, store it.
 */
 * Try to synchronize from a saved state in b_sst_array[].
 * Only do this if lnum is not before and not to far beyond a saved state.
 */
 if (INVALID_STATE(&current_state) && syn_block->b_sst_array != NULL)
 {
-	/* Find last valid saved state before start_lnum. */
+	// Find last valid saved state before start_lnum.
 	for (p = syn_block->b_sst_first; p != NULL; p = p->sst_next)
 	{
 	    if (p->sst_lnum > lnum)
 		break;
 	    if (p->sst_lnum <= lnum && p->sst_change_lnum == 0)
 */
 if (INVALID_STATE(&current_state))
 {
 	syn_sync(wp, lnum, last_valid);
 	if (current_lnum == 1)
-	    /* First line is always valid, no matter "minlines". */
+	    // First line is always valid, no matter "minlines".
 	    first_stored = 1;
 	else
-	    /* Need to parse "minlines" lines before state can be considered
+	    // Need to parse "minlines" lines before state can be considered
-	     * valid to store. */
+	    // valid to store.
 	    first_stored = current_lnum + syn_block->b_syn_sync_minlines;
 }
 else
 	first_stored = current_lnum;
 {
 	syn_start_line();
 	(void)syn_finish_line(FALSE);
 	++current_lnum;
-	/* If we parsed at least "minlines" lines or started at a valid
+	// If we parsed at least "minlines" lines or started at a valid
-	 * state, the current state is considered valid. */
+	// state, the current state is considered valid.
 	if (current_lnum >= first_stored)
 	{
-	    /* Check if the saved state entry is for the current line and is
+	    // Check if the saved state entry is for the current line and is
-	     * equal to the current state.  If so, then validate all saved
+	    // equal to the current state.  If so, then validate all saved
-	     * states that depended on a change before the parsed line. */
+	    // states that depended on a change before the parsed line.
 	    if (prev == NULL)
 		prev = syn_stack_find_entry(current_lnum - 1);
 	    if (prev == NULL)
 		sp = syn_block->b_sst_first;
 	    else
 		parsed_lnum = current_lnum;
 		prev = sp;
 		while (sp != NULL && sp->sst_change_lnum <= parsed_lnum)
 		{
 		    if (sp->sst_lnum <= lnum)
-			/* valid state before desired line, use this one */
+			// valid state before desired line, use this one
 			prev = sp;
 		    else if (sp->sst_change_lnum == 0)
-			/* past saved states depending on change, break here. */
+			// past saved states depending on change, break here.
 			break;
 		    sp->sst_change_lnum = 0;
 		    sp = sp->sst_next;
 		}
 		load_current_state(prev);
 	    }
-	    /* Store the state at this line when it's the first one, the line
+	    // Store the state at this line when it's the first one, the line
-	     * where we start parsing, or some distance from the previously
+	    // where we start parsing, or some distance from the previously
-	     * saved state.  But only when parsed at least 'minlines'. */
+	    // saved state.  But only when parsed at least 'minlines'.
 	    else if (prev == NULL
 			|| current_lnum == lnum
 			|| current_lnum >= prev->sst_lnum + dist)
 		prev = store_current_state();
 	}
-	/* This can take a long time: break when CTRL-C pressed.  The current
+	// This can take a long time: break when CTRL-C pressed.  The current
-	 * state will be wrong then. */
+	// state will be wrong then.
 	line_breakcheck();
 	if (got_int)
 	{
 	    current_lnum = lnum;
 	    break;
 /*
 * 1. Search backwards for the end of a C-style comment.
 */
 if (syn_block->b_syn_sync_flags & SF_CCOMMENT)
 {
-	/* Need to make syn_buf the current buffer for a moment, to be able to
+	// Need to make syn_buf the current buffer for a moment, to be able to
-	 * use find_start_comment(). */
+	// use find_start_comment().
 	curwin_save = curwin;
 	curwin = wp;
 	curbuf_save = curbuf;
 	curbuf = syn_buf;
 	    if (*line == NUL || *(line + STRLEN(line) - 1) != '\\')
 		break;
 	}
 	current_lnum = start_lnum;
-	/* set cursor to start of search */
+	// set cursor to start of search
 	cursor_save = wp->w_cursor;
 	wp->w_cursor.lnum = start_lnum;
 	wp->w_cursor.col = 0;
 	/*
 			update_si_attr(current_state.ga_len - 1);
 		    break;
 		}
 	}
-	/* restore cursor and buffer */
+	// restore cursor and buffer
 	wp->w_cursor = cursor_save;
 	curwin = curwin_save;
 	curbuf = curbuf_save;
 }
 	found_m_endpos.col = 0;
 	end_lnum = start_lnum;
 	lnum = start_lnum;
 	while (--lnum > break_lnum)
 	{
-	    /* This can take a long time: break when CTRL-C pressed. */
+	    // This can take a long time: break when CTRL-C pressed.
 	    line_breakcheck();
 	    if (got_int)
 	    {
 		invalidate_current_state();
 		current_lnum = start_lnum;
 		break;
 	    }
-	    /* Check if we have run into a valid saved state stack now. */
+	    // Check if we have run into a valid saved state stack now.
 	    if (last_valid != NULL && lnum == last_valid->sst_lnum)
 	    {
 		load_current_state(last_valid);
 		break;
 	    }
 		    if (had_sync_point && current_state.ga_len)
 		    {
 			cur_si = &CUR_STATE(current_state.ga_len - 1);
 			if (cur_si->si_m_endpos.lnum > start_lnum)
 			{
-			    /* ignore match that goes to after where started */
+			    // ignore match that goes to after where started
 			    current_lnum = end_lnum;
 			    break;
 			}
 			if (cur_si->si_idx < 0)
 			{
-			    /* Cannot happen? */
+			    // Cannot happen?
 			    found_flags = 0;
 			    found_match_idx = KEYWORD_IDX;
 			}
 			else
 			{
 			else if (found_m_endpos.col > current_col)
 			    current_col = found_m_endpos.col;
 			else
 			    ++current_col;
-			/* syn_current_attr() will have skipped the check for
+			// syn_current_attr() will have skipped the check for
-			 * an item that ends here, need to do that now.  Be
+			// an item that ends here, need to do that now.  Be
-			 * careful not to go past the NUL. */
+			// careful not to go past the NUL.
 			prev_current_col = current_col;
 			if (syn_getcurline()[current_col] != NUL)
 			    ++current_col;
 			check_state_ends();
 			current_col = prev_current_col;
 	    end_lnum = lnum;
 	    invalidate_current_state();
 	}
-	/* Ran into start of the file or exceeded maximum number of lines */
+	// Ran into start of the file or exceeded maximum number of lines
 	if (lnum <= break_lnum)
 	{
 	    invalidate_current_state();
 	    current_lnum = break_lnum + 1;
 	}
 static int
 syn_match_linecont(linenr_T lnum)
 {
 regmmatch_T regmatch;
 int r;
-char_u	buf_chartab[32];  /* chartab array for syn iskyeyword */
+char_u	buf_chartab[32];  // chartab array for syn iskyeyword
 if (syn_block->b_syn_linecont_prog != NULL)
 {
-	/* use syntax iskeyword option */
+	// use syntax iskeyword option
 	save_chartab(buf_chartab);
 	regmatch.rmm_ic = syn_block->b_syn_linecont_ic;
 	regmatch.regprog = syn_block->b_syn_linecont_prog;
 	r = syn_regexec(&regmatch, lnum, (colnr_T)0,
 				IF_SYN_TIME(&syn_block->b_syn_linecont_time));
 int		i;
 int		seen_keepend;
 if (startofline)
 {
-	/* Check for a match carried over from a previous line with a
+	// Check for a match carried over from a previous line with a
-	 * contained region.  The match ends as soon as the region ends. */
+	// contained region.  The match ends as soon as the region ends.
 	for (i = 0; i < current_state.ga_len; ++i)
 	{
 	    cur_si = &CUR_STATE(i);
 	    if (cur_si->si_idx >= 0
 		    && (SYN_ITEMS(syn_block)[cur_si->si_idx]).sp_type
 	cur_si = &CUR_STATE(i);
 	if ((cur_si->si_flags & HL_KEEPEND)
 			    || (seen_keepend && !startofline)
 			    || (i == current_state.ga_len - 1 && startofline))
 	{
-	    cur_si->si_h_startpos.col = 0;	/* start highl. in col 0 */
+	    cur_si->si_h_startpos.col = 0;	// start highl. in col 0
 	    cur_si->si_h_startpos.lnum = current_lnum;
 	    if (!(cur_si->si_flags & HL_MATCHCONT))
 		update_si_end(cur_si, (int)current_col, !startofline);
 	}
 }
 check_keepend();
 }
-/****************************************
+/////////////////////////////////////////
-* Handling of the state stack cache.
+// Handling of the state stack cache.
-*/
 /*
 * EXPLANATION OF THE SYNTAX STATE STACK CACHE
 *
 * To speed up syntax highlighting, the state stack for the start of some
 #endif
 syn_stack_free_block(block);
 #ifdef FEAT_FOLDING
-/* When using "syntax" fold method, must update all folds. */
+// When using "syntax" fold method, must update all folds.
 FOR_ALL_WINDOWS(wp)
 {
 	if (wp->w_s == block && foldmethodIsSyntax(wp))
 	    foldUpdateAll(wp);
 }
 	len = SST_MIN_ENTRIES;
 else if (len > SST_MAX_ENTRIES)
 	len = SST_MAX_ENTRIES;
 if (syn_block->b_sst_len > len * 2 || syn_block->b_sst_len < len)
 {
-	/* Allocate 50% too much, to avoid reallocating too often. */
+	// Allocate 50% too much, to avoid reallocating too often.
 	len = syn_buf->b_ml.ml_line_count;
 	len = (len + len / 2) / SST_DIST + Rows * 2;
 	if (len < SST_MIN_ENTRIES)
 	    len = SST_MIN_ENTRIES;
 	else if (len > SST_MAX_ENTRIES)
 	    len = SST_MAX_ENTRIES;
 	if (syn_block->b_sst_array != NULL)
 	{
-	    /* When shrinking the array, cleanup the existing stack.
+	    // When shrinking the array, cleanup the existing stack.
-	     * Make sure that all valid entries fit in the new array. */
+	    // Make sure that all valid entries fit in the new array.
 	    while (syn_block->b_sst_len - syn_block->b_sst_freecount + 2 > len
 		    && syn_stack_cleanup())
 		;
 	    if (len < syn_block->b_sst_len - syn_block->b_sst_freecount + 2)
 		len = syn_block->b_sst_len - syn_block->b_sst_freecount + 2;
 	}
 	sstp = ALLOC_CLEAR_MULT(synstate_T, len);
-	if (sstp == NULL)	/* out of memory! */
+	if (sstp == NULL)	// out of memory!
 	    return;
 	to = sstp - 1;
 	if (syn_block->b_sst_array != NULL)
 	{
-	    /* Move the states from the old array to the new one. */
+	    // Move the states from the old array to the new one.
 	    for (from = syn_block->b_sst_first; from != NULL;
 							from = from->sst_next)
 	    {
 		++to;
 		*to = *from;
 	{
 	    syn_block->b_sst_first = NULL;
 	    syn_block->b_sst_freecount = len;
 	}
-	/* Create the list of free entries. */
+	// Create the list of free entries.
 	syn_block->b_sst_firstfree = to + 1;
 	while (++to < sstp + len)
 	    to->sst_next = to + 1;
 	(sstp + len - 1)->sst_next = NULL;
 	if (p->sst_lnum + block->b_syn_sync_linebreaks > buf->b_mod_top)
 	{
 	    n = p->sst_lnum + buf->b_mod_xlines;
 	    if (n <= buf->b_mod_bot)
 	    {
-		/* this state is inside the changed area, remove it */
+		// this state is inside the changed area, remove it
 		np = p->sst_next;
 		if (prev == NULL)
 		    block->b_sst_first = np;
 		else
 		    prev->sst_next = np;
 		syn_stack_free_entry(block, p);
 		p = np;
 		continue;
 	    }
-	    /* This state is below the changed area.  Remember the line
+	    // This state is below the changed area.  Remember the line
-	     * that needs to be parsed before this entry can be made valid
+	    // that needs to be parsed before this entry can be made valid
-	     * again. */
+	    // again.
 	    if (p->sst_change_lnum != 0 && p->sst_change_lnum > buf->b_mod_top)
 	    {
 		if (p->sst_change_lnum + buf->b_mod_xlines > buf->b_mod_top)
 		    p->sst_change_lnum += buf->b_mod_xlines;
 		else
 int		retval = FALSE;
 if (syn_block->b_sst_first == NULL)
 	return retval;
-/* Compute normal distance between non-displayed entries. */
+// Compute normal distance between non-displayed entries.
 if (syn_block->b_sst_len <= Rows)
 	dist = 999999;
 else
 	dist = syn_buf->b_ml.ml_line_count / (syn_block->b_sst_len - Rows) + 1;
 prev = syn_block->b_sst_first;
 for (p = prev->sst_next; p != NULL; prev = p, p = p->sst_next)
 {
 	if (p->sst_tick == tick && prev->sst_lnum + dist > p->sst_lnum)
 	{
-	    /* Move this entry from used list to free list */
+	    // Move this entry from used list to free list
 	    prev->sst_next = p->sst_next;
 	    syn_stack_free_entry(syn_block, p);
 	    p = prev;
 	    retval = TRUE;
 	}
 }
 if (i >= 0)
 {
 	if (sp != NULL)
 	{
-	    /* find "sp" in the list and remove it */
+	    // find "sp" in the list and remove it
 	    if (syn_block->b_sst_first == sp)
-		/* it's the first entry */
+		// it's the first entry
 		syn_block->b_sst_first = sp->sst_next;
 	    else
 	    {
-		/* find the entry just before this one to adjust sst_next */
+		// find the entry just before this one to adjust sst_next
 		for (p = syn_block->b_sst_first; p != NULL; p = p->sst_next)
 		    if (p->sst_next == sp)
 			break;
-		if (p != NULL)	/* just in case */
+		if (p != NULL)	// just in case
 		    p->sst_next = sp->sst_next;
 	    }
 	    syn_stack_free_entry(syn_block, sp);
 	    sp = NULL;
 	}
 else if (sp == NULL || sp->sst_lnum != current_lnum)
 {
 	/*
 	 * Add a new entry
 	 */
-	/* If no free items, cleanup the array first. */
+	// If no free items, cleanup the array first.
 	if (syn_block->b_sst_freecount == 0)
 	{
 	    (void)syn_stack_cleanup();
-	    /* "sp" may have been moved to the freelist now */
+	    // "sp" may have been moved to the freelist now
 	    sp = syn_stack_find_entry(current_lnum);
 	}
-	/* Still no free items?  Must be a strange problem... */
+	// Still no free items?  Must be a strange problem...
 	if (syn_block->b_sst_freecount == 0)
 	    sp = NULL;
 	else
 	{
-	    /* Take the first item from the free list and put it in the used
+	    // Take the first item from the free list and put it in the used
-	     * list, after *sp */
+	    // list, after *sp
 	    p = syn_block->b_sst_firstfree;
 	    syn_block->b_sst_firstfree = p->sst_next;
 	    --syn_block->b_sst_freecount;
 	    if (sp == NULL)
 	    {
-		/* Insert in front of the list */
+		// Insert in front of the list
 		p->sst_next = syn_block->b_sst_first;
 		syn_block->b_sst_first = p;
 	    }
 	    else
 	    {
-		/* insert in list after *sp */
+		// insert in list after *sp
 		p->sst_next = sp->sst_next;
 		sp->sst_next = p;
 	    }
 	    sp = p;
 	    sp->sst_stacksize = 0;
 	    sp->sst_lnum = current_lnum;
 	}
 }
 if (sp != NULL)
 {
-	/* When overwriting an existing state stack, clear it first */
+	// When overwriting an existing state stack, clear it first
 	clear_syn_state(sp);
 	sp->sst_stacksize = current_state.ga_len;
 	if (current_state.ga_len > SST_FIX_STATES)
 	{
-	    /* Need to clear it, might be something remaining from when the
+	    // Need to clear it, might be something remaining from when the
-	     * length was less than SST_FIX_STATES. */
+	    // length was less than SST_FIX_STATES.
 	    ga_init2(&sp->sst_union.sst_ga, (int)sizeof(bufstate_T), 1);
 	    if (ga_grow(&sp->sst_union.sst_ga, current_state.ga_len) == FAIL)
 		sp->sst_stacksize = 0;
 	    else
 		sp->sst_union.sst_ga.ga_len = current_state.ga_len;
 {
 int		i, j;
 bufstate_T	*bp;
 reg_extmatch_T	*six, *bsx;
-/* First a quick check if the stacks have the same size end nextlist. */
+// First a quick check if the stacks have the same size end nextlist.
 if (sp->sst_stacksize == current_state.ga_len
 	    && sp->sst_next_list == current_next_list)
 {
-	/* Need to compare all states on both stacks. */
+	// Need to compare all states on both stacks.
 	if (sp->sst_stacksize > SST_FIX_STATES)
 	    bp = SYN_STATE_P(&(sp->sst_union.sst_ga));
 	else
 	    bp = sp->sst_union.sst_stack;
 	for (i = current_state.ga_len; --i >= 0; )
 	{
-	    /* If the item has another index the state is different. */
+	    // If the item has another index the state is different.
 	    if (bp[i].bs_idx != CUR_STATE(i).si_idx)
 		break;
 	    if (bp[i].bs_extmatch != CUR_STATE(i).si_extmatch)
 	    {
-		/* When the extmatch pointers are different, the strings in
+		// When the extmatch pointers are different, the strings in
-		 * them can still be the same.  Check if the extmatch
+		// them can still be the same.  Check if the extmatch
-		 * references are equal. */
+		// references are equal.
 		bsx = bp[i].bs_extmatch;
 		six = CUR_STATE(i).si_extmatch;
-		/* If one of the extmatch pointers is NULL the states are
+		// If one of the extmatch pointers is NULL the states are
-		 * different. */
+		// different.
 		if (bsx == NULL || six == NULL)
 		    break;
 		for (j = 0; j < NSUBEXP; ++j)
 		{
-		    /* Check each referenced match string. They must all be
+		    // Check each referenced match string. They must all be
-		     * equal. */
+		    // equal.
 		    if (bsx->matches[j] != six->matches[j])
 		    {
-			/* If the pointer is different it can still be the
+			// If the pointer is different it can still be the
-			 * same text.  Compare the strings, ignore case when
+			// same text.  Compare the strings, ignore case when
-			 * the start item has the sp_ic flag set. */
+			// the start item has the sp_ic flag set.
 			if (bsx->matches[j] == NULL
 				|| six->matches[j] == NULL)
 			    break;
 			if ((SYN_ITEMS(syn_block)[CUR_STATE(i).si_idx]).sp_ic
 				? MB_STRICMP(bsx->matches[j],
 static void
 invalidate_current_state(void)
 {
 clear_current_state();
-current_state.ga_itemsize = 0;	/* mark current_state invalid */
+current_state.ga_itemsize = 0;	// mark current_state invalid
 current_next_list = NULL;
 keepend_level = -1;
 }
 static void
 * the line.  It can start anywhere in the line, as long as the current state
 * is valid.
 */
 static int
 syn_finish_line(
-int	    syncing)		/* called for syncing */
+int	    syncing)		// called for syncing
 {
 stateitem_T	*cur_si;
 colnr_T	prev_current_col;
 while (!current_finished)
 	    if (cur_si->si_idx >= 0
 		    && (SYN_ITEMS(syn_block)[cur_si->si_idx].sp_flags
 					  & (HL_SYNC_HERE|HL_SYNC_THERE)))
 		return TRUE;
-	    /* syn_current_attr() will have skipped the check for an item
+	    // syn_current_attr() will have skipped the check for an item
-	     * that ends here, need to do that now.  Be careful not to go
+	    // that ends here, need to do that now.  Be careful not to go
-	     * past the NUL. */
+	    // past the NUL.
 	    prev_current_col = current_col;
 	    if (syn_getcurline()[current_col] != NUL)
 		++current_col;
 	    check_state_ends();
 	    current_col = prev_current_col;
 */
 int
 get_syntax_attr(
 colnr_T	col,
 int		*can_spell,
-int		keep_state)	/* keep state of char at "col" */
+int		keep_state)	// keep state of char at "col"
 {
 int	    attr = 0;
 if (can_spell != NULL)
-	/* Default: Only do spelling when there is no @Spell cluster or when
+	// Default: Only do spelling when there is no @Spell cluster or when
-	 * ":syn spell toplevel" was used. */
+	// ":syn spell toplevel" was used.
 	*can_spell = syn_block->b_syn_spell == SYNSPL_DEFAULT
 		    ? (syn_block->b_spell_cluster_id == 0)
 		    : (syn_block->b_syn_spell == SYNSPL_TOP);
-/* check for out of memory situation */
+// check for out of memory situation
 if (syn_block->b_sst_array == NULL)
 	return 0;
-/* After 'synmaxcol' the attribute is always zero. */
+// After 'synmaxcol' the attribute is always zero.
 if (syn_buf->b_p_smc > 0 && col >= (colnr_T)syn_buf->b_p_smc)
 {
 	clear_current_state();
 #ifdef FEAT_EVAL
 	current_id = 0;
 	current_seqnr = 0;
 #endif
 	return 0;
 }
-/* Make sure current_state is valid */
+// Make sure current_state is valid
 if (INVALID_STATE(&current_state))
 	validate_current_state();
 /*
 * Skip from the current column to "col", get the attributes for "col".
 /*
 * Get syntax attributes for current_lnum, current_col.
 */
 static int
 syn_current_attr(
-int		syncing,		/* When 1: called for syncing */
+int		syncing,		// When 1: called for syncing
-int		displaying,		/* result will be displayed */
+int		displaying,		// result will be displayed
-int		*can_spell,		/* return: do spell checking */
+int		*can_spell,		// return: do spell checking
-int		keep_state)		/* keep syntax stack afterwards */
+int		keep_state)		// keep syntax stack afterwards
 {
 int		syn_id;
-lpos_T	endpos;		/* was: char_u *endp; */
+lpos_T	endpos;		// was: char_u *endp;
-lpos_T	hl_startpos;	/* was: int hl_startcol; */
+lpos_T	hl_startpos;	// was: int hl_startcol;
 lpos_T	hl_endpos;
-lpos_T	eos_pos;	/* end-of-start match (start region) */
+lpos_T	eos_pos;	// end-of-start match (start region)
-lpos_T	eoe_pos;	/* end-of-end pattern */
+lpos_T	eoe_pos;	// end-of-end pattern
-int		end_idx;	/* group ID for end pattern */
+int		end_idx;	// group ID for end pattern
 int		idx;
 synpat_T	*spp;
 stateitem_T	*cur_si, *sip = NULL;
 int		startcol;
 int		endcol;
 long	flags;
 int		cchar;
 short	*next_list;
-int		found_match;		    /* found usable match */
+int		found_match;		    // found usable match
-static int	try_next_column = FALSE;    /* must try in next col */
+static int	try_next_column = FALSE;    // must try in next col
 int		do_keywords;
 regmmatch_T	regmatch;
 lpos_T	pos;
 int		lc_col;
 reg_extmatch_T *cur_extmatch = NULL;
-char_u	buf_chartab[32];  /* chartab array for syn iskyeyword */
+char_u	buf_chartab[32];  // chartab array for syn iskyeyword
-char_u	*line;		/* current line.  NOTE: becomes invalid after
+char_u	*line;		// current line.  NOTE: becomes invalid after
-				   looking for a pattern match! */
+				// looking for a pattern match!
-/* variables for zero-width matches that have a "nextgroup" argument */
+// variables for zero-width matches that have a "nextgroup" argument
 int		keep_next_list;
 int		zero_width_next_list = FALSE;
 garray_T	zero_width_next_ga;
 /*
 	current_finished = TRUE;
 	current_state_stored = FALSE;
 	return 0;
 }
-/* if the current or next character is NUL, we will finish the line now */
+// if the current or next character is NUL, we will finish the line now
 if (line[current_col] == NUL || line[current_col + 1] == NUL)
 {
 	current_finished = TRUE;
 	current_state_stored = FALSE;
 }
 {
 	next_match_idx = -1;
 	try_next_column = FALSE;
 }
-/* Only check for keywords when not syncing and there are some. */
+// Only check for keywords when not syncing and there are some.
 do_keywords = !syncing
 		    && (syn_block->b_keywtab.ht_used > 0
 			    || syn_block->b_keywtab_ic.ht_used > 0);
-/* Init the list of zero-width matches with a nextlist.  This is used to
+// Init the list of zero-width matches with a nextlist.  This is used to
-* avoid matching the same item in the same position twice. */
+// avoid matching the same item in the same position twice.
 ga_init2(&zero_width_next_ga, (int)sizeof(int), 10);
-/* use syntax iskeyword option */
+// use syntax iskeyword option
 save_chartab(buf_chartab);
 /*
 * Repeat matching keywords and patterns, to find contained items at the
 * same column.  This stops when there are no extra matches at the current
 		    if (push_current_state(KEYWORD_IDX) == OK)
 		    {
 			cur_si = &CUR_STATE(current_state.ga_len - 1);
 			cur_si->si_m_startcol = current_col;
 			cur_si->si_h_startpos.lnum = current_lnum;
-			cur_si->si_h_startpos.col = 0;	/* starts right away */
+			cur_si->si_h_startpos.col = 0;	// starts right away
 			cur_si->si_m_endpos.lnum = current_lnum;
 			cur_si->si_m_endpos.col = endcol;
 			cur_si->si_h_endpos.lnum = current_lnum;
 			cur_si->si_h_endpos.col = endcol;
 			cur_si->si_ends = TRUE;
 		     * Check all relevant patterns for a match at this
 		     * position.  This is complicated, because matching with a
 		     * pattern takes quite a bit of time, thus we want to
 		     * avoid doing it when it's not needed.
 		     */
-		    next_match_idx = 0;		/* no match in this line yet */
+		    next_match_idx = 0;		// no match in this line yet
 		    next_match_col = MAXCOL;
 		    for (idx = syn_block->b_syn_patterns.ga_len; --idx >= 0; )
 		    {
 			spp = &(SYN_ITEMS(syn_block)[idx]);
 			if (	   spp->sp_syncing == syncing
 					    cur_si->si_cont_list, &spp->sp_syn,
 					    spp->sp_flags & HL_CONTAINED))))
 			{
 			    int r;
-			    /* If we already tried matching in this line, and
+			    // If we already tried matching in this line, and
-			     * there isn't a match before next_match_col, skip
+			    // there isn't a match before next_match_col, skip
-			     * this item. */
+			    // this item.
 			    if (spp->sp_line_id == current_line_id
 				    && spp->sp_startcol >= next_match_col)
 				continue;
 			    spp->sp_line_id = current_line_id;
 					     (colnr_T)lc_col,
 					     IF_SYN_TIME(&spp->sp_time));
 			    spp->sp_prog = regmatch.regprog;
 			    if (!r)
 			    {
-				/* no match in this line, try another one */
+				// no match in this line, try another one
 				spp->sp_startcol = MAXCOL;
 				continue;
 			    }
 			    /*
 			     */
 			    syn_add_start_off(&pos, &regmatch,
 							 spp, SPO_MS_OFF, -1);
 			    if (pos.lnum > current_lnum)
 			    {
-				/* must have used end of match in a next line,
+				// must have used end of match in a next line,
-				 * we can't handle that */
+				// we can't handle that
 				spp->sp_startcol = MAXCOL;
 				continue;
 			    }
 			    startcol = pos.col;
-			    /* remember the next column where this pattern
+			    // remember the next column where this pattern
-			     * matches in the current line */
+			    // matches in the current line
 			    spp->sp_startcol = startcol;
 			    /*
 			     * If a previously found match starts at a lower
 			     * column number, don't use this one.
 			    }
 			    endpos.lnum = regmatch.endpos[0].lnum;
 			    endpos.col = regmatch.endpos[0].col;
-			    /* Compute the highlight start. */
+			    // Compute the highlight start.
 			    syn_add_start_off(&hl_startpos, &regmatch,
 							 spp, SPO_HS_OFF, -1);
-			    /* Compute the region start. */
+			    // Compute the region start.
-			    /* Default is to use the end of the match. */
+			    // Default is to use the end of the match.
 			    syn_add_end_off(&eos_pos, &regmatch,
 							 spp, SPO_RS_OFF, 0);
 			    /*
 			     * Grab the external submatches before they get
 			    unref_extmatch(cur_extmatch);
 			    cur_extmatch = re_extmatch_out;
 			    re_extmatch_out = NULL;
 			    flags = 0;
-			    eoe_pos.lnum = 0;	/* avoid warning */
+			    eoe_pos.lnum = 0;	// avoid warning
 			    eoe_pos.col = 0;
 			    end_idx = 0;
 			    hl_endpos.lnum = 0;
 			    /*
 				startpos = endpos;
 				find_endpos(idx, &startpos, &endpos, &hl_endpos,
 				    &flags, &eoe_pos, &end_idx, cur_extmatch);
 				if (endpos.lnum == 0)
-				    continue;	    /* not found */
+				    continue;	    // not found
 			    }
 			    /*
 			     * For a "match" the size must be > 0 after the
 			     * end offset needs has been added.  Except when
 			    }
 			    /*
 			     * keep the best match so far in next_match_*
 			     */
-			    /* Highlighting must start after startpos and end
+			    // Highlighting must start after startpos and end
-			     * before endpos. */
+			    // before endpos.
 			    if (hl_startpos.lnum == current_lnum
 					   && (int)hl_startpos.col < startcol)
 				hl_startpos.col = startcol;
 			    limit_pos_zero(&hl_endpos, &endpos);
 		 */
 		if (next_match_idx >= 0 && next_match_col == (int)current_col)
 		{
 		    synpat_T	*lspp;
-		    /* When a zero-width item matched which has a nextgroup,
+		    // When a zero-width item matched which has a nextgroup,
-		     * don't push the item but set nextgroup. */
+		    // don't push the item but set nextgroup.
 		    lspp = &(SYN_ITEMS(syn_block)[next_match_idx]);
 		    if (next_match_m_endpos.lnum == current_lnum
 			    && next_match_m_endpos.col == current_col
 			    && lspp->sp_next_list != NULL)
 		    {
 			current_next_list = lspp->sp_next_list;
 			current_next_flags = lspp->sp_flags;
 			keep_next_list = TRUE;
 			zero_width_next_list = TRUE;
-			/* Add the index to a list, so that we can check
+			// Add the index to a list, so that we can check
-			 * later that we don't match it again (and cause an
+			// later that we don't match it again (and cause an
-			 * endless loop). */
+			// endless loop).
 			if (ga_grow(&zero_width_next_ga, 1) == OK)
 			{
 			    ((int *)(zero_width_next_ga.ga_data))
 				[zero_width_next_ga.ga_len++] = next_match_idx;
 			}
 	     * set "can_spell" to TRUE if spell checking is supposed to be
 	     * done in the current item.
 	     */
 	    if (syn_block->b_spell_cluster_id == 0)
 	    {
-		/* There is no @Spell cluster: Do spelling for items without
+		// There is no @Spell cluster: Do spelling for items without
-		 * @NoSpell cluster. */
+		// @NoSpell cluster.
 		if (syn_block->b_nospell_cluster_id == 0
 						     || current_trans_id == 0)
 		    *can_spell = (syn_block->b_syn_spell != SYNSPL_NOTOP);
 		else
 		{
 		    *can_spell = !in_id_list(sip, sip->si_cont_list, &sps, 0);
 		}
 	    }
 	    else
 	    {
-		/* The @Spell cluster is defined: Do spelling in items with
+		// The @Spell cluster is defined: Do spelling in items with
-		 * the @Spell cluster.  But not when @NoSpell is also there.
+		// the @Spell cluster.  But not when @NoSpell is also there.
-		 * At the toplevel only spell check when ":syn spell toplevel"
+		// At the toplevel only spell check when ":syn spell toplevel"
-		 * was used. */
+		// was used.
 		if (current_trans_id == 0)
 		    *can_spell = (syn_block->b_syn_spell == SYNSPL_TOP);
 		else
 		{
 		    sps.inc_tag = 0;
 		--current_col;
 	    }
 	}
 }
 else if (can_spell != NULL)
-	/* Default: Only do spelling when there is no @Spell cluster or when
+	// Default: Only do spelling when there is no @Spell cluster or when
-	 * ":syn spell toplevel" was used. */
+	// ":syn spell toplevel" was used.
 	*can_spell = syn_block->b_syn_spell == SYNSPL_DEFAULT
 		    ? (syn_block->b_spell_cluster_id == 0)
 		    : (syn_block->b_syn_spell == SYNSPL_TOP);
-/* nextgroup ends at end of line, unless "skipnl" or "skipempty" present */
+// nextgroup ends at end of line, unless "skipnl" or "skipempty" present
 if (current_next_list != NULL
 	    && (line = syn_getcurline())[current_col] != NUL
 	    && line[current_col + 1] == NUL
 	    && !(current_next_flags & (HL_SKIPNL | HL_SKIPEMPTY)))
 	current_next_list = NULL;
 if (zero_width_next_ga.ga_len > 0)
 	ga_clear(&zero_width_next_ga);
-/* No longer need external matches.  But keep next_match_extmatch. */
+// No longer need external matches.  But keep next_match_extmatch.
 unref_extmatch(re_extmatch_out);
 re_extmatch_out = NULL;
 unref_extmatch(cur_extmatch);
 return current_attr;
 	if (CUR_STATE(i).si_m_startcol == (int)current_col
 		&& CUR_STATE(i).si_m_lnum == (int)current_lnum
 		&& CUR_STATE(i).si_idx == idx)
 	    return TRUE;
-/* Zero-width matches with a nextgroup argument are not put on the syntax
+// Zero-width matches with a nextgroup argument are not put on the syntax
-* stack, and can only be matched once anyway. */
+// stack, and can only be matched once anyway.
 for (i = gap->ga_len; --i >= 0; )
 	if (((int *)(gap->ga_data))[i] == idx)
 	    return TRUE;
 return FALSE;
 #endif
 	cur_si->si_next_list = spp->sp_next_list;
 	cur_si->si_extmatch = ref_extmatch(next_match_extmatch);
 	if (spp->sp_type == SPTYPE_START && !(spp->sp_flags & HL_ONELINE))
 	{
-	    /* Try to find the end pattern in the current line */
+	    // Try to find the end pattern in the current line
 	    update_si_end(cur_si, (int)(next_match_m_endpos.col), TRUE);
 	    check_keepend();
 	}
 	else
 	{
 	    check_keepend();
 	    update_si_attr(current_state.ga_len - 1);
 	}
 }
-next_match_idx = -1;	/* try other match next time */
+next_match_idx = -1;	// try other match next time
 return cur_si;
 }
 /*
 		if (cur_si->si_flags & HL_CONCEALENDS)
 		    cur_si->si_flags |= HL_CONCEAL;
 #endif
 		update_si_attr(current_state.ga_len - 1);
-		/* nextgroup= should not match in the end pattern */
+		// nextgroup= should not match in the end pattern
 		current_next_list = NULL;
-		/* what matches next may be different now, clear it */
+		// what matches next may be different now, clear it
 		next_match_idx = 0;
 		next_match_col = MAXCOL;
 		break;
 	    }
 	    else
 	    {
-		/* handle next_list, unless at end of line and no "skipnl" or
+		// handle next_list, unless at end of line and no "skipnl" or
-		 * "skipempty" */
+		// "skipempty"
 		current_next_list = cur_si->si_next_list;
 		current_next_flags = cur_si->si_flags;
 		if (!(current_next_flags & (HL_SKIPNL | HL_SKIPEMPTY))
 			&& syn_getcurline()[current_col] == NUL)
 		    current_next_list = NULL;
-		/* When the ended item has "extend", another item with
+		// When the ended item has "extend", another item with
-		 * "keepend" now needs to check for its end. */
+		// "keepend" now needs to check for its end.
 		 had_extend = (cur_si->si_flags & HL_EXTEND);
 		pop_current_state();
 		if (current_state.ga_len == 0)
 update_si_attr(int idx)
 {
 stateitem_T	*sip = &CUR_STATE(idx);
 synpat_T	*spp;
-/* This should not happen... */
+// This should not happen...
 if (sip->si_idx < 0)
 	return;
 spp = &(SYN_ITEMS(syn_block)[sip->si_idx]);
 if (sip->si_flags & HL_MATCH)
 * Return the flags for the matched END.
 */
 static void
 update_si_end(
 stateitem_T	*sip,
-int		startcol,   /* where to start searching for the end */
+int		startcol,   // where to start searching for the end
-int		force)	    /* when TRUE overrule a previous end */
+int		force)	    // when TRUE overrule a previous end
 {
 lpos_T	startpos;
 lpos_T	endpos;
 lpos_T	hl_endpos;
 lpos_T	end_endpos;
 int		end_idx;
-/* return quickly for a keyword */
+// return quickly for a keyword
 if (sip->si_idx < 0)
 	return;
-/* Don't update when it's already done.  Can be a match of an end pattern
+// Don't update when it's already done.  Can be a match of an end pattern
-* that started in a previous line.  Watch out: can also be a "keepend"
+// that started in a previous line.  Watch out: can also be a "keepend"
-* from a containing item. */
+// from a containing item.
 if (!force && sip->si_m_endpos.lnum >= current_lnum)
 	return;
 /*
 * We need to find the end of the region.  It may continue in the next
 find_endpos(sip->si_idx, &startpos, &endpos, &hl_endpos,
 		   &(sip->si_flags), &end_endpos, &end_idx, sip->si_extmatch);
 if (endpos.lnum == 0)
 {
-	/* No end pattern matched. */
+	// No end pattern matched.
 	if (SYN_ITEMS(syn_block)[sip->si_idx].sp_flags & HL_ONELINE)
 	{
-	    /* a "oneline" never continues in the next line */
+	    // a "oneline" never continues in the next line
 	    sip->si_ends = TRUE;
 	    sip->si_m_endpos.lnum = current_lnum;
 	    sip->si_m_endpos.col = (colnr_T)STRLEN(syn_getcurline());
 	}
 	else
 	{
-	    /* continues in the next line */
+	    // continues in the next line
 	    sip->si_ends = FALSE;
 	    sip->si_m_endpos.lnum = 0;
 	}
 	sip->si_h_endpos = sip->si_m_endpos;
 }
 else
 {
-	/* match within this line */
+	// match within this line
 	sip->si_m_endpos = endpos;
 	sip->si_h_endpos = hl_endpos;
 	sip->si_eoe_pos = end_endpos;
 	sip->si_ends = TRUE;
 	sip->si_end_idx = end_idx;
 if (current_state.ga_len)
 {
 	unref_extmatch(CUR_STATE(current_state.ga_len - 1).si_extmatch);
 	--current_state.ga_len;
 }
-/* after the end of a pattern, try matching a keyword or pattern */
+// after the end of a pattern, try matching a keyword or pattern
 next_match_idx = -1;
-/* if first state with "keepend" is popped, reset keepend_level */
+// if first state with "keepend" is popped, reset keepend_level
 if (keepend_level >= current_state.ga_len)
 	keepend_level = -1;
 }
 /*
 * If found, the end of the region and the end of the highlighting is
 * computed.
 */
 static void
 find_endpos(
-int		idx,		/* index of the pattern */
+int		idx,		// index of the pattern
-lpos_T	*startpos,	/* where to start looking for an END match */
+lpos_T	*startpos,	// where to start looking for an END match
-lpos_T	*m_endpos,	/* return: end of match */
+lpos_T	*m_endpos,	// return: end of match
-lpos_T	*hl_endpos,	/* return: end of highlighting */
+lpos_T	*hl_endpos,	// return: end of highlighting
-long	*flagsp,	/* return: flags of matching END */
+long	*flagsp,	// return: flags of matching END
-lpos_T	*end_endpos,	/* return: end of end pattern match */
+lpos_T	*end_endpos,	// return: end of end pattern match
-int		*end_idx,	/* return: group ID for end pat. match, or 0 */
+int		*end_idx,	// return: group ID for end pat. match, or 0
-reg_extmatch_T *start_ext)	/* submatches from the start pattern */
+reg_extmatch_T *start_ext)	// submatches from the start pattern
 {
 colnr_T	matchcol;
 synpat_T	*spp, *spp_skip;
 int		start_idx;
 int		best_idx;
 regmmatch_T	regmatch;
-regmmatch_T	best_regmatch;	    /* startpos/endpos of best match */
+regmmatch_T	best_regmatch;	    // startpos/endpos of best match
 lpos_T	pos;
 char_u	*line;
 int		had_match = FALSE;
-char_u	buf_chartab[32];  /* chartab array for syn option iskyeyword */
+char_u	buf_chartab[32];  // chartab array for syn option iskyeyword
-/* just in case we are invoked for a keyword */
+// just in case we are invoked for a keyword
 if (idx < 0)
 	return;
 /*
 * Check for being called with a START pattern.
 	++idx;
 }
 else
 	spp_skip = NULL;
-/* Setup external matches for syn_regexec(). */
+// Setup external matches for syn_regexec().
 unref_extmatch(re_extmatch_in);
 re_extmatch_in = ref_extmatch(start_ext);
-matchcol = startpos->col;	/* start looking for a match at sstart */
+matchcol = startpos->col;	// start looking for a match at sstart
-start_idx = idx;		/* remember the first END pattern. */
+start_idx = idx;		// remember the first END pattern.
-best_regmatch.startpos[0].col = 0;		/* avoid compiler warning */
+best_regmatch.startpos[0].col = 0;		// avoid compiler warning
-/* use syntax iskeyword option */
+// use syntax iskeyword option
 save_chartab(buf_chartab);
 for (;;)
 {
 	/*
 	{
 	    int lc_col = matchcol;
 	    int r;
 	    spp = &(SYN_ITEMS(syn_block)[idx]);
-	    if (spp->sp_type != SPTYPE_END)	/* past last END pattern */
+	    if (spp->sp_type != SPTYPE_END)	// past last END pattern
 		break;
 	    lc_col -= spp->sp_offsets[SPO_LC_OFF];
 	    if (lc_col < 0)
 		lc_col = 0;
 	    if (r && regmatch.startpos[0].col
 					     <= best_regmatch.startpos[0].col)
 	    {
 		int line_len;
-		/* Add offset to skip pattern match */
+		// Add offset to skip pattern match
 		syn_add_end_off(&pos, &regmatch, spp_skip, SPO_ME_OFF, 1);
-		/* If the skip pattern goes on to the next line, there is no
+		// If the skip pattern goes on to the next line, there is no
-		 * match with an end pattern in this line. */
+		// match with an end pattern in this line.
 		if (pos.lnum > startpos->lnum)
 		    break;
 		line = ml_get_buf(syn_buf, startpos->lnum, FALSE);
 		line_len = (int)STRLEN(line);
-		/* take care of an empty match or negative offset */
+		// take care of an empty match or negative offset
 		if (pos.col <= matchcol)
 		    ++matchcol;
 		else if (pos.col <= regmatch.endpos[0].col)
 		    matchcol = pos.col;
 		else
-		    /* Be careful not to jump over the NUL at the end-of-line */
+		    // Be careful not to jump over the NUL at the end-of-line
 		    for (matchcol = regmatch.endpos[0].col;
 			    matchcol < line_len && matchcol < pos.col;
 								   ++matchcol)
 			;
-		/* if the skip pattern includes end-of-line, break here */
+		// if the skip pattern includes end-of-line, break here
 		if (matchcol >= line_len)
 		    break;
-		continue;	    /* start with first end pattern again */
+		continue;	    // start with first end pattern again
 	    }
 	}
 	/*
 	 * Match from start pattern to end pattern.
 	 * Correct for match and highlight offset of end pattern.
 	 */
 	spp = &(SYN_ITEMS(syn_block)[best_idx]);
 	syn_add_end_off(m_endpos, &best_regmatch, spp, SPO_ME_OFF, 1);
-	/* can't end before the start */
+	// can't end before the start
 	if (m_endpos->lnum == startpos->lnum && m_endpos->col < startpos->col)
 	    m_endpos->col = startpos->col;
 	syn_add_end_off(end_endpos, &best_regmatch, spp, SPO_HE_OFF, 1);
-	/* can't end before the start */
+	// can't end before the start
 	if (end_endpos->lnum == startpos->lnum
 					   && end_endpos->col < startpos->col)
 	    end_endpos->col = startpos->col;
-	/* can't end after the match */
+	// can't end after the match
 	limit_pos(end_endpos, m_endpos);
 	/*
 	 * If the end group is highlighted differently, adjust the pointers.
 	 */
 		hl_endpos->lnum = best_regmatch.startpos[0].lnum;
 		hl_endpos->col = best_regmatch.startpos[0].col;
 	    }
 	    hl_endpos->col += spp->sp_offsets[SPO_RE_OFF];
-	    /* can't end before the start */
+	    // can't end before the start
 	    if (hl_endpos->lnum == startpos->lnum
 					    && hl_endpos->col < startpos->col)
 		hl_endpos->col = startpos->col;
 	    limit_pos(hl_endpos, m_endpos);
-	    /* now the match ends where the highlighting ends, it is turned
+	    // now the match ends where the highlighting ends, it is turned
-	     * into the matchgroup for the end */
+	    // into the matchgroup for the end
 	    *m_endpos = *hl_endpos;
 	}
 	else
 	{
 	    *end_idx = 0;
 	had_match = TRUE;
 	break;
 }
-/* no match for an END pattern in this line */
+// no match for an END pattern in this line
 if (!had_match)
 	m_endpos->lnum = 0;
 restore_chartab(buf_chartab);
-/* Remove external matches. */
+// Remove external matches.
 unref_extmatch(re_extmatch_in);
 re_extmatch_in = NULL;
 }
 /*
 /*
 * Add offset to matched text for end of match or highlight.
 */
 static void
 syn_add_end_off(
-lpos_T	*result,	/* returned position */
+lpos_T	*result,	// returned position
-regmmatch_T	*regmatch,	/* start/end of match */
+regmmatch_T	*regmatch,	// start/end of match
-synpat_T	*spp,		/* matched pattern */
+synpat_T	*spp,		// matched pattern
-int		idx,		/* index of offset */
+int		idx,		// index of offset
-int		extra)		/* extra chars for offset to start */
+int		extra)		// extra chars for offset to start
 {
 int		col;
 int		off;
 char_u	*base;
 char_u	*p;
 {
 	result->lnum = regmatch->endpos[0].lnum;
 	col = regmatch->endpos[0].col;
 	off = spp->sp_offsets[idx];
 }
-/* Don't go past the end of the line.  Matters for "rs=e+2" when there
+// Don't go past the end of the line.  Matters for "rs=e+2" when there
-* is a matchgroup. Watch out for match with last NL in the buffer. */
+// is a matchgroup. Watch out for match with last NL in the buffer.
 if (result->lnum > syn_buf->b_ml.ml_line_count)
 	col = 0;
 else if (off != 0)
 {
 	base = ml_get_buf(syn_buf, result->lnum, FALSE);
 * Add offset to matched text for start of match or highlight.
 * Avoid resulting column to become negative.
 */
 static void
 syn_add_start_off(
-lpos_T	*result,	/* returned position */
+lpos_T	*result,	// returned position
-regmmatch_T	*regmatch,	/* start/end of match */
+regmmatch_T	*regmatch,	// start/end of match
 synpat_T	*spp,
 int		idx,
-int		extra)	    /* extra chars for offset to end */
+int		extra)	    // extra chars for offset to end
 {
 int		col;
 int		off;
 char_u	*base;
 char_u	*p;
 	col = regmatch->startpos[0].col;
 	off = spp->sp_offsets[idx];
 }
 if (result->lnum > syn_buf->b_ml.ml_line_count)
 {
-	/* a "\n" at the end of the pattern may take us below the last line */
+	// a "\n" at the end of the pattern may take us below the last line
 	result->lnum = syn_buf->b_ml.ml_line_count;
 	col = (int)STRLEN(ml_get_buf(syn_buf, result->lnum, FALSE));
 }
 if (off != 0)
 {
 * Return its ID if found, 0 otherwise.
 */
 static int
 check_keyword_id(
 char_u	*line,
-int		startcol,	/* position in line to check for keyword */
+int		startcol,	// position in line to check for keyword
-int		*endcolp,	/* return: character after found keyword */
+int		*endcolp,	// return: character after found keyword
-long	*flagsp,	/* return: flags of matching keyword */
+long	*flagsp,	// return: flags of matching keyword
-short	**next_listp,	/* return: next_list of matching keyword */
+short	**next_listp,	// return: next_list of matching keyword
-stateitem_T	*cur_si,	/* item at the top of the stack */
+stateitem_T	*cur_si,	// item at the top of the stack
-int		*ccharp UNUSED)	/* conceal substitution char */
+int		*ccharp UNUSED)	// conceal substitution char
 {
 keyentry_T	*kp;
 char_u	*kwp;
 int		round;
 int		kwlen;
-char_u	keyword[MAXKEYWLEN + 1]; /* assume max. keyword len is 80 */
+char_u	keyword[MAXKEYWLEN + 1]; // assume max. keyword len is 80
 hashtab_T	*ht;
 hashitem_T	*hi;
-/* Find first character after the keyword.  First character was already
+// Find first character after the keyword.  First character was already
-* checked. */
+// checked.
 kwp = line + startcol;
 kwlen = 0;
 do
 {
 	if (has_mbyte)
 for (round = 1; round <= 2; ++round)
 {
 	ht = round == 1 ? &syn_block->b_keywtab : &syn_block->b_keywtab_ic;
 	if (ht->ht_used == 0)
 	    continue;
-	if (round == 2)	/* ignore case */
+	if (round == 2)	// ignore case
 	    (void)str_foldcase(kwp, kwlen, keyword, MAXKEYWLEN + 1);
 	/*
 	 * Find keywords that match.  There can be several with different
 	 * attributes.
 {
 	semsg(_("E390: Illegal argument: %s"), arg);
 	return;
 }
-/* assume spell checking changed, force a redraw */
+// assume spell checking changed, force a redraw
 redraw_win_later(curwin, NOT_VALID);
 }
 /*
 * Handle ":syntax iskeyword" command.
 void
 syntax_clear(synblock_T *block)
 {
 int i;
-block->b_syn_error = FALSE;	    /* clear previous error */
+block->b_syn_error = FALSE;	    // clear previous error
 #ifdef FEAT_RELTIME
-block->b_syn_slow = FALSE;	    /* clear previous timeout */
+block->b_syn_slow = FALSE;	    // clear previous timeout
 #endif
-block->b_syn_ic = FALSE;	    /* Use case, by default */
+block->b_syn_ic = FALSE;	    // Use case, by default
-block->b_syn_spell = SYNSPL_DEFAULT; /* default spell checking */
+block->b_syn_spell = SYNSPL_DEFAULT; // default spell checking
 block->b_syn_containedin = FALSE;
 #ifdef FEAT_CONCEAL
 block->b_syn_conceal = FALSE;
 #endif
-/* free the keywords */
+// free the keywords
 clear_keywtab(&block->b_keywtab);
 clear_keywtab(&block->b_keywtab_ic);
-/* free the syntax patterns */
+// free the syntax patterns
 for (i = block->b_syn_patterns.ga_len; --i >= 0; )
 	syn_clear_pattern(block, i);
 ga_clear(&block->b_syn_patterns);
-/* free the syntax clusters */
+// free the syntax clusters
 for (i = block->b_syn_clusters.ga_len; --i >= 0; )
 	syn_clear_cluster(block, i);
 ga_clear(&block->b_syn_clusters);
 block->b_spell_cluster_id = 0;
 block->b_nospell_cluster_id = 0;
 #ifdef FEAT_FOLDING
 block->b_syn_folditems = 0;
 #endif
 clear_string_option(&block->b_syn_isk);
-/* free the stored states */
+// free the stored states
 syn_stack_free_all(block);
 invalidate_current_state();
-/* Reset the counter for ":syn include" */
+// Reset the counter for ":syn include"
 running_syn_inc_tag = 0;
 }
 /*
 * Get rid of ownsyntax for window "wp".
 static void
 syntax_sync_clear(void)
 {
 int i;
-/* free the syntax patterns */
+// free the syntax patterns
 for (i = curwin->w_s->b_syn_patterns.ga_len; --i >= 0; )
 	if (SYN_ITEMS(curwin->w_s)[i].sp_syncing)
 	    syn_remove_pattern(curwin->w_s, i);
 curwin->w_s->b_syn_sync_flags = 0;
 vim_regfree(curwin->w_s->b_syn_linecont_prog);
 curwin->w_s->b_syn_linecont_prog = NULL;
 VIM_CLEAR(curwin->w_s->b_syn_linecont_pat);
 clear_string_option(&curwin->w_s->b_syn_isk);
-syn_stack_free_all(curwin->w_s);	/* Need to recompute all syntax. */
+syn_stack_free_all(curwin->w_s);	// Need to recompute all syntax.
 }
 /*
 * Remove one pattern from the buffer's pattern list.
 */
 static void
 syn_clear_pattern(synblock_T *block, int i)
 {
 vim_free(SYN_ITEMS(block)[i].sp_pattern);
 vim_regfree(SYN_ITEMS(block)[i].sp_prog);
-/* Only free sp_cont_list and sp_next_list of first start pattern */
+// Only free sp_cont_list and sp_next_list of first start pattern
 if (i == 0 || SYN_ITEMS(block)[i - 1].sp_type != SPTYPE_START)
 {
 	vim_free(SYN_ITEMS(block)[i].sp_cont_list);
 	vim_free(SYN_ITEMS(block)[i].sp_next_list);
 	vim_free(SYN_ITEMS(block)[i].sp_syn.cont_in_list);
 	    }
 	    arg = skipwhite(arg_end);
 	}
 }
 redraw_curbuf_later(SOME_VALID);
-syn_stack_free_all(curwin->w_s);		/* Need to recompute all syntax. */
+syn_stack_free_all(curwin->w_s);		// Need to recompute all syntax.
 }
 /*
 * Clear one syntax group for the current buffer.
 */
 syn_clear_one(int id, int syncing)
 {
 synpat_T	*spp;
 int		idx;
-/* Clear keywords only when not ":syn sync clear group-name" */
+// Clear keywords only when not ":syn sync clear group-name"
 if (!syncing)
 {
 	(void)syn_clear_keyword(id, &curwin->w_s->b_keywtab);
 	(void)syn_clear_keyword(id, &curwin->w_s->b_keywtab_ic);
 }
-/* clear the patterns for "id" */
+// clear the patterns for "id"
 for (idx = curwin->w_s->b_syn_patterns.ga_len; --idx >= 0; )
 {
 	spp = &(SYN_ITEMS(curwin->w_s)[idx]);
 	if (spp->sp_syn.id != id || spp->sp_syncing != syncing)
 	    continue;
 * Handle ":syntax [list]" command: list current syntax words.
 */
 static void
 syn_cmd_list(
 exarg_T	*eap,
-int		syncing)	    /* when TRUE: list syncing items */
+int		syncing)	    // when TRUE: list syncing items
 {
 char_u	*arg = eap->arg;
 int		id;
 char_u	*arg_end;
 * List one syntax item, for ":syntax" or "syntax list syntax_name".
 */
 static void
 syn_list_one(
 int		id,
-int		syncing,	    /* when TRUE: list syncing items */
+int		syncing,	    // when TRUE: list syncing items
-int		link_only)	    /* when TRUE; list link-only too */
+int		link_only)	    // when TRUE; list link-only too
 {
 int		attr;
 int		idx;
 int		did_header = FALSE;
 synpat_T	*spp;
 		    {HL_SKIPNL, "skipnl"},
 		    {HL_SKIPEMPTY, "skipempty"},
 		    {0, NULL}
 		};
-attr = HL_ATTR(HLF_D);		/* highlight like directories */
+attr = HL_ATTR(HLF_D);		// highlight like directories
-/* list the keywords for "id" */
+// list the keywords for "id"
 if (!syncing)
 {
 	did_header = syn_list_keywords(id, &curwin->w_s->b_keywtab, FALSE, attr);
 	did_header = syn_list_keywords(id, &curwin->w_s->b_keywtab_ic,
 							    did_header, attr);
 }
-/* list the patterns for "id" */
+// list the patterns for "id"
 for (idx = 0; idx < curwin->w_s->b_syn_patterns.ga_len && !got_int; ++idx)
 {
 	spp = &(SYN_ITEMS(curwin->w_s)[idx]);
 	if (spp->sp_syn.id != id || spp->sp_syncing != syncing)
 	    continue;
 		msg_puts("NONE");
 	    msg_putchar(' ');
 	}
 }
-/* list the link, if there is one */
+// list the link, if there is one
 if (highlight_link_id(id - 1) && (did_header || link_only) && !got_int)
 {
 	(void)syn_list_header(did_header, 999, id);
 	msg_puts_attr("links to", attr);
 	msg_putchar(' ');
 static void
 syn_list_cluster(int id)
 {
 int	    endcol = 15;
-/* slight hack:  roughly duplicate the guts of syn_list_header() */
+// slight hack:  roughly duplicate the guts of syn_list_header()
 msg_putchar('\n');
 msg_outtrans(SYN_CLSTR(curwin->w_s)[id].scl_name);
-if (msg_col >= endcol)	/* output at least one space */
+if (msg_col >= endcol)	// output at least one space
 	endcol = msg_col + 1;
-if (Columns <= endcol)	/* avoid hang for tiny window */
+if (Columns <= endcol)	// avoid hang for tiny window
 	endcol = Columns - 1;
 msg_advance(endcol);
 if (SYN_CLSTR(curwin->w_s)[id].scl_list != NULL)
 {
 int		mask;
 int		first;
 static char	*sepchars = "/+=-#@\"|'^&";
 int		i;
-/* May have to write "matchgroup=group" */
+// May have to write "matchgroup=group"
 if (last_matchgroup != spp->sp_syn_match_id)
 {
 	last_matchgroup = spp->sp_syn_match_id;
 	msg_puts_attr("matchgroup", attr);
 	msg_putchar('=');
 	else
 	    msg_outtrans(highlight_group_name(last_matchgroup - 1));
 	msg_putchar(' ');
 }
-/* output the name of the pattern and an '=' or ' ' */
+// output the name of the pattern and an '=' or ' '
 msg_puts_attr(s, attr);
 msg_putchar(c);
-/* output the pattern, in between a char that is not in the pattern */
+// output the pattern, in between a char that is not in the pattern
 for (i = 0; vim_strchr(spp->sp_pattern, sepchars[i]) != NULL; )
 	if (sepchars[++i] == NUL)
 	{
-	    i = 0;	/* no good char found, just use the first one */
+	    i = 0;	// no good char found, just use the first one
 	    break;
 	}
 msg_putchar(sepchars[i]);
 msg_outtrans(spp->sp_pattern);
 msg_putchar(sepchars[i]);
-/* output any pattern options */
+// output any pattern options
 first = TRUE;
 for (i = 0; i < SPO_COUNT; ++i)
 {
 	mask = (1 << i);
 	if (spp->sp_off_flags & (mask + (mask << SPO_COUNT)))
 	{
 	    if (!first)
-		msg_putchar(',');	/* separate with commas */
+		msg_putchar(',');	// separate with commas
 	    msg_puts(spo_name_tab[i]);
 	    n = spp->sp_offsets[i];
 	    if (i != SPO_LC_OFF)
 	    {
 		if (spp->sp_off_flags & mask)
 */
 static int
 syn_list_keywords(
 int		id,
 hashtab_T	*ht,
-int		did_header,		/* header has already been printed */
+int		did_header,		// header has already been printed
 int		attr)
 {
 int		outlen;
 hashitem_T	*hi;
 keyentry_T	*kp;
 			    || prev_cont_in_list != kp->k_syn.cont_in_list
 			    || prev_next_list != kp->next_list)
 			outlen = 9999;
 		    else
 			outlen = (int)STRLEN(kp->keyword);
-		    /* output "contained" and "nextgroup" on each line */
+		    // output "contained" and "nextgroup" on each line
 		    if (syn_list_header(did_header, outlen, id))
 		    {
 			prev_contained = 0;
 			prev_next_list = NULL;
 			prev_cont_in_list = NULL;
 /*
 * Add a keyword to the list of keywords.
 */
 static void
 add_keyword(
-char_u	*name,	    /* name of keyword */
+char_u	*name,	    // name of keyword
-int		id,	    /* group ID for this keyword */
+int		id,	    // group ID for this keyword
-int		flags,	    /* flags for this keyword */
+int		flags,	    // flags for this keyword
-short	*cont_in_list, /* containedin for this keyword */
+short	*cont_in_list, // containedin for this keyword
-short	*next_list, /* nextgroup for this keyword */
+short	*next_list, // nextgroup for this keyword
 int		conceal_char)
 {
 keyentry_T	*kp;
 hashtab_T	*ht;
 hashitem_T	*hi;
 hash = hash_hash(kp->keyword);
 hi = hash_lookup(ht, kp->keyword, hash);
 if (HASHITEM_EMPTY(hi))
 {
-	/* new keyword, add to hashtable */
+	// new keyword, add to hashtable
 	kp->ke_next = NULL;
 	hash_add_item(ht, hi, kp->keyword, hash);
 }
 else
 {
-	/* keyword already exists, prepend to list */
+	// keyword already exists, prepend to list
 	kp->ke_next = HI2KE(hi);
 	hi->hi_key = KE2HIKEY(kp);
 }
 }
 * Return a pointer to the first argument.
 * Return NULL if the end of the command was found instead of further args.
 */
 static char_u *
 get_group_name(
-char_u	*arg,		/* start of the argument */
+char_u	*arg,		// start of the argument
-char_u	**name_end)	/* pointer to end of the name */
+char_u	**name_end)	// pointer to end of the name
 {
 char_u	*rest;
 *name_end = skiptowhite(arg);
 rest = skipwhite(*name_end);
 * Return a pointer to the next argument (which isn't an option).
 * Return NULL for any error;
 */
 static char_u *
 get_syn_options(
-char_u	    *arg,		/* next argument to be checked */
+char_u	    *arg,		// next argument to be checked
-syn_opt_arg_T   *opt,		/* various things */
+syn_opt_arg_T   *opt,		// various things
 int		    *conceal_char UNUSED,
-int		    skip)		/* TRUE if skipping over command */
+int		    skip)		// TRUE if skipping over command
 {
 char_u	*gname_start, *gname;
 int		syn_id;
 int		len;
 char	*p;
 		    {"cCoOnNtTaAiInNeEdDiInN",	2,	0},
 		    {"nNeExXtTgGrRoOuUpP",	3,	0},
 		};
 static char *first_letters = "cCoOkKeEtTsSgGdDfFnN";
-if (arg == NULL)		/* already detected error */
+if (arg == NULL)		// already detected error
 	return NULL;
 #ifdef FEAT_CONCEAL
 if (curwin->w_s->b_syn_conceal)
 	opt->flags |= HL_CONCEAL;
 	    {
 		if (opt->keyword
 			&& (flagtab[fidx].flags == HL_DISPLAY
 			    || flagtab[fidx].flags == HL_FOLD
 			    || flagtab[fidx].flags == HL_EXTEND))
-		    /* treat "display", "fold" and "extend" as a keyword */
+		    // treat "display", "fold" and "extend" as a keyword
 		    fidx = -1;
 		break;
 	    }
 	}
-	if (fidx < 0)	    /* no match found */
+	if (fidx < 0)	    // no match found
 	    break;
 	if (flagtab[fidx].argtype == 1)
 	{
 	    if (!opt->has_cont_list)
 	    if (get_id_list(&arg, 9, &opt->next_list, skip) == FAIL)
 		return NULL;
 	}
 	else if (flagtab[fidx].argtype == 11 && arg[5] == '=')
 	{
-	    /* cchar=? */
+	    // cchar=?
 	    if (has_mbyte)
 	    {
 #ifdef FEAT_CONCEAL
 		*conceal_char = mb_ptr2char(arg + 6);
 #endif
 		arg = skipwhite(arg);
 	    }
 #ifdef FEAT_FOLDING
 	    else if (flagtab[fidx].flags == HL_FOLD
 						&& foldmethodIsSyntax(curwin))
-		/* Need to update folds later. */
+		// Need to update folds later.
 		foldUpdateAll(curwin);
 #endif
 	}
 }
 if ((*flagsp & HL_CONTAINED) || curwin->w_s->b_syn_topgrp == 0)
 	return;
 *flagsp |= HL_CONTAINED;
 if (curwin->w_s->b_syn_topgrp >= SYNID_CLUSTER)
 {
-	/* We have to alloc this, because syn_combine_list() will free it. */
+	// We have to alloc this, because syn_combine_list() will free it.
 	short	    *grp_list = ALLOC_MULT(short, 2);
 	int	    tlg_id = curwin->w_s->b_syn_topgrp - SYNID_CLUSTER;
 	if (grp_list != NULL)
 	{
 	    return;
 	}
 	sgl_id = syn_check_cluster(arg, (int)(group_name_end - arg));
 	if (sgl_id == 0)
 	    return;
-	/* separate_nextcmd() and expand_filename() depend on this */
+	// separate_nextcmd() and expand_filename() depend on this
 	eap->arg = rest;
 }
 /*
 * Everything that's left, up to the next command, should be the
 */
 eap->argt |= (EX_XFILE | EX_NOSPC);
 separate_nextcmd(eap);
 if (*eap->arg == '<' || *eap->arg == '$' || mch_isFullName(eap->arg))
 {
-	/* For an absolute path, "$VIM/..." or "<sfile>.." we ":source" the
+	// For an absolute path, "$VIM/..." or "<sfile>.." we ":source" the
-	 * file.  Need to expand the file name first.  In other cases
+	// file.  Need to expand the file name first.  In other cases
-	 * ":runtime!" is used. */
+	// ":runtime!" is used.
 	source = TRUE;
 	if (expand_filename(eap, syn_cmdlinep, &errormsg) == FAIL)
 	{
 	    if (errormsg != NULL)
 		emsg(errormsg);
 	if (eap->skip)
 	    syn_id = -1;
 	else
 	    syn_id = syn_check_group(arg, (int)(group_name_end - arg));
 	if (syn_id != 0)
-	    /* allocate a buffer, for removing backslashes in the keyword */
+	    // allocate a buffer, for removing backslashes in the keyword
 	    keyword_copy = alloc(STRLEN(rest) + 1);
 	if (keyword_copy != NULL)
 	{
 	    syn_opt_arg.flags = 0;
 	    syn_opt_arg.keyword = TRUE;
 	    {
 		rest = get_syn_options(rest, &syn_opt_arg, &conceal_char,
 								    eap->skip);
 		if (rest == NULL || ends_excmd(*rest))
 		    break;
-		/* Copy the keyword, removing backslashes, and add a NUL. */
+		// Copy the keyword, removing backslashes, and add a NUL.
 		while (*rest != NUL && !VIM_ISWHITE(*rest))
 		{
 		    if (*rest == '\\' && rest[1] != NUL)
 			++rest;
 		    *p++ = *rest++;
 		++cnt;
 	    }
 	    if (!eap->skip)
 	    {
-		/* Adjust flags for use of ":syn include". */
+		// Adjust flags for use of ":syn include".
 		syn_incl_toplevel(syn_id, &syn_opt_arg.flags);
 		/*
 		 * 2: Add an entry for each keyword.
 		 */
 			    {
 				semsg(_("E890: trailing char after ']': %s]%s"),
 								kw, &p[2]);
 				goto error;
 			    }
-			    kw = p + 1;		/* skip over the "]" */
+			    kw = p + 1;		// skip over the "]"
 			    break;
 			}
 			if (has_mbyte)
 			{
 			    int l = (*mb_ptr2len)(p + 1);
 	eap->nextcmd = check_nextcmd(rest);
 else
 	semsg(_(e_invarg2), arg);
 redraw_curbuf_later(SOME_VALID);
-syn_stack_free_all(curwin->w_s);		/* Need to recompute all syntax. */
+syn_stack_free_all(curwin->w_s);		// Need to recompute all syntax.
 }
 /*
 * Handle ":syntax match {name} [{options}] {pattern} [{options}]".
 *
 * Also ":syntax sync match {name} [[grouphere | groupthere] {group-name}] .."
 */
 static void
 syn_cmd_match(
 exarg_T	*eap,
-int		syncing)	    /* TRUE for ":syntax sync match .. " */
+int		syncing)	    // TRUE for ":syntax sync match .. "
 {
 char_u	*arg = eap->arg;
 char_u	*group_name_end;
 char_u	*rest;
-synpat_T	item;		/* the item found in the line */
+synpat_T	item;		// the item found in the line
 int		syn_id;
 int		idx;
 syn_opt_arg_T syn_opt_arg;
 int		sync_idx = 0;
 int		conceal_char = NUL;
-/* Isolate the group name, check for validity */
+// Isolate the group name, check for validity
 rest = get_group_name(arg, &group_name_end);
-/* Get options before the pattern */
+// Get options before the pattern
 syn_opt_arg.flags = 0;
 syn_opt_arg.keyword = FALSE;
 syn_opt_arg.sync_idx = syncing ? &sync_idx : NULL;
 syn_opt_arg.has_cont_list = TRUE;
 syn_opt_arg.cont_list = NULL;
 syn_opt_arg.cont_in_list = NULL;
 syn_opt_arg.next_list = NULL;
 rest = get_syn_options(rest, &syn_opt_arg, &conceal_char, eap->skip);
-/* get the pattern. */
+// get the pattern.
 init_syn_patterns();
 vim_memset(&item, 0, sizeof(item));
 rest = get_syn_pattern(rest, &item);
 if (vim_regcomp_had_eol() && !(syn_opt_arg.flags & HL_EXCLUDENL))
 	syn_opt_arg.flags |= HL_HAS_EOL;
-/* Get options after the pattern */
+// Get options after the pattern
 rest = get_syn_options(rest, &syn_opt_arg, &conceal_char, eap->skip);
-if (rest != NULL)		/* all arguments are valid */
+if (rest != NULL)		// all arguments are valid
 {
 	/*
 	 * Check for trailing command and illegal trailing arguments.
 	 */
 	eap->nextcmd = check_nextcmd(rest);
 	    if (syn_opt_arg.cont_in_list != NULL)
 		curwin->w_s->b_syn_containedin = TRUE;
 	    SYN_ITEMS(curwin->w_s)[idx].sp_next_list = syn_opt_arg.next_list;
 	    ++curwin->w_s->b_syn_patterns.ga_len;
-	    /* remember that we found a match for syncing on */
+	    // remember that we found a match for syncing on
 	    if (syn_opt_arg.flags & (HL_SYNC_HERE|HL_SYNC_THERE))
 		curwin->w_s->b_syn_sync_flags |= SF_MATCH;
 #ifdef FEAT_FOLDING
 	    if (syn_opt_arg.flags & HL_FOLD)
 		++curwin->w_s->b_syn_folditems;
 #endif
 	    redraw_curbuf_later(SOME_VALID);
-	    syn_stack_free_all(curwin->w_s);	/* Need to recompute all syntax. */
+	    syn_stack_free_all(curwin->w_s);	// Need to recompute all syntax.
-	    return;	/* don't free the progs and patterns now */
+	    return;	// don't free the progs and patterns now
 	}
 }
 /*
 * Something failed, free the allocated memory.
 *		start {start} .. [skip {skip}] end {end} .. [{options}]".
 */
 static void
 syn_cmd_region(
 exarg_T	*eap,
-int		syncing)	    /* TRUE for ":syntax sync region .." */
+int		syncing)	    // TRUE for ":syntax sync region .."
 {
 char_u		*arg = eap->arg;
 char_u		*group_name_end;
-char_u		*rest;			/* next arg, NULL on error */
+char_u		*rest;			// next arg, NULL on error
 char_u		*key_end;
 char_u		*key = NULL;
 char_u		*p;
 int			item;
 #define ITEM_START	    0
 #define ITEM_SKIP	    1
 #define ITEM_END	    2
 #define ITEM_MATCHGROUP	    3
 struct pat_ptr
 {
-	synpat_T	*pp_synp;		/* pointer to syn_pattern */
+	synpat_T	*pp_synp;		// pointer to syn_pattern
-	int		pp_matchgroup_id;	/* matchgroup ID */
+	int		pp_matchgroup_id;	// matchgroup ID
-	struct pat_ptr	*pp_next;		/* pointer to next pat_ptr */
+	struct pat_ptr	*pp_next;		// pointer to next pat_ptr
 }			*(pat_ptrs[3]);
-					/* patterns found in the line */
+					// patterns found in the line
 struct pat_ptr	*ppp;
 struct pat_ptr	*ppp_next;
-int			pat_count = 0;		/* nr of syn_patterns found */
+int			pat_count = 0;		// nr of syn_patterns found
 int			syn_id;
 int			matchgroup_id = 0;
-int			not_enough = FALSE;	/* not enough arguments */
+int			not_enough = FALSE;	// not enough arguments
-int			illegal = FALSE;	/* illegal arguments */
+int			illegal = FALSE;	// illegal arguments
 int			success = FALSE;
 int			idx;
 syn_opt_arg_T	syn_opt_arg;
 int			conceal_char = NUL;
-/* Isolate the group name, check for validity */
+// Isolate the group name, check for validity
 rest = get_group_name(arg, &group_name_end);
 pat_ptrs[0] = NULL;
 pat_ptrs[1] = NULL;
 pat_ptrs[2] = NULL;
 /*
 * get the options, patterns and matchgroup.
 */
 while (rest != NULL && !ends_excmd(*rest))
 {
-	/* Check for option arguments */
+	// Check for option arguments
 	rest = get_syn_options(rest, &syn_opt_arg, &conceal_char, eap->skip);
 	if (rest == NULL || ends_excmd(*rest))
 	    break;
-	/* must be a pattern or matchgroup then */
+	// must be a pattern or matchgroup then
 	key_end = rest;
 	while (*key_end && !VIM_ISWHITE(*key_end) && *key_end != '=')
 	    ++key_end;
 	vim_free(key);
 	key = vim_strnsave_up(rest, (int)(key_end - rest));
-	if (key == NULL)			/* out of memory */
+	if (key == NULL)			// out of memory
 	{
 	    rest = NULL;
 	    break;
 	}
 	if (STRCMP(key, "MATCHGROUP") == 0)
 	    item = ITEM_START;
 	else if (STRCMP(key, "END") == 0)
 	    item = ITEM_END;
 	else if (STRCMP(key, "SKIP") == 0)
 	{
-	    if (pat_ptrs[ITEM_SKIP] != NULL)	/* one skip pattern allowed */
+	    if (pat_ptrs[ITEM_SKIP] != NULL)	// one skip pattern allowed
 	    {
 		illegal = TRUE;
 		break;
 	    }
 	    item = ITEM_SKIP;
 	    }
 	    /*
 	     * Get the syntax pattern and the following offset(s).
 	     */
-	    /* Enable the appropriate \z specials. */
+	    // Enable the appropriate \z specials.
 	    if (item == ITEM_START)
 		reg_do_extmatch = REX_SET;
 	    else if (item == ITEM_SKIP || item == ITEM_END)
 		reg_do_extmatch = REX_USE;
 	    rest = get_syn_pattern(rest, ppp->pp_synp);
 #endif
 		}
 	    }
 	    redraw_curbuf_later(SOME_VALID);
-	    syn_stack_free_all(curwin->w_s);	/* Need to recompute all syntax. */
+	    syn_stack_free_all(curwin->w_s);	// Need to recompute all syntax.
-	    success = TRUE;	    /* don't free the progs and patterns now */
+	    success = TRUE;	    // don't free the progs and patterns now
 	}
 }
 /*
 * Free the allocated memory.
 syn_scl_name2id(char_u *name)
 {
 int		i;
 char_u	*name_u;
-/* Avoid using stricmp() too much, it's slow on some systems */
+// Avoid using stricmp() too much, it's slow on some systems
 name_u = vim_strsave_up(name);
 if (name_u == NULL)
 	return 0;
 for (i = curwin->w_s->b_syn_clusters.ga_len; --i >= 0; )
 	if (SYN_CLSTR(curwin->w_s)[i].scl_name_u != NULL
 name = vim_strnsave(pp, len);
 if (name == NULL)
 	return 0;
 id = syn_scl_name2id(name);
-if (id == 0)			/* doesn't exist yet */
+if (id == 0)			// doesn't exist yet
 	id = syn_add_cluster(name);
 else
 	vim_free(name);
 return id;
 }
 	}
 	if (got_clstr)
 	{
 	    redraw_curbuf_later(SOME_VALID);
-	    syn_stack_free_all(curwin->w_s);	/* Need to recompute all. */
+	    syn_stack_free_all(curwin->w_s);	// Need to recompute all.
 	}
 }
 if (!got_clstr)
 	emsg(_("E400: No cluster specified"));
 char_u	*end;
 int		*p;
 int		idx;
 char_u	*cpo_save;
-/* need at least three chars */
+// need at least three chars
 if (arg == NULL || arg[0] == NUL || arg[1] == NUL || arg[2] == NUL)
 	return NULL;
 end = skip_regexp(arg + 1, *arg, TRUE, NULL);
-if (*end != *arg)			    /* end delimiter not found */
+if (*end != *arg)			    // end delimiter not found
 {
 	semsg(_("E401: Pattern delimiter not found: %s"), arg);
 	return NULL;
 }
-/* store the pattern and compiled regexp program */
+// store the pattern and compiled regexp program
 if ((ci->sp_pattern = vim_strnsave(arg + 1, (int)(end - arg - 1))) == NULL)
 	return NULL;
-/* Make 'cpoptions' empty, to avoid the 'l' flag */
+// Make 'cpoptions' empty, to avoid the 'l' flag
 cpo_save = p_cpo;
 p_cpo = (char_u *)"";
 ci->sp_prog = vim_regcomp(ci->sp_pattern, RE_MAGIC);
 p_cpo = cpo_save;
 		    default:    idx = -1; break;
 		}
 	    if (idx >= 0)
 	    {
 		ci->sp_off_flags |= (1 << idx);
-		if (idx == SPO_LC_OFF)	    /* lc=99 */
+		if (idx == SPO_LC_OFF)	    // lc=99
 		{
 		    end += 3;
 		    *p = getdigits(&end);
-		    /* "lc=" offset automatically sets "ms=" offset */
+		    // "lc=" offset automatically sets "ms=" offset
 		    if (!(ci->sp_off_flags & (1 << SPO_MS_OFF)))
 		    {
 			ci->sp_off_flags |= (1 << SPO_MS_OFF);
 			ci->sp_offsets[SPO_MS_OFF] = *p;
 		    }
 		}
-		else			    /* yy=x+99 */
+		else			    // yy=x+99
 		{
 		    end += 4;
 		    if (*end == '+')
 		    {
 			++end;
-			*p = getdigits(&end);		/* positive offset */
+			*p = getdigits(&end);		// positive offset
 		    }
 		    else if (*end == '-')
 		    {
 			++end;
-			*p = -getdigits(&end);		/* negative offset */
+			*p = -getdigits(&end);		// negative offset
 		    }
 		}
 		if (*end != ',')
 		    break;
 		++end;
 		curwin->w_s->b_syn_sync_maxlines = 0;
 	    }
 	}
 	else if (STRCMP(key, "LINECONT") == 0)
 	{
-	    if (*next_arg == NUL)	   /* missing pattern */
+	    if (*next_arg == NUL)	   // missing pattern
 	    {
 		illegal = TRUE;
 		break;
 	    }
 	    if (curwin->w_s->b_syn_linecont_pat != NULL)
 		emsg(_("E403: syntax sync: line continuations pattern specified twice"));
 		finished = TRUE;
 		break;
 	    }
 	    arg_end = skip_regexp(next_arg + 1, *next_arg, TRUE, NULL);
-	    if (*arg_end != *next_arg)	    /* end delimiter not found */
+	    if (*arg_end != *next_arg)	    // end delimiter not found
 	    {
 		illegal = TRUE;
 		break;
 	    }
 	    if (!eap->skip)
 	    {
-		/* store the pattern and compiled regexp program */
+		// store the pattern and compiled regexp program
 		if ((curwin->w_s->b_syn_linecont_pat = vim_strnsave(next_arg + 1,
 				      (int)(arg_end - next_arg - 1))) == NULL)
 		{
 		    finished = TRUE;
 		    break;
 		}
 		curwin->w_s->b_syn_linecont_ic = curwin->w_s->b_syn_ic;
-		/* Make 'cpoptions' empty, to avoid the 'l' flag */
+		// Make 'cpoptions' empty, to avoid the 'l' flag
 		cpo_save = p_cpo;
 		p_cpo = (char_u *)"";
 		curwin->w_s->b_syn_linecont_prog =
 		       vim_regcomp(curwin->w_s->b_syn_linecont_pat, RE_MAGIC);
 		p_cpo = cpo_save;
 	semsg(_("E404: Illegal arguments: %s"), arg_start);
 else if (!finished)
 {
 	eap->nextcmd = check_nextcmd(arg_start);
 	redraw_curbuf_later(SOME_VALID);
-	syn_stack_free_all(curwin->w_s);	/* Need to recompute all syntax. */
+	syn_stack_free_all(curwin->w_s);	// Need to recompute all syntax.
 }
 }
 /*
 * Convert a line of highlight group names into a list of group ID numbers.
 * returns FAIL for some error, OK for success.
 */
 static int
 get_id_list(
 char_u	**arg,
-int		keylen,		/* length of keyword */
+int		keylen,		// length of keyword
-short	**list,		/* where to store the resulting list, if not
+short	**list,		// where to store the resulting list, if not
-				   NULL, the list is silently skipped! */
+				// NULL, the list is silently skipped!
 int		skip)
 {
 char_u	*p = NULL;
 char_u	*end;
 int		round;
 	count = 0;
 	while (!ends_excmd(*p))
 	{
 	    for (end = p; *end && !VIM_ISWHITE(*end) && *end != ','; ++end)
 		;
-	    name = alloc(end - p + 3);	    /* leave room for "^$" */
+	    name = alloc(end - p + 3);	    // leave room for "^$"
 	    if (name == NULL)
 	    {
 		failed = TRUE;
 		break;
 	    }
 			if (vim_regexec(&regmatch, highlight_group_name(i),
 								  (colnr_T)0))
 			{
 			    if (round == 2)
 			    {
-				/* Got more items than expected; can happen
+				// Got more items than expected; can happen
-				 * when adding items that match:
+				// when adding items that match:
-				 * "contains=a.*b,axb".
+				// "contains=a.*b,axb".
-				 * Go back to first round */
+				// Go back to first round
 				if (count >= total_count)
 				{
 				    vim_free(retval);
 				    round = 1;
 				}
 				else
 				    retval[count] = i + 1;
 			    }
 			    ++count;
-			    id = -1;	    /* remember that we found one */
+			    id = -1;	    // remember that we found one
 			}
 		    }
 		    vim_regfree(regmatch.regprog);
 		}
 	    }
 	    }
 	    if (id > 0)
 	    {
 		if (round == 2)
 		{
-		    /* Got more items than expected, go back to first round */
+		    // Got more items than expected, go back to first round
 		    if (count >= total_count)
 		    {
 			vim_free(retval);
 			round = 1;
 		    }
 		++count;
 	    }
 	    p = skipwhite(end);
 	    if (*p != ',')
 		break;
-	    p = skipwhite(p + 1);	/* skip comma in between arguments */
+	    p = skipwhite(p + 1);	// skip comma in between arguments
 	}
 	if (failed)
 	    break;
 	if (round == 1)
 	{
 	    retval = ALLOC_MULT(short, count + 1);
 	    if (retval == NULL)
 		break;
-	    retval[count] = 0;	    /* zero means end of the list */
+	    retval[count] = 0;	    // zero means end of the list
 	    total_count = count;
 	}
 }
 *arg = p;
 }
 if (*list == NULL)
 	*list = retval;
 else
-	vim_free(retval);	/* list already found, don't overwrite it */
+	vim_free(retval);	// list already found, don't overwrite it
 return OK;
 }
 /*
 * the current item.
 * This function is called very often, keep it fast!!
 */
 static int
 in_id_list(
-stateitem_T	*cur_si,	/* current item or NULL */
+stateitem_T	*cur_si,	// current item or NULL
-short	*list,		/* id list */
+short	*list,		// id list
-struct sp_syn *ssp,		/* group id and ":syn include" tag of group */
+struct sp_syn *ssp,		// group id and ":syn include" tag of group
-int		contained)	/* group id is contained */
+int		contained)	// group id is contained
 {
 int		retval;
 short	*scl_list;
 short	item;
 short	id = ssp->id;
 static int	depth = 0;
 int		r;
-/* If ssp has a "containedin" list and "cur_si" is in it, return TRUE. */
+// If ssp has a "containedin" list and "cur_si" is in it, return TRUE.
 if (cur_si != NULL && ssp->cont_in_list != NULL
 					    && !(cur_si->si_flags & HL_MATCH))
 {
-	/* Ignore transparent items without a contains argument.  Double check
+	// Ignore transparent items without a contains argument.  Double check
-	 * that we don't go back past the first one. */
+	// that we don't go back past the first one.
 	while ((cur_si->si_flags & HL_TRANS_CONT)
 		&& cur_si > (stateitem_T *)(current_state.ga_data))
 	    --cur_si;
-	/* cur_si->si_idx is -1 for keywords, these never contain anything. */
+	// cur_si->si_idx is -1 for keywords, these never contain anything.
 	if (cur_si->si_idx >= 0 && in_id_list(NULL, ssp->cont_in_list,
 		&(SYN_ITEMS(syn_block)[cur_si->si_idx].sp_syn),
 		  SYN_ITEMS(syn_block)[cur_si->si_idx].sp_flags & HL_CONTAINED))
 	    return TRUE;
 }
 item = *list;
 if (item >= SYNID_ALLBUT && item < SYNID_CLUSTER)
 {
 	if (item < SYNID_TOP)
 	{
-	    /* ALL or ALLBUT: accept all groups in the same file */
+	    // ALL or ALLBUT: accept all groups in the same file
 	    if (item - SYNID_ALLBUT != ssp->inc_tag)
 		return FALSE;
 	}
 	else if (item < SYNID_CONTAINED)
 	{
-	    /* TOP: accept all not-contained groups in the same file */
+	    // TOP: accept all not-contained groups in the same file
 	    if (item - SYNID_TOP != ssp->inc_tag || contained)
 		return FALSE;
 	}
 	else
 	{
-	    /* CONTAINED: accept all contained groups in the same file */
+	    // CONTAINED: accept all contained groups in the same file
 	    if (item - SYNID_CONTAINED != ssp->inc_tag || !contained)
 		return FALSE;
 	}
 	item = *++list;
 	retval = FALSE;
 	if (item == id)
 	    return retval;
 	if (item >= SYNID_CLUSTER)
 	{
 	    scl_list = SYN_CLSTR(syn_block)[item - SYNID_CLUSTER].scl_list;
-	    /* restrict recursiveness to 30 to avoid an endless loop for a
+	    // restrict recursiveness to 30 to avoid an endless loop for a
-	     * cluster that includes itself (indirectly) */
+	    // cluster that includes itself (indirectly)
 	    if (scl_list != NULL && depth < 30)
 	    {
 		++depth;
 		r = in_id_list(NULL, scl_list, ssp, contained);
 		--depth;
 return !retval;
 }
 struct subcommand
 {
-char    *name;			/* subcommand name */
+char    *name;			// subcommand name
-void    (*func)(exarg_T *, int);	/* function to call */
+void    (*func)(exarg_T *, int);	// function to call
 };
 static struct subcommand subcommands[] =
 {
 {"case",		syn_cmd_case},
 char_u	*subcmd_name;
 int		i;
 syn_cmdlinep = eap->cmdlinep;
-/* isolate subcommand name */
+// isolate subcommand name
 for (subcmd_end = arg; ASCII_ISALPHA(*subcmd_end); ++subcmd_end)
 	;
 subcmd_name = vim_strnsave(arg, (int)(subcmd_end - arg));
 if (subcmd_name != NULL)
 {
-	if (eap->skip)		/* skip error messages for all subcommands */
+	if (eap->skip)		// skip error messages for all subcommands
 	    ++emsg_skip;
 	for (i = 0; ; ++i)
 	{
 	    if (subcommands[i].name == NULL)
 	    {
 	curwin->w_s = ALLOC_ONE(synblock_T);
 	memset(curwin->w_s, 0, sizeof(synblock_T));
 	hash_init(&curwin->w_s->b_keywtab);
 	hash_init(&curwin->w_s->b_keywtab_ic);
 #ifdef FEAT_SPELL
-	/* TODO: keep the spell checking as it was. */
+	// TODO: keep the spell checking as it was.
-	curwin->w_p_spell = FALSE;	/* No spell checking */
+	curwin->w_p_spell = FALSE;	// No spell checking
 	clear_string_option(&curwin->w_s->b_p_spc);
 	clear_string_option(&curwin->w_s->b_p_spf);
 	clear_string_option(&curwin->w_s->b_p_spl);
 #endif
 	clear_string_option(&curwin->w_s->b_syn_isk);
 }
-/* save value of b:current_syntax */
+// save value of b:current_syntax
 old_value = get_var_value((char_u *)"b:current_syntax");
 if (old_value != NULL)
 	old_value = vim_strsave(old_value);
-/* Apply the "syntax" autocommand event, this finds and loads the syntax
+// Apply the "syntax" autocommand event, this finds and loads the syntax
-* file. */
+// file.
 apply_autocmds(EVENT_SYNTAX, eap->arg, curbuf->b_fname, TRUE, curbuf);
-/* move value of b:current_syntax to w:current_syntax */
+// move value of b:current_syntax to w:current_syntax
 new_value = get_var_value((char_u *)"b:current_syntax");
 if (new_value != NULL)
 	set_internal_string_var((char_u *)"w:current_syntax", new_value);
-/* restore value of b:current_syntax */
+// restore value of b:current_syntax
 if (old_value == NULL)
 	do_unlet((char_u *)"b:current_syntax", TRUE);
 else
 {
 	set_internal_string_var((char_u *)"b:current_syntax", old_value);
 }
 static enum
 {
-EXP_SUBCMD,	    /* expand ":syn" sub-commands */
+EXP_SUBCMD,	    // expand ":syn" sub-commands
-EXP_CASE,	    /* expand ":syn case" arguments */
+EXP_CASE,	    // expand ":syn case" arguments
-EXP_SPELL,	    /* expand ":syn spell" arguments */
+EXP_SPELL,	    // expand ":syn spell" arguments
-EXP_SYNC	    /* expand ":syn sync" arguments */
+EXP_SYNC	    // expand ":syn sync" arguments
 } expand_what;
 /*
 * Reset include_link, include_default, include_none to 0.
 * Called when we are done expanding.
 void
 set_context_in_syntax_cmd(expand_T *xp, char_u *arg)
 {
 char_u	*p;
-/* Default: expand subcommands */
+// Default: expand subcommands
 xp->xp_context = EXPAND_SYNTAX;
 expand_what = EXP_SUBCMD;
 xp->xp_pattern = arg;
 include_link = 0;
 include_default = 0;
-/* (part of) subcommand already typed */
+// (part of) subcommand already typed
 if (*arg != NUL)
 {
 	p = skiptowhite(arg);
-	if (*p != NUL)		    /* past first word */
+	if (*p != NUL)		    // past first word
 	{
 	    xp->xp_pattern = skipwhite(p);
 	    if (*skiptowhite(xp->xp_pattern) != NUL)
 		xp->xp_context = EXPAND_NOTHING;
 	    else if (STRNICMP(arg, "case", p - arg) == 0)
 int
 syn_get_id(
 win_T	*wp,
 long	lnum,
 colnr_T	col,
-int		trans,	     /* remove transparency */
+int		trans,	     // remove transparency
-int		*spellp,     /* return: can do spell checking */
+int		*spellp,     // return: can do spell checking
-int		keep_state)  /* keep state of char at "col" */
+int		keep_state)  // keep state of char at "col"
 {
-/* When the position is not after the current position and in the same
+// When the position is not after the current position and in the same
-* line of the same buffer, need to restart parsing. */
+// line of the same buffer, need to restart parsing.
 if (wp->w_buffer != syn_buf
 	    || lnum != current_lnum
 	    || col < current_col)
 	syntax_start(wp, lnum);
 else if (wp->w_buffer == syn_buf
 	    && lnum == current_lnum
 	    && col > current_col)
-	/* next_match may not be correct when moving around, e.g. with the
+	// next_match may not be correct when moving around, e.g. with the
-	 * "skip" expression in searchpair() */
+	// "skip" expression in searchpair()
 	next_match_idx = -1;
 (void)get_syntax_attr(col, spellp, keep_state);
 return (trans ? current_trans_id : current_id);
 int
 syn_get_stack_item(int i)
 {
 if (i >= current_state.ga_len)
 {
-	/* Need to invalidate the state, because we didn't properly finish it
+	// Need to invalidate the state, because we didn't properly finish it
-	 * for the last character, "keep_state" was TRUE. */
+	// for the last character, "keep_state" was TRUE.
 	invalidate_current_state();
 	current_col = MAXCOL;
 	return -1;
 }
 return CUR_STATE(i).si_id;
 syn_get_foldlevel(win_T *wp, long lnum)
 {
 int		level = 0;
 int		i;
-/* Return quickly when there are no fold items at all. */
+// Return quickly when there are no fold items at all.
 if (wp->w_s->b_syn_folditems != 0
 	    && !wp->w_s->b_syn_error
 # ifdef SYN_TIME_LIMIT
 	    && !wp->w_s->b_syn_slow
 # endif
 	    p->pattern = spp->sp_pattern;
 	    ++ga.ga_len;
 	}
 }
-/* Sort on total time. Skip if there are no items to avoid passing NULL
+// Sort on total time. Skip if there are no items to avoid passing NULL
-* pointer to qsort(). */
+// pointer to qsort().
 if (ga.ga_len > 1)
 	qsort(ga.ga_data, (size_t)ga.ga_len, sizeof(time_entry_T),
 							 syn_compare_syntime);
 msg_puts_title(_("  TOTAL      COUNT  MATCH   SLOWEST     AVERAGE   NAME               PATTERN"));
 for (idx = 0; idx < ga.ga_len && !got_int; ++idx)
 {
 	p = ((time_entry_T *)ga.ga_data) + idx;
 	msg_puts(profile_msg(&p->total));
-	msg_puts(" "); /* make sure there is always a separating space */
+	msg_puts(" "); // make sure there is always a separating space
 	msg_advance(13);
 	msg_outnum(p->count);
 	msg_puts(" ");
 	msg_advance(20);
 	msg_outnum(p->match);
 	msg_outtrans(highlight_group_name(p->id - 1));
 	msg_puts(" ");
 	msg_advance(69);
 	if (Columns < 80)
-	    len = 20; /* will wrap anyway */
+	    len = 20; // will wrap anyway
 	else
 	    len = Columns - 70;
 	if (len > (int)STRLEN(p->pattern))
 	    len = (int)STRLEN(p->pattern);
 	msg_outtrans_len(p->pattern, len);
 	msg_puts("\n");
 }
 }
 #endif
-#endif /* FEAT_SYN_HL */
+#endif // FEAT_SYN_HL

Mercurial > vim

comparison src/syntax.c @ 18814:7e7ec935e7c8 v8.1.2395