Home
last modified time | relevance | path

Searched refs:left (Results 26 - 50 of 4249) sorted by relevance

12345678910>>...170

/third_party/skia/include/sksl/
H A DDSLExpression.h175 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/backends/lib/
H A Dsnprintf.c279 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...]
/kernel/linux/linux-5.10/net/sunrpc/
H A Dsysctl.c90 size_t left, len; in proc_dodebug() local
97 left = *lenp; in proc_dodebug()
101 while (left && isspace(*p)) { in proc_dodebug()
102 left--; in proc_dodebug()
105 if (!left) in proc_dodebug()
108 if (left > sizeof(tmpbuf) - 1) in proc_dodebug()
110 memcpy(tmpbuf, p, left); in proc_dodebug()
111 tmpbuf[left] = '\0'; in proc_dodebug()
115 left -= (s - tmpbuf); in proc_dodebug()
116 if (left in proc_dodebug()
[all...]
/kernel/linux/linux-6.6/net/sunrpc/
H A Dsysctl.c71 size_t left, len; in proc_dodebug() local
78 left = *lenp; in proc_dodebug()
82 while (left && isspace(*p)) { in proc_dodebug()
83 left--; in proc_dodebug()
86 if (!left) in proc_dodebug()
89 if (left > sizeof(tmpbuf) - 1) in proc_dodebug()
91 memcpy(tmpbuf, p, left); in proc_dodebug()
92 tmpbuf[left] = '\0'; in proc_dodebug()
96 left -= (s - tmpbuf); in proc_dodebug()
97 if (left in proc_dodebug()
[all...]
/kernel/liteos_a/kernel/base/ipc/
H A Dlos_ipcdebug.c40 UINT32 left = start; in OsArraySortByTime() local
45 while (left < right) { in OsArraySortByTime()
46 while ((left < right) && (sortArray[right] < sortParam->ipcDebugCBCnt) && (pivot < sortParam->ipcDebugCBCnt) && in OsArraySortByTime()
51 if (left < right) { in OsArraySortByTime()
52 sortArray[left] = sortArray[right]; in OsArraySortByTime()
54 left++; in OsArraySortByTime()
57 while ((left < right) && (sortArray[left] < sortParam->ipcDebugCBCnt) && (pivot < sortParam->ipcDebugCBCnt) && in OsArraySortByTime()
58 compareFunc(sortParam, pivot, sortArray[left])) { in OsArraySortByTime()
59 left in OsArraySortByTime()
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Duidgid.h69 static inline bool uid_eq(kuid_t left, kuid_t right) in uid_eq() argument
71 return __kuid_val(left) == __kuid_val(right); in uid_eq()
74 static inline bool gid_eq(kgid_t left, kgid_t right) in gid_eq() argument
76 return __kgid_val(left) == __kgid_val(right); in gid_eq()
79 static inline bool uid_gt(kuid_t left, kuid_t right) in uid_gt() argument
81 return __kuid_val(left) > __kuid_val(right); in uid_gt()
84 static inline bool gid_gt(kgid_t left, kgid_t right) in gid_gt() argument
86 return __kgid_val(left) > __kgid_val(right); in gid_gt()
89 static inline bool uid_gte(kuid_t left, kuid_t right) in uid_gte() argument
91 return __kuid_val(left) > in uid_gte()
94 gid_gte(kgid_t left, kgid_t right) gid_gte() argument
99 uid_lt(kuid_t left, kuid_t right) uid_lt() argument
104 gid_lt(kgid_t left, kgid_t right) gid_lt() argument
109 uid_lte(kuid_t left, kuid_t right) uid_lte() argument
114 gid_lte(kgid_t left, kgid_t right) gid_lte() argument
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Duidgid.h69 static inline bool uid_eq(kuid_t left, kuid_t right) in uid_eq() argument
71 return __kuid_val(left) == __kuid_val(right); in uid_eq()
74 static inline bool gid_eq(kgid_t left, kgid_t right) in gid_eq() argument
76 return __kgid_val(left) == __kgid_val(right); in gid_eq()
79 static inline bool uid_gt(kuid_t left, kuid_t right) in uid_gt() argument
81 return __kuid_val(left) > __kuid_val(right); in uid_gt()
84 static inline bool gid_gt(kgid_t left, kgid_t right) in gid_gt() argument
86 return __kgid_val(left) > __kgid_val(right); in gid_gt()
89 static inline bool uid_gte(kuid_t left, kuid_t right) in uid_gte() argument
91 return __kuid_val(left) > in uid_gte()
94 gid_gte(kgid_t left, kgid_t right) gid_gte() argument
99 uid_lt(kuid_t left, kuid_t right) uid_lt() argument
104 gid_lt(kgid_t left, kgid_t right) gid_lt() argument
109 uid_lte(kuid_t left, kuid_t right) uid_lte() argument
114 gid_lte(kgid_t left, kgid_t right) gid_lte() argument
[all...]
H A Dregset.h22 size_t left; member
27 if (s->left) { in membuf_zero()
28 if (size > s->left) in membuf_zero()
29 size = s->left; in membuf_zero()
32 s->left -= size; in membuf_zero()
34 return s->left; in membuf_zero()
39 if (s->left) { in membuf_write()
40 if (size > s->left) in membuf_write()
41 size = s->left; in membuf_write()
44 s->left in membuf_write()
[all...]
/third_party/mesa3d/src/util/
H A Drb_tree.c82 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/node/deps/v8/src/compiler/
H A Dmachine-operator-reducer.cc339 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...]
/foundation/graphic/graphic_3d/lume/LumeBase/api/base/util/
H A Dbase64_encode.h36 inline void ToBase64(const uint8_t* threeBytes, char* output, signed left) in ToBase64() argument
41 output[2U] = left > 1 ? (TO_BASE64[((threeBytes[1u] << 2u) | (threeBytes[2u] >> 6u)) & 0x3f]) : '='; in ToBase64()
42 output[3U] = left > 2 ? TO_BASE64[threeBytes[2u] & 0x3f] : '='; in ToBase64()
45 inline signed EncodeTriplets(char*& dst, const uint8_t*& src, signed left) in EncodeTriplets() argument
47 for (; left >= 3; left -= 3) { in EncodeTriplets()
52 return left; in EncodeTriplets()
55 inline void FillTriplet(uint8_t* dst, const uint8_t*& src, signed left) in FillTriplet() argument
57 switch (left) { in FillTriplet()
65 inline void EncodeTail(char* dst, const uint8_t* src, signed left) in EncodeTail() argument
86 signed left = static_cast<signed>(binaryData.size()); Base64Encode() local
[all...]
/foundation/arkui/ace_engine/frameworks/core/components/common/properties/
H A Dedge.h30 // Types of padding and margin. Contains four directions: left, top, right and bottom.
38 Edge(double left, double top, double right, double bottom, DimensionUnit unit = DimensionUnit::PX) in Edge() argument
39 : left_(Dimension(left, unit)), top_(Dimension(top, unit)), right_(Dimension(right, unit)), in Edge()
41 Edge(const std::string& left, const std::string& top, const std::string& right, const std::string& bottom, in Edge() argument
42 DimensionUnit unit = DimensionUnit::CALC) : left_(CalcDimension(left, unit)), top_(CalcDimension(top, unit)), in Edge()
44 Edge(const CalcDimension& left, const CalcDimension& top, const CalcDimension& right, const CalcDimension& bottom) in Edge() argument
45 : left_(left), top_(top), right_(right), bottom_(bottom) {} in Edge()
46 Edge(const Dimension& left, const Dimension& top, const Dimension& right, const Dimension& bottom, in Edge() argument
48 : left_(AnimatableDimension(left, option)), top_(AnimatableDimension(top, option)), in Edge()
50 Edge(const CalcDimension& left, cons in Edge() argument
78 SetLeft(const AnimatableDimension& left) SetLeft() argument
83 SetLeft(const CalcDimension& left) SetLeft() argument
89 SetLeft(const Dimension& left) SetLeft() argument
203 EdgePx(double left, double top, double right, double bottom) EdgePx() argument
204 EdgePx(const std::string& left, const std::string& top, const std::string& right, const std::string& bottom) EdgePx() argument
[all...]
/third_party/ffmpeg/libavcodec/alpha/
H A Dme_cmp_mvi_asm.S65 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 Doperators.cc92 "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/ffmpeg/libavutil/
H A Dqsort.h45 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/protobuf/java/core/src/main/java/com/google/protobuf/
H A DRopeByteString.java134 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/f2fs-tools/fsck/
H A Ddict.c51 #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...]
/kernel/linux/linux-5.10/fs/quota/
H A Dkqid.c8 * @left: A qid value
13 bool qid_eq(struct kqid left, struct kqid right) in qid_eq() argument
15 if (left.type != right.type) in qid_eq()
17 switch(left.type) { in qid_eq()
19 return uid_eq(left.uid, right.uid); in qid_eq()
21 return gid_eq(left.gid, right.gid); in qid_eq()
23 return projid_eq(left.projid, right.projid); in qid_eq()
32 * @left: The possibly lesser qid value
35 * Return true if left is less than right and false otherwise.
37 bool qid_lt(struct kqid left, struc argument
[all...]
/kernel/linux/linux-6.6/fs/quota/
H A Dkqid.c8 * @left: A qid value
13 bool qid_eq(struct kqid left, struct kqid right) in qid_eq() argument
15 if (left.type != right.type) in qid_eq()
17 switch(left.type) { in qid_eq()
19 return uid_eq(left.uid, right.uid); in qid_eq()
21 return gid_eq(left.gid, right.gid); in qid_eq()
23 return projid_eq(left.projid, right.projid); in qid_eq()
32 * @left: The possibly lesser qid value
35 * Return true if left is less than right and false otherwise.
37 bool qid_lt(struct kqid left, struc argument
[all...]
/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A Ddm-btree-remove.c25 * Each node may have a left or right sibling. When decending the spine,
32 * [B] No left sibling
36 * ==> rebalance(left sibling, node)
38 * [D] Both siblings, total_entries(left, node, right) <= DEL_THRESHOLD
39 * ==> delete node adding it's contents to left and right
41 * [E] Both siblings, total_entries(left, node, right) > DEL_THRESHOLD
42 * ==> rebalance(left, node, right)
82 static void node_copy(struct btree_node *left, struct btree_node *right, int shift) in node_copy() argument
84 uint32_t nr_left = le32_to_cpu(left->header.nr_entries); in node_copy()
85 uint32_t value_size = le32_to_cpu(left in node_copy()
173 shift(struct btree_node *left, struct btree_node *right, int count) shift() argument
202 struct btree_node *left = l->n; __rebalance2() local
242 struct child left, right; rebalance2() local
269 delete_center_node(struct dm_btree_info *info, struct btree_node *parent, struct child *l, struct child *c, struct child *r, struct btree_node *left, struct btree_node *center, struct btree_node *right, uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) delete_center_node() argument
300 redistribute3(struct dm_btree_info *info, struct btree_node *parent, struct child *l, struct child *c, struct child *r, struct btree_node *left, struct btree_node *center, struct btree_node *right, uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) redistribute3() argument
350 struct btree_node *left = l->n; __rebalance3() local
376 struct child left, center, right; rebalance3() local
[all...]
/third_party/zlib/examples/
H A Dgzjoin.c81 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...]
/foundation/window/window_manager/window_scene/screen_session_manager/src/
H A Dscreen_session_dumper.cpp173 oss << std::left << "[" << tracker.formatTimestamp(info.timestamp).c_str() in DumpEventTracker()
183 oss << std::left << "[oldScbPid:] "; in DumpMultiUserInfo() member in OHOS::Rosen::std
188 oss << std::left << "[userId:] " << userId << std::endl; in DumpMultiUserInfo()
189 oss << std::left << "[ScbPid:] " << ScbPid << std::endl; in DumpMultiUserInfo()
198 oss << std::left << "[PID: " << pid << "]: " in DumpFreezedPidList()
261 oss << std::left << std::setw(LINE_WIDTH) << "FoldStatus: " in DumpFoldStatus()
276 oss << std::left << std::setw(LINE_WIDTH) << "TentMode: " in DumpTentMode()
290 oss << std::left << std::setw(LINE_WIDTH) << "Name: " in DumpScreenSessionById()
292 oss << std::left << std::setw(LINE_WIDTH) << "RSScreenId: " in DumpScreenSessionById()
296 oss << std::left << st in DumpScreenSessionById()
[all...]
/third_party/alsa-lib/src/
H A Dconfeval.c131 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/cups-filters/filter/pdftopdf/
H A Dpptypes.cc79 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...]
/kernel/linux/linux-5.10/drivers/media/pci/bt8xx/
H A Dbtcx-risc.c87 if (win->left < 0) { in btcx_screen_clips()
88 /* left */ in btcx_screen_clips()
89 clips[n].c.left = 0; in btcx_screen_clips()
91 clips[n].c.width = -win->left; in btcx_screen_clips()
95 if (win->left + win->width > swidth) { in btcx_screen_clips()
97 clips[n].c.left = swidth - win->left; in btcx_screen_clips()
99 clips[n].c.width = win->width - clips[n].c.left; in btcx_screen_clips()
105 clips[n].c.left = 0; in btcx_screen_clips()
113 clips[n].c.left in btcx_screen_clips()
[all...]

Completed in 13 milliseconds

12345678910>>...170