| /openbsd-src/gnu/llvm/libcxx/include/ |
| H A D | numeric | 25 accumulate(InputIterator first, InputIterator last, T init, BinaryOperation binary_op);
37 reduce(InputIterator first, InputIterator last, T init, BinaryOperation binary_op); // C++17
63 BinaryOperation binary_op, UnaryOperation unary_op); // C++17
71 …ial_sum(InputIterator first, InputIterator last, OutputIterator result, BinaryOperation binary_op);
81 OutputIterator result, T init, BinaryOperation binary_op); // C++17
90 OutputIterator result, BinaryOperation binary_op); // C++17
95 OutputIterator result, BinaryOperation binary_op, T init); // C++17
102 BinaryOperation binary_op, UnaryOperation unary_op); // C++17
109 BinaryOperation binary_op, UnaryOperation unary_op); // C++17
116 BinaryOperation binary_op, UnaryOperation unary_op,
[all …]
|
| H A D | algorithm | 155 F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
163 F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
1261 OutputIterator result, BinaryOperation binary_op);
|
| /openbsd-src/usr.bin/indent/ |
| H A D | lexi.c | 463 code = (ps.last_u_d ? unary_op : binary_op); in lexi()
509 code = binary_op; in lexi()
524 code = (ps.last_u_d ? unary_op : binary_op); in lexi()
548 code = (ps.last_u_d ? unary_op : binary_op); in lexi()
|
| H A D | indent_codes.h | 40 #define binary_op 5 macro
|
| H A D | indent.c | 717 case binary_op: /* any binary operation */ in main()
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.pt/ |
| H A D | static_cast.C | 5 BinaryOperation binary_op) { in accumulate() argument
|
| /openbsd-src/gnu/gcc/gcc/ |
| H A D | tree-vectorizer.h | 49 binary_op, enumerator
|
| H A D | tree-vect-transform.c | 1198 if (op_type != binary_op && op_type != ternary_op) in vectorizable_reduction()
1345 if (op_type == binary_op) in vectorizable_reduction()
1520 if (op_type != unary_op && op_type != binary_op) in vectorizable_operation()
1607 if (op_type == binary_op) in vectorizable_operation()
1633 if (op_type == binary_op) in vectorizable_operation()
|
| H A D | tree-vectorizer.c | 1862 if (op_type != binary_op) in vect_is_simple_reduction()
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/ |
| H A D | expr.c | 8719 tree binary_op = 0, unary_op = 0; local
8755 singleton = TREE_OPERAND (exp, 2), binary_op = TREE_OPERAND (exp, 1);
8759 singleton = TREE_OPERAND (exp, 1), binary_op = TREE_OPERAND (exp, 2);
8801 if (temp && singleton && binary_op
8802 && (TREE_CODE (binary_op) == PLUS_EXPR
8803 || TREE_CODE (binary_op) == MINUS_EXPR
8804 || TREE_CODE (binary_op) == BIT_IOR_EXPR
8805 || TREE_CODE (binary_op) == BIT_XOR_EXPR)
8806 && (BRANCH_COST >= 3 ? integer_pow2p (TREE_OPERAND (binary_op, 1))
8807 : integer_onep (TREE_OPERAND (binary_op, 1)))
[all …]
|
| /openbsd-src/gnu/llvm/libcxx/include/experimental/ |
| H A D | simd | 154 typename V::value_type neutral_element, BinaryOperation binary_op);
157 typename V::value_type reduce(const const_where_expression<M, V>& x, plus<> binary_op = plus<>());
160 typename V::value_type reduce(const const_where_expression<M, V>& x, multiplies<> binary_op);
163 typename V::value_type reduce(const const_where_expression<M, V>& x, bit_and<> binary_op);
166 typename V::value_type reduce(const const_where_expression<M, V>& x, bit_or<> binary_op);
169 typename V::value_type reduce(const const_where_expression<M, V>& x, bit_xor<> binary_op);
|
| /openbsd-src/usr.sbin/bgpctl/ |
| H A D | parser.c | 1490 binary_op(const char *op) in binary_op()
1610 if (argc >= 3 && (op = binary_op(argv[1])) != OP_NONE) { in parse_flow_numop()
1489 binary_op(const char *op) binary_op() function
|
| /openbsd-src/gnu/gcc/libstdc++-v3/docs/html/17_intro/ |
| H A D | CHECKLIST | 3987 BinaryOperation binary_op);
4824 BinaryOperation binary_op);
4847 BinaryOperation binary_op);
4859 BinaryOperation binary_op);
|
| /openbsd-src/gnu/lib/libstdc++/libstdc++/docs/html/17_intro/ |
| H A D | CHECKLIST | 3987 BinaryOperation binary_op);
4824 BinaryOperation binary_op);
4847 BinaryOperation binary_op);
4859 BinaryOperation binary_op);
|