| /external/dnsmasq/contrib/wrt/ |
| dhcp_release.c | 80 void *new; local
85 if (!(new = malloc(size)))
93 memcpy(new, iov->iov_base, iov->iov_len);
97 iov->iov_base = new;
|
| /external/dnsmasq/src/ |
| helper.c | 324 struct script_data *new; local
330 if (!(new = whine_malloc(size)))
334 buf = new;
|
| util.c | 430 void *new; local
435 if (!(new = whine_malloc(size)))
443 memcpy(new, iov->iov_base, iov->iov_len);
447 iov->iov_base = new;
|
| /external/e2fsprogs/tests/progs/ |
| test_rel.c | 95 printf("Old= %u, New= %u, Owner= %u:%u\n", old, ent->new,
110 printf("Old= %lu, New= %lu, Original=%lu, Max_refs=%u\n", old,
111 ent->new, ent->orig, ent->max_refs);
177 blk_t old, new, offset=0, owner=0; local
188 if (parse_block(argv[0], "new block", argv[2], &new))
200 ent.new = new;
307 blk_t old, new; local
384 ext2_ino_t old, new, max_refs; local
616 ext2_ino_t old, new; local
[all...] |
| /external/e2fsprogs/util/ |
| symlinks.c | 41 static int substr (char *s, char *old, char *new)
49 if (new)
50 newlen = strlen(new);
62 if (new) {
65 p = new;
164 static char lpath[PATH_MAX], new[PATH_MAX], abspath[PATH_MAX]; local
213 fix_messy = tidy_path(strcpy(new,lpath));
215 fix_long = shorten_path(new, path);
241 /* now create new, with "../"s followed by tail */
242 np = new;
[all...] |
| /external/ipsec-tools/src/racoon/ |
| isakmp_ident.c | 1768 vchar_t *buf = NULL, *new = NULL; local
[all...] |
| isakmp_quick.c | 1740 vchar_t *buf = NULL, *new = NULL; local
[all...] |
| proposal.c | 82 struct saprop *new; local
84 new = racoon_calloc(1, sizeof(*new));
85 if (new == NULL)
88 return new;
94 struct saproto *new; local
96 new = racoon_calloc(1, sizeof(*new));
97 if (new == NULL)
100 return new;
156 struct satrns *new; local
[all...] |
| remoteconf.c | 91 * If matching anonymous entry, then new entry is copied from anonymous entry.
171 struct remoteconf *new; local
174 new = racoon_calloc(1, sizeof(*new));
175 if (new == NULL)
178 new->proposal = NULL;
181 new->doitype = IPSEC_DOI;
182 new->sittype = IPSECDOI_SIT_IDENTITY_ONLY;
183 new->idvtype = IDTYPE_UNDEFINED;
184 new->idvl_p = genlist_init()
231 struct remoteconf *new, *old; local
271 struct remoteconf *new; local
337 struct etypes *new; local
438 struct isakmpsa *new; local
625 struct idspec *new; local
[all...] |
| /external/libedit/src/ |
| tty.c | 904 Char new[2], old[2]; local
908 new[1] = old[1] = '\0';
921 new[0] = t_n[tp->nch];
923 if (new[0] == old[0] && !force)
925 /* Put the old default binding back, and set the new binding */
928 keymacro_clear(el, map, new);
930 map[UC(new[0])] = tp->bind[el->el_map.type];
934 keymacro_clear(el, alt, new);
935 alt[UC(new[0])] = tp->bind[el->el_map.type + 1];
[all...] |
| /external/libnl/lib/ |
| cache.c | 229 * Allocate a new cache containing a subset of a cache
231 * @arg filter Filter defining the subset to be filled into new cache
326 struct nl_object *new; local
332 new = nl_object_clone(obj);
333 if (!new)
337 new = obj;
340 return __cache_add(cache, new);
349 * and adds it to the new cache.
663 * and adds the new element to the cache.
|
| /external/libvorbis/lib/ |
| lsp.c | 317 double new=0.f,delta; local
325 ppp = new*ppp + pp;
326 pp = new*pp + p;
327 p = new*p + defl[i-1];
344 new -= delta;
348 if(fabs(delta/new)<10e-12)break;
352 r[m-1]=new;
357 defl[i-1]+=new*defl[i];
|
| /external/libvorbis/vq/ |
| vqgen.c | 317 /* a new, unique entry. march it down */
342 float *new; local
371 new=_ogg_malloc(sizeof(float)*v->entries*v->elements);
475 /* Now assign with new bias and find new midpoints */
506 vN(new,j)[k]+=ppt[k];
510 vN(new,j)[k]=ppt[k];
517 if(vN(new,j)[k]>ppt[k])vN(new,j)[k]=ppt[k];
523 vN(new,j)[k]=ppt[k]
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
| callchain.c | 166 * Create a child for a parent. If inherit_children, then the new child
167 * will become the new parent of it's parent children
172 struct callchain_node *new; local
174 new = zalloc(sizeof(*new));
175 if (!new) {
179 new->parent = parent;
180 INIT_LIST_HEAD(&new->children);
181 INIT_LIST_HEAD(&new->val);
186 list_splice(&parent->children, &new->children)
235 struct callchain_node *new; local
255 struct callchain_node *new; local
[all...] |
| /external/llvm/include/llvm/Support/ |
| Allocator.h | 204 if (!CurPtr) // Start a new slab if we haven't allocated one already.
239 // Otherwise, start a new slab and try again.
303 /// \brief Allocate a new slab and move the bump pointers over into the new
408 void *operator new(size_t Size,
|
| /external/llvm/lib/Support/ |
| MemoryBuffer.cpp | 28 #include <new>
72 void *operator new(size_t N, const NamedBufferAlloc &Alloc) {
73 char *Mem = static_cast<char *>(operator new(N + Alloc.Name.size() + 1));
102 return new (NamedBufferAlloc(BufferName))
118 /// getNewUninitMemBuffer - Allocate a new MemoryBuffer of the specified size
131 char *Mem = static_cast<char*>(operator new(RealLen, std::nothrow));
141 return new (Mem) MemoryBufferMem(StringRef(Buf, Size), true);
144 /// getNewMemBuffer - Allocate a new MemoryBuffer of the specified size that
344 new (NamedBufferAlloc(Filename))
353 // new(std::nothrow) returns 0
[all...] |
| /external/ltrace/testsuite/ltrace.minor/ |
| demangle-lib.cpp | 68 void* myclass::operator new(size_t size)
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_emulate_loops.c | 79 struct rc_instruction *new = rc_alloc_instruction(c); local
80 memcpy(new, ptr, sizeof(struct rc_instruction));
81 rc_insert_instruction(append_to, new);
82 append_to = new;
|
| radeon_variable.c | 279 struct rc_variable * new = local
281 memset(new, 0, sizeof(struct rc_variable));
282 new->C = c;
283 new->Dst.File = DstFile;
284 new->Dst.Index = DstIndex;
285 new->Dst.WriteMask = DstWriteMask;
287 new->Inst = reader_data->Writer;
288 new->ReaderCount = reader_data->ReaderCount;
289 new->Readers = reader_data->Readers;
291 return new;
[all...] |
| /external/mesa3d/src/glsl/ |
| list.h | 79 /* Callers of this ralloc-based new need not call delete. It's
81 static void* operator new(size_t size, void *ctx)
288 /* Callers of this ralloc-based new need not call delete. It's
290 static void* operator new(size_t size, void *ctx)
|
| /external/openssl/ssl/ |
| s3_lib.c | 887 /* New AES ciphersuites */
1272 /* New TLS Export CipherSuites from expired ID */
3588 DH *new=NULL,*dh; local
[all...] |
| /external/clang/test/SemaCXX/ |
| dllexport.cpp | 207 __declspec(dllexport) void* operator new(__SIZE_TYPE__ n);
569 __declspec(dllexport) void* operator new(__SIZE_TYPE__);
570 __declspec(dllexport) void* operator new[](__SIZE_TYPE__);
574 void* ExportAlloc::operator new(__SIZE_TYPE__ n) { return malloc(n); }
575 void* ExportAlloc::operator new[](__SIZE_TYPE__ n) { return malloc(n); }
[all...] |
| /art/compiler/dex/ |
| local_value_numbering.h | 80 static void* operator new(size_t size, ScopedArenaAllocator* allocator) {
390 // New memory version for merge, kNoValue if all memory versions matched.
|
| /external/bison/lib/ |
| hash.c | 559 /* Allocate and return a new hash table, or NULL upon failure. The initial
747 /* Get a new hash entry for a bucket overflow, possibly by recycling a
748 previously freed one. If this is not possible, allocate a new one. */
753 struct hash_entry *new; local
757 new = table->free_entry_list;
758 table->free_entry_list = new->next;
763 new = obstack_alloc (&table->entry_stack, sizeof *new);
765 new = malloc (sizeof *new);
[all...] |
| /external/chromium_org/chrome/installer/mac/third_party/bsdiff/ |
| goobsdiff.c | 157 static off_t matchlen(u_char *old,off_t oldsize,u_char *new,off_t newsize)
162 if(old[i]!=new[i]) break;
168 u_char *new,off_t newsize,off_t st,off_t en,off_t *pos)
173 x=matchlen(old+I[st],oldsize-I[st],new,newsize);
174 y=matchlen(old+I[en],oldsize-I[en],new,newsize);
186 if(memcmp(old+I[x],new,MIN(oldsize-I[x],newsize))<0) {
187 return search(I,old,oldsize,new,newsize,x,en,pos);
189 return search(I,old,oldsize,new,newsize,st,x,pos);
335 u_char *old,*new; local
371 ((new=malloc(newsize+1))==NULL) |
[all...] |
