/third_party/mesa3d/src/util/ |
H A D | dag.c | 96 list_addtail(&child->link, &dag->heads); in dag_remove_edge() 103 * Removes a DAG head from the graph, and moves any new dag heads into the 104 * heads list. 126 list_addtail(&node->link, &dag->heads); in dag_init_node() 202 list_for_each_entry(struct dag_node, node, &dag->heads, link) { in dag_traverse_bottom_up() 217 list_inithead(&dag->heads); in dag_create()
|
H A D | dag.h | 42 /* Position in the DAG heads list (or a self-link) */ 50 struct list_head heads; member
|
/third_party/curl/src/ |
H A D | tool_cb_hdr.c | 73 struct OutStruct *heads = &per->heads; in tool_header_cb() local 100 if(per->config->headerfile && heads->stream) { in tool_header_cb() 101 size_t rc = fwrite(ptr, size, nmemb, heads->stream); in tool_header_cb() 105 (void)fflush(heads->stream); in tool_header_cb()
|
H A D | tool_cb_hdr.h | 35 * 'heads' member is a pointer to the OutStruct variable used to keep 47 struct OutStruct *heads; member
|
H A D | tool_operate.c | 667 if(per->heads.fopened && per->heads.stream) in post_per_transfer() 668 fclose(per->heads.stream); in post_per_transfer() 670 if(per->heads.alloc_filename) in post_per_transfer() 671 Curl_safefree(per->heads.filename); in post_per_transfer() 869 struct OutStruct *heads; in single_transfer() local 981 heads = &per->heads; in single_transfer() 982 heads->stream = stdout; in single_transfer() 1012 heads in single_transfer() [all...] |
H A D | tool_operate.h | 51 struct OutStruct heads; member
|
/third_party/skia/third_party/externals/abseil-cpp/absl/base/internal/ |
H A D | exponential_biased_test.cc | 125 int heads = 0; in TEST() local 127 ++heads; in TEST() 129 printf("Heads = %d (%f%%)\n", heads, 100.0 * heads / 10000000); in TEST()
|
/third_party/mesa3d/src/compiler/nir/ |
H A D | nir_schedule.c | 37 * vs reads, and some more for ordering intrinsics). Then we pick heads off 201 * We add @before as a child of @after, so that DAG heads are the outputs of 622 list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) { in nir_schedule_choose_instruction_fallback() 640 list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) { in nir_schedule_choose_instruction_fallback() 668 list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) { in nir_schedule_choose_instruction_csp() 686 list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) { in nir_schedule_choose_instruction_csp() 709 list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) { in nir_schedule_choose_instruction_csr() 730 list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) { in nir_schedule_choose_instruction_csr() 748 list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) { in nir_schedule_choose_instruction_csr() 771 list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, da in nir_schedule_choose_instruction_csr() [all...] |
/third_party/mesa3d/src/freedreno/ir3/ |
H A D | ir3_postsched.c | 166 foreach_sched_node (n, &ctx->dag->heads) { in dump_state() 208 foreach_sched_node (n, &ctx->dag->heads) { in choose_instr() 225 foreach_sched_node (n, &ctx->dag->heads) { in choose_instr() 239 foreach_sched_node (n, &ctx->dag->heads) { in choose_instr() 258 foreach_sched_node (n, &ctx->dag->heads) { in choose_instr() 283 foreach_sched_node (n, &ctx->dag->heads) { in choose_instr() 313 foreach_sched_node (n, &ctx->dag->heads) { in choose_instr() 330 foreach_sched_node (n, &ctx->dag->heads) { in choose_instr()
|
H A D | ir3_sched.c | 696 foreach_sched_node (n, &ctx->dag->heads) { in choose_instr_dec() 788 foreach_sched_node (n, &ctx->dag->heads) { in choose_instr_inc() 832 foreach_sched_node (n, &ctx->dag->heads) { in choose_instr_prio() 863 foreach_sched_node (n, &ctx->dag->heads) { in dump_state()
|
/third_party/libwebsockets/lib/secure-streams/ |
H A D | policy-json.c | 273 const lws_ss_auth_t *auth = a->heads[LTY_AUTH].a; in lws_ss_policy_find_auth_by_name() 300 a->curr[type].b->next = a->heads[type].b; in lws_ss_policy_alloc_helper() 301 a->heads[type].b = a->curr[type].b; in lws_ss_policy_alloc_helper() 462 a->curr[n].b->next = a->heads[n].b; in lws_ss_policy_parser_cb() 463 a->heads[n].b = a->curr[n].b; in lws_ss_policy_parser_cb() 561 x = a->heads[LTY_X509].x; in lws_ss_policy_parser_cb() 606 py = &a->heads[LTY_X509].x; in lws_ss_policy_parser_cb() 607 x = a->heads[LTY_X509].x; in lws_ss_policy_parser_cb() 833 bot = a->heads[LTY_BACKOFF].b; in lws_ss_policy_parser_cb() 847 ts = a->heads[LTY_TRUSTSTOR in lws_ss_policy_parser_cb() [all...] |
H A D | policy-common.c | 499 context->pss_policies = args->heads[LTY_POLICY].p; in lws_ss_policy_set() 562 x = args->heads[LTY_X509].x; in lws_ss_policy_set() 580 args->heads[LTY_METRICS].m; in lws_ss_policy_set()
|
/third_party/skia/third_party/externals/brotli/java/org/brotli/enc/ |
H A D | PreparedDictionaryGenerator.java | 138 ShortBuffer heads = pointer.asShortBuffer(); in generate() 165 heads.put(i, (short) 0xFFFF); in generate() 169 heads.put(i, (short) cursor); in generate()
|
/third_party/curl/lib/ |
H A D | ws.c | 684 struct wsfield heads[]= { in Curl_ws_request() local 710 heads[3].val = &keyval[0]; in Curl_ws_request() 724 for(i = 0; !result && (i < sizeof(heads)/sizeof(heads[0])); i++) { in Curl_ws_request() 725 if(!Curl_checkheaders(data, STRCONST(heads[i].name))) { in Curl_ws_request() 728 msnprintf(field, sizeof(field), "%s %s", heads[i].name, in Curl_ws_request() 729 heads[i].val); in Curl_ws_request() 733 result = Curl_dyn_addf(req, "%s %s\r\n", heads[i].name, in Curl_ws_request() 734 heads[i].val); in Curl_ws_request()
|
/third_party/toybox/toys/pending/ |
H A D | fdisk.c | 21 -C CYLINDERS Set number of cylinders/heads/sectors 33 long heads; 129 if (!g_heads) printf(" heads"); in chs_warn() 228 disk->heads = geometry.heads; in read_geometry() 372 disk.heads = disk.sectors = 0; in read_mbr() 379 g_heads = (FLAG(H) && TT.heads) ? TT.heads : h ? h : disk.heads ? disk.heads in read_mbr() [all...] |
/third_party/ntfs-3g/include/ntfs-3g/ |
H A D | device_io.h | 50 unsigned char heads; member
|
/third_party/gptfdisk/ |
H A D | mbrpart.cc | 126 void MBRPart::SetGeometry(uint32_t heads, uint32_t sectors, uint64_t ds, uint32_t bs) { in SetGeometry() argument 127 numHeads = heads; in SetGeometry()
|
H A D | mbrpart.h | 79 void SetGeometry(uint32_t heads, uint32_t sectors, uint64_t ds, uint32_t bs);
|
/third_party/lzma/C/ |
H A D | LzFindMt.c | 298 UInt32 *hash, UInt32 hashMask, UInt32 *heads, UInt32 numHeads, const UInt32 *crc)
304 *heads++ = pos - hash[value]; \
335 h0 = hash[v0]; hash[v0] = pos; heads[0] = pos - h0; pos++;
336 h1 = hash[v1]; hash[v1] = pos; heads[1] = pos - h1; pos++;
337 heads += 2;
342 *heads = pos - hash[v0];
493 UInt32 *heads = mt->hashBuf + GET_HASH_BLOCK_OFFSET(blockIndex++);
in HashThreadFunc() local 495 heads[0] = 2;
in HashThreadFunc() 496 heads[1] = num;
in HashThreadFunc() 498 /* heads[ in HashThreadFunc() [all...] |
H A D | LzFindMt.h | 40 UInt32 *hash, UInt32 hashMask, UInt32 *heads, UInt32 numHeads, const UInt32 *crc);
|
/third_party/mesa3d/src/gallium/drivers/vc4/ |
H A D | vc4_qir_schedule.c | 30 * heads. Heuristically pick a DAG head and schedule (remove) it, then put 31 * all the parents that are now DAG heads into the list of things to 80 * the latest instructions with nothing left to schedule are the DAG heads, 456 list_for_each_entry(struct schedule_node, n, &state->dag->heads, in choose_instruction() 532 list_for_each_entry(struct schedule_node, n, &state->dag->heads, in dump_state() 599 * since they are generally the DAG heads or close to them. in compute_delay() 625 while (!list_is_empty(&state->dag->heads)) { in schedule_instructions()
|
H A D | vc4_qpu_schedule.c | 29 * DAG of the dependencies, and make a list of the DAG heads. Heuristically 30 * pick a DAG head, then put all the children that are now DAG heads into the 569 list_for_each_entry(struct schedule_node, n, &scoreboard->dag->heads, in choose_instruction_to_schedule() 580 !list_is_singular(&scoreboard->dag->heads)) { in choose_instruction_to_schedule() 688 list_for_each_entry(struct schedule_node, n, &dag->heads, dag.link) { in dump_state() 877 while (!list_is_empty(&scoreboard->dag->heads)) { in schedule_instructions()
|
/third_party/FreeBSD/sbin/newfs_msdos/ |
H A D | mkfs_define.h | 81 * Get the firmwares notion of number of heads per cylinder. This 186 int heads; /* number of heads */ member
|
/third_party/mesa3d/src/panfrost/bifrost/ |
H A D | bi_pressure_schedule.c | 273 list_for_each_entry(struct sched_node, n, &s->dag->heads, dag.link) { in choose_instr() 311 while (!list_is_empty(&s->dag->heads)) { in pressure_schedule_block()
|
/third_party/ntfs-3g/libntfs-3g/ |
H A D | device.c | 740 dev->d_heads = res->disk_geo.heads; in ntfs_device_get_geo() 751 ntfs_log_debug("EDD/BIOD legacy heads = %u, sectors " in ntfs_device_get_geo() 763 dev->d_heads = geo.heads; in ntfs_device_get_geo() 765 ntfs_log_debug("HDIO_GETGEO heads = %u, sectors per " in ntfs_device_get_geo() 778 * ntfs_device_heads_get - get number of heads of device 781 * On success, return the number of heads on the device @dev. On error return
|