Searched refs:lhs (Results 26 - 50 of 119) sorted by relevance

12345

/freebsd-9.3-release/contrib/binutils/ld/
H A Dldexp.c281 exp_fold_tree_1 (tree->binary.lhs);
304 etree_value_type lhs = expld.result; local
315 && lhs.section == bfd_abs_section_ptr
319 expld.result.value = lhs.value + expld.result.value;
327 /* Keep the section of the lhs term. */
328 expld.result.section = lhs.section;
330 else if (expld.result.section != lhs.section
334 lhs.value += lhs.section->vma;
341 expld.result.value = ((bfd_signed_vma) lhs
841 exp_binop(int code, etree_type *lhs, etree_type *rhs) argument
860 exp_trinop(int code, etree_type *cond, etree_type *lhs, etree_type *rhs) argument
[all...]
H A Dldexp.h54 union etree_union *lhs; member in struct:etree_union::__anon741
60 union etree_union *lhs; member in struct:etree_union::__anon742
/freebsd-9.3-release/contrib/gcc/
H A Dtree-complex.c153 is_complex_reg (tree lhs) argument
155 return TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE && is_gimple_reg (lhs);
268 tree lhs, rhs; local
273 lhs = TREE_OPERAND (stmt, 0);
278 gcc_assert (TREE_CODE (lhs) == SSA_NAME);
279 gcc_assert (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE);
281 *result_p = lhs;
282 ver = SSA_NAME_VERSION (lhs);
359 tree lhs; local
591 tree lhs = TREE_OPERAND (stmt, 0); local
604 update_complex_components_on_edge(edge e, tree lhs, tree r, tree i) argument
728 expand_complex_move(block_stmt_iterator *bsi, tree stmt, tree type, tree lhs, tree rhs) argument
915 tree lhs = TREE_OPERAND (stmt, 0); local
1387 tree lhs = TREE_OPERAND (stmt, 0); local
[all...]
H A Dc-omp.c91 c_finish_omp_atomic (enum tree_code code, tree lhs, tree rhs) argument
95 if (lhs == error_mark_node || rhs == error_mark_node)
102 type = TREE_TYPE (lhs);
111 /* ??? Validate that rhs does not overlap lhs. */
113 /* Take and save the address of the lhs. From then on we'll reference it
115 addr = build_unary_op (ADDR_EXPR, lhs, 0);
128 lhs = build_indirect_ref (addr, NULL);
133 x = build_modify_expr (lhs, code, rhs);
H A Dtree-ssa-reassoc.c817 tree lhs = TREE_OPERAND (stmt, 0); local
829 if (lhs == USE_FROM_PTR (arg_p))
998 get_single_immediate_use (tree lhs) argument
1003 if (TREE_CODE (lhs) == SSA_NAME
1004 && single_imm_use (lhs, &immuse, &immusestmt))
1071 tree lhs = TREE_OPERAND (stmt, 0); local
1085 if (TREE_CODE (lhs) == SSA_NAME
1086 && (immusestmt = get_single_immediate_use (lhs))
1174 /* We want to make it so the lhs is always the reassociative op,
1270 tree lhs local
1313 tree lhs = TREE_OPERAND (stmt, 0); local
[all...]
H A Dtree-ssa-loop-im.c237 tree lhs, rhs; local
256 lhs = TREE_OPERAND (stmt, 0);
257 if (TREE_CODE (lhs) == SSA_NAME
258 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (lhs))
266 if (TREE_CODE (lhs) != SSA_NAME
621 tree lhs, stmt1, stmt2, var, name; local
623 lhs = TREE_OPERAND (stmt, 0);
635 stmt2 = build2 (MODIFY_EXPR, void_type_node, lhs,
644 SSA_NAME_DEF_STMT (lhs) = stmt2;
1210 tree *lhs, *rh local
[all...]
H A Dtree-gimple.c129 rhs_predicate_for (tree lhs) argument
131 if (is_gimple_formal_tmp_var (lhs))
133 else if (is_gimple_reg (lhs))
H A Dtree-ssa-copyrename.c320 tree lhs = TREE_OPERAND (stmt, 0); local
323 if (TREE_CODE (lhs) == SSA_NAME && TREE_CODE (rhs) == SSA_NAME)
324 copy_rename_partition_coalesce (map, lhs, rhs, debug);
H A Dsimplify-rtx.c1546 rtx lhs = op0, rhs = op1;
1548 if (GET_CODE (lhs) == NEG)
1552 lhs = XEXP (lhs, 0);
1554 else if (GET_CODE (lhs) == MULT
1555 && GET_CODE (XEXP (lhs, 1)) == CONST_INT)
1557 coeff0l = INTVAL (XEXP (lhs, 1));
1558 coeff0h = INTVAL (XEXP (lhs, 1)) < 0 ? -1 : 0;
1559 lhs = XEXP (lhs,
1539 rtx lhs = op0, rhs = op1; local
1733 rtx lhs = op0, rhs = op1; local
3321 rtx lhs, rhs; local
3371 rtx lhs = ops[j].op, rhs = ops[i].op; local
[all...]
H A Dtree-ssa-propagate.c748 tree lhs; local
756 lhs = TREE_OPERAND (stmt, 0);
757 STRIP_NOPS (lhs);
759 return (!TREE_THIS_VOLATILE (lhs)
760 && (DECL_P (lhs)
761 || REFERENCE_CLASS_P (lhs)));
H A Dtree-into-ssa.c1657 tree lhs, lhs_sym; local
1662 lhs = PHI_RESULT (phi);
1663 lhs_sym = SSA_NAME_VAR (lhs);
1666 register_new_update_single (lhs, lhs_sym);
1671 if (is_new_name (lhs))
1672 register_new_update_set (lhs, names_replaced_by (lhs));
1676 if (is_old_name (lhs))
1677 register_new_update_single (lhs, lhs);
2235 tree lhs_sym, lhs = PHI_RESULT (phi); local
[all...]
H A Dipa-type-escape.c63 /* This bitmap contains the set of local vars that are the lhs of
916 look_for_casts (tree lhs __attribute__((unused)), tree t)
1189 /* First look on the lhs and see what variable is stored to */
1190 tree lhs = TREE_OPERAND (t, 0); local
1193 check_lhs_var (lhs);
1194 check_cast (TREE_TYPE (lhs), rhs);
1226 look_for_casts (lhs, op0);
1227 look_for_casts (lhs, op1);
1246 look_for_casts (lhs, op0);
1247 look_for_casts (lhs, rh
[all...]
/freebsd-9.3-release/contrib/bmake/
H A Dcond.c511 * string. This is called for the lhs and rhs of string compares.
641 char *lhs;
657 * value in lhs.
659 lhs = CondGetString(doEval, &lhsQuoted, &lhsFree);
660 if (!lhs)
693 t = lhs[0] != 0;
697 if (CondCvtArg(lhs, &left)) {
703 t = lhs[0] != 0;
707 t = if_info->defProc(strlen(lhs), lhs) !
633 char *lhs; local
[all...]
/freebsd-9.3-release/usr.bin/make/
H A Dcond.c476 char *lhs; local
485 * value in lhs.
488 lhs = Var_Parse(condExpr, VAR_CMD, doEval,
490 if (lhs == var_Error) {
506 Buf_Append(buf, lhs);
509 free(lhs);
517 lhs = (char *)Buf_GetAll(buf, &varSpecLen);
618 DEBUGF(COND, ("lhs = \"%s\", rhs = \"%s\", "
619 "op = %.2s\n", lhs, string, op));
625 t = strcmp(lhs, strin
[all...]
H A Dvar.c133 struct Buffer *lhs; /* String to match */ member in struct:__anon10802
410 if ((ptr = Str_SYSVMatch(word, Buf_Data(pat->lhs), &len)) != NULL)
467 (strncmp(word, Buf_Data(pattern->lhs),
468 Buf_Size(pattern->lhs)) == 0)) {
474 (wordLen == Buf_Size(pattern->lhs))) {
500 Buf_Size(pattern->lhs)) != 0) {
508 Buf_Size(pattern->lhs),
509 (word + Buf_Size(pattern->lhs)));
524 * left at the end of the lhs, we have to use strncmp.
526 cp = word + (wordLen - Buf_Size(pattern->lhs));
[all...]
/freebsd-9.3-release/contrib/sendmail/contrib/
H A Dbuildvirtuser109 my ($lhs, $domain, $key, $value);
158 $lhs = "$1";
163 $lhs = "";
176 $value =~ s/\$LHS/$lhs/g;
/freebsd-9.3-release/contrib/gcc/cp/
H A Dtypeck.c4769 build_compound_expr (tree lhs, tree rhs)
4771 lhs = convert_to_void (lhs, "left-hand operand of comma");
4773 if (lhs == error_mark_node || rhs == error_mark_node)
4783 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
4789 return build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs);
5591 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
5595 tree lhstype = TREE_TYPE (lhs);
5601 if (error_operand_p (lhs) || error_operand_p (rhs))
5605 switch (TREE_CODE (lhs))
4756 build_compound_expr(tree lhs, tree rhs) argument
5577 build_modify_expr(tree lhs, enum tree_code modifycode, tree rhs) argument
5899 build_x_modify_expr(tree lhs, enum tree_code modifycode, tree rhs) argument
[all...]
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DSymbolManager.cpp253 const SymIntExpr *SymbolManager::getSymIntExpr(const SymExpr *lhs, argument
258 SymIntExpr::Profile(ID, lhs, op, v, t);
264 new (data) SymIntExpr(lhs, op, v, t);
271 const IntSymExpr *SymbolManager::getIntSymExpr(const llvm::APSInt& lhs, argument
276 IntSymExpr::Profile(ID, lhs, op, rhs, t);
282 new (data) IntSymExpr(lhs, op, rhs, t);
289 const SymSymExpr *SymbolManager::getSymSymExpr(const SymExpr *lhs, argument
294 SymSymExpr::Profile(ID, lhs, op, rhs, t);
300 new (data) SymSymExpr(lhs, op, rhs, t);
/freebsd-9.3-release/usr.bin/yacc/
H A Dlr0.c548 int lhs; local
555 for (lhs = start_symbol; lhs < nsyms; lhs++)
557 derives[lhs] = rules + k;
560 if (rlhs[i] == lhs)
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/
H A DSTLExtras.h223 template <typename T> bool operator()(const T &lhs, const T &rhs) const { argument
224 return lhs.first < rhs.first;
231 template <typename T> bool operator()(const T &lhs, const T &rhs) const { argument
232 return lhs.second < rhs.second;
H A DPointerUnion.h180 static bool operator==(PointerUnion<PT1, PT2> lhs, argument
182 return lhs.getOpaqueValue() == rhs.getOpaqueValue();
186 static bool operator!=(PointerUnion<PT1, PT2> lhs, argument
188 return lhs.getOpaqueValue() != rhs.getOpaqueValue();
/freebsd-9.3-release/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_module.c182 Elf32_Sym *lhs = *((Elf32_Sym **)lp); local
185 if (lhs->st_value != rhs->st_value)
186 return (lhs->st_value > rhs->st_value ? 1 : -1);
188 if ((lhs->st_size == 0) != (rhs->st_size == 0))
189 return (lhs->st_size == 0 ? 1 : -1);
191 if ((ELF32_ST_TYPE(lhs->st_info) == STT_NOTYPE) !=
193 return (ELF32_ST_TYPE(lhs->st_info) == STT_NOTYPE ? 1 : -1);
195 if ((ELF32_ST_BIND(lhs->st_info) == STB_WEAK) !=
197 return (ELF32_ST_BIND(lhs->st_info) == STB_WEAK ? 1 : -1);
199 return (strcmp(dt_module_strtab + lhs
211 Elf64_Sym *lhs = *((Elf64_Sym **)lp); local
[all...]
/freebsd-9.3-release/contrib/gdb/gdb/
H A Darch-utils.c143 core_addr_lessthan (CORE_ADDR lhs, CORE_ADDR rhs) argument
145 return (lhs < rhs);
149 core_addr_greaterthan (CORE_ADDR lhs, CORE_ADDR rhs) argument
151 return (lhs > rhs);
/freebsd-9.3-release/sbin/devd/
H A Ddevd.hh175 bool chop_var(char *&buffer, char *&lhs, char *&rhs);
/freebsd-9.3-release/contrib/llvm/lib/TableGen/
H A DRecord.cpp740 UnOpInit *UnOpInit::get(UnaryOp opc, Init *lhs, RecTy *Type) { argument
744 Key TheKey(std::make_pair(std::make_pair(opc, lhs), Type));
747 if (!I) I = new UnOpInit(opc, lhs, Type);
862 Init *lhs = LHS->resolveReferences(R, RV); local
864 if (LHS != lhs)
865 return (UnOpInit::get(getOpcode(), lhs, getType()))->Fold(&R, 0);
880 BinOpInit *BinOpInit::get(BinaryOp opc, Init *lhs, argument
889 Key TheKey(std::make_pair(std::make_pair(std::make_pair(opc, lhs), rhs),
893 if (!I) I = new BinOpInit(opc, lhs, rhs, Type);
973 Init *lhs local
995 get(TernaryOp opc, Init *lhs, Init *mhs, Init *rhs, RecTy *Type) argument
1224 Init *lhs = LHS->resolveReferences(R, RV); local
[all...]

Completed in 411 milliseconds

12345