| /third_party/nghttp2/ |
| H A D | git-clang-format | 173 for entry in run('git', 'config', '--list', '--null').split('\0'):
174 if entry:
175 name, value = entry.split('\n', 1)
|
| /third_party/libwebsockets/lib/plat/windows/ |
| H A D | windows-sockets.c | 189 struct hostent *entry = gethostbyname(ifname); in lws_interface_to_sa() local
190 if (entry) in lws_interface_to_sa()
191 address = ((struct in_addr *)entry->h_addr_list[0])->s_addr; in lws_interface_to_sa()
|
| /third_party/node/deps/v8/src/logging/ |
| H A D | runtime-call-stats.cc | 32 for (Entry& entry : entries_) { in Print()
33 entry.SetTotal(total_time_, total_call_count_); in Print()
34 entry.Print(os); in Print()
|
| /third_party/mesa3d/src/gallium/drivers/freedreno/ |
| H A D | freedreno_batch.c | 256 set_foreach (batch->resources, entry) { in batch_reset_resources()
257 struct fd_resource *rsc = (struct fd_resource *)entry->key; in batch_reset_resources()
258 _mesa_set_remove(batch->resources, entry); in batch_reset_resources()
|
| /third_party/node/deps/openssl/openssl/apps/ |
| H A D | srp.c | 78 print_entry(db, indexindex, verbose, "g N entry"); in print_index()
87 print_entry(db, userindex, verbose, "User entry"); in print_user()
89 "g N entry"); in print_user()
116 char *entry = NCONF_get_string(conf, section, tag); in lookup_conf() local
117 if (entry == NULL) in lookup_conf()
119 return entry; in lookup_conf()
|
| /third_party/openssl/apps/ |
| H A D | srp.c | 78 print_entry(db, indexindex, verbose, "g N entry"); in print_index()
87 print_entry(db, userindex, verbose, "User entry"); in print_user()
89 "g N entry"); in print_user()
116 char *entry = NCONF_get_string(conf, section, tag); in lookup_conf() local
117 if (entry == NULL) in lookup_conf()
119 return entry; in lookup_conf()
|
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| H A D | convert_to_half_pass.cpp | 325 func->entry().get(), [&changed, this](BasicBlock* bb) { in ProcessFunction()
333 func->entry().get(), [&modified, this](BasicBlock* bb) { in ProcessFunction()
340 func->entry().get(), [&modified, this](BasicBlock* bb) { in ProcessFunction()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| H A D | convert_to_half_pass.cpp | 325 func->entry().get(), [&changed, this](BasicBlock* bb) { in ProcessFunction()
333 func->entry().get(), [&modified, this](BasicBlock* bb) { in ProcessFunction()
340 func->entry().get(), [&modified, this](BasicBlock* bb) { in ProcessFunction()
|
| /third_party/skia/src/pdf/ |
| H A D | SkPDFTag.cpp | 11 // The struct parent tree consists of one entry per page, followed by
13 // annotations. Each entry is a key/value pair with an integer key
338 // First, one entry per page. in makeStructTreeRoot()
351 // Then, one entry per annotation. in makeStructTreeRoot()
387 for (const IDTreeEntry& entry : fIdTreeEntries) { in makeStructTreeRoot()
388 SkString idString = SkPDFTagNode::nodeIdToString(entry.nodeId); in makeStructTreeRoot()
390 names->appendRef(entry.ref); in makeStructTreeRoot()
|
| /third_party/skia/third_party/externals/tint/src/reader/spirv/ |
| H A D | parser_impl.h | 356 /// Register entry point information.
671 for (const auto& entry : special_builtins_) { in IdForSpecialBuiltIn()
672 if (entry.second == builtin) { in IdForSpecialBuiltIn()
673 return entry.first; in IdForSpecialBuiltIn()
679 /// @param entry_point the SPIR-V ID of an entry point.
680 /// @returns the entry point info for the given ID
|
| /third_party/toybox/toys/net/ |
| H A D | netstat.c | 235 struct dirent *entry; in scan_pids() local
253 while ((entry = readdir(dp))) { in scan_pids()
255 if (!readlinkat0(dirfd, entry->d_name, s, sizeof(toybuf)-256)) continue; in scan_pids()
|
| /third_party/protobuf/java/core/src/main/java/com/google/protobuf/ |
| H A D | MapEntry.java | 44 * <p>In reflection API, map fields will be treated as repeated message fields and each map entry is
45 * accessed as a message. This MapEntry class is used to represent these map entry messages in
107 Map.Entry<K, V> entry = MapEntryLite.parseEntry(input, metadata, extensionRegistry); in MapEntry()
108 this.key = entry.getKey(); in MapEntry()
109 this.value = entry.getValue(); in MapEntry()
119 * each map entry message type. Generated code should store the created default instance and use
229 throw new RuntimeException("There is no repeated field in a map entry message."); in getRepeatedFieldCount()
234 throw new RuntimeException("There is no repeated field in a map entry message."); in getRepeatedField()
372 throw new RuntimeException("There is no repeated field in a map entry message."); in setRepeatedField()
377 throw new RuntimeException("There is no repeated field in a map entry messag in addRepeatedField()
[all...] |
| /third_party/protobuf/js/ |
| H A D | maps_test.js | 171 entries.forEach(function(entry) {
172 var key = entry[0];
173 var val = entry[1];
386 ['a', 'entry 1'],
387 ['c', 'entry 2'],
388 ['b', 'entry 3']
|
| /third_party/protobuf/ruby/src/main/java/com/google/protobuf/jruby/ |
| H A D | RubyMap.java | 335 for (Map.Entry<IRubyObject, IRubyObject> entry : table.entrySet()) { in dup()
336 newMap.table.put(entry.getKey(), entry.getValue()); in dup()
|
| /kernel/linux/linux-5.10/drivers/net/ethernet/dec/tulip/ |
| H A D | de4x5.c | 657 ** and hence the RX descriptor ring's first entry.
1190 lp->rx_skb[i] = (struct sk_buff *) 1; /* Dummy entry */ in de4x5_hw_init()
1208 lp->rx_skb[i] = (struct sk_buff *) 1; /* Dummy entry */ in de4x5_hw_init()
1605 int entry; in de4x5_rx() local
1608 for (entry=lp->rx_new; (s32)le32_to_cpu(lp->rx_ring[entry].status)>=0; in de4x5_rx()
1609 entry=lp->rx_new) { in de4x5_rx()
1610 status = (s32)le32_to_cpu(lp->rx_ring[entry].status); in de4x5_rx()
1620 lp->rx_old = entry; in de4x5_rx()
1637 short pkt_len = (short)(le32_to_cpu(lp->rx_ring[entry] in de4x5_rx()
1677 de4x5_free_tx_buff(struct de4x5_private *lp, int entry) de4x5_free_tx_buff() argument
1695 int entry; de4x5_tx() local
1899 int entry = (lp->tx_new ? lp->tx_new-1 : lp->txRingSize-1); load_packet() local
[all...] |
| /foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/storage/src/relational/ |
| H A D | relational_sync_able_storage.cpp | 201 // Put meta data as a key-value entry.
344 auto entry = new (std::nothrow) GenericSingleVerKvEntry(); in GetKvEntriesByDataItems() local
345 if (entry == nullptr) { in GetKvEntriesByDataItems()
351 entry->SetEntryData(std::move(item)); in GetKvEntriesByDataItems()
352 entries.push_back(entry); in GetKvEntriesByDataItems()
497 GenericSingleVerKvEntry *entry = static_cast<GenericSingleVerKvEntry *>(itemEntry); in ConvertEntries() local
498 if (entry != nullptr) { in ConvertEntries()
500 item.origDev = entry->GetOrigDevice(); in ConvertEntries()
501 item.flag = entry->GetFlag(); in ConvertEntries()
502 item.timestamp = entry in ConvertEntries()
[all...] |
| /foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/test/unittest/common/syncer/ |
| H A D | distributeddb_single_ver_p2p_complex_sync_test.cpp | 107 Entry entry; in CrudTest() local
108 entry.key.push_back(i); in CrudTest()
109 entry.value.push_back('2'); in CrudTest()
110 entries.push_back(entry); in CrudTest()
113 for (const auto &entry : entries) { in CrudTest()
115 EXPECT_TRUE(g_kvDelegatePtr->Get(entry.key, resultvalue) == OK); in CrudTest()
116 EXPECT_TRUE(resultvalue == entry.value); in CrudTest()
1863 for (const auto &entry : entries) { in HWTEST_F()
1864 EXPECT_EQ(g_deviceB->PutData(entry.key, entry in HWTEST_F()
[all...] |
| H A D | distributeddb_multi_ver_p2p_sync_test.cpp | 773 for (const auto &entry : commitMapA) { in IsCommitHistorySyncRequestPacketEqual()
774 if (commitMapB.count(entry.first) == 0) { in IsCommitHistorySyncRequestPacketEqual()
777 if (!IsMultiVerCommitEqual(entry.second, commitMapB[entry.first])) { in IsCommitHistorySyncRequestPacketEqual()
781 for (const auto &entry : commitMapB) { in IsCommitHistorySyncRequestPacketEqual()
782 if (commitMapA.count(entry.first) == 0) { in IsCommitHistorySyncRequestPacketEqual()
785 if (!IsMultiVerCommitEqual(entry.second, commitMapA[entry.first])) { in IsCommitHistorySyncRequestPacketEqual()
900 for (const auto &entry : commitVecA) { in IsCommitHistorySyncAckPacketEqual()
901 if (!IsMultiVerCommitEqual(entry, commitVec in IsCommitHistorySyncAckPacketEqual()
[all...] |
| /kernel/linux/linux-5.10/drivers/net/ethernet/broadcom/ |
| H A D | b44.c | 110 { 0 } /* terminate list with empty entry */
973 u32 len, entry, ctrl; in b44_start_xmit() local
1014 entry = bp->tx_prod; in b44_start_xmit()
1015 bp->tx_buffers[entry].skb = skb; in b44_start_xmit()
1016 bp->tx_buffers[entry].mapping = mapping; in b44_start_xmit()
1020 if (entry == (B44_TX_RING_SIZE - 1)) in b44_start_xmit()
1023 bp->tx_ring[entry].ctrl = cpu_to_le32(ctrl); in b44_start_xmit()
1024 bp->tx_ring[entry].addr = cpu_to_le32((u32) mapping+bp->dma_offset); in b44_start_xmit()
1028 entry * sizeof(bp->tx_ring[0]), in b44_start_xmit()
1031 entry in b44_start_xmit()
[all...] |
| /kernel/linux/linux-5.10/tools/perf/util/ |
| H A D | hist.c | 580 struct hist_entry *entry, in hists__findnew_entry()
588 u64 period = entry->stat.period; in hists__findnew_entry()
589 u64 weight = entry->stat.weight; in hists__findnew_entry()
601 * function when searching an entry regardless which sort in hists__findnew_entry()
604 cmp = hist_entry__cmp(he, entry); in hists__findnew_entry()
618 mem_info__zput(entry->mem_info); in hists__findnew_entry()
620 block_info__zput(entry->block_info); in hists__findnew_entry()
628 if (he->ms.map != entry->ms.map) { in hists__findnew_entry()
630 he->ms.map = map__get(entry->ms.map); in hists__findnew_entry()
643 he = hist_entry__new(entry, sample_sel in hists__findnew_entry()
579 hists__findnew_entry(struct hists *hists, struct hist_entry *entry, struct addr_location *al, bool sample_self) hists__findnew_entry() argument
699 struct hist_entry entry = { __hists__add_entry() local
772 struct hist_entry entry = { hists__add_entry_block() local
[all...] |
| /kernel/linux/linux-6.6/drivers/net/dsa/ |
| H A D | mt7530.c | 308 * entry is invalid in mt7530_fdb_cmd()
359 /* STATIC_ENT indicate that entry is static wouldn't in mt7530_fdb_write()
361 * entry in mt7530_fdb_write()
1372 * VID from incoming packets before fetching entry within the in mt7530_port_set_vlan_aware()
1614 struct mt7530_hw_vlan_entry *entry) in mt7530_hw_vlan_add()
1616 struct dsa_port *dp = dsa_to_port(priv->ds, entry->port); in mt7530_hw_vlan_add()
1620 new_members = entry->old_members | BIT(entry->port); in mt7530_hw_vlan_add()
1622 /* Validate the entry with independent learning, create egress tag per in mt7530_hw_vlan_add()
1638 else if (entry in mt7530_hw_vlan_add()
1613 mt7530_hw_vlan_add(struct mt7530_priv *priv, struct mt7530_hw_vlan_entry *entry) mt7530_hw_vlan_add() argument
1648 mt7530_hw_vlan_del(struct mt7530_priv *priv, struct mt7530_hw_vlan_entry *entry) mt7530_hw_vlan_del() argument
1674 mt7530_hw_vlan_update(struct mt7530_priv *priv, u16 vid, struct mt7530_hw_vlan_entry *entry, mt7530_vlan_op vlan_op) mt7530_hw_vlan_update() argument
[all...] |
| /kernel/linux/linux-6.6/drivers/net/ethernet/broadcom/ |
| H A D | b44.c | 110 { 0 } /* terminate list with empty entry */
952 u32 len, entry, ctrl; in b44_start_xmit() local
993 entry = bp->tx_prod; in b44_start_xmit()
994 bp->tx_buffers[entry].skb = skb; in b44_start_xmit()
995 bp->tx_buffers[entry].mapping = mapping; in b44_start_xmit()
999 if (entry == (B44_TX_RING_SIZE - 1)) in b44_start_xmit()
1002 bp->tx_ring[entry].ctrl = cpu_to_le32(ctrl); in b44_start_xmit()
1003 bp->tx_ring[entry].addr = cpu_to_le32((u32) mapping+bp->dma_offset); in b44_start_xmit()
1007 entry * sizeof(bp->tx_ring[0]), in b44_start_xmit()
1010 entry in b44_start_xmit()
[all...] |
| /kernel/linux/linux-6.6/fs/ntfs3/ |
| H A D | index.c | 557 * NOTE: This function should never return 'END' entry NULL returns on error.
575 /* We must not return END entry. */ in hdr_find_split()
708 * hdr_find_e - Locate an entry the index buffer.
710 * If no matching entry is found, it returns the first entry which is greater
711 * than the desired entry If the search key is greater than all the entries the
712 * buffer, it returns the 'end' entry. This function does a binary search of the
713 * current index buffer, for the first entry that is <= to the search value.
798 * hdr_insert_de - Insert an index entry into the buffer.
834 /* Now we just make room for the entry an in hdr_insert_de()
1139 indx_find(struct ntfs_index *indx, struct ntfs_inode *ni, const struct INDEX_ROOT *root, const void *key, size_t key_len, const void *ctx, int *diff, struct NTFS_DE **entry, struct ntfs_fnd *fnd) indx_find() argument
1202 indx_find_sort(struct ntfs_index *indx, struct ntfs_inode *ni, const struct INDEX_ROOT *root, struct NTFS_DE **entry, struct ntfs_fnd *fnd) indx_find_sort() argument
1312 indx_find_raw(struct ntfs_index *indx, struct ntfs_inode *ni, const struct INDEX_ROOT *root, struct NTFS_DE **entry, size_t *off, struct ntfs_fnd *fnd) indx_find_raw() argument
[all...] |
| /kernel/linux/linux-6.6/tools/perf/util/ |
| H A D | hist.c | 592 struct hist_entry *entry, in hists__findnew_entry()
600 u64 period = entry->stat.period; in hists__findnew_entry()
612 * function when searching an entry regardless which sort in hists__findnew_entry()
615 cmp = hist_entry__cmp(he, entry); in hists__findnew_entry()
628 mem_info__zput(entry->mem_info); in hists__findnew_entry()
630 block_info__zput(entry->block_info); in hists__findnew_entry()
632 kvm_info__zput(entry->kvm_info); in hists__findnew_entry()
640 if (he->ms.map != entry->ms.map) { in hists__findnew_entry()
642 he->ms.map = map__get(entry->ms.map); in hists__findnew_entry()
655 he = hist_entry__new(entry, sample_sel in hists__findnew_entry()
591 hists__findnew_entry(struct hists *hists, struct hist_entry *entry, const struct addr_location *al, bool sample_self) hists__findnew_entry() argument
712 struct hist_entry entry = { __hists__add_entry() local
792 struct hist_entry entry = { hists__add_entry_block() local
[all...] |
| /foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/object/ |
| H A D | object_manager.cpp | 852 DistributedDB::Entry entry;
in SaveToStore() local
854 entry.key = std::vector<uint8_t>(key.begin(), key.end());
in SaveToStore()
855 entry.value = item.second;
in SaveToStore()
856 entries.emplace_back(entry);
in SaveToStore()
930 std::for_each(entries.begin(), entries.end(), [&keys](const DistributedDB::Entry &entry) {
in RevokeSaveToStore()
931 keys.emplace_back(entry.key);
in RevokeSaveToStore()
962 for (const auto &entry : entries) {
in RetrieveFromStore()
963 std::string key(entry.key.begin(), entry.key.end());
in RetrieveFromStore()
969 results[splitKeys[PROPERTY_NAME_INDEX]] = entry in RetrieveFromStore()
[all...] |