Annotation of driverkit/tests/malloctest.c, revision 1.1

1.1     ! root        1: /*
        !             2:  * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
        !             3:  *
        !             4:  * @APPLE_LICENSE_HEADER_START@
        !             5:  * 
        !             6:  * Portions Copyright (c) 1999 Apple Computer, Inc.  All Rights
        !             7:  * Reserved.  This file contains Original Code and/or Modifications of
        !             8:  * Original Code as defined in and that are subject to the Apple Public
        !             9:  * Source License Version 1.1 (the "License").  You may not use this file
        !            10:  * except in compliance with the License.  Please obtain a copy of the
        !            11:  * License at http://www.apple.com/publicsource and read it before using
        !            12:  * this file.
        !            13:  * 
        !            14:  * The Original Code and all software distributed under the License are
        !            15:  * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
        !            16:  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
        !            17:  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
        !            18:  * FITNESS FOR A PARTICULAR PURPOSE OR NON- INFRINGEMENT.  Please see the
        !            19:  * License for the specific language governing rights and limitations
        !            20:  * under the License.
        !            21:  * 
        !            22:  * @APPLE_LICENSE_HEADER_END@
        !            23:  */
        !            24: /*
        !            25:  * malloc() timing test using uxpr.
        !            26:  */
        !            27: 
        !            28: #import <bsd/libc.h> 
        !            29: #import <driverkit/debugging.h>
        !            30: 
        !            31: static void usage(char **argv);
        !            32: 
        !            33: int num_loops=10;
        !            34: char *foobar;
        !            35: 
        !            36: int main(int argc, char **argv)
        !            37: {
        !            38:        int arg;
        !            39:        int loop;
        !            40:        int malloc_size;
        !            41:        char s[100];
        !            42:        
        !            43:        if(argc < 1)
        !            44:                usage(argv);
        !            45:        for(arg=1; arg<argc; arg++) {
        !            46:                switch(argv[arg][0]) {
        !            47:                    case 'n':
        !            48:                        num_loops = atoi(&argv[arg][2]);
        !            49:                        break;
        !            50:                    default:
        !            51:                        usage(argv);
        !            52:                }
        !            53:        }
        !            54:        IOInitDDM(1000, "malloc");
        !            55:        IOAddDDMEntry("%s: starting\n", (int)argv[0], 2,3,4,5);
        !            56:        for(loop=1; loop<=num_loops; loop++) {
        !            57:                malloc_size = 1 << loop;
        !            58:                foobar = malloc(malloc_size);
        !            59:                IOAddDDMEntry("malloc'd %d bytes\n", malloc_size, 2,3,4,5);             
        !            60:        }
        !            61:        printf("Done; enter CR to quit: ");
        !            62:        gets(s);
        !            63:        exit(0);
        !            64: }
        !            65: 
        !            66: static void usage(char **argv)
        !            67: {
        !            68:        printf("usage: %s [n=num_loops]\n", argv[0]);
        !            69:        exit(1);
        !            70: }
        !            71: 

unix.superglobalmegacorp.com

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.