/openjdk7/jdk/src/solaris/native/sun/awt/ |
H A D | list.h | 83 struct _list_item *curr; /* in list head, pts to curr for 1st, next */ member in union:_list_item::__anon1011
|
/openjdk7/jdk/src/share/native/sun/java2d/ |
H A D | ShaderList.c | 71 ShaderInfo *curr = info->next; local 72 while (curr != NULL) { 75 programList->dispose(curr->programID); 76 free(curr); 80 prev = curr; 81 curr = curr->next;
|
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | heapRegionSeq.cpp | 40 uint curr = from; local 43 while (curr < len && num_so_far < num) { 44 if (at(curr)->is_empty()) { 46 first = curr; 55 curr += 1; 61 assert(first < curr && (curr - first) == num, "post-condition");
|
H A D | collectionSetChooser.cpp | 106 HeapRegion *curr = regions_at(index++); local 107 guarantee(curr != NULL, "Regions in _regions array cannot be NULL"); 108 guarantee(!curr->is_young(), "should not be young!"); 109 guarantee(!curr->isHumongous(), "should not be humongous!"); 111 guarantee(order_regions(prev, curr) != 1, 112 err_msg("GC eff prev: %1.4f GC eff curr: %1.4f", 113 prev->gc_efficiency(), curr->gc_efficiency())); 115 sum_of_reclaimable_bytes += curr->reclaimable_bytes(); 116 prev = curr;
|
H A D | heapRegionSet.cpp | 340 HeapRegion* curr = _head; local 341 while (curr != NULL) { 342 hrs_assert_region_ok(this, curr, this); 344 HeapRegion* next = curr->next(); 345 curr->set_next(NULL); 346 curr->set_containing_set(NULL); 347 curr = next; 362 HeapRegion* curr = _head; local 365 while (curr != NULL) { 366 hrs_assert_region_ok(this, curr, thi [all...] |
H A D | concurrentMark.cpp | 1049 HeapWord* curr = hr->bottom(); local 1051 while (curr < end) { 1052 Prefetch::read(curr, interval); 1053 oop obj = oop(curr); 1056 curr += size;
|
/openjdk7/jdk/src/share/native/java/util/zip/zlib-1.2.3/ |
H A D | inftrees.c | 68 unsigned curr; /* number of index bits for current table */ local 175 filled is at next and has curr index bits. The code being used is huff 177 bits off of the bottom. For codes where len is less than drop + curr, 178 those top drop + curr - len bits are incremented through all values to 229 curr = root; /* current table index bits */ 258 fill = 1U << curr; 290 next += min; /* here min is 1 << curr */ 293 curr = len - drop; 294 left = (int)(1 << curr); 295 while (curr [all...] |
/openjdk7/jdk/src/solaris/native/com/sun/media/sound/ |
H A D | PLATFORM_API_BsdOS_ALSA_CommonUtils.c | 136 int curr, len, totalLen, inVersionString; local 145 curr = 0; 146 while (curr < totalLen) { 149 if (ALSAVersionString[curr] >= '0' 150 && ALSAVersionString[curr] <= '9') { 156 if (ALSAVersionString[curr] <= 32) { 159 if (curr != len) { 161 ALSAVersionString[len] = ALSAVersionString[curr]; 165 curr++;
|
H A D | PLATFORM_API_LinuxOS_ALSA_CommonUtils.c | 136 int curr, len, totalLen, inVersionString; local 145 curr = 0; 146 while (curr < totalLen) { 149 if (ALSAVersionString[curr] >= '0' 150 && ALSAVersionString[curr] <= '9') { 156 if (ALSAVersionString[curr] <= 32) { 159 if (curr != len) { 161 ALSAVersionString[len] = ALSAVersionString[curr]; 165 curr++;
|
/openjdk7/jdk/src/windows/native/sun/net/dns/ |
H A D | ResolverConfigurationImpl.c | 136 IP_ADAPTER_INFO *curr = adapterP; local 137 while (curr != NULL) { 142 curr->AdapterName); 210 curr = curr->Next;
|
/openjdk7/hotspot/src/share/vm/prims/ |
H A D | jvmtiTrace.cpp | 76 const char *curr; local 78 curr = TraceJVMTI; 80 curr = ""; // hack in fixed tracing here 82 very_end = curr + strlen(curr); 83 while (curr < very_end) { 84 const char *curr_end = strchr(curr, ','); 88 const char *op_pos = strchr(curr, '+'); 89 const char *minus_pos = strchr(curr, '-'); 139 size_t len = op_pos - curr; [all...] |
/openjdk7/jdk/src/share/demo/jvmti/compiledMethodLoad/ |
H A D | compiledMethodLoad.c | 157 jvmtiCompiledMethodLoadRecordHeader* curr = list; local 159 while (curr != NULL) { 160 switch (curr->kind) { 162 print_dummy_record((jvmtiCompiledMethodLoadDummyRecord *)curr, 168 (jvmtiCompiledMethodLoadInlineRecord *)curr, jvmti, fp); 172 fprintf(fp, "Warning: unrecognized record: kind=%d\n", curr->kind); 176 curr = (jvmtiCompiledMethodLoadRecordHeader *)curr->next;
|
/openjdk7/jdk/src/solaris/native/java/net/ |
H A D | bsd_close.c | 166 threadEntry_t *curr, *prev=NULL; local 167 curr = fdEntry->threads; 168 while (curr != NULL) { 169 if (curr == self) { 170 if (curr->intr) { 174 fdEntry->threads = curr->next; 176 prev->next = curr->next; 180 prev = curr; 181 curr = curr 215 threadEntry_t *curr = fdEntry->threads; local [all...] |
H A D | linux_close.c | 149 threadEntry_t *curr, *prev=NULL; local 150 curr = fdEntry->threads; 151 while (curr != NULL) { 152 if (curr == self) { 153 if (curr->intr) { 157 fdEntry->threads = curr->next; 159 prev->next = curr->next; 163 prev = curr; 164 curr = curr 198 threadEntry_t *curr = fdEntry->threads; local [all...] |
H A D | NetworkInterface.c | 212 netif *ifs, *curr; local 227 curr = ifs; 228 while (curr != NULL) { 229 if (strcmp(name_utf, curr->name) == 0) { 232 curr = curr->next; 236 if (curr != NULL) {; 237 obj = createNetworkInterface(env, curr); 256 netif *ifs, *curr; local 271 curr 296 netif *ifs, *curr; local 386 netif *ifs, *curr; local [all...] |
/openjdk7/jdk/src/windows/native/java/net/ |
H A D | NetworkInterface_winXP.c | 168 netif *nif=0, *dup_nif, *last=0, *loopif=0, *curr; local 194 curr = *netifPP; 195 while (curr != NULL) { 197 ret = enumAddresses_win(env, curr, &netaddrP); 201 curr->addrs = netaddrP; 202 curr->naddrs += ret; 203 curr = curr->next; 340 netaddr *curr, *start=0, *prev=0; local 367 curr 549 netif *ifList, *curr; local 592 netif *ifList, *curr; local 627 netif *ifList, *curr; local 683 netif *ifList, *curr; local [all...] |
H A D | NetworkInterface.c | 88 netif *curr = netifP; local 89 while (curr != NULL) { 90 if (curr->name != NULL) 91 free(curr->name); 92 if (curr->displayName != NULL) 93 free(curr->displayName); 94 if (curr->addrs != NULL) 95 free_netaddr (curr->addrs); 97 free(curr); 98 curr 103 netaddr *curr = netaddrP; local 212 netif *curr; local 396 netaddr *curr = (netaddr *)malloc(sizeof(netaddr)); local 640 netif *ifList, *curr; local 689 netif *ifList, *curr; local 730 netif *ifList, *curr; local 800 netif *ifList, *curr; local [all...] |
H A D | TwoStacksPlainDatagramSocketImpl.c | 175 netaddr *curr; local 238 curr = (netaddr *)malloc(sizeof(netaddr)); 239 if (curr == NULL) { 241 curr = addrList->next; 243 addrList = curr; 249 curr->addr = htonl((*addrp)->S_un.S_addr); 250 curr->next = addrList; 251 addrList = curr; 290 curr = addrList; 291 while (curr ! [all...] |
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | binaryTreeDictionary.cpp | 808 double curr = size * size * total_list_length(tl); local 809 curr += sum_of_squared_block_sizes(tl->left()); 810 curr += sum_of_squared_block_sizes(tl->right()); 811 return curr;
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | ifnode.cpp | 561 Node* IfNode::up_one_dom(Node *curr, bool linear_only) { argument 562 Node *dom = curr->in(0); 564 return curr->nonnull_req(); // Skip thru it 566 if( curr != dom ) // Normal walk up one step?
|
/openjdk7/jdk/src/share/classes/com/sun/imageio/plugins/png/ |
H A D | PNGImageReader.java | 777 private static void decodeSubFilter(byte[] curr, int coff, int count, argument 782 val = curr[i + coff] & 0xff; 783 val += curr[i + coff - bpp] & 0xff; 785 curr[i + coff] = (byte)val; 789 private static void decodeUpFilter(byte[] curr, int coff, argument 793 int raw = curr[i + coff] & 0xff; 796 curr[i + coff] = (byte)(raw + prior); 800 private static void decodeAverageFilter(byte[] curr, int coff, argument 806 raw = curr[i + coff] & 0xff; 809 curr[ 836 decodePaethFilter(byte[] curr, int coff, byte[] prev, int poff, int count, int bpp) argument [all...] |
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | arguments.hpp | 175 AgentLibrary* curr; local 177 for (curr = first(); curr != NULL; prev = curr, curr = curr->next()) { 178 if (curr == lib) { 182 assert(curr != NULL, "always should be found"); 184 if (curr != NULL) { 187 _first = curr [all...] |
/openjdk7/hotspot/src/share/vm/code/ |
H A D | nmethod.cpp | 383 ExceptionCache* curr = exception_cache(); local 384 assert(curr != NULL, "nothing to remove"); 386 while (curr != ec) { 387 prev = curr; 388 curr = curr->next(); 389 assert(curr != NULL, "ExceptionCache not found"); 391 // now: curr == ec 392 ExceptionCache* next = curr->next(); 398 delete curr; [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/ |
H A D | compactibleFreeListSpace.cpp | 1896 FreeChunk *curr = fl->head(); local 1897 size_t oldNumWords = curr->size(); 1899 assert(curr != NULL, "List is empty"); 1903 fl->remove_chunk(curr); 1906 FreeChunk* new_chunk = splitChunkAndReturnRemainder(curr, numWords);
|
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xs/traversers/ |
H A D | XSDHandler.java | 3974 // This function looks among the children of curr for an element of type elementSought. 3978 // the sum of the values returned by calls to itself on curr's children. 3982 String newName, Element curr, XSDocumentInfo schemaDoc) { 3984 for (Element child = DOMUtil.getFirstChildElement(curr); 3981 changeRedefineGroup(String originalQName, String elementSought, String newName, Element curr, XSDocumentInfo schemaDoc) argument
|