Searched refs:q (Results 1 – 5 of 5) sorted by relevance
21 long q = 1L; in main() local31 q++; in main()34 t7q += (int)(1 - ((q - q) - 2)); in main()
5 a=123 c=q d=3.343434 j=1234605616436508552 f=0.12345
40 .field static public q:I
1939 ScopedArenaQueue<BasicBlock*> q(allocator.Adapter()); in ComputeTopologicalSortOrder() local1957 q.push(bb); in ComputeTopologicalSortOrder()1982 if (!q.empty()) { in ComputeTopologicalSortOrder()1985 bb = q.front(); in ComputeTopologicalSortOrder()1986 q.pop(); in ComputeTopologicalSortOrder()1989 DCHECK(q.empty()) << PrettyMethod(cu_->method_idx, *cu_->dex_file); in ComputeTopologicalSortOrder()1998 q.push(GetBasicBlock(candidate_id)); in ComputeTopologicalSortOrder()2081 q.push(successor); in ComputeTopologicalSortOrder()
913 PriorityBlockingQueue q = new PriorityBlockingQueue(10); in b2487514Test() local916 q.offer(new Integer(0)); in b2487514Test()923 Integer[] ints = (Integer[]) q.toArray(new Integer[5]); in b2487514Test()929 Object[] obj = q.toArray(new String[5]); in b2487514Test()