Searched refs:alt (Results 1 - 25 of 187) sorted by relevance

12345678

/external/elfutils/libdw/
H A Ddwarf_setalt.c36 dwarf_setalt (Dwarf *main, Dwarf *alt) argument
38 main->alt_dwarf = alt;
/external/libpng/scripts/
H A Ddfn.awk47 for (alt in array) {
48 if (array[alt] != "" && alt < key) {
50 value = array[alt]
51 key = alt
52 array[alt] = ""
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/
H A DST.stg109 rewriteTemplateAltFirst(alt) ::= <<
110 <if(alt.pred)>
111 if <alt.pred>:
112 # <alt.description>
113 retval.st = <alt.alt>
116 # <alt.description>
117 retval.st = <alt.alt>
122 rewriteTemplateAlt(alt)
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DNFAConfiguration.java32 /** An NFA state, predicted alt, and syntactic/semantic context.
42 /** What alt is predicted by this configuration */
43 public int alt; field in class:NFAConfiguration
63 * other configuration associated with alt 3).
90 int alt,
95 this.alt = alt;
103 * the state|alt|ctx could be the same and have two different
113 this.alt==other.alt
89 NFAConfiguration(int state, int alt, NFAContext context, SemanticContext semanticContext) argument
[all...]
H A DLL1DFA.java42 /** From list of lookahead sets (one per alt in decision), create
60 for (int alt=1; alt<altLook.length; alt++) {
63 setAcceptState(alt, acceptAltState);
65 acceptAltState.cachedUniquelyPredicatedAlt = alt;
66 Label e = getLabelForSet(altLook[alt].tokenTypeSet);
97 int alt = alts.get(0);
98 setAcceptState(alt, s);
99 s.cachedUniquelyPredicatedAlt = alt;
152 getSynPredForAlt(NFAState decisionStartState, int alt) argument
[all...]
H A DDFAState.java47 * NFA could be in. We need to track the alt predicted by each
70 * context trees for an alt.
108 /** If we detect recursion on more than one alt, decision is non-LL(*),
137 /** The set of NFA configurations (state,alt,context) for this DFA state */
145 * hence looping forever. Sensitive to the NFA state, the alt, and
205 * an NFA state/alt/syntactic&semantic context (chain of invoking state(s)
209 * state|alt|synCtx and different semantic contexts because the
228 // track min alt rather than compute later
229 if ( c.alt < minAltInConfigurations ) {
230 minAltInConfigurations = c.alt;
259 addNFAConfiguration(NFAState state, int alt, NFAContext context, SemanticContext semanticContext) argument
[all...]
H A DNFAToDFAConverter.java122 * Walk each alt in decision and compute closure from the start of that
124 * that same decision. The idea is to associate a specific alt number
125 * with the starting closure so we can trace the alt number for all states
126 * derived from this. At a stop state in the DFA, we can return this alt
127 * number, indicating which alt is predicted.
131 * this alternative one, let's make this alt n+1 where n is the number of
140 NFAState alt = dfa.decisionNFAStartState;
145 while ( alt!=null ) {
147 // any input symbols for each alt. Keep adding to same
149 // but track the alt numbe
591 closure(NFAState p, int alt, NFAContext context, SemanticContext semanticContext, DFAState d, boolean collectPredicates) argument
985 convertToAcceptState(DFAState d, int alt) argument
[all...]
/external/elfutils/tests/
H A Drun-buildid.sh25 test-offset-loop.alt testfile14 testfile42_noshdrs
29 test-offset-loop.alt testfile14 <<\EOF
34 test-offset-loop.alt: build ID: 066bbf1a7bc5676f5015ee1966a088f23bdb83ae
H A Drun-debugaltlink.sh30 test-offset-loop: test-offset-loop.alt, build ID: 066bbf1a7bc5676f5015ee1966a088f23bdb83ae
/external/libmpeg2/common/x86/
H A Dideint_cac_ssse3.c101 WORD32 alt[2] = {0}; local
133 /* Compute row based alt and adj */
148 alt[0] += ABS_DIF(sum_1, sum_3);
149 alt[0] += ABS_DIF(sum_2, sum_4);
163 alt[1] += ABS_DIF(sum_1, sum_3);
164 alt[1] += ABS_DIF(sum_2, sum_4);
206 /* Compute column based alt */
222 alt[0] += diff_sum << 2;
225 alt[1] += diff_sum << 2;
228 alt[
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
H A DRecursionOverflowMessage.java43 public int alt; field in class:RecursionOverflowMessage
49 int alt,
56 this.alt = alt;
72 st.add("alt", alt);
47 RecursionOverflowMessage(DecisionProbe probe, DFAState sampleBadState, int alt, Collection targetRules, Collection callSiteStates) argument
H A DLeftRecursiveRuleAnalyzer.java61 public void setTokenPrec(GrammarAST t, int alt) { argument
63 tokenToPrec.put(ttype, alt);
77 if ( altAssociativity.get(alt)!=null && altAssociativity.get(alt)!=assoc ) {
78 ErrorManager.error(ErrorManager.MSG_ALL_OPS_NEED_SAME_ASSOC, alt);
80 altAssociativity.put(alt, assoc);
82 //System.out.println("op " + alt + ": " + t.getText()+", assoc="+assoc);
86 public void binaryAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) { argument
94 int nextPrec = nextPrecedence(alt);
102 altText += "{}"; // add empty alt t
113 ternaryAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) argument
138 prefixAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) argument
164 suffixAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) argument
180 otherAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) argument
310 precedence(int alt) argument
314 nextPrecedence(int alt) argument
[all...]
H A DDOTGenerator.java185 // special case: if decision point, then line up the alt start states
191 NFAState alt = (NFAState)s;
192 while ( alt!=null ) {
193 rankST.add("states", getStateLabel(alt));
194 if ( alt.transition[1] !=null ) {
195 alt = (NFAState)alt.transition[1].target;
198 alt=null;
336 int alt = altI.intValue();
340 buf.append("alt");
[all...]
/external/mesa3d/src/mapi/glapi/gen/
H A Dgl_x86_asm.py215 alt = "%s@%u" % (name, stack)
217 print '\tGL_STUB(%s, %d, %s)' % (name, f.offset, alt)
220 print '\tHIDDEN(GL_PREFIX(%s, %s))' % (name, alt)
226 alt = "%s@%u" % (name, stack)
232 text = '\tGL_STUB_ALIAS(%s, %d, %s, %s, %s)' % (n, f.offset, alt2, name, alt)
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/
H A DAssignTokenTypesWalker.g137 GrammarAST alt = (GrammarAST)adaptor.create( ALT, "ALT" );
138 adaptor.addChild( alt, adaptor.create( STRING_LITERAL, "STRING_LITERAL" ) );
139 adaptor.addChild( alt, adaptor.create( EOA, "EOA" ) );
140 adaptor.addChild( stringAlias, alt );
149 GrammarAST alt = (GrammarAST)adaptor.create( ALT, "ALT" );
150 adaptor.addChild( alt, adaptor.create( CHAR_LITERAL, "CHAR_LITERAL" ) );
151 adaptor.addChild( alt, adaptor.create( EOA, "EOA" ) );
152 adaptor.addChild( charAlias, alt );
161 GrammarAST alt = (GrammarAST)adaptor.create( ALT, "ALT" );
162 adaptor.addChild( alt, adapto
[all...]
H A DLeftRecursiveRuleWalker.g55 private int outerAlt; // which outer alt of rule?
79 public void setTokenPrec(GrammarAST t, int alt) {}
80 public void binaryAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) {}
81 public void ternaryAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) {}
82 public void prefixAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) {}
83 public void suffixAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) {}
84 public void otherAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) {}
162 /** An alt is either prefix, suffix, binary, or ternary operation or "other" */
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/
H A DST.stg106 rewriteTemplateAlt(alt) ::= <<
107 // <alt.description>
108 <if(alt.pred)>
109 if (<alt.pred>) {
110 retval.st = <alt.alt>;
114 retval.st = <alt.alt>;
/external/libmpeg2/common/
H A Dideint_cac.c107 WORD32 alt; local
131 alt = 0;
212 alt += ABS_DIF(sum_1, sum_3);
213 alt += ABS_DIF(sum_2, sum_4);
298 alt += diff_sum << 2;
303 alt += (alt >> sad_bias_mult_shift) + (sad_bias_additive >> 1);
304 ca = (alt < adj);
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ObjC/
H A DST4ObjC.stg176 rewriteTemplateAlt(alt) ::= <<
177 // <alt.description>
178 <if(alt.pred)>
179 if (<alt.pred>) {
180 retval.st = <alt.alt>;
184 retval.st = <alt.alt>;
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/
H A DSerializedGrammar.java68 List alt = alts[i];
70 buf.append(alt.toString());
138 List alt = readAlt(in);
139 alts[i] = alt;
146 List alt = new ArrayList();
148 if ( A!='A' ) throw new IOException("missing A on start of alt");
154 alt.add(new TokenRef(ttype));
159 alt.add(new RuleRef(ruleIndex));
173 alt.add(b);
178 //System.out.println("exit alt");
[all...]
/external/chromium-trace/catapult/tracing/third_party/mannwhitneyu/
H A Dmannwhitneyu.js152 exports.test = function(x, y, alt, corr) {
154 alt = typeof alt !== 'undefined' ? alt : 'two-sided';
176 if (alt == 'less') {
178 } else if (alt == 'greater') {
180 } else if (alt == 'two-sided') {
187 if (alt == 'two-sided') {
/external/icu/icu4c/source/i18n/
H A Dastro.h224 * @param alt The altitude, measured in radians above the horizon.
228 Horizon(double alt=0, double azim=0) argument
229 : altitude(alt), azimuth(azim) { }
233 * @param alt The altitude, measured in radians above the horizon.
237 void set(double alt, double azim) { argument
238 altitude = alt;
/external/libedit/src/
H A Dmap.h51 el_action_t *alt; /* The current alternate key map */ member in struct:el_map_t
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/
H A DLeftRecursiveRules.stg79 recRuleAlt(alt, pred) ::= "{<pred>}?=> <alt>"
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/messages/languages/
H A Den.stg204 "with rewrite=true, alt <arg> not simple node or obvious tree element; text attribute for rule not guaranteed to be correct"
226 "rule <arg> alt <arg2> uses rewrite syntax and also an AST operator"
230 ALL_OPS_NEED_SAME_ASSOC(arg) ::= "all operators of alt <alt> of left-recursive rule must have same associativity"
238 <paths:{ it | alt <it.alt> via NFA path <it.states; separator=","><\n>}>
254 Input such as "<upon>" is insufficiently covered with predicates at locations: <altToLocations.keys:{alt|alt <alt>: <altToLocations.(alt)
[all...]

Completed in 377 milliseconds

12345678