83   ptrdiff_t depth;		/* Depth of this node from the root.  */
84   ptrdiff_t shift;		/* Shift function for search failures.  */
85   ptrdiff_t maxshift;		/* Max shift of self and descendants.  */
92   ptrdiff_t words;		/* Number of words in the trie.  */
94   ptrdiff_t mind;		/* Minimum depth of an accepting node.  */
95   ptrdiff_t maxd;		/* Maximum depth of any node.  */
99   ptrdiff_t *shift;		/* Used in Boyer-Moore search for one
124   ptrdiff_t (*kwsexec) (kwset_t, char const *, ptrdiff_t,
135 static ptrdiff_t acexec (kwset_t, char const *, ptrdiff_t,
137 static ptrdiff_t bmexec (kwset_t, char const *, ptrdiff_t,
173 kwsincr (kwset_t kwset, char const *text, ptrdiff_t len)  in kwsincr()
198       ptrdiff_t depth = 1;  in kwsincr()
322 ptrdiff_t
381 treedelta (struct tree const *tree, ptrdiff_t depth, unsigned char delta[])  in treedelta()
426   ptrdiff_t i;  in kwsprep()
593                   ptrdiff_t len,  in bm_delta2_search()
598   ptrdiff_t d = len, skip = 0;  in bm_delta2_search()
602       ptrdiff_t i = 2;  in bm_delta2_search()
641 memchr_kwset (char const *s, ptrdiff_t n, kwset_t kwset)  in memchr_kwset()
667 static inline ptrdiff_t _GL_ATTRIBUTE_PURE
668 bmexec_trans (kwset_t kwset, char const *text, ptrdiff_t size)  in bmexec_trans()
674   ptrdiff_t len = kwset->mind;  in bmexec_trans()
694   ptrdiff_t len12;  in bmexec_trans()
753 static ptrdiff_t
754 bmexec (kwset_t kwset, char const *text, ptrdiff_t size,  in bmexec()
759   ptrdiff_t ret = (IGNORE_DUPLICATE_BRANCH_WARNING  in bmexec()
775 static inline ptrdiff_t
776 acexec_trans (kwset_t kwset, char const *text, ptrdiff_t len,  in acexec_trans()
901 static ptrdiff_t
902 acexec (kwset_t kwset, char const *text, ptrdiff_t size,  in acexec()
920 ptrdiff_t
921 kwsexec (kwset_t kwset, char const *text, ptrdiff_t size,  in kwsexec()