OXIESEC PANEL
- Current Dir:
/
/
home
/
cubot
/
bin
/
etl
Server IP: 139.59.38.164
Upload:
Create Dir:
Name
Size
Modified
Perms
📁
..
-
02/03/2023 08:06:37 AM
rwxr-xr-x
📄
config.pl
6.53 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
dataextract.sh
2.51 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
etl.pl
5.46 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
etlproc
11.81 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
func.pl
4.01 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
globvar.sh
330 bytes
02/03/2023 07:34:08 AM
rw-r--r--
📄
initetl.pl
1.88 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
libawk.awk
3.07 KB
02/03/2023 07:34:08 AM
rw-r--r--
📄
makeXtab2NormalExcel.pl
5.25 KB
02/03/2023 07:34:08 AM
rw-r--r--
📄
process.pl
6.92 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
process_changed.pl
5.69 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
readwrite.pl
4.16 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
rxcsv.pl
7.94 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
rxdb.pl
8.84 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
rxfile.pl
4.72 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
rxsalesforce.pl
3.33 KB
02/03/2023 07:34:08 AM
rw-r--r--
📄
rxsalesforce.pl.bak
3.33 KB
02/03/2023 07:34:08 AM
rw-r--r--
📄
rxxml.pl
12.66 KB
02/03/2023 07:34:08 AM
rw-r--r--
📄
rxxml2.pl
4.18 KB
02/03/2023 07:34:08 AM
rw-r--r--
📄
s.log
8.86 KB
02/03/2023 07:34:08 AM
rw-r--r--
📄
sendmail.pl
1.06 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
sourcequery.pl
4.17 KB
02/03/2023 07:34:08 AM
rw-r--r--
📄
sql.pl
13.89 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
sql_mssql.pl
13.89 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
store.pl
7.6 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
task.pl
30.55 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
task_mssql.pl
30.8 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
tmpxml.pl
1.49 KB
02/03/2023 07:34:08 AM
rw-r--r--
📄
userfunc.pl
5.5 KB
02/03/2023 07:34:08 AM
rw-r--r--
📄
valid.pl
3.9 KB
02/03/2023 07:34:08 AM
rw-r--r--
📄
workflow.pl
3.72 KB
02/03/2023 07:34:08 AM
rwxr-xr-x
📄
xform.pl
2.62 KB
02/03/2023 07:34:08 AM
rw-r--r--
Editing: libawk.awk
Close
function ltrim(s) { sub(/^ */, "", s); return s; } function rtrim(s) { sub(/ *$/, "", s); return s; } function trim(s) { return rtrim(ltrim(s)); } function basename(s, p) { while ((p=index(s,"/")) != 0) { s = substr(s, p+1); } return s; } # bin2dec(binary_string), returns decimal equivalent # ex: bin2dec("10011001") -> 153 # function bin2dec(b, n,i,d) { n = length(b) d = 0 for (i=1; i<=n; i++) { d += d # d = d*2 if (substr(b, i, 1) == "1") d++ } return d } # dec2bin(decimal_integer), returns the equivalent binary string # ex: dec2bin(202) -> 11001010 function dec2bin(d, b) { do { b = "" d%2 b d = int(d/2) } while (d); return b } function bubble_sort(arr, a, b, i,done,t) { i = a done = 1 for (;;) { if (i == b) { if (done) break i = a done = 1 } if (arr[i] > arr[i+1]) { t = arr[i] arr[i] = arr[i+1] arr[i+1] = t done = 0 } i = i+1 } } # invoke: n=xx; r=yy; comb(1,1) # n>=r, n: total; r: dim of each given combination # a[1..r] permuted index: i.e. a[1..r] maps into a combination of 1..r # function comb(j, k, i,top) { if (j <= r) { top = n-r+j for (i=k; i<= top; i++) { a[j] = i comb(j+1, i+1) } } else { for (i=1; i<=r; i++) printf "%d ", c[a[i]] printf "\n" } } function dirname(s, p,p0) { p0 = 0 for (;;) { p = index(substr(s,p0+1),"/") if (p == 0) break p0 += p } if (p0 == 0) return "." if (p0 == 1) return "/" return substr(s,1,p0-1) } function expandN(cur, M, a,n,i,s) { n = split(cur,a,"") for (i=1;i<=n;i++) { if (a[i] == "\t") { s = s "" sprintf("%*s", M-(length(s)%M), "") } else { s = s "" a[i] } } return s } function expand(cur) { return expandN(cur,8) } function factorial(n, i, f) { f = n while (--n > 1) f *= n return f } # returns decimal value of hex string S, or -1 on invalid input # function hex2dec(s, n,i,j,h) { s = tolower(s) n = length(s) for (i=1; i<=n; i++) { j = index("0123456789abcdef", substr(s, i, 1)) if (j == 0) return -1; h = h*16 + j-1 } return h } # returns hexstring representation of decimal N # function dec2hex(n, hex) { do { #hex = substr("0123456789abcdef", n%16+1, 1) hex hex = substr("0123456789ABCDEF", n%16+1, 1) hex n = int(n/16) } while (n) return hex } # joins A[1..n] into a SEP separated string function join(A,n,sep, s, i) { s=A[1] for (i=2; i<=n; i++) s = s sep A[i] return s; } function quick_sort(arr, a, b, pivot,i,j,t) { if (a >= b) return ; if (a+1 == b) { if (arr[a] > arr[b]) { t = arr[a] arr[a] = arr[b] arr[b] = t } return } pivot = median(arr[a], arr[b], arr[int((a+b)/2)]) i = a-1; j = b+1; for (;;) { while (arr[++i] < pivot) ; while (arr[--j] > pivot) ; if (i>=j) break t = arr[i] arr[i] = arr[j] arr[j] = t } quick_sort(arr, a, i-1) quick_sort(arr, i, b) } function median(a, b, c) { if (a<b) { if (b<c) return c; if (a<c) return c; return a; } if (a<c) return c; if (b<c) return c; return b; }