• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    迪恩网络公众号

C++ stripedio类代码示例

原作者: [db:作者] 来自: [db:来源] 收藏 邀请

本文整理汇总了C++中stripedio的典型用法代码示例。如果您正苦于以下问题:C++ stripedio类的具体用法?C++ stripedio怎么用?C++ stripedio使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。



在下文中一共展示了stripedio类的20个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的C++代码示例。

示例1: sliding_shard

        sliding_shard(stripedio * iomgr, std::string _filename_edata, std::string _filename_adj, vid_t _range_st, vid_t _range_en, size_t _blocksize, metrics &_m,
                      bool _disable_writes=false, bool onlyadj = false) :
        iomgr(iomgr),
        filename_edata(_filename_edata),
        filename_adj(_filename_adj),
        range_st(_range_st),
        range_end(_range_en),
        blocksize(_blocksize),
        m(_m),
        disable_writes(_disable_writes) {
            curvid = 0;
            adjoffset = 0;
            edataoffset = 0;
            disable_writes = false;
            only_adjacency = onlyadj;
            curblock = NULL;
            curadjblock = NULL;
            window_start_edataoffset = 0;
            disable_async_writes = false;
            
            while(blocksize % sizeof(int) != 0) blocksize++;
            assert(blocksize % sizeof(int)==0);
            
            adjfilesize = get_filesize(filename_adj);
            edatafilesize = get_shard_edata_filesize<int>(filename_edata);
            if (!only_adjacency) {
                logstream(LOG_DEBUG) << "Total edge data size: " << edatafilesize << std::endl;
            } else {
                // Nothing
            }
            
            adjfile_session = iomgr->open_session(filename_adj, true);
            save_offset();
            
            async_edata_loading = false; // With dynamic edge data size, do not load

        }
开发者ID:Prokopp,项目名称:graphchi-cpp,代码行数:37,代码来源:slidingshard.hpp


示例2: commit

 void commit(bool all) {
     if (edgedata == NULL || only_adjacency) return; 
     assert(is_loaded);
     metrics_entry cm = m.start_time();
     
     /**
       * This is an optimization that is relevant only if memory shard
       * has been used in a case where only out-edges are considered.
       * Out-edges are in a continuous "window", while in-edges are 
       * scattered all over the shard
       */
     if (all) {
         iomgr->managed_pwritea_now(edata_iosession, &edgedata, edatafilesize, 0);
     } else {
         size_t last = streaming_offset_edge_ptr;
         if (last == 0){
             // rollback
             last = edatafilesize;
         }   
         char * bufp = ((char*)edgedata + range_start_edge_ptr);
         iomgr->managed_pwritea_now(edata_iosession, &bufp, last - range_start_edge_ptr, range_start_edge_ptr);
         
     }
     m.stop_time(cm, "memshard_commit");
     
     iomgr->managed_release(adj_session, &adjdata);
     iomgr->managed_release(edata_iosession, &edgedata);
     is_loaded = false;
 }
开发者ID:bmabey,项目名称:graphchi,代码行数:29,代码来源:memoryshard.hpp


示例3: check_curblock

 inline void check_curblock(size_t toread) {
     if (curblock == NULL || curblock->end < edataoffset+toread) {
         if (curblock != NULL) {
             if (!curblock->active) {
                 curblock->release(iomgr);
             }
         }
         // Load next
         std::string blockfilename = filename_shard_edata_block(filename_edata, (int) (edataoffset / blocksize), blocksize);
         int edata_session = iomgr->open_session(blockfilename, false, true);
         sblock<ET> newblock(edata_session, edata_session, true, blockfilename);
         
         // We align blocks always to the blocksize, even if that requires
         // allocating and reading some unnecessary data.
         newblock.offset = (edataoffset / blocksize) * blocksize; // Align
         size_t correction = edataoffset - newblock.offset;
         newblock.end = std::min(edatafilesize, newblock.offset + blocksize);
         assert(newblock.end >= newblock.offset);
         int realsize = get_block_uncompressed_size(blockfilename, newblock.end - newblock.offset);
         iomgr->managed_malloc(edata_session, &newblock.data, realsize, newblock.offset);
         newblock.ptr = newblock.data + correction;
         activeblocks.push_back(newblock);
         curblock = &activeblocks[activeblocks.size()-1];
         curblock->active = true;
         curblock->read_now(iomgr);
     }
 }
开发者ID:Prokopp,项目名称:graphchi-cpp,代码行数:27,代码来源:slidingshard.hpp


示例4: releaseblocks

 void releaseblocks() {
     for(int i=0; i < (int)loadedblocks.size(); i++) {
         delete(loadedblocks[i].dblock);
         iomgr->managed_release(loadedblocks[i].fd, &loadedblocks[i].data);
         iomgr->close_session(loadedblocks[i].fd);
         loadedblocks[i].data = NULL;
         loadedblocks[i].dblock = NULL;
     }
     loadedblocks.clear();
 }
开发者ID:GarrettSmith,项目名称:Nearness,代码行数:10,代码来源:vertex_data_dynamic.hpp


示例5:

        ~memory_shard() {

            if (edata_iosession >= 0) {
                if (edgedata != NULL) iomgr->managed_release(edata_iosession, &edgedata);
                iomgr->close_session(edata_iosession);
            }
            if (adj_session >= 0) {
                if (adjdata != NULL) iomgr->managed_release(adj_session, &adjdata);
                iomgr->close_session(adj_session);
            }
        }
开发者ID:bmabey,项目名称:graphchi,代码行数:11,代码来源:memoryshard.hpp


示例6: load_block

 vdblock load_block(int blockid) {
     vdblock db(blockid);
     
     std::string blockfname = blockfilename(blockid);
     db.fd = iomgr->open_session(blockfname, false, true);
     int realsize = get_block_uncompressed_size(blockfname, -1);
     assert(realsize > 0);
     
     iomgr->managed_malloc(db.fd, &db.data, realsize, 0);
     iomgr->managed_preada_now(db.fd, &db.data, realsize, 0);
     db.dblock = new dynamicdata_block<VertexDataType>(verticesperblock, (uint8_t *)db.data, realsize);
     return db;
 }
开发者ID:GarrettSmith,项目名称:Nearness,代码行数:13,代码来源:vertex_data_dynamic.hpp


示例7: open_file

 virtual void open_file(std::string base_filename) {
     filename = filename_degree_data(base_filename);
     modified = false;
     if (!use_mmap) {
         iomgr->allow_preloading(filename);
         filedesc = iomgr->open_session(filename.c_str(), false);
     } else {
         mmap_length = get_filesize(filename);
         filedesc = open(filename.c_str(), O_RDWR);
         mmap_file = (degree *) mmap(NULL, mmap_length, PROT_READ | PROT_WRITE, MAP_SHARED, filedesc, 0);
         assert(mmap_file);
     }
 }
开发者ID:albedium,项目名称:graphchi-cpp,代码行数:13,代码来源:degree_data.hpp


示例8: msync

 virtual ~degree_data() {
     if (!use_mmap) {
         if (loaded_chunk != NULL) {
             iomgr->managed_release(filedesc, &loaded_chunk);
         }        
         iomgr->close_session(filedesc);
     } else {
         if (modified) {
             msync(mmap_file, mmap_length, MS_SYNC);
         }
         munmap(mmap_file, mmap_length);
         close(filedesc);
     }
 }
开发者ID:albedium,项目名称:graphchi-cpp,代码行数:14,代码来源:degree_data.hpp


示例9: save

 /**
   * Saves the current chunk of vertex values
   */
 virtual void save(bool async=false) {
     if (!use_mmap) {
         assert(loaded_chunk != NULL); 
         size_t datasize = (vertex_en - vertex_st + 1) * sizeof(VertexDataType);
         size_t datastart = vertex_st * sizeof(VertexDataType);
         if (async) {
             iomgr->managed_pwritea_async(filedesc, &loaded_chunk, datasize, datastart, false);
         } else {
             iomgr->managed_pwritea_now(filedesc, &loaded_chunk, datasize, datastart);
         }
     } else {
         // do nothing
     }
 }
开发者ID:Alienfeel,项目名称:graphchi-cpp,代码行数:17,代码来源:vertex_data.hpp


示例10: logstream

 virtual ~vertex_data_store() {
     if (!use_mmap) {
         iomgr->close_session(filedesc);
         iomgr->wait_for_writes();
         if (loaded_chunk != NULL) {
             iomgr->managed_release(filedesc, &loaded_chunk);
         }
     } else {
         logstream(LOG_INFO) << "Syncing vertex data..." << std::endl;
         msync(mmap_file, mmap_length, MS_SYNC);
         munmap(mmap_file, mmap_length);
         close(filedesc);
     }
 }
开发者ID:Alienfeel,项目名称:graphchi-cpp,代码行数:14,代码来源:vertex_data.hpp


示例11: load

 /**
   * Loads a chunk of vertex degrees
   * @param vertex_st first vertex id
   * @param vertex_en last vertex id, inclusive
   */
 virtual void load(vid_t _vertex_st, vid_t _vertex_en) {
     assert(_vertex_en >= _vertex_st);
     vertex_st = _vertex_st;
     vertex_en = _vertex_en;
     
     size_t datasize = (vertex_en - vertex_st + 1) * sizeof(degree);
     size_t datastart = vertex_st * sizeof(degree);
     
     if (loaded_chunk != NULL) {
         iomgr->managed_release(filedesc, &loaded_chunk);
     }
     
     iomgr->managed_malloc(filedesc, &loaded_chunk, datasize, datastart);
     iomgr->managed_preada_now(filedesc, &loaded_chunk, datasize, datastart);
 }
开发者ID:carriercomm,项目名称:DPDK-Graph,代码行数:20,代码来源:degree_data.hpp


示例12: save

 void save() {
     if (!use_mmap) {
         size_t datasize = (vertex_en - vertex_st + 1) * sizeof(degree);
         size_t datastart = vertex_st * sizeof(degree);
         iomgr->managed_pwritea_now(filedesc, &loaded_chunk, datasize, datastart);
     }
 }
开发者ID:albedium,项目名称:graphchi-cpp,代码行数:7,代码来源:degree_data.hpp


示例13: write_block

 void write_block(vdblock &block) {
     int realsize;
     uint8_t * outdata;
     block.dblock->write(&outdata, realsize);
     std::string blockfname = blockfilename(block.blockid);
     iomgr->managed_pwritea_now(block.fd, &outdata, realsize, 0); /* Need to write whole block in the compressed regime */
     write_block_uncompressed_size(blockfname, realsize);
 }
开发者ID:GarrettSmith,项目名称:Nearness,代码行数:8,代码来源:vertex_data_dynamic.hpp


示例14: load

        // TODO: recycle ptr!
        void load() {
            is_loaded = true;
            adjfilesize = get_filesize(filename_adj);
            edatafilesize = get_filesize(filename_edata);
            
            bool async_inedgedata_loading = !svertex_t().computational_edges();
            
#ifdef SUPPORT_DELETIONS
            async_inedgedata_loading = false;  // Currently we encode the deleted status of an edge into the edge value (should be changed!),
                                               // so we need the edge data while loading
#endif
                        
            //preada(adjf, adjdata, adjfilesize, 0);
            
            adj_session = iomgr->open_session(filename_adj, true);
            iomgr->managed_malloc(adj_session, &adjdata, adjfilesize, 0);
            adj_stream_session = streaming_task(iomgr, adj_session, adjfilesize, (char**) &adjdata);
            
            iomgr->launch_stream_reader(&adj_stream_session);            
            /* Initialize edge data asynchonous reading */
            if (!only_adjacency) {
                edata_iosession = iomgr->open_session(filename_edata, false);
                
                iomgr->managed_malloc(edata_iosession, &edgedata, edatafilesize, 0);
                if (async_inedgedata_loading) {
                    iomgr->managed_preada_async(edata_iosession, &edgedata, edatafilesize, 0);
                } else {
                    iomgr->managed_preada_now(edata_iosession, &edgedata, edatafilesize, 0);
                }
            }
        }
开发者ID:bmabey,项目名称:graphchi,代码行数:32,代码来源:memoryshard.hpp


示例15: ensure_size

 void ensure_size(vid_t maxid) {
     if (!use_mmap) {
         iomgr->truncate(filedesc, (1 + maxid) * sizeof(degree));
     } else {
         munmap(mmap_file, mmap_length);
         ftruncate(filedesc, (1 + maxid) * sizeof(degree));
         close(filedesc);
         open_file(base_filename);
     }
 }
开发者ID:albedium,项目名称:graphchi-cpp,代码行数:10,代码来源:degree_data.hpp


示例16: open_file

 virtual void open_file() {
     if (!use_mmap) {
         filedesc = iomgr->open_session(filename.c_str(), false);
     } else {
         mmap_length = get_filesize(filename);
         filedesc = open(filename.c_str(), O_RDWR);
         mmap_file = (VertexDataType *) mmap(NULL, mmap_length, PROT_WRITE | PROT_READ, MAP_SHARED, filedesc, 0);
         assert(mmap_file);
     }
 }
开发者ID:Alienfeel,项目名称:graphchi-cpp,代码行数:10,代码来源:vertex_data.hpp


示例17: load

        /**
         * Loads a chunk of vertex values
         * @param vertex_st first vertex id
         * @param vertex_en last vertex id, inclusive
         */
        virtual void load(vid_t _vertex_st, vid_t _vertex_en) {
            if (!use_mmap) {
                assert(_vertex_en >= _vertex_st);
                vertex_st = _vertex_st;
                vertex_en = _vertex_en;
                
                size_t datasize = (vertex_en - vertex_st + 1)* sizeof(VertexDataType);
                size_t datastart = vertex_st * sizeof(VertexDataType);
                
                if (loaded_chunk != NULL) {
                    iomgr->managed_release(filedesc, &loaded_chunk);
                }
                
                iomgr->managed_malloc(filedesc, &loaded_chunk, datasize, datastart);
                iomgr->managed_preada_now(filedesc, &loaded_chunk, datasize, datastart);
            } else {
                // Do nothing
            }

        }
开发者ID:Alienfeel,项目名称:graphchi-cpp,代码行数:25,代码来源:vertex_data.hpp


示例18: check_adjblock

 inline void check_adjblock(size_t toread) {
     if (curadjblock == NULL || curadjblock->end <= adjoffset + toread) {
         if (curadjblock != NULL) {
             curadjblock->release(iomgr);
             delete curadjblock;
             curadjblock = NULL;
         }
         sblock<ET> * newblock = new sblock<ET>(0, adjfile_session);
         newblock->offset = adjoffset;
         newblock->end = std::min(adjfilesize, adjoffset+blocksize);
         assert(newblock->end > 0);
         assert(newblock->end >= newblock->offset);
         iomgr->managed_malloc(adjfile_session, &newblock->data, newblock->end - newblock->offset, adjoffset);
         newblock->ptr = newblock->data;
         metrics_entry me = m.start_time();
         iomgr->managed_preada_now(adjfile_session, &newblock->data, newblock->end - newblock->offset, adjoffset);
         m.stop_time(me, "blockload");
         curadjblock = newblock;
     }
 }
开发者ID:Prokopp,项目名称:graphchi-cpp,代码行数:20,代码来源:slidingshard.hpp


示例19:

 ~sliding_shard() {
     release_prior_to_offset(true);
     if (curblock != NULL) {
         curblock->release(iomgr);
         delete curblock;
         curblock = NULL;
     }
     if (curadjblock != NULL) {
         curadjblock->release(iomgr);
         delete curadjblock;
         curadjblock = NULL;
     }
     
     
     iomgr->close_session(adjfile_session);
 }
开发者ID:Prokopp,项目名称:graphchi-cpp,代码行数:16,代码来源:slidingshard.hpp


示例20:

 virtual ~degree_data() {
     if (loaded_chunk != NULL) {
         iomgr->managed_release(filedesc, &loaded_chunk);
     }        
     iomgr->close_session(filedesc);
 }
开发者ID:carriercomm,项目名称:DPDK-Graph,代码行数:6,代码来源:degree_data.hpp



注:本文中的stripedio类示例由纯净天空整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。


鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
上一篇:
C++ strong_type类代码示例发布时间:2022-05-31
下一篇:
C++ stringw类代码示例发布时间:2022-05-31
热门推荐
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap