| /src/sys/arch/i386/stand/lib/ |
| biosmca.S | 91 jc back
97 jnz back
103 back: label
104 calll _C_LABEL(real_to_prot) # back to protected mode
|
| biosmca.S | 91 jc back
97 jnz back
103 back: label
104 calll _C_LABEL(real_to_prot) # back to protected mode
|
| /src/tests/lib/libc/locale/ |
| t_mbtowc.c | 178 char back[MB_LEN_MAX]; local
190 ret = wctomb(back, wc);
193 printf("%02X ",(unsigned char)back[i]);
|
| t_mbtowc.c | 178 char back[MB_LEN_MAX]; local
190 ret = wctomb(back, wc);
193 printf("%02X ",(unsigned char)back[i]);
|
| /src/external/apache2/llvm/dist/clang/include/clang/Serialization/ |
| ContinuousRangeMap.h | 67 if (!Rep.empty() && Rep.back() == Val)
70 assert((Rep.empty() || Rep.back().first < Val.first) &&
106 reference back() { return Rep.back(); } function in class:clang::ContinuousRangeMap
107 const_reference back() const { return Rep.back(); } function in class:clang::ContinuousRangeMap
|
| ContinuousRangeMap.h | 67 if (!Rep.empty() && Rep.back() == Val)
70 assert((Rep.empty() || Rep.back().first < Val.first) &&
106 reference back() { return Rep.back(); } function in class:clang::ContinuousRangeMap
107 const_reference back() const { return Rep.back(); } function in class:clang::ContinuousRangeMap
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| SetVector.h | 128 const T &back() const { function in class:llvm::SetVector
129 assert(!empty() && "Cannot call back() on empty SetVector!");
130 return vector_.back();
228 set_.erase(back());
233 T Ret = back();
|
| SetVector.h | 128 const T &back() const { function in class:llvm::SetVector
129 assert(!empty() && "Cannot call back() on empty SetVector!");
130 return vector_.back();
228 set_.erase(back());
233 T Ret = back();
|
| PriorityWorklist.h | 84 const T &back() const { function in class:llvm::PriorityWorklist
85 assert(!empty() && "Cannot call back() on empty PriorityWorklist!");
86 return V.back();
103 // If the element isn't at the back, null it out and append a fresh one.
147 assert(back() != T() && "Cannot have a null element at the back!");
148 M.erase(back());
151 } while (!V.empty() && V.back() == T());
155 T Ret = back();
172 } while (!V.empty() && V.back() == T())
[all...] |
| StringRef.h | 165 /// back - Get the last character in the string.
167 char back() const { function in class:llvm::StringRef
|
| PriorityWorklist.h | 84 const T &back() const { function in class:llvm::PriorityWorklist
85 assert(!empty() && "Cannot call back() on empty PriorityWorklist!");
86 return V.back();
103 // If the element isn't at the back, null it out and append a fresh one.
147 assert(back() != T() && "Cannot have a null element at the back!");
148 M.erase(back());
151 } while (!V.empty() && V.back() == T());
155 T Ret = back();
172 } while (!V.empty() && V.back() == T())
[all...] |
| StringRef.h | 165 /// back - Get the last character in the string.
167 char back() const { function in class:llvm::StringRef
|
| /src/external/bsd/unbound/dist/libunbound/ |
| libworker.h | 87 struct outside_network* back; member in struct:libworker
|
| libworker.h | 87 struct outside_network* back; member in struct:libworker
|
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_list.h | 86 Item *back() { return last_; } function in struct:__sanitizer::IntrusiveList
87 const Item *back() const { return last_; } function in struct:__sanitizer::IntrusiveList
|
| sanitizer_list.h | 86 Item *back() { return last_; } function in struct:__sanitizer::IntrusiveList
87 const Item *back() const { return last_; } function in struct:__sanitizer::IntrusiveList
|
| /src/usr.bin/look/ |
| look.c | 101 char *back, *front, *string, *p; local
152 back = front + len;
153 exit(look(string, front, back));
157 look(char *string, char *front, char *back)
173 front = binary_search(string, front, back);
174 front = linear_search(string, front, back);
177 print_from(string, front, back);
183 * Binary search for "string" in memory between "front" and "back".
193 * back points to the beginning of a line at or after the first
198 * back = EOF
[all...] |
| look.c | 101 char *back, *front, *string, *p; local
152 back = front + len;
153 exit(look(string, front, back));
157 look(char *string, char *front, char *back)
173 front = binary_search(string, front, back);
174 front = linear_search(string, front, back);
177 print_from(string, front, back);
183 * Binary search for "string" in memory between "front" and "back".
193 * back points to the beginning of a line at or after the first
198 * back = EOF
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Demangle/ |
| StringView.h | 72 char back() const { function in class:StringView
|
| /src/external/bsd/less/dist/ |
| forwback.c | 401 public void back(int n, POSITION pos, int force, int only_last) function
482 * Back up until there is a line at the bottom
491 back(1, position(TOP), 1, 0);
518 back(n, pos, force, only_last);
|
| /src/external/gpl3/gcc/dist/libcody/ |
| buffer.cc | 236 Assert (buffer.back () == S2C(u8"\n"));
269 word = &result.back ();
284 auto back = iter; local
285 if (back[-1] == CONTINUE && back[-2] == S2C(u8" "))
287 back -= 2;
289 back - buffer.begin () - lastBol);
|
| /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| sanitizer_list.h | 85 Item *back() { return last_; } function in struct:__sanitizer::IntrusiveList
86 const Item *back() const { return last_; } function in struct:__sanitizer::IntrusiveList
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| iterator-utils.h | 125 T back () const { return static_cast<T> (BaseCT::back ()); } function in class:const_derived_container
|
| /src/external/gpl3/gcc.old/dist/libcody/ |
| buffer.cc | 236 Assert (buffer.back () == S2C(u8"\n"));
269 word = &result.back ();
284 auto back = iter; local
285 if (back[-1] == CONTINUE && back[-2] == S2C(u8" "))
287 back -= 2;
289 back - buffer.begin () - lastBol);
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| sanitizer_list.h | 85 Item *back() { return last_; } function in struct:__sanitizer::IntrusiveList
86 const Item *back() const { return last_; } function in struct:__sanitizer::IntrusiveList
|
