Home
last modified time | relevance | path

Searched refs:unary_op (Results 1 – 8 of 8) sorted by relevance

/openbsd/usr.bin/indent/
H A Dlexi.c463 code = (ps.last_u_d ? unary_op : binary_op); in lexi()
471 code = (ps.last_u_d ? unary_op : postop); in lexi()
484 code = unary_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 Dindent_codes.h39 #define unary_op 4 macro
H A Dindent.c683 case unary_op: /* this could be any unary operation */ in main()
/openbsd/gnu/llvm/libcxx/include/
H A Dnumeric63 BinaryOperation binary_op, UnaryOperation unary_op); // 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,
/openbsd/gnu/gcc/gcc/
H A Dtree-vectorizer.h48 unary_op = 1, enumerator
H A Dtree-vect-transform.c1520 if (op_type != unary_op && op_type != binary_op) in vectorizable_operation()
/openbsd/usr.sbin/bgpctl/
H A Dparser.c1472 unary_op(const char *op) in unary_op() function
1593 } else if ((op = unary_op(argv[0])) != -1) { in parse_flow_numop()
/openbsd/gnu/usr.bin/gcc/gcc/
H A Dexpr.c8719 tree binary_op = 0, unary_op = 0; local
8763 singleton = TREE_OPERAND (exp, 2), unary_op = TREE_OPERAND (exp, 1);
8767 singleton = TREE_OPERAND (exp, 1), unary_op = TREE_OPERAND (exp, 2);
8887 store_expr (build1 (TREE_CODE (unary_op), type,