Lines Matching defs:child
53 int child;
348 m += s[n].ch[s[n].child - 1].name_length;
369 int w = s[n].child - 1;
378 * deduct this child's instance weight from his antecdents to track
383 s[n].ch[s[n].child - 1].child_agg -= (int)instances;
477 /* gets set if any child COULD match needle if it went on */
499 * "credible" means at least one child matches
509 * knowledge this child is not on the
590 } /* for each child */
804 * the child we definitely got past, and present the first n terminal
811 * child into for when we come back up the walk.
831 s[sp].child = 1;
842 struct ch *tch = &s[sp].ch[s[sp].child - 1];
895 s[sp - 1].ch[s[sp - 1].child - 1].effpos;
921 while (sp >= 0 && s[sp].child >= s[sp].child_count) {
939 if (s[n].child < s[n].child_count &&
940 s[n].ch[s[n].child - 1].child_agg <
941 s[n].ch[s[n].child].child_agg) {
954 child_ofs = (off_t)s[sp].ch[s[sp].child++].ofs;
964 child_ofs = (off_t)s[sp].ch[s[sp].child++].ofs;