/freebsd-10.0-release/contrib/llvm/lib/Target/R600/ |
H A D | R600EmitClauseMarkers.cpp | 163 switch(UsedKCache[i].first) { 165 MI->getOperand(Consts[i].first).setReg( 169 MI->getOperand(Consts[i].first).setReg( 211 .addImm(KCacheBanks.empty()?0:KCacheBanks[0].first) // KB0 212 .addImm((KCacheBanks.size() < 2)?0:KCacheBanks[1].first) // KB1
|
/freebsd-10.0-release/contrib/llvm/tools/lldb/source/Target/ |
H A D | SectionLoadList.cpp | 229 if (load_addr != pos->first && pos != m_addr_to_sect.begin()) 231 const addr_t pos_load_addr = pos->first; 248 if (load_addr >= rpos->first) 250 addr_t offset = load_addr - rpos->first; 271 s.Printf("addr = 0x%16.16" PRIx64 ", section = %p: ", pos->first, pos->second.get());
|
/freebsd-10.0-release/usr.sbin/pkg/ |
H A D | dns_utils.c | 82 compute_weight(struct dns_srvinfo **d, int first, int last) argument 87 chosen = malloc(sizeof(int) * (last - first + 1)); 116 struct dns_srvinfo **res, *first; local 217 first = res[0]; 220 return (first);
|
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | LegalizeTypes.cpp | 373 // Otherwise, this node is new: this is the first operand of it that 483 // This is the first operand to change - add all operands so far. 539 /// Expunge when a new node is first seen, since it may no longer be marked 558 assert(I->first.getNode() != N); 564 assert(I->first.getNode() != N); 570 assert(I->first.getNode() != N); 576 assert(I->first.getNode() != N); 582 assert(I->first.getNode() != N); 583 RemapValue(I->second.first); 589 assert(I->first [all...] |
/freebsd-10.0-release/contrib/binutils/ld/ |
H A D | ldemul.c | 271 bfd_boolean first = TRUE; local 275 if (first) 276 first = FALSE;
|
/freebsd-10.0-release/contrib/llvm/include/llvm/ADT/ |
H A D | DenseMapInfo.h | 148 uint64_t key = (uint64_t)FirstInfo::getHashValue(PairVal.first) << 32 161 return FirstInfo::isEqual(LHS.first, RHS.first) &&
|
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | DominanceFrontier.h | 68 return Frontiers.insert(std::make_pair(BB, frontier)).first; 121 tmpFrontiers.insert(std::make_pair(I->first, I->second)); 125 BasicBlock *Node = I->first;
|
/freebsd-10.0-release/contrib/llvm/tools/llvm-objdump/ |
H A D | MCFunction.cpp | 124 BB.addSucc(i->first); 129 BB.addSucc(llvm::next(i)->first); 133 BB.addSucc(llvm::next(i)->first);
|
/freebsd-10.0-release/contrib/ncurses/ncurses/base/ |
H A D | lib_getstr.c | 51 WipeOut(WINDOW *win, int y, int x, char *first, char *last, bool echoed) argument 53 if (last > first) { 60 waddstr(win, first);
|
/freebsd-10.0-release/crypto/openssl/crypto/asn1/ |
H A D | f_int.c | 109 int num=0,slen=0,first=1; local 149 if (first) 151 first=0;
|
/freebsd-10.0-release/release/picobsd/tinyware/passwd/ |
H A D | pw_util.c | 235 int c, first; local 239 first = c = getchar(); 242 if (first == 'n')
|
/freebsd-10.0-release/sys/dev/drm/ |
H A D | drm_hashtab.c | 126 unsigned long first, unshifted_key = 0; local 129 first = unshifted_key; 135 } while(ret && (unshifted_key != first));
|
/freebsd-10.0-release/sys/dev/drm2/ |
H A D | drm_hashtab.c | 126 unsigned long first, unshifted_key = 0; local 129 first = unshifted_key; 135 } while(ret && (unshifted_key != first));
|
/freebsd-10.0-release/sys/ia64/ia64/ |
H A D | clock.c | 108 ia64_clock_start(struct eventtimer *et, sbintime_t first, sbintime_t period) argument 123 if (first != 0) 124 load = (et->et_frequency * first) >> 32;
|
/freebsd-10.0-release/usr.bin/netstat/ |
H A D | netgraph.c | 61 static int first = 1; variable 124 /* Get pointer to first socket */ 151 if (first) { 158 first = 0;
|
/freebsd-10.0-release/bin/sh/ |
H A D | histedit.c | 193 int first, last, direction; local 277 * determine [first] and [last] 293 first = str_to_event(firststr, 0); 298 last = first; 299 first = i; 306 direction = first < last ? H_PREV : H_NEXT; 333 retval = history(hist, &he, H_NEXT_EVENT, first); 453 * the notion of first and last is
|
H A D | show.c | 125 int first; local 129 first = 1; 131 if (! first) 134 first = 0; 137 if (! first) 166 first = 0;
|
/freebsd-10.0-release/cddl/contrib/opensolaris/lib/libzfs/common/ |
H A D | libzfs_iter.c | 398 boolean_t first; member in struct:iter_dependents_arg 410 boolean_t first = ida->first; local 411 ida->first = B_FALSE; 456 if (!first && err == 0) 473 ida.first = B_TRUE;
|
/freebsd-10.0-release/contrib/llvm/lib/Support/ |
H A D | Timer.cpp | 35 // this by creating the string the first time it is needed and never destroying 205 delete I->second.first; 213 if (!GroupEntry.first) 214 GroupEntry.first = new TimerGroup(GroupName); 218 T.init(Name, *GroupEntry.first); 320 Total += TimersToPrint[i].first; 352 Entry.first.print(Total, OS);
|
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | SimplifyIndVar.cpp | 280 // self edges first. 338 if (UseOper.first == CurrIV) continue; 344 Value *NewOper = foldIVUser(UseOper.first, IVOperand); 352 if (eliminateIVUser(UseOper.first, IVOperand)) { 356 CastInst *Cast = dyn_cast<CastInst>(UseOper.first); 361 if (isSimpleIVUser(UseOper.first, L, SE)) { 362 pushIVUsers(UseOper.first, Simplified, SimpleIVUsers);
|
/freebsd-10.0-release/contrib/llvm/tools/lldb/source/Interpreter/ |
H A D | OptionValueDictionary.cpp | 51 strm.Indent(pos->first.GetCString()); 93 strm.Printf("%s=", pos->first.GetCString()); 122 llvm::StringRef key = kvp.first; 160 error.SetErrorStringWithFormat("invalid key \"%s\", the key must be a bare string or surrounded by brackets with optional quotes: [<key>] or ['<key>'] or [\"<key>\"]", kvp.first.str().c_str()); 431 strm.Printf("%s=", pos->first.GetCString()); 432 copied_dict->SetValueForKey (pos->first, pos->second->DeepCopy(), true);
|
/freebsd-10.0-release/usr.bin/calendar/calendars/ |
H A D | calendar.computer | 14 01/08 Herman Hollerith patents first data processing computer, 1889 43 05/22 Ethernet first described, 1973 64 09/20 Harlan Herrick runs first FORTRAN program, 1954
|
/freebsd-10.0-release/contrib/apr-util/include/ |
H A D | apr_xml.h | 65 /** The first piece of text in the list */ 66 apr_text *first; member in struct:apr_text_header 99 ** their first three characters are reserved by the XML Namespaces 123 ** For the first case, this means the original prefix/name will be 179 /** first child element */ 181 /** first attribute */ 197 (e)->first_cdata.first == NULL)
|
/freebsd-10.0-release/contrib/gcc/ |
H A D | bitmap.h | 73 bitmap_element *first; /* First element in linked list. */ local 97 /* True if the complement of the second intersects the first (their 102 #define bitmap_empty_p(MAP) (!(MAP)->first) 108 versions that modify the first source operand. The other variants 154 head->first = head->current = NULL; 200 /* Initialize a single bitmap iterator. START_BIT is the first bit to 207 bi->elt1 = map->first; 234 first bit, otherwise our incrementing to the next word boundary 249 bi->elt1 = map1->first; 250 bi->elt2 = map2->first; [all...] |
/freebsd-10.0-release/contrib/libstdc++/include/tr1/ |
H A D | tuple_iterate.h | 67 _M_arg1(__u.first), _M_arg2(__u.second) 74 _M_arg1 = __u.first;
|