Home
last modified time | relevance | path

Searched refs:from (Results 1401 - 1425 of 7886) sorted by relevance

1...<<51525354555657585960>>...316

/test/xts/acts/location/geolocation_errorCode/entry/src/ohosTest/js/test/
H A DLocationErrorTest.test.js16 import geolocation from '@ohos.geolocation';
17 import geolocationm from '@ohos.geoLocationManager';
18 import abilityAccessCtrl from '@ohos.abilityAccessCtrl'
19 import bundle from '@ohos.bundle'
20 import osaccount from '@ohos.account.osAccount'
21 import {describe, beforeAll, beforeEach, afterEach, afterAll, it, expect} from '@ohos/hypium'
/test/xts/acts/security/huks/security_huks_reformed_test/huks_derive_promise_BasicTest/entry/src/ohosTest/js/test/Derive/
H A DSecurityHuksDeriveHKDFBasicFinish63KBPromiseJsunit.test.js16 import { describe, it } from '@ohos/hypium';
17 import Data from '../../../../../../../utils/data.json';
18 import { HuksDeriveHKDF } from '../../../../../../../utils/param/derive/publicDeriveParam';
19 import { stringToUint8Array } from '../../../../../../../utils/param/publicFunc';
20 import { publicDeriveFunc } from '../../../../../../../utils/param/derive/publicDerivePromise';
21 import { HksTag } from '../../../../../../../utils/param/publicParam';
H A DSecurityHuksDerivePBKDF2BasicFinish63KBPromiseJsunit.test.js16 import { describe, it } from '@ohos/hypium';
17 import Data from '../../../../../../../utils/data.json';
18 import { HuksDerivePBKDF2 } from '../../../../../../../utils/param/derive/publicDeriveParam';
19 import { stringToUint8Array } from '../../../../../../../utils/param/publicFunc';
20 import { publicDeriveFunc } from '../../../../../../../utils/param/derive/publicDerivePromise';
21 import { HksTag } from '../../../../../../../utils/param/publicParam';
/third_party/eudev/src/udev/
H A Dudev-builtin-usb_id.c84 static int set_usb_mass_storage_ifsubtype(char *to, const char *from, size_t len) { in set_usb_mass_storage_ifsubtype() argument
89 type_num = strtoul(from, &eptr, 0); in set_usb_mass_storage_ifsubtype()
90 if (eptr != from) { in set_usb_mass_storage_ifsubtype()
115 static void set_scsi_type(char *to, const char *from, size_t len) { in set_scsi_type() argument
120 type_num = strtoul(from, &eptr, 0); in set_scsi_type()
121 if (eptr != from) { in set_scsi_type()
217 * 1.) Get the USB device type from InterfaceClass and InterfaceSubClass
/third_party/gn/src/gn/
H A Dcommand_path.cc103 // Don't print toolchains unless they differ from the first target. in PrintPath()
119 // Take type from the next entry. in PrintPath()
137 // Don't try to insert the 0th item in the list which is the "from" target. in InsertTargetsIntoFoundPaths()
139 // if the "from" target was in the list, subsequent passes could never run in InsertTargetsIntoFoundPaths()
143 // here but the "from" item is erased at the beginning of each search, but in InsertTargetsIntoFoundPaths()
169 void BreadthFirstSearch(const Target* from, in BreadthFirstSearch() argument
175 // Seed the initial stack with just the "from" target. in BreadthFirstSearch()
177 initial_stack.emplace_back(from, DepType::NONE); in BreadthFirstSearch()
250 void DoSearch(const Target* from, in DoSearch() argument
254 BreadthFirstSearch(from, t in DoSearch()
[all...]
/third_party/alsa-lib/src/pcm/
H A Dmask_inline.h142 MASK_INLINE void snd_mask_set_range(snd_mask_t *mask, unsigned int from, unsigned int to) in snd_mask_set_range() argument
145 assert(to <= SND_MASK_MAX && from <= to); in snd_mask_set_range()
146 for (i = from; i <= to; i++) in snd_mask_set_range()
150 MASK_INLINE void snd_mask_reset_range(snd_mask_t *mask, unsigned int from, unsigned int to) in snd_mask_reset_range() argument
153 assert(to <= SND_MASK_MAX && from <= to); in snd_mask_reset_range()
154 for (i = from; i <= to; i++) in snd_mask_reset_range()
/third_party/icu/icu4c/source/test/cintltst/
H A Dcbiditransformtst.c64 static void shapeLetters(UChar *str, const UChar *from, const UChar *to);
216 shapeLetters(UChar *str, const UChar *from, const UChar *to) in shapeLetters() argument
223 index = c - from[0]; in shapeLetters()
224 if (index < NUM_LETTERS && from[index * from[NUM_LETTERS]] != 0) { in shapeLetters()
227 str[j] = to[index * from[NUM_LETTERS]]; in shapeLetters()
/third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/
H A Dkernel.h435 static inline unsigned long copy_from_user(void *to, const void *from, unsigned long n) in copy_from_user() argument
437 if ((to == NULL) || (from == NULL)) { in copy_from_user()
441 return LOS_ArchCopyFromUser(to, from, n); in copy_from_user()
444 static inline unsigned long copy_to_user(void *to, const void *from, unsigned long n) in copy_to_user() argument
446 if ((to == NULL) || (from == NULL)) { in copy_to_user()
450 return LOS_ArchCopyToUser(to, from, n); in copy_to_user()
/third_party/node/test/parallel/
H A Dtest-blob.js51 const b = new Blob([Buffer.from('abc')]);
83 const b = new Blob(['hello', Buffer.from('world')]);
106 Buffer.from('world'),
115 const b = new Blob(['hello', Buffer.from('world')]);
160 const b = new Blob([Buffer.from('hello'), Buffer.from('world')]);
H A Dtest-buffer-fill.js377 const buf = Buffer.from('w00t');
391 Buffer.from('61006200610062006100620061006200', 'hex'));
395 Buffer.from('610062006100620061006200610062', 'hex'));
399 Buffer.from('61006200610062006100620061006200', 'hex'));
402 Buffer.from('61006100610061006100610061006100', 'hex'));
425 const buf = Buffer.from('a'.repeat(1000));
H A Dtest-repl.js70 // sending newlines from the REPL itself would be redundant
501 // The following test's result depends on the RegExp's match from the above
814 send: 'import comeOn from \'fhqwhgads\'',
825 send: 'import { export1, export2 } from "module-name"',
836 send: 'import * as name from "module-name";',
858 send: 'import { export1 as localName1, export2 } from "bar";',
869 send: 'import alias from "bar";',
880 send: 'import alias, {namedExport} from "bar";',
/third_party/skia/third_party/externals/spirv-cross/
H A Dspirv_cfg.cpp104 // Block back-edges from recursively revisiting ourselves. in post_order_visit()
165 // all coming from same scope, so be more conservative in this case. in post_order_visit()
179 // Multiple branches can come from the same scope due to "break;", so we need to assume that all branches in post_order_visit()
180 // come from same case scope in worst case, even if there are multiple preceding edges. in post_order_visit()
181 // If we have more than one succeeding edge from the block header, it should be impossible in post_order_visit()
183 // Only case this can go wrong is if we have 2 or more edges from block header and in post_order_visit()
217 void CFG::add_branch(uint32_t from, uint32_t to) in add_branch() argument
224 add_unique(preceding_edges[to], from); in add_branch()
225 add_unique(succeeding_edges[from], to); in add_branch()
242 // Only consider a loop dominator if we are branching from insid in find_loop_dominator()
278 node_terminates_control_flow_in_sub_graph(BlockID from, BlockID to) const node_terminates_control_flow_in_sub_graph() argument
[all...]
/third_party/typescript/tests/baselines/reference/
H A DoperationsAvailableOnPromisedType.js76 var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
77 if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
78 if (ar || !(i in from)) {
79 if (!ar) ar = Array.prototype.slice.call(from, 0, i);
80 ar[i] = from[i];
83 return to.concat(ar || Array.prototype.slice.call(from));
H A DgenericRestParameters3.js28 // Repro from #26110
55 // Repro from #26491
62 // Repro from #35066
68 // Repros from #47754
90 var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
91 if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
92 if (ar || !(i in from)) {
93 if (!ar) ar = Array.prototype.slice.call(from, 0, i);
94 ar[i] = from[i];
97 return to.concat(ar || Array.prototype.slice.call(from));
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Dprime_numbers.h15 * Starting from the first prime number 2 iterate over each prime number up to
27 * @from: the initial value
30 * Starting from @from iterate over each successive prime number up to the
32 * @max should be less than ULONG_MAX, and @from less than @max, to ensure
35 #define for_each_prime_number_from(prime, from, max) \
36 for (prime = (from); prime <= (max); prime = next_prime_number(prime))
H A Dsonet.h16 extern void sonet_copy_stats(struct k_sonet_stats *from,struct sonet_stats *to);
17 extern void sonet_subtract_stats(struct k_sonet_stats *from,
/kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/isp/kernels/bnlm/
H A Dia_css_bnlm.host.h25 const struct ia_css_bnlm_config *from,
31 const struct ia_css_bnlm_config *from,
/kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/isp/kernels/copy_output/copy_output_1.0/
H A Dia_css_copy_output.host.c30 const struct ia_css_copy_output_configuration *from, in ia_css_copy_output_config()
34 to->enable = from->enable; in ia_css_copy_output_config()
28 ia_css_copy_output_config( struct sh_css_isp_copy_output_isp_config *to, const struct ia_css_copy_output_configuration *from, unsigned int size) ia_css_copy_output_config() argument
/kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/isp/kernels/eed1_8/
H A Dia_css_eed1_8.host.h25 const struct ia_css_eed1_8_config *from,
31 const struct ia_css_eed1_8_config *from,
/kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/isp/kernels/macc/macc_1.0/
H A Dia_css_macc.host.c30 const struct ia_css_macc_config *from, in ia_css_macc_encode()
34 to->exp = from->exp; in ia_css_macc_encode()
28 ia_css_macc_encode( struct sh_css_isp_macc_params *to, const struct ia_css_macc_config *from, unsigned int size) ia_css_macc_encode() argument
/kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/isp/kernels/macc/macc1_5/
H A Dia_css_macc1_5.host.h27 const struct ia_css_macc1_5_config *from,
33 const struct ia_css_macc1_5_table *from,
/kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/isp/kernels/xnr/xnr_1.0/
H A Dia_css_xnr.host.h29 const struct ia_css_xnr_table *from,
35 const struct ia_css_xnr_config *from,
/kernel/linux/linux-6.6/include/linux/
H A Dprime_numbers.h15 * Starting from the first prime number 2 iterate over each prime number up to
27 * @from: the initial value
30 * Starting from @from iterate over each successive prime number up to the
32 * @max should be less than ULONG_MAX, and @from less than @max, to ensure
35 #define for_each_prime_number_from(prime, from, max) \
36 for (prime = (from); prime <= (max); prime = next_prime_number(prime))
H A Dsonet.h16 extern void sonet_copy_stats(struct k_sonet_stats *from,struct sonet_stats *to);
17 extern void sonet_subtract_stats(struct k_sonet_stats *from,
/kernel/linux/linux-6.6/drivers/staging/media/atomisp/pci/isp/kernels/bnlm/
H A Dia_css_bnlm.host.h25 const struct ia_css_bnlm_config *from,
31 const struct ia_css_bnlm_config *from,

Completed in 14 milliseconds

1...<<51525354555657585960>>...316