Lines Matching defs:prefix
261 /* Special case for 1 match (prefix is whole word) */
703 * Find longest common prefix
912 #define XF_ARG 1 /* command takes number prefix */
914 #define XF_PREFIX 4 /* function sets prefix */
927 CT_COMPLETE, /* complete to longest prefix */
2462 x_bind_showone(int prefix, int key)
2464 unsigned char f = XFUNC_VALUE(x_tab[prefix][key]);
2475 switch (prefix) {
2488 if (x_tab[prefix][key] & 0x80)
2497 const unsigned char *cp = (const void *)x_atab[prefix][key];
2525 int prefix, key;
2527 for (prefix = 0; prefix < X_NTABS; prefix++)
2529 switch (XFUNC_VALUE(x_tab[prefix][key])) {
2534 x_bind_showone(prefix, key);
2571 int prefix, key;
2578 prefix = 0;
2587 x_bind_showone(prefix, key);
2590 switch (XFUNC_VALUE(x_tab[prefix][key])) {
2592 prefix = 1;
2596 prefix = 2;
2600 prefix = 3;
2638 if (XFUNC_VALUE(x_tab[prefix][key]) == XFUNC_ins_string)
2639 afree(x_atab[prefix][key], AEDIT);
2640 x_atab[prefix][key] = ms;
2644 x_tab[prefix][key] = c;
2648 x_bound[(prefix * X_TABSZ + key) / 8] &=
2649 ~(1 << ((prefix * X_TABSZ + key) % 8));
2651 x_bound[(prefix * X_TABSZ + key) / 8] |=
2652 (1 << ((prefix * X_TABSZ + key) % 8));
2851 * longest prefix, implying the latter is at least
3087 /* strip command prefix */
3548 #define VARG1 1 /* digit prefix (first, eg, 5l) */
3550 #define VARG2 3 /* digit prefix (second, eg, 2c3l) */