Lines Matching +defs:new +defs:state
102 PLAN *new;
104 if ((new = malloc(sizeof(PLAN))) == NULL)
106 new->execute = option->execute;
107 new->flags = option->flags;
108 new->next = NULL;
109 return new;
285 PLAN *new;
290 new = palloc(option);
291 new->t_data = find_parsenum(new, option->name, nmins, NULL);
292 TIME_CORRECT(new);
293 return new;
331 PLAN *new;
336 new = palloc(option);
337 new->t_data = find_parsetime(new, option->name, value);
338 if (!(new->flags & F_EXACTTIME) && !COMPAT_MODE("bin/find", "unix2003"))
339 TIME_CORRECT(new);
340 return new;
356 PLAN *new;
363 new = palloc(option);
365 maxdepth = find_parsenum(new, option->name, dstr, NULL);
367 mindepth = find_parsenum(new, option->name, dstr, NULL);
368 return new;
571 PLAN *new;
574 new = palloc(option);
577 if (str && !(new->flags & F_DEPTH)) {
585 new->flags |= F_DEPTH;
588 if (new->flags & F_DEPTH) { /* -depth n */
592 new->d_data = find_parsenum(new, option->name, ndepth, NULL);
597 return new;
740 PLAN *new; /* node returned */
751 new = palloc(option);
760 new->flags |= F_EXECPLUS;
769 if (new->flags & F_EXECPLUS) {
770 new->e_ppos = new->e_pbnum = cnt - 2;
779 new->e_pnummax = argmax / 16;
780 argmax -= sizeof(char *) * new->e_pnummax;
783 new->e_psizemax = argmax;
784 new->e_pbsize = 0;
785 cnt += new->e_pnummax + 1;
786 new->e_next = lastexecplus;
787 lastexecplus = new;
789 if ((new->e_argv = malloc(cnt * sizeof(char *))) == NULL)
791 if ((new->e_orig = malloc(cnt * sizeof(char *))) == NULL)
793 if ((new->e_len = malloc(cnt * sizeof(int))) == NULL)
797 new->e_orig[cnt] = *argv;
798 if (new->flags & F_EXECPLUS)
799 new->e_pbsize += strlen(*argv) + 1;
801 if (!(new->flags & F_EXECPLUS) && p[0] == '{' &&
803 if ((new->e_argv[cnt] =
806 new->e_len[cnt] = MAXPATHLEN;
810 new->e_argv[cnt] = *argv;
811 new->e_len[cnt] = 0;
814 if (new->flags & F_EXECPLUS) {
815 new->e_psize = new->e_pbsize;
817 for (i = 0; i < new->e_pnummax; i++) {
818 new->e_argv[cnt] = NULL;
819 new->e_len[cnt] = 0;
825 new->e_argv[cnt] = new->e_orig[cnt] = NULL;
828 return new;
865 PLAN *new;
871 new = palloc(option);
874 new->flags |= F_ATLEAST;
877 new->flags |= F_ANY;
883 new->fl_flags = flags;
884 new->fl_notflags = notflags;
885 return new;
973 PLAN *new;
978 new = palloc(option);
982 new->flags |= F_MTFLAG;
983 new->mt_data = MNT_LOCAL;
984 return new;
989 new->flags |= F_MTFLAG;
990 new->mt_data = MNT_RDONLY;
991 return new;
996 new->flags |= F_MTTYPE;
997 new->c_data = fsname;
998 return new;
1018 PLAN *new;
1025 new = palloc(option);
1034 gid = find_parsenum(new, option->name, cp, NULL);
1038 new->g_data = gid;
1039 return new;
1057 PLAN *new;
1062 new = palloc(option);
1063 new->i_data = find_parsenum(new, option->name, inum_str, NULL);
1064 return new;
1078 PLAN *new;
1084 new = palloc(option);
1087 new->i_data = sb.st_ino;
1088 return new;
1106 PLAN *new;
1111 new = palloc(option);
1112 new->l_data = (nlink_t)find_parsenum(new, option->name, nlinks, NULL);
1113 return new;
1165 PLAN *new;
1168 new = palloc(option);
1169 new->c_data = pattern;
1170 return new;
1197 PLAN *new;
1203 new = palloc(option);
1206 new->t_data = get_date(fn_or_tspec);
1207 if (new->t_data == (time_t) -1)
1213 new->t_data = sb.st_ctime;
1215 new->t_data = sb.st_atime;
1217 new->t_data = sb.st_birthtime;
1219 new->t_data = sb.st_mtime;
1221 return new;
1306 PLAN *new;
1312 new = palloc(option);
1315 new->flags |= F_ATLEAST;
1319 new->flags |= F_ANY;
1328 new->m_data = getmode(set, 0);
1330 return new;
1427 PLAN *new;
1446 new = palloc(option);
1447 new->re_data = pre;
1449 return new;
1485 PLAN *new;
1492 new = palloc(option);
1494 new->o_data = find_parsenum(new, option->name, size_str, &endch);
1522 if (new->o_data > QUAD_MAX / scale)
1525 new->o_data *= scale;
1527 return new;
1547 PLAN *new;
1585 new = palloc(option);
1586 new->m_data = mask;
1587 return new;
1607 PLAN *new;
1614 new = palloc(option);
1623 uid = find_parsenum(new, option->name, cp, NULL);
1627 new->u_data = uid;
1628 return new;
1654 int state = 0;
1657 p && (state = (p->execute)(p, entry)); p = p->next);
1658 return state;
1701 int state = 0;
1704 p && (state = (p->execute)(p, entry)); p = p->next);
1705 return !state;
1720 int state = 0;
1723 p && (state = (p->execute)(p, entry)); p = p->next);
1725 if (state)
1729 p && (state = (p->execute)(p, entry)); p = p->next);
1730 return state;