0N/A/*
0N/A * CDDL HEADER START
0N/A *
0N/A * The contents of this file are subject to the terms
0N/A * of the Common Development and Distribution License
0N/A * (the "License"). You may not use this file except
0N/A * in compliance with the License.
0N/A *
0N/A * You can obtain a copy of the license at
0N/A * src/OPENSOLARIS.LICENSE
0N/A * or http://www.opensolaris.org/os/licensing.
0N/A * See the License for the specific language governing
0N/A * permissions and limitations under the License.
0N/A *
0N/A * When distributing Covered Code, include this CDDL
0N/A * HEADER in each file and include the License file at
0N/A * usr/src/OPENSOLARIS.LICENSE. If applicable,
0N/A * add the following below this CDDL HEADER, with the
0N/A * fields enclosed by brackets "[]" replaced with your
0N/A * own identifying information: Portions Copyright [yyyy]
0N/A * [name of copyright owner]
0N/A *
0N/A * CDDL HEADER END
0N/A */
0N/A
0N/A/*
0N/A * Copyright 2005 Sun Microsystems, Inc. All rights reserved.
0N/A * Use is subject to license terms.
0N/A */
0N/A
0N/A
0N/A#include <unistd.h>
0N/A#include <stdio.h>
0N/A#include <stdlib.h>
0N/A#include <string.h>
0N/A
0N/A#include "libmicro.h"
0N/A
0N/A#define DEFD 100
0N/A
0N/Astatic int optd = DEFD;
0N/A
0N/Aint recurse2(int x, int y, char *s);
0N/A
0N/A/*ARGSUSED*/
0N/Aint
0N/Arecurse1(int x, int y, char *s)
0N/A{
0N/A char str[32];
0N/A
0N/A if (x < y) {
0N/A return (recurse2(x + 1, y, str));
0N/A }
0N/A
0N/A return (x);
0N/A}
0N/A
0N/Aint
0N/Abenchmark_init()
0N/A{
0N/A lm_tsdsize = 0;
0N/A
0N/A (void) sprintf(lm_optstr, "d:");
0N/A
0N/A (void) sprintf(lm_usage,
0N/A " [-d depth-limit (default = %d)]\n"
0N/A "notes: measures recursion performance\n",
0N/A DEFD);
0N/A
0N/A return (0);
0N/A}
0N/A
0N/Aint
0N/Abenchmark_optswitch(int opt, char *optarg)
0N/A{
0N/A switch (opt) {
0N/A case 'd':
0N/A optd = atoi(optarg);
0N/A break;
0N/A default:
0N/A return (-1);
0N/A }
0N/A return (0);
0N/A}
0N/A
0N/A/*ARGSUSED*/
0N/Aint
0N/Abenchmark(void *tsd, result_t *res)
0N/A{
0N/A int i;
0N/A
0N/A for (i = 0; i < lm_optB; i++) {
0N/A (void) recurse1(0, optd, NULL);
0N/A }
0N/A res->re_count = i;
0N/A
0N/A return (0);
0N/A}