| /external/zlib/ |
| zutil.c | 208 local ptr_table table[MAX_PTR]; variable
209 /* This table is used to remember the original form of pointers
211 * Since MSDOS is not a preemptive multitasking OS, this table is not
231 table[next_ptr].org_ptr = buf;
236 table[next_ptr++].new_ptr = buf;
249 if (ptr != table[n].new_ptr) continue;
251 farfree(table[n].org_ptr);
253 table[n-1] = table[n];
|
| /libcore/luni/src/main/native/ |
| libcore_icu_TimeZones.cpp | 126 std::vector<TimeZoneNames> table; local
143 table.push_back(row);
175 table.push_back(row);
184 for (size_t i = 0; i < table.size(); ++i) {
185 TimeZoneNames& row(table[i]);
|
| /packages/apps/Contacts/tests/src/com/android/contacts/tests/allintents/ |
| ResultActivity.java | 178 TableLayout table = (TableLayout)findViewById(R.id.table); local
182 table.addView(row);
188 TableLayout table = (TableLayout)findViewById(R.id.table); local
194 table.addView(separator);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/pages/ |
| ApplicationAttributesPart.java | 98 Composite table = getTable(); local
99 if (table == null || managedForm == null) {
104 for (Control c : table.getChildren()) {
129 ui_attr.createUiControl(table, managedForm);
141 createLabel(table, managedForm.getToolkit(),
164 Composite table = getTable(); local
166 if (table != null && table.getEnabled() != exists) {
167 table.setEnabled(exists);
168 for (Control c : table.getChildren())
[all...] |
| /sdk/monkeyrunner/src/com/android/monkeyrunner/controller/ |
| VariableFrame.java | 42 import javax.swing.table.AbstractTableModel;
151 JTable table = new JTable(tableModel); local
152 add(table);
|
| /external/bouncycastle/src/main/java/org/bouncycastle/jce/provider/ |
| JDKKeyStore.java | 88 protected Hashtable table = new Hashtable(); field in class:JDKKeyStore
489 return table.keys();
495 return (table.get(alias) != null);
502 Object entry = table.get(alias);
515 table.remove(alias);
521 StoreEntry entry = (StoreEntry)table.get(alias);
546 Enumeration e = table.elements();
577 StoreEntry entry = (StoreEntry)table.get(alias);
589 StoreEntry entry = (StoreEntry)table.get(alias);
604 StoreEntry entry = (StoreEntry)table.get(alias)
[all...] |
| /bionic/libc/bionic/ |
| pthread-timers.c | 122 /** GLOBAL TABLE OF THREAD TIMERS
232 /* the static timer table - we only create it if the process
267 thr_timer_table_t* table = __timer_table_get(); local
268 thr_timer_table_start_stop(table, stop);
275 thr_timer_table_t* table = __timer_table_get(); local
276 thr_timer_t* timer = thr_timer_table_from_id( table, id, 0 );
329 thr_timer_table_t* table = __timer_table_get(); local
330 thr_timer_t* timer = thr_timer_table_alloc( table );
385 thr_timer_table_t* table = __timer_table_get(); local
386 thr_timer_t* timer = thr_timer_table_from_id(table, id, 1)
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/file/ |
| CatchStructs.java | 49 * {@code null-ok;} the underlying table; set in
52 private CatchTable table; field in class:CatchStructs
79 this.table = null;
89 if (table == null) {
90 table = code.getCatches();
101 return table.size();
123 int size = table.size();
132 handlerOffsets.put(table.get(i).getHandlers(), null);
202 int tableSize = table.size();
204 CatchTable.Entry one = table.get(i)
[all...] |
| /dalvik/dx/src/com/android/dx/dex/file/ |
| CatchStructs.java | 47 * {@code null-ok;} the underlying table; set in
50 private CatchTable table; field in class:CatchStructs
77 this.table = null;
87 if (table == null) {
88 table = code.getCatches();
99 return table.size();
121 int size = table.size();
130 handlerOffsets.put(table.get(i).getHandlers(), null);
200 int tableSize = table.size();
202 CatchTable.Entry one = table.get(i)
[all...] |
| /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/ |
| Security2Test.java | 58 // to the allSupported table then increment the count of the
127 * @param table
130 private void addOrIncrementTable(Hashtable table, String key) {
131 if (table.containsKey(key)) {
132 Integer before = (Integer) table.get(key);
133 table.put(key, new Integer(before.intValue() + 1));
135 table.put(key, new Integer(1));
|
| /external/chromium/chrome/browser/ui/gtk/ |
| content_setting_bubble_gtk.cc | 131 GtkWidget* table = gtk_table_new(popup_items.size(), 2, FALSE); local
149 gtk_table_attach(GTK_TABLE(table), event_box, 0, 1, row, row + 1,
159 gtk_table_attach(GTK_TABLE(table), button, 1, 2, row, row + 1,
164 gtk_box_pack_start(GTK_BOX(bubble_content), table, FALSE, FALSE, 0); local
|
| /external/e2fsprogs/e2fsck/ |
| revoke.c | 89 /* The revoke table is just a simple hash table of revoke records. */
92 /* It is conceivable that we might want a larger hash table
107 /* Utility functions to maintain the revoke table */
112 struct jbd_revoke_table_s *table = journal->j_revoke; local
113 int hash_shift = table->hash_shift;
117 (block << (hash_shift - 12))) & (table->hash_size - 1);
152 /* Find a revoke record in the journal's hash table. */
198 /* Initialise the revoke table for a given journal to a given size. */
235 /* Destoy a journal's revoke table. The table must already be empty! *
239 struct jbd_revoke_table_s *table; local
[all...] |
| /external/freetype/src/pshinter/ |
| pshglob.c | 39 /* scale the widths/heights table */
182 /* insert into sorted table */
271 /* sanitize top table */
294 /* sanitize bottom table */
364 /* reset the blues table when the device transform changes */
372 PSH_Blue_Table table = 0; local
437 table = &blues->normal_top;
440 table = &blues->normal_bottom;
443 table = &blues->family_top;
446 table = &blues->family_bottom
531 PSH_Blue_Table table; local
[all...] |
| /external/freetype/src/sfnt/ |
| ttload.c | 46 /* Looks for a TrueType table by name. */
54 /* A pointer to the table directory entry. 0 if not found. */
85 FT_TRACE4(( "found table.\n" ));
96 FT_TRACE4(( "ignoring empty table\n" ));
98 FT_TRACE4(( "could not find table\n" ));
111 /* Looks for a TrueType table by name, then seek a stream to it. */
118 /* stream :: The stream to seek when the table is found. */
121 /* length :: The length of the table if found, undefined otherwise. */
132 TT_Table table; local
136 table = tt_face_lookup_table( face, tag )
197 TT_TableRec table; local
473 TT_Table table; local
746 TT_NameTable table; local
871 TT_NameTable table = &face->name_table; local
[all...] |
| /external/guava/src/com/google/common/collect/ |
| ImmutableSet.java | 256 Object[] table = new Object[tableSize]; local
267 Object value = table[index];
270 table[index] = element;
284 // Resize the table when the iterable includes too many duplicates.
288 elements.toArray(), hashCode, table, mask);
|
| RegularImmutableMap.java | 35 private final transient Object[] table; // alternating keys and values field in class:RegularImmutableMap
36 // 'and' with an int then shift to get a table index
48 table = new Object[tableSize * 2];
58 Object existing = table[index];
61 table[index] = key;
62 table[index + 1] = value;
79 Object candidate = table[index];
86 V value = (V) table[index + 1];
|
| /external/icu4c/i18n/ |
| uspoof_conf.cpp | 50 // be stored in that order in the final string table.
53 // list because that will be the ordering of our runtime table.
55 // 4. Generate the run time string table. This is generated before the key & value
230 // Capture Group 3-6 the table type, SL, SA, ML, or MA
239 "\\s*(?:(SL)|(SA)|(ML)|(MA))" // Match the table type
270 // put them into the appropriate mapping table.
294 // Add the UChar32 -> string mapping to the appropriate table.
295 UHashtable *table = uregex_start(fParseLine, 3, &status) >= 0 ? fSLTable : local
300 U_ASSERT(table != NULL);
301 uhash_iput(table, keyChar, smapString, &status)
[all...] |
| uspoof_wsconf.cpp | 46 // | | | |---- Which table, Any Case or Lower Case (A or L)
62 "\\s*(?:(A)|(L))" // The table A or L. Group 6 or 7
210 // select the table - (A) any case or (L) lower case only
211 UTrie2 *table = anyCaseTrie; local
213 table = lowerCaseTrie;
225 int32_t setIndex = utrie2_get32(table, cp);
237 bsset->trie = table;
247 utrie2_set32(table, cp, setIndex, &status);
|
| /external/icu4c/test/letest/ |
| PortableFontInstance.cpp | 114 // read unitsPerEm from 'head' table
189 le_uint16 table = 0; local
193 table = fDirExtra;
199 if (SWAPL(fDirectory->tableDirectory[table + probe].tag) <= tag) {
200 table += probe;
204 if (SWAPL(fDirectory->tableDirectory[table].tag) == tag) {
205 return &fDirectory->tableDirectory[table];
223 void *table = NEW_ARRAY(char, *length); local
225 if (table != NULL) {
227 fread(table, sizeof(char), *length, fFile)
[all...] |
| /external/icu4c/tools/icuswap/ |
| icuswap.cpp | 351 ToCEntry *table; local
429 /* check that the itemCount fits, then the ToC table, then at least the header of the last item */
440 /* ToC table does not fit */
505 * Allocate the ToC table and, if necessary, a temporary buffer for
515 * not only the ToC table but also the data items themselves.
523 table=(ToCEntry *)uprv_malloc(itemCount*sizeof(ToCEntry)+length+DEFAULT_PADDING_LENGTH);
524 if(table!=NULL) {
525 outBytes=(uint8_t *)(table+itemCount);
532 table=(ToCEntry *)uprv_malloc(itemCount*sizeof(ToCEntry));
534 if(table==NULL)
[all...] |
| /external/iproute2/include/linux/ |
| fib_rules.h | 24 __u8 table; member in struct:fib_rule_hdr
49 FRA_TABLE, /* Extended table id */
59 FR_ACT_TO_TBL, /* Pass to fixed table */
|
| /external/iproute2/netem/ |
| maketable.c | 2 * Experimental data distribution table generator
7 * From this, create the inverse distribution table used to approximate
73 /* Create a (normalized) distribution table from a set of observed
74 * values. The table is fixed to run from (as it happens) -4 to +4,
95 int *table; local
99 table = calloc(DISTTABLESIZE, sizeof(int));
100 if (!table) {
101 perror("table alloc");
112 ++table[index];
118 return table;
202 int *table; local
[all...] |
| /external/libxml2/ |
| entities.c | 198 * xmlAddEntity : register a new entity for an entities table.
205 xmlEntitiesTablePtr table = NULL; local
221 table = dtd->entities;
227 table = dtd->pentities;
232 if (table == NULL)
239 if (xmlHashAddEntry(table, name, ret)) {
423 * @table: an entity table
427 * Do an entity lookup in the table.
433 xmlGetEntityFromTable(xmlEntitiesTablePtr table, const xmlChar *name)
449 xmlEntitiesTablePtr table; local
480 xmlEntitiesTablePtr table; local
505 xmlEntitiesTablePtr table; local
[all...] |
| hash.c | 35 * A single entry in the hash table
49 * The entire hash table
52 struct _xmlHashEntry *table; member in struct:_xmlHashTable
63 xmlHashComputeKey(xmlHashTablePtr table, const xmlChar *name,
84 return (value % table->size);
88 xmlHashComputeQKey(xmlHashTablePtr table,
133 return (value % table->size);
138 * @size: the size of the hash table
146 xmlHashTablePtr table; local
151 table = xmlMalloc(sizeof(xmlHashTable))
177 xmlHashTablePtr table; local
[all...] |
| /external/libxslt/libxslt/ |
| keys.c | 148 * @keyt: an XSLT key table
169 * @keyt: an XSLT key table list
414 xsltKeyTablePtr table; local
439 table = (xsltKeyTablePtr) ctxt->document->keys;
440 while (table != NULL) {
441 if (((nameURI != NULL) == (table->nameURI != NULL)) &&
442 xmlStrEqual(table->name, name) &&
443 xmlStrEqual(table->nameURI, nameURI))
445 ret = (xmlNodeSetPtr)xmlHashLookup(table->keys, value);
448 table = table->next
533 xsltKeyTablePtr table; local
605 xsltKeyTablePtr table; local
[all...] |
