/third_party/toybox/kconfig/ |
H A D | expr.c | 20 e->left.sym = sym; in expr_alloc_symbol() 29 e->left.expr = ce; in expr_alloc_one() 38 e->left.expr = e1; in expr_alloc_two() 48 e->left.sym = s1; in expr_alloc_comp() 78 e->left = org->left; in expr_copy() 81 e->left.expr = expr_copy(org->left.expr); in expr_copy() 85 e->left.sym = org->left in expr_copy() [all...] |
/third_party/zlib/contrib/blast/ |
H A D | blast.c | 46 unsigned left; /* available input at in */ member 70 * bit buffer, using shift left. 79 if (s->left == 0) { in bits() 80 s->left = s->infun(s->inhow, &(s->in)); in bits() 81 if (s->left == 0) longjmp(s->env, 1); /* out of input */ in bits() 84 s->left--; in bits() 88 /* drop need bits and update buffer, always zero to seven bits left */ in bits() 137 int left; /* bits left in next or left t in decode() local 195 int left; /* number of possible codes left of current length */ construct() local 383 blast(blast_in infun, void *inhow, blast_out outfun, void *outhow, unsigned *left, unsigned char **in) blast() argument 449 unsigned left; main() local [all...] |
/third_party/ffmpeg/libavcodec/ |
H A D | hevcpred_template.c | 103 pixel *left = left_array + 1; in intra_pred() local 162 memset(left, 128, 2 * MAX_TB_SIZE*sizeof(pixel)); in intra_pred() 167 left[-1] = POS(-1, -1); in intra_pred() 168 top[-1] = left[-1]; in intra_pred() 179 left[i] = POS(-1, i); in intra_pred() 182 left[i] = POS(-1, i); in intra_pred() 183 EXTEND(left + size + bottom_left_size, POS(-1, size + bottom_left_size - 1), in intra_pred() 210 left[-1] = top[-1]; in intra_pred() 223 left[-1] = top[-1]; in intra_pred() 225 left[ in intra_pred() 368 const pixel *left = (const pixel *)_left; pred_planar() local 398 const pixel *left = (const pixel *)_left; pred_dc() local 430 const pixel *left = (const pixel *)_left; pred_angular() local 514 pred_angular_0(uint8_t *src, const uint8_t *top, const uint8_t *left, ptrdiff_t stride, int c_idx, int mode) pred_angular_0() argument 521 pred_angular_1(uint8_t *src, const uint8_t *top, const uint8_t *left, ptrdiff_t stride, int c_idx, int mode) pred_angular_1() argument 528 pred_angular_2(uint8_t *src, const uint8_t *top, const uint8_t *left, ptrdiff_t stride, int c_idx, int mode) pred_angular_2() argument 535 pred_angular_3(uint8_t *src, const uint8_t *top, const uint8_t *left, ptrdiff_t stride, int c_idx, int mode) pred_angular_3() argument [all...] |
/third_party/skia/src/core/ |
H A D | SkStringView.cpp | 13 bool operator==(string_view left, string_view right) { in operator ==() argument 14 if (left.length() != right.length()) { in operator ==() 17 return !string_view::traits_type::compare(left.data(), right.data(), left.length()); in operator ==() 20 bool operator!=(string_view left, string_view right) { in operator !=() argument 21 return !(left == right); in operator !=() 24 bool operator<(string_view left, string_view right) { in operator <() argument 25 int result = string_view::traits_type::compare(left.data(), right.data(), in operator <() 26 std::min(left.length(), right.length())); in operator <() 28 result = left in operator <() 33 operator <=(string_view left, string_view right) operator <=() argument 37 operator >(string_view left, string_view right) operator >() argument 41 operator >=(string_view left, string_view right) operator >=() argument [all...] |
/third_party/skia/src/sksl/ir/ |
H A D | SkSLBinaryExpression.cpp | 23 static bool is_low_precision_matrix_vector_multiply(const Expression& left, in is_low_precision_matrix_vector_multiply() argument 29 left.type().isMatrix() && in is_low_precision_matrix_vector_multiply() 31 left.type().rows() == right.type().columns() && in is_low_precision_matrix_vector_multiply() 32 Analysis::IsTrivialExpression(left) && in is_low_precision_matrix_vector_multiply() 37 const Expression& left, in rewrite_matrix_vector_multiply() 43 for (int n = 0; n < left.type().rows(); ++n) { in rewrite_matrix_vector_multiply() 46 context, left.clone(), Literal::MakeInt(context, left.fLine, n)); in rewrite_matrix_vector_multiply() 70 std::unique_ptr<Expression> left, in Convert() 73 if (!left || !righ in Convert() 36 rewrite_matrix_vector_multiply(const Context& context, const Expression& left, const Operator& op, const Expression& right, const Type& resultType) rewrite_matrix_vector_multiply() argument 69 Convert(const Context& context, std::unique_ptr<Expression> left, Operator op, std::unique_ptr<Expression> right) Convert() argument 136 Make(const Context& context, std::unique_ptr<Expression> left, Operator op, std::unique_ptr<Expression> right) Make() argument 150 Make(const Context& context, std::unique_ptr<Expression> left, Operator op, std::unique_ptr<Expression> right, const Type* resultType) Make() argument [all...] |
/third_party/node/deps/ngtcp2/ngtcp2/lib/ |
H A D | ngtcp2_vec.c | 93 size_t *pdstcnt, size_t left, size_t maxcnt) { in ngtcp2_vec_split() 100 if (left >= src[i].len) { in ngtcp2_vec_split() 101 left -= src[i].len; in ngtcp2_vec_split() 118 if (left == 0) { in ngtcp2_vec_split() 131 dst[0].len -= left; in ngtcp2_vec_split() 132 dst[0].base += left; in ngtcp2_vec_split() 133 src[i].len = left; in ngtcp2_vec_split() 136 extra -= left; in ngtcp2_vec_split() 146 size_t *psrccnt, size_t left, size_t maxcnt) { in ngtcp2_vec_merge() 147 size_t orig_left = left; in ngtcp2_vec_merge() 92 ngtcp2_vec_split(ngtcp2_vec *src, size_t *psrccnt, ngtcp2_vec *dst, size_t *pdstcnt, size_t left, size_t maxcnt) ngtcp2_vec_split() argument 145 ngtcp2_vec_merge(ngtcp2_vec *dst, size_t *pdstcnt, ngtcp2_vec *src, size_t *psrccnt, size_t left, size_t maxcnt) ngtcp2_vec_merge() argument 218 ngtcp2_vec_copy_at_most(ngtcp2_vec *dst, size_t dstcnt, const ngtcp2_vec *src, size_t srccnt, size_t left) ngtcp2_vec_copy_at_most() argument [all...] |
/third_party/skia/src/sksl/ |
H A D | SkSLConstantFolder.cpp | 29 static std::unique_ptr<Expression> eliminate_no_op_boolean(const Expression& left, in eliminate_no_op_boolean() argument 41 return left.clone(); in eliminate_no_op_boolean() 47 static std::unique_ptr<Expression> short_circuit_boolean(const Expression& left, in short_circuit_boolean() argument 50 bool leftVal = left.as<Literal>().boolValue(); in short_circuit_boolean() 52 // When the literal is on the left, we can sometimes eliminate the other expression entirely. in short_circuit_boolean() 56 return left.clone(); in short_circuit_boolean() 61 return eliminate_no_op_boolean(right, op, left); in short_circuit_boolean() 65 const Expression& left, in simplify_vector_equality() 71 switch (left.compareConstant(right)) { in simplify_vector_equality() 77 return Literal::MakeBool(context, left in simplify_vector_equality() 64 simplify_vector_equality(const Context& context, const Expression& left, Operator op, const Expression& right) simplify_vector_equality() argument 86 simplify_vector(const Context& context, const Expression& left, Operator op, const Expression& right) simplify_vector() argument 231 simplify_no_op_arithmetic(const Context& context, const Expression& left, Operator op, const Expression& right, const Type& resultType) simplify_no_op_arithmetic() argument 340 const Expression* left = GetConstantValueForVariable(leftExpr); Simplify() local [all...] |
H A D | SkSLOperators.cpp | 233 bool Operator::isMatrixMultiply(const Type& left, const Type& right) { in isMatrixMultiply() argument 237 if (left.isMatrix()) { in isMatrixMultiply() 240 return left.isVector() && right.isMatrix(); in isMatrixMultiply() 248 const Type& left, in determineBinaryType() 255 case Token::Kind::TK_EQ: // left = right in determineBinaryType() 256 *outLeftType = &left; in determineBinaryType() 257 *outRightType = &left; in determineBinaryType() 258 *outResultType = &left; in determineBinaryType() 259 return right.canCoerceTo(left, allowNarrowing); in determineBinaryType() 261 case Token::Kind::TK_EQEQ: // left in determineBinaryType() 247 determineBinaryType(const Context& context, const Type& left, const Type& right, const Type** outLeftType, const Type** outRightType, const Type** outResultType) determineBinaryType() argument [all...] |
/third_party/node/deps/openssl/openssl/crypto/bio/ |
H A D | bio_cb.c | 25 int left; in BIO_debug_callback_ex() local 31 left = BIO_snprintf(buf, sizeof(buf), "BIO[%p]: ", (void *)bio); in BIO_debug_callback_ex() 34 if (left < 0) in BIO_debug_callback_ex() 35 left = 0; in BIO_debug_callback_ex() 36 p = buf + left; in BIO_debug_callback_ex() 37 left = sizeof(buf) - left; in BIO_debug_callback_ex() 41 BIO_snprintf(p, left, "Free - %s\n", bio->method->name); in BIO_debug_callback_ex() 45 BIO_snprintf(p, left, "read(%d,%zu) - %s fd=%d\n", in BIO_debug_callback_ex() 49 BIO_snprintf(p, left, "rea in BIO_debug_callback_ex() [all...] |
/third_party/openssl/crypto/bio/ |
H A D | bio_cb.c | 25 int left; in BIO_debug_callback_ex() local 31 left = BIO_snprintf(buf, sizeof(buf), "BIO[%p]: ", (void *)bio); in BIO_debug_callback_ex() 34 if (left < 0) in BIO_debug_callback_ex() 35 left = 0; in BIO_debug_callback_ex() 36 p = buf + left; in BIO_debug_callback_ex() 37 left = sizeof(buf) - left; in BIO_debug_callback_ex() 41 BIO_snprintf(p, left, "Free - %s\n", bio->method->name); in BIO_debug_callback_ex() 45 BIO_snprintf(p, left, "read(%d,%zu) - %s fd=%d\n", in BIO_debug_callback_ex() 49 BIO_snprintf(p, left, "rea in BIO_debug_callback_ex() [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
H A D | GCNILPSched.cpp | 43 const SUnit *pickBest(const SUnit *left, const SUnit *right); 131 // Return -1 if left has higher priority, 1 if right has higher priority. 133 static int BUCompareLatency(const SUnit *left, const SUnit *right) { in BUCompareLatency() argument 136 int LHeight = (int)left->getHeight(); in BUCompareLatency() 149 int LDepth = left->getDepth(); in BUCompareLatency() 152 LLVM_DEBUG(dbgs() << " Comparing latency of SU (" << left->NodeNum in BUCompareLatency() 157 if (left->Latency != right->Latency) in BUCompareLatency() 158 return left->Latency > right->Latency ? 1 : -1; in BUCompareLatency() 163 const SUnit *GCNILPScheduler::pickBest(const SUnit *left, const SUnit *right) in pickBest() argument 170 int spread = (int)left in pickBest() [all...] |
/third_party/backends/lib/ |
H A D | snprintf.c | 279 on the left with zeros rather than blanks. If a 284 value is to be left adjusted on the field boundary. Except 286 the right with blanks, rather than on the left with 290 - A space, specifying that a blank should be left before 301 with spaces on the left (or right, if the 302 left-adjustment flag has been given) to fill out 345 field width or precision. A negative field width is treated as a left 358 it is padded on the left with zeros. 540 static void dopr( int visible_control, char **buffer, int *left, 542 static void fmtstr( int visible_control, char **buffer, int *left, 565 int left; plp_vsnprintf() local 591 int left; plp_unsafe_vsnprintf() local 658 dopr( int visible_control, char **buffer, int *left, const char *format, va_list args ) dopr() argument 801 fmtstr( int visible_control, char **buffer, int *left, char *value, int ljust, int len, int zpad, int precision ) fmtstr() argument 841 fmtnum( char **buffer, int *left, union value *value, int base, int dosign, int ljust, int len, int zpad, int precision ) fmtnum() argument 907 fmtquad( char **buffer, int *left, union value *value, int base, int dosign, int ljust, int len, int zpad, int precision ) fmtquad() argument 979 fmtdouble( char **buffer, int *left, int fmt, double value, int ljust, int len, int zpad, int precision ) fmtdouble() argument 1010 dostr( char **buffer, int *left, char *str ) dostr() argument 1015 dopr_outch( char **buffer, int *left, int c ) dopr_outch() argument [all...] |
/third_party/skia/include/sksl/ |
H A D | DSLExpression.h | 175 DSLPossibleExpression operator+(DSLExpression left, DSLExpression right); 177 DSLPossibleExpression operator+=(DSLExpression left, DSLExpression right); 178 DSLPossibleExpression operator-(DSLExpression left, DSLExpression right); 180 DSLPossibleExpression operator-=(DSLExpression left, DSLExpression right); 181 DSLPossibleExpression operator*(DSLExpression left, DSLExpression right); 182 DSLPossibleExpression operator*=(DSLExpression left, DSLExpression right); 183 DSLPossibleExpression operator/(DSLExpression left, DSLExpression right); 184 DSLPossibleExpression operator/=(DSLExpression left, DSLExpression right); 185 DSLPossibleExpression operator%(DSLExpression left, DSLExpression right); 186 DSLPossibleExpression operator%=(DSLExpression left, DSLExpressio [all...] |
/third_party/node/deps/v8/src/compiler/ |
H A D | machine-operator-reducer.cc | 339 if (m.right().Is(0)) return Replace(m.left().node()); // x ror 0 => x in Reduce() 342 m.left().ResolvedValue(), m.right().ResolvedValue() & 31)); in Reduce() 352 return ReplaceBool(m.left().ResolvedValue() == in Reduce() 355 if (m.left().IsInt64Sub() && m.right().Is(0)) { // x - y == 0 => x == y in Reduce() 356 Int64BinopMatcher msub(m.left().node()); in Reduce() 357 node->ReplaceInput(0, msub.left().node()); in Reduce() 365 if (!ObjectsMayAlias(m.left().node(), m.right().node())) { in Reduce() 381 if (m.right().Is(1)) return Replace(m.left().node()); // x * 1 => x in Reduce() 383 return ReplaceInt32(base::MulWithWraparound(m.left().ResolvedValue(), in Reduce() 388 node->ReplaceInput(1, m.left() in Reduce() 1414 uint32_t left = m.left().ResolvedValue(); ReduceWord32Comparisons() local [all...] |
/third_party/mesa3d/src/util/ |
H A D | rb_tree.c | 82 while (node->left) in rb_node_minimum() 83 node = node->left; in rb_node_minimum() 116 } else if (u == p->left) { in rb_tree_splice() 117 p->left = v; in rb_tree_splice() 132 x->right = y->left; in rb_tree_rotate_left() 133 if (y->left) in rb_tree_rotate_left() 134 rb_node_set_parent(y->left, x); in rb_tree_rotate_left() 136 y->left = x; in rb_tree_rotate_left() 143 assert(y && y->left); in rb_tree_rotate_right() 145 struct rb_node *x = y->left; in rb_tree_rotate_right() [all...] |
/third_party/ffmpeg/libavcodec/alpha/ |
H A D | me_cmp_mvi_asm.S | 65 t0: left_u -> left lo -> left 68 t3: ref left 71 t5: left_u -> left lo -> left 74 t8: ref left 77 ta: left hi 79 tc: error left 86 ldq t3, 0(a1) # ref left 94 ldq t8, 0(a1) # ref left [all...] |
/third_party/gn/src/gn/ |
H A D | operators.cc | 92 "This thing on the left is not an identifier or accessor."); in Init() 210 Err result(op_node->left()->GetRange(), in MakeOverwriteError() 226 const Value& left, in MakeIncompatibleTypeError() 229 Value::DescribeType(left.type()) + "> " + in MakeIncompatibleTypeError() 232 if (left.type() == Value::LIST) { in MakeIncompatibleTypeError() 337 // the left value. This is set to true when doing +, and false when doing +=. 339 Value left, in ExecutePlus() 344 if (left.type() == Value::INTEGER) { in ExecutePlus() 347 return Value(op_node, left.int_value() + right.int_value()); in ExecutePlus() 350 return Value(op_node, base::Int64ToString(left in ExecutePlus() 225 MakeIncompatibleTypeError(const BinaryOpNode* op_node, const Value& left, const Value& right) MakeIncompatibleTypeError() argument 338 ExecutePlus(const BinaryOpNode* op_node, Value left, Value right, bool allow_left_type_conversion, Err* err) ExecutePlus() argument 389 ExecuteMinus(const BinaryOpNode* op_node, Value left, const Value& right, Err* err) ExecuteMinus() argument 513 ExecuteEqualsEquals(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) ExecuteEqualsEquals() argument 523 ExecuteNotEquals(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) ExecuteNotEquals() argument 534 FillNeedsTwoIntegersError(const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) FillNeedsTwoIntegersError() argument 545 ExecuteLessEquals(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) ExecuteLessEquals() argument 555 ExecuteGreaterEquals(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) ExecuteGreaterEquals() argument 565 ExecuteGreater(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) ExecuteGreater() argument 575 ExecuteLess(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) ExecuteLess() argument 592 Value left = GetValueOrFillError(op_node, left_node, "left", scope, err); ExecuteOr() local 622 Value left = GetValueOrFillError(op_node, left_node, "left", scope, err); ExecuteAnd() local 666 ExecuteBinaryOperator(Scope* scope, const BinaryOpNode* op_node, const ParseNode* left, const ParseNode* right, Err* err) ExecuteBinaryOperator() argument [all...] |
/third_party/f2fs-tools/fsck/ |
H A D | dict.c | 51 #define left dict_left macro 69 #define dict_root(D) ((D)->nilnode.left) 77 * Perform a ``left rotation'' adjustment on the tree. The given node P and 78 * its right child C are rearranged so that the P instead becomes the left 79 * child of C. The left subtree of C is inherited as the new right subtree 87 upper->right = lowleft = lower->left; in rotate_left() 93 the sentinel nil node, and root->parent->left points back to root */ in rotate_left() 95 if (upper == upparent->left) { in rotate_left() 96 upparent->left = lower; in rotate_left() 102 lower->left in rotate_left() 411 dict_similar(const dict_t *left, const dict_t *right) dict_similar() argument 839 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *left; dict_first() local 871 dnode_t *nil = dict_nil(dict), *parent, *left; dict_next() local [all...] |
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/ |
H A D | RopeByteString.java | 134 private final ByteString left; field in RopeByteString 143 * @param left string on the left of this node, should have {@code size() > 0} 146 private RopeByteString(ByteString left, ByteString right) { in RopeByteString() argument 147 this.left = left; in RopeByteString() 149 leftLength = left.size(); in RopeByteString() 151 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1; in RopeByteString() 163 * @param left string on the left 167 concatenate(ByteString left, ByteString right) concatenate() argument 230 concatenateBytes(ByteString left, ByteString right) concatenateBytes() argument 249 newInstanceForTest(ByteString left, ByteString right) newInstanceForTest() argument 629 balance(ByteString left, ByteString right) balance() argument [all...] |
/third_party/ffmpeg/libavutil/ |
H A D | qsort.h | 45 type *left = start+1;\ 60 while(left <= right){\ 61 while(left<=right && cmp(left, end-1) < 0)\ 62 left++;\ 63 while(left<=right && cmp(right, end-1) > 0)\ 65 if(left <= right){\ 66 FFSWAP(type, *left, *right);\ 67 left++;\ 71 FFSWAP(type, end[-1], *left);\ [all...] |
/third_party/zlib/examples/ |
H A D | gzjoin.c | 81 unsigned left; /* bytes remaining at next */ member 113 in->left = 0; in bopen() 127 if (in->left != 0) in bload() 131 len = (long)read(in->fd, in->buf + in->left, CHUNK - in->left); in bload() 134 in->left += (unsigned)len; in bload() 135 } while (len != 0 && in->left < CHUNK); in bload() 140 #define bget(in) (in->left ? 0 : bload(in), \ 141 in->left ? (in->left 176 unsigned left; bskip() local [all...] |
H A D | enough.c | 42 all the symbols are used, there are exactly zero possible bit patterns left 126 left: number of available bit patterns at length len 132 left: 2..syms - 1, but only the evens (so syms == 8 -> 2, 4, 6) 135 syms == 2 is not saved since that immediately leads to a single code. left 137 the current length, which is double the number at the previous length. left 138 ends at syms-1 since left == syms immediately results in a single code. 139 (left > sym is not allowed since that would result in an incomplete code.) 156 to the num[] array as described above for the (syms, left, len) triplet. 237 local inline size_t map(int syms, int left, int len) { in map() argument 239 (left >> in map() 261 count(int syms, int left, int len) count() argument 308 been_here(int syms, int left, int len, int mem, int rem) been_here() argument 361 examine(int syms, int left, int len, int mem, int rem) examine() argument [all...] |
/third_party/alsa-lib/src/ |
H A D | confeval.c | 131 value_type_t left, right; in _snd_eval_string() local 216 err = _to_integer(op == LEFT ? &left : &right, tmp); in _snd_eval_string() 219 err = _parse_integer(op == LEFT ? &left : &right, &s); in _snd_eval_string() 234 case '+': left = left + right; break; in _snd_eval_string() 235 case '-': left = left - right; break; in _snd_eval_string() 236 case '*': left = left * right; break; in _snd_eval_string() 237 case '/': left in _snd_eval_string() [all...] |
/third_party/ffmpeg/libavcodec/loongarch/ |
H A D | vp9dsp_loongarch.h | 91 void ff_vert_16x16_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left, 93 void ff_vert_32x32_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left, 95 void ff_hor_16x16_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left, 97 void ff_hor_32x32_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left, 99 void ff_dc_4x4_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left, 101 void ff_dc_8x8_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left, 103 void ff_dc_16x16_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left, 105 void ff_dc_32x32_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left, 107 void ff_dc_left_4x4_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left, 109 void ff_dc_left_8x8_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left, [all...] |
/third_party/cups-filters/filter/pdftopdf/ |
H A D | pptypes.cc | 79 std::swap(left,right); in rotate_move() 83 bottom=left; in rotate_move() 84 left=top; in rotate_move() 92 left=pwidth-left; in rotate_move() 105 bottom=left; in rotate_move() 106 left=pheight-top; in rotate_move() 113 const float tmp1=left; in rotate_move() 114 left=pwidth-right; in rotate_move() 123 top=pwidth-left; in rotate_move() [all...] |