/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/dtd/ |
H A D | XML11DTDValidator.java | 98 XMLDTDValidator curr = null; 99 if((curr = (XMLDTDValidator)manager.getProperty(DTD_VALIDATOR_PROPERTY)) != null && 100 curr != this) { 101 fGrammarBucket = curr.getGrammarBucket();
|
/openjdk7/jdk/test/java/net/MulticastSocket/ |
H A D | TestInterfaces.java | 63 InetAddress curr = soc.getInterface(); 64 if (!curr.equals(ia)) { 65 System.err.println("MulticastSocket.getInterface returned: " + curr); 88 NetworkInterface curr = soc.getNetworkInterface(); 89 if (!curr.equals(ni)) { 90 System.err.println("MulticastSocket.getNetworkInterface returned: " + curr);
|
/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/jdk/src/windows/native/java/net/ |
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 | 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...] |
/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/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/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | bufferingOopClosure.hpp | 62 for (StarTask* curr = _buffer; curr < _buffer_curr; ++curr) { 63 if (curr->is_narrow()) { 65 _oc->do_oop((narrowOop*)(*curr)); 67 _oc->do_oop((oop*)(*curr)); 163 for (StarTask* curr = _buffer; curr < _buffer_curr; ++curr) { 169 if (curr [all...] |
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 | 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 | 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");
|
/openjdk7/jdk/src/solaris/native/sun/awt/ |
H A D | list.c | 140 curr pointer in the new list is the same as in the old list. 157 new_list->next = start_at_curr ? lp->ptr.curr : lp->next; 158 new_list->ptr.curr = lp->ptr.curr; 272 Sets the list head node's curr ptr to the first node in the list. 286 lp->ptr.curr = lp->next; 288 return lp->ptr.curr ? lp->ptr.curr->ptr.item : NULL; 293 Sets the list head node's curr ptr to the next node in the list. 308 if (lp->ptr.curr) { [all...] |
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/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...] |
/openjdk7/jdk/src/share/classes/com/sun/imageio/plugins/png/ |
H A D | RowFilter.java | 41 int curr = currRow[i] & 0xff; 43 int difference = curr - left; 60 int curr = currRow[i] & 0xff; 62 int difference = curr - up; 110 int curr = currRow[i] & 0xff; 111 badness += curr; 143 int curr = currRow[i] & 0xff; 146 int difference = curr - (left + up)/2;; 160 int curr = currRow[i] & 0xff; 165 int difference = curr [all...] |
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/jdk/src/share/classes/com/sun/jmx/snmp/agent/ |
H A D | SnmpMibNode.java | 354 int curr= low + (max-low)/2; 366 elmt= a[curr]; 370 curr++; 371 return a[curr]; 374 low= curr +1; 376 max= curr -1; 378 curr= low + (max-low)/2; 380 return a[curr];
|
H A D | SnmpMibOid.java | 471 int curr= low + (max-low)/2; 474 elmt= varList[curr]; 478 return curr; 481 low= curr +1; 483 max= curr -1; 485 curr= low + (max-low)/2; 504 int curr= low + (max-low)/2; 507 elmt= varList[curr]; 512 return curr; 515 low= curr [all...] |
/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/langtools/test/tools/javac/api/ |
H A D | TestTreePath.java | 82 TreePath curr = path; 85 while (curr != null) { 87 curr = curr.getParentPath();
|
/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/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/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...] |