/freebsd-9.3-release/contrib/ncurses/ncurses/tinfo/ |
H A D | alloc_entry.c | 157 /* copy term_names, Strings, uses */ 167 if (ep->uses[i].name == 0) { 168 ep->uses[i].name = _nc_save_str(ep->uses[i].name); 190 if (ep->uses[i].name == 0) 193 useoffsets[i] = ep->uses[i].name - stringbuf; 236 ep->uses[i].name = 0; 238 ep->uses[i].name = (tp->str_table + useoffsets[i]);
|
H A D | comp_parse.c | 229 char *lookfor = qp->uses[i].name; 230 long lookline = qp->uses[i].line; 243 qp->uses[i].link = rp; 266 qp->uses[i].link = rp; 278 qp->uses[i].link = 0; 311 if (qp->uses[i].link->nuses) { 331 &qp->uses[qp->nuses - 1].link->tterm);
|
H A D | parse_entry.c | 280 entryp->uses[entryp->nuses].name = _nc_save_str(_nc_curr_token.tk_valstring); 281 entryp->uses[entryp->nuses].line = _nc_curr_line; 497 if (!strchr((char *) entryp->uses[i].name, '+'))
|
/freebsd-9.3-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-9.3-release/contrib/bmake/mk/ |
H A D | rst2htm.mk | 27 # otherwise it uses RST2HTML
|
H A D | warnings.mk | 73 # This version uses .for loops to avoid a double free bug in old bmake's
|
/freebsd-9.3-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...] |
H A D | sched-int.h | 121 rtx uses; member in struct:deps::deps_reg 129 in reg_last[N].{uses,sets,clobbers}. */
|
H A D | tree-into-ssa.c | 247 distinguish statements that need to have both uses and defs 250 registered, but they don't need to have their uses renamed. */ 494 of VAR. Additionally, we have not seen any uses of VAR yet, so 713 2- If S uses a variable VAR and there is no preceding kill of VAR, 830 prune_unused_phi_nodes (bitmap phis, bitmap kills, bitmap uses) argument 843 if (bitmap_empty_p (uses)) 852 bitmap_and_compl (to_remove, kills, uses); 865 Instead, we basically emulate standard dce. We put all uses to worklist, 876 If we store the bounds for all the uses to an array and sort it, we can 940 /* Now process the uses [all...] |
H A D | tree-ssa-operands.h | 187 use_optype_p uses; member in struct:ssa_operand_iterator_d
|
/freebsd-9.3-release/contrib/llvm/lib/Support/Windows/ |
H A D | DynamicLibrary.inc | 60 // Mingw32 uses msvcrt.dll by default. Don't ignore it.
|
/freebsd-9.3-release/contrib/ncurses/include/ |
H A D | term_entry.h | 62 uses[MAX_USES]; member in struct:entry
|
/freebsd-9.3-release/contrib/gdb/ |
H A D | djunpack.bat | 28 Rem The following uses a feature of COPY whereby it does not copy
|
/freebsd-9.3-release/contrib/ncurses/progs/ |
H A D | toe.c | 406 (void) printf(" %s", qp->uses[j].name); 427 rp->uses[i].name, "|")) {
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Sema/ |
H A D | AnalysisBasedWarnings.cpp | 659 /// DiagnoseUninitializedUse -- Helper function for diagnosing uses of an 661 /// emitted for particular types of uses. Returns true if the use was diagnosed 1193 UsesMap *uses; member in class:__anon3221::UninitValsDiagReporter 1196 UninitValsDiagReporter(Sema &S) : S(S), uses(0) {} 1202 if (!uses) 1203 uses = new UsesMap(); 1205 MappedType &V = (*uses)[vd]; 1221 if (!uses) 1224 for (UsesMap::iterator i = uses->begin(), e = uses [all...] |
/freebsd-9.3-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-9.3-release/contrib/one-true-awk/ |
H A D | README | 65 NOTE: This version uses ANSI C, as you should also. We have
|
/freebsd-9.3-release/contrib/libucl/ |
H A D | README.md | 230 UCL can handle multiline strings as well as single line ones. It uses shell/perl like notation for such objects:
|
/freebsd-9.3-release/contrib/llvm/lib/Support/Unix/ |
H A D | Memory.inc | 61 // Cache uses instructions dcbf and icbi, both of which are treated by
|
/freebsd-9.3-release/share/mk/ |
H A D | bsd.info.mk | 4 # Texinfo is a documentation system that uses a single source
|
/freebsd-9.3-release/contrib/llvm/lib/IR/ |
H A D | ConstantsContext.h | 399 static unsigned uses(const std::vector<T, Alloc>& v) { function in struct:llvm::ConstantTraits 406 static unsigned uses(Constant * const & v) { function in struct:llvm::ConstantTraits 414 return new(ConstantTraits<ValType>::uses(V)) ConstantClass(Ty, V);
|