Return to autoexec.c CVS log

Up to [local] / src / usr.bin / mg

Annotation of src/usr.bin/mg/autoexec.c, Revision 1.16

1.16    ! bcallah     1: /* $OpenBSD: autoexec.c,v 1.15 2014/10/11 03:03:44 doug Exp $ */
1.1       vincent     2: /* this file is in the public domain */
                      3: /* Author: Vincent Labrecque <vincent@openbsd.org>     April 2002 */
                      4:
1.16    ! bcallah     5: #include <sys/queue.h>
        !             6: #include <fnmatch.h>
        !             7: #include <signal.h>
        !             8: #include <stdio.h>
        !             9: #include <stdlib.h>
        !            10: #include <string.h>
        !            11:
1.1       vincent    12: #include "def.h"
                     13: #include "funmap.h"
                     14:
                     15: struct autoexec {
                     16:        SLIST_ENTRY(autoexec) next;     /* link in the linked list */
                     17:        const char      *pattern;       /* Pattern to match to filenames */
                     18:        PF               fp;
                     19: };
                     20:
                     21: static SLIST_HEAD(, autoexec)   autos;
                     22: static int                      ready;
                     23:
1.11      kjell      24:
                     25: #define AUTO_GROW 8
1.1       vincent    26: /*
                     27:  * Return a NULL terminated array of function pointers to be called
                     28:  * when we open a file that matches <fname>.  The list must be free(ed)
                     29:  * after use.
                     30:  */
                     31: PF *
                     32: find_autoexec(const char *fname)
                     33: {
1.6       db         34:        PF              *pfl, *npfl;
                     35:        int              have, used;
1.1       vincent    36:        struct autoexec *ae;
                     37:
                     38:        if (!ready)
                     39:                return (NULL);
                     40:
                     41:        pfl = NULL;
                     42:        have = 0;
                     43:        used = 0;
                     44:        SLIST_FOREACH(ae, &autos, next) {
                     45:                if (fnmatch(ae->pattern, fname, 0) == 0) {
                     46:                        if (used >= have) {
1.15      doug       47:                                npfl = reallocarray(pfl, have + AUTO_GROW + 1,
1.11      kjell      48:                                    sizeof(PF));
1.3       vincent    49:                                if (npfl == NULL)
1.1       vincent    50:                                        panic("out of memory");
1.3       vincent    51:                                pfl = npfl;
1.11      kjell      52:                                have += AUTO_GROW;
1.1       vincent    53:                        }
                     54:                        pfl[used++] = ae->fp;
                     55:                }
                     56:        }
1.13      deraadt    57:        if (used)
1.1       vincent    58:                pfl[used] = NULL;
1.11      kjell      59:
1.1       vincent    60:        return (pfl);
                     61: }
                     62:
                     63: int
                     64: add_autoexec(const char *pattern, const char *func)
                     65: {
1.9       deraadt    66:        PF               fp;
1.1       vincent    67:        struct autoexec *ae;
                     68:
                     69:        if (!ready) {
                     70:                SLIST_INIT(&autos);
                     71:                ready = 1;
                     72:        }
                     73:        fp = name_function(func);
                     74:        if (fp == NULL)
                     75:                return (FALSE);
1.6       db         76:        ae = malloc(sizeof(*ae));
1.1       vincent    77:        if (ae == NULL)
                     78:                return (FALSE);
                     79:        ae->fp = fp;
                     80:        ae->pattern = strdup(pattern);
                     81:        if (ae->pattern == NULL) {
                     82:                free(ae);
                     83:                return (FALSE);
                     84:        }
                     85:        SLIST_INSERT_HEAD(&autos, ae, next);
                     86:
                     87:        return (TRUE);
                     88: }
                     89:
1.14      kjell      90: /*
                     91:  * Register an auto-execute hook; that is, specify a filename pattern
                     92:  * (conforming to the shell's filename globbing rules) and an associated
                     93:  * function to execute when a file matching the specified pattern
                     94:  * is read into a buffer.
                     95: */
1.10      kjell      96: /* ARGSUSED */
1.1       vincent    97: int
                     98: auto_execute(int f, int n)
                     99: {
1.6       db        100:        char    patbuf[128], funcbuf[128], *patp, *funcp;
                    101:        int     s;
1.2       deraadt   102:
1.8       kjell     103:        if ((patp = eread("Filename pattern: ", patbuf, sizeof(patbuf),
                    104:            EFNEW | EFCR)) == NULL)
1.6       db        105:                return (ABORT);
1.4       vincent   106:        else if (patp[0] == '\0')
1.6       db        107:                return (FALSE);
1.8       kjell     108:        if ((funcp = eread("Execute: ", funcbuf, sizeof(funcbuf),
1.12      kjell     109:            EFNEW | EFCR | EFFUNC)) == NULL)
1.6       db        110:                return (ABORT);
1.4       vincent   111:        else if (funcp[0] == '\0')
1.6       db        112:                return (FALSE);
1.4       vincent   113:        if ((s = add_autoexec(patp, funcp)) != TRUE)
1.1       vincent   114:                return (s);
                    115:        return (TRUE);
                    116: }