ES2 MUD LIB :: 東方故事二(ES2) 天朝帝國 mudlib 瀏覽展示

/*  profiled.c

    Copyright (C) 1994-2000 Annihilator 

    This program is a part of ES2 mudlib. Permission is granted to use,
    modify, copy or distribute this program provided this copyright notice
    remains intact and subject to the restriction that this program MAY
    NOT be used in any way for monetary gain.

    Details of terms and conditions is available in the Copyright.ES2 file.
    If you don't receive this file along with this program, write to the
    primary author of ES2 mudlib: Annihilator 
*/

#define MAX_ENTRIES 500

mapping command_log;
int overflowed_log;

string sorting_by;

void
create()
{
    seteuid(getuid());

    command_log = allocate_mapping(MAX_ENTRIES);
    overflowed_log = 0;
}

void
log_command(string entry, int mem, int stime, int utime)
{
    if( !undefinedp(command_log[entry]) ) {
        command_log[entry]["count"] ++;
        command_log[entry]["mem"] += mem;
        command_log[entry]["stime"] += stime;
        command_log[entry]["utime"] += utime;
    } else if( sizeof(command_log) <= MAX_ENTRIES ) {
        command_log[entry] = ([
            "count" : 1,
            "mem"   : mem,
            "stime" : stime,
            "utime" : utime
        ]);
    } else
        overflowed_log++;
}

void
make_profile(string sort_by)
{
    int i;
    string *entry, msg;

    entry = keys(command_log);
    sorting_by = sort_by;
    
    if( !stringp(sort_by) )
entry = sort_array(entry, 1);
    else
entry = sort_array(entry, "sort_entry", this_object() );

    msg = "名稱           次數           記憶體         系統時間       使用者時間\n";
    for(i=0; i         msg += sprintf("%-15s%-15d%-15d%-15d%-15d\n", entry[i],
            command_log[entry[i]]["count"],
            command_log[entry[i]]["mem"],
            command_log[entry[i]]["stime"],
            command_log[entry[i]]["utime"]);
    rm("/PROFILE");
    write_file("/PROFILE", msg);
}

int
sort_entry(string entry1, string entry2)
{
    if( command_log[entry1][sorting_by] < command_log[entry2][sorting_by]) return 1;
    else if( command_log[entry1][sorting_by] > command_log[entry2][sorting_by]) return -1;
    return 0;
}