Searched refs:matchs (Results 1 – 12 of 12) sorted by relevance
275 final int[] matchs = s.getMatchs(); in visitBranchInstruction() local276 for (int i = 0; i < matchs.length; i++) { in visitBranchInstruction()277 args.append(matchs[i]); in visitBranchInstruction()278 if (i < matchs.length - 1) { in visitBranchInstruction()285 for (int i = 0; i < matchs.length; i++) { in visitBranchInstruction()287 if (i < matchs.length - 1) { in visitBranchInstruction()
242 int[] matchs = s.getMatchs(); in visitCode() local246 out.println("\ttableswitch " + matchs[0] + " " + matchs[matchs.length - 1]); in visitCode()256 out.println("\t\t" + matchs[j] + " : " + get(targets[j])); in visitCode()
145 ANTLR3_BOOLEAN (*matchs) (struct ANTLR3_LEXER_struct * lexer, ANTLR3_UCHAR * string); member
1026 final int[] matchs = o.getMatchs(); in visitLOOKUPSWITCH() local1028 for (int i=0; i<matchs.length; i++) { in visitLOOKUPSWITCH()1029 if (matchs[i] == max && i != 0) { in visitLOOKUPSWITCH()1030 constraintViolated(o, "Match '"+matchs[i]+"' occurs more than once."); in visitLOOKUPSWITCH()1032 if (matchs[i] < max) { in visitLOOKUPSWITCH()1036 max = matchs[i]; in visitLOOKUPSWITCH()
49 static ANTLR3_BOOLEAN matchs (pANTLR3_LEXER lexer, ANTLR3_UCHAR * string);136 lexer->matchs = matchs; in antlr3LexerNew()728 matchs(pANTLR3_LEXER lexer, ANTLR3_UCHAR * string) in matchs() function
193 bool matchs(ANTLR_UCHAR* string);
233 bool Lexer<ImplTraits>::matchs(ANTLR_UCHAR* str ) function in Lexer
915 matchs||matches
1690 this->matchs(<string>);1700 this->matchs(<string>);
980 // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks1490 // Find first element in sequence that matchs __value_, with a mininum of loop checks1531 // Find first element in sequence that matchs __value_, with a mininum of loop checks
2847 // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks
249 #define MATCHS(s) LEXER->matchs(LEXER, s)