/freebsd-11-stable/sys/compat/linuxkpi/common/include/linux/ |
H A D | ktime.h | 110 ktime_sub(ktime_t lhs, ktime_t rhs) argument 112 return (lhs - rhs); 132 ktime_add(ktime_t lhs, ktime_t rhs) argument 134 return (lhs + rhs);
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Utility/ |
H A D | ConstString.h | 103 /// Returns \b true if the C string in \a lhs is equal to 105 bool operator()(const char *lhs, const char *rhs) const { argument 106 return lhs == rhs; 270 /// \param[in] lhs 281 static bool Equals(ConstString lhs, ConstString rhs, 286 /// Compares the C string values contained in \a lhs and \a rhs and returns 294 /// \param[in] lhs 304 /// \return -1 if lhs < rhs, 0 if lhs == rhs, 1 if lhs > rh [all...] |
H A D | Iterable.h | 141 operator-(AdaptedConstIterator<C, E, A> &lhs, argument 143 return (lhs.m_iter - rhs.m_iter); 147 void swap(AdaptedConstIterator<C, E, A> &lhs, argument 149 std::swap(lhs.m_iter, rhs.m_iter);
|
/freebsd-11-stable/contrib/gcc/ |
H A D | tree-ssa-uncprop.c | 50 tree lhs; member in struct:edge_equivalency 100 equivalency->lhs = cond; 105 equivalency->lhs = cond; 125 equivalency->lhs = op0; 132 equivalency->lhs = op0; 141 equivalency->lhs = op0; 148 equivalency->lhs = op0; 172 equivalency->lhs = op0; 232 equivalency->lhs = cond; 490 record_equiv (equiv->rhs, equiv->lhs); [all...] |
H A D | tree-complex.c | 153 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 D | c-omp.c | 91 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 D | tree-ssa-reassoc.c | 817 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...] |
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | SValBuilder.h | 118 NonLoc lhs, NonLoc rhs, QualType resultTy) = 0; 123 Loc lhs, Loc rhs, QualType resultTy) = 0; 129 Loc lhs, NonLoc rhs, QualType resultTy) = 0; 142 NonLoc lhs, NonLoc rhs, QualType resultTy); 145 SVal lhs, SVal rhs, QualType type); 147 /// \return Whether values in \p lhs and \p rhs are equal at \p state. 148 ConditionTruthVal areEqual(ProgramStateRef state, SVal lhs, SVal rhs); 150 SVal evalEQ(ProgramStateRef state, SVal lhs, SVal rhs); 152 DefinedOrUnknownSVal evalEQ(ProgramStateRef state, DefinedOrUnknownSVal lhs, 322 NonLoc makeNonLoc(const SymExpr *lhs, BinaryOperato [all...] |
H A D | RangedConstraintManager.h | 54 static inline bool isLess(key_type_ref lhs, key_type_ref rhs) { argument 55 return *lhs.first < *rhs.first || 56 (!(*rhs.first < *lhs.first) && *lhs.second < *rhs.second);
|
/freebsd-11-stable/contrib/gdb/gdb/ |
H A D | arch-utils.h | 59 extern int core_addr_lessthan (CORE_ADDR lhs, CORE_ADDR rhs); 60 extern int core_addr_greaterthan (CORE_ADDR lhs, CORE_ADDR rhs);
|
/freebsd-11-stable/contrib/bmake/unit-tests/ |
H A D | varmisc.exp | 12 :? only lhs when value true
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Basic/ |
H A D | SourceManagerInternals.h | 66 inline bool operator<(const LineEntry &lhs, const LineEntry &rhs) { argument 68 return lhs.FileOffset < rhs.FileOffset;
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | DWARFBaseDIE.h | 126 bool operator==(const DWARFBaseDIE &lhs, const DWARFBaseDIE &rhs); 127 bool operator!=(const DWARFBaseDIE &lhs, const DWARFBaseDIE &rhs);
|
/freebsd-11-stable/contrib/binutils/ld/ |
H A D | ldexp.c | 281 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 D | ldexp.h | 54 union etree_union *lhs; member in struct:etree_union::__anon611 60 union etree_union *lhs; member in struct:etree_union::__anon612
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/Breakpad/ |
H A D | SymbolFileBreakpad.h | 162 friend bool operator<(const Bookmark &lhs, const Bookmark &rhs) { argument 163 return std::tie(lhs.section, lhs.offset) < 198 friend bool operator<(const CompUnitData &lhs, const CompUnitData &rhs) { argument 199 return lhs.bookmark < rhs.bookmark;
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/ |
H A D | prefix_string.c | 313 svn_prefix_string__compare(const svn_prefix_string__t *lhs, argument 316 const node_t *lhs_parent = lhs->prefix; 319 if (lhs == rhs) 332 lhs = &lhs_parent->key; 341 return (int)(unsigned char)lhs->data[0] - (int)(unsigned char)rhs->data[0];
|
/freebsd-11-stable/contrib/bmake/ |
H A D | cond.c | 186 * Indicate when we should be strict about lhs of comparisons. 189 * since lhs is already expanded and we cannot tell if 525 * string. This is called for the lhs and rhs of string compares. 628 /* lhs must be quoted, a variable reference or number */ 666 char *lhs; 682 * value in lhs. 684 lhs = CondGetString(doEval, &lhsQuoted, &lhsFree, lhsStrict); 685 if (!lhs) 718 t = lhs[0] != 0; 722 if (CondCvtArg(lhs, 658 char *lhs; local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | PointerUnion.h | 243 bool operator==(PointerUnion<PTs...> lhs, PointerUnion<PTs...> rhs) { 244 return lhs.getOpaqueValue() == rhs.getOpaqueValue(); 248 bool operator!=(PointerUnion<PTs...> lhs, PointerUnion<PTs...> rhs) { 249 return lhs.getOpaqueValue() != rhs.getOpaqueValue(); 253 bool operator<(PointerUnion<PTs...> lhs, PointerUnion<PTs...> rhs) { 254 return lhs.getOpaqueValue() < rhs.getOpaqueValue();
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Utility/ |
H A D | ConstString.cpp | 214 bool ConstString::Equals(ConstString lhs, ConstString rhs, argument 216 if (lhs.m_string == rhs.m_string) 226 llvm::StringRef lhs_string_ref(lhs.GetStringRef()); 231 int ConstString::Compare(ConstString lhs, ConstString rhs, argument 234 const char *lhs_cstr = lhs.m_string; 239 llvm::StringRef lhs_string_ref(lhs.GetStringRef());
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/API/ |
H A D | SBAddress.h | 110 friend bool LLDB_API operator==(const SBAddress &lhs, const SBAddress &rhs); 126 bool LLDB_API operator==(const SBAddress &lhs, const SBAddress &rhs);
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_fs/ |
H A D | load-index.c | 82 compare_p2l_entry_revision(const void *lhs, argument 86 =*(const svn_fs_fs__p2l_entry_t *const *)lhs;
|
/freebsd-11-stable/contrib/gcc/cp/ |
H A D | typeck.c | 4865 build_compound_expr (tree lhs, tree rhs) 4867 lhs = convert_to_void (lhs, "left-hand operand of comma"); 4869 if (lhs == error_mark_node || rhs == error_mark_node) 4879 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init); 4885 return build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs); 5719 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs) 5723 tree lhstype = TREE_TYPE (lhs); 5729 if (error_operand_p (lhs) || error_operand_p (rhs)) 5733 switch (TREE_CODE (lhs)) 4853 build_compound_expr(tree lhs, tree rhs) argument 5706 build_modify_expr(tree lhs, enum tree_code modifycode, tree rhs) argument 6042 build_x_modify_expr(tree lhs, enum tree_code modifycode, tree rhs) argument [all...] |
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_x/ |
H A D | id.h | 95 svn_fs_x__id_eq(const svn_fs_x__id_t *lhs,
|
/freebsd-11-stable/contrib/sendmail/contrib/ |
H A D | buildvirtuser | 109 my ($lhs, $domain, $key, $value); 158 $lhs = "$1"; 163 $lhs = ""; 176 $value =~ s/\$LHS/$lhs/g;
|