/external/llvm/include/llvm/ |
H A D | LinkAllIR.h | 47 (void)new llvm::Module("", Context); 48 (void)new llvm::UnreachableInst(Context);
|
/external/swiftshader/third_party/LLVM/include/llvm/ |
H A D | LinkAllVMCore.h | 46 (void)new llvm::Module("", llvm::getGlobalContext()); 47 (void)new llvm::UnreachableInst(llvm::getGlobalContext());
|
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/ |
H A D | nuances.rb | 28 lexer = EmptyAlt::Lexer.new( 'foo' ) 29 parser = EmptyAlt::Parser.new lexer 58 lexer = Subrule::Lexer.new( 'BEGIN A END' ) 59 parser = Subrule::Parser.new lexer 95 lexer = SpecialStates::Lexer.new 'foo' 96 parser = SpecialStates::Parser.new lexer 101 lexer = SpecialStates::Lexer.new 'foo name1' 102 parser = SpecialStates::Parser.new lexer 107 lexer = SpecialStates::Lexer.new 'bar name1' 108 parser = SpecialStates::Parser.new lexe [all...] |
/external/tcpdump/ |
H A D | makemib | 177 # add a new object to the tree 179 # new OBJECT IDENTIFIER ::= { parent value } 182 function oidadd(new, parent, value) { 187 print "/* oidadd" inn(FILENAME) ":", new, "in", parent, "as", value, "line", $0, "*/" 189 gsub(/[-&\/]/,"",new) 194 inn(FILENAME), parent, new, value 198 if (oid[new] > 0 && oid[new] != value) { 200 inn(FILENAME), parent, new, value, oid[new] [all...] |
/external/compiler-rt/test/cfi/ |
H A D | utils.h | 22 break_optimization(new Deriver<T, I-1>); 38 break_optimization(new Deriver<T, 0>); 55 break_optimization(new Deriver<T, 10>); 59 break_optimization(new Deriver<T, 25>); 63 break_optimization(new Deriver<T, 40>);
|
/external/llvm/lib/Target/NVPTX/ |
H A D | NVPTXTargetObjectFile.h | 50 TextSection = new NVPTXSection(MCSection::SV_ELF, SectionKind::getText()); 51 DataSection = new NVPTXSection(MCSection::SV_ELF, SectionKind::getData()); 52 BSSSection = new NVPTXSection(MCSection::SV_ELF, SectionKind::getBSS()); 54 new NVPTXSection(MCSection::SV_ELF, SectionKind::getReadOnly()); 57 new NVPTXSection(MCSection::SV_ELF, SectionKind::getMetadata()); 59 new NVPTXSection(MCSection::SV_ELF, SectionKind::getMetadata()); 61 new NVPTXSection(MCSection::SV_ELF, SectionKind::getMetadata()); 63 new NVPTXSection(MCSection::SV_ELF, SectionKind::getMetadata()); 65 new NVPTXSection(MCSection::SV_ELF, SectionKind::getMetadata()); 67 new NVPTXSectio [all...] |
/external/syslinux/gpxe/src/include/gpxe/ |
H A D | list.h | 42 * Insert a new entry between two known consecutive entries. 47 static inline void __list_add ( struct list_head *new, argument 50 next->prev = new; 51 new->next = next; 52 new->prev = prev; 53 prev->next = new; 57 * Add a new entry to the head of a list 59 * @v new New entry to be added 62 * Insert a new entry after the specified head. This is good for 65 static inline void list_add ( struct list_head *new, struc argument 83 list_add_tail( struct list_head *new, struct list_head *head ) argument [all...] |
/external/blktrace/btt/ |
H A D | list.h | 50 * Insert a new entry between two known consecutive entries. 55 static inline void __list_add(struct list_head *new, argument 59 next->prev = new; 60 new->next = next; 61 new->prev = prev; 62 prev->next = new; 66 * list_add - add a new entry 67 * @new: new entry to be added 70 * Insert a new entr 73 list_add(struct list_head *new, struct list_head *head) argument 86 list_add_tail(struct list_head *new, struct list_head *head) argument 223 list_replace(struct list_head *old, struct list_head *new) argument 232 list_replace_init(struct list_head *old, struct list_head *new) argument [all...] |
/external/toybox/lib/ |
H A D | dirtree.c | 103 // If !new return DIRTREE_ABORTVAL 105 struct dirtree *dirtree_handle_callback(struct dirtree *new, argument 110 if (!new) return DIRTREE_ABORTVAL; 111 if (!callback) return new; 112 flags = callback(new); 114 if (S_ISDIR(new->st.st_mode) && (flags & (DIRTREE_RECURSE|DIRTREE_COMEAGAIN))) 115 flags = dirtree_recurse(new, callback, 116 openat(dirtree_parentfd(new), new->name, O_CLOEXEC), flags); 120 free(new); 133 struct dirtree *new, **ddt = &(node->child); local [all...] |
H A D | llist.c | 67 void dlist_add_nomalloc(struct double_list **list, struct double_list *new) argument 70 new->next = *list; 71 new->prev = (*list)->prev; 72 (*list)->prev->next = new; 73 (*list)->prev = new; 74 } else *list = new->next = new->prev = new; 81 struct double_list *new = xmalloc(sizeof(struct double_list)); local 83 new [all...] |
/external/ipsec-tools/src/racoon/ |
H A D | str2val.c | 55 caddr_t new; local 59 if ((new = racoon_malloc(len)) == 0) return(0); 62 snprintf(&new[j], len - j, "%02x", (u_char)buf[i]); 65 new[j++] = ' '; 66 new[j] = '\0'; 69 new[j] = '\0'; 71 return(new);
|
/external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/ |
H A D | complexityMeasures.m | 22 new=zeros(frames,functionOrder); 26 new(i,st(j,2)) = new(i,st(j,2)) + st(j,1); 32 nonzeroelements = find(new(1:end,i)>0); 36 % result(i,2)=(sum(new(nonzeroelements,i))/(length(nonzeroelements)*0.03))/1000000; 40 % result(i,3)=(max(new(1:end,i))/0.03)/1000000; 41 result(i,3)=(max(new(1:size(new,1)/2,i))/0.03)/1000000 + (max(new(size(new, [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | kernel-list.h | 29 * Insert a new entry between two known consecutive entries. 34 static __inline__ void __list_add(struct list_head * new, argument 38 next->prev = new; 39 new->next = next; 40 new->prev = prev; 41 prev->next = new; 45 * Insert a new entry after the specified head.. 47 static __inline__ void list_add(struct list_head *new, struct list_head *head) argument 49 __list_add(new, head, head->next); 53 * Insert a new entr 55 list_add_tail(struct list_head *new, struct list_head *head) argument [all...] |
/external/valgrind/tests/ |
H A D | filter_libc | 27 s/(at.*)__builtin_new/$1...operator new.../; 28 s/(at.*)operator new\(unsigned(| int| long)\)/$1...operator new.../; 30 s/(at.*)__builtin_vec_new/$1...operator new.../; 31 s/(at.*)operator new\[\]\(unsigned(| int| long)\)/$1...operator new[].../;
|
/external/webrtc/talk/media/devices/ |
H A D | videorendererfactory.h | 49 return new GtkVideoRenderer(x, y); 52 CarbonVideoRenderer* renderer = new CarbonVideoRenderer(x, y); 61 return new GdiVideoRenderer(x, y);
|
/external/webrtc/webrtc/base/ |
H A D | windowpickerfactory.h | 38 return new Win32WindowPicker(); 40 return new MacWindowPicker(); 42 return new X11WindowPicker();
|
/external/kmod/libkmod/ |
H A D | libkmod-list.c | 113 struct kmod_list *new; local 115 new = malloc(sizeof(*new)); 116 if (new == NULL) 119 new->data = (void *)data; 120 list_node_append(list ? &list->node : NULL, &new->node); 122 return list ? list : new; 128 struct kmod_list *new; local 133 new = malloc(sizeof(*new)); 146 struct kmod_list *new; local 177 struct kmod_list *new; local [all...] |
/external/llvm/test/MC/Hexagon/ |
H A D | asmMap.s | 221 #CHECK: 39cfe072 if (!p3.new) memw(r15{{ *}}+{{ *}}#0)=#-14 224 if (!p3.new) memw(r15)=#-14 227 #CHECK: 3959e06b if (p3.new) memw(r25{{ *}}+{{ *}}#0)=#-21 230 if (p3.new) memw(r25)=#-21 233 #CHECK: 4312c801 if (p1.new) r1 = memb(r18{{ *}}+{{ *}}#0) 235 if (p1.new) r1=memb(r18) 239 #CHECK: 4718d803 if (!p3.new) r3 = memb(r24{{ *}}+{{ *}}#0) 241 if (!p3.new) r3=memb(r24) 245 #CHECK: 4326c81b if (p1.new) r27 = memub(r6{{ *}}+{{ *}}#0) 247 if (p1.new) r2 [all...] |
H A D | fixups.s | 6 # CHECK: if (!cmp.eq(r1.new, #1)) jump:t 0xc 9 if (!cmp.eq(r1.new, #1)) jump:t .L1 18 # CHECK: if (!cmp.eq(r1.new, #1)) jump:t 0x81c 21 if (!cmp.eq(r1.new, #1)) jump:t .L2
|
/external/ImageMagick/PerlMagick/t/ |
H A D | blob.t | 25 $image = new Image::Magick; 30 $image=Image::Magick->new( magick=>'MIFF' );
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/modes/ |
H A D | ast-builder.rb | 19 AST::CommonTreeAdaptor.new( token_class ) 29 AST::RewriteRuleSubtreeStream.new( @adaptor, desc, element ) 33 AST::RewriteRuleTokenStream.new( @adaptor, desc, element ) 37 AST::RewriteRuleNodeStream.new( @adaptor, desc, element )
|
/external/lzma/CPP/Common/ |
H A D | NewHandler.h | 7 This file must be included before any code that uses operators "delete" or "new".
9 The operator "new" in MSVC 6.0 doesn't throw exception "bad_alloc".
10 So we define another version of operator "new" that throws "CNewException" on failure.
12 If you use compiler that throws exception in "new" operator (GCC or new version of MSVC),
15 It's still allowed to use redefined version of operator "new" from "NewHandler.cpp"
18 that redefined version of operator "new" (that throws CNewException) is not
42 operator new(size_t size);
58 operator new[](size_t size);
|
/external/parameter-framework/upstream/parameter/ |
H A D | ElementBuilderTemplate.h | 38 virtual CElement *createElement(const CXmlElement & /*elem*/) const { return new ElementType; }
|
H A D | NamedElementBuilderTemplate.h | 40 return new ElementType(xmlElement.getNameAttribute());
|
/external/protobuf/ruby/tests/ |
H A D | generated_code_test.rb | 15 m = A::B::C::TestMessage.new()
|