HomeSort by: relevance | last modified time | path
    Searched defs:pset (Results 1 - 25 of 46) sorted by relevancy

1 2

  /src/external/gpl3/gcc/dist/gcc/
gimple-walk.h 40 hash_set<tree> *pset; member in struct:walk_stmt_info
gimple-walk.cc 178 walk_tree (&OP, CALLBACK_OP, WI, WI->PSET)
190 hash_set<tree> *pset = (wi) ? wi->pset : NULL; local
213 pset);
231 ret = walk_tree (gimple_op_ptr (stmt, 0), callback_op, wi, pset);
250 callback_op, wi, pset);
254 ret = walk_tree (gimple_call_fn_ptr (stmt), callback_op, wi, pset);
264 pset);
278 ret = walk_tree (gimple_call_lhs_ptr (stmt), callback_op, wi, pset);
292 callback_op, wi, pset);
    [all...]
ipa-free-lang-data.cc 65 hash_set<tree> pset; member in class:__anon13783::free_lang_data_d
94 if (t && !is_lang_specific (t) && !fld->pset.contains (t))
174 if (!fld->pset.add (v))
214 if (!fld->pset.add (array))
260 if (!fld->pset.add (first))
284 if (!fld->pset.add (copy))
421 && !fld->pset.contains (TYPE_NEXT_VARIANT (type)))
447 if (!fld->pset.add (TREE_VALUE (p)))
875 if (!fld->pset.contains (t))
876 walk_tree (&t, find_decls_types_r, fld, &fld->pset);
    [all...]
rtlanal.cc 1502 /* Add all hard register in X to *PSET. */
1504 find_all_hard_regs (const_rtx x, HARD_REG_SET *pset)
1511 add_to_hard_reg_set (pset, GET_MODE (x), REGNO (x));
1521 HARD_REG_SET *pset = (HARD_REG_SET *)data;
1523 add_to_hard_reg_set (pset, GET_MODE (x), REGNO (x));
1527 Store it in *PSET. Should only be called after reload.
1533 find_all_hard_reg_sets (const rtx_insn *insn, HARD_REG_SET *pset, bool implicit)
1537 CLEAR_HARD_REG_SET (*pset);
1538 note_stores (insn, record_hard_reg_sets, pset);
1540 *pset |= insn_callee_abi (insn).full_reg_clobbers ()
1510 HARD_REG_SET *pset = (HARD_REG_SET *)data; local
1532 record_hard_reg_sets (XEXP (link, 0), NULL, pset); local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
gimple-walk.h 40 hash_set<tree> *pset; member in struct:walk_stmt_info
gimple-walk.cc 168 walk_tree (&OP, CALLBACK_OP, WI, WI->PSET)
180 hash_set<tree> *pset = (wi) ? wi->pset : NULL; local
203 pset);
221 ret = walk_tree (gimple_op_ptr (stmt, 0), callback_op, wi, pset);
240 callback_op, wi, pset);
244 ret = walk_tree (gimple_call_fn_ptr (stmt), callback_op, wi, pset);
254 pset);
268 ret = walk_tree (gimple_call_lhs_ptr (stmt), callback_op, wi, pset);
282 callback_op, wi, pset);
    [all...]
ipa-free-lang-data.cc 65 hash_set<tree> pset; member in class:__anon16213::free_lang_data_d
94 if (t && !is_lang_specific (t) && !fld->pset.contains (t))
174 if (!fld->pset.add (v))
214 if (!fld->pset.add (array))
260 if (!fld->pset.add (first))
284 if (!fld->pset.add (copy))
421 && !fld->pset.contains (TYPE_NEXT_VARIANT (type)))
447 if (!fld->pset.add (TREE_VALUE (p)))
875 if (!fld->pset.contains (t))
876 walk_tree (&t, find_decls_types_r, fld, &fld->pset);
    [all...]
omp-general.cc 1133 hash_set<tree> pset; local
1135 if (pset.add (TREE_PURPOSE (t1)))
  /src/external/gpl3/gcc/dist/gcc/cp/
cp-ubsan.cc 160 hash_set<tree> *pset; member in struct:cp_ubsan_check_member_access_data
179 cp_walk_tree (&base, cp_ubsan_check_member_access_r, ucmd, ucmd->pset);
216 data, ucmd->pset);
227 cp_walk_tree (&t, cp_ubsan_check_member_access_r, data, ucmd->pset);
247 cp_ubsan_check_member_access_r, data, ucmd->pset);
264 hash_set<tree> pset; local
266 ucmd.pset = &pset;
268 cp_walk_tree (t_p, cp_ubsan_check_member_access_r, &ucmd, &pset);
typeck2.cc 1418 auto pset = static_cast<hash_set<tree> *>(data);
1424 && !pset->add (t))
1447 pset->add (arg);
1496 hash_set<tree> pset;
1497 cp_walk_tree (&init, replace_placeholders_for_class_temp_r, &pset, nullptr);
1415 auto pset = static_cast<hash_set<tree> *>(data); local
1493 hash_set<tree> pset; local
cp-gimplify.cc 81 hash_set<tree> pset; member in struct:cp_fold_data
1308 else if (!data->pset.add (stmt))
1412 if (data->pset.add (stmt))
search.cc 1543 tree (*post_fn) (tree, void *), hash_set<tree> *pset,
1567 if (pset->add (base_binfo))
1570 rval = dfs_walk_once_r (base_binfo, pre_fn, post_fn, pset, data);
1609 hash_set<tree> pset;
1610 rval = dfs_walk_once_r (binfo, pre_fn, post_fn, &pset, data);
1624 dfs_walk_once_accessible_r (tree binfo, bool friends_p, hash_set<tree> *pset,
1648 bool mark = pset && BINFO_VIRTUAL_P (base_binfo);
1650 if (mark && pset->contains (base_binfo))
1669 pset->add (base_binfo);
1671 rval = dfs_walk_once_accessible_r (base_binfo, friends_p, pset,
1607 hash_set<tree> pset; local
1696 hash_set<tree> *pset = NULL; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/cp/
cp-ubsan.cc 160 hash_set<tree> *pset; member in struct:cp_ubsan_check_member_access_data
179 cp_walk_tree (&base, cp_ubsan_check_member_access_r, ucmd, ucmd->pset);
216 data, ucmd->pset);
227 cp_walk_tree (&t, cp_ubsan_check_member_access_r, data, ucmd->pset);
247 cp_ubsan_check_member_access_r, data, ucmd->pset);
264 hash_set<tree> pset; local
266 ucmd.pset = &pset;
268 cp_walk_tree (t_p, cp_ubsan_check_member_access_r, &ucmd, &pset);
cp-gimplify.cc 48 hash_set<tree> pset; member in struct:cp_fold_data
987 if (!data->pset.add (stmt))
1035 if (data->pset.add (stmt))
search.cc 1492 tree (*post_fn) (tree, void *), hash_set<tree> *pset,
1516 if (pset->add (base_binfo))
1519 rval = dfs_walk_once_r (base_binfo, pre_fn, post_fn, pset, data);
1558 hash_set<tree> pset;
1559 rval = dfs_walk_once_r (binfo, pre_fn, post_fn, &pset, data);
1573 dfs_walk_once_accessible_r (tree binfo, bool friends_p, hash_set<tree> *pset,
1597 bool mark = pset && BINFO_VIRTUAL_P (base_binfo);
1599 if (mark && pset->contains (base_binfo))
1618 pset->add (base_binfo);
1620 rval = dfs_walk_once_accessible_r (base_binfo, friends_p, pset,
1556 hash_set<tree> pset; local
1645 hash_set<tree> *pset = NULL; local
    [all...]
  /src/external/mit/libuv/dist/src/unix/
posix-poll.c 136 sigset_t* pset; local
175 pset = NULL;
177 pset = &set;
178 sigemptyset(pset);
179 sigaddset(pset, SIGPROF);
210 if (pset != NULL)
211 if (pthread_sigmask(SIG_BLOCK, pset, NULL))
214 if (pset != NULL)
215 if (pthread_sigmask(SIG_UNBLOCK, pset, NULL))
kqueue.c 169 sigset_t* pset; local
246 pset = NULL;
248 pset = &set;
249 sigemptyset(pset);
250 sigaddset(pset, SIGPROF);
277 if (pset != NULL)
278 pthread_sigmask(SIG_BLOCK, pset, NULL);
299 if (pset != NULL)
300 pthread_sigmask(SIG_UNBLOCK, pset, NULL);
sunos.c 153 sigset_t* pset; local
193 pset = NULL;
195 pset = &set;
196 sigemptyset(pset);
197 sigaddset(pset, SIGPROF);
230 if (pset != NULL)
231 pthread_sigmask(SIG_BLOCK, pset, NULL);
239 if (pset != NULL)
240 pthread_sigmask(SIG_UNBLOCK, pset, NULL);
  /src/external/gpl3/gcc.old/dist/gcc/c-family/
c-gimplify.cc 70 hash_set<tree> *pset = (hash_set<tree> *) data; local
82 walk_tree (&DECL_INITIAL (decl), ubsan_walk_array_refs_r, pset, local
83 pset); local
84 walk_tree (&DECL_SIZE (decl), ubsan_walk_array_refs_r, pset, pset); local
85 walk_tree (&DECL_SIZE_UNIT (decl), ubsan_walk_array_refs_r, pset, local
86 pset); local
88 walk_tree (&BIND_EXPR_BODY (*tp), ubsan_walk_array_refs_r, pset, pset);
99 pset->add (aref)
101 walk_tree (&TREE_OPERAND (aref, 0), ubsan_walk_array_refs_r, pset, pset); local
102 walk_tree (&TREE_OPERAND (aref, 1), ubsan_walk_array_refs_r, pset, pset); local
103 walk_tree (&TREE_OPERAND (aref, 2), ubsan_walk_array_refs_r, pset, pset); local
104 walk_tree (&TREE_OPERAND (aref, 3), ubsan_walk_array_refs_r, pset, pset); local
525 hash_set<tree> *pset = (c_dialect_cxx () local
533 walk_tree_1 (tsi_stmt_ptr (i), func, data, pset, lh); local
576 hash_set<tree> pset; local
577 walk_tree (&DECL_SAVED_TREE (fndecl), ubsan_walk_array_refs_r, &pset, local
578 &pset); local
588 hash_set<tree> pset; local
589 walk_tree (&DECL_SAVED_TREE (fndecl), c_genericize_control_r, &pset, local
590 &pset); local
    [all...]
c-omp.cc 1400 hash_set<tree> pset;
1402 d->ppset = &pset;
1587 hash_set<tree> pset; local
1596 data.ppset = &pset;
1686 hash_set<tree> pset; local
1695 data.ppset = &pset;
  /src/external/gpl3/gcc/dist/gcc/c-family/
c-gimplify.cc 73 hash_set<tree> *pset = (hash_set<tree> *) data; local
85 walk_tree (&DECL_INITIAL (decl), ubsan_walk_array_refs_r, pset, local
86 pset); local
87 walk_tree (&DECL_SIZE (decl), ubsan_walk_array_refs_r, pset, pset); local
88 walk_tree (&DECL_SIZE_UNIT (decl), ubsan_walk_array_refs_r, pset, local
89 pset); local
91 walk_tree (&BIND_EXPR_BODY (*tp), ubsan_walk_array_refs_r, pset, pset);
102 pset->add (aref)
104 walk_tree (&TREE_OPERAND (aref, 0), ubsan_walk_array_refs_r, pset, pset); local
105 walk_tree (&TREE_OPERAND (aref, 1), ubsan_walk_array_refs_r, pset, pset); local
106 walk_tree (&TREE_OPERAND (aref, 2), ubsan_walk_array_refs_r, pset, pset); local
107 walk_tree (&TREE_OPERAND (aref, 3), ubsan_walk_array_refs_r, pset, pset); local
610 hash_set<tree> *pset = (c_dialect_cxx () local
618 walk_tree_1 (tsi_stmt_ptr (i), func, data, pset, lh); local
662 hash_set<tree> pset; local
663 walk_tree (&DECL_SAVED_TREE (fndecl), ubsan_walk_array_refs_r, &pset, local
664 &pset); local
674 hash_set<tree> pset; local
675 walk_tree (&DECL_SAVED_TREE (fndecl), c_genericize_control_r, &pset, local
676 &pset); local
    [all...]
c-omp.cc 1406 hash_set<tree> pset;
1408 d->ppset = &pset;
1593 hash_set<tree> pset; local
1602 data.ppset = &pset;
1692 hash_set<tree> pset; local
1701 data.ppset = &pset;
  /src/usr.sbin/sysinst/
bsddisklabel.c 57 static size_t fill_ptn_menu(struct partition_usage_set *pset);
158 set_pset_exit_str(struct partition_usage_set *pset)
163 daddr_t free_space = pset->cur_free_space;
183 struct partition_usage_set *pset = arg; local
190 for (i = 0; i < pset->num; i++) {
191 if (pset->infos[i].flags & PUIFLG_IS_OUTER)
193 else if (pset->infos[i].cur_part_id != NO_PART)
224 struct partition_usage_set *pset = arg; local
230 if (opt < 0 || (size_t)opt >= pset->num)
234 if ((pset->infos[opt].flags & PUIFLAG_EXTEND) &
314 struct partition_usage_set *pset = arg; local
385 struct partition_usage_set *pset = arg; local
562 struct partition_usage_set *pset = arg; local
    [all...]
label.c 87 * We have previously sorted pset->parts and pset->infos to be in sync,
92 real_partition(const struct partition_usage_set *pset, int index)
94 if (index < 0 || (size_t)index >= pset->num)
97 return pset->infos[index].cur_part_id != NO_PART;
187 verify_parts(struct partition_usage_set *pset, bool install)
197 parts = pset->parts;
198 for (i = 0; i < pset->num; i++) {
199 wanted = &pset->infos[i];
260 start = getpartoff(edit->pset->parts, edit->info.start)
860 struct partition_usage_set *pset = arg; local
1352 struct partition_usage_set *pset = arg; local
1421 struct partition_usage_set *pset = arg; local
1548 struct partition_usage_set *pset = arg; local
1694 struct partition_usage_set *pset = arg; local
1711 struct partition_usage_set *pset = arg; local
1822 struct partition_usage_set *pset = arg; local
    [all...]
  /src/external/bsd/unbound/dist/util/data/
msgreply.c 343 parse_rr_copy(sldns_buffer* pkt, struct rrset_parse* pset,
347 struct rr_parse* rr = pset->rr_first;
349 size_t total = pset->rr_count + pset->rrsig_count;
351 data->count = pset->rr_count;
352 data->rrsig_count = pset->rrsig_count;
366 &data->rr_ttl[i], pset->type, pset->section))
371 rr = pset->rrsig_first;
377 &data->rr_ttl[i], LDNS_RR_TYPE_RRSIG, pset->section)
500 struct rrset_parse *pset = msg->rrset_first; local
    [all...]

Completed in 65 milliseconds

1 2