Lines Matching refs:dp
27 static void printdigraph(digr_T *dp, result_T *previous);
1803 digr_T *dp; in get_digraph_for_char() local
1832 dp = (digr_T *)user_digraphs.ga_data; in get_digraph_for_char()
1834 dp = digraphdefault; in get_digraph_for_char()
1835 for (i = 0; use_defaults ? dp->char1 != NUL in get_digraph_for_char()
1838 if (dp->result == val) in get_digraph_for_char()
1840 r[0] = dp->char1; in get_digraph_for_char()
1841 r[1] = dp->char2; in get_digraph_for_char()
1845 ++dp; in get_digraph_for_char()
1905 digr_T *dp; in getexactdigraph() local
1913 dp = (digr_T *)user_digraphs.ga_data; in getexactdigraph()
1916 if ((int)dp->char1 == char1 && (int)dp->char2 == char2) in getexactdigraph()
1918 retval = dp->result; in getexactdigraph()
1921 ++dp; in getexactdigraph()
1929 dp = digraphdefault; in getexactdigraph()
1930 for (i = 0; dp->char1 != 0; ++i) in getexactdigraph()
1932 if ((int)dp->char1 == char1 && (int)dp->char2 == char2) in getexactdigraph()
1934 retval = dp->result; in getexactdigraph()
1937 ++dp; in getexactdigraph()
2002 digr_T *dp; in registerdigraph() local
2005 dp = (digr_T *)user_digraphs.ga_data; in registerdigraph()
2008 if ((int)dp->char1 == char1 && (int)dp->char2 == char2) in registerdigraph()
2010 dp->result = n; in registerdigraph()
2013 ++dp; in registerdigraph()
2019 dp = (digr_T *)user_digraphs.ga_data + user_digraphs.ga_len; in registerdigraph()
2020 dp->char1 = char1; in registerdigraph()
2021 dp->char2 = char2; in registerdigraph()
2022 dp->result = n; in registerdigraph()
2101 digr_T *dp; in listdigraphs() local
2106 dp = digraphdefault; in listdigraphs()
2107 for (i = 0; dp->char1 != NUL && !got_int; ++i) in listdigraphs()
2113 tmp.char1 = dp->char1; in listdigraphs()
2114 tmp.char2 = dp->char2; in listdigraphs()
2121 if (getexactdigraph(dp->char1, dp->char2, FALSE) == dp->result in listdigraphs()
2122 && (has_mbyte || dp->result <= 255)) in listdigraphs()
2123 printdigraph(dp, use_headers ? &previous : NULL); in listdigraphs()
2125 ++dp; in listdigraphs()
2129 dp = (digr_T *)user_digraphs.ga_data; in listdigraphs()
2137 printdigraph(dp, NULL); in listdigraphs()
2139 ++dp; in listdigraphs()
2146 digraph_getlist_appendpair(digr_T *dp, list_T *l) in digraph_getlist_appendpair() argument
2174 buf[0] = dp->char1; in digraph_getlist_appendpair()
2175 buf[1] = dp->char2; in digraph_getlist_appendpair()
2188 p += (*mb_char2bytes)(dp->result, p); in digraph_getlist_appendpair()
2190 *p++ = (char_u)dp->result; in digraph_getlist_appendpair()
2200 digr_T *dp; in digraph_getlist_common() local
2207 dp = digraphdefault; in digraph_getlist_common()
2208 for (i = 0; dp->char1 != NUL && !got_int; ++i) in digraph_getlist_common()
2213 tmp.char1 = dp->char1; in digraph_getlist_common()
2214 tmp.char2 = dp->char2; in digraph_getlist_common()
2220 if (getexactdigraph(dp->char1, dp->char2, FALSE) == dp->result in digraph_getlist_common()
2221 && (has_mbyte || dp->result <= 255)) in digraph_getlist_common()
2222 digraph_getlist_appendpair(dp, rettv->vval.v_list); in digraph_getlist_common()
2224 ++dp; in digraph_getlist_common()
2228 dp = (digr_T *)user_digraphs.ga_data; in digraph_getlist_common()
2231 digraph_getlist_appendpair(dp, rettv->vval.v_list); in digraph_getlist_common()
2232 ++dp; in digraph_getlist_common()
2270 printdigraph(digr_T *dp, result_T *previous) in printdigraph() argument
2282 if (dp->result != 0) in printdigraph()
2291 && dp->result >= header_table[i].dg_start in printdigraph()
2292 && dp->result < header_table[i + 1].dg_start) in printdigraph()
2297 *previous = dp->result; in printdigraph()
2307 *p++ = dp->char1; in printdigraph()
2308 *p++ = dp->char2; in printdigraph()
2316 if (enc_utf8 && utf_iscomposing(dp->result)) in printdigraph()
2318 p += (*mb_char2bytes)(dp->result, p); in printdigraph()
2321 *p++ = (char_u)dp->result; in printdigraph()
2325 if (char2cells(dp->result) == 1) in printdigraph()
2327 vim_snprintf((char *)p, sizeof(buf) - (p - buf), " %3d", dp->result); in printdigraph()