Benchmarking a malloc/free implementation

[durand]

I've been experimenting with benchmarking a malloc/free implementation lately and I've stumbled across the attached gawk script which really does a good job of it.

Please find it in the next message. I can't attach anything for some reason. oh well.

[durand]

Code: Select all

# Contributed by Eiso AB <eisoi REMOVETHISWORD (at) chem (dot) rug (dot) nl>

        
BEGIN {
        Switch["123"] = " abc "
        Switch["82"] = " def "
        Switch["985"] = " ghi "
        Switch["20"] = " jkl "
        Switch["1098"] = " mno "
        Switch["3874"] = " pqr "
        Switch["272"] = " stu "
        
        Switch_R["123"] = " 123 "
        Switch_R["82"] = " 82 "
        Switch_R["985"] = " 985 "
        Switch_R["20"] = " 20 "
        Switch_R["1098"] = " 1098 "
        Switch_R["3874"] = " 3874 "
        Switch_R["272"] = " 272 "
        
        for (i=0; i <30000; i++)
        {
                s1 = s2 = s3 = " 123 82 985 20 1098 3874 272 "

                if ( (i % 100) == 0 )
                        print "Doing " i "\n";
                
                for (j in Switch)
                {                        
                        # Manually doing a gsub
                        while (match(s1, j))
                                s1 = substr(s1, 1, RSTART-1) Switch[j] substr(s1, RSTART+RLENGTH)
                
                        # Use gsub
                        gsub(j, Switch[j], s2)
        
                        # gsub, and prevent RE recompile
                        gsub(Switch_R[j], Switch[j], s3)
                }
        }
}