HomeSort by: relevance | last modified time | path
    Searched defs:back (Results 1 - 25 of 130) sorted by relevancy

1 2 3 4 5 6

  /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
  /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]);
  /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
  /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();
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
AllocatorList.h 175 T &back() { return List.back().V; } function in class:llvm::AllocatorList
177 const T &back() const { return List.back().V; } function in class:llvm::AllocatorList
ArrayRef.h 171 /// back - Get the last element.
172 const T &back() const { function in class:llvm::ArrayRef
366 /// back - Get the last element.
367 T &back() const { function in class:llvm::ArrayRef
DirectedGraph.h 109 const EdgeType &back() const { return *Edges.back(); } function in class:llvm::DGNode
110 EdgeType &back() { return *Edges.back(); } function in class:llvm::DGNode
200 const NodeType &back() const { return *Nodes.back(); } function in class:DirectedGraph
201 NodeType &back() { return *Nodes.back(); } function in class:DirectedGraph
MapVector.h 85 std::pair<KeyT, ValueT> &back() { return Vector.back(); } function in class:llvm::MapVector
86 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } function in class:llvm::MapVector
161 typename MapType::iterator Pos = Map.find(Vector.back().first);
TinyPtrVector.h 237 EltTy back() const { function in class:llvm::TinyPtrVector
241 return Val.template get<VecTy*>()->back();
292 // benefit to collapsing back to a pointer
simple_ilist.h 140 reference back() { return *rbegin(); } function in class:llvm::simple_ilist
141 const_reference back() const { return *rbegin(); } function in class:llvm::simple_ilist
146 /// Insert a node at the back; never copies.
152 /// Remove the node at the back; never deletes.
306 // Sort the sublists and merge back together.
  /src/external/bsd/unbound/dist/libunbound/
libworker.h 86 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
  /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...]
  /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
  /src/lib/libform/
internals.h 75 struct _formi_tab_stops *back; member in struct:_formi_tab_stops
  /src/sys/ufs/ffs/
ffs_subr.c 290 int i, start, end, forw, back, map; local
348 back = start - i;
351 * back clusters.
353 i = back + forw + 1;
357 if (back > 0)
358 ufs_add32(sump[back], -cnt, needswap);
  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Support/
BumpVector.h 124 reference back() { function in class:clang::BumpVector
127 const_reference back() const { function in class:clang::BumpVector
137 T Result = back();
247 // For now, leak 'Begin'. We can add it back to a freelist in

Completed in 41 milliseconds

1 2 3 4 5 6