| /external/chromium_org/third_party/skia/tools/lua/ |
| skia.lua | 23 function Sk.Rect.new(l, t, r, b)
|
| /external/chromium_org/tools/emacs/ |
| trybot.el | 96 (defun trybot-get-new-buffer ()
97 "Get a new clean buffer for trybot output."
126 (buffer (trybot-get-new-buffer))
|
| /external/ipsec-tools/src/racoon/ |
| policy.c | 292 struct secpolicy *new; local
294 new = racoon_calloc(1, sizeof(*new));
295 if (new == NULL)
298 return new;
381 inssp(new)
382 struct secpolicy *new;
388 if (new->spidx.priority < p->spidx.priority) {
389 TAILQ_INSERT_BEFORE(p, new, chain);
395 TAILQ_INSERT_TAIL(&sptree, new, chain)
428 struct ipsecrequest *new; local
[all...] |
| sainfo.c | 166 struct sainfo *new; local
168 new = racoon_calloc(1, sizeof(*new));
169 if (new == NULL)
172 new->lifetime = IPSECDOI_ATTR_SA_LD_SEC_DEFAULT;
173 new->lifebyte = IPSECDOI_ATTR_SA_LD_KB_MAX;
175 return new;
201 inssainfo(new)
202 struct sainfo *new;
204 LIST_INSERT_HEAD(&sitree, new, chain)
235 struct sainfoalg *new; local
[all...] |
| schedule.c | 124 * add new schedule to schedule table.
133 struct sched *new; local
135 new = (struct sched *)racoon_malloc(sizeof(*new));
136 if (new == NULL)
139 memset(new, 0, sizeof(*new));
140 new->func = func;
141 new->param = param;
143 new->id = id++
232 caddr_t new; local
[all...] |
| /external/libsepol/src/ |
| ebitmap.c | 20 ebitmap_node_t *n1, *n2, *new, *prev; local
28 new = (ebitmap_node_t *) malloc(sizeof(ebitmap_node_t));
29 if (!new) {
33 memset(new, 0, sizeof(ebitmap_node_t));
35 new->startbit = n1->startbit;
36 new->map = n1->map | n2->map;
40 new->startbit = n1->startbit;
41 new->map = n1->map;
44 new->startbit = n2->startbit;
45 new->map = n2->map
173 ebitmap_node_t *n, *new, *prev; local
250 ebitmap_node_t *n, *prev, *new; local
[all...] |
| users.c | 122 int new = 0; local
148 /* Otherwise, create a new one */
154 new = 1;
226 /* If there are no errors, and this is a new user, add the user to policy */
227 if (new) {
280 if (new && usrdatum) {
|
| /external/libsepol/tests/ |
| test-common.c | 188 unsigned int i, j, new, found = 0; local
203 new = 0;
207 new = 1;
210 if (new == 0) {
213 CU_ASSERT(new == 1);
229 int j, new, found = 0; local
246 new = 0;
250 new = 1;
253 if (new == 0) {
256 CU_ASSERT(new == 1)
[all...] |
| /external/mesa3d/src/glsl/ |
| ir_function_detect_recursion.cpp | 143 /* Callers of this ralloc-based new need not call delete. It's
145 static void* operator new(size_t size, void *ctx)
192 f = new(mem_ctx) function(sig);
225 call_node *node = new(mem_ctx) call_node;
231 node = new(mem_ctx) call_node;
|
| loop_analysis.h | 144 static void* operator new(size_t size, void *ctx)
|
| /external/skia/tools/lua/ |
| skia.lua | 23 function Sk.Rect.new(l, t, r, b)
|
| /external/stlport/src/ |
| cxa.c | 72 struct exit_function *new = __new_exitfn (); local
74 if ( new == NULL )
77 new->flavor = ef_cxa;
78 new->func.cxa.fn = (void (*) (void *, int)) func;
79 new->func.cxa.arg = arg;
80 new->func.cxa.dso_handle = d;
|
| /external/valgrind/main/coregrind/m_gdbserver/ |
| regcache.c | 227 Bool new; local
228 VG_(dmemcpy) (register_data_for_supply (n, 0, &new),
230 if (new)
236 Bool new; local
239 VG_(dmemcpy) (register_data_for_supply (n, 0, &new),
241 if (new)
|
| /external/valgrind/main/perf/ |
| many-loss-records.c | 92 struct Chunk *new = NULL; // shut gcc up local
96 new = malloc (sz);
99 new->child = prev;
100 prev = new;
102 topblocks[freetop] = new;
|
| /hardware/intel/common/wrs_omxil_core/utils/src/ |
| list.c | 34 struct list *new; local
36 new = malloc(sizeof(struct list));
37 __list_init(new);
39 return new;
44 struct list *new; local
46 new = __list_alloc();
47 if (new)
48 new->data = data;
50 return new;
111 struct list *__list_add_before(struct list *entry, struct list *new)
173 struct list *new; local
184 struct list *new; local
[all...] |
| /ndk/sources/cxx-stl/stlport/src/ |
| cxa.c | 72 struct exit_function *new = __new_exitfn (); local
74 if ( new == NULL )
77 new->flavor = ef_cxa;
78 new->func.cxa.fn = (void (*) (void *, int)) func;
79 new->func.cxa.arg = arg;
80 new->func.cxa.dso_handle = d;
|
| /ndk/sources/host-tools/make-3.81/ |
| strcache.c | 45 struct strcache *new; local
46 new = (struct strcache *) xmalloc (sizeof (*new) + bufsize);
47 new->end = new->buffer;
48 new->count = 0;
49 new->bytesfree = bufsize;
51 new->next = strcache;
52 strcache = new;
54 return new;
[all...] |
| /ndk/tests/device/test-stlport_shared-exception/jni/ |
| arraynew.cpp | 7 #include <new>
11 void* operator new[](size_t s) throw (std::bad_alloc)
21 void* a = new T[7];
30 void* a = new (p) T[13];
38 void* a = new T[11];
68 void* a = new (p) T[11];
112 struct V { void *operator new[] (size_t s, void *p)
125 // new.
142 // There should be a cookie when using a non-global placement new.
|
| /ndk/tests/device/test-stlport_static-exception/jni/ |
| arraynew.cpp | 7 #include <new>
11 void* operator new[](size_t s) throw (std::bad_alloc)
21 void* a = new T[7];
30 void* a = new (p) T[13];
38 void* a = new T[11];
68 void* a = new (p) T[11];
112 struct V { void *operator new[] (size_t s, void *p)
125 // new.
142 // There should be a cookie when using a non-global placement new.
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| kcom.h | 206 inline PVOID operator new(
217 inline PVOID operator new(
|
| /external/pdfium/core/include/fxcrt/ |
| fx_memory.h | 65 #define FX_NEW new(__FILE__, __LINE__)
68 #define FX_NEW new
74 void* operator new (size_t size, FX_LPCSTR file, int line);
78 void* operator new (size_t size);
82 void* operator new[] (size_t size, FX_LPCSTR file, int line);
86 void* operator new[] (size_t size);
90 void* operator new (size_t, void* buf)
101 for (int i = 0; i < (Count); i ++) new (Pointer + i) Class; \
151 inline void* operator new(size_t size, IFX_Allocator* fxAllocator)
159 ::new(fxAllocator)
[all...] |
| /external/clang/test/CodeGenCXX/ |
| mangle-ms.cpp | 162 char *ptr = new char;
168 char *array = new char[42];
319 void *operator new(__SIZE_TYPE__);
320 void *operator new[](__SIZE_TYPE__);
327 void *OverloadedNewDelete::operator new(__SIZE_TYPE__ s) { return 0; }
328 void *OverloadedNewDelete::operator new[](__SIZE_TYPE__ s) { return 0; }
352 OperatorNewType operator new;
353 OperatorNewType operator new[];
358 void *TypedefNewDelete::operator new(__SIZE_TYPE__ s) { return 0; }
359 void *TypedefNewDelete::operator new[](__SIZE_TYPE__ s) { return 0;
[all...] |
| /external/clang/test/SemaCXX/ |
| new-delete.cpp | 1 // RUN: %clang_cc1 -fsyntax-only -verify %s -triple=i686-pc-linux-gnu -Wno-new-returns-null
14 // A special new, to verify that the global version isn't used.
15 void* operator new(size_t, S*); // expected-note {{candidate}}
24 inline void *operator new(size_t) { // no warning, due to __attribute__((used))
29 void* operator new(const size_t); // expected-note 2 {{candidate}}
30 void* operator new(size_t, int*); // expected-note 3 {{candidate}}
31 void* operator new(size_t, float*); // expected-note 3 {{candidate}}
32 void* operator new(size_t, S); // expected-note 2 {{candidate}}
38 int *pi = new int;
39 float *pf = new (pi) float()
[all...] |
| /external/llvm/include/llvm/MC/ |
| MCContext.h | 198 /// to process a new module
206 /// CreateLinkerPrivateTempSymbol - Create and return a new linker temporary
210 /// CreateTempSymbol - Create and return a new assembler temporary symbol
434 // operator new and delete aren't allowed inside namespaces.
436 /// @brief Placement new for using the MCContext's allocator.
438 /// This placement form of operator new uses the MCContext's allocator for
439 /// obtaining memory. It is a non-throwing new, which means that it returns
445 /// IntegerLiteral *Ex = new (Context) IntegerLiteral(arguments);
447 /// IntegerLiteral *Ex2 = new (Context, 8) IntegerLiteral(arguments);
458 inline void *operator new(size_t Bytes, llvm::MCContext &C
[all...] |
| /art/compiler/dex/ |
| global_value_numbering.h | 58 static void* operator new(size_t size, ScopedArenaAllocator* allocator) {
68 // Allocate a new value name.
70 // TODO: No new values should be needed once we allow modifications.
84 // Look up a value in the global value map, adding a new entry if there was none before.
|
