/dalvik/libcore/sql/src/main/java/SQLite/ |
H A D | BusyHandler.java | 10 * Invoked when a table is locked by another process 12 * until the table becomes unlocked, or false in order 15 * @param table the name of the locked table 16 * @param count number of times the table was locked 19 public boolean busy(String table, int count); argument
|
H A D | Database.java | 171 * an SQLite table is locked. 185 * Set the timeout for waiting for an SQLite table to become 498 * @param table table name 505 public Blob open_blob(String db, String table, String column, argument 509 _open_blob(db, table, column, row, rw, blob); 552 * @param table table name 559 private native void _open_blob(String db, String table, String column, argument
|
/dalvik/libcore/luni/src/main/java/java/util/ |
H A D | ListResourceBundle.java | 29 HashMap<String, Object> table; field in class:ListResourceBundle 58 Iterator<String> local = table.keySet().iterator(); 70 if (!table.containsKey(next)) { 100 Iterator<String> it = table.keySet().iterator(); 119 return table.get(key); 123 if (table == null) { 125 table = new HashMap<String, Object>(contents.length / 3 * 4 + 3); 130 table.put((String) content[0], content[1]);
|
H A D | HashMap.java | 69 * An empty table shared by all zero-capacity maps (typically from default 72 * minimum-sized table. 90 * The hash table. If this hash map contains a mapping for null, it is 91 * not represented this hash table. 93 transient HashMapEntry<K, V>[] table; field in class:HashMap 112 * The table is rehashed when its size exceeds this threshold. 129 table = (HashMapEntry<K, V>[]) EMPTY_TABLE; 149 table = tab; 244 result.makeTable(table.length); 305 HashMapEntry<K, V>[] tab = table; [all...] |
H A D | Hashtable.java | 55 * An empty table shared by all zero-capacity maps (typically from default 58 * minimum-sized table. 76 * The hash table. 78 private transient HashtableEntry<K, V>[] table; field in class:Hashtable 92 * The table is rehashed when its size exceeds this threshold. 110 table = (HashtableEntry<K, V>[]) EMPTY_TABLE; 129 table = tab; 223 result.makeTable(table.length); 271 HashtableEntry<K, V>[] tab = table; 299 HashtableEntry<K, V>[] tab = table; [all...] |
/dalvik/vm/ |
H A D | ReferenceTable.h | 18 * Maintain a table of references. Used for internal local references, 21 * None of the table functions are synchronized. 32 * If "allocEntries" is not equal to "maxEntries", the table may expand when 34 * pointers into "table" rather than offsets, use a fixed-size table. 37 * table/nextEntry is allowed.) 41 Object** table; /* bottom of the list */ member in struct:ReferenceTable 50 * If "initialCount" != "maxCount", the table will expand as required. 52 * Returns "false" if table allocation fails. 61 * You must call dvmInitReferenceTable() before you can re-use this table [all...] |
H A D | IndirectRefTable.h | 20 * Maintain a table of indirect references. Used for local/global JNI 23 * The table contains object references that are part of the GC root set. 30 * operations that allow us to operate on segments of the table, where 34 * a method returns. Additions to the table must be made in the current 40 * The GC must be able to scan the entire table quickly. 49 * - scanning the entire table straight through 51 * If there's more than one segment, we don't guarantee that the table 57 * the table is capped at 64K. 59 * None of the table functions are synchronized. 66 * We need a 16-bit table inde 189 Object** table; /* bottom of the stack */ member in struct:IndirectRefTable [all...] |
/dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/ |
H A D | DERUniversalString.java | 13 private static final char[] table = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' }; field in class:DERUniversalString 81 buf.append(table[(string[i] >>> 4) % 0xf]); 82 buf.append(table[string[i] & 0xf]);
|
H A D | DERBitString.java | 10 private static final char[] table = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' }; field in class:DERBitString 278 buf.append(table[(string[i] >>> 4) % 0xf]); 279 buf.append(table[string[i] & 0xf]);
|
/dalvik/libcore/security/src/test/java/org/apache/harmony/security/tests/java/security/ |
H A D | Security2Test.java | 70 // to the allSupported table then increment the count of the 139 * @param table 142 private void addOrIncrementTable(Hashtable<String, Integer> table, String key) { argument 143 if (table.containsKey(key)) { 144 Integer before = (Integer) table.get(key); 145 table.put(key, new Integer(before.intValue() + 1)); 147 table.put(key, new Integer(1));
|
/dalvik/dx/src/com/android/dx/dex/file/ |
H A D | 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 [all...] |
/dalvik/vm/alloc/ |
H A D | HeapTable.c | 66 LargeHeapRefTable *table; local 71 /* Make sure that a table with a free slot is 75 table = *tableP; 81 while (table != NULL && heapRefTableIsFull(&table->refs)) { 82 prevTable = table; 83 table = table->next; 85 if (table != NULL) { 87 /* Move the table t 134 LargeHeapRefTable *table; local 156 dvmHeapFreeLargeTable(LargeHeapRefTable *table) argument 168 LargeHeapRefTable *table; local 200 dvmHeapMarkLargeTableRefs(LargeHeapRefTable *table, bool stripLowBits) argument [all...] |
H A D | Heap.c | 84 /* Set up the table we'll use for ALLOC_NO_GC. 89 LOGE_HEAP("Can't allocate GC_NO_ALLOC table\n"); 222 LargeHeapRefTable *table; local 437 * we can't rely on the thread-local trackedAlloc table, so 571 * in this table, it will be scanned as part of the root 586 * If not, throw it in the nonCollectableRefs table, which 591 * in this table, it will be scanned as part of the root 701 //TODO: shrink if the table is very empty
|
/dalvik/libcore/luni/src/main/java/java/lang/ |
H A D | ThreadLocal.java | 62 Object[] table = values.table; 64 if (this.reference == table[index]) { 65 return (T) table[index + 1]; 140 * (hash & (table.length - 1)) points to a key and not a value. 166 private Object[] table; field in class:ThreadLocal.Values 196 this.table = fromParent.table.clone(); 211 Object[] table = this.table; [all...] |
/dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/x509/ |
H A D | X509Extensions.java | 159 private OrderedTable table = new OrderedTable(); field in class:X509Extensions 222 table.add(key, value); 228 * constructor from a table of extensions. 230 * it's is assumed the table contains OID/String pairs. 239 * Constructor from a table of extensions with ordering. 241 * It's is assumed the table contains OID/String pairs. 263 table.add(oid, ext); 288 table.add(oid, ext); 300 return table.getKeys(); 314 return (X509Extension)table [all...] |
/dalvik/libcore/support/src/test/java/org/apache/harmony/xnet/tests/support/ |
H A D | mySSLSession.java | 26 private Hashtable table; field in class:mySSLSession 37 table = new Hashtable(); 128 Object obj1 = table.put(s, obj); 142 Object obj = table.remove(s); 153 return table.get(s); 159 Enumeration enumeration = table.keys();
|
/dalvik/libcore/security/src/main/java/org/bouncycastle/jce/provider/ |
H A D | JDKKeyStore.java | 77 protected Hashtable table = new Hashtable(); field in class:JDKKeyStore 488 return table.keys(); 494 return (table.get(alias) != null); 501 Object entry = table.get(alias); 508 table.remove(alias); 514 StoreEntry entry = (StoreEntry)table.get(alias); 539 Enumeration e = table.elements(); 570 StoreEntry entry = (StoreEntry)table.get(alias); 582 StoreEntry entry = (StoreEntry)table.get(alias); 597 StoreEntry entry = (StoreEntry)table [all...] |
/dalvik/libcore/sql/src/main/java/SQLite/JDBC2y/ |
H A D | JDBCConnection.java | 76 public boolean busy(String table, int count) { argument
|
H A D | JDBCDatabaseMetaData.java | 529 sb.append("(type = 'table' or type = 'view')"); 675 String table, 716 String table, int scope, 726 SQLite.Shell.sql_quote(table) + ")")); 729 SQLite.Shell.sql_quote(table) + ")")); 826 String table) throws SQLException { 845 String table) throws SQLException { 851 SQLite.Shell.sql_quote(table) + ")")); 906 row[2] = table; 922 SQLite.Shell.sql_quote(table) 674 getColumnPrivileges(String catalog, String schema, String table, String columnNamePattern) argument 715 getBestRowIdentifier(String catalog, String schema, String table, int scope, boolean nullable) argument 825 getVersionColumns(String catalog, String schema, String table) argument 844 getPrimaryKeys(String catalog, String schema, String table) argument 962 internalImportedKeys(String table, String pktable, JDBCResultSet in, TableResultX out) argument 1005 getImportedKeys(String catalog, String schema, String table) argument 1042 getExportedKeys(String catalog, String schema, String table) argument 1236 getIndexInfo(String catalog, String schema, String table, boolean unique, boolean approximate) argument [all...] |
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
H A D | ConcurrentHashMap.java | 20 * A hash table supporting full concurrency of retrievals and 26 * and there is <em>not</em> any support for locking the entire table 38 * Enumerations return elements reflecting the state of the hash table 46 * table is internally partitioned to try to permit the indicated 50 * threads as will ever concurrently modify the table. Using a 57 * hash table is a relatively slow operation, so, when possible, it is 58 * a good idea to provide estimates of expected table sizes in 78 * The basic strategy is to subdivide the table among Segments, 79 * each of which itself is a concurrently readable hash table. 85 * The default initial capacity for this table, 278 transient volatile HashEntry<K,V>[] table; field in class:ConcurrentHashMap.Segment [all...] |
/dalvik/libcore/sql/src/test/java/tests/SQLite/ |
H A D | DatabaseTest.java | 101 this.statement.execute("drop table "+tableName); 105 // Create default test table 251 db.exec("create table AUX_TABLE", null); 354 args[0] = "table"; 387 "create table TEST5(id integer, firstname text, lastname text);", 399 db.exec("drop table TEST5;", null); 561 // set to fail immediately if table is locked. 688 // set to fail immediately if table is locked. 769 //select from empty table 773 //fill table 1820 busy(String table, int count) argument [all...] |
/dalvik/libcore/text/src/main/java/java/text/ |
H A D | DateFormat.java | 760 private static Hashtable<Integer, Field> table = new Hashtable<Integer, Field>(); field in class:DateFormat.Field 878 && table.get(new Integer(calendarField)) == null) { 879 table.put(new Integer(calendarField), this); 909 return table.get(new Integer(calendarField));
|
/dalvik/libcore/xml/src/main/java/org/apache/xalan/templates/ |
H A D | ElemNumber.java | 1585 * @param table a table containing one character for each digit in the radix 1590 * of the table. 1592 protected String int2singlealphaCount(long val, CharArrayWrapper table) argument 1595 int radix = table.getLength(); 1603 return (new Character(table.getChar((int)val - 1))).toString(); // index into table is off one, starts at 0 1611 * @param table a table containing one character for each digit in the radix 1618 * of the table [all...] |
/dalvik/vm/native/ |
H A D | dalvik_system_SamplingProfiler.c | 87 /** Entry table. */ 289 * Returns true if the method is in the given table. 291 static bool inTable(const Method* method, const Method* table, argument 297 const Method* last = table + (tableLength - 1); 300 return (char*) method >= (char*) table 333 LOGW("Method* is not in linear allocation table."); 375 * hash table.
|
/dalvik/libcore/sql/src/main/java/java/sql/ |
H A D | DatabaseMetaData.java | 133 * key by some other table. Used for the column {@code UPDATE_RULE}. 223 * States that this table index is a clustered index. 228 * States that this table index is a hashed index. 233 * States this table's index is neither a clustered index, not a hashed 234 * index, and not a table statistics index; i.e. it is something else. 239 * States this column has the table's statistics, and that it is returned in 240 * conjunction with the table's index description. 416 * <li>ORDINAL_POSITION - int - The index of the column in the table (where 421 * this gives the catalog of the table corresponding to the attribute's scope. 424 * this gives the schema of the table correspondin 517 getBestRowIdentifier(String catalog, String schema, String table, int scope, boolean nullable) argument 592 getColumnPrivileges(String catalog, String schema, String table, String columnNamePattern) argument 955 getExportedKeys(String catalog, String schema, String table) argument 1064 getImportedKeys(String catalog, String schema, String table) argument 1136 getIndexInfo(String catalog, String schema, String table, boolean unique, boolean approximate) argument 1421 getPrimaryKeys(String catalog, String schema, String table) argument 2034 getVersionColumns(String catalog, String schema, String table) argument [all...] |