Searched defs:def (Results 76 - 100 of 172) sorted by relevance

1234567

/freebsd-10-stable/contrib/gcc/
H A Dtree-dfa.c670 set_default_def (tree var, tree def) argument
H A Dtree-ssa-copy.c741 tree def; local
894 tree phi, def; local
[all...]
H A Dtree-ssa.c94 tree def = TREE_VALUE (arg); local
1155 tree def = SSA_NAME_DEF_STMT (t); local
[all...]
H A Dtree-tailcall.c699 tree def; local
H A Dtree-vect-analyze.c512 tree def = PHI_RESULT (phi); local
1623 tree def, def_stm local
[all...]
H A Dbt-load.c267 find_btr_def_group(btr_def_group *all_btr_def_groups, btr_def def) argument
496 btr_def def = add_btr_def ( local
690 btr_def def = def_array[insn_uid]; local
729 btr_def def = def_array[uid]; local
819 block_at_edge_of_live_range_p(int bb, btr_def def) argument
842 clear_btr_from_live_range(btr_def def) argument
870 add_btr_to_live_range(btr_def def, int own_end) argument
1014 btr_def_live_range(btr_def def, HARD_REG_SET *btrs_live_in_range) argument
1061 combine_btr_defs(btr_def def, HARD_REG_SET *btrs_live_in_range) argument
1150 move_btr_def(basic_block new_def_bb, int btr, btr_def def, bitmap live_range, HARD_REG_SET *btrs_live_in_range) argument
1275 migrate_btr_def(btr_def def, int min_cost) argument
1440 btr_def def = fibheap_extract_min (all_btr_defs); local
[all...]
/freebsd-10-stable/contrib/gdb/gdb/cli/
H A Dcli-dump.c50 scan_expression_with_cleanup (char **cmd, const char *def) argument
/freebsd-10-stable/contrib/gdb/gdb/
H A Dmacroexp.c807 substitute_args(struct macro_buffer *dest, struct macro_definition *def, int argc, struct macro_buffer *argv, struct macro_name_list *no_loop, macro_lookup_ftype *lookup_func, void *lookup_baton) argument
898 expand(const char *id, struct macro_definition *def, struct macro_buffer *dest, struct macro_buffer *src, struct macro_name_list *no_loop, macro_lookup_ftype *lookup_func, void *lookup_baton) argument
1032 struct macro_definition *def = lookup_func (id, lookup_baton); local
[all...]
/freebsd-10-stable/contrib/groff/src/devices/xditview/
H A Dxditview.c591 MakePrompt(Widget centerw, const char *prompt, MakePromptFunc func, const char *def) argument
/freebsd-10-stable/contrib/groff/src/preproc/eqn/
H A Dlex.cpp125 const char *def; member in struct:__anon1535
263 definition *def = new definition[1]; local
269 definition *def = new definition[1]; local
275 definition *def = new definition[1]; local
797 definition *def = macro_table.lookup(token_buffer.contents()); local
860 definition *def = macro_table.lookup(token_buffer.contents()); local
917 definition *def = macro_table.lookup(name); local
1012 definition *def = macro_table.lookup(token_buffer.contents()); local
[all...]
/freebsd-10-stable/contrib/llvm/include/llvm/CodeGen/
H A DLiveInterval.h52 SlotIndex def; member in class:llvm::VNInfo
161 assert(S < E && �); } bool contains(SlotIndex I) const { return start <= I && I < end; } bool containsInterval(SlotIndex S, SlotIndex E) const { assert((S < E) && �); return (start <= S && S < end) && (start < E && E <= end); } bool operator<(const Segment &Other) const { return start < Other.start || (start == Other.start && end < Other.end); } bool operator==(const Segment &Other) const { return start == Other.start && end == Other.end; } void dump() const; }; typedef SmallVector<Segment,4> Segments; typedef SmallVector<VNInfo*,4> VNInfoList; Segments segments; VNInfoList valnos; typedef Segments::iterator iterator; iterator begin() { return segments.begin(); } iterator end() { return segments.end(); } typedef Segments::const_iterator const_iterator; const_iterator begin() const { return segments.begin(); } const_iterator end() const { return segments.end(); } typedef VNInfoList::iterator vni_iterator; vni_iterator vni_begin() { return valnos.begin(); } vni_iterator vni_end() { return valnos.end(); } typedef VNInfoList::const_iterator const_vni_iterator; const_vni_iterator vni_begin() const { return valnos.begin(); } const_vni_iterator vni_end() const { return valnos.end(); } iterator advanceTo(iterator I, SlotIndex Pos) { assert(I != end()); if (Pos >= endIndex()) return end(); while (I->end <= Pos) ++I; return I; } iterator find(SlotIndex Pos); const_iterator find(SlotIndex Pos) const { return const_cast<LiveRange*>(this)->find(Pos); } void clear() { valnos.clear(); segments.clear(); } size_t size() const { return segments.size(); } bool hasAtLeastOneValue() const { return !valnos.empty(); } bool containsOneValue() const { return valnos.size() == 1; } unsigned getNumValNums() const { return (unsigned)valnos.size(); } inline VNInfo *getValNumInfo(unsigned ValNo) { return valnos[ValNo]; } inline const VNInfo *getValNumInfo(unsigned ValNo) const { return valnos[ValNo]; } bool containsValue(const VNInfo *VNI) const { return VNI && VNI->id < getNumValNums() && VNI == getValNumInfo(VNI->id); } VNInfo *getNextValue(SlotIndex def, VNInfo::Allocator &VNInfoAllocator) { VNInfo *VNI = new (VNInfoAllocator) VNInfo((unsigned)valnos.size(), def); valnos.push_back(VNI); return VNI; } VNInfo *createDeadDef(SlotIndex Def, VNInfo::Allocator &VNInfoAllocator); VNInfo *createValueCopy(const VNInfo *orig, VNInfo::Allocator &VNInfoAllocator) { VNInfo *VNI = new (VNInfoAllocator) VNInfo((unsigned)valnos.size(), *orig); valnos.push_back(VNI); return VNI; } void RenumberValues(); VNInfo* MergeValueNumberInto(VNInfo *V1, VNInfo *V2); void MergeSegmentsInAsValue(const LiveRange &RHS, VNInfo *LHSValNo); void MergeValueInAsValue(const LiveRange &RHS, const VNInfo *RHSValNo, VNInfo *LHSValNo); bool empty() const { return segments.empty(); } SlotIndex beginIndex() const { assert(!empty() && �); return segments.front().start; } SlotIndex endIndex() const { assert(!empty() && �); return segments.back().end; } bool expiredAt(SlotIndex index) const { return index >= endIndex(); } bool liveAt(SlotIndex index) const { const_iterator r = find(index); return r != end() && r->start <= index; } const Segment *getSegmentContaining(SlotIndex Idx) const { const_iterator I = FindSegmentContaining(Idx); return I == end() ? 0 : &*I; } Segment *getSegmentContaining(SlotIndex Idx) { iterator I = FindSegmentContaining(Idx); return I == end() ? 0 : &*I; } VNInfo *getVNInfoAt(SlotIndex Idx) const { const_iterator I = FindSegmentContaining(Idx); return I == end() ? 0 : I->valno; } VNInfo *getVNInfoBefore(SlotIndex Idx) const { const_iterator I = FindSegmentContaining(Idx.getPrevSlot()); return I == end() ? 0 : I->valno; } iterator FindSegmentContaining(SlotIndex Idx) { iterator I = find(Idx); return I != end() && I->start <= Idx ? I : end(); } const_iterator FindSegmentContaining(SlotIndex Idx) const { const_iterator I = find(Idx); return I != end() && I->start <= Idx ? I : end(); } bool overlaps(const LiveRange &other) const { if (other.empty()) return false; return overlapsFrom(other, other.begin()); } bool overlaps(const LiveRange &Other, const CoalescerPair &CP, const SlotIndexes&) const; bool overlaps(SlotIndex Start, SlotIndex End) const; bool overlapsFrom(const LiveRange &Other, const_iterator I) const; iterator addSegment(Segment S) { return addSegmentFrom(S, segments.begin()); } VNInfo *extendInBlock(SlotIndex StartIdx, SlotIndex Kill); void join(LiveRange &Other, const int *ValNoAssignments, const int *RHSValNoAssignments, SmallVectorImpl<VNInfo *> &NewVNInfo); bool isLocal(SlotIndex Start, SlotIndex End) const { return beginIndex() > Start.getBaseIndex() && endIndex() < End.getBoundaryIndex(); } void removeSegment(SlotIndex Start, SlotIndex End, bool RemoveDeadValNo = false); void removeSegment(Segment S, bool RemoveDeadValNo = false) { removeSegment(S.start, S.end, RemoveDeadValNo); } LiveQueryResult Query(SlotIndex Idx) const { const_iterator I = find(Idx.getBaseIndex()); const_iterator E = end(); if (I == E) return LiveQueryResult(0, 0, SlotIndex(), false); VNInfo *EarlyVal = 0; VNInfo *LateVal = 0; SlotIndex EndPoint; bool Kill = false; if (I->start <= Idx.getBaseIndex()) { EarlyVal = I->valno; EndPoint = I->end; if (SlotIndex::isSameInstr(Idx, I->end)) { Kill = true; if (++I == E) return LiveQueryResult(EarlyVal, LateVal, EndPoint, Kill); } if (EarlyVal->def == Idx.getBaseIndex()) EarlyVal = 0; } if (!SlotIndex::isEarlierInstr(Idx, I->start) argument
[all...]
/freebsd-10-stable/contrib/llvm/tools/clang/lib/CodeGen/
H A DCGVTables.cpp666 const FunctionDecl *def = 0; local
/freebsd-10-stable/contrib/llvm/tools/lldb/source/Core/
H A DArchSpec.cpp294 const ArchDefinition *def = g_arch_definitions[i]; local
323 FindArchDefinitionEntry (const ArchDefinition *def, uint32_t cpu, uint32_t sub) argument
339 FindArchDefinitionEntry (const ArchDefinition *def, ArchSpec::Core core) argument
[all...]
/freebsd-10-stable/libexec/getty/
H A Dmain.c455 struct termios def; local
/freebsd-10-stable/libexec/rlogind/
H A Drlogind.c544 struct termios tt, def; local
/freebsd-10-stable/usr.bin/xlint/xlint/
H A Dxlint.c277 appdef(char ***lstp, const char *def) argument
/freebsd-10-stable/usr.sbin/boot0cfg/
H A Dboot0cfg.c85 int def; member in struct:__anon43
/freebsd-10-stable/crypto/openssh/
H A Dssh-pkcs11.c317 const RSA_METHOD *def = RSA_get_default_method(); local
H A Dkex.c217 kex_assemble_names(const char *def, char **list) argument
/freebsd-10-stable/sbin/pfctl/
H A Dpfctl_altq.c927 struct pf_altq *altq, *def = NULL; local
966 struct pf_altq *altq, *def = NULL; local
/freebsd-10-stable/usr.sbin/kbdcontrol/
H A Dkbdcontrol.c326 int i, def, scancode; local
/freebsd-10-stable/contrib/file/src/
H A Dsoftmagic.c121 file_fmtcheck(struct magic_set *ms, const struct magic *m, const char *def, argument
/freebsd-10-stable/contrib/tcsh/
H A Dsh.dir.c1360 recdirs(Char *fname, int def) argument
/freebsd-10-stable/libexec/rtld-elf/sparc64/
H A Dreloc.c334 const Elf_Sym *def; local
539 const Elf_Sym *def; local
[all...]
/freebsd-10-stable/usr.bin/rpcgen/
H A Drpc_main.c397 definition *def; local
499 definition *def; local
587 definition *def; local
673 definition *def; local
703 definition *def; local
725 definition *def; local
758 definition *def; local
[all...]

Completed in 393 milliseconds

1234567