===========================================================
.___ __ __
_________________ __ __ __| _/|__|/ |_
/ ___\_` __ \__ \ | | \/ __ | | \\_ __\
/ /_/ > | \// __ \| | / /_/ | | || |
\___ /|__| (____ /____/\____ | |__||__|
/_____/ \/ \/
grep rough audit - static analysis tool
v2.8 written by @Wireghoul
=================================[justanotherhacker.com]===
urweb-20170720+dfsg/Makefile.am-127- sleep 1
urweb-20170720+dfsg/Makefile.am:128: (curl -s 'http://localhost:8080/Demo/Hello/main' | diff tests/hello.html -) || (kill `cat $(TESTPID)`; echo "Test 'Hello' failed"; /bin/false)
urweb-20170720+dfsg/Makefile.am:129: (curl -s 'http://localhost:8080/Demo/Crud1/create?A=1&B=2&C=3&D=4' | diff tests/crud1.html -) || (kill `cat $(TESTPID)`; echo "Test 'Crud1' failed"; /bin/false)
urweb-20170720+dfsg/Makefile.am:130: kill `cat $(TESTPID)`
urweb-20170720+dfsg/Makefile.am-131- if (ifconfig lo | grep -q inet6); \
##############################################
urweb-20170720+dfsg/Makefile.am-137- sleep 1; \
urweb-20170720+dfsg/Makefile.am:138: (curl -g -6 -s 'http://[::1]:8080/Demo/Hello/main' | diff tests/hello.html -) || (kill `cat $(TESTPID)`; echo "Test 'Hello' failed"; /bin/false); \
urweb-20170720+dfsg/Makefile.am:139: (curl -g -6 -s 'http://[::1]:8080/Demo/Crud1/create?A=1&B=2&C=3&D=4' | diff tests/crud1.html -) || (kill `cat $(TESTPID)`; echo "Test 'Crud1' failed"; /bin/false); \
urweb-20170720+dfsg/Makefile.am:140: kill `cat $(TESTPID)`; \
urweb-20170720+dfsg/Makefile.am-141- else \
##############################################
urweb-20170720+dfsg/doc/manual.tex-996-
urweb-20170720+dfsg/doc/manual.tex:997:We presuppose the existence of a function $\mathcal O$, where $\mathcal O(M, \overline{s})$ implements the $\mt{open}$ declaration by producing a context with the appropriate entry for each available component of module $M$ with signature items $\overline{s}$. Where possible, $\mathcal O$ uses ``transparent'' entries (e.g., an abstract type $M.x$ is mapped to $x :: \mt{Type} = M.x$), so that the relationship with $M$ is maintained. A related function $\mathcal O_c$ builds a context containing the disjointness constraints found in $\overline s$.
urweb-20170720+dfsg/doc/manual.tex:998:We write $\kappa_1^n \to \kappa$ as a shorthand, where $\kappa_1^0 \to \kappa = \kappa$ and $\kappa_1^{n+1} \to \kappa_2 = \kappa_1 \to (\kappa_1^n \to \kappa_2)$. We write $\mt{len}(\overline{y})$ for the length of vector $\overline{y}$ of variables.
urweb-20170720+dfsg/doc/manual.tex-999-
##############################################
urweb-20170720+dfsg/doc/manual.tex-2395-
urweb-20170720+dfsg/doc/manual.tex:2396:A web application is built from a series of modules, with one module, the last one appearing in the \texttt{.urp} file, designated as the main module. The signature of the main module determines the URL entry points to the application. Such an entry point should have type $\mt{t1} \to \ldots \to \mt{tn} \to \mt{transaction} \; \mt{page}$, for any integer $n \geq 0$, where $\mt{page}$ is a type synonym for top-level HTML pages, defined in $\mt{Basis}$. If such a function is at the top level of main module $M$, with $n = 0$, it will be accessible at URI \texttt{/M/f}, and so on for more deeply nested functions, as described in Section \ref{tag} below. See Section \ref{cl} for information on the \texttt{prefix} and \texttt{rewrite url} directives, which can be used to rewrite the default URIs of different entry point functions. The final URL of a function is its default module-based URI, with \texttt{rewrite url} rules applied, and with the \texttt{prefix} prepended. Arguments to an entry-point function are deserialized from the part of the URI following \texttt{f}.
urweb-20170720+dfsg/doc/manual.tex-2397-
##############################################
urweb-20170720+dfsg/doc/manual.tex-2433-
urweb-20170720+dfsg/doc/manual.tex:2434:A task kind names a particular extension point of generated applications, where the type parameter of a task kind describes which extra input data is available at that extension point. Add task code with the special declaration form $\mt{task} \; e_1 = e_2$, where $e_1$ is a task kind with data $\tau$, and $e_2$ is a function from $\tau$ to $\mt{transaction} \; \mt{unit}$.
urweb-20170720+dfsg/doc/manual.tex-2435-
##############################################
urweb-20170720+dfsg/m4/ax_check_openssl.m4-55- if test x"$PKG_CONFIG" != x""; then
urweb-20170720+dfsg/m4/ax_check_openssl.m4:56: OPENSSL_LDFLAGS=`$PKG_CONFIG openssl --libs-only-L 2>/dev/null`
urweb-20170720+dfsg/m4/ax_check_openssl.m4-57- if test $? = 0; then
urweb-20170720+dfsg/m4/ax_check_openssl.m4:58: OPENSSL_LIBS=`$PKG_CONFIG openssl --libs-only-l 2>/dev/null`
urweb-20170720+dfsg/m4/ax_check_openssl.m4:59: OPENSSL_INCLUDES=`$PKG_CONFIG openssl --cflags-only-I 2>/dev/null`
urweb-20170720+dfsg/m4/ax_check_openssl.m4-60- found=true
##############################################
urweb-20170720+dfsg/tests/dbupload2.sh-4-
urweb-20170720+dfsg/tests/dbupload2.sh:5:cd `dirname $0`
urweb-20170720+dfsg/tests/dbupload2.sh-6-
##############################################
urweb-20170720+dfsg/.pc/doc-letterpaper.diff/doc/manual.tex-995-
urweb-20170720+dfsg/.pc/doc-letterpaper.diff/doc/manual.tex:996:We presuppose the existence of a function $\mathcal O$, where $\mathcal O(M, \overline{s})$ implements the $\mt{open}$ declaration by producing a context with the appropriate entry for each available component of module $M$ with signature items $\overline{s}$. Where possible, $\mathcal O$ uses ``transparent'' entries (e.g., an abstract type $M.x$ is mapped to $x :: \mt{Type} = M.x$), so that the relationship with $M$ is maintained. A related function $\mathcal O_c$ builds a context containing the disjointness constraints found in $\overline s$.
urweb-20170720+dfsg/.pc/doc-letterpaper.diff/doc/manual.tex:997:We write $\kappa_1^n \to \kappa$ as a shorthand, where $\kappa_1^0 \to \kappa = \kappa$ and $\kappa_1^{n+1} \to \kappa_2 = \kappa_1 \to (\kappa_1^n \to \kappa_2)$. We write $\mt{len}(\overline{y})$ for the length of vector $\overline{y}$ of variables.
urweb-20170720+dfsg/.pc/doc-letterpaper.diff/doc/manual.tex-998-
##############################################
urweb-20170720+dfsg/.pc/doc-letterpaper.diff/doc/manual.tex-2394-
urweb-20170720+dfsg/.pc/doc-letterpaper.diff/doc/manual.tex:2395:A web application is built from a series of modules, with one module, the last one appearing in the \texttt{.urp} file, designated as the main module. The signature of the main module determines the URL entry points to the application. Such an entry point should have type $\mt{t1} \to \ldots \to \mt{tn} \to \mt{transaction} \; \mt{page}$, for any integer $n \geq 0$, where $\mt{page}$ is a type synonym for top-level HTML pages, defined in $\mt{Basis}$. If such a function is at the top level of main module $M$, with $n = 0$, it will be accessible at URI \texttt{/M/f}, and so on for more deeply nested functions, as described in Section \ref{tag} below. See Section \ref{cl} for information on the \texttt{prefix} and \texttt{rewrite url} directives, which can be used to rewrite the default URIs of different entry point functions. The final URL of a function is its default module-based URI, with \texttt{rewrite url} rules applied, and with the \texttt{prefix} prepended. Arguments to an entry-point function are deserialized from the part of the URI following \texttt{f}.
urweb-20170720+dfsg/.pc/doc-letterpaper.diff/doc/manual.tex-2396-
##############################################
urweb-20170720+dfsg/.pc/doc-letterpaper.diff/doc/manual.tex-2432-
urweb-20170720+dfsg/.pc/doc-letterpaper.diff/doc/manual.tex:2433:A task kind names a particular extension point of generated applications, where the type parameter of a task kind describes which extra input data is available at that extension point. Add task code with the special declaration form $\mt{task} \; e_1 = e_2$, where $e_1$ is a task kind with data $\tau$, and $e_2$ is a function from $\tau$ to $\mt{transaction} \; \mt{unit}$.
urweb-20170720+dfsg/.pc/doc-letterpaper.diff/doc/manual.tex-2434-