Lines Matching +defs:cl +defs:key
753 static int spell_mb_isword_class __ARGS((int cl));
4836 char_u ah_key[AH_KEY_LEN]; /* key for hashtab == name of affix */
4849 char_u ci_key[AH_KEY_LEN]; /* key for hashtab == name of compound */
4881 char_u hashkey[6]; /* the hash key, only used while compressing */
4887 wordnode_T *next; /* next node with same hash key */
5568 char_u key[AH_KEY_LEN];
5579 vim_strncpy(key, items[1], AH_KEY_LEN - 1);
5580 hi = hash_find(tp, key);
6251 char_u key[AH_KEY_LEN];
6285 vim_strncpy(key, prevp, p - prevp);
6286 hi = hash_find(&aff->af_comp, key);
6294 STRCPY(ci->ci_key, key);
6780 char_u key[AH_KEY_LEN];
6790 vim_strncpy(key, prevp, p - prevp);
6791 hi = hash_find(&affile->af_pref, key);
6821 char_u key[AH_KEY_LEN];
6830 vim_strncpy(key, prevp, p - prevp);
6831 hi = hash_find(&affile->af_comp, key);
7861 * Make a hash key for the node and its siblings, so that we can quickly
7863 * list, otherwise the hash key would become invalid by the compression.
7878 /* Avoid NUL bytes, it terminates the hash key. */
9896 spell_mb_isword_class(cl)
9897 int cl;
9899 return cl >= 2 && cl != 0x2070 && cl != 0x2080;
13604 int cl = mb_char2len(c);
13610 b = alloc((unsigned)(cl + headcl + 2));
13614 b[cl] = NUL;
13615 mb_char2bytes(headc, b + cl + 1);
13616 b[cl + 1 + headcl] = NUL;