| /dports/science/nwchem-data/nwchem-7.0.2-release/src/ddscf/fast/ |
| H A D | newfmm.F | 107 subroutine fmm_charges_to_poles(depth, lmax, tree, argument
512 subroutine fmm_potential_at_charges2(depth,lmax, tree, argument
643 subroutine fmm_potential_at_charges(depth,lmax,tree, argument
747 subroutine fmm(depth, lmax, tree, dimx, dimy, dimz) argument
814 subroutine fmm_pass1(depth, lmax, dimx, dimy, dimz, tree, wtree) argument
819 integer lmax, depth, level local
972 subroutine fmm_pass2(depth, lmax, dimx, dimy, dimz, tree, wtree) argument
977 integer lmax, depth, level local
1128 subroutine fmm_tree_create(depth, lmax, tree) argument
1133 integer depth, lmax, tree(300) local
[all …]
|
| /dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/ddscf/fast/ |
| H A D | newfmm.F | 107 subroutine fmm_charges_to_poles(depth, lmax, tree, argument
512 subroutine fmm_potential_at_charges2(depth,lmax, tree, argument
643 subroutine fmm_potential_at_charges(depth,lmax,tree, argument
747 subroutine fmm(depth, lmax, tree, dimx, dimy, dimz) argument
814 subroutine fmm_pass1(depth, lmax, dimx, dimy, dimz, tree, wtree) argument
819 integer lmax, depth, level local
972 subroutine fmm_pass2(depth, lmax, dimx, dimy, dimz, tree, wtree) argument
977 integer lmax, depth, level local
1137 subroutine fmm_tree_create(depth, lmax, tree) argument
1142 integer depth, lmax, tree(300) local
[all …]
|
| /dports/lang/php81/php-8.1.1/sapi/phpdbg/ |
| H A D | phpdbg_btree.c | 33 void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth) { in phpdbg_btree_init()
40 phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find()
67 phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find_closest()
122 phpdbg_btree_position phpdbg_btree_find_between(phpdbg_btree *tree, zend_ulong lower_idx, zend_ulon… in phpdbg_btree_find_between()
144 int phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags) { in phpdbg_btree_insert_or_update()
179 int phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_delete()
227 void phpdbg_btree_clean_recursive(phpdbg_btree_branch *branch, zend_ulong depth, bool persistent) { in phpdbg_btree_clean_recursive()
239 void phpdbg_btree_clean(phpdbg_btree *tree) { in phpdbg_btree_clean()
247 void phpdbg_btree_branch_dump(phpdbg_btree_branch *branch, zend_ulong depth) { in phpdbg_btree_branch_dump()
258 void phpdbg_btree_dump(phpdbg_btree *tree) { in phpdbg_btree_dump()
|
| /dports/www/mod_php80/php-8.0.15/sapi/phpdbg/ |
| H A D | phpdbg_btree.c | 33 void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth) { in phpdbg_btree_init()
40 phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find()
67 phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find_closest()
122 phpdbg_btree_position phpdbg_btree_find_between(phpdbg_btree *tree, zend_ulong lower_idx, zend_ulon… in phpdbg_btree_find_between()
144 int phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags) { in phpdbg_btree_insert_or_update()
179 int phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_delete()
227 void phpdbg_btree_clean_recursive(phpdbg_btree_branch *branch, zend_ulong depth, zend_bool persiste… in phpdbg_btree_clean_recursive()
239 void phpdbg_btree_clean(phpdbg_btree *tree) { in phpdbg_btree_clean()
247 void phpdbg_btree_branch_dump(phpdbg_btree_branch *branch, zend_ulong depth) { in phpdbg_btree_branch_dump()
258 void phpdbg_btree_dump(phpdbg_btree *tree) { in phpdbg_btree_dump()
|
| /dports/www/mod_php81/php-8.1.1/sapi/phpdbg/ |
| H A D | phpdbg_btree.c | 33 void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth) { in phpdbg_btree_init()
40 phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find()
67 phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find_closest()
122 phpdbg_btree_position phpdbg_btree_find_between(phpdbg_btree *tree, zend_ulong lower_idx, zend_ulon… in phpdbg_btree_find_between()
144 int phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags) { in phpdbg_btree_insert_or_update()
179 int phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_delete()
227 void phpdbg_btree_clean_recursive(phpdbg_btree_branch *branch, zend_ulong depth, bool persistent) { in phpdbg_btree_clean_recursive()
239 void phpdbg_btree_clean(phpdbg_btree *tree) { in phpdbg_btree_clean()
247 void phpdbg_btree_branch_dump(phpdbg_btree_branch *branch, zend_ulong depth) { in phpdbg_btree_branch_dump()
258 void phpdbg_btree_dump(phpdbg_btree *tree) { in phpdbg_btree_dump()
|
| /dports/lang/php73/php-7.3.33/sapi/phpdbg/ |
| H A D | phpdbg_btree.c | 35 void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth) { in phpdbg_btree_init()
42 phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find()
69 phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find_closest()
124 phpdbg_btree_position phpdbg_btree_find_between(phpdbg_btree *tree, zend_ulong lower_idx, zend_ulon… in phpdbg_btree_find_between()
146 int phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags) { in phpdbg_btree_insert_or_update()
181 int phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_delete()
229 void phpdbg_btree_clean_recursive(phpdbg_btree_branch *branch, zend_ulong depth, zend_bool persiste… in phpdbg_btree_clean_recursive()
241 void phpdbg_btree_clean(phpdbg_btree *tree) { in phpdbg_btree_clean()
249 void phpdbg_btree_branch_dump(phpdbg_btree_branch *branch, zend_ulong depth) { in phpdbg_btree_branch_dump()
260 void phpdbg_btree_dump(phpdbg_btree *tree) { in phpdbg_btree_dump()
|
| /dports/lang/php74/php-7.4.27/sapi/phpdbg/ |
| H A D | phpdbg_btree.c | 35 void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth) { in phpdbg_btree_init()
42 phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find()
69 phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find_closest()
124 phpdbg_btree_position phpdbg_btree_find_between(phpdbg_btree *tree, zend_ulong lower_idx, zend_ulon… in phpdbg_btree_find_between()
146 int phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags) { in phpdbg_btree_insert_or_update()
181 int phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_delete()
229 void phpdbg_btree_clean_recursive(phpdbg_btree_branch *branch, zend_ulong depth, zend_bool persiste… in phpdbg_btree_clean_recursive()
241 void phpdbg_btree_clean(phpdbg_btree *tree) { in phpdbg_btree_clean()
249 void phpdbg_btree_branch_dump(phpdbg_btree_branch *branch, zend_ulong depth) { in phpdbg_btree_branch_dump()
260 void phpdbg_btree_dump(phpdbg_btree *tree) { in phpdbg_btree_dump()
|
| /dports/lang/php80/php-8.0.15/sapi/phpdbg/ |
| H A D | phpdbg_btree.c | 33 void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth) { in phpdbg_btree_init()
40 phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find()
67 phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find_closest()
122 phpdbg_btree_position phpdbg_btree_find_between(phpdbg_btree *tree, zend_ulong lower_idx, zend_ulon… in phpdbg_btree_find_between()
144 int phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags) { in phpdbg_btree_insert_or_update()
179 int phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_delete()
227 void phpdbg_btree_clean_recursive(phpdbg_btree_branch *branch, zend_ulong depth, zend_bool persiste… in phpdbg_btree_clean_recursive()
239 void phpdbg_btree_clean(phpdbg_btree *tree) { in phpdbg_btree_clean()
247 void phpdbg_btree_branch_dump(phpdbg_btree_branch *branch, zend_ulong depth) { in phpdbg_btree_branch_dump()
258 void phpdbg_btree_dump(phpdbg_btree *tree) { in phpdbg_btree_dump()
|
| /dports/www/mod_php74/php-7.4.27/sapi/phpdbg/ |
| H A D | phpdbg_btree.c | 35 void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth) { in phpdbg_btree_init()
42 phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find()
69 phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find_closest()
124 phpdbg_btree_position phpdbg_btree_find_between(phpdbg_btree *tree, zend_ulong lower_idx, zend_ulon… in phpdbg_btree_find_between()
146 int phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags) { in phpdbg_btree_insert_or_update()
181 int phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_delete()
229 void phpdbg_btree_clean_recursive(phpdbg_btree_branch *branch, zend_ulong depth, zend_bool persiste… in phpdbg_btree_clean_recursive()
241 void phpdbg_btree_clean(phpdbg_btree *tree) { in phpdbg_btree_clean()
249 void phpdbg_btree_branch_dump(phpdbg_btree_branch *branch, zend_ulong depth) { in phpdbg_btree_branch_dump()
260 void phpdbg_btree_dump(phpdbg_btree *tree) { in phpdbg_btree_dump()
|
| /dports/www/mod_php73/php-7.3.33/sapi/phpdbg/ |
| H A D | phpdbg_btree.c | 35 void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth) { in phpdbg_btree_init()
42 phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find()
69 phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_find_closest()
124 phpdbg_btree_position phpdbg_btree_find_between(phpdbg_btree *tree, zend_ulong lower_idx, zend_ulon… in phpdbg_btree_find_between()
146 int phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags) { in phpdbg_btree_insert_or_update()
181 int phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx) { in phpdbg_btree_delete()
229 void phpdbg_btree_clean_recursive(phpdbg_btree_branch *branch, zend_ulong depth, zend_bool persiste… in phpdbg_btree_clean_recursive()
241 void phpdbg_btree_clean(phpdbg_btree *tree) { in phpdbg_btree_clean()
249 void phpdbg_btree_branch_dump(phpdbg_btree_branch *branch, zend_ulong depth) { in phpdbg_btree_branch_dump()
260 void phpdbg_btree_dump(phpdbg_btree *tree) { in phpdbg_btree_dump()
|
| /dports/x11-toolkits/gtk30/gtk+-3.24.31/testsuite/gtk/ |
| H A D | rbtree.c | 232 gint depth) in gtk_rbtree_print_node()
280 guint depth, in append_elements()
311 create_rbtree (guint depth, in create_rbtree()
315 GtkRBTree *tree; in create_rbtree() local
329 GtkRBTree *tree; in test_create() local
340 GtkRBTree *tree; in test_insert_after() local
362 GtkRBTree *tree; in test_insert_before() local
383 GtkRBTree *tree; in test_remove_node() local
417 GtkRBTree *tree; in test_remove_root() local
453 GtkRBTree *tree; in create_unsorted_tree() local
[all …]
|
| /dports/x11-toolkits/gtk40/gtk-4.4.1/testsuite/gtk/ |
| H A D | rbtree.c | 233 int depth) in gtk_rbtree_print_node()
281 guint depth, in append_elements()
312 create_rbtree (guint depth, in create_rbtree()
316 GtkTreeRBTree *tree; in create_rbtree() local
330 GtkTreeRBTree *tree; in test_create() local
341 GtkTreeRBTree *tree; in test_insert_after() local
363 GtkTreeRBTree *tree; in test_insert_before() local
384 GtkTreeRBTree *tree; in test_remove_node() local
418 GtkTreeRBTree *tree; in test_remove_root() local
454 GtkTreeRBTree *tree; in create_unsorted_tree() local
[all …]
|
| /dports/sysutils/gdmap/gdmap-0.8.1/src/ |
| H A D | tree.c | 46 static void tree_print(tree_t* tree) in tree_print()
57 char* tree_full_name(tree_t* tree) in tree_full_name()
75 void tree_destroy(tree_t* tree) in tree_destroy()
83 static tree_t* tree_new(const char* sname, gint64 size, unsigned depth) in tree_new()
126 static tree_t* tree_scan_rec(const char* dirname, const char* shortname, int depth) in tree_scan_rec()
131 tree_t* tree = NULL; in tree_scan_rec() local
211 tree_t* tree_load(const char* folder, ProgressFunc func, void* data, unsigned depth) in tree_load()
213 tree_t* tree; in tree_load() local
|
| /dports/net-im/psi/psi-1.5/src/tools/optionstree/unittest/ |
| H A D | OptionsTreeMainTest.cpp | 84 OptionsTree tree; in createTreeTest() local
94 OptionsTree tree; in saveLoadTreeTest() local
174 OptionsTree tree; in benchSaveAccounts() local
182 OptionsTree tree; in benchSaveAccountsStream() local
197 QMap<QString, QVariant> generateStressTestValues(int count, int depth) { in generateStressTestValues()
210 QMap<QString, QVariant> generateStressTestValues(const QString& name, int depth) { in generateStressTestValues()
228 void initTree(OptionsTree* tree) { in initTree()
234 void initTreeValues(OptionsTree* tree, const QMap<QString, QVariant>& values) { in initTreeValues()
244 void initTreeComments(OptionsTree* tree, const QMap<QString, QString>& comments) { in initTreeComments()
254 void verifyTree(const OptionsTree* tree) { in verifyTree()
[all …]
|
| /dports/graphics/alpng/alpng-1.3_4/src/inflate/ |
| H A D | huffman.c | 53 struct huffman_tree* tree = (struct huffman_tree*) malloc(sizeof(struct huffman_tree)); in huffman_create_tree() local
66 void huffman_reset_tree(struct huffman_tree* tree) { in huffman_reset_tree()
86 void huffman_destroy_tree(struct huffman_tree* tree) { in huffman_destroy_tree()
91 int huffman_add(struct huffman_tree* tree, int depth, int value) { in huffman_add()
124 int huffman_read_next_code(struct huffman_tree* tree, struct input_data* data) { in huffman_read_next_code()
|
| /dports/graphics/libjxl/libjxl-0.6.1/lib/jxl/ |
| H A D | huffman_tree.cc | 16 void SetDepth(const HuffmanTree& p, HuffmanTree* pool, uint8_t* depth, in SetDepth()
48 const int tree_limit, uint8_t* depth) { in CreateHuffmanTree()
54 std::vector<HuffmanTree> tree; in CreateHuffmanTree() local
139 size_t* tree_size, uint8_t* tree, in WriteHuffmanTreeRepetitions()
179 uint8_t* tree, uint8_t* extra_bits_data) { in WriteHuffmanTreeRepetitionsZeros()
210 static void DecideOverRleUse(const uint8_t* depth, const size_t length, in DecideOverRleUse()
237 void WriteHuffmanTree(const uint8_t* depth, size_t length, size_t* tree_size, in WriteHuffmanTree()
238 uint8_t* tree, uint8_t* extra_bits_data) { in WriteHuffmanTree()
300 void ConvertBitDepthsToSymbols(const uint8_t* depth, size_t len, in ConvertBitDepthsToSymbols()
|
| /dports/www/firefox/firefox-99.0/third_party/jpeg-xl/lib/jxl/ |
| H A D | huffman_tree.cc | 16 void SetDepth(const HuffmanTree& p, HuffmanTree* pool, uint8_t* depth, in SetDepth()
48 const int tree_limit, uint8_t* depth) { in CreateHuffmanTree()
54 std::vector<HuffmanTree> tree; in CreateHuffmanTree() local
139 size_t* tree_size, uint8_t* tree, in WriteHuffmanTreeRepetitions()
179 uint8_t* tree, uint8_t* extra_bits_data) { in WriteHuffmanTreeRepetitionsZeros()
210 static void DecideOverRleUse(const uint8_t* depth, const size_t length, in DecideOverRleUse()
237 void WriteHuffmanTree(const uint8_t* depth, size_t length, size_t* tree_size, in WriteHuffmanTree()
238 uint8_t* tree, uint8_t* extra_bits_data) { in WriteHuffmanTree()
300 void ConvertBitDepthsToSymbols(const uint8_t* depth, size_t len, in ConvertBitDepthsToSymbols()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/third_party/jpeg-xl/lib/jxl/ |
| H A D | huffman_tree.cc | 16 void SetDepth(const HuffmanTree& p, HuffmanTree* pool, uint8_t* depth, in SetDepth()
48 const int tree_limit, uint8_t* depth) { in CreateHuffmanTree()
54 std::vector<HuffmanTree> tree; in CreateHuffmanTree() local
139 size_t* tree_size, uint8_t* tree, in WriteHuffmanTreeRepetitions()
179 uint8_t* tree, uint8_t* extra_bits_data) { in WriteHuffmanTreeRepetitionsZeros()
210 static void DecideOverRleUse(const uint8_t* depth, const size_t length, in DecideOverRleUse()
237 void WriteHuffmanTree(const uint8_t* depth, size_t length, size_t* tree_size, in WriteHuffmanTree()
238 uint8_t* tree, uint8_t* extra_bits_data) { in WriteHuffmanTree()
300 void ConvertBitDepthsToSymbols(const uint8_t* depth, size_t len, in ConvertBitDepthsToSymbols()
|
| /dports/www/firefox-esr/firefox-91.8.0/third_party/jpeg-xl/lib/jxl/ |
| H A D | huffman_tree.cc | 16 void SetDepth(const HuffmanTree& p, HuffmanTree* pool, uint8_t* depth, in SetDepth()
48 const int tree_limit, uint8_t* depth) { in CreateHuffmanTree()
54 std::vector<HuffmanTree> tree; in CreateHuffmanTree() local
139 size_t* tree_size, uint8_t* tree, in WriteHuffmanTreeRepetitions()
179 uint8_t* tree, uint8_t* extra_bits_data) { in WriteHuffmanTreeRepetitionsZeros()
210 static void DecideOverRleUse(const uint8_t* depth, const size_t length, in DecideOverRleUse()
237 void WriteHuffmanTree(const uint8_t* depth, size_t length, size_t* tree_size, in WriteHuffmanTree()
238 uint8_t* tree, uint8_t* extra_bits_data) { in WriteHuffmanTree()
300 void ConvertBitDepthsToSymbols(const uint8_t* depth, size_t len, in ConvertBitDepthsToSymbols()
|
| /dports/security/aide/aide-0.17.4/src/ |
| H A D | seltree.c | 34 void log_tree(LOG_LEVEL log_level, seltree* tree, int depth) { in log_tree()
134 char* strgetndirname(char* path,int depth) in strgetndirname()
162 int depth=0; in treedepth() local
177 seltree* get_seltree_node(seltree* tree,char* path) in get_seltree_node()
209 seltree* tree, in new_seltree_node()
263 rx_rule * add_rx_to_tree(char * rx, RESTRICTION_TYPE restriction, int rule_type, seltree *tree, con… in add_rx_to_tree()
321 …,char* text, rx_rule* *rule, RESTRICTION_TYPE file_type, int rule_type, int depth, bool unrestrict… in check_list_for_match()
377 …match(seltree *node, char *text, RESTRICTION_TYPE file_type, int retval, rx_rule* *rule, int depth) in check_node_for_match()
511 int check_seltree(seltree *tree, char *filename, RESTRICTION_TYPE file_type, rx_rule* *rule) { in check_seltree()
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/tools/metrics/histograms/ |
| H A D | extract_histograms.py | 98 def IterElementsWithTag(root, tag, depth=-1): argument
280 def ExtractEnumsFromXmlTree(tree): argument
404 def _ExtractHistogramsFromXmlTree(tree, enums): argument
522 def _UpdateHistogramsWithSuffixes(tree, histograms): argument
676 def _GetTagSubTree(tree, tag, depth): argument
696 def ExtractHistogramsFromDom(tree): argument
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/mlir/tools/mlir-tblgen/ |
| H A D | RewriterGen.cpp | 231 void PatternEmitter::emitMatch(DagNode tree, StringRef name, int depth) { in emitMatch()
247 int depth) { in emitNativeCodeMatch()
326 void PatternEmitter::emitOpMatch(DagNode tree, StringRef opName, int depth) { in emitOpMatch()
396 void PatternEmitter::emitOperandMatch(DagNode tree, StringRef opName, in emitOperandMatch()
398 int depth) { in emitOperandMatch()
452 int argIndex, int depth) { in emitAttributeMatch()
527 int depth = 0; in emitMatchLogic() local
597 void PatternEmitter::collectOps(DagNode tree, in collectOps()
813 StringRef PatternEmitter::handleReplaceWithValue(DagNode tree) { in handleReplaceWithValue()
828 std::string PatternEmitter::handleLocationDirective(DagNode tree) { in handleLocationDirective()
[all …]
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/mlir/tools/mlir-tblgen/ |
| H A D | RewriterGen.cpp | 231 void PatternEmitter::emitMatch(DagNode tree, StringRef name, int depth) { in emitMatch()
247 int depth) { in emitNativeCodeMatch()
333 void PatternEmitter::emitOpMatch(DagNode tree, StringRef opName, int depth) { in emitOpMatch()
409 void PatternEmitter::emitOperandMatch(DagNode tree, StringRef opName, in emitOperandMatch()
411 int depth) { in emitOperandMatch()
465 int argIndex, int depth) { in emitAttributeMatch()
540 int depth = 0; in emitMatchLogic() local
610 void PatternEmitter::collectOps(DagNode tree, in collectOps()
824 StringRef PatternEmitter::handleReplaceWithValue(DagNode tree) { in handleReplaceWithValue()
839 std::string PatternEmitter::handleLocationDirective(DagNode tree) { in handleLocationDirective()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/mlir/tools/mlir-tblgen/ |
| H A D | RewriterGen.cpp | 230 void PatternEmitter::emitMatch(DagNode tree, StringRef name, int depth) { in emitMatch()
246 int depth) { in emitNativeCodeMatch()
325 void PatternEmitter::emitOpMatch(DagNode tree, StringRef opName, int depth) { in emitOpMatch()
392 void PatternEmitter::emitOperandMatch(DagNode tree, StringRef opName, in emitOperandMatch()
393 int argIndex, int depth) { in emitOperandMatch()
447 int argIndex, int depth) { in emitAttributeMatch()
522 int depth = 0; in emitMatchLogic() local
592 void PatternEmitter::collectOps(DagNode tree, in collectOps()
808 StringRef PatternEmitter::handleReplaceWithValue(DagNode tree) { in handleReplaceWithValue()
823 std::string PatternEmitter::handleLocationDirective(DagNode tree) { in handleLocationDirective()
[all …]
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/mlir/tools/mlir-tblgen/ |
| H A D | RewriterGen.cpp | 231 void PatternEmitter::emitMatch(DagNode tree, StringRef name, int depth) { in emitMatch()
247 int depth) { in emitNativeCodeMatch()
333 void PatternEmitter::emitOpMatch(DagNode tree, StringRef opName, int depth) { in emitOpMatch()
409 void PatternEmitter::emitOperandMatch(DagNode tree, StringRef opName, in emitOperandMatch()
411 int depth) { in emitOperandMatch()
465 int argIndex, int depth) { in emitAttributeMatch()
540 int depth = 0; in emitMatchLogic() local
610 void PatternEmitter::collectOps(DagNode tree, in collectOps()
824 StringRef PatternEmitter::handleReplaceWithValue(DagNode tree) { in handleReplaceWithValue()
839 std::string PatternEmitter::handleLocationDirective(DagNode tree) { in handleLocationDirective()
[all …]
|