equal
deleted
inserted
replaced
1 /* |
1 /* |
2 * Copyright (c) 1998, 2013, Oracle and/or its affiliates. All rights reserved. |
2 * Copyright (c) 1998, 2014, Oracle and/or its affiliates. All rights reserved. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * |
4 * |
5 * This code is free software; you can redistribute it and/or modify it |
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 |
6 * under the terms of the GNU General Public License version 2 only, as |
7 * published by the Free Software Foundation. |
7 * published by the Free Software Foundation. |
254 } |
254 } |
255 tty->print_cr("--Histogram of counts--"); |
255 tty->print_cr("--Histogram of counts--"); |
256 for( i = 0; i < _maxlrg*2; i++ ) |
256 for( i = 0; i < _maxlrg*2; i++ ) |
257 if( h_cnt[i] ) |
257 if( h_cnt[i] ) |
258 tty->print("%d/%d ",i,h_cnt[i]); |
258 tty->print("%d/%d ",i,h_cnt[i]); |
259 tty->print_cr(""); |
259 tty->cr(); |
260 } |
260 } |
261 |
261 |
262 void PhaseIFG::verify( const PhaseChaitin *pc ) const { |
262 void PhaseIFG::verify( const PhaseChaitin *pc ) const { |
263 // IFG is square, sorted and no need for Find |
263 // IFG is square, sorted and no need for Find |
264 for( uint i = 0; i < _maxlrg; i++ ) { |
264 for( uint i = 0; i < _maxlrg; i++ ) { |