/external/libnl/lib/route/ |
H A D | qdisc.c | 25 * // Allocate a new empty qdisc to be filled out 54 * // Allocate a new empty qdisc to be filled out with the parameters 186 * Build a netlink message to add a new qdisc 191 * Builds a new netlink message requesting an addition of a qdisc. 208 * Add a new qdisc 249 * @arg new new qdisc attributes 252 * Builds a new netlink message requesting an change of qdisc 260 struct rtnl_qdisc *new, 270 * @arg new ne 259 rtnl_qdisc_build_change_request(struct rtnl_qdisc *qdisc, struct rtnl_qdisc *new, struct nl_msg **result) argument 278 rtnl_qdisc_change(struct nl_sock *sk, struct rtnl_qdisc *qdisc, struct rtnl_qdisc *new) argument [all...] |
/external/libsepol/src/ |
H A D | 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/linux-tools-perf/perf-3.12.0/include/linux/ |
H A D | rbtree_augmented.h | 40 void (*copy)(struct rb_node *old, struct rb_node *new); 41 void (*rotate)(struct rb_node *old, struct rb_node *new); 45 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)); 71 rbstruct *new = rb_entry(rb_new, rbstruct, rbfield); \ 72 new->rbaugmented = old->rbaugmented; \ 78 rbstruct *new = rb_entry(rb_new, rbstruct, rbfield); \ 79 new->rbaugmented = old->rbaugmented; \ 111 __rb_change_child(struct rb_node *old, struct rb_node *new, argument 116 parent->rb_left = new; 118 parent->rb_right = new; [all...] |
/external/linux-tools-perf/perf-3.12.0/lib/ |
H A D | rbtree.c | 59 * - old's parent and color get assigned to new 60 * - old gets assigned new as a parent and 'color' as a color. 63 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, argument 67 new->__rb_parent_color = old->__rb_parent_color; 68 rb_set_parent_color(old, new, color); 69 __rb_change_child(old, new, parent, root); 74 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) 203 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) 365 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) 379 static inline void dummy_copy(struct rb_node *old, struct rb_node *new) {} argument 73 __rb_insert(struct rb_node *node, struct rb_root *root, void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) argument 202 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) argument 364 __rb_erase_color(struct rb_node *parent, struct rb_root *root, void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) argument 380 dummy_rotate(struct rb_node *old, struct rb_node *new) argument 408 __rb_insert_augmented(struct rb_node *node, struct rb_root *root, void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) argument 505 rb_replace_node(struct rb_node *victim, struct rb_node *new, struct rb_root *root) argument [all...] |
/external/mesa3d/src/glsl/ |
H A D | glsl_symbol_table.cpp | 29 /* Callers of this ralloc-based new need not call delete. It's 31 static void* operator new(size_t size, void *ctx) 97 /* If not declared at this scope, add a new entry. But if an existing 99 * the new variable declaration would shadow the function. 101 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(v); 113 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(v); 119 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(t); 133 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(f); 139 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(u); 145 symbol_table_entry *entry = new(mem_ct [all...] |
H A D | loop_analysis.h | 144 static void* operator new(size_t size, void *ctx)
|
/external/qemu/ |
H A D | async.c | 39 * To achieve the desired semantics we switch into a new AsyncContext. 62 * Enter a new AsyncContext. Already scheduled Bottom Halves and AIO callbacks 67 struct AsyncContext *new = g_malloc0(sizeof(*new)); local 68 new->parent = async_context; 69 new->id = async_context->id + 1; 70 async_context = new;
|
/external/qemu/util/ |
H A D | path.c | 51 struct pathelem *new = malloc(sizeof(*new)); local 52 new->name = strdup(name); 53 new->pathname = g_strdup_printf("%s/%s", root, name); 54 new->num_entries = 0; 55 return new;
|
/external/skia/bench/ |
H A D | GrMemoryPoolBench.cpp | 17 // change this to 0 to compare GrMemoryPool to default new / delete 23 void* operator new (size_t size) { return gBenchPool.allocate(size); } 69 objects[count] = new A; 85 void* operator new (size_t size) { return gBenchPool.allocate(size); } 116 objects[idx].reset(new B); 130 void* operator new (size_t size) { return gBenchPool.allocate(size); } 160 objects[i] = new C; 174 DEF_BENCH( return new GrMemoryPoolBenchStack(); ) 175 DEF_BENCH( return new GrMemoryPoolBenchRandom(); ) 176 DEF_BENCH( return new GrMemoryPoolBenchQueu [all...] |
/external/skia/include/core/ |
H A D | SkTLazy.h | 15 #include <new> 18 template <typename T> void* operator new(size_t, SkTLazy<T>* lazy); 30 fPtr = new (fStorage) T(*src); 36 fPtr = new (fStorage) T(*src->get()); 58 fPtr = new (SkTCast<T*>(fStorage)) T; 72 fPtr = new (SkTCast<T*>(fStorage)) T(src); 106 friend void* operator new<T>(size_t, SkTLazy* lazy); 113 template <typename T> void* operator new(size_t, SkTLazy<T>* lazy) { 120 // to match the op new silences warnings about missing op delete when a constructor throws an 125 #define SkNEW_IN_TLAZY(tlazy_ptr, type_name, args) (new (tlazy_pt [all...] |
/external/skia/src/gpu/ |
H A D | GrEffect.cpp | 68 void* GrEffectRef::operator new(size_t size) { 95 void* GrEffect::operator new(size_t size) {
|
/external/skia/tools/lua/ |
H A D | skia.lua | 23 function Sk.Rect.new(l, t, r, b)
|
/external/srtp/crypto/kernel/ |
H A D | crypto_kernel.c | 334 /* set head of list to new cipher type */ 379 /* set head of list to new auth type */ 470 kernel_debug_module_t *kdm, *new; local 486 new = (kernel_debug_module_t *)crypto_alloc(sizeof(kernel_debug_module_t)); 487 if (new == NULL) 491 new->mod = new_dm; 492 new->next = crypto_kernel.debug_module_list; 494 /* set head of list to new cipher type */ 495 crypto_kernel.debug_module_list = new;
|
/external/stlport/src/ |
H A D | 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/stlport/stlport/stl/ |
H A D | _construct.h | 84 #if defined (new) 85 # define _STLP_NEW_REDEFINE new 86 # undef new macro 91 new(__p) _T1(); 119 new(__p) _Tp(__val); 139 new(__p) _T1(__val); 160 new(__p) _T1(_STLP_PRIV _AsMoveSource(__val)); 183 # define new DEBUG_NEW macro
|
/external/valgrind/main/drd/ |
H A D | drd_vc.c | 69 /** Copy constructor -- initializes *new. */ 70 void DRD_(vc_copy)(VectorClock* const new, const VectorClock* const rhs) argument 72 DRD_(vc_init)(new, rhs->vc, rhs->size);
|
/external/valgrind/main/memcheck/tests/vbit-test/ |
H A D | binary.c | 15 vbits_t new = { .num_bits = v2.num_bits }; local 30 new.bits.u8 = (v1.bits.u8 & ~v2.bits.u8 & val2.u8) & 0xff; 33 new.bits.u16 = (v1.bits.u16 & ~v2.bits.u16 & val2.u16) & 0xffff; 36 new.bits.u32 = (v1.bits.u32 & ~v2.bits.u32 & val2.u32); 39 new.bits.u64 = (v1.bits.u64 & ~v2.bits.u64 & val2.u64); 44 return new;
|
H A D | vbits.c | 77 vbits_t new = { .num_bits = num_bits }; local 80 case 1: new.bits.u32 = 0x01; break; 81 case 8: new.bits.u8 = 0xff; break; 82 case 16: new.bits.u16 = 0xffff; break; 83 case 32: new.bits.u32 = ~0; break; 84 case 64: new.bits.u64 = ~0ull; break; 85 case 128: new.bits.u128[0] = ~0ull; 86 new.bits.u128[1] = ~0ull; 88 case 256: new.bits.u256[0] = ~0ull; 89 new 104 vbits_t new = { .num_bits = num_bits }; local 223 vbits_t new = { .num_bits = num_bits }; local 352 vbits_t new = { .num_bits = v1.num_bits }; local 380 vbits_t new = { .num_bits = v1.num_bits }; local 408 vbits_t new = { .num_bits = v1.num_bits * 2 }; local 449 vbits_t new = { .num_bits = v.num_bits / 2 }; local 574 vbits_t new = { .num_bits = num_bits }; local 667 vbits_t new = v; local 689 vbits_t new = v; local 711 vbits_t new = v; local 746 vbits_t new = { .num_bits = v1_num_bits }; local [all...] |
/external/valgrind/main/perf/ |
H A D | 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;
|
/external/clang/test/Analysis/Inputs/ |
H A D | system-header-simulator-cxx.h | 198 storage.assignExternal(new _CharT[4]); 203 void* operator new(std::size_t, const std::nothrow_t&) throw(); 204 void* operator new[](std::size_t, const std::nothrow_t&) throw(); 208 void* operator new (std::size_t size, void* ptr) throw() { return ptr; }; 209 void* operator new[] (std::size_t size, void* ptr) throw() { return ptr; };
|
/external/clang/test/CodeGenCXX/ |
H A D | 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_ [all...] |
/external/pdfium/core/include/fxcrt/ |
H A D | 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(fxAllocato [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | token.rb | 213 CommonToken = Struct.new( :type, :channel, :text, :input, :start, 259 new( *args ) 264 new( 288 EOF_TOKEN = CommonToken.new( EOF ).freeze 289 INVALID_TOKEN = CommonToken.new( INVALID_TOKEN_TYPE ).freeze 290 SKIP_TOKEN = CommonToken.new( INVALID_TOKEN_TYPE ).freeze 329 CommonTokenStream.new( self, options ) { | t, stream | yield( t, stream ) } 331 CommonTokenStream.new( self, options ) 363 token_class.new( *args ) do |*targs| 367 token_class.new( *arg 502 def self.new( tk_class = nil, &body ) singleton method in class:ANTLR3.with.ARecognizerOrSuch.provided.TokenScheme [all...] |
/external/bsdiff/ |
H A D | bsdiff.c | 142 static off_t matchlen(u_char *old,off_t oldsize,u_char *new,off_t newsize) argument 147 if(old[i]!=new[i]) break; 153 u_char *new,off_t newsize,off_t st,off_t en,off_t *pos) 158 x=matchlen(old+I[st],oldsize-I[st],new,newsize); 159 y=matchlen(old+I[en],oldsize-I[en],new,newsize); 171 if(memcmp(old+I[x],new,MIN(oldsize-I[x],newsize))<0) { 172 return search(I,old,oldsize,new,newsize,x,en,pos); 174 return search(I,old,oldsize,new,newsize,st,x,pos); 199 u_char *old,*new; local 238 ((new 152 search(off_t *I,u_char *old,off_t oldsize, u_char *new,off_t newsize,off_t st,off_t en,off_t *pos) argument [all...] |
/external/chromium_org/base/memory/ |
H A D | scoped_ptr_unittest.cc | 55 void* operator new(size_t size) { 91 return scoped_ptr<ConDecLogger>(new ConDecLogger(constructed)); 109 scoped_ptr<ConDecLogger> scoper(new ConDecLogger(&constructed)); 121 scoped_ptr<ConDecLogger> scoper(new ConDecLogger(&constructed)); 125 scoper.reset(new ConDecLogger(&constructed)); 133 scoper.reset(new ConDecLogger(&constructed)); 143 scoper.reset(new ConDecLogger(&constructed)); 156 ConDecLogger* logger = new ConDecLogger(&constructed); 177 scoped_ptr<ConDecLogger> scoper(new ConDecLogger(&constructed)); 194 scoped_ptr<ConDecLogger> scoper(new ConDecLogge [all...] |