| /src/sys/external/bsd/drm2/dist/drm/i915/display/ |
| 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: GEM object to invalidat
[all...] |
| intel_frontbuffer.c | 168 void __intel_fb_invalidate(struct intel_frontbuffer *front,
172 struct drm_i915_private *i915 = to_i915(front->obj->base.dev);
187 void __intel_fb_flush(struct intel_frontbuffer *front,
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_CS)
227 struct intel_frontbuffer *front = variable in typeref:struct:intel_frontbuffer
249 struct intel_frontbuffer *front; local
[all...] |
| /src/usr.bin/spell/spellprog/ |
| look.c | 58 look(u_char *string, u_char *front, u_char *back)
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 to back
[all...] |
| /src/usr.bin/look/ |
| 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)
173 front = binary_search(string, front, back);
174 front = linear_search(string, front, back);
176 if (front)
[all...] |
| /src/external/bsd/ntp/dist/ntpd/ |
| 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...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/ |
| 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(), y)
[all...] |
| /src/external/gpl3/gdb/dist/gdbsupport/ |
| 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 ().buf, reason)
[all...] |
| /src/external/gpl3/gdb.old/dist/gdbsupport/ |
| 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 ().buf, reason)
[all...] |
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/internal/test/ |
| range.d | 19 @property int front() { return state; }
|
| /src/external/bsd/flex/dist/examples/manual/ |
| 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
|
| /src/external/bsd/openresolv/dist/ |
| 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"
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/regex/internal/ |
| 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...] |
| /src/usr.sbin/altq/libaltq/ |
| 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->clinfo->clname, front->line_no
[all...] |
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/format/internal/ |
| 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 != end; input.popFront()
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Driver/ |
| Tool.cpp | 26 ConstructJob(C, JA, Outputs.front(), Inputs, TCArgs, LinkingOutput);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| 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(); }
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/ |
| 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, a.front)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Basic/Targets/ |
| 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...] |
| /src/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/Orc/ |
| TPCDynamicLibrarySearchGenerator.cpp | 50 assert(Result->front().size() == LookupSymbols.size() &&
53 auto ResultI = Result->front().begin();
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-reduce/deltas/ |
| Delta.h | 71 // Does the current (front) chunk contain such a feature?
72 bool ShouldKeep = ChunksToKeep.front().contains(Index);
76 if (ChunksToKeep.front().End == Index)
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/container/ |
| binaryheap.d | 45 accessing the largest element (by using the `front` property) is a
132 store.front = move(t2);
248 @property ElementType!Store front()
250 enforce(!empty, "Cannot call front on an empty heap.");
251 return _store.front;
323 _store.front = move(t2);
352 _store.front = value;
359 returns `true`. Otherwise, if $(D less(value, front)), calls $(D
374 assert(!_store.empty, "Cannot replace front of an empty heap.");
375 if (!comp(value, _store.front)) return false; // value >= larges
[all...] |
| /src/external/gpl3/gdb/dist/gdbserver/ |
| notif.cc | 65 struct notif_event *event = notif->queue.front ();
101 struct notif_event *head = np->queue.front ();
|
| /src/external/gpl3/gdb.old/dist/gdbserver/ |
| notif.cc | 65 struct notif_event *event = notif->queue.front ();
101 struct notif_event *head = np->queue.front ();
|
| /src/external/apache2/llvm/dist/clang/include/clang/Driver/ |
| Multilib.h | 47 (StringRef(GCCSuffix).front() == '/' && GCCSuffix.size() > 1));
58 (StringRef(OSSuffix).front() == '/' && OSSuffix.size() > 1));
69 (StringRef(IncludeSuffix).front() == '/' && IncludeSuffix.size() > 1));
93 assert(F.front() == '+' || F.front() == '-');
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/ |
| csv.d | 304 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...] |
