11461 should use a native link-editor during the build
11463 SUNWonld has passed its use-by date
11464 cmd/sgs/tools should contain tools, not common code
11465 sgsmsg should be built with the rest of the build tools

          --- old/usr/src/cmd/sgs/tools/common/findprime.c
          +++ new/usr/src/cmd/sgs/common/findprime.c

   1    1  /*
   2    2   * CDDL HEADER START
   3    3   *
   4    4   * The contents of this file are subject to the terms of the
   5    5   * Common Development and Distribution License, Version 1.0 only
   6    6   * (the "License").  You may not use this file except in compliance
   7    7   * with the License.
   8    8   *
   9    9   * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
  10   10   * or http://www.opensolaris.org/os/licensing.
  11   11   * See the License for the specific language governing permissions
  12   12   * and limitations under the License.
  13   13   *
  14   14   * When distributing Covered Code, include this CDDL HEADER in each
  15   15   * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
  16   16   * If applicable, add the following below this CDDL HEADER, with the

  17   17   * fields enclosed by brackets "[]" replaced with your own identifying
  18   18   * information: Portions Copyright [yyyy] [name of copyright owner]
  19   19   *
  20   20   * CDDL HEADER END
  21   21   */
  22   22  /*
  23   23   * Copyright 2003 Sun Microsystems, Inc.  All rights reserved.
  24   24   * Use is subject to license terms.
  25   25   */
  26   26  
  27      -#pragma ident   "%Z%%M% %I%     %E% SMI"
  28      -
  29   27  #include <sys/types.h>
  30   28  
  31   29  /*
  32   30   * function that will find a prime'ish number.  Usefull for
  33   31   * hashbuckets and related things.
  34   32   */
  35   33  uint_t
  36   34  findprime(uint_t count)
  37   35  {
  38   36          uint_t  h, f;

  39   37  
  40   38          if (count <= 3)
  41   39                  return (3);
  42   40  
  43   41  
  44   42          /*
  45   43           * Check to see if divisible by two, if so
  46   44           * increment.
  47   45           */
  48   46          if ((count & 0x1) == 0)
  49   47                  count++;
  50   48  
  51   49          for (h = count, f = 2; f * f <= h; f++)
  52   50                  if ((h % f) == 0)
  53   51                          h += f = 1;
  54   52          return (h);
  55   53  }

XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX