0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 0N/A * This code is free software; you can redistribute it and/or modify it 0N/A * under the terms of the GNU General Public License version 2 only, as 2362N/A * published by the Free Software Foundation. Oracle designates this 0N/A * particular file as subject to the "Classpath" exception as provided 2362N/A * by Oracle in the LICENSE file that accompanied this code. 0N/A * This code is distributed in the hope that it will be useful, but WITHOUT 0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 0N/A * version 2 for more details (a copy is included in the LICENSE file that 0N/A * accompanied this code). 0N/A * You should have received a copy of the GNU General Public License version 0N/A * 2 along with this work; if not, write to the Free Software Foundation, 0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 5891N/A * (C) Copyright IBM Corp. 1998-2013 - All Rights Reserved 5971N/A * State table loop detection. 5971N/A * Detects if too many ( LE_STATE_PATIENCE_COUNT ) state changes occur without moving the glyph index 'g'. 5971N/A * LE_STATE_PATIENCE_INIT(); 5971N/A * int g=0; // the glyph index - expect it to be moving 5971N/A * if(LE_STATE_PATIENCE_DECR()) { // decrements the patience counter 5971N/A * // ran out of patience, get out. 5971N/A * LE_STATE_PATIENCE_CURR(int, g); // store the 'current' 5971N/A * state = newState(state,g); 5971N/A * g+= <something, could be zero>; 5971N/A * LE_STATE_PATIENCE_INCR(g); // if g has moved, increment the patience counter. Otherwise leave it.