Home
last modified time | relevance | path

Searched refs:front (Results 1 – 25 of 1683) sorted by relevance

12345678910>>...68

/netbsd-src/usr.bin/look/
H A Dlook.c101 char *back, *front, *string, *p; in main() local
149 if ((front = mmap(NULL, len, in main()
152 back = front + len; in main()
153 exit(look(string, front, back)); in main()
157 look(char *string, char *front, char *back) in look() argument
173 front = binary_search(string, front, back); in look()
174 front = linear_search(string, front, back); in look()
176 if (front) in look()
177 print_from(string, front, back); in look()
178 return (front ? 0 : 1); in look()
[all …]
/netbsd-src/sys/external/bsd/drm2/dist/drm/i915/display/
H A Dintel_frontbuffer.c168 void __intel_fb_invalidate(struct intel_frontbuffer *front, in __intel_fb_invalidate() argument
172 struct drm_i915_private *i915 = to_i915(front->obj->base.dev); in __intel_fb_invalidate()
187 void __intel_fb_flush(struct intel_frontbuffer *front, in __intel_fb_flush() argument
191 struct drm_i915_private *i915 = to_i915(front->obj->base.dev); in __intel_fb_flush()
207 struct intel_frontbuffer *front = in frontbuffer_active() local
208 container_of(ref, typeof(*front), write); in frontbuffer_active()
210 kref_get(&front->ref); in frontbuffer_active()
217 struct intel_frontbuffer *front = in frontbuffer_retire() local
218 container_of(ref, typeof(*front), write); in frontbuffer_retire()
220 intel_frontbuffer_flush(front, ORIGIN_CS); in frontbuffer_retire()
[all …]
H A Dintel_frontbuffer.h60 void intel_frontbuffer_put(struct intel_frontbuffer *front);
65 struct intel_frontbuffer *front; in __intel_frontbuffer_get() local
72 front = rcu_dereference(obj->frontbuffer); in __intel_frontbuffer_get()
73 if (!front) in __intel_frontbuffer_get()
76 if (unlikely(!kref_get_unless_zero(&front->ref))) in __intel_frontbuffer_get()
79 if (likely(front == rcu_access_pointer(obj->frontbuffer))) in __intel_frontbuffer_get()
82 intel_frontbuffer_put(front); in __intel_frontbuffer_get()
86 return front; in __intel_frontbuffer_get()
92 void __intel_fb_invalidate(struct intel_frontbuffer *front,
107 static inline bool intel_frontbuffer_invalidate(struct intel_frontbuffer *front, in intel_frontbuffer_invalidate() argument
[all …]
/netbsd-src/usr.bin/spell/spellprog/
H A Dlook.c58 look(u_char *string, u_char *front, u_char *back) in look() argument
68 front = binary_search(string, front, back); in look()
69 front = linear_search(string, front, back); in look()
71 return (front != NULL); in look()
117 binary_search(u_char *string, u_char *front, u_char *back) in binary_search() argument
121 p = front + (back - front) / 2; in binary_search()
128 while (p < back && back > front) { in binary_search()
130 front = p; in binary_search()
133 p = front + (back - front) / 2; in binary_search()
136 return (front); in binary_search()
[all …]
/netbsd-src/external/bsd/ntp/dist/ntpd/
H A Dntp_prio_q.c43 my_queue->front = NULL; in debug_create_priority_queue()
61 while (my_queue->front != NULL) { in destroy_queue()
62 temp = my_queue->front; in destroy_queue()
63 my_queue->front = my_queue->front->node_next; in destroy_queue()
131 return (!my_queue || !my_queue->front); in empty()
140 if (NULL == q || NULL == q->front) in queue_head()
143 return q->front + 1; in queue_head()
158 node *j = my_queue->front; in enqueue()
167 new_node->node_next = my_queue->front; in enqueue()
168 my_queue->front = new_node; in enqueue()
[all …]
/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
H A Dsanitizer_list_test.cc37 CHECK_EQ(l->front(), i1); in CheckList()
41 CHECK_EQ(l->front(), i2); in CheckList()
45 CHECK_EQ(l->front(), i3); in CheckList()
49 CHECK_EQ(l->front(), i4); in CheckList()
53 CHECK_EQ(l->front(), i5); in CheckList()
57 CHECK_EQ(l->front(), i6); in CheckList()
81 CHECK_EQ(l.front(), x); in TEST()
89 CHECK_EQ(l.front(), x); in TEST()
98 CHECK_EQ(l.front(), z); in TEST()
104 CHECK_EQ(l.front(), y); in TEST()
[all …]
/netbsd-src/usr.sbin/altq/libaltq/
H A Dqop.c1038 struct fltrinfo *fp, *front, *back, *prev = NULL; in add_filter_rule() local
1043 front = fp; in add_filter_rule()
1047 front = fltrinfo; in add_filter_rule()
1051 relation = filt_check_relation(&front->fltr, &back->fltr); in add_filter_rule()
1059 if (front->dontwarn == 0 && back->dontwarn == 0) in add_filter_rule()
1062 front->clinfo->clname, front->line_no, in add_filter_rule()
1075 if (front->clinfo == back->clinfo) in add_filter_rule()
1077 if (front->dontwarn == 0 && back->dontwarn == 0) in add_filter_rule()
1080 front in add_filter_rule()
1101 filt_check_relation(struct flow_filter * front,struct flow_filter * back) filt_check_relation() argument
1124 filt_disjoint(struct flow_filter * front,struct flow_filter * back) filt_disjoint() argument
1238 filt_subset(struct flow_filter * front,struct flow_filter * back) filt_subset() argument
[all...]
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
H A Diteration.d120 $(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;} in front() function
342 caches[0] = source.front; in _Cache()
361 E front() @property in _Cache()
377 caches[0] = source.front; in _Cache()
[all …]
H A Dsetops.d274 @property auto front() { return impl.front; } in FwdRangeWrapper()
317 @property auto front() { return impl.front; } in InpRangeWrapper()
389 @property auto front() in front() function
543 auto front1 = C.front;
546 assert(D.front == front1);
847 return comp(b.front, a.front); in MultiwayMerge()
867 @property auto ref front() in MultiwayMerge()
869 return _heap.front.front; in MultiwayMerge()
1017 if (r2.empty || comp(r1.front, r2.front)) break; in adjustPosition()
1018 if (comp(r2.front, r1.front)) in adjustPosition()
[all …]
H A Dsearching.d126 if (isInputRange!Range && is(typeof(unaryFun!pred(range.front))))
173 if (isInputRange!Range && is(typeof(unaryFun!pred(range.front))))
233 if (isInputRange!(Range) && is(typeof(r.front == lPar)))
238 if (r.front == lPar)
243 else if (r.front == rPar)
430 is(typeof(binaryFun!pred(r1.front, r2.front))))
453 !r1.empty && !r2.empty && binaryFun!pred(r1.front, r2.front);
469 is(typeof(binaryFun!pred(r1.front, r2.front))))
480 if (!binaryFun!pred(f, r2.front))
490 is(typeof(r1.front == r2.front)))
[all …]
H A Dmutation.d123 size_t bringToFront(InputRange, ForwardRange)(InputRange front, ForwardRange back)
130 auto frontW = representation(front);
134 alias frontW = front;
148 private size_t bringToFrontImpl(InputRange, ForwardRange)(InputRange front, ForwardRange back)
153 enum bool sameHeadExists = is(typeof(front.sameHead(back)));
156 for (bool semidone; !front.empty && !back.empty; )
160 if (front.sameHead(back)) break; // shortcut
170 if (front.sameHead(back0)) back0 = back.save;
172 swapFront(front, back);
174 front.popFront();
[all …]
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/regex/internal/
H A Dparser.d73 assert(nc.front == "named");
233 put(Bytecode(IR.Char, set.byCodepoint.front)); in charsetToIr()
538 dchar front; variable
550 front = ' ';//a safe default for freeform parsing
572 front = pat.front; in _popFront()
579 while (!empty && isWhite(front)) _popFront(); in skipSpace()
594 while (std.ascii.isDigit(front)) in parseDecimal()
598 r = 10*r + cast(uint)(front-'0'); in parseDecimal()
638 switch (front) in parseRegex()
642 if (front == '?') in parseRegex()
[all …]
/netbsd-src/external/gpl3/gcc/dist/libphobos/libdruntime/core/
H A Ddemangle.d320 @property char front()
337 if ( val != front )
375 if ( val == front )
381 char val = front;
395 assert( front == 'Q' );
416 t = front;
449 auto t = front;
497 if ( 'I' == front )
503 if ( 'N' == front )
506 if ( 'I' == front )
[all …]
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/algorithm/
H A Dsetops.d272 @property auto front() { return impl.front; } in FwdRangeWrapper()
315 @property auto front() { return impl.front; } in InpRangeWrapper()
387 @property auto front() in front() function
543 auto front1 = C.front;
546 assert(D.front == front1);
566 int front() @system @property inout
884 return comp(b.front, a.front);
904 @property auto ref front()
906 return _heap.front.front;
1066 if (r2.empty || comp(r1.front, r2.front)) break;
[all …]
H A Diteration.d81 `cache` eagerly evaluates $(REF_ALTTEXT front, front, std,range,primitives) of `range`
84 The result is then directly returned when $(REF_ALTTEXT front, front, std,range,primitives) is call…
170 assert([1].map!(x=>[x].map!(y=>y)).cache.front.front == 1);
174 Tip: `cache` is eager when evaluating elements. If calling front on the
176 front on the actual cached range.
181 If calling front has no side effect though, placing `take` after `cache`
249 assert(strings.front is strings.front);
268 bool front() @property {return initialized = true;} in front() function
309 caches[0] = source.front; in _Cache()
333 E front() @property in _Cache()
[all …]
H A Dsearching.d124 static assert(is(typeof(unaryFun!pred(range.front))),
175 if (isInputRange!Range && is(typeof(unaryFun!pred(range.front))))
236 if (isInputRange!(Range) && is(typeof(r.front == lPar)))
252 if (rn.front == lPar)
257 else if (rn.front == rPar)
446 is(typeof(binaryFun!pred(r1.front, r2.front))))
469 !r1.empty && !r2.empty && binaryFun!pred(r1.front, r2.front);
485 is(typeof(binaryFun!pred(r1.front, r2.front))))
496 if (!binaryFun!pred(f, r2.front))
506 is(typeof(r1.front == r2.front)))
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/
H A Dbase64.d325 immutable v1 = source.front; source.popFront();
326 immutable v2 = source.front; source.popFront();
327 immutable v3 = source.front; source.popFront();
337 size_t val = source.front << 16;
341 val |= source.front << 8;
501 immutable v1 = source.front; source.popFront();
502 immutable v2 = source.front; source.popFront();
503 immutable v3 = source.front; source.popFront();
514 size_t val = source.front << 16;
518 val |= source.front << 8;
[all …]
H A Dcsv.d600 assert(equal(record, ans.front));
619 assert(equal(record, ans2.front));
630 assert(equal(record, ans2.front));
691 auto record = records.front;
692 assert(record.front == "one");
694 assert(record.front == "two");
696 record = records.front;
697 assert(record.front == "three");
740 @property dchar front() in front() function
928 ex.col = indices.front; in this()
[all …]
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/
H A Dbase64.d61 import std.range.primitives : empty, front, isInputRange, isOutputRange,
326 immutable v1 = source.front; source.popFront();
327 immutable v2 = source.front; source.popFront();
328 immutable v3 = source.front; source.popFront();
338 size_t val = source.front << 16;
342 val |= source.front << 8;
490 immutable v1 = source.front; source.popFront();
491 immutable v2 = source.front; source.popFront();
492 immutable v3 = source.front; source.popFront();
503 size_t val = source.front << 16;
[all …]
H A Dcsv.d304 auto firstLine = text.csvReader!(string, Malformed.ignore)(null).front;
431 auto record = records.front;
433 assert(record.front == text);
714 assert(equal(record, ans.front));
733 assert(equal(record, ans2.front));
744 assert(equal(record, ans2.front));
805 auto record = records.front;
806 assert(record.front == "one");
808 assert(record.front == "two");
810 record = records.front;
[all …]
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/format/internal/
H A Dread.d29 import std.range.primitives : empty, front, popFront; in skipData()
35 if (input.front == '+' || input.front == '-') input.popFront(); in skipData()
38 while (!input.empty && isDigit(input.front)) input.popFront(); in skipData()
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 != end; input.popFront())
218 app.put(input.front);
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/testsuite/libphobos.aa/
H A Dtest_aa.d301 () @safe { auto x = aa.byKey.front; } (); in testByKey1()
354 aa[keyRange.front]++; in testByKey4()
369 aa[savedKeyRange.front]++; in testByKey4()
397 assert(hasSeen[valRange.front] == 0); in testByKey4()
398 hasSeen[valRange.front]++; in testByKey4()
409 assert(!hasSeen[savedValRange.front]); in testByKey4()
410 hasSeen[savedValRange.front] = true; in testByKey4()
456 assert(aa0.byValue.front == "zero"); in issue8583()
457 assert(aa1.byValue.front == "onetwothree"); in issue8583()
458 assert(aa2.byValue.front == 987); in issue8583()
[all …]
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/container/
H A Dbinaryheap.d132 store.front = move(t2); in pop()
248 @property ElementType!Store front()
251 return _store.front;
323 _store.front = move(t2); in removeFront()
352 _store.front = value;
375 if (!comp(value, _store.front)) return false; // value >= largest
376 _store.front = value;
395 if (!comp(value, _store.front)) return false; // value >= largest
398 swap(_store.front, value);
414 assert(h.front == 16);
[all …]
/netbsd-src/external/gpl3/gcc/dist/libphobos/testsuite/libphobos.aa/
H A Dtest_aa.d304 auto x = aa.byKey.front; in testByKey1()
355 aa[keyRange.front]++; in testByKey4()
370 aa[savedKeyRange.front]++; in testByKey4()
398 assert(hasSeen[valRange.front] == 0); in testByKey4()
399 hasSeen[valRange.front]++; in testByKey4()
410 assert(!hasSeen[savedValRange.front]); in testByKey4()
411 hasSeen[savedValRange.front] = true; in testByKey4()
457 assert(aa0.byValue.front == "zero"); in issue8583()
458 assert(aa1.byValue.front == "onetwothree"); in issue8583()
459 assert(aa2.byValue.front == 987); in issue8583()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/range/
H A Dpackage.d290 @property auto ref front() { return source.back; } in Result()
292 @property auto ref back() { return source.front; } in Result()
313 @property void front(ElementType!R val) in Result()
320 source.front = val; in Result()
389 assert(r.front == witness.front); in test()
423 assert(myRetro.front == 10);
430 assert(myRetro[0] == myRetro.front);
439 myRetro.front++;
440 scope(exit) myRetro.front--;
441 assert(myRetro.front == 11);
[all …]

12345678910>>...68