/third_party/python/Lib/ |
H A D | types.py | 219 def throw(self, tp, *rest): 220 return self.__wrapped.throw(tp, *rest)
|
/third_party/rust/crates/nom/src/combinator/ |
H A D | tests.rs | 76 assert_parse!(rest(input), Ok((empty, input))); in end_of_input() 83 assert_parse!(rest(input), Ok((empty, input))); in rest_on_strs()
|
/third_party/rust/crates/minimal-lexical/etc/correctness/test-parse-random/ |
H A D | runtests.py | 203 rest, stderr = proc.communicate() 206 for line in rest.split(b'\n'):
|
/third_party/rust/crates/syn/src/ |
H A D | buffer.rs | 267 let (ident, rest) = next.ident()?; 272 Some((lifetime, rest)) 283 while let Some((tt, rest)) = cursor.token_tree() { in token_stream() 285 cursor = rest; in token_stream() 306 let rest = unsafe { Cursor::create(self.ptr.add(len), self.scope) }; 307 Some((tree, rest))
|
/third_party/python/Objects/ |
H A D | exceptions.c | 906 * This function is used by split() to construct the match/rest parts, in exceptiongroup_subset() 1066 PyObject *rest; member 1077 result->rest = NULL; in exceptiongroup_split_recursive() 1093 result->rest = Py_NewRef(exc); in exceptiongroup_split_recursive() 1132 assert(!rec_result.rest); in exceptiongroup_split_recursive() 1141 Py_XDECREF(rec_result.rest); in exceptiongroup_split_recursive() 1146 if (rec_result.rest) { in exceptiongroup_split_recursive() 1149 if (PyList_Append(rest_list, rec_result.rest) < 0) { in exceptiongroup_split_recursive() 1150 Py_DECREF(rec_result.rest); in exceptiongroup_split_recursive() 1153 Py_DECREF(rec_result.rest); in exceptiongroup_split_recursive() [all...] |
/kernel/linux/linux-5.10/fs/reiserfs/ |
H A D | bitmap.c | 180 * search for a zero bit fails or the rest of bitmap block in scan_bitmap_block() 1157 int rest = amount_needed; in allocate_without_wrapping_disk() local 1160 while (rest > 0 && start <= finish) { in allocate_without_wrapping_disk() 1162 rest + prealloc_size, in allocate_without_wrapping_disk() 1169 while (rest > 0 && nr_allocated > 0) { in allocate_without_wrapping_disk() 1171 rest--; in allocate_without_wrapping_disk() 1191 return (amount_needed - rest); in allocate_without_wrapping_disk()
|
/kernel/linux/linux-6.6/fs/reiserfs/ |
H A D | bitmap.c | 180 * search for a zero bit fails or the rest of bitmap block in scan_bitmap_block() 1157 int rest = amount_needed; in allocate_without_wrapping_disk() local 1160 while (rest > 0 && start <= finish) { in allocate_without_wrapping_disk() 1162 rest + prealloc_size, in allocate_without_wrapping_disk() 1169 while (rest > 0 && nr_allocated > 0) { in allocate_without_wrapping_disk() 1171 rest--; in allocate_without_wrapping_disk() 1191 return (amount_needed - rest); in allocate_without_wrapping_disk()
|
/third_party/python/Modules/_decimal/libmpdec/ |
H A D | io.c | 984 * reverse order, starting with the rest of the numeric string. 991 const char *rest, mpd_ssize_t n_rest, /* remaining part and length */ in _mpd_add_sep_dot() 1005 _mbstr_copy_ascii(dest, rest, n_rest); in _mpd_add_sep_dot() 1096 const char *rest, *dp; in _mpd_apply_lconv() local 1118 /* rest */ in _mpd_apply_lconv() 1119 rest = dp; in _mpd_apply_lconv() 1132 rest, n_rest, spec); in _mpd_apply_lconv() 1143 rest, n_rest, spec); in _mpd_apply_lconv() 987 _mpd_add_sep_dot(mpd_mbstr_t *dest, const char *sign, const char *src, mpd_ssize_t n_src, const char *dot, const char *rest, mpd_ssize_t n_rest, const mpd_spec_t *spec) _mpd_add_sep_dot() argument
|
/third_party/lwip/src/core/ |
H A D | tcp_in.c | 497 struct pbuf *rest = NULL; 498 pbuf_split_64k(recv_data, &rest); 509 if (rest != NULL) { 510 pbuf_free(rest); 521 if (rest != NULL) { 522 pbuf_free(rest); 531 if (rest != NULL) { 532 pbuf_cat(recv_data, rest); 540 /* Upper layer received the data, go on with the rest if > 64K */ 541 recv_data = rest; [all...] |
/kernel/linux/linux-5.10/arch/h8300/lib/ |
H A D | memcpy.S | 51 ;; rest
|
/third_party/musl/src/thread/powerpc/ |
H A D | syscall_cp.s | 44 # syscall: number goes to r0, the rest 3-8
|
/third_party/typescript/tests/baselines/reference/ |
H A D | infiniteConstraints.js | 43 ((arg: Elm, ...rest: T) => void) extends ((...args: infer T2) => void) ? T2 :
|
/kernel/linux/linux-5.10/fs/f2fs/ |
H A D | xattr.c | 566 size_t rest = buffer_size; in f2fs_listxattr() local 599 if (size > rest) { in f2fs_listxattr() 609 rest -= size; in f2fs_listxattr() 611 error = buffer_size - rest; in f2fs_listxattr()
|
/kernel/linux/linux-5.10/init/ |
H A D | main.c | 322 #define rest(dst, end) ((end) > (dst) ? (end) - (dst) : 0) macro 340 ret = snprintf(buf, rest(buf, end), "%s ", xbc_namebuf); in xbc_snprint_cmdline() 347 ret = snprintf(buf, rest(buf, end), "%s=\"%s\" ", in xbc_snprint_cmdline() 357 #undef rest macro 1053 /* Do the rest non-__init'ed, we're now alive */ in start_kernel()
|
/kernel/linux/linux-6.6/fs/f2fs/ |
H A D | xattr.c | 568 size_t rest = buffer_size; in f2fs_listxattr() local 601 if (size > rest) { in f2fs_listxattr() 611 rest -= size; in f2fs_listxattr() 613 error = buffer_size - rest; in f2fs_listxattr()
|
/kernel/linux/linux-6.6/init/ |
H A D | main.c | 321 #define rest(dst, end) ((end) > (dst) ? (end) - (dst) : 0) macro 339 ret = snprintf(buf, rest(buf, end), "%s ", xbc_namebuf); in xbc_snprint_cmdline() 346 ret = snprintf(buf, rest(buf, end), "%s=\"%s\" ", in xbc_snprint_cmdline() 356 #undef rest macro 1072 /* Do the rest non-__init'ed, we're now alive */ in start_kernel()
|
/third_party/curl/lib/ |
H A D | mqtt.c | 677 /* read rest of packet, but no more. Cap to buffer size */ in mqtt_read_publish() 679 size_t rest = mq->npacket; in mqtt_read_publish() local 680 if(rest > sizeof(buffer)) in mqtt_read_publish() 681 rest = sizeof(buffer); in mqtt_read_publish() 682 result = Curl_read(data, sockfd, buffer, rest, &nread); in mqtt_read_publish()
|
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
H A D | AlphabeticIndex.java | 513 int rest = current.charAt(BASE.length()); in fixLabel() 514 if (0x2800 < rest && rest <= 0x28FF) { // stroke count in fixLabel() 515 return (rest-0x2800) + "\u5283"; in fixLabel()
|
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | Trie2Writable.java | 396 int block, rest, repeatBlock; in setRange() 430 rest=limit&UTRIE2_DATA_MASK; in setRange() 502 if(rest>0) { in setRange() 505 fillBlock(block, 0, rest, value, initialValue, overwrite); in setRange()
|
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/ |
H A D | Trie2Writable.java | 398 int block, rest, repeatBlock; in setRange() 432 rest=limit&UTRIE2_DATA_MASK; in setRange() 504 if(rest>0) { in setRange() 507 fillBlock(block, 0, rest, value, initialValue, overwrite); in setRange()
|
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
H A D | AlphabeticIndex.java | 494 int rest = current.charAt(BASE.length()); in fixLabel() 495 if (0x2800 < rest && rest <= 0x28FF) { // stroke count in fixLabel() 496 return (rest-0x2800) + "\u5283"; in fixLabel()
|
/third_party/icu/icu4c/source/common/ |
H A D | utrie.cpp | 291 int32_t block, rest, repeatBlock; in utrie_setRange32() local 326 rest=limit&UTRIE_MASK; in utrie_setRange32() 363 if(rest>0) { in utrie_setRange32() 370 utrie_fillBlock(trie->data+block, 0, rest, value, initialValue, overwrite); in utrie_setRange32()
|
/third_party/node/deps/icu-small/source/common/ |
H A D | utrie.cpp | 291 int32_t block, rest, repeatBlock; in utrie_setRange32() local 326 rest=limit&UTRIE_MASK; in utrie_setRange32() 363 if(rest>0) { in utrie_setRange32() 370 utrie_fillBlock(trie->data+block, 0, rest, value, initialValue, overwrite); in utrie_setRange32()
|
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/ |
H A D | RangeTree.java | 733 private RangeTree union(RangeTree first, RangeTree... rest) { in union() argument 735 for (RangeTree t : rest) { in union() 775 private RangeTree intersect(RangeTree first, RangeTree... rest) { in intersect() argument 777 for (RangeTree t : rest) { in intersect()
|
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/table/ |
H A D | RangeTable.java | 502 public RangeTable subTable(RangeTree bounds, Column<?> first, Column<?>... rest) { in subTable() argument 503 return subTable(bounds, ImmutableSet.<Column<?>>builder().add(first).add(rest).build()); in subTable() 666 Column<?>... rest) { in simplify() 670 ImmutableList<Change> rows = subTable(getAllRanges(), first, rest).toChanges(); in simplify() 662 simplify( Function<Change, RangeTree> simplifyFn, int minPrefixLength, Column<?> first, Column<?>... rest) simplify() argument
|