HomeSort by: relevance | last modified time | path
    Searched refs:automaton (Results 1 - 4 of 4) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
genautomata.cc 24 1. The finite state automaton based pipeline hazard recognizer and
51 automaton state.
61 6. Union of automaton states are not generated yet. It is planned
67 which describes automaton used for recognition of processor pipeline
81 description internal representation into finite state automaton.
84 o checking correctness of the automaton pipeline description
87 o generating automaton (automata) from the description (major
96 equivalent automaton states (major function is `minimize_DFA').
102 automaton as different tables and functions which works with the
103 automata to inquire automaton state and to change its state. Thes
507 struct automaton_decl automaton; member in union:decl::__anon13711
681 automaton_t automaton; member in struct:state
803 struct automaton struct
857 automaton_t automaton; member in struct:automata_list_el
866 automaton_t automaton; member in struct:state_ainsn_table
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
genautomata.cc 24 1. The finite state automaton based pipeline hazard recognizer and
51 automaton state.
61 6. Union of automaton states are not generated yet. It is planned
67 which describes automaton used for recognition of processor pipeline
81 description internal representation into finite state automaton.
84 o checking correctness of the automaton pipeline description
87 o generating automaton (automata) from the description (major
96 equivalent automaton states (major function is `minimize_DFA').
102 automaton as different tables and functions which works with the
103 automata to inquire automaton state and to change its state. Thes
507 struct automaton_decl automaton; member in union:decl::__anon16141
681 automaton_t automaton; member in struct:state
803 struct automaton struct
857 automaton_t automaton; member in struct:automata_list_el
866 automaton_t automaton; member in struct:state_ainsn_table
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/compiler/nir/
nir_algebraic.py 777 """This class calculates a bottom-up tree automaton to quickly search for
781 deterministic automaton to match patterns, using a similar algorithm to the
785 automaton acts as a quick filter for the search function, requiring only n
789 automaton using only symbol filtering. The filtering is crucial to reduce
906 # like f2b1, are tricky. Either we construct the automaton to
911 # need to map f2b1 to f2b when constructing the automaton. Here
1055 % for state_id, state_xforms in enumerate(automaton.state_patterns):
1066 % for op in automaton.opcodes:
1069 % for e in automaton.filter[op]:
1074 num_filtered = len(automaton.rep[op]
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/
nir_algebraic.py 700 """This class calculates a bottom-up tree automaton to quickly search for
704 deterministic automaton to match patterns, using a similar algorithm to the
708 automaton acts as a quick filter for the search function, requiring only n
712 automaton using only symbol filtering. The filtering is crucial to reduce
829 # like f2b1, are tricky. Either we construct the automaton to
834 # need to map f2b1 to f2b when constructing the automaton. Here
995 % for state_id, state_xforms in enumerate(automaton.state_patterns):
1006 % for op in automaton.opcodes:
1009 % for e in automaton.filter[op]:
1014 num_filtered = len(automaton.rep[op]
    [all...]

Completed in 24 milliseconds