| /third_party/python/Tools/scripts/ |
| H A D | pdeps.py | 48 reach = closure(table)
49 printresults(reach)
52 invreach = inverse(reach)
96 # Initialize reach with a copy of table
98 reach = {}
100 reach[mod] = table[mod][:]
108 for mo in reach[mod]:
110 for m in reach[mo]:
111 if m not in reach[mod]:
112 reach[mo
[all...] |
| /third_party/mesa3d/src/compiler/nir/ |
| H A D | nir_lower_goto_ifs.c | 69 struct set *reach; member
133 * Sets all path variables to reach the target block via a fork
155 * Sets all path variables to reach the both target blocks via a fork.
202 * Sets all path variables and places the right jump instruction to reach the
226 * Sets path vars and places the right jump instr to reach one of the two
293 struct path loop_path, struct set *reach, in loop_routing_start()
298 printf(" reach = "); in loop_routing_start()
299 print_block_set(reach); in loop_routing_start()
316 set_foreach(reach, entry) { in loop_routing_start()
422 * here B and C are directly dominated by A but only C can reach bac
292 loop_routing_start(struct routes *routing, nir_builder *b, struct path loop_path, struct set *reach, void *mem_ctx) loop_routing_start() argument
430 inside_outside(nir_block *block, struct set *loop_heads, struct set *outside, struct set *reach, struct set *brk_reachable, void *mem_ctx) inside_outside() argument
660 organize_levels(struct list_head *levels, struct set *remaining, struct set *reach, struct routes *routing, nir_function_impl *impl, bool is_domminated, void *mem_ctx) organize_levels() argument
870 struct set *reach = _mesa_pointer_set_create(mem_ctx); nir_structurize() local
889 struct set *reach = _mesa_pointer_set_create(mem_ctx); nir_structurize() local
[all...] |
| /third_party/musl/porting/liteos_m/kernel/src/regex/ |
| H A D | regexec.c | 146 more paths reach the same state, exactly one is chosen according to
189 tre_tnfa_reach_t *reach, *reach_next, *reach_i, *reach_next_i; in tre_tnfa_run_parallel() local
249 reach = (void *)tmp_buf; in tre_tnfa_run_parallel()
257 reach[i].tags = (void *)tmp_buf; in tre_tnfa_run_parallel()
326 /* Swap `reach' and `reach_next'. */ in tre_tnfa_run_parallel()
327 reach_i = reach; in tre_tnfa_run_parallel()
328 reach = reach_next; in tre_tnfa_run_parallel()
331 /* For each state in `reach', weed out states that don't fulfill the in tre_tnfa_run_parallel()
337 for (reach_i = reach; reach_i->state; reach_i++) in tre_tnfa_run_parallel()
367 /* Swap `reach' an in tre_tnfa_run_parallel()
[all...] |
| /third_party/musl/porting/liteos_m_iccarm/kernel/src/regex/ |
| H A D | regexec.c | 146 more paths reach the same state, exactly one is chosen according to
189 tre_tnfa_reach_t *reach, *reach_next, *reach_i, *reach_next_i; in tre_tnfa_run_parallel() local
249 reach = (void *)tmp_buf; in tre_tnfa_run_parallel()
257 reach[i].tags = (void *)tmp_buf; in tre_tnfa_run_parallel()
326 /* Swap `reach' and `reach_next'. */ in tre_tnfa_run_parallel()
327 reach_i = reach; in tre_tnfa_run_parallel()
328 reach = reach_next; in tre_tnfa_run_parallel()
331 /* For each state in `reach', weed out states that don't fulfill the in tre_tnfa_run_parallel()
337 for (reach_i = reach; reach_i->state; reach_i++) in tre_tnfa_run_parallel()
367 /* Swap `reach' an in tre_tnfa_run_parallel()
[all...] |
| /third_party/musl/porting/uniproton/kernel/src/regex/ |
| H A D | regexec.c | 146 more paths reach the same state, exactly one is chosen according to
189 tre_tnfa_reach_t *reach, *reach_next, *reach_i, *reach_next_i; in tre_tnfa_run_parallel() local
249 reach = (void *)tmp_buf; in tre_tnfa_run_parallel()
257 reach[i].tags = (void *)tmp_buf; in tre_tnfa_run_parallel()
326 /* Swap `reach' and `reach_next'. */ in tre_tnfa_run_parallel()
327 reach_i = reach; in tre_tnfa_run_parallel()
328 reach = reach_next; in tre_tnfa_run_parallel()
331 /* For each state in `reach', weed out states that don't fulfill the in tre_tnfa_run_parallel()
337 for (reach_i = reach; reach_i->state; reach_i++) in tre_tnfa_run_parallel()
367 /* Swap `reach' an in tre_tnfa_run_parallel()
[all...] |
| /third_party/musl/src/regex/ |
| H A D | regexec.c | 146 more paths reach the same state, exactly one is chosen according to
189 tre_tnfa_reach_t *reach, *reach_next, *reach_i, *reach_next_i; in tre_tnfa_run_parallel() local
249 reach = (void *)tmp_buf; in tre_tnfa_run_parallel()
257 reach[i].tags = (void *)tmp_buf; in tre_tnfa_run_parallel()
326 /* Swap `reach' and `reach_next'. */ in tre_tnfa_run_parallel()
327 reach_i = reach; in tre_tnfa_run_parallel()
328 reach = reach_next; in tre_tnfa_run_parallel()
331 /* For each state in `reach', weed out states that don't fulfill the in tre_tnfa_run_parallel()
337 for (reach_i = reach; reach_i->state; reach_i++) in tre_tnfa_run_parallel()
367 /* Swap `reach' an in tre_tnfa_run_parallel()
[all...] |
| /third_party/skia/third_party/externals/libwebp/src/enc/ |
| H A D | backward_references_cost_enc.c | 584 int reach = 0; in BackwardReferencesHashChainDistanceOnly() local
636 reach = i - 1 + len_prev - 1; in BackwardReferencesHashChainDistanceOnly()
640 if (i + len - 1 > reach) { in BackwardReferencesHashChainDistanceOnly()
647 // Already consider the pixel at "reach" to add intervals that are in BackwardReferencesHashChainDistanceOnly()
652 // Figure out the last consecutive pixel within [i, reach + 1] with in BackwardReferencesHashChainDistanceOnly()
654 for (j = i; j <= reach; ++j) { in BackwardReferencesHashChainDistanceOnly()
667 reach = j + len_j - 1; in BackwardReferencesHashChainDistanceOnly()
|
| H A D | backward_references_enc.c | 523 const int reach = in BackwardReferencesLz77() local
525 if (reach > max_reach) { in BackwardReferencesLz77()
527 max_reach = reach; in BackwardReferencesLz77()
607 // Given a pixel P, find the offsets that reach pixels unreachable from P-1 in BackwardReferencesLz77Box()
|
| /third_party/skia/src/core/ |
| H A D | SkGpuBlurUtils.cpp | 197 // 'mid' is the area where we can ignore the mode because the kernel does not reach to the in convolve_gaussian()
211 // Inset for sub-rect of 'srcBounds' where the x-dir kernel doesn't reach the edges, clipped in convolve_gaussian()
483 SkIRect reach = dstBounds.makeOutset(radiusX, radiusY); in GaussianBlur() local
485 if (!intersection.intersect(reach, srcBounds)) { in GaussianBlur()
489 if (reach.fLeft >= srcBounds.fRight) { in GaussianBlur()
491 } else if (reach.fRight <= srcBounds.fLeft) { in GaussianBlur()
494 if (reach.fTop >= srcBounds.fBottom) { in GaussianBlur()
496 } else if (reach.fBottom <= srcBounds.fTop) { in GaussianBlur()
|
| /third_party/python/Lib/test/ |
| H A D | test_http_cookiejar.py | 19 reach, is_HDN, domain_match, user_domain_match, request_path,
861 self.assertEqual(reach("www.acme.com"), ".acme.com")
862 self.assertEqual(reach("acme.com"), "acme.com")
863 self.assertEqual(reach("acme.local"), ".local")
864 self.assertEqual(reach(".local"), ".local")
865 self.assertEqual(reach(".com"), ".com")
866 self.assertEqual(reach("."), ".")
867 self.assertEqual(reach(""), "")
868 self.assertEqual(reach("192.168.0.1"), "192.168.0.1")
|
| /third_party/python/Lib/http/ |
| H A D | cookiejar.py | 691 def reach(h): function
692 """Return reach of host h, as defined by RFC 2965, section 1.
694 The reach R of a host name H is defined as follows:
705 then the reach of H is .B.
707 * Otherwise, the reach of H is H.
709 >>> reach("www.acme.com")
711 >>> reach("acme.com")
713 >>> reach("acme.local")
732 host U does not domain-match the reach R of the request-host O in the
737 if not domain_match(req_host, reach(reques
[all...] |
| /third_party/ffmpeg/libavcodec/x86/ |
| H A D | vp8dsp_loopfilter.asm | 51 ; fifth regular register is scratchspace to reach the bottom 8 rows, it
|
| /third_party/skia/third_party/externals/microhttpd/doc/ |
| H A D | texinfo.tex | 4087 % Swallow text until we reach the matching `@end #1'.
|