Home
last modified time | relevance | path

Searched refs:npieces (Results 1 – 25 of 123) sorted by relevance

12345

/dports/math/vtk8/VTK-8.2.0/Common/ExecutionModel/
H A DvtkParallelReader.h79 int piece, int npieces, int nghosts, int timestep,
82 int piece, int npieces, int nghosts, int timestep,
85 int piece, int npieces, int nghosts, int timestep,
111 int npieces,
123 int npieces,
135 int npieces,
H A DvtkParallelReader.cxx145 int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) in ReadMesh() argument
157 this->Internal->FileNames[timestep], piece, npieces, nghosts, output)) in ReadMesh()
167 int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) in ReadPoints() argument
178 this->Internal->FileNames[timestep], piece, npieces, nghosts, output); in ReadPoints()
183 int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) in ReadArrays() argument
194 this->Internal->FileNames[timestep], piece, npieces, nghosts, output); in ReadArrays()
H A DvtkReaderAlgorithm.h86 int piece, int npieces, int nghosts, int timestep,
95 int piece, int npieces, int nghosts, int timestep,
104 int piece, int npieces, int nghosts, int timestep,
H A DvtkReaderExecutive.cxx110 int npieces = reqs->Has(vtkSDDP::UPDATE_NUMBER_OF_PIECES()) ? in CallAlgorithm() local
115 piece, npieces, nghosts, timeIndex, output); in CallAlgorithm()
119 piece, npieces, nghosts, timeIndex, output); in CallAlgorithm()
124 piece, npieces, nghosts, timeIndex, output); in CallAlgorithm()
H A DvtkSimpleReader.h76 int piece, int npieces, int nghosts, int timestep,
79 int piece, int npieces, int nghosts, int timestep,
82 int piece, int npieces, int nghosts, int timestep,
/dports/math/vtk9/VTK-9.1.0/Common/ExecutionModel/
H A DvtkParallelReader.h78 int ReadMesh(int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) override;
79 int ReadPoints(int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) override;
80 int ReadArrays(int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) override;
102 const std::string& fname, int piece, int npieces, int nghosts, vtkDataObject* output) = 0;
111 const std::string& fname, int piece, int npieces, int nghosts, vtkDataObject* output) = 0;
120 const std::string& fname, int piece, int npieces, int nghosts, vtkDataObject* output) = 0;
H A DvtkParallelReader.cxx135 int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) in ReadMesh() argument
145 if (this->ReadMesh(this->Internal->FileNames[timestep], piece, npieces, nghosts, output)) in ReadMesh()
155 int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) in ReadPoints() argument
165 return this->ReadPoints(this->Internal->FileNames[timestep], piece, npieces, nghosts, output); in ReadPoints()
170 int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) in ReadArrays() argument
180 return this->ReadArrays(this->Internal->FileNames[timestep], piece, npieces, nghosts, output); in ReadArrays()
H A DvtkReaderAlgorithm.cxx100 int npieces = reqs->Has(vtkSDDP::UPDATE_NUMBER_OF_PIECES()) in ProcessRequest() local
108 result = this->ReadMesh(piece, npieces, nghosts, timeIndex, output); in ProcessRequest()
111 result = this->ReadPoints(piece, npieces, nghosts, timeIndex, output); in ProcessRequest()
115 result = this->ReadArrays(piece, npieces, nghosts, timeIndex, output); in ProcessRequest()
H A DvtkReaderAlgorithm.h87 int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) = 0;
95 int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) = 0;
103 int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) = 0;
H A DvtkSimpleReader.h74 int ReadMesh(int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) override;
75 int ReadPoints(int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) override;
76 int ReadArrays(int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) override;
/dports/games/netherearth/netherearth-0.51/
H A Drobots.cpp569 int npieces=0; in bullethit() local
572 if (pieces[0]) npieces++; in bullethit()
573 if (pieces[1]) npieces++; in bullethit()
574 if (pieces[2]) npieces++; in bullethit()
575 if (pieces[3]) npieces++; in bullethit()
576 if (pieces[4]) npieces++; in bullethit()
583 if (npieces==1) damage-=2; in bullethit()
584 if (npieces==2) damage-=4; in bullethit()
585 if (npieces==3) damage-=8; in bullethit()
593 if (npieces==1) damage-=3; in bullethit()
[all …]
/dports/misc/libsolv/libsolv-0.7.19/ext/
H A Dtestcase.c795 int npieces = 0; in testcase_str2job() local
814 if (npieces < 3) in testcase_str2job()
832 if (npieces > 3) in testcase_str2job()
837 npieces--; in testcase_str2job()
870 if (npieces > 3) in addselectionjob()
875 npieces--; in addselectionjob()
881 if (npieces < 4) in addselectionjob()
1987 int npieces = 0; in testcase_read() local
2046 npieces = 0; in testcase_read()
2187 if (npieces > 3) in testcase_read()
[all …]
/dports/net-p2p/btpd/btpd-0.16/btpd/
H A Dcontent.c190 size_t pfield_size = ceil(tp->npieces / 8.0); in cm_create()
195 cm->bppbf * tp->npieces); in cm_create()
237 assert(cm->npieces_got < tp->npieces); in cm_test_piece()
268 uint32_t start = piece - piece % npieces; in cm_put_bytes()
269 uint32_t end = min(start + npieces, tp->npieces); in cm_put_bytes()
310 return tp->cm->npieces_got == tp->npieces; in cm_full()
386 bzero(cm->pos_field, ceil(tp->npieces / 8.0)); in startup_test_end()
387 for (uint32_t piece = 0; piece < tp->npieces; piece++) { in startup_test_end()
456 if (std->start >= tp->npieces) in startup_test_run()
469 if (piece < tp->npieces) { in startup_test_begin()
[all …]
H A Dpeer.c265 assert(p->nwant < p->npieces); in peer_want()
418 p->piece_field = btpd_calloc(1, (int)ceil(p->n->tp->npieces / 8.0)); in peer_on_shake()
421 ceil(p->n->tp->npieces / 8.0))) in peer_on_shake()
501 p->npieces++; in peer_on_have()
510 assert(p->npieces == 0); in peer_on_bitfield()
511 bcopy(field, p->piece_field, (size_t)ceil(p->n->tp->npieces / 8.0)); in peer_on_bitfield()
512 for (uint32_t i = 0; i < p->n->tp->npieces; i++) { in peer_on_bitfield()
514 p->npieces++; in peer_on_bitfield()
613 p->bad_field = btpd_calloc(ceil(p->n->tp->npieces / 8.0), 1); in peer_bad_piece()
707 return p->npieces == p->n->tp->npieces; in peer_full()
/dports/net-p2p/libbt/libbt-1.06/src/
H A Dsegmenter.c62 DIE_UNLESS(piece>=0 && piece<fs->npieces); in seg_getPiece()
83 if (piece == fs->npieces-1) { in seg_piecelen()
88 DIE_UNLESS(piece>=0 && piece<fs->npieces); in seg_piecelen()
157 btFileSet_create( btFileSet *fs, int npieces, int blocksize, const char *hashbuf) { in btFileSet_create() argument
162 fs->npieces = npieces; in btFileSet_create()
166 fs->hashes = btmalloc( npieces * SHA_DIGEST_LENGTH); in btFileSet_create()
167 memcpy(fs->hashes, hashbuf, npieces * SHA_DIGEST_LENGTH); in btFileSet_create()
168 kBitSet_create(&fs->completed, npieces); in btFileSet_create()
279 piece, fs->npieces, offset, blocksize); in seg_writebuf()
/dports/math/gap/gap-4.11.0/hpcgap/demo/
H A Dorbit2.g28 newSplitHashTableDict := function(hash1, hash2, npieces, magic)
30 r := rec(npieces := npieces, hash1 := hash1, hash2 := hash2, magic := magic,
32 for i in [1..npieces] do
53 h := dict.hash1(obj) mod dict.npieces+1;
61 t.next := t.next + (dict.npieces-1)*dict.magic;
73 h := dict.hash1(obj) mod dict.npieces+1;
85 t.next := t.next + (dict.npieces-1)*dict.magic;
212 for i in [1..d.npieces] do
/dports/math/vtk8/VTK-8.2.0/IO/Parallel/
H A DvtkMultiBlockPLOT3DReader.h388 int piece, int npieces, int nghosts, int timestep,
391 int piece, int npieces, int nghosts, int timestep,
394 int piece, int npieces, int nghosts, int timestep,
409 int npieces,
414 int npieces,
419 int npieces,
/dports/math/vtk9/VTK-9.1.0/IO/Parallel/
H A DvtkMultiBlockPLOT3DReader.h386 int ReadMesh(int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) override;
387 int ReadPoints(int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) override;
388 int ReadArrays(int piece, int npieces, int nghosts, int timestep, vtkDataObject* output) override;
401 const std::string& fname, int piece, int npieces, int nghosts, vtkDataObject* output) override;
403 const std::string& fname, int piece, int npieces, int nghosts, vtkDataObject* output) override;
405 const std::string& fname, int piece, int npieces, int nghosts, vtkDataObject* output) override;
/dports/math/vtk6/VTK-6.2.0/IO/ParallelXML/Testing/Python/
H A DtestParallelXMLWriters.py98 npieces = 16
99 writer.SetNumberOfPieces(npieces)
100 pperrank = npieces / nranks
136 for i in range(npieces):
/dports/math/vtk8/VTK-8.2.0/Filters/Extraction/
H A DvtkProbeSelectedLocations.cxx139 int npieces = 1; in RequestData() local
146 npieces = outInfo->Get( in RequestData()
156 subFilter->UpdatePiece(piece, npieces, 0, uExtent); in RequestData()
/dports/math/vtk9/VTK-9.1.0/Filters/Extraction/
H A DvtkProbeSelectedLocations.cxx133 int npieces = 1; in RequestData() local
138 npieces = outInfo->Get(vtkStreamingDemandDrivenPipeline::UPDATE_NUMBER_OF_PIECES()); in RequestData()
145 subFilter->UpdatePiece(piece, npieces, 0, uExtent); in RequestData()
/dports/math/vtk6/VTK-6.2.0/Filters/Extraction/
H A DvtkProbeSelectedLocations.cxx144 int npieces = -1; in RequestData() local
151 npieces = outInfo->Get( in RequestData()
153 subFilter->SetUpdateExtent(0, piece, npieces, 0); in RequestData()
/dports/net-p2p/gtorrentviewer/GTorrentViewer-0.2b/src/
H A Dmain.c518 guint firstpiece, npieces; in check_files() member
587 COL_FILE_N_PIECES, &files_queue[i].npieces, in check_files()
595 offset = files_queue[i].filesize - piece_size*(files_queue[i].npieces-1); in check_files()
597 offset += files_queue[i].filesize - piece_size*(files_queue[i].npieces-1); in check_files()
633 …i > 0 && (files_queue[i].firstpiece == files_queue[i-1].firstpiece + files_queue[i-1].npieces - 1)) in check_files()
635 …bit(files_queue[i-1].pieces_array, files_queue[i-1].firstpiece+files_queue[i-1].npieces-1) == TRUE) in check_files()
644 for( ; j < files_queue[i].npieces && !feof(fp); j++) in check_files()
658 if(j == files_queue[i].npieces-1) in check_files()
/dports/net-p2p/libbt/libbt-1.06/include/
H A Dsegmenter.h34 int npieces; member
39 btFileSet* btFileSet_create( btFileSet *fs, int npieces, int blocksize, const char *hashbuf) ;
/dports/math/vtk8/VTK-8.2.0/IO/ParallelXML/Testing/Python/
H A DtestParallelXMLWriters.py123 npieces = 16
124 writer.SetNumberOfPieces(npieces)
125 pperrank = npieces // nranks
173 for i in range(npieces):

12345