Searched defs:used (Results 1 - 25 of 205) sorted by relevance

123456789

/external/clang/test/CodeGenCXX/
H A Dlambda-expressions.cpp6 // CHECK: @used = internal global
7 auto used = [](int i) { return i+1; }; variable
8 void *use = &used;
/external/clang/test/SemaCXX/
H A Dwarn-unused-attribute.cpp14 Test used; local
16 used.use();
/external/webrtc/webrtc/base/
H A Dratelimiter.cc20 void RateLimiter::Use(size_t used, double time) { argument
26 used_in_period_ += used;
/external/valgrind/callgrind/
H A Dcosts.h48 Int used; member in struct:_CostChunk
54 * Typically used from ct_events.c */
/external/clang/include/clang/Sema/
H A DWeak.h10 // This file defines the WeakInfo class, which is used to store
28 bool used; // identifier later declared? member in class:clang::WeakInfo
31 : alias(nullptr), loc(SourceLocation()), used(false) {}
33 : alias(Alias), loc(Loc), used(false) {}
36 void setUsed(bool Used=true) { used = Used; }
37 inline bool getUsed() { return used; }
/external/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_rename_regs.c51 unsigned char * used; local
64 used = memory_pool_malloc(&c->Pool, sizeof(unsigned char) * used_length);
65 memset(used, 0, sizeof(unsigned char) * used_length);
67 rc_get_used_temporaries(c, used, used_length);
79 new_index = rc_find_free_temporary_list(c, used, used_length,
/external/proguard/src/proguard/shrink/
H A DInterfaceUsageMarker.java32 * classes that are being used in the visited class.
46 private boolean used; field in class:InterfaceUsageMarker
52 * @param usageMarker the usage marker that is used to mark the classes
70 // Check if any interfaces are being used.
85 // At least one if this interface's interfaces is being used.
104 used = classUsed;
111 used = true;
124 // The ClassConstant isn't marked as being used yet. But maybe it
127 classUsed = used;
131 // The class is being used
[all...]
/external/speex/libspeex/
H A Dvq_bfin.h20 contributors may be used to endorse or promote products derived from
73 int i,k,used; local
74 used = 0;
96 for (k=N-1; (k >= 1) && (k > used || dist < best_dist[k-1]); k--)
103 used++;
H A Dvq.c17 contributors may be used to endorse or promote products derived from
78 int i,j,k,used; local
79 used = 0;
92 for (k=N-1; (k >= 1) && (k > used || dist < best_dist[k-1]); k--)
99 used++;
112 int i,j,k, sign, used; local
113 used=0;
134 for (k=N-1; (k >= 1) && (k > used || dist < best_dist[k-1]); k--)
141 used++;
H A Dvq_sse.h19 contributors may be used to endorse or promote products derived from
38 int i,j,k,used; local
42 used = 0;
59 for (k=N-1; (k >= 1) && (k > used || dist[i] < best_dist[k-1]); k--)
66 used++;
77 int i,j,k,used; local
81 used = 0;
108 for (k=N-1; (k >= 1) && (k > used || dist[i] < best_dist[k-1]); k--)
115 used++;
/external/toybox/toys/pending/
H A Dklogd.c62 * "used" amount to track next read to start.
66 int prio, size, used = 0; local
83 start = msg_buffer + used; //start updated for re-read.
85 size = klogctl(2, start, sizeof(msg_buffer) - used - 1);
87 size = xread(TT.fd, start, sizeof(msg_buffer) - used - 1);
91 if (used) start = msg_buffer;
93 if ((line_start = strsep(&start, "\n")) != NULL && start != NULL) used = 0;
95 used = strlen(line_start);
97 if (used < (sizeof(msg_buffer) - 1)) break;
98 used
[all...]
/external/valgrind/memcheck/tests/
H A Dmallinfo.c15 size_t used; local
36 used = mi.uordblks + mi.hblkhd;
37 if (used < min)
40 if (used > max)
43 // used should be reasonably close to min
45 if (used/5*4 > min)
71 return used;
H A Dleak-pool.c18 size_t used; member in struct:pool
25 void *a = p->buf + p->used;
26 assert(p->used + n < p->allocated);
28 p->used += n;
38 p->used = 0;
/external/vboot_reference/firmware/lib/
H A Dutility_string.c52 /* Don't count the terminating null in the bytes used */
58 uint32_t used = 0; local
64 while (dest[used] && used < destlen - 1)
65 used++;
68 while (*src && used < destlen - 1)
69 dest[used++] = *src++;
72 dest[used] = 0;
73 return used;
/external/mesa3d/src/glsl/
H A Dopt_dead_functions.cpp43 this->used = false;
47 bool used; member in class:__anon14007::signature_entry
95 entry->used = true;
109 entry->used = true;
122 /* Now that we've figured out which function signatures are used, remove
129 if (!entry->used) {
/external/regex-re2/util/
H A Dstrutil.cc20 int used = 0; local
23 if (dest_len - used < 2) // Need space for two letter escape
28 case '\n': dest[used++] = '\\'; dest[used++] = 'n'; break;
29 case '\r': dest[used++] = '\\'; dest[used++] = 'r'; break;
30 case '\t': dest[used++] = '\\'; dest[used++] = 't'; break;
31 case '\"': dest[used++] = '\\'; dest[used
[all...]
/external/autotest/client/common_lib/cros/graphite/
H A Des_utils.py75 logging.debug('Failed to import elasticsearch. Mock classes will be used ' namespace
/external/boringssl/src/crypto/bio/
H A Dhexdump.c17 * If this package is used in a product, Eric Young should be given attribution
18 * as the author of the parts of the library used.
35 * being used are not cryptographic related :-).
67 unsigned used; /* number of bytes in the current line. */ member in struct:hexdump_ctx
99 if (ctx->used == 0) {
116 if (ctx->used == 7) {
120 } else if (ctx->used == 15) {
131 ctx->right_chars[ctx->used] = to_char(data[i]);
132 ctx->used++;
134 if (ctx->used
[all...]
/external/boringssl/src/crypto/rand/
H A Durandom.c40 size_t used; member in struct:rand_buffer
44 /* requested_lock is used to protect the |*_requested| variables. */
149 buf->used = BUF_SIZE; /* To trigger a |read_full| on first use. */
183 size_t remaining = BUF_SIZE - buf->used;
186 memcpy(out, &buf->rand[buf->used], remaining);
187 buf->used += remaining;
195 buf->used = 0;
199 memcpy(out, &buf->rand[buf->used], requested);
200 buf->used += requested;
/external/freetype/src/base/
H A Dmd5.c214 unsigned long used, available; local
221 used = saved_lo & 0x3f;
223 if (used) {
224 available = 64 - used;
227 memcpy(&ctx->buffer[used], data, size);
231 memcpy(&ctx->buffer[used], data, available);
247 unsigned long used, available; local
249 used = ctx->lo & 0x3f;
251 ctx->buffer[used++] = 0x80;
253 available = 64 - used;
[all...]
/external/mesa3d/src/gallium/auxiliary/pipebuffer/
H A Dpb_validate.c58 unsigned used; member in struct:pb_validate
80 if(vl->used && vl->entries[vl->used - 1].buf == buf) {
81 vl->entries[vl->used - 1].flags |= flags;
86 if(vl->used == vl->size) {
106 assert(!vl->entries[vl->used].buf);
107 pb_reference(&vl->entries[vl->used].buf, buf);
108 vl->entries[vl->used].flags = flags;
109 ++vl->used;
121 for(i = 0; i < vl->used;
[all...]
/external/mesa3d/src/gallium/winsys/i915/sw/
H A Di915_sw_batchbuffer.c106 unsigned used = 0; local
110 used = batch->base.ptr - batch->base.map;
111 assert((used & 3) == 0);
116 used += 4;
119 if ((used & 4) == 0) {
126 used = batch->base.ptr - batch->base.map;
127 assert((used & 4) == 0);
/external/opencv3/3rdparty/zlib/
H A Dinftrees.c24 lens shorts, which is used as a work area. type is the type of code
47 unsigned used; /* code entries in table used */ local
99 The length counts are used for other purposes as well, i.e. finding
151 filled is at next and has curr index bits. The code being used is huff
165 counts are used for this, and so count[] is decremented as codes are
168 used keeps track of how many table entries have been allocated from the
183 base = extra = work; /* dummy value--not used */
207 used = 1U << root; /* use root table entries */
208 mask = used
[all...]
/external/pdfium/third_party/freetype/src/base/
H A Dmd5.c214 unsigned long used, available; local
221 used = saved_lo & 0x3f;
223 if (used) {
224 available = 64 - used;
227 memcpy(&ctx->buffer[used], data, size);
231 memcpy(&ctx->buffer[used], data, available);
247 unsigned long used, available; local
249 used = ctx->lo & 0x3f;
251 ctx->buffer[used++] = 0x80;
253 available = 64 - used;
[all...]
/external/zlib/src/contrib/infback9/
H A Dinftree9.c24 lens shorts, which is used as a work area. type is the type of code
47 unsigned used; /* code entries in table used */ local
101 The length counts are used for other purposes as well, i.e. finding
145 filled is at next and has curr index bits. The code being used is huff
159 counts are used for this, and so count[] is decremented as codes are
162 used keeps track of how many table entries have been allocated from the
177 base = extra = work; /* dummy value--not used */
201 used = 1U << root; /* use root table entries */
202 mask = used
[all...]

Completed in 793 milliseconds

123456789