Home
last modified time | relevance | path

Searched refs:left (Results 701 - 725 of 3207) sorted by relevance

1...<<21222324252627282930>>...129

/third_party/node/deps/v8/src/compiler/
H A Dint64-lowering.cc420 Node* left = node->InputAt(0); in LowerNode() local
424 graph()->NewNode(machine()->Word32And(), GetReplacementLow(left), in LowerNode()
427 graph()->NewNode(machine()->Word32And(), GetReplacementHigh(left), in LowerNode()
446 Node* left = node->InputAt(0); in LowerNode() local
447 node->ReplaceInput(0, GetReplacementLow(left)); in LowerNode()
448 node->InsertInput(zone(), 1, GetReplacementHigh(left)); in LowerNode()
462 Node* left = node->InputAt(0); in LowerNode() local
463 node->ReplaceInput(0, GetReplacementLow(left)); in LowerNode()
464 node->InsertInput(zone(), 1, GetReplacementHigh(left)); in LowerNode()
478 Node* left in LowerNode() local
489 Node* left = node->InputAt(0); LowerNode() local
503 Node* left = node->InputAt(0); LowerNode() local
577 Node* left = node->InputAt(0); LowerNode() local
1063 Node* left = node->InputAt(0); LowerComparison() local
[all...]
H A Dloop-variable-optimizer.h89 Node* left; member
94 return left != other.left || kind != other.kind || right != other.right; in operator !=()
/third_party/node/deps/v8/src/builtins/
H A Dbuiltins-string-gen.cc126 void StringBuiltinsAssembler::GenerateStringEqual(TNode<String> left, in GenerateStringEqual() argument
128 TVARIABLE(String, var_left, left); in GenerateStringEqual()
133 TNode<IntPtrT> lhs_length = LoadStringLengthAsWord(left); in GenerateStringEqual()
314 TNode<String> left, in AllocateConsString()
318 TNode<Int32T> left_instance_type = LoadInstanceType(left); in AllocateConsString()
322 // any of {left} or {right} has two byte encoding. in AllocateConsString()
336 StoreObjectFieldNoWriteBarrier(result, ConsString::kFirstOffset, left); in AllocateConsString()
342 TNode<ContextOrEmptyContext> context, TNode<String> left, in StringAdd()
351 TNode<Uint32T> left_length = LoadStringLengthAsWord32(left); in StringAdd()
359 result = left; in StringAdd()
313 AllocateConsString(TNode<Uint32T> length, TNode<String> left, TNode<String> right) AllocateConsString() argument
341 StringAdd( TNode<ContextOrEmptyContext> context, TNode<String> left, TNode<String> right) StringAdd() argument
539 auto left = Parameter<String>(Descriptor::kLeft); TF_BUILTIN() local
554 GenerateStringRelationalComparison( TNode<String> left, TNode<String> right, Operation op) GenerateStringRelationalComparison() argument
724 auto left = Parameter<String>(Descriptor::kLeft); TF_BUILTIN() local
730 auto left = Parameter<String>(Descriptor::kLeft); TF_BUILTIN() local
736 auto left = Parameter<String>(Descriptor::kLeft); TF_BUILTIN() local
742 auto left = Parameter<String>(Descriptor::kLeft); TF_BUILTIN() local
748 auto left = Parameter<String>(Descriptor::kLeft); TF_BUILTIN() local
[all...]
/kernel/linux/linux-5.10/net/ceph/crush/
H A Dmapper.c179 static int left(int x) in left() function
214 /* descend to the left or right? */ in bucket_tree_choose()
215 l = left(n); in bucket_tree_choose()
647 int x, int left, int numrep, int type, in crush_choose_indep()
657 int endpos = outpos + left; in crush_choose_indep()
676 for (ftotal = 0; left > 0 && ftotal < tries; ftotal++) { in crush_choose_indep()
679 dprintk("%u %d a: ", ftotal, left); in crush_choose_indep()
684 dprintk("%u %d b: ", ftotal, left); in crush_choose_indep()
735 left--; in crush_choose_indep()
755 left in crush_choose_indep()
643 crush_choose_indep(const struct crush_map *map, struct crush_work *work, const struct crush_bucket *bucket, const __u32 *weight, int weight_max, int x, int left, int numrep, int type, int *out, int outpos, unsigned int tries, unsigned int recurse_tries, int recurse_to_leaf, int *out2, int parent_r, const struct crush_choose_arg *choose_args) crush_choose_indep() argument
[all...]
/kernel/linux/linux-6.6/net/ceph/crush/
H A Dmapper.c179 static int left(int x) in left() function
214 /* descend to the left or right? */ in bucket_tree_choose()
215 l = left(n); in bucket_tree_choose()
647 int x, int left, int numrep, int type, in crush_choose_indep()
657 int endpos = outpos + left; in crush_choose_indep()
676 for (ftotal = 0; left > 0 && ftotal < tries; ftotal++) { in crush_choose_indep()
679 dprintk("%u %d a: ", ftotal, left); in crush_choose_indep()
684 dprintk("%u %d b: ", ftotal, left); in crush_choose_indep()
735 left--; in crush_choose_indep()
755 left in crush_choose_indep()
643 crush_choose_indep(const struct crush_map *map, struct crush_work *work, const struct crush_bucket *bucket, const __u32 *weight, int weight_max, int x, int left, int numrep, int type, int *out, int outpos, unsigned int tries, unsigned int recurse_tries, int recurse_to_leaf, int *out2, int parent_r, const struct crush_choose_arg *choose_args) crush_choose_indep() argument
[all...]
/third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/d3d/d3d9/
H A DBlit9.cpp171 rect.left = 0; in getSurfaceRect()
353 destOffset.x + (sourceRect.right - sourceRect.left), in copy()
370 adjustedSourceRect.left = 0; in copy()
371 adjustedSourceRect.right = sourceRect.right - sourceRect.left; in copy()
375 sourceSize.width = sourceRect.right - sourceRect.left; in copy()
405 destRect.left = destOffset.x; in formatConvert()
406 destRect.right = destOffset.x + (sourceRect.right - sourceRect.left); in formatConvert()
597 sourceRect.right - sourceRect.left, sourceRect.bottom - sourceRect.top, 1, in copySurfaceToTexture()
621 vp.X = destRect.left; in setViewportAndShaderConstants()
623 vp.Width = destRect.right - destRect.left; in setViewportAndShaderConstants()
[all...]
/third_party/skia/src/core/
H A DSkScan_Path.cpp110 int left SK_INIT_TO_AVOID_WARNING; in walk_edges()
126 left = x; in walk_edges()
132 int width = x - left; in walk_edges()
135 blitter->blitH(left, curr_y, width); in walk_edges()
173 int width = rightClip - left; in walk_edges()
175 blitter->blitH(left, curr_y, width); in walk_edges()
242 SkFixed left = leftE->fX; in walk_simple_edges() local
250 int L = SkFixedRoundToInt(left); in walk_simple_edges()
262 int L = SkFixedRoundToInt(left); in walk_simple_edges()
272 // left o in walk_simple_edges()
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/net/
H A Dtls.c1238 size_t left = data; in TEST_F() local
1243 while (left) { in TEST_F()
1245 left > 16384 ? 16384 : left, 0); in TEST_F()
1248 left -= res; in TEST_F()
1256 size_t left = data; in TEST_F() local
1259 while (left) { in TEST_F()
1261 left > 16384 ? 16384 : left, 0); in TEST_F()
1264 left in TEST_F()
1292 size_t left = data; TEST_F() local
1318 size_t left = data; TEST_F() local
1383 size_t left = data * read_bias; test_mutliproc() local
1396 size_t left = data * write_bias; test_mutliproc() local
[all...]
/kernel/linux/linux-5.10/drivers/hid/
H A Dhid-betopff.c42 __u16 left, right; in hid_betopff_play() local
44 left = effect->u.rumble.strong_magnitude; in hid_betopff_play()
47 betopff->report->field[2]->value[0] = left / 256; in hid_betopff_play()
/kernel/linux/linux-5.10/include/linux/
H A Dinterval_tree_generic.h89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
91 if (start <= left->ITSUBTREE) { \
93 * Some nodes in left subtree satisfy Cond2. \
100 node = left; \
171 /* Move up the tree until we come from a node's left child */ \
/kernel/linux/linux-6.6/include/linux/
H A Dinterval_tree_generic.h89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
91 if (start <= left->ITSUBTREE) { \
93 * Some nodes in left subtree satisfy Cond2. \
100 node = left; \
171 /* Move up the tree until we come from a node's left child */ \
/kernel/linux/linux-6.6/drivers/hid/
H A Dhid-betopff.c42 __u16 left, right; in hid_betopff_play() local
44 left = effect->u.rumble.strong_magnitude; in hid_betopff_play()
47 betopff->report->field[2]->value[0] = left / 256; in hid_betopff_play()
/kernel/liteos_a/kernel/base/vm/
H A Dlos_vm_page.c103 UINT32 left = nPage & 0x7; /* 0x7: nPage % 8, left page */ in OsVmPageStartup() local
116 for (; left > 0; left--) { in OsVmPageStartup()
/kernel/linux/linux-6.6/tools/include/linux/
H A Dinterval_tree_generic.h89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
91 if (start <= left->ITSUBTREE) { \
93 * Some nodes in left subtree satisfy Cond2. \
100 node = left; \
171 /* Move up the tree until we come from a node's left child */ \
/third_party/ffmpeg/libavcodec/
H A Dlossless_videodsp.c44 int *left, int *left_top) in add_median_pred_c()
49 l = *left; in add_median_pred_c()
58 *left = l; in add_median_pred_c()
42 add_median_pred_c(uint8_t *dst, const uint8_t *src1, const uint8_t *diff, ptrdiff_t w, int *left, int *left_top) add_median_pred_c() argument
H A Dlossless_videoencdsp.c58 int *left, int *left_top) in sub_median_pred_c()
63 l = *left; in sub_median_pred_c()
73 *left = l; in sub_median_pred_c()
56 sub_median_pred_c(uint8_t *dst, const uint8_t *src1, const uint8_t *src2, intptr_t w, int *left, int *left_top) sub_median_pred_c() argument
/third_party/f2fs-tools/fsck/
H A Ddefrag.c63 int f2fs_defragment(struct f2fs_sb_info *sbi, u64 from, u64 len, u64 to, int left) in f2fs_defragment() argument
80 if (find_next_free_block(sbi, &target, left, se->type, false)) { in f2fs_defragment()
92 move_curseg_info(sbi, to, left); in f2fs_defragment()
/third_party/ffmpeg/libavformat/
H A Ddtshddec.c145 int64_t size, left; in raw_read_packet() local
148 left = dtshd->data_end - avio_tell(s->pb); in raw_read_packet()
149 size = FFMIN(left, 1024); in raw_read_packet()
/third_party/cups-filters/filter/pdftopdf/
H A Dqpdf_xobject.cc107 tmp.left=0; in makeXObject()
113 mtx.translate(tmp.left,tmp.bottom); // 1. move origin to end up at left,bottom after rotation in makeXObject()
116 mtx.translate(-bbox.left,-bbox.bottom); // 3. move origin from 0,0 to "form space" in makeXObject()
/third_party/ltp/tools/sparse/sparse-src/
H A Dallocate.c101 if (!blob || blob->left < size) { in allocate()
114 blob->left = chunking - offset; in allocate()
119 blob->left -= size; in allocate()
/third_party/rust/crates/codespan/codespan-reporting/examples/
H A Dreusable_diagnostic.rs60 Error::MismatchType(left, right) => Diagnostic::error() in report()
66 left.content, right.content, in report()
68 Label::secondary((), left.range.clone()).with_message("expected due to this"), in report()
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/
H A DRewriteSampleMaskVariable.cpp73 TIntermSymbol *left = node->getLeft()->getAsSymbolNode(); variable
74 if (!left)
78 if (left->getName() != mTargetStr)
/third_party/skia/src/sksl/dsl/
H A DDSLStatement.cpp85 DSLStatement operator,(DSLStatement left, DSLStatement right) { in operator ,() argument
86 int line = left.fStatement->fLine; in operator ,()
89 stmts.push_back(left.release()); in operator ,()
/third_party/skia/third_party/externals/freetype/src/base/
H A Dftpfr.c99 FT_UInt left, in FT_EXPORT_DEF()
115 error = service->get_kerning( face, left, right, avector ); in FT_EXPORT_DEF()
117 error = FT_Get_Kerning( face, left, right, in FT_EXPORT_DEF()
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-aat-layout-opbd-table.hh84 * int16 values for the left-side, top-side,
99 hb_position_t left = 0, top = 0, right = 0, bottom = 0, ignore; in get_bounds() local
100 if (font->get_glyph_contour_point (glyph_id, bounds.leftSide, &left, &ignore) || in get_bounds()
106 *extents = {left, top, right, bottom}; in get_bounds()
121 * int16 values for the left-side, top-side,

Completed in 19 milliseconds

1...<<21222324252627282930>>...129