/external/clang/test/CodeGenCXX/ |
new-overflow.cpp | 12 typedef A elt; typedef in namespace:test0 22 elt *test(short s) { 23 return new elt[s]; 34 typedef A elt[100]; typedef in namespace:test1 45 elt *test(short s) { 46 return new elt[s]; 58 typedef A elt[100]; typedef in namespace:test2 73 elt *test(short s) { 74 return new elt[s]; 84 typedef A elt; typedef in namespace:test4 103 typedef A elt; typedef in namespace:test5 123 typedef A elt; typedef in namespace:test6 145 typedef A elt[100]; typedef in namespace:test7 168 typedef A elt; typedef in namespace:test8 193 typedef A elt; typedef in namespace:test9 [all...] |
/bionic/libc/upstream-netbsd/lib/libc/include/isc/ |
list.h | 29 #define INIT_LINK_TYPE(elt, link, type) \ 31 (elt)->link.prev = (type *)(-1); \ 32 (elt)->link.next = (type *)(-1); \ 34 #define INIT_LINK(elt, link) \ 35 INIT_LINK_TYPE(elt, link, void) 36 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \ 37 (void *)((elt)->link.next) != (void *)(-1)) 43 #define PREPEND(list, elt, link) \ 45 INSIST(!LINKED(elt, link)); [all...] |
/external/webrtc/webrtc/libjingle/xmllite/ |
xmlelement_unittest.cc | 30 XmlElement elt(QName("google:test", "first")); 31 EXPECT_EQ("<test:first xmlns:test=\"google:test\"/>", elt.Str()); 38 XmlElement elt(QName("google:test", "root"), true); 39 elt.AddElement(new XmlElement(QName("google:test", "first"))); 40 elt.AddElement(new XmlElement(QName("google:test", "nested")), 1); 41 elt.AddText("nested-value", 2); 42 elt.AddText("between-", 1); 43 elt.AddText("value", 1); 44 elt.AddElement(new XmlElement(QName("google:test", "nested2")), 1); 45 elt.AddElement(new XmlElement(QName("google:test", "second"))) [all...] |
xmlprinter_unittest.cc | 28 XmlElement elt(QName("google:test", "first")); 30 XmlPrinter::PrintXml(&ss, &elt); 35 XmlElement elt(QName("google:test", "first")); 36 elt.AddElement(new XmlElement(QName("nested:test", "second"))); 43 XmlPrinter::PrintXml(&ss, &elt, &ns_stack);
|
/external/elfutils/config/ |
known-dwarf.awk | 31 elt = fields[1]; 33 DW[set] = DW[set] "," elt; 35 DW[set] = elt; 49 elt = elts[j]; 50 if (elt ~ /(low?|hi|high)_user$/) 52 print " DWARF_ONE_KNOWN_DW_" set " (" elt ", DW_" set "_" elt ") \\";
|
/external/bison/lib/ |
lbitset.c | 95 lbitset_elt *elt; local 99 elt = lbitset_free_list; 100 lbitset_free_list = elt->next; 136 elt = (lbitset_elt *) obstack_alloc (&lbitset_obstack, 140 return elt; 148 lbitset_elt *elt; local 150 elt = lbitset_elt_alloc (); 151 memset (elt->words, 0, sizeof (elt->words)); 152 return elt; 322 lbitset_elt *elt; local 390 lbitset_elt *elt; local 448 lbitset_elt *elt; local 578 lbitset_elt *elt; local 670 lbitset_elt *elt; local 866 lbitset_elt *elt; local 894 lbitset_elt *elt; local 916 lbitset_elt *elt; local 1378 lbitset_elt *elt; local [all...] |
ebitset.c | 94 #define EBITSET_NEXT(ELT) ((ELT)->u.next) 95 #define EBITSET_WORDS(ELT) ((ELT)->u.words) 183 ebitset_elt *elt; local 187 elt = ebitset_free_list; 188 ebitset_free_list = EBITSET_NEXT (elt); 224 elt = (ebitset_elt *) obstack_alloc (&ebitset_obstack, 228 return elt; 236 ebitset_elt *elt; local 257 ebitset_elt *elt; local 298 ebitset_elt *elt; local 361 ebitset_elt *elt = elts[j]; local 402 ebitset_elt *elt = elts[j]; local 608 ebitset_elt *elt; local 663 ebitset_elt *elt; local 848 ebitset_elt *elt; local 877 ebitset_elt *elt; local 904 ebitset_elt *elt = elts[j]; local [all...] |
/prebuilts/gdb/darwin-x86/lib/python2.7/compiler/ |
misc.py | 4 for elt in tup: 5 if isinstance(elt, tuple): 6 elts = elts + flatten(elt) 8 elts.append(elt) 16 def __contains__(self, elt): 17 return elt in self.elts 18 def add(self, elt): 19 self.elts[elt] = elt 22 def has_elt(self, elt) [all...] |
/prebuilts/gdb/linux-x86/lib/python2.7/compiler/ |
misc.py | 4 for elt in tup: 5 if isinstance(elt, tuple): 6 elts = elts + flatten(elt) 8 elts.append(elt) 16 def __contains__(self, elt): 17 return elt in self.elts 18 def add(self, elt): 19 self.elts[elt] = elt 22 def has_elt(self, elt) [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
misc.py | 4 for elt in tup: 5 if isinstance(elt, tuple): 6 elts = elts + flatten(elt) 8 elts.append(elt) 16 def __contains__(self, elt): 17 return elt in self.elts 18 def add(self, elt): 19 self.elts[elt] = elt 22 def has_elt(self, elt) [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
misc.py | 4 for elt in tup: 5 if isinstance(elt, tuple): 6 elts = elts + flatten(elt) 8 elts.append(elt) 16 def __contains__(self, elt): 17 return elt in self.elts 18 def add(self, elt): 19 self.elts[elt] = elt 22 def has_elt(self, elt) [all...] |
/external/chromium-trace/catapult/third_party/py_vulcanize/third_party/rcssmin/docs/apidoc/ |
epydoc.js | 86 var elt = document.getElementById(id); 87 if (elt.style.display == "none") 88 elt.style.display = "block"; 90 elt.style.display = "none"; 93 var elt = document.getElementById(id+"-expanded"); 94 if (elt) elt.style.display = "block"; 95 var elt = document.getElementById(id+"-expanded-linenums"); 96 if (elt) elt.style.display = "block" [all...] |
/external/chromium-trace/catapult/third_party/py_vulcanize/third_party/rjsmin/docs/apidoc/ |
epydoc.js | 86 var elt = document.getElementById(id); 87 if (elt.style.display == "none") 88 elt.style.display = "block"; 90 elt.style.display = "none"; 93 var elt = document.getElementById(id+"-expanded"); 94 if (elt) elt.style.display = "block"; 95 var elt = document.getElementById(id+"-expanded-linenums"); 96 if (elt) elt.style.display = "block" [all...] |
/external/icu/icu4c/source/layout/ |
ExtensionSubtables.cpp | 34 le_uint16 elt = SWAPW(extensionLookupType); local 36 if (elt != lookupType) { 41 return lookupProcessor->applySubtable(subtable, elt, glyphIterator, fontInstance, success);
|
/external/dagger2/compiler/src/it/functional-tests/src/main/java/test/ |
ParentModule.java | 13 for (A elt : c) { 14 list.add(elt);
|
/external/valgrind/include/ |
pub_tool_deduppoolalloc.h | 96 /* Allocates a new element from ddpa with eltSzB bytes to store elt. 98 If ddpa already contains an element equal to elt, then the address of 101 So, if void *elt points to a struct, be sure to initialise all components 104 SizeT eltSzB, const void *elt); 109 of an already existing identical element to elt. */ 111 SizeT eltSzB, const void *elt);
|
/toolchain/binutils/binutils-2.25/binutils/ |
binemul.c | 67 bfd *elt; local 70 for (elt = bfd_openr_next_archived_file (new_bfd, NULL); 71 elt; 72 elt = bfd_openr_next_archived_file (new_bfd, elt)) 74 if (do_ar_emul_append (after_bfd, elt, verbose, TRUE, check))
|
/prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
test_code.py | 90 for elt in t: 91 r = repr(elt) 93 yield "<code object %s>" % elt.co_name
|
/prebuilts/gdb/linux-x86/lib/python2.7/test/ |
test_code.py | 90 for elt in t: 91 r = repr(elt) 93 yield "<code object %s>" % elt.co_name
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
test_code.py | 90 for elt in t: 91 r = repr(elt) 93 yield "<code object %s>" % elt.co_name
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
test_code.py | 90 for elt in t: 91 r = repr(elt) 93 yield "<code object %s>" % elt.co_name
|
/external/valgrind/coregrind/ |
m_deduppoolalloc.c | 62 UChar *curpool_free; /* Pos in current pool to allocate next elt. 79 const void *elt; member in struct:_ht_node 144 // Grow (* 2) the current (fixed elt) pool 159 n->elt = (void*)((Addr)n->elt + reloc_offset); 193 return VG_(memcmp) (hnode1->elt, hnode2->elt, hnode1->eltSzB); 251 const void *elt) 262 ht_elt.key = sdbm_hash (elt, eltSzB); 265 ht_elt.elt = elt [all...] |
/prebuilts/gdb/darwin-x86/lib/python2.7/ |
sets.py | 165 for elt in self: 166 data[deepcopy(elt, memo)] = value 241 for elt in ifilterfalse(otherdata.__contains__, selfdata): 242 data[elt] = value 243 for elt in ifilterfalse(selfdata.__contains__, otherdata): 244 data[elt] = value 268 for elt in ifilterfalse(otherdata.__contains__, self): 269 data[elt] = value 294 for elt in ifilterfalse(other._data.__contains__, self): 303 for elt in ifilterfalse(self._data.__contains__, other) [all...] |
/prebuilts/gdb/linux-x86/lib/python2.7/ |
sets.py | 165 for elt in self: 166 data[deepcopy(elt, memo)] = value 241 for elt in ifilterfalse(otherdata.__contains__, selfdata): 242 data[elt] = value 243 for elt in ifilterfalse(selfdata.__contains__, otherdata): 244 data[elt] = value 268 for elt in ifilterfalse(otherdata.__contains__, self): 269 data[elt] = value 294 for elt in ifilterfalse(other._data.__contains__, self): 303 for elt in ifilterfalse(self._data.__contains__, other) [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
sets.py | 165 for elt in self: 166 data[deepcopy(elt, memo)] = value 241 for elt in ifilterfalse(otherdata.__contains__, selfdata): 242 data[elt] = value 243 for elt in ifilterfalse(selfdata.__contains__, otherdata): 244 data[elt] = value 268 for elt in ifilterfalse(otherdata.__contains__, self): 269 data[elt] = value 294 for elt in ifilterfalse(other._data.__contains__, self): 303 for elt in ifilterfalse(self._data.__contains__, other) [all...] |