HomeSort by: relevance | last modified time | path
    Searched defs:splits (Results 1 - 4 of 4) sorted by relevancy

  /src/external/gpl3/gdb.old/dist/gdb/tui/
tui-layout.c 1232 std::vector<std::unique_ptr<tui_layout_split>> splits;
1233 splits.emplace_back (new tui_layout_split (is_vertical));
1247 splits.emplace_back (new tui_layout_split (is_vertical));
1257 if (splits.size () == 1)
1277 = std::move (splits.back ());
1278 splits.pop_back ();
1279 splits.back ()->add_split (std::move (last_split), weight);
1283 splits.back ()->add_window (name.c_str (), weight);
1287 if (splits.size () > 1)
1296 std::unique_ptr<tui_layout_split> new_layout = std::move (splits.back ())
1230 std::vector<std::unique_ptr<tui_layout_split>> splits; local
    [all...]
  /src/external/gpl3/gdb/dist/gdb/tui/
tui-layout.c 1224 std::vector<std::unique_ptr<tui_layout_split>> splits;
1225 splits.emplace_back (new tui_layout_split (is_vertical));
1239 splits.emplace_back (new tui_layout_split (is_vertical));
1249 if (splits.size () == 1)
1269 = std::move (splits.back ());
1270 splits.pop_back ();
1271 splits.back ()->add_split (std::move (last_split), weight);
1275 splits.back ()->add_window (name.c_str (), weight);
1279 if (splits.size () > 1)
1288 std::unique_ptr<tui_layout_split> new_layout = std::move (splits.back ())
1222 std::vector<std::unique_ptr<tui_layout_split>> splits; local
    [all...]
  /src/external/bsd/zstd/dist/lib/compress/
zstd_ldm.c 62 * splits. This effectively resets the hash state. This is used when skipping
89 * Registers in the splits array all the split points found in the first
91 * either all the data has been processed or LDM_BATCH_SIZE splits are
92 * present in the splits array.
94 * Precondition: The splits array must not be full.
98 size_t* splits, unsigned* numSplits)
111 splits[*numSplits] = n; \
295 size_t* const splits = ldmState->splitIndices; local
306 hashed = ZSTD_ldm_gear_feed(&hashState, ip, (size_t)(iend - ip), splits, &numSplits);
309 if (ip + splits[n] >= istart + minMatchLength)
369 size_t* const splits = ldmState->splitIndices; local
    [all...]
zstd_compress.c 4182 /* Helper function to perform the recursive search for block splits.
4192 * Furthermore, the number of splits is capped by ZSTD_MAX_NB_BLOCK_SPLITS.
4197 ZSTD_deriveBlockSplitsHelper(seqStoreSplits* splits, size_t startIdx, size_t endIdx,
4210 if (endIdx - startIdx < MIN_SEQUENCES_BLOCK_SPLITTING || splits->idx >= ZSTD_MAX_NB_BLOCK_SPLITS) {
4227 ZSTD_deriveBlockSplitsHelper(splits, startIdx, midIdx, zc, origSeqStore);
4228 splits->splitLocations[splits->idx] = (U32)midIdx;
4229 splits->idx++;
4230 ZSTD_deriveBlockSplitsHelper(splits, midIdx, endIdx, zc, origSeqStore);
4237 * @return: number of splits made (which equals the size of the partition table - 1)
4241 seqStoreSplits splits; local
    [all...]

Completed in 28 milliseconds