src/share/vm/libadt/port.cpp

Print this page


   1 /*
   2  * Copyright (c) 1997, 1998, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 



  25 // Code for portable compiling
  26 
  27 #ifdef __GNUC__
  28 #pragma implementation
  29 #endif
  30 
  31 #include "incls/_precompiled.incl"
  32 #include "incls/_port.cpp.incl"
  33 
  34 // %%%%% includes not needed with AVM framework - Ungar
  35 // #include "port.hpp"
  36 
  37 // This is only used if turboc is used and it causes problems with
  38 // gcc.
  39 #ifdef __TURBOC__
  40 #include <iostream.h>
  41 #endif
  42 
  43 #include <stdio.h>
  44 
  45 //------------------------------gcd--------------------------------------------
  46 // Greatest common divisor
  47 uint32 gcd( register uint32 x, register uint32 y )
  48 {
  49   register uint32 tmp;
  50   while( x ) {                  // While not zero
  51     tmp = x;                    // Hold onto smaller x value
  52     x = y % x;                  // Compute modulus; since y>=x, 0 <= mod < x
  53     y = tmp;                    // y = old x


   1 /*
   2  * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "libadt/port.hpp"
  27 
  28 // Code for portable compiling
  29 
  30 #ifdef __GNUC__
  31 #pragma implementation
  32 #endif
  33 



  34 // %%%%% includes not needed with AVM framework - Ungar
  35 // #include "port.hpp"
  36 
  37 // This is only used if turboc is used and it causes problems with
  38 // gcc.
  39 #ifdef __TURBOC__
  40 #include <iostream.h>
  41 #endif
  42 
  43 #include <stdio.h>
  44 
  45 //------------------------------gcd--------------------------------------------
  46 // Greatest common divisor
  47 uint32 gcd( register uint32 x, register uint32 y )
  48 {
  49   register uint32 tmp;
  50   while( x ) {                  // While not zero
  51     tmp = x;                    // Hold onto smaller x value
  52     x = y % x;                  // Compute modulus; since y>=x, 0 <= mod < x
  53     y = tmp;                    // y = old x