aboutsummaryrefslogtreecommitdiffstats
path: root/test
diff options
context:
space:
mode:
authorArnold D. Robbins <arnold@skeeve.com>2017-04-04 21:53:44 +0300
committerArnold D. Robbins <arnold@skeeve.com>2017-04-04 21:53:44 +0300
commit070c57daec076e780e81d8b1011a02ea8ac8915f (patch)
tree96d4c7747e2f29398b23cdcc550d92f8d4417439 /test
parent4271b995d64430e794e344f0c4985162eb991052 (diff)
downloadegawk-070c57daec076e780e81d8b1011a02ea8ac8915f.tar.gz
egawk-070c57daec076e780e81d8b1011a02ea8ac8915f.tar.bz2
egawk-070c57daec076e780e81d8b1011a02ea8ac8915f.zip
fixes for memory leak for user-supplied sorting function.
Diffstat (limited to 'test')
-rw-r--r--test/memleak.awk20
1 files changed, 20 insertions, 0 deletions
diff --git a/test/memleak.awk b/test/memleak.awk
new file mode 100644
index 00000000..3937658f
--- /dev/null
+++ b/test/memleak.awk
@@ -0,0 +1,20 @@
+# This program doesn't do anything except allow us to
+# check for memory leak from using a user-supplied
+# sorting function.
+#
+# From Andrew Schorr.
+
+function my_func(i1, v1, i2, v2) {
+ return v2-v1
+}
+
+BEGIN {
+ a[1] = "3"
+ a[2] = "2"
+ a[3] = "4"
+ for (i = 0; i < 10000; i++) {
+ n = asort(a, b, "my_func")
+ s += n
+ }
+ print s
+}