Lines Matching refs:idx
245 uint32_t idx;
266 idx = in_hatches(d,hpathname);
267 if(!idx){ // add path/color if not already present
390 idx = in_hatches(d,hatchname);
391 if(!idx){ // add it if not already present
400 idx = d->hatches.count;
407 idx = in_hatches(d,hbkname);
408 if(!idx){ // add path/color if not already present. Hatchtype is not needed in the name.
422 idx = in_hatches(d,hatchname);
423 if(!idx){ // add it if not already present
435 idx = d->hatches.count;
438 return(idx-1);
462 set idx to 2^32-1 and let the caller handle it.
467 uint32_t idx;
533 idx = in_images(d, (char *) base64String);
534 if(!idx){ // add it if not already present - we looked at the actual data for comparison
536 idx = d->images.count;
539 sprintf(imagename,"EMFimage%d",idx++);
585 sprintf(imrotname,"EMFrotimage%d_%d",idx-1,tangle);
587 idx = in_images(d, (char *) base64String); // scan for this "image"
588 if(!idx){
590 idx = d->images.count;
592 sprintf(imrotname,"EMFimage%d",idx++);
609 return(idx-1);
647 uint32_t idx;
681 idx = in_gradients(d,hgradname);
682 if(!idx){ // gradient does not yet exist
685 idx = d->gradients.count;
717 return(idx-1);
756 uint32_t idx = in_clips(d, combined);
757 if(!idx){ // add clip if not already present
774 d->dc[d->level].clip_id = idx;