Home
last modified time | relevance | path

Searched refs:links (Results 1 – 25 of 777) sorted by relevance

12345678910>>...32

/external/grpc-grpc/src/core/lib/iomgr/
Dpollset_windows.cc44 g_global_root_worker.links[GRPC_POLLSET_WORKER_LINK_GLOBAL].next = in pollset_global_init()
45 g_global_root_worker.links[GRPC_POLLSET_WORKER_LINK_GLOBAL].prev = in pollset_global_init()
53 worker->links[type].prev->links[type].next = worker->links[type].next; in remove_worker()
54 worker->links[type].next->links[type].prev = worker->links[type].prev; in remove_worker()
55 worker->links[type].next = worker->links[type].prev = worker; in remove_worker()
60 return root->links[type].next != root; in has_workers()
66 grpc_pollset_worker* w = root->links[type].next; in pop_front_worker()
77 worker->links[type].prev = root; in push_front_worker()
78 worker->links[type].next = worker->links[type].prev->links[type].next; in push_front_worker()
79 worker->links[type].prev->links[type].next = in push_front_worker()
[all …]
Dresource_quota.cc117 grpc_resource_user_link links[GRPC_RULIST_COUNT]; member
195 resource_user->links[list].next = resource_user->links[list].prev = in rulist_add_head()
198 resource_user->links[list].next = *root; in rulist_add_head()
199 resource_user->links[list].prev = (*root)->links[list].prev; in rulist_add_head()
200 resource_user->links[list].next->links[list].prev = in rulist_add_head()
201 resource_user->links[list].prev->links[list].next = resource_user; in rulist_add_head()
212 resource_user->links[list].next = resource_user->links[list].prev = in rulist_add_tail()
215 resource_user->links[list].next = (*root)->links[list].next; in rulist_add_tail()
216 resource_user->links[list].prev = *root; in rulist_add_tail()
217 resource_user->links[list].next->links[list].prev = in rulist_add_tail()
[all …]
/external/selinux/libselinux/utils/
Dselabel_lookup_best_match.c58 char **links = NULL; in main() local
96 links = calloc(num_links + 1, sizeof(char *)); in main()
98 if (!links) { in main()
105 links[num_links] = malloc(string_len); in main()
106 if (!links[num_links]) { in main()
110 strcpy(links[num_links], argv[i]); in main()
127 (const char **)links, mode); in main()
130 (const char **)links, mode); in main()
155 if (links) { in main()
156 for (i = 0; links[i]; i++) in main()
[all …]
/external/ltp/testcases/kernel/syscalls/link/
Dlink03.c72 int i, links; in main() local
98 links = nlinks; in main()
100 links = (lc % 90) + 10; in main()
103 for (i = 1; i < links; i++) { in main()
115 if (buf.st_nlink != (nlink_t)links) { in main()
118 fname, (int)buf.st_nlink, links); in main()
122 for (i = 1; i < links; i++) { in main()
125 if (buf.st_nlink != (nlink_t)links) { in main()
129 lname, (int)buf.st_nlink, links); in main()
134 tst_resm(TPASS, "link() passed and linkcounts=%d match", links); in main()
[all …]
/external/guava/android/guava/src/com/google/common/collect/
DObjectCountLinkedHashMap.java60 @VisibleForTesting transient long[] links; field in ObjectCountLinkedHashMap
92 links = new long[expectedSize]; in init()
93 Arrays.fill(links, UNSET); in init()
113 return (int) (links[entry] >>> 32); in getPredecessor()
117 return (int) links[entry]; in getSuccessor()
122 links[entry] = (links[entry] & ~succMask) | (succ & succMask); in setSuccessor()
127 links[entry] = (links[entry] & ~predMask) | ((long) pred << 32); in setPredecessor()
164 int oldCapacity = links.length; in resizeEntries()
165 links = Arrays.copyOf(links, newCapacity); in resizeEntries()
166 Arrays.fill(links, oldCapacity, newCapacity, UNSET); in resizeEntries()
DCompactLinkedHashMap.java76 @VisibleForTesting @MonotonicNonNullDecl transient long[] links; field in CompactLinkedHashMap
104 links = new long[expectedSize]; in init()
105 Arrays.fill(links, UNSET); in init()
109 return (int) (links[entry] >>> 32); in getPredecessor()
114 return (int) links[entry]; in getSuccessor()
119 links[entry] = (links[entry] & ~succMask) | (succ & succMask); in setSuccessor()
124 links[entry] = (links[entry] & ~predMask) | ((long) pred << 32); in setPredecessor()
173 links = Arrays.copyOf(links, newCapacity); in resizeEntries()
/external/grpc-grpc/src/core/ext/transport/chttp2/transport/
Dstream_lists.cc58 grpc_chttp2_stream* new_head = s->links[id].next; in stream_list_pop()
62 new_head->links[id].prev = nullptr; in stream_list_pop()
81 if (s->links[id].prev) { in stream_list_remove()
82 s->links[id].prev->links[id].next = s->links[id].next; in stream_list_remove()
85 t->lists[id].head = s->links[id].next; in stream_list_remove()
87 if (s->links[id].next) { in stream_list_remove()
88 s->links[id].next->links[id].prev = s->links[id].prev; in stream_list_remove()
90 t->lists[id].tail = s->links[id].prev; in stream_list_remove()
115 s->links[id].next = nullptr; in stream_list_add_tail()
116 s->links[id].prev = old_tail; in stream_list_add_tail()
[all …]
/external/tensorflow/tensorflow/core/grappler/graph_analyzer/
Dgen_node_test.cc83 EXPECT_THAT(DumpLinkMap(gn1->links()), ElementsAre()); in TEST()
106 EXPECT_THAT(DumpLinkMap(gn1->links()), ElementsAre( in TEST()
110 EXPECT_THAT(DumpLinkMap(gn2->links()), ElementsAre( in TEST()
114 EXPECT_THAT(DumpLinkMap(gn3->links()), ElementsAre( in TEST()
152 EXPECT_THAT(DumpLinkMap(gn1->links()), ElementsAre( in TEST()
155 EXPECT_THAT(DumpLinkMap(gn2->links()), ElementsAre( in TEST()
158 EXPECT_THAT(DumpLinkMap(gn3->links()), ElementsAre( in TEST()
185 EXPECT_THAT(DumpLinkMap(gn1->links()), ElementsAre( in TEST()
188 EXPECT_THAT(DumpLinkMap(gn2->links()), ElementsAre( in TEST()
191 EXPECT_THAT(DumpLinkMap(gn3->links()), ElementsAre( in TEST()
[all …]
Dsubgraph.cc123 link_map_it_ = (*id_it_)->links().begin(); in SubgraphIterator()
125 while (link_map_it_ == (*id_it_)->links().end()) { in SubgraphIterator()
129 link_map_it_ = (*id_it_)->links().begin(); in SubgraphIterator()
169 for (auto next = link_map_it_; next != (*id_it_)->links().end(); ++next) { in SkipNode()
179 while (link_map_it_ == (*id_it_)->links().end()) { in PropagateNext()
183 link_map_it_ = (*id_it_)->links().begin(); in PropagateNext()
/external/brotli/
Dpremake5.lua31 links "m"
51 links "brotlicommon"
58 links "brotlicommon_static"
64 links "brotlicommon"
71 links "brotlicommon_static"
78 links { "brotlicommon_static", "brotlidec_static", "brotlienc_static" }
/external/libnl/doc/
Ddoxygen-link.py12 links = {}
31 links[name] = "<a href=\"" + value + "\" class=\"dg\">" + name + "</a>"
32 return links
34 links = parse_dict(sys.argv[1]) variable
37 return links[match.group(1)]
40 rc = re.compile(r'\b(' + '|'.join(map(re.escape, sorted(links, reverse=True))) + r')\b')
/external/autotest/server/cros/dynamic_suite/
Dreporting.py82 links = self._get_links_for_failure()
105 'build_artifacts': links.artifacts,
106 'results_log': links.results,
107 'status_log': links.status_log,
108 'job': links.job,
109 'test_history_url': links.test_history_url,
110 'retry_url': links.retry_url,
140 links = collections.namedtuple('links', ('results,'
146 return links(reporting_utils.link_result_logs(
/external/guava/guava/src/com/google/common/collect/
DCompactLinkedHashMap.java85 @VisibleForTesting transient long @MonotonicNonNull [] links; field in CompactLinkedHashMap
113 links = new long[expectedSize]; in init()
114 Arrays.fill(links, UNSET); in init()
118 return (int) (links[entry] >>> 32); in getPredecessor()
123 return (int) links[entry]; in getSuccessor()
128 links[entry] = (links[entry] & ~succMask) | (succ & succMask); in setSuccessor()
133 links[entry] = (links[entry] & ~predMask) | ((long) pred << 32); in setPredecessor()
182 links = Arrays.copyOf(links, newCapacity); in resizeEntries()
/external/dokka/core/src/test/kotlin/model/
DPackageTest.kt19 assertTrue(links.none()) in <lambda>()
32 assertTrue(links.none()) in <lambda>()
45 assertTrue(links.none()) in <lambda>()
61 assertTrue(links.none()) in <lambda>()
68 assertTrue(links.none()) in <lambda>()
83 assertTrue(links.none()) in <lambda>()
97 assertTrue(links.none()) in <lambda>()
112 assertTrue(links.none()) in <lambda>()
DClassTest.kt18 assertTrue(links.none()) in <lambda>()
30 assertTrue(links.none()) in <lambda>()
41 assertTrue(links.none()) in <lambda>()
55 assertTrue(links.none()) in <lambda>()
58 assertTrue(links.none()) in <lambda>()
71 assertTrue(links.none()) in <lambda>()
80 assertTrue(links.none()) in <lambda>()
88 assertTrue(links.none()) in <lambda>()
101 assertTrue(links.none()) in <lambda>()
111 assertTrue(links.none()) in <lambda>()
[all …]
DFunctionTest.kt19 assertTrue(links.none()) in <lambda>()
42 assertTrue(links.none()) in <lambda>()
46 assertTrue(links.none()) in <lambda>()
71 assertTrue(links.none()) in <lambda>()
76 assertTrue(links.none()) in <lambda>()
100 assertTrue(links.singleOrNull() == functionDetails.elementAt(4)) in <lambda>()
103 assertTrue(links.none()) in <lambda>()
110 assertTrue(links.none()) in <lambda>()
115 assertTrue(links.none()) in <lambda>()
137 assertTrue(links.none()) in <lambda>()
[all …]
/external/libnl/python/netlink/route/
DMakefile.am9 links/__init__.py \
10 links/dummy.py \
11 links/inet.py \
12 links/vlan.py \
/external/tremolo/Tremolo/
Dvorbisfile.c245 vf->links=m+1; in _bisect_forward_serialno()
246 vf->offsets=_ogg_calloc((vf->links+1), sizeof(*vf->offsets)); in _bisect_forward_serialno()
247 vf->serialnos=_ogg_calloc(vf->links, sizeof(*vf->serialnos)); in _bisect_forward_serialno()
384 vf->dataoffsets=_ogg_malloc(vf->links*sizeof(*vf->dataoffsets)); in _prefetch_all_offsets()
385 vf->pcmlengths=_ogg_malloc(vf->links*2*sizeof(*vf->pcmlengths)); in _prefetch_all_offsets()
387 for(i=0;i<vf->links;i++){ in _prefetch_all_offsets()
484 for(i=0;i<vf->links;i++) in _make_decode_ready()
486 if(i==vf->links)return -1; in _make_decode_ready()
681 for(link=0;link<vf->links;link++) in _fetch_and_process_packet()
683 if(link==vf->links){ in _fetch_and_process_packet()
[all …]
/external/doclava/res/assets/templates-sdk/assets/css/
Ddefault.css557 .content-header.just-links {
586 .content-header .paging-links {
592 .paging-links {
595 .paging-links a,
647 .paging-links a.disabled,
653 .paging-links a.disabled:hover,
1355 .paging-links {
1369 /* print link URLs where possible and give links default text color */
2560 /* notice box for cross links between Design/Develop docs */
3049 links to summary tables) */
[all …]
/external/angle/third_party/VulkanMemoryAllocator/premake/
Dpremake5.lua50 links { "vulkan-1" }
54 links { "vulkan" }
89 links { "vulkan-1" }
93 links { "vulkan" }
/external/ltp/testcases/kernel/fs/linktest/
DREADME25 Description: A regression test for links per file.
27 to create a given number of hard links and
28 symbolic links to a single file.
43 ./linktest.pl <number of symbolic links> <number of hard links>
50 have to be manually removed (along with any links or files in them).
/external/icu/icu4c/source/data/misc/
Dzoneinfo64.txt27 links:intvector { 5, 11, 13, 21, 22, 27, 38, 51, 52, 55, 348 }
59 links:intvector { 3, 18, 402 }
95 links:intvector { 30, 44, 45 }
114 links:intvector { 12, 16, 25, 35, 36, 37, 39, 42, 50, 53 }
126 links:intvector { 15, 17, 28, 29, 34, 40, 41, 43, 379 }
140 links:intvector { 7, 9, 10, 23, 24, 32, 46, 48, 397, 516, 520, 525 }
162 links:intvector { 56, 533 }
184 links:intvector { 59, 80, 617 }
194 links:intvector { 4, 60, 616 }
208 links:intvector { 2, 64, 90 }
[all …]
/external/opencensus-java/api/src/test/java/io/opencensus/trace/export/
DSpanDataTest.java89 private Links links; field in SpanDataTest
106 links = Links.create(linksList, 0); in setUp()
122 links, in spanData_AllValues()
136 assertThat(spanData.getLinks()).isEqualTo(links); in spanData_AllValues()
155 links, in spanData_Create_Compatibility()
168 assertThat(spanData.getLinks()).isEqualTo(links); in spanData_Create_Compatibility()
187 links, in spanData_RootActiveSpan()
200 assertThat(spanData.getLinks()).isEqualTo(links); in spanData_RootActiveSpan()
251 links, in spanDataEquals()
266 links, in spanDataEquals()
[all …]
/external/icu/icu4c/source/test/testdata/
Dzoneinfo64.txt40 links:intvector { 7, 385 }
53 links:intvector { 9, 10 }
60 links:intvector { 11, 55 }
97 links:intvector { 3, 18, 390 }
166 links:intvector { 29, 367 }
184 links:intvector { 31, 33 }
299 links:intvector { 56, 517 }
324 links:intvector { 59, 80, 600 }
334 links:intvector { 4, 60, 599 }
352 links:intvector { 2, 64, 90 }
[all …]
/external/markdown/tests/markdown-test/
Dbenchmark.dat3 auto-links:0.080000:397312.000000
11 links-inline:0.140000:0.000000
12 links-reference:0.170000:0.000000

12345678910>>...32