Searched defs:split (Results 26 - 32 of 32) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/runtime/
H A Dos.cpp1430 size_t split, bool realloc) {
1431 pd_split_reserved_memory(base, size, split, realloc);
1429 split_reserved_memory(char *base, size_t size, size_t split, bool realloc) argument
/openjdk7/jdk/src/share/classes/java/util/regex/
H A DPattern.java753 * @see java.lang.String#split(String, int)
754 * @see java.lang.String#split(String)
1185 * The character sequence to be split
1193 public String[] split(CharSequence input, int limit) { method in class:Pattern
1234 * #split(java.lang.CharSequence, int) split} method with the given input
1253 * The character sequence to be split
1258 public String[] split(CharSequence input) { method in class:Pattern
1259 return split(input, 0);
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DcompactibleFreeListSpace.cpp747 // (There are only two of these, rather than N, because the split is due
1609 // Note: The stats update re split-death of block obtained above
1622 // into multiple pieces; record the split-death of the original
1641 // as a split birth.
1878 // and split out a free chunk which is returned.
1942 split(size, rem_size);
1946 split(size ,rem_size);
2272 false /* split */,
2282 false /* split */,
2306 true /* split */,
2321 void CompactibleFreeListSpace::split(size_t from, size_t to1) { function in class:CompactibleFreeListSpace
[all...]
/openjdk7/hotspot/src/cpu/sparc/vm/
H A DsharedRuntime_sparc.cpp1461 // split src into two separate registers
1469 VMRegPair split(dst.second());
1470 simple_move32(masm, src, split);
1472 VMRegPair split(src.first(), L4->as_VMReg());
1475 split_long_move(masm, split, dst);
1487 VMRegPair split; local
1492 split.set_pair(dst.first(), src.first());
1497 split.set_pair(dst.first(), L5->as_VMReg());
1502 split_long_move(masm, src, split);
1506 __ sllx(split
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A Dmemnode.cpp1337 // Skip the split if the region dominates some control edge of the address.
2421 // Do not common stores up together. They generally have to be split
3035 // incoming raw memory is not split
3565 jint con0, con1; // split the constant, address-wise
3566 jint init0, init1; // split the init map, address-wise
3580 bool split = !Matcher::isSimpleConstant64(con); local
3585 split = true; // only the second word counts
3588 split = true; // first word is covered by full inits
3591 split = true; // second word is covered by full inits
3598 // In this case the tile is not split; i
[all...]
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_LinearScan.cpp307 // copy the vreg-flags if an interval is split
326 assert(interval->is_split_parent(), "can only be called for split parents");
1171 // it is split before the first use by the register allocator.
1272 // (32 is added to have some space for split children without having to resize the list)
1656 // (insert moves at edges between blocks if intervals have been split)
1752 // insert necessary moves (spilling or reloading) at edges between blocks if interval has been split
1808 // collect all intervals that have been split between from_block and to_block
1833 // the interval is split to get a short range that is located on the stack
1845 "no split allowed between exception entry and first instruction");
1849 interval = interval->split(from_op_i
4383 Interval* Interval::split(int split_pos) { function in class:Interval
[all...]
/openjdk7/hotspot/src/os/windows/vm/
H A Dos_windows.cpp155 const double split = 10000000.0; local
156 double result = (time->dwLowDateTime / split) +
157 time->dwHighDateTime * (high/split);
2960 // all or nothing deal. When we split a reservation, we must break the
2962 void os::pd_split_reserved_memory(char *base, size_t size, size_t split, argument
2967 reserve_memory(split, base);
2969 if (size != split) {
2970 reserve_memory(size - split, base + split);

Completed in 155 milliseconds

12