/netbsd-current/sys/external/bsd/drm2/dist/drm/i915/display/ |
H A D | intel_frontbuffer.h | 60 void intel_frontbuffer_put(struct intel_frontbuffer *front); 65 struct intel_frontbuffer *front; local 72 front = rcu_dereference(obj->frontbuffer); 73 if (!front) 76 if (unlikely(!kref_get_unless_zero(&front->ref))) 79 if (likely(front == rcu_access_pointer(obj->frontbuffer))) 82 intel_frontbuffer_put(front); 86 return front; 92 void __intel_fb_invalidate(struct intel_frontbuffer *front, 98 * @front 107 intel_frontbuffer_invalidate(struct intel_frontbuffer *front, enum fb_op_origin origin) argument 135 intel_frontbuffer_flush(struct intel_frontbuffer *front, enum fb_op_origin origin) argument [all...] |
H A D | intel_frontbuffer.c | 168 void __intel_fb_invalidate(struct intel_frontbuffer *front, argument 172 struct drm_i915_private *i915 = to_i915(front->obj->base.dev); 187 void __intel_fb_flush(struct intel_frontbuffer *front, argument 191 struct drm_i915_private *i915 = to_i915(front->obj->base.dev); 207 struct intel_frontbuffer *front = local 208 container_of(ref, typeof(*front), write); 210 kref_get(&front->ref); 217 struct intel_frontbuffer *front = local 218 container_of(ref, typeof(*front), write); 220 intel_frontbuffer_flush(front, ORIGIN_C 227 struct intel_frontbuffer *front = variable in typeref:struct:intel_frontbuffer 249 struct intel_frontbuffer *front; local 280 intel_frontbuffer_put(struct intel_frontbuffer *front) argument [all...] |
/netbsd-current/usr.bin/spell/spellprog/ |
H A D | look.c | 58 look(u_char *string, u_char *front, u_char *back) argument 68 front = binary_search(string, front, back); 69 front = linear_search(string, front, back); 71 return (front != NULL); 75 * Binary search for "string" in memory between "front" and "back". 82 * front points to the beginning of a line at or before the first 89 * front = NULL; 94 * p = first newline after halfway point from front t 117 binary_search(u_char *string, u_char *front, u_char *back) argument 151 linear_search(u_char *string, u_char *front, u_char *back) argument [all...] |
/netbsd-current/usr.bin/look/ |
H A D | look.c | 101 char *back, *front, *string, *p; local 149 if ((front = mmap(NULL, len, 152 back = front + len; 153 exit(look(string, front, back)); 157 look(char *string, char *front, char *back) argument 173 front = binary_search(string, front, back); 174 front = linear_search(string, front, back); 176 if (front) 224 binary_search(char *string, char *front, char *back) argument 258 linear_search(char *string, char *front, char *back) argument 280 print_from(char *string, char *front, char *back) argument [all...] |
/netbsd-current/external/gpl3/gdb.old/dist/gdb/unittests/basic_string_view/element_access/char/ |
H A D | front_back.cc | 29 VERIFY( str.front() == 'r' ); 31 VERIFY( cstr.front() == 'm' );
|
/netbsd-current/external/gpl3/gdb.old/dist/gdb/unittests/basic_string_view/element_access/wchar_t/ |
H A D | front_back.cc | 30 VERIFY( str.front() == L'r' ); 32 VERIFY( cstr.front() == L'm' );
|
/netbsd-current/external/bsd/ntp/dist/ntpd/ |
H A D | ntp_prio_q.c | 43 my_queue->front = NULL; 61 while (my_queue->front != NULL) { 62 temp = my_queue->front; 63 my_queue->front = my_queue->front->node_next; 131 return (!my_queue || !my_queue->front); 140 if (NULL == q || NULL == q->front) 143 return q->front + 1; 158 node *j = my_queue->front; 167 new_node->node_next = my_queue->front; [all...] |
/netbsd-current/external/gpl3/gdb.old/dist/gdbsupport/ |
H A D | common-exceptions.cc | 58 return &catchers.front ().buf; 67 switch (catchers.front ().state) 74 catchers.front ().state = CATCHER_RUNNING; 86 catchers.front ().state = CATCHER_RUNNING_1; 89 catchers.front ().state = CATCHER_ABORTING; 102 catchers.front ().state = CATCHER_RUNNING; 105 catchers.front ().state = CATCHER_ABORTING; 133 *exception = std::move (catchers.front ().exception); 176 catchers.front ().exception = exception; 177 longjmp (catchers.front () [all...] |
/netbsd-current/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/ |
H A D | sanitizer_list_test.cc | 37 CHECK_EQ(l->front(), i1); 41 CHECK_EQ(l->front(), i2); 45 CHECK_EQ(l->front(), i3); 49 CHECK_EQ(l->front(), i4); 53 CHECK_EQ(l->front(), i5); 57 CHECK_EQ(l->front(), i6); 81 CHECK_EQ(l.front(), x); 89 CHECK_EQ(l.front(), x); 98 CHECK_EQ(l.front(), z); 104 CHECK_EQ(l.front(), [all...] |
/netbsd-current/external/gpl3/gdb/dist/gdbsupport/ |
H A D | common-exceptions.cc | 57 return &catchers.front ().buf; 66 switch (catchers.front ().state) 73 catchers.front ().state = CATCHER_RUNNING; 85 catchers.front ().state = CATCHER_RUNNING_1; 88 catchers.front ().state = CATCHER_ABORTING; 101 catchers.front ().state = CATCHER_RUNNING; 104 catchers.front ().state = CATCHER_ABORTING; 132 *exception = std::move (catchers.front ().exception); 175 catchers.front ().exception = exception; 176 longjmp (catchers.front () [all...] |
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/internal/test/ |
H A D | range.d | 19 @property int front() { return state; }
|
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/internal/test/ |
H A D | range.d | 19 @property int front() { return state; }
|
/netbsd-current/external/bsd/flex/dist/examples/manual/ |
H A D | Makefile.examples | 22 all: expr front myname eof wc replace user_act string1\ 30 front: front.y front.lex 31 $(YACC) front.y 32 $(LEX) front.lex 33 $(CC) -o front lex.yy.c y.tab.c $(ALLOCA) -ll -lm 87 rm -f replace front user_act string1 string2
|
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/libdruntime/rt/util/ |
H A D | random.d | 32 auto result = front; 37 @property uint front()
|
/netbsd-current/external/bsd/openresolv/dist/ |
H A D | dnsmasq.in | 97 SIFS=${IFS-y} OIFS=$IFS bytes= front= back= 117 front="$front byte:$byte1 byte:$byte2" 122 front="$front byte:0 byte:0" 124 front="${front}$back" 130 dbusdest="${dbusdest}$front string:$dn"
|
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/regex/internal/ |
H A D | parser.d | 73 assert(nc.front == "named"); 233 put(Bytecode(IR.Char, set.byCodepoint.front)); 538 dchar front; 550 front = ' ';//a safe default for freeform parsing 572 front = pat.front; 579 while (!empty && isWhite(front)) _popFront(); 594 while (std.ascii.isDigit(front)) 598 r = 10*r + cast(uint)(front-'0'); 638 switch (front) [all...] |
/netbsd-current/usr.sbin/altq/libaltq/ |
H A D | qop.c | 1038 struct fltrinfo *fp, *front, *back, *prev = NULL; local 1043 front = fp; 1047 front = fltrinfo; 1051 relation = filt_check_relation(&front->fltr, &back->fltr); 1059 if (front->dontwarn == 0 && back->dontwarn == 0) 1062 front->clinfo->clname, front->line_no, 1075 if (front->clinfo == back->clinfo) 1077 if (front->dontwarn == 0 && back->dontwarn == 0) 1080 front 1101 filt_check_relation(struct flow_filter *front, struct flow_filter *back) argument 1124 filt_disjoint(struct flow_filter *front, struct flow_filter *back) argument 1238 filt_subset(struct flow_filter *front, struct flow_filter *back) argument [all...] |
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/format/internal/ |
H A D | read.d | 29 import std.range.primitives : empty, front, popFront; 35 if (input.front == '+' || input.front == '-') input.popFront(); 38 while (!input.empty && isDigit(input.front)) input.popFront(); 151 import std.range.primitives : empty, front, popFront; 156 auto result = to!T(input.front); 179 import std.range.primitives : empty, front, popFront, put; 207 app.put(input.front); 212 immutable end = fmt.trailing.front; 213 for (; !input.empty && input.front ! [all...] |
/netbsd-current/external/apache2/llvm/dist/clang/lib/Driver/ |
H A D | Tool.cpp | 26 ConstructJob(C, JA, Outputs.front(), Inputs, TCArgs, LinkingOutput);
|
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
H A D | LoopNestAnalysis.h | 72 Loop &getOutermostLoop() const { return *Loops.front(); } 126 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; 146 return Loops.front()->getHeader()->getParent(); 149 StringRef getName() const { return Loops.front()->getName(); }
|
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/algorithm/ |
H A D | setops.d | 272 @property auto front() { return impl.front; } 315 @property auto front() { return impl.front; } 387 @property auto front() 391 return mixin(algoFormat("tuple(%(current[%d].front%|,%))", 543 auto front1 = C.front; 546 assert(D.front == front1); 566 int front() @system @property inout 884 return comp(b.front, [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/ |
H A D | setops.d | 274 @property auto front() { return impl.front; } 317 @property auto front() { return impl.front; } 389 @property auto front() 393 return mixin(algoFormat("tuple(%(current[%d].front%|,%))", 543 auto front1 = C.front; 546 assert(D.front == front1); 847 return comp(b.front, a.front); [all...] |
H A D | iteration.d | 10 Eagerly evaluates and caches another range's $(D front).) 120 $(D cache) eagerly evaluates $(D front) of $(D range) 123 The result is then directly returned when $(D front) is called, 207 Tip: $(D cache) is eager when evaluating elements. If calling front on the 209 front on the actual cached _range. 214 If calling front has no side effect though, placing $(D take) after $(D cache) 282 assert(strings.front is strings.front); 301 bool front() @property {return initialized = true;} 342 caches[0] = source.front; [all...] |
/netbsd-current/external/apache2/llvm/dist/clang/lib/Basic/Targets/ |
H A D | AMDGPU.h | 168 if (S.front() == '{') { 174 if (S.front() != 'v' && S.front() != 's' && S.front() != 'a') { 198 if (!S.empty() && S.front() == '[') { 205 if (!S.empty() && S.front() == ':') { 214 if (S.empty() || S.front() != ']') 218 if (S.empty() || S.front() != '}') 412 assert(F.front() == '+' || F.front() [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/container/ |
H A D | binaryheap.d | 45 accessing the largest element (by using the $(D front) property) is a 130 store.front = move(t2); 246 @property ElementType!Store front() 248 enforce(!empty, "Cannot call front on an empty heap."); 249 return _store.front; 321 _store.front = move(t2); 350 _store.front = value; 357 returns $(D true). Otherwise, if $(D less(value, front)), calls $(D 372 assert(!_store.empty, "Cannot replace front of an empty heap."); 373 if (!comp(value, _store.front)) retur [all...] |