Home
last modified time | relevance | path

Searched refs:next (Results 5701 - 5725 of 6007) sorted by relevance

1...<<221222223224225226227228229230>>...241

/third_party/wpa_supplicant/wpa_supplicant-2.9/src/fst/
H A Dfst_session.c1328 s->data.old_iface = dl_list_entry(s->data.new_iface->group_lentry.next, in get_group_fill_session()
/third_party/wpa_supplicant/wpa_supplicant-2.9/wpa_supplicant/
H A Dmesh_mpm.c175 for (sta = hapd->sta_list; sta; sta = sta->next) { in llid_in_use()
H A Dp2p_supplicant_sd.c598 adv_data; adv_data = adv_data->next) { in wpas_sd_req_asp()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/common/
H A Dcommon_module_tests.c460 for (pt = pt_info; pt; pt = pt->next) { in sae_tests()
/third_party/vk-gl-cts/external/vulkancts/vkscserver/
H A DvksCacheBuilder.cpp395 for (de::DirectoryIterator iter(pipelineCompilerDataDir); iter.hasItem(); iter.next()) in buildOfflinePipelineCache()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/fst/
H A Dfst_session.c1328 s->data.old_iface = dl_list_entry(s->data.new_iface->group_lentry.next, in get_group_fill_session()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/wpa_supplicant/
H A Dmesh_mpm.c175 for (sta = hapd->sta_list; sta; sta = sta->next) { in llid_in_use()
H A Dp2p_supplicant_sd.c600 adv_data; adv_data = adv_data->next) { in wpas_sd_req_asp()
/third_party/typescript/lib/
H A DtypingsInstaller.js44 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
49 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
91 // eslint-disable-next-line @typescript-eslint/no-inferrable-types
113 // eslint-disable-next-line local/no-in-operator
127 // eslint-disable-next-line local/no-in-operator
211 var iterResult = iter.next();
225 for (var step = iterator.next(), pos = 0; !step.done; step = iterator.next(), pos++) {
245 next: function () {
448 next
[all...]
H A Dtsc.js44 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
49 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
161 var iterResult = iter.next();
175 for (var step = iterator.next(), pos = 0; !step.done; step = iterator.next(), pos++) {
195 next: function () {
384 next: function () {
385 var iterRes = iter.next();
462 var first = iter.next();
468 next
[all...]
H A Dtypescript.js43 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
48 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
101 // eslint-disable-next-line @typescript-eslint/no-inferrable-types
123 // eslint-disable-next-line local/no-in-operator
137 // eslint-disable-next-line local/no-in-operator
221 var iterResult = iter.next();
235 for (var step = iterator.next(), pos = 0; !step.done; step = iterator.next(), pos++) {
255 next: function () {
458 next
[all...]
H A DtypescriptServices.js43 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
48 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
101 // eslint-disable-next-line @typescript-eslint/no-inferrable-types
123 // eslint-disable-next-line local/no-in-operator
137 // eslint-disable-next-line local/no-in-operator
221 var iterResult = iter.next();
235 for (var step = iterator.next(), pos = 0; !step.done; step = iterator.next(), pos++) {
255 next: function () {
458 next
[all...]
/third_party/node/test/fixtures/snapshot/
H A Dtypescript.js43 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
48 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
103 return { key: key, value: value, next: undefined, prev: undefined };
119 // Entries without a 'prev' have been removed from the map. Their 'next'
123 entry = entry.next;
147 data.tail.next = entry;
160 if (entry.next) {
161 entry.next.prev = entry.prev;
164 // an entry in the map without a 'next' pointer must be the 'tail'.
169 entry.prev.next
[all...]
/third_party/node/deps/v8/src/api/
H A Dapi.cc729 RegisteredExtension* next = re->next(); in UnregisterAll() local
731 re = next; in UnregisterAll()
934 prev_next_ = current->next; in Initialize()
987 current->limit = current->next; in SealHandleScope()
994 DCHECK_EQ(current->next, current->limit); in ~SealHandleScope()
5564 // units until the buffer capacity is reached, would be exceeded by the next in Unaligned()
9370 // provide a bigger one next time. We do it this way because allocation is not in CopyCodePages()
10543 FullObjectSlot(handle_scope_data_.next)); in IterateThis()
10603 ph->block_next_ = isolate()->handle_scope_data()->next; in DetachPersistent()
[all...]
/third_party/node/deps/ada/
H A Dada.h5539 // Trailing index is always the next character of the current one.
5885 // This next line is required for when parsing a URL like `foo://` in update_base_hostname()
6643 // next line could overflow but unsigned arithmetic has well-defined in set_protocol_as_file()
6840 * Return the next item in the iterator or std::nullopt if done.
6842 inline std::optional<T> next();
6998 params.erase(std::remove_if(std::next(it), params.end(), find), in set()
7051 inline std::optional<std::string_view> url_search_params_keys_iter::next() { in next() function in ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::url_search_params_keys_iter
7057 inline std::optional<std::string_view> url_search_params_values_iter::next() { in next() function in ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::url_search_params_values_iter
7064 url_search_params_entries_iter::next() { in next() function in ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::ada::url_search_params_entries_iter
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp264 /// As we scan instructions optimizing them, this is the next instruction
578 for (auto &Block : llvm::make_range(std::next(F.begin()), F.end())) in eliminateFallThrough()
655 for (auto &Block : llvm::make_range(std::next(F.begin()), F.end())) in eliminateMostlyEmptyBlocks()
5468 NewBaseInsertPt = std::next(BaseI->getIterator()); in splitLargeGEPOffsets()
5934 CurInstIterator = std::next(And->getIterator()); in optimizeLoadExt()
6072 CurInstIterator = std::next(LastSI->getIterator()); in optimizeSelectInst()
6214 // Instruct OptimizeBlock to skip to the next block. in optimizeSelectInst()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Mips/
H A DMipsISelLowering.cpp1275 MIB = BuildMI(MBB, std::next(I), MI.getDebugLoc(), in insertDivByZeroTrap()
1765 std::next(MachineBasicBlock::iterator(MI)), BB->end()); in emitAtomicBinaryPartword()
1949 std::next(MachineBasicBlock::iterator(MI)), BB->end()); in emitAtomicCmpSwapPartword()
2294 // Increment the pointer, VAList, to the next vaarg. in lowerVAARG()
2933 // Allocate int register and shadow next int register. If first in CC_MipsO32()
2999 // Return next O32 integer argument register.
4578 std::next(MachineBasicBlock::iterator(MI)), BB->end()); in emitPseudoSELECT()
4655 std::next(MachineBasicBlock::iterator(MI)), BB->end()); in emitPseudoD_SELECT()
/foundation/graphic/graphic_2d/rosen/modules/render_service_base/src/pipeline/
H A Drs_render_node.cpp243 children_.emplace(std::next(children_.begin(), index), child); in AddChild()
283 children_.emplace(std::next(children_.begin(), index), child); in MoveChild()
435 children_.emplace(std::next(children_.begin(), index), child); in AddCrossParentChild()
1186 // Check the next frame's VSync has been requested. If there is no request, add another VSync request in FallbackAnimationsToRoot()
2143 // force update if no next vsync when skip-frame enabled in MarkFilterCacheFlags()
/third_party/node/deps/v8/src/compiler/backend/
H A Dinstruction-selector.cc340 int next = virtual_register_rename_[rename]; in GetRename() local
341 if (next == InstructionOperand::kInvalidVirtualRegister) { in GetRename()
344 rename = next; in GetRename()
3085 // jump to the next block. in VisitGoto()
/third_party/mesa3d/src/panfrost/bifrost/
H A Dbifrost_compile.c12 * The above copyright notice and this permission notice (including the next
598 bool next = (i + 1) < count; in bi_make_vec16_to() local
601 unsigned nextc = next && channel ? channel[i + 1] : 0; in bi_make_vec16_to()
604 bi_index w1 = next ? bi_extract(b, src[i + 1], nextc >> 1) : bi_zero(); in bi_make_vec16_to()
/third_party/rust/crates/libc/src/unix/bsd/freebsdlike/freebsd/
H A Dmod.rs464 pub next: __c_anonymous_filestat,
2776 /// IP6 no next header
3682 /// struct: vfsconf for filesystem given as next argument.
3817 let next = cmsg as usize + _ALIGN((*cmsg).cmsg_len as usize) in CMSG_NXTHDR()
3821 if next > max { in CMSG_NXTHDR()
/third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/d3d/
H A DTextureD3D.cpp603 // the UAV/SRV is rebound again with this new texture storage in next dispatch call. in ensureRenderTarget()
682 const gl::ImageIndex index = iterator.next(); in setBaseLevel()
757 ANGLE_TRY(initializeContents(context, iterator.next())); in initializeContents()
771 ANGLE_TRY(initializeContents(context, iterator.next())); in initializeContents()
/third_party/skia/third_party/externals/d3d12allocator/src/
H A DD3D12MemAlloc.cpp2880 SuballocationList::iterator next = request.item;
2881 ++next;
2883 m_Suballocations.insert(next, paddingSuballoc);
3044 // Merge with previous and/or next suballocation if it's also free.
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/
H A DAArch64InstructionSelector.cpp1651 MIB.setInsertPt(MIB.getMBB(), std::next(I.getIterator())); in select()
1725 MIB.setInsertPt(MIB.getMBB(), std::next(I.getIterator())); in select()
1905 MIB.setInsertPt(MIB.getMBB(), std::next(I.getIterator())); in select()
/third_party/protobuf/php/ext/google/protobuf/
H A Dphp-upb.h647 const struct _upb_tabent *next; member
844 for (e = upb_getentry(&t->t, upb_inthash(key)); true; e = e->next) { in upb_inttable_lookup32()
849 if (e->next == NULL) return false; in upb_inttable_lookup32()
875 * is iterating over has not been freed. Calling next() or accessing data from
3780 /* Advances to the next entry. Returns false if no more entries are present. */
3785 * UPB_MAP_BEGIN (you must call next() at least once first). */

Completed in 159 milliseconds

1...<<221222223224225226227228229230>>...241