/macosx-10.10.1/llvmCore-3425.0.34/lib/DebugInfo/ |
H A D | DWARFDebugRangeList.cpp | 19 Entries.clear(); 42 Entries.push_back(entry); 48 for (int i = 0, n = Entries.size(); i != n; ++i) { 52 OS << format(format_str, Offset, Entries[i].StartAddress, 53 Entries[i].EndAddress); 60 for (int i = 0, n = Entries.size(); i != n; ++i) { 61 if (Entries[i].isBaseAddressSelectionEntry(AddressSize)) 62 BaseAddress = Entries[i].EndAddress; 63 else if (Entries[i].containsAddress(BaseAddress, Address))
|
H A D | DWARFDebugRangeList.h | 63 std::vector<RangeListEntry> Entries; member in class:llvm::DWARFDebugRangeList
|
/macosx-10.10.1/llvmCore-3425.0.34/utils/TableGen/ |
H A D | SequenceToOffsetTable.h | 55 // Entries in the final table, or 0 before layout was called. 56 unsigned Entries; member in class:llvm::SequenceToOffsetTable 64 SequenceToOffsetTable() : Entries(0) {} 69 assert(Entries == 0 && "Cannot call add() after layout()"); 88 assert(Entries == 0 && "Can only call layout() once"); 92 I->second = Entries; 94 Entries += I->first.size() + 1; 100 assert(Entries && "Call layout() before get()"); 112 assert(Entries && "Call layout() before emit()");
|
H A D | EDEmitter.cpp | 43 std::vector<std::string> Entries; member in class:__anon10618::EnumEmitter 48 Entries.push_back(std::string(e)); 49 return Entries.size() - 1; 56 unsigned int numEntries = Entries.size(); 58 o.indent(i) << Entries[index]; 73 unsigned int numEntries = Entries.size(); 76 o.indent(i) << Entries[index] << " = " << format("0x%x", flag); 131 std::vector<ConstantEmitter *> Entries; member in class:__anon10622::CompoundConstantEmitter 136 Entries.push_back(e); 141 while (Entries [all...] |
H A D | DAGISelMatcherOpt.cpp | 480 Matcher *Entries[2] = { PrevMatcher, MatcherWithoutCTM }; local 481 Cases[Entry-1].second = new ScopeMatcher(Entries, 2);
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/Transforms/Instrumentation/ |
H A D | BlackList.h | 50 StringMap<Regex*> Entries; member in class:llvm::BlackList
|
H A D | BlackList.cpp | 76 Entries[I->getKey()] = new Regex(I->getValue()); 98 Regex *FunctionRegex = Entries[Section];
|
/macosx-10.10.1/OpenLDAP-499.27/OpenLDAP/tests/scripts/ |
H A D | monitor_data.sh | 43 cn=Entries,cn=Statistics,cn=Monitor
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/ |
H A D | InterferenceCache.cpp | 35 Entries[i].clear(mf, indexes, lis); 40 if (E < CacheEntries && Entries[E].getPhysReg() == PhysReg) { 41 if (!Entries[E].valid(LIUArray, TRI)) 42 Entries[E].revalidate(LIUArray, TRI); 43 return &Entries[E]; 51 if (Entries[E].hasRefs()) { 56 Entries[E].reset(PhysReg, LIUArray, TRI, MF); 58 return &Entries[E];
|
H A D | InterferenceCache.h | 144 Entry Entries[CacheEntries]; member in class:llvm::InterferenceCache
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/AsmPrinter/ |
H A D | DwarfAccelTable.cpp | 43 Entries(Allocator) { } 51 DataArray &DIEs = Entries[Name]; 82 EI = Entries.begin(), EE = Entries.end(); EI != EE; ++EI) { 241 O << "Entries: \n"; 243 EI = Entries.begin(), EE = Entries.end(); EI != EE; ++EI) {
|
H A D | DwarfAccelTable.h | 261 StringEntries Entries; member in class:llvm::DwarfAccelTable
|
H A D | DwarfDebug.cpp | 2014 StringMapEntry<std::pair<MCSymbol*, unsigned> >*>, 64> Entries; local 2018 Entries.push_back(std::make_pair(I->second.second, &*I)); 2020 array_pod_sort(Entries.begin(), Entries.end()); 2022 for (unsigned i = 0, e = Entries.size(); i != e; ++i) { 2024 Asm->OutStreamer.EmitLabel(Entries[i].second->getValue().first); 2027 Asm->OutStreamer.EmitBytes(StringRef(Entries[i].second->getKeyData(), 2028 Entries[i].second->getKeyLength()+1), 2174 /// Entries (one "entry" for each function that was inlined):
|
/macosx-10.10.1/emacs-93/emacs/lisp/net/ |
H A D | netrc.el | 100 Entries without port tokens default to DEFAULTPORT."
|
/macosx-10.10.1/smb-759.0/lib/librpc/ |
H A D | LsarLookup.cpp | 213 if ((TranslatedSids.Entries == 0) || 220 if (ReferencedDomains && ReferencedDomains->Entries && ReferencedDomains->Domains) {
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/MC/ |
H A D | MCDwarf.cpp | 650 const std::vector<const MCGenDwarfLabelEntry *> &Entries = local 653 Entries.begin(), ie = Entries.end(); it != ie; 687 Entries.begin(), ie = Entries.end(); it != ie;
|
/macosx-10.10.1/tcl-105/tk/tk/library/demos/ |
H A D | widget | 336 @@subtitle Entries, Spin-boxes and Combo-boxes 337 @@demo entry1 Entries without scrollbars 338 @@demo entry2 Entries with scrollbars
|
/macosx-10.10.1/Security-57031.1.35/Security/include/security_codesigning/ |
H A D | syspolicy.sql | 155 -- for individual objects (by object hash). Entries come from
|
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_codesigning/lib/ |
H A D | syspolicy.sql | 155 -- for individual objects (by object hash). Entries come from
|
/macosx-10.10.1/tcl-105/tcl_ext/expect/expect/example/ |
H A D | virterm | 443 if {![regsub { Entries Found *} $countstr "" number]} {
|
/macosx-10.10.1/zsh-61/zsh/Misc/ |
H A D | compctl-examples | 565 if [[ -f ${pref}CVS/Entries ]]; then 566 reply=( "${pref}${(@)^${(@)${(@)${(f@)$(<${pref}CVS/Entries)}:#D*}#/}%%/*}" )
|
/macosx-10.10.1/bash-94.1.2/bash-3.2/support/ |
H A D | texi2html | 4034 my $Entries = GetIndexEntries($index_properties->{$prefix}->{from}, 4036 return unless %$Entries; 4045 for $key (sort keys %$Entries) 4047 print FHIDX "$key\t$Entries->{$key}->{href}\n"; 4051 my $Pages = GetIndexPages($Entries);
|
/macosx-10.10.1/CPANInternal-159.1/Log-Log4perl-1.40/lib/Log/Log4perl/ |
H A D | Appender.pm | 414 submit a list of key/value pairs. Entries to the following keys are
|
/macosx-10.10.1/ksh-23/ksh/src/lib/libast/misc/ |
H A D | magic.tab | 1657 |name match *.reg Registration Entries application/x-ms-regfile
|
/macosx-10.10.1/emacs-93/emacs/lisp/textmodes/ |
H A D | bibtex.el | 97 Entries should be of the same form as the OPTIONAL and 1043 ["Validate Entries" bibtex-validate t] 1044 ["Sort Entries" bibtex-sort-buffer t] 1045 ["Reformat Entries" bibtex-reformat t] 1046 ["Count Entries" bibtex-count-entries t] 1050 ["Validate Entries" bibtex-validate-globally t]))) 3498 "Entries out of order") 4105 ;; Entries are separated by one blank line.
|