/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | PtrUseVisitor.cpp | 1 //===- PtrUseVisitor.cpp - InstVisitors over a pointers uses --------------===// 19 for (Use &U : I.uses()) {
|
H A D | CaptureTracking.cpp | 219 for (const Use &U : V->uses()) { 220 // If there are lots of uses, conservatively say that the value 281 for (Use &UU : I->uses()) { 282 // If there are lots of uses, conservatively say that the value 314 // All uses examined.
|
/freebsd-11.0-release/contrib/ncurses/ncurses/tinfo/ |
H A D | alloc_entry.c | 134 /* copy term_names, Strings, uses */ 144 if (ep->uses[i].name == 0) { 145 ep->uses[i].name = _nc_save_str(ep->uses[i].name); 167 if (ep->uses[i].name == 0) 170 useoffsets[i] = (int) (ep->uses[i].name - stringbuf); 214 ep->uses[i].name = 0; 216 ep->uses[i].name = (tp->str_table + useoffsets[i]);
|
H A D | comp_parse.c | 319 char *lookfor = qp->uses[i].name; 320 long lookline = qp->uses[i].line; 333 qp->uses[i].link = rp; 354 qp->uses[i].link = rp; 366 qp->uses[i].link = 0; 399 if (qp->uses[i].link->nuses) { 419 &qp->uses[qp->nuses - 1].link->tterm);
|
H A D | parse_entry.c | 285 entryp->uses[entryp->nuses].name = _nc_save_str(_nc_curr_token.tk_valstring); 286 entryp->uses[entryp->nuses].line = _nc_curr_line; 504 if (!strchr((char *) entryp->uses[i].name, '+'))
|
/freebsd-11.0-release/contrib/llvm/lib/Target/PowerPC/ |
H A D | PPCMachineFunctionInfo.h | 104 /// Whether this uses the PIC Base register or not. 196 void setUsesPICBase(bool uses) { UsesPICBase = uses; } argument
|
/freebsd-11.0-release/tools/LibraryReport/ |
H A D | LibraryReport.tcl | 130 # examineExecutable to see if it uses any shared libraries. Call ourselves 200 set uses ""; 209 lappend uses $lib; 216 if {$verbose} {puts "$uses";}
|
/freebsd-11.0-release/contrib/netbsd-tests/bin/ps/ |
H A D | t_ps.sh | 247 atf_set "descr" "Tests simple uses of header overriding via" \ 306 atf_set "descr" "Tests simple uses of null column headings" \
|
/freebsd-11.0-release/contrib/gcc/ |
H A D | bt-load.c | 89 btr_user uses; member in struct:btr_def_s 152 instruction that uses the target register value means that the hardware 168 the end of that block, including any uses by a final jump insn, if any. */ 320 this->uses = NULL; 342 uses easily. 454 /* Scan the code building up the set of all defs and all uses. 585 /* If this block ends in a jump insn, add any uses or even clobbers 674 /* Link uses to the uses lists of all of their reaching defs. 758 user->next = def->uses; [all...] |
H A D | sched-deps.c | 933 /* Analyze the uses of memory and registers in rtx X in INSN. */ 1066 mode. An insn should not be moved across this even if it only uses 1210 reg_last->uses = alloc_INSN_LIST (insn, reg_last->uses); 1267 add_dependence_list (insn, reg_last->uses, 0, REG_DEP_ANTI); 1281 add_dependence_list_and_free (insn, ®_last->uses, 0, 1316 reg_last->uses = alloc_INSN_LIST (insn, reg_last->uses); 1323 add_dependence_list (insn, reg_last->uses, 0, REG_DEP_ANTI); 1332 add_dependence_list (insn, reg_last->uses, [all...] |
H A D | loop-invariant.c | 81 struct use *uses; /* The list of uses that are uniquely reached member in struct:def 83 unsigned n_uses; /* Number of such uses. */ 682 u->next = def->uses; 683 def->uses = u; 700 for (use = DF_INSN_GET (df, insn)->uses; use; use = use->next_ref) 810 for (use = DF_INSN_GET (df, insn)->uses; use; use = use->next_ref) 896 /* Frees a list of uses USE. */ 973 && !dep->def->uses->next) 986 of registers used in the loop, N_INV_USES is the number of uses o [all...] |
H A D | tree-flow-inline.h | 444 /* Return true if VAR has no uses. */ 483 /* Return the number of immediate uses of VAR. */ 825 if (ptr->uses) 827 use_p = USE_OP_PTR (ptr->uses); 828 ptr->uses = ptr->uses->next; 895 if (ptr->uses) 897 val = USE_OP (ptr->uses); 898 ptr->uses = ptr->uses [all...] |
H A D | df.h | 64 all uses of a register (the mem_load and mem_store relate to how 84 artificial one created to model always live registers, eh uses, etc. */ 108 Most of the uses of this are with sets that have a 221 #define DF_EQUIV_NOTES 2 /* Mark uses present in EQUIV/EQUAL notes. */ 240 instruction. These are factored into individual uses and defs but 258 struct df_ref *uses; /* Head of insn-use chain. */ member in struct:df_insn_info 268 the uses and one for the defs. */ 294 /* For each regno, there are two chains of refs, one for the uses 300 /* Each insn has two lists, one for the uses and one for the 315 /* Two of these structures are allocated, one for the uses an [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/ |
H A D | AArch64DeadRegisterDefinitionsPass.cpp | 74 for (const MachineOperand &Op : MI.uses()) 86 // dead def it uses a frame index which might expand into a multi
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/IPO/ |
H A D | IPConstantPropagation.cpp | 77 /// PropagateConstantsIntoArguments - Look at all uses of the specified 78 /// function. If all uses are direct call sites, and all pass a particular 90 for (Use &U : F.uses()) { 92 // Ignore blockaddress uses. 221 // over all users, replacing any uses of the return value with the returned 224 for (Use &U : F.uses()) { 261 // If this use uses a specific return value, and we have a replacement,
|
H A D | DeadArgumentElimination.cpp | 85 /// with no registered uses (in Uses) will never be marked alive and will 100 /// arguments it uses. This allows the MaybeLive values to be marked live 126 // DAH uses this to specify a different ID. 292 // Loop over the argument list, transferring uses of the old arguments over to 360 for (Use &U : Fn.uses()) { 437 // that U is really a use of an insertvalue instruction that uses the 462 // depends on all uses of that aggregate, but if it is used as a return 467 // we don't change RetValNum, but do survey all our uses. 470 for (const Use &UU : IV->uses()) { 511 /// SurveyUses - This looks at all the uses o [all...] |
/freebsd-11.0-release/contrib/bmake/mk/ |
H A D | rst2htm.mk | 28 # otherwise it uses RST2HTML
|
/freebsd-11.0-release/share/dtrace/ |
H A D | tcpdebug | 29 * The tcpdebug D script uses the tcp:kernel::debug tracepoints
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/ObjCARC/ |
H A D | ProvenanceAnalysis.cpp | 83 for (const Use &U : P->uses()) {
|
/freebsd-11.0-release/contrib/ncurses/include/ |
H A D | term_entry.h | 81 } uses[MAX_USES]; member in struct:entry
|
/freebsd-11.0-release/contrib/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUOpenCLImageTypeLoweringPass.cpp | 154 for (auto &Use : ImageArg.uses()) { 187 for (const auto &Use : SamplerArg.uses()) {
|
/freebsd-11.0-release/contrib/gdb/ |
H A D | djunpack.bat | 28 Rem The following uses a feature of COPY whereby it does not copy
|
/freebsd-11.0-release/usr.sbin/quot/ |
H A D | quot.c | 70 static void uses(uid_t, daddr_t, time_t); 325 uses(uid_t uid, daddr_t blks, time_t act) function 456 uses(DIP(super, dp, di_uid),
|
/freebsd-11.0-release/contrib/llvm/include/llvm/IR/ |
H A D | Value.h | 105 /// User uses this value to find the Use list. 259 /// \brief Change all uses of this to point to a new Value. 261 /// Go through the uses list for this definition and make each use point to 266 /// replaceUsesOutsideBlock - Go through the uses list for this definition and 274 // Methods for handling the chain of uses of this Value. 276 // Materializing a function can introduce new uses, so these methods come in 278 // The methods that start with materialized_ check the uses that are 280 // when using them since you might not get all uses. 312 iterator_range<use_iterator> uses() { function 316 iterator_range<const_use_iterator> uses() cons function [all...] |
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
H A D | ImplicitNullChecks.cpp | 114 /// This class keeps track of defs and uses, and can be queried if a given 370 for (auto &MO : LoadMI->uses())
|