| /external/mesa3d/src/compiler/glsl/ |
| D | ir_reader.cpp | 174 foreach_in_list(s_list, sub, &list->subexpressions) { in scan_for_prototypes()
178 s_symbol *tag = SX_AS_SYMBOL(sub->subexpressions.get_head()); in scan_for_prototypes()
211 exec_node *node = ((s_list *) expr)->subexpressions.get_head_raw()->next->next; in read_function()
243 s_symbol *paramtag = SX_AS_SYMBOL(paramlist->subexpressions.get_head()); in read_function_sig()
254 exec_node *node = paramlist->subexpressions.get_head_raw()->next; in read_function_sig()
295 if (!skip_body && !body_list->subexpressions.is_empty()) { in read_function_sig()
320 foreach_in_list(s_expression, sub, &list->subexpressions) { in read_instructions()
349 if (list == NULL || list->subexpressions.is_empty()) { in read_instruction()
354 s_symbol *tag = SX_AS_SYMBOL(list->subexpressions.get_head()); in read_instruction()
409 foreach_in_list(s_symbol, qualifier, &s_quals->subexpressions) { in read_declaration()
[all …]
|
| D | ast_expr.cpp | 92 subexpressions[0]->print(); in print()
94 subexpressions[1]->print(); in print()
|
| D | s_expression.cpp | 117 list->subexpressions.push_tail(expr); in __read_expression()
168 foreach_in_list(s_expression, expr, &this->subexpressions) { in print()
206 foreach_in_list(s_expression, expr, &list->subexpressions) { in s_match()
|
| D | ast_to_hir.cpp | 1203 ast_expression *expr = parent_expr->subexpressions[operand]; in get_scalar_boolean_operand()
1328 if (this->subexpressions[0] != NULL) in set_is_lhs()
1329 this->subexpressions[0]->set_is_lhs(new_value); in set_is_lhs()
1407 this->subexpressions[0]->set_is_lhs(true); in do_hir()
1408 op[0] = this->subexpressions[0]->hir(instructions, state); in do_hir()
1409 op[1] = this->subexpressions[1]->hir(instructions, state); in do_hir()
1413 this->subexpressions[0]->non_lvalue_description, in do_hir()
1415 this->subexpressions[0]->get_location()); in do_hir()
1420 op[0] = this->subexpressions[0]->hir(instructions, state); in do_hir()
1430 op[0] = this->subexpressions[0]->hir(instructions, state); in do_hir()
[all …]
|
| D | glsl_parser_extras.cpp | 1245 subexpressions[0]->print(); in print()
1247 subexpressions[1]->print(); in print()
1251 subexpressions[0]->print(); in print()
1262 subexpressions[0]->print(); in print()
1267 subexpressions[0]->print(); in print()
1272 subexpressions[0]->print(); in print()
1274 subexpressions[1]->print(); in print()
1276 subexpressions[2]->print(); in print()
1280 subexpressions[0]->print(); in print()
1282 subexpressions[1]->print(); in print()
[all …]
|
| D | hir_field_selection.cpp | 38 op = expr->subexpressions[0]->hir(instructions, state); in _mesa_ast_field_selection_to_hir()
|
| D | ast.h | 230 subexpressions[0] = NULL; in ast_expression()
231 subexpressions[1] = NULL; in ast_expression()
232 subexpressions[2] = NULL; in ast_expression()
256 ast_expression *subexpressions[3]; variable
|
| D | ast_function.cpp | 766 array->subexpressions[0], in generate_array_index()
767 array->subexpressions[1], in generate_array_index()
2021 const ast_expression *field = subexpressions[0]; in handle_method()
2035 field->subexpressions[0]->set_is_lhs(true); in handle_method()
2036 op = field->subexpressions[0]->hir(instructions, state); in handle_method()
2109 (ast_type_specifier *) subexpressions[0]; in hir()
2390 } else if (subexpressions[0]->oper == ast_field_selection) { in hir()
2393 const ast_expression *id = subexpressions[0]; in hir()
2405 id->subexpressions[0], in hir()
2406 id->subexpressions[1], &func_name, in hir()
|
| D | s_expression.h | 143 exec_list subexpressions; variable
|
| /external/libcups/vcnet/regex/ |
| D | tests | 11 # separated list of what the subexpressions should match, with - indicating
369 # subexpressions
383 # the regression tester only asks for 9 subexpressions
|
| /external/llvm/test/Transforms/Reassociate/ |
| D | xor_reassoc.ll | 169 ; swap the two xor-subexpressions if they are not in canoninical order; however,
|
| /external/llvm-project/llvm/test/CodeGen/X86/ |
| D | lsr-delayed-fold.ll | 137 ; there could be multiple subexpressions within a single expansion which
|
| /external/llvm/docs/ |
| D | Lexicon.rst | 60 subexpression compuation. For example ``(a+b)*(a+b)`` has two subexpressions
|
| /external/llvm/test/CodeGen/X86/ |
| D | lsr-delayed-fold.ll | 137 ; there could be multiple subexpressions within a single expansion which
|
| /external/mesa3d/docs/relnotes/ |
| D | 8.0.5.rst | 203 - i965/vs: Don't clobber sampler message MRFs with subexpressions.
|
| /external/llvm-project/llvm/docs/ |
| D | Lexicon.rst | 68 subexpressions that are the same: ``(a+b)``. This optimization would
|
| /external/clang/docs/ |
| D | InternalsManual.rst | 1958 * Your expression probably involves some types and some subexpressions.
1960 subexpressions, meet your expectations. Add implicit conversions where
1964 subexpressions with your expression.
1974 to deal with "weird" expressions that don't behave well as subexpressions.
1995 * Make sure that ``children()`` visits all of the subexpressions. This is
2042 subexpressions of your expression have the type that your expression
2071 subexpressions.
2074 transform all of the subexpressions and types within your expression,
2075 using ``getDerived().TransformYYY``. If all of the subexpressions and
2092 other than subexpressions, extend libclang's ``CursorVisitor`` to provide
|
| D | PCHInternals.rst | 332 size). Within the AST file, the subexpressions of an expression are stored, in
354 that expression on to a stack. When a record contains *N* subexpressions ---
|
| /external/llvm-project/llvm/test/Transforms/Reassociate/ |
| D | xor_reassoc.ll | 304 ; swap the two xor-subexpressions if they are not in canoninical order; however,
|
| /external/llvm-project/clang/docs/ |
| D | InternalsManual.rst | 2557 * Your expression probably involves some types and some subexpressions.
2559 subexpressions, meet your expectations. Add implicit conversions where
2563 subexpressions with your expression.
2573 to deal with "weird" expressions that don't behave well as subexpressions.
2594 * Make sure that ``children()`` visits all of the subexpressions. This is
2641 subexpressions of your expression have the type that your expression
2670 subexpressions.
2673 transform all of the subexpressions and types within your expression,
2674 using ``getDerived().TransformYYY``. If all of the subexpressions and
2691 other than subexpressions, extend libclang's ``CursorVisitor`` to provide
|
| D | PCHInternals.rst | 332 size). Within the AST file, the subexpressions of an expression are stored, in
354 that expression on to a stack. When a record contains *N* subexpressions ---
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | regengine.inc | 208 /* oh my, they want the subexpressions... */
|
| /external/swiftshader/third_party/llvm-subzero/lib/Support/ |
| D | regengine.inc | 208 /* oh my, they want the subexpressions... */
|
| /external/llvm/docs/tutorial/ |
| D | LangImpl02.rst | 405 about nested subexpressions like (c+d) at all.
|
| /external/llvm/lib/Support/ |
| D | regengine.inc | 208 /* oh my, they want the subexpressions... */
|