pfnFillSolid;\n rbc.iSolidColor = iSolidColor;\n }\n else\n {\n pfnFill = ppdev->pfnFillPat;\n rbc.prb = prb;\n }\n\n // '69' is 'PDSxxn', and that is exactly what we do:\n\n if (psoSrc->iType != STYPE_BITMAP)\n ppdev->pfnCopyBlt(ppdev, c, prcl, SCREEN_XOR_NEW, pptlSrc, prclDst);\n else\n {\n if (psoSrc->iBitmapFormat == BMF_1BPP)\n pfnXfer = ppdev->pfnXfer1bpp;\n else\n pfnXfer = ppdev->pfnXferNative;\n\n pfnXfer(ppdev, c, prcl, SCREEN_XOR_NEW, SCREEN_XOR_NEW, psoSrc, pptlSrc,\n prclDst, pxlo);\n }\n\n // XOR is commutative, but we do the bitmap transfer first so that\n // we don't have to sit around waiting for the patblt to finish:\n\n pfnFill(ppdev, c, prcl, ulHwForeMix, ulHwForeMix, rbc, pptlBrush);\n}\n\n/******************************Public*Routine******************************\\\n* VOID vMaskRopAACCorCCAA\n*\n* Performs an 'AACC' or 'CCAA' simple MaskBlt in three passes using the\n* hardware when the source is in off-screen memory.\n*\n\\**************************************************************************/\n\nVOID vMaskRopAACCorCCAA( // Type FNMASK\nPDEV* ppdev,\nLONG c, // Can't be zero\nRECTL* prcl, // Array of relative coordinates destination\n // rectangles\nULONG ulHwForeMix, // Foreground mix\nULONG ulHwBackMix, // Background mix\nSURFOBJ* psoMsk, // Mask surface\nPOINTL* pptlMsk, // Original unclipped mask source point\nSURFOBJ* psoSrc, // Not used\nPOINTL* pptlSrc, // Original unclipped source point\nRECTL* prclDst, // Original unclipped destination rectangle\nULONG iSolidColor, // Not used\nRBRUSH* prb, // Not used\nPOINTL* pptlBrush, // Not used\nXLATEOBJ* pxlo) // Not used\n{\n XLATEOBJ xlo;\n XLATECOLORS xlc;\n\n ASSERTDD(c > 0, \"Can't handle zero rectangles\");\n ASSERTDD(pptlMsk != NULL, \"Can't have a NULL pptlmask\");\n ASSERTDD(psoMsk->iBitmapFormat == BMF_1BPP, \"Can only be a 1bpp mask\");\n ASSERTDD(!OVERLAP(prclDst, pptlSrc), \"Source and dest can't overlap!\");\n ASSERTDD((ulHwForeMix == SCREEN_AND_NEW) ||\n (ulHwForeMix == SCREEN_AND_NOT_NEW),\n \"Unexpected mix\");\n\n // Fake up a translate:\n\n xlc.iForeColor = (ULONG) -1;\n xlc.iBackColor = 0;\n xlo.pulXlate = (ULONG*) &xlc;\n\n // First XOR the source, then AND the mask, then XOR the source again:\n\n ppdev->pfnCopyBlt(ppdev, c, prcl, SCREEN_XOR_NEW, pptlSrc, prclDst);\n\n ppdev->pfnXfer1bpp(ppdev, c, prcl, ulHwForeMix, ulHwForeMix, psoMsk,\n pptlMsk, prclDst, &xlo);\n\n ppdev->pfnCopyBlt(ppdev, c, prcl, SCREEN_XOR_NEW, pptlSrc, prclDst);\n}\n\n/******************************Public*Routine******************************\\\n* BOOL bPuntBlt\n*\n* Has GDI do any drawing operations that we don't specifically handle\n* in the driver.\n*\n\\**************************************************************************/\n\nBOOL bPuntBlt(\nSURFOBJ* psoDst,\nSURFOBJ* psoSrc,\nSURFOBJ* psoMsk,\nCLIPOBJ* pco,\nXLATEOBJ* pxlo,\nRECTL* prclDst,\nPOINTL* pptlSrc,\nPOINTL* pptlMsk,\nBRUSHOBJ* pbo,\nPOINTL* pptlBrush,\nROP4 rop4)\n{\n #if DBG\n {\n //////////////////////////////////////////////////////////////////////\n // Diagnostics\n //\n // Since calling the engine to do any drawing can be rather painful,\n // particularly when the source is an off-screen DFB (since GDI will\n // have to allocate a DIB and call us to make a temporary copy before\n // it can even start drawing), we'll try to avoid it as much as\n // possible.\n //\n // Here we simply spew out information describing the blt whenever\n // this routine gets called (checked builds only, of course):\n\n ULONG ulClip;\n PDEV* ppdev;\n ULONG ulAvec;\n\n if (psoDst->iType != STYPE_BITMAP)\n ppdev = (PDEV*) psoDst->dhpdev;\n else\n ppdev = (PDEV*) psoSrc->dhpdev;\n\n ulClip = (pco == NULL) ? DC_TRIVIAL : pco->iDComplexity;\n\n DISPDBG((1, \">> Punt << Dst format: %li Dst type: %li Clip: %li Rop: %lx\",\n psoDst->iBitmapFormat, psoDst->iType, ulClip, rop4));\n\n if (psoSrc != NULL)\n DISPDBG((1, \" << Src format: %li Src type: %li\",\n psoSrc->iBitmapFormat, psoSrc->iType));\n\n if ((pxlo != NULL) && !(pxlo->flXlate & XO_TRIVIAL) && (psoSrc != NULL))\n {\n if (((psoSrc->iType == STYPE_BITMAP) &&\n (psoSrc->iBitmapFormat != ppdev->iBitmapFormat)) ||\n ((psoDst->iType == STYPE_BITMAP) &&\n (psoDst->iBitmapFormat != ppdev->iBitmapFormat)))\n {\n // Don't bother printing the 'xlate' message when the source\n // is a different bitmap format from the destination -- in\n // those cases we know there always has to be a translate.\n }\n else\n {\n DISPDBG((1, \" << With xlate\"));\n }\n }\n\n // The high 2 bytes of rop4 is not guaranteed to be zero. So in order\n // to get the low 8 bits as index, we have to &ffff before do >>\n ulAvec = gajRop3[rop4 & 0xff] | gajRop3[(rop4 & 0xffff) >> 8];\n\n if ((ulAvec & AVEC_NEED_PATTERN) && (pbo->iSolidColor == -1))\n {\n if (pbo->pvRbrush == NULL)\n DISPDBG((1, \" << With brush -- Not created\"));\n else\n DISPDBG((1, \" << With brush -- Created Ok\"));\n }\n }\n #endif\n\n #if GDI_BANKING\n {\n //////////////////////////////////////////////////////////////////////\n // Banked Framebuffer bPuntBlt\n //\n // This section of code handles a PuntBlt when GDI can directly draw\n // on the framebuffer, but the drawing has to be done in banks:\n\n BANK bnk;\n PDEV* ppdev;\n BOOL b;\n HSURF hsurfTmp;\n SURFOBJ* psoTmp;\n SIZEL sizl;\n POINTL ptlSrc;\n RECTL rclTmp;\n RECTL rclDst;\n\n // We copy the original destination rectangle, and use that in every\n // GDI call-back instead of the original because sometimes GDI is\n // sneaky and points 'prclDst' to '&pco->rclBounds'. Because we\n // modify 'rclBounds', that would affect 'prclDst', which we don't\n // want to happen:\n\n rclDst = *prclDst;\n\n if ((psoSrc == NULL) || (psoSrc->iType == STYPE_BITMAP))\n {\n ASSERTDD(psoDst->iType != STYPE_BITMAP,\n \"Dest should be the screen when given a DIB source\");\n\n // Do a memory-to-screen blt:\n\n ppdev = (PDEV*) psoDst->dhpdev;\n\n vBankStart(ppdev, &rclDst, pco, &bnk);\n\n b = TRUE;\n do {\n b &= EngBitBlt(bnk.pso, psoSrc, psoMsk, bnk.pco, pxlo,\n &rclDst, pptlSrc, pptlMsk, pbo, pptlBrush,\n rop4);\n\n } while (bBankEnum(&bnk));\n }\n else\n {\n // The screen is the source (it may be the destination too...)\n\n ppdev = (PDEV*) psoSrc->dhpdev;\n\n ptlSrc.x = pptlSrc->x + ppdev->xOffset;\n ptlSrc.y = pptlSrc->y + ppdev->yOffset;\n\n if ((pco != NULL) && (pco->iDComplexity != DC_TRIVIAL))\n {\n // We have to intersect the destination rectangle with\n // the clip bounds if there is one (consider the case\n // where the app asked to blt a really, really big\n // rectangle from the screen -- prclDst would be really,\n // really big but pco->rclBounds would be the actual\n // area of interest):\n\n rclDst.left = max(rclDst.left, pco->rclBounds.left);\n rclDst.top = max(rclDst.top, pco->rclBounds.top);\n rclDst.right = min(rclDst.right, pco->rclBounds.right);\n rclDst.bottom = min(rclDst.bottom, pco->rclBounds.bottom);\n\n // Correspondingly, we have to offset the source point:\n\n ptlSrc.x += (rclDst.left - prclDst->left);\n ptlSrc.y += (rclDst.top - prclDst->top);\n }\n\n // We're now either going to do a screen-to-screen or screen-to-DIB\n // blt. In either case, we're going to create a temporary copy of\n // the source. (Why do we do this when GDI could do it for us?\n // GDI would create a temporary copy of the DIB for every bank\n // call-back!)\n\n sizl.cx = rclDst.right - rclDst.left;\n sizl.cy = rclDst.bottom - rclDst.top;\n\n // Don't forget to convert from relative to absolute coordinates\n // on the source! (vBankStart takes care of that for the\n // destination.)\n\n rclTmp.right = sizl.cx;\n rclTmp.bottom = sizl.cy;\n rclTmp.left = 0;\n rclTmp.top = 0;\n\n // GDI does guarantee us that the blt extents have already been\n // clipped to the surface boundaries (we don't have to worry\n // here about trying to read where there isn't video memory).\n // Let's just assert to make sure:\n\n ASSERTDD((ptlSrc.x >= 0) &&\n (ptlSrc.y >= 0) &&\n (ptlSrc.x + sizl.cx <= ppdev->cxMemory) &&\n (ptlSrc.y + sizl.cy <= ppdev->cyMemory),\n \"Source rectangle out of bounds!\");\n\n hsurfTmp = (HSURF) EngCreateBitmap(sizl,\n 0, // Let GDI choose ulWidth\n ppdev->iBitmapFormat,\n 0, // Don't need any options\n NULL);// Let GDI allocate\n\n if (hsurfTmp != 0)\n {\n psoTmp = EngLockSurface(hsurfTmp);\n\n if (psoTmp != NULL)\n {\n vGetBits(ppdev, psoTmp, &rclTmp, &ptlSrc);\n\n if (psoDst->iType == STYPE_BITMAP)\n {\n // It was a Screen-to-DIB blt; now it's a DIB-to-DIB\n // blt. Note that the source point is (0, 0) in our\n // temporary surface:\n\n b = EngBitBlt(psoDst, psoTmp, psoMsk, pco, pxlo,\n &rclDst, (POINTL*) &rclTmp, pptlMsk,\n pbo, pptlBrush, rop4);\n }\n else\n {\n // It was a Screen-to-Screen blt; now it's a DIB-to-\n // screen blt. Note that the source point is (0, 0)\n // in our temporary surface:\n\n vBankStart(ppdev, &rclDst, pco, &bnk);\n\n b = TRUE;\n do {\n b &= EngBitBlt(bnk.pso, psoTmp, psoMsk, bnk.pco,\n pxlo, &rclDst, (POINTL*) &rclTmp,\n pptlMsk, pbo, pptlBrush, rop4);\n\n } while (bBankEnum(&bnk));\n }\n\n EngUnlockSurface(psoTmp);\n }\n\n EngDeleteSurface(hsurfTmp);\n }\n }\n\n return(b);\n }\n #else\n {\n //////////////////////////////////////////////////////////////////////\n // Really Slow bPuntBlt\n //\n // Here we handle a PuntBlt when GDI can't draw directly on the\n // framebuffer (as on the Alpha, which can't do it because of its\n // 32 bit bus). If you thought the banked version was slow, just\n // look at this one. Guaranteed, there will be at least one bitmap\n // allocation and extra copy involved; there could be two if it's a\n // screen-to-screen operation.\n\n PDEV* ppdev;\n POINTL ptlSrc;\n RECTL rclDst;\n SIZEL sizl;\n ULONG ulAvec;\n BOOL bSrcIsScreen;\n HSURF hsurfSrc;\n RECTL rclTmp;\n BOOL b;\n LONG lDelta;\n BYTE* pjBits;\n BYTE* pjScan0;\n HSURF hsurfDst;\n RECTL rclScreen;\n\n b = FALSE; // Fore error cases, assume we'll fail\n\n rclDst = *prclDst;\n if (pptlSrc != NULL)\n ptlSrc = *pptlSrc;\n\n if ((pco != NULL) && (pco->iDComplexity != DC_TRIVIAL))\n {\n // We have to intersect the destination rectangle with\n // the clip bounds if there is one (consider the case\n // where the app asked to blt a really, really big\n // rectangle from the screen -- prclDst would be really,\n // really big but pco->rclBounds would be the actual\n // area of interest):\n\n rclDst.left = max(rclDst.left, pco->rclBounds.left);\n rclDst.top = max(rclDst.top, pco->rclBounds.top);\n rclDst.right = min(rclDst.right, pco->rclBounds.right);\n rclDst.bottom = min(rclDst.bottom, pco->rclBounds.bottom);\n\n ptlSrc.x += (rclDst.left - prclDst->left);\n ptlSrc.y += (rclDst.top - prclDst->top);\n }\n\n sizl.cx = rclDst.right - rclDst.left;\n sizl.cy = rclDst.bottom - rclDst.top;\n\n // The high 2 bytes of rop4 is not guaranteed to be zero. So in order\n // to get the low 8 bits as index, we have to &ffff before do >>\n ulAvec = gajRop3[rop4 & 0xff] | gajRop3[(rop4 & 0xffff) >> 8];\n\n bSrcIsScreen = ((ulAvec & AVEC_NEED_SOURCE) &&\n (psoSrc->iType != STYPE_BITMAP));\n\n if (bSrcIsScreen)\n {\n ppdev = (PDEV*) psoSrc->dhpdev;\n\n // We need to create a copy of the source rectangle:\n\n hsurfSrc = (HSURF) EngCreateBitmap(sizl, 0, ppdev->iBitmapFormat,\n 0, NULL);\n if (hsurfSrc == 0)\n goto Error_0;\n\n psoSrc = EngLockSurface(hsurfSrc);\n if (psoSrc == NULL)\n goto Error_1;\n\n rclTmp.left = 0;\n rclTmp.top = 0;\n rclTmp.right = sizl.cx;\n rclTmp.bottom = sizl.cy;\n\n // vGetBits takes absolute coordinates for the source point:\n\n ptlSrc.x += ppdev->xOffset;\n ptlSrc.y += ppdev->yOffset;\n\n vGetBits(ppdev, psoSrc, &rclTmp, &ptlSrc);\n\n // The source will now come from (0, 0) of our temporary source\n // surface:\n\n ptlSrc.x = 0;\n ptlSrc.y = 0;\n }\n\n if (psoDst->iType == STYPE_BITMAP)\n {\n b = EngBitBlt(psoDst, psoSrc, psoMsk, pco, pxlo, &rclDst, &ptlSrc,\n pptlMsk, pbo, pptlBrush, rop4);\n }\n else\n {\n ppdev = (PDEV*) psoDst->dhpdev;\n\n // We need to create a temporary work buffer. We have to do\n // some fudging with the offsets so that the upper-left corner\n // of the (relative coordinates) clip object bounds passed to\n // GDI will be transformed to the upper-left corner of our\n // temporary bitmap.\n\n // The alignment doesn't have to be as tight as this at 16bpp\n // and 32bpp, but it won't hurt:\n\n lDelta = (((rclDst.right + 3) & ~3L) - (rclDst.left & ~3L))\n << ppdev->cPelSize;\n\n // We're actually only allocating a bitmap that is 'sizl.cx' x\n // 'sizl.cy' in size:\n\n pjBits = EngAllocMem(0, lDelta * sizl.cy, ALLOC_TAG);\n if (pjBits == NULL)\n goto Error_2;\n\n // We now adjust the surface's 'pvScan0' so that when GDI thinks\n // it's writing to pixel (rclDst.top, rclDst.left), it will\n // actually be writing to the upper-left pixel of our temporary\n // bitmap:\n\n pjScan0 = pjBits - (rclDst.top * lDelta)\n - ((rclDst.left & ~3L) << ppdev->cPelSize);\n\n ASSERTDD((((ULONG) pjScan0) & 3) == 0,\n \"pvScan0 must be dword aligned!\");\n\n // The checked build of GDI sometimes checks on blts that\n // prclDst->right <= pso->sizl.cx, so we lie to it about\n // the size of our bitmap:\n\n sizl.cx = rclDst.right;\n sizl.cy = rclDst.bottom;\n\n hsurfDst = (HSURF) EngCreateBitmap(\n sizl, // Bitmap covers rectangle\n lDelta, // Use this delta\n ppdev->iBitmapFormat, // Same colour depth\n BMF_TOPDOWN, // Must have a positive delta\n pjScan0); // Where (0, 0) would be\n\n if ((hsurfDst == 0) ||\n (!EngAssociateSurface(hsurfDst, ppdev->hdevEng, 0)))\n goto Error_3;\n\n psoDst = EngLockSurface(hsurfDst);\n if (psoDst == NULL)\n goto Error_4;\n\n // Make sure that the rectangle we Get/Put from/to the screen\n // is in absolute coordinates:\n\n rclScreen.left = rclDst.left + ppdev->xOffset;\n rclScreen.right = rclDst.right + ppdev->xOffset;\n rclScreen.top = rclDst.top + ppdev->yOffset;\n rclScreen.bottom = rclDst.bottom + ppdev->yOffset;\n\n // It would be nice to get a copy of the destination rectangle\n // only when the ROP involves the destination (or when the source\n // is an RLE), but we can't do that. If the brush is truly NULL,\n // GDI will immediately return TRUE from EngBitBlt, without\n // modifying the temporary bitmap -- and we would proceed to\n // copy the uninitialized temporary bitmap back to the screen.\n\n vGetBits(ppdev, psoDst, &rclDst, (POINTL*) &rclScreen);\n\n b = EngBitBlt(psoDst, psoSrc, psoMsk, pco, pxlo, &rclDst, &ptlSrc,\n pptlMsk, pbo, pptlBrush, rop4);\n\n vPutBits(ppdev, psoDst, &rclScreen, (POINTL*) &rclDst);\n\n EngUnlockSurface(psoDst);\n\n Error_4:\n\n EngDeleteSurface(hsurfDst);\n\n Error_3:\n\n EngFreeMem(pjBits);\n }\n\n Error_2:\n\n if (bSrcIsScreen)\n {\n EngUnlockSurface(psoSrc);\n\n Error_1:\n\n EngDeleteSurface(hsurfSrc);\n }\n\n Error_0:\n\n return(b);\n }\n #endif\n}\n\n/******************************Public*Routine******************************\\\n* BOOL DrvBitBlt\n*\n* Implements the workhorse routine of a display driver.\n*\n\\**************************************************************************/\n\nBOOL DrvBitBlt(\nSURFOBJ* psoDst,\nSURFOBJ* psoSrc,\nSURFOBJ* psoMsk,\nCLIPOBJ* pco,\nXLATEOBJ* pxlo,\nRECTL* prclDst,\nPOINTL* pptlSrc,\nPOINTL* pptlMsk,\nBRUSHOBJ* pbo,\nPOINTL* pptlBrush,\nROP4 rop4)\n{\n PDEV* ppdev;\n DSURF* pdsurfDst;\n DSURF* pdsurfSrc;\n POINTL ptlSrc;\n BYTE jClip;\n BOOL bMore;\n ULONG ulHwForeMix;\n ULONG ulHwBackMix;\n CLIPENUM ce;\n LONG c;\n RECTL rcl;\n ULONG rop2;\n ULONG rop3;\n FNFILL* pfnFill;\n FNMASK* pfnMask;\n RBRUSH_COLOR rbc; // Realized brush or solid colour\n ULONG iSolidColor;\n RBRUSH* prb;\n XLATECOLORS xlc;\n XLATEOBJ xlo;\n ULONG* pulXlate;\n ULONG ulTmp;\n FNXFER* pfnXfer;\n ULONG iSrcBitmapFormat;\n ULONG iDir;\n\n jClip = (pco == NULL) ? DC_TRIVIAL : pco->iDComplexity;\n\n if (psoSrc == NULL)\n {\n ///////////////////////////////////////////////////////////////////\n // Fills\n ///////////////////////////////////////////////////////////////////\n\n // Fills are this function's \"raison d'etre\" (which is French\n // for \"purple armadillo\"), so we handle them as quickly as\n // possible:\n\n pdsurfDst = (DSURF*) psoDst->dhsurf;\n\n ASSERTDD((psoDst->iType == STYPE_DEVICE) ||\n (psoDst->iType == STYPE_DEVBITMAP),\n \"Expect only device destinations when no source\");\n\n if (pdsurfDst->dt == DT_SCREEN)\n {\n ppdev = (PDEV*) psoDst->dhpdev;\n\n ppdev->xOffset = pdsurfDst->poh->x;\n ppdev->yOffset = pdsurfDst->poh->y;\n\n // Make sure it doesn't involve a mask (i.e., it's really a\n // Rop3):\n\n if ((rop4 >> 8) == (rop4 & 0xff))\n {\n rop2 = (BYTE) (rop4 & 0xff);\n\n // We now want to see if we can convert this Rop3 to a Rop2\n // between the Destination and the Pattern. We could do\n // a byte look-up on 'Rop3', but that would involve a\n // 1/4 Kbyte table which sort of big. So we twiddle\n // the bits of the Rop3 to get a Rop2.\n\n if ((((rop2 >> 2) ^ (rop2)) & 0x33) == 0)\n {\n // The ROP3 doesn't require a source...\n\n rop2 >>= 2;\n rop2 &= 0xf; // Effectively rop2 between Dest and Pattern\n\n // Admittedly, we're doing a lookup here to convert the\n // rop2 to the hardware mix, but it's only 16 entries\n // long:\n\n ulHwForeMix = gaulHwMixFromRop2[rop2];\n ulHwBackMix = ulHwForeMix;\n\n ppdev->bRealizeTransparent = FALSE;\n\n // The nice thing about the mix values for this hardware\n // is that they are ordered so that values 0 through 3\n // are the ones that don't require a source. So we can\n // do a simple logical-and operation on the hardware mix\n // to see if we need to get a brush:\n\n // NOTE: The following check depends on the actual ordering\n // of the mix values for the hardware! If your mixes\n // are ordered differently, you may have to make this\n // into a 16-case switch statement on (rop2 + 1),\n // comparing it to each of the R2_ rops declared in\n // windows.h.\n\n Fill_It:\n\n pfnFill = ppdev->pfnFillSolid;\n if (ulHwForeMix & MIX_NEEDSPATTERN)\n {\n rbc.iSolidColor = pbo->iSolidColor;\n if (rbc.iSolidColor == -1)\n {\n // Try and realize the pattern brush; by doing\n // this call-back, GDI will eventually call us\n // again through DrvRealizeBrush:\n\n rbc.prb = pbo->pvRbrush;\n if (rbc.prb == NULL)\n {\n rbc.prb = BRUSHOBJ_pvGetRbrush(pbo);\n if (rbc.prb == NULL)\n {\n // If we couldn't realize the brush, punt\n // the call (it may have been a non 8x8\n // brush or something, which we can't be\n // bothered to handle, so let GDI do the\n // drawing):\n\n goto Punt_It;\n }\n }\n pfnFill = ppdev->pfnFillPat;\n }\n }\n\n // Note that these 2 'if's are more efficient than\n // a switch statement:\n\n if (jClip == DC_TRIVIAL)\n {\n pfnFill(ppdev, 1, prclDst, ulHwForeMix, ulHwBackMix,\n rbc, pptlBrush);\n goto All_Done;\n }\n else if (jClip == DC_RECT)\n {\n if (bIntersect(prclDst, &pco->rclBounds, &rcl))\n pfnFill(ppdev, 1, &rcl, ulHwForeMix, ulHwBackMix,\n rbc, pptlBrush);\n goto All_Done;\n }\n else\n {\n CLIPOBJ_cEnumStart(pco, FALSE, CT_RECTANGLES,\n CD_ANY, 0);\n\n do {\n bMore = CLIPOBJ_bEnum(pco, sizeof(ce),\n (ULONG*) &ce);\n\n c = cIntersect(prclDst, ce.arcl, ce.c);\n\n if (c != 0)\n pfnFill(ppdev, c, ce.arcl, ulHwForeMix,\n ulHwBackMix, rbc, pptlBrush);\n\n } while (bMore);\n goto All_Done;\n }\n }\n }\n }\n }\n\n if ((psoSrc != NULL) && (psoSrc->iType == STYPE_DEVBITMAP))\n {\n pdsurfSrc = (DSURF*) psoSrc->dhsurf;\n if (pdsurfSrc->dt == DT_DIB)\n {\n // Here we consider putting a DIB DFB back into off-screen\n // memory. If there's a translate, it's probably not worth\n // moving since we won't be able to use the hardware to do\n // the blt (a similar argument could be made for weird rops\n // and stuff that we'll only end up having GDI simulate, but\n // those should happen infrequently enough that I don't care).\n\n if ((pxlo == NULL) || (pxlo->flXlate & XO_TRIVIAL))\n {\n ppdev = (PDEV*) psoSrc->dhpdev;\n\n // See 'DrvCopyBits' for some more comments on how this\n // moving-it-back-into-off-screen-memory thing works:\n\n if (pdsurfSrc->iUniq == ppdev->iHeapUniq)\n {\n if (--pdsurfSrc->cBlt == 0)\n {\n if (bMoveDibToOffscreenDfbIfRoom(ppdev, pdsurfSrc))\n goto Continue_It;\n }\n }\n else\n {\n // Some space was freed up in off-screen memory,\n // so reset the counter for this DFB:\n\n pdsurfSrc->iUniq = ppdev->iHeapUniq;\n pdsurfSrc->cBlt = HEAP_COUNT_DOWN;\n }\n }\n\n psoSrc = pdsurfSrc->pso;\n\n // Handle the case where the source is a DIB DFB and the\n // destination is a regular bitmap:\n\n if (psoDst->iType == STYPE_BITMAP)\n goto EngBitBlt_It;\n\n }\n }\n\nContinue_It:\n\n if (psoDst->iType == STYPE_DEVBITMAP)\n {\n pdsurfDst = (DSURF*) psoDst->dhsurf;\n if (pdsurfDst->dt == DT_DIB)\n {\n psoDst = pdsurfDst->pso;\n\n // If the destination is a DIB, we can only handle this\n // call if the source is not a DIB:\n\n if ((psoSrc == NULL) || (psoSrc->iType == STYPE_BITMAP))\n goto EngBitBlt_It;\n }\n }\n\n // At this point, we know that either the source or the destination is\n // not a DIB. Check for a DFB to screen, DFB to DFB, or screen to DFB\n // case:\n\n if ((psoSrc != NULL) &&\n (psoDst->iType != STYPE_BITMAP) &&\n (psoSrc->iType != STYPE_BITMAP))\n {\n pdsurfSrc = (DSURF*) psoSrc->dhsurf;\n pdsurfDst = (DSURF*) psoDst->dhsurf;\n\n ASSERTDD(pdsurfSrc->dt == DT_SCREEN, \"Expected screen source\");\n ASSERTDD(pdsurfDst->dt == DT_SCREEN, \"Expected screen destination\");\n\n ptlSrc.x = pptlSrc->x - (pdsurfDst->poh->x - pdsurfSrc->poh->x);\n ptlSrc.y = pptlSrc->y - (pdsurfDst->poh->y - pdsurfSrc->poh->y);\n\n pptlSrc = &ptlSrc;\n psoSrc = psoDst;\n }\n\n if (psoDst->iType != STYPE_BITMAP)\n {\n pdsurfDst = (DSURF*) psoDst->dhsurf;\n ppdev = (PDEV*) psoDst->dhpdev;\n\n ppdev->xOffset = pdsurfDst->poh->x;\n ppdev->yOffset = pdsurfDst->poh->y;\n }\n else\n {\n pdsurfSrc = (DSURF*) psoSrc->dhsurf;\n ppdev = (PDEV*) psoSrc->dhpdev;\n\n ppdev->xOffset = pdsurfSrc->poh->x;\n ppdev->yOffset = pdsurfSrc->poh->y;\n }\n\n if ((rop4 >> 8) == (rop4 & 0xff))\n {\n // Since we've already handled the cases where the ROP4 is really\n // a ROP3 and no source is required, we can assert...\n\n ASSERTDD((psoSrc != NULL) && (pptlSrc != NULL),\n \"Expected no-source case to already have been handled\");\n\n ///////////////////////////////////////////////////////////////////\n // Bitmap transfers\n ///////////////////////////////////////////////////////////////////\n\n // Since the foreground and background ROPs are the same, we\n // don't have to worry about no stinking masks (it's a simple\n // Rop3).\n\n rop3 = (rop4 & 0xff); // Make it into a Rop3 (we keep the rop4\n // around in case we decide to punt)\n\n if (psoDst->iType != STYPE_BITMAP)\n {\n // The destination is the screen:\n\n if ((rop3 >> 4) == (rop3 & 0xf))\n {\n // The ROP3 doesn't require a pattern:\n\n rop2 = rop3 & 0xf; // Make it into a Rop2\n\n if (psoSrc->iType == STYPE_BITMAP)\n {\n //////////////////////////////////////////////////\n // DIB-to-screen blt\n\n // This section handles 1bpp, 4bpp and 8bpp sources.\n // 1bpp should have 'ulHwForeMix' and 'ulHwBackMix' the\n // same values, and 4bpp and 8bpp ignore 'ulHwBackMix'.\n\n ulHwForeMix = gaulHwMixFromRop2[rop2];\n ulHwBackMix = ulHwForeMix;\n\n iSrcBitmapFormat = psoSrc->iBitmapFormat;\n if (iSrcBitmapFormat == BMF_1BPP)\n {\n pfnXfer = ppdev->pfnXfer1bpp;\n goto Xfer_It;\n }\n else if ((iSrcBitmapFormat == ppdev->iBitmapFormat) &&\n ((pxlo == NULL) || (pxlo->flXlate & XO_TRIVIAL)))\n {\n // Plain SRCCOPY blts will be somewhat faster on the S3\n // if we go through the memory aperture, but\n // DrvCopyBits should take care of that case, so we\n // won't bother checking for it here.\n\n pfnXfer = ppdev->pfnXferNative;\n goto Xfer_It;\n }\n else if ((iSrcBitmapFormat == BMF_4BPP) &&\n (ppdev->iBitmapFormat == BMF_8BPP))\n {\n pfnXfer = ppdev->pfnXfer4bpp;\n goto Xfer_It;\n }\n }\n else // psoSrc->iType != STYPE_BITMAP\n {\n if ((pxlo == NULL) || (pxlo->flXlate & XO_TRIVIAL))\n {\n //////////////////////////////////////////////////\n // Screen-to-screen blt with no translate\n\n ulHwForeMix = gaulHwMixFromRop2[rop2];\n\n if (jClip == DC_TRIVIAL)\n {\n (ppdev->pfnCopyBlt)(ppdev, 1, prclDst, ulHwForeMix,\n pptlSrc, prclDst);\n goto All_Done;\n }\n else if (jClip == DC_RECT)\n {\n if (bIntersect(prclDst, &pco->rclBounds, &rcl))\n {\n (ppdev->pfnCopyBlt)(ppdev, 1, &rcl, ulHwForeMix,\n pptlSrc, prclDst);\n }\n goto All_Done;\n }\n else\n {\n // Don't forget that we'll have to draw the\n // rectangles in the correct direction:\n\n if (pptlSrc->y >= prclDst->top)\n {\n if (pptlSrc->x >= prclDst->left)\n iDir = CD_RIGHTDOWN;\n else\n iDir = CD_LEFTDOWN;\n }\n else\n {\n if (pptlSrc->x >= prclDst->left)\n iDir = CD_RIGHTUP;\n else\n iDir = CD_LEFTUP;\n }\n\n CLIPOBJ_cEnumStart(pco, FALSE, CT_RECTANGLES,\n iDir, 0);\n\n do {\n bMore = CLIPOBJ_bEnum(pco, sizeof(ce),\n (ULONG*) &ce);\n\n c = cIntersect(prclDst, ce.arcl, ce.c);\n\n if (c != 0)\n {\n (ppdev->pfnCopyBlt)(ppdev, c, ce.arcl,\n ulHwForeMix, pptlSrc, prclDst);\n }\n\n } while (bMore);\n goto All_Done;\n }\n }\n }\n }\n else if (psoSrc->iBitmapFormat == BMF_1BPP)\n {\n pulXlate = pxlo->pulXlate;\n\n if (((pulXlate[0] == 0) && (pulXlate[1] == ppdev->ulWhite)) ||\n ((pulXlate[1] == 0) && (pulXlate[0] == ppdev->ulWhite)))\n {\n // When the brush is solid, and the bitmap colours are\n // black and white, we can handle any rop3 by converting\n // it to a monochrome blt with separate foreground and\n // background mixes.\n //\n // (Note that with the S3 801/805/928/964, we could handle\n // patterns too, using the same trick we use in MaskCopy.\n // This only works for black and white source bitmaps,\n // which is the most common call, but unfortunately a\n // certain program which benchmarks these rops messed up\n // and gives non-black and white colours. Since I'll\n // handle those cases using multiple passes, I won't\n // bother to implement this special trick.)\n\n ulHwForeMix = gaulHwMixFromRop2[((rop3 >> 4) & 0xC) |\n ((rop3 >> 2) & 0x3)];\n ulHwBackMix = gaulHwMixFromRop2[((rop3 >> 2) & 0xC) |\n ((rop3 ) & 0x3)];\n pptlMsk = pptlSrc;\n psoMsk = psoSrc;\n if (pulXlate[1] == 0)\n {\n ulTmp = ulHwForeMix;\n ulHwForeMix = ulHwBackMix;\n ulHwBackMix = ulTmp;\n }\n\n // Fall through if the brush isn't solid:\n\n if ( (((ulHwForeMix | ulHwBackMix) & MIX_NEEDSPATTERN) == 0)\n ||(pbo->iSolidColor != -1) )\n {\n goto Handle_Fill_Mask;\n }\n }\n }\n\n // Here we special case some often used rop3's that we can\n // do in two or three passes using the hardware.\n //\n // We only handle 1bpp sources, or sources that are the same\n // pixel depth as the screen (either a bitmap or an off-screen\n // DFB) with no xlate:\n\n if ((psoSrc->iBitmapFormat == BMF_1BPP) ||\n (((pxlo == NULL) || (pxlo->flXlate & XO_TRIVIAL)) &&\n ((psoSrc->iType != STYPE_BITMAP) ||\n (psoSrc->iBitmapFormat == ppdev->iBitmapFormat))))\n {\n if ((psoSrc->iType != STYPE_BITMAP) &&\n (OVERLAP(prclDst, pptlSrc)))\n {\n // We don't handle overlapping rectangles on a\n // screen-to-screen operation:\n\n goto Punt_It;\n }\n\n if (rop3 == 0xb8)\n {\n ulHwForeMix = SCREEN_AND_NEW;\n pfnMask = vMaskRopB8orE2;\n }\n else if (rop3 == 0xe2)\n {\n ulHwForeMix = SCREEN_AND_NOT_NEW;\n pfnMask = vMaskRopB8orE2;\n }\n else if (rop3 == 0x69)\n {\n ulHwForeMix = NOT_SCREEN_XOR_NEW;\n pfnMask = vMaskRop69or96;\n }\n else if (rop3 == 0x96)\n {\n ulHwForeMix = SCREEN_XOR_NEW;\n pfnMask = vMaskRop69or96;\n }\n else\n {\n goto Punt_It;\n }\n\n // All the rop3's that we've special cased need a pattern,\n // so it's safe to realize a brush:\n\n iSolidColor = pbo->iSolidColor;\n if (iSolidColor == -1)\n {\n prb = pbo->pvRbrush;\n if (prb == NULL)\n {\n ppdev->bRealizeTransparent = FALSE;\n prb = BRUSHOBJ_pvGetRbrush(pbo);\n if (prb == NULL)\n goto Punt_It;\n }\n }\n\n goto Mask_It;\n }\n }\n else\n {\n #if defined(i386)\n {\n // We special case screen to monochrome blts because they\n // happen fairly often. We only handle SRCCOPY rops and\n // monochrome destinations (to handle a true 1bpp DIB\n // destination, we would have to do near-colour searches\n // on every colour; as it is, the foreground colour gets\n // mapped to '1', and everything else gets mapped to '0'):\n\n if ((psoDst->iBitmapFormat == BMF_1BPP) &&\n (rop3 == 0xcc) &&\n (pxlo->flXlate & XO_TO_MONO))\n {\n pfnXfer = vXferScreenTo1bpp;\n psoSrc = psoDst; // A misnomer, I admit\n goto Xfer_It;\n }\n }\n #endif // i386\n }\n }\n\n // We're going to handle some true ROP4s, where there's a foreground\n // ROP3 and a background ROP3 associated with the 1bpp mask.\n\n else if (psoMsk != NULL)\n {\n // At this point, we've made sure that we have a true ROP4.\n // This is important because we're about to dereference the\n // mask. I'll assert to make sure that I haven't inadvertently\n // broken the logic for this:\n\n ASSERTDD((rop4 & 0xff) != (rop4 >> 8), \"This handles true ROP4's only\");\n\n ///////////////////////////////////////////////////////////////////\n // True ROP4's\n ///////////////////////////////////////////////////////////////////\n\n // Handle ROP4 where no source is required for either Rop3:\n\n if ((((rop4 >> 2) ^ (rop4)) & 0x3333) == 0)\n {\n ulHwForeMix = gaulHwMixFromRop2[(rop4 >> 2) & 0xf];\n ulHwBackMix = gaulHwMixFromRop2[(rop4 >> 10) & 0xf];\n\nHandle_Fill_Mask:\n\n pfnXfer = ppdev->pfnXfer1bpp;\n if ((ulHwForeMix & MIX_NEEDSPATTERN) ||\n (ulHwBackMix & MIX_NEEDSPATTERN))\n {\n // Fake up a 1bpp XLATEOBJ (note that we should only\n // dereference 'pbo' when it's required by the mix):\n\n xlc.iForeColor = pbo->iSolidColor;\n xlc.iBackColor = xlc.iForeColor;\n\n if (xlc.iForeColor == -1)\n goto Punt_It; // We don't handle non-solid brushes\n }\n\n // Note that when neither the foreground nor the background mix\n // requires a source, the colours in 'xlc' are allowed to be\n // garbage.\n\n xlo.pulXlate = (ULONG*) &xlc;\n pxlo = &xlo;\n psoSrc = psoMsk;\n pptlSrc = pptlMsk;\n goto Xfer_It;\n }\n else if ((((rop4 >> 4) ^ (rop4)) & 0x0f0f) == 0) // No pattern required\n {\n // We're about to dereference 'psoSrc' and 'pptlSrc' --\n // since we already handled the case where neither ROP3\n // required the source, the ROP4 must require a source,\n // so we're safe.\n\n ASSERTDD((psoSrc != NULL) && (pptlSrc != NULL),\n \"No source case should already have been handled!\");\n\n // The operation has to be screen-to-screen, and the rectangles\n // cannot overlap:\n\n if ((psoSrc->iType != STYPE_BITMAP) &&\n (psoDst->iType != STYPE_BITMAP) &&\n ((pxlo == NULL) || (pxlo->flXlate & XO_TRIVIAL)) &&\n !OVERLAP(prclDst, pptlSrc))\n {\n if (ppdev->flCaps & CAPS_MASKBLT_CAPABLE)\n {\n ulHwForeMix = gaulHwMixFromRop2[rop4 & 0xf];\n ulHwBackMix = gaulHwMixFromRop2[(rop4 >> 8) & 0xf];\n\n pfnMask = ppdev->pfnMaskCopy;\n goto Mask_It;\n }\n else\n {\n // We don't have hardware capabilities for doing it in\n // one pass, but we can still do it in three passes\n // using the hardware if it's a standard MaskBlt rop:\n\n if (rop4 == 0xccaa)\n ulHwForeMix = SCREEN_AND_NEW;\n\n else if (rop4 == 0xaacc)\n ulHwForeMix = SCREEN_AND_NOT_NEW;\n\n else\n goto Punt_It;\n\n pfnMask = vMaskRopAACCorCCAA;\n goto Mask_It;\n }\n }\n }\n }\n else if ((rop4 & 0xff00) == (0xaa00) &&\n ((((rop4 >> 2) ^ (rop4)) & 0x33) == 0))\n {\n // The only time GDI will ask us to do a true rop4 using the brush\n // mask is when the brush is 1bpp, and the background rop is AA\n // (meaning it's a NOP):\n\n ASSERTDD(psoMsk == NULL, \"This should be the NULL mask case\");\n\n ulHwForeMix = gaulHwMixFromRop2[(rop4 >> 2) & 0xf];\n ulHwBackMix = LEAVE_ALONE;\n\n ppdev->bRealizeTransparent = TRUE;\n\n goto Fill_It;\n }\n\n // Just fall through to Punt_It...\n\nPunt_It:\n return(bPuntBlt(psoDst,\n psoSrc,\n psoMsk,\n pco,\n pxlo,\n prclDst,\n pptlSrc,\n pptlMsk,\n pbo,\n pptlBrush,\n rop4));\n\n//////////////////////////////////////////////////////////////////////\n// Common bitmap transfer\n\nXfer_It:\n if (jClip == DC_TRIVIAL)\n {\n pfnXfer(ppdev, 1, prclDst, ulHwForeMix, ulHwBackMix, psoSrc, pptlSrc,\n prclDst, pxlo);\n goto All_Done;\n }\n else if (jClip == DC_RECT)\n {\n if (bIntersect(prclDst, &pco->rclBounds, &rcl))\n pfnXfer(ppdev, 1, &rcl, ulHwForeMix, ulHwBackMix, psoSrc, pptlSrc,\n prclDst, pxlo);\n goto All_Done;\n }\n else\n {\n CLIPOBJ_cEnumStart(pco, FALSE, CT_RECTANGLES,\n CD_ANY, 0);\n\n do {\n bMore = CLIPOBJ_bEnum(pco, sizeof(ce),\n (ULONG*) &ce);\n\n c = cIntersect(prclDst, ce.arcl, ce.c);\n\n if (c != 0)\n {\n pfnXfer(ppdev, c, ce.arcl, ulHwForeMix, ulHwBackMix, psoSrc,\n pptlSrc, prclDst, pxlo);\n }\n\n } while (bMore);\n goto All_Done;\n }\n\n//////////////////////////////////////////////////////////////////////\n// Common masked blt\n\nMask_It:\n if (jClip == DC_TRIVIAL)\n {\n pfnMask(ppdev, 1, prclDst, ulHwForeMix, ulHwBackMix,\n psoMsk, pptlMsk, psoSrc, pptlSrc, prclDst,\n iSolidColor, prb, pptlBrush, pxlo);\n goto All_Done;\n }\n else if (jClip == DC_RECT)\n {\n if (bIntersect(prclDst, &pco->rclBounds, &rcl))\n pfnMask(ppdev, 1, &rcl, ulHwForeMix, ulHwBackMix,\n psoMsk, pptlMsk, psoSrc, pptlSrc, prclDst,\n iSolidColor, prb, pptlBrush, pxlo);\n goto All_Done;\n }\n else\n {\n CLIPOBJ_cEnumStart(pco, FALSE, CT_RECTANGLES,\n CD_ANY, 0);\n\n do {\n bMore = CLIPOBJ_bEnum(pco, sizeof(ce),\n (ULONG*) &ce);\n\n c = cIntersect(prclDst, ce.arcl, ce.c);\n\n if (c != 0)\n {\n pfnMask(ppdev, c, ce.arcl, ulHwForeMix, ulHwBackMix,\n psoMsk, pptlMsk, psoSrc, pptlSrc, prclDst,\n iSolidColor, prb, pptlBrush, pxlo);\n }\n\n } while (bMore);\n goto All_Done;\n }\n\n////////////////////////////////////////////////////////////////////////\n// Common DIB blt\n\nEngBitBlt_It:\n\n // Our driver doesn't handle any blt's between two DIBs. Normally\n // a driver doesn't have to worry about this, but we do because\n // we have DFBs that may get moved from off-screen memory to a DIB,\n // where we have GDI do all the drawing. GDI does DIB drawing at\n // a reasonable speed (unless one of the surfaces is a device-\n // managed surface...)\n //\n // If either the source or destination surface in an EngBitBlt\n // call-back is a device-managed surface (meaning it's not a DIB\n // that GDI can draw with), GDI will automatically allocate memory\n // and call the driver's DrvCopyBits routine to create a DIB copy\n // that it can use. So this means that this could handle all 'punts',\n // and we could conceivably get rid of bPuntBlt. But this would have\n // a bad performance impact because of the extra memory allocations\n // and bitmap copies -- you really don't want to do this unless you\n // have to (or your surface was created such that GDI can draw\n // directly onto it) -- I've been burned by this because it's not\n // obvious that the performance impact is so bad.\n //\n // That being said, we only call EngBitBlt when all the surfaces\n // are DIBs:\n\n return(EngBitBlt(psoDst, psoSrc, psoMsk, pco, pxlo, prclDst,\n pptlSrc, pptlMsk, pbo, pptlBrush, rop4));\n\nAll_Done:\n return(TRUE);\n}\n\n/******************************Public*Routine******************************\\\n* BOOL DrvCopyBits\n*\n* Do fast bitmap copies.\n*\n* Note that GDI will (usually) automatically adjust the blt extents to\n* adjust for any rectangular clipping, so we'll rarely see DC_RECT\n* clipping in this routine (and as such, we don't bother special casing\n* it).\n*\n* I'm not sure if the performance benefit from this routine is actually\n* worth the increase in code size, since SRCCOPY BitBlts are hardly the\n* most common drawing operation we'll get. But what the heck.\n*\n* On the S3 it's faster to do straight SRCCOPY bitblt's through the\n* memory aperture than to use the data transfer register; as such, this\n* routine is the logical place to put this special case.\n*\n\\**************************************************************************/\n\nBOOL DrvCopyBits(\nSURFOBJ* psoDst,\nSURFOBJ* psoSrc,\nCLIPOBJ* pco,\nXLATEOBJ* pxlo,\nRECTL* prclDst,\nPOINTL* pptlSrc)\n{\n PDEV* ppdev;\n DSURF* pdsurfSrc;\n DSURF* pdsurfDst;\n RECTL rcl;\n POINTL ptl;\n OH* pohSrc;\n OH* pohDst;\n\n // DrvCopyBits is a fast-path for SRCCOPY blts. But it can still be\n // pretty complicated: there can be translates, clipping, RLEs,\n // bitmaps that aren't the same format as the screen, plus\n // screen-to-screen, DIB-to-screen or screen-to-DIB operations,\n // not to mention DFBs (device format bitmaps).\n //\n // Rather than making this routine almost as big as DrvBitBlt, I'll\n // handle here only the speed-critical cases, and punt the rest to\n // our DrvBitBlt routine.\n //\n // We'll try to handle anything that doesn't involve clipping:\n\n if (((pco == NULL) || (pco->iDComplexity == DC_TRIVIAL)) &&\n ((pxlo == NULL) || (pxlo->flXlate & XO_TRIVIAL)))\n {\n if (psoDst->iType != STYPE_BITMAP)\n {\n // We know the destination is either a DFB or the screen:\n\n ppdev = (PDEV*) psoDst->dhpdev;\n pdsurfDst = (DSURF*) psoDst->dhsurf;\n\n // See if the source is a plain DIB:\n\n if (psoSrc->iType != STYPE_BITMAP)\n {\n pdsurfSrc = (DSURF*) psoSrc->dhsurf;\n\n // Make sure the destination is really the screen or an\n // off-screen DFB (i.e., not a DFB that we've converted\n // to a DIB):\n\n if (pdsurfDst->dt == DT_SCREEN)\n {\n ASSERTDD(psoSrc->iType != STYPE_BITMAP, \"Can't be a DIB\");\n\n if (pdsurfSrc->dt == DT_SCREEN)\n {\n\n Screen_To_Screen:\n\n //////////////////////////////////////////////////////\n // Screen-to-screen\n\n ASSERTDD((psoSrc->iType != STYPE_BITMAP) &&\n (pdsurfSrc->dt == DT_SCREEN) &&\n (psoDst->iType != STYPE_BITMAP) &&\n (pdsurfDst->dt == DT_SCREEN),\n \"Should be a screen-to-screen case\");\n\n // pfnCopyBlt takes relative coordinates (relative\n // to the destination surface, that is), so we have\n // to change the start point to be relative to the\n // destination surface too:\n\n pohSrc = pdsurfSrc->poh;\n pohDst = pdsurfDst->poh;\n\n ptl.x = pptlSrc->x - (pohDst->x - pohSrc->x);\n ptl.y = pptlSrc->y - (pohDst->y - pohSrc->y);\n\n ppdev->xOffset = pohDst->x;\n ppdev->yOffset = pohDst->y;\n\n (ppdev->pfnCopyBlt)(ppdev, 1, prclDst, OVERPAINT, &ptl,\n prclDst);\n return(TRUE);\n }\n else // (pdsurfSrc->dt != DT_SCREEN)\n {\n // Ah ha, the source is a DFB that's really a DIB.\n\n ASSERTDD(psoDst->iType != STYPE_BITMAP,\n \"Destination can't be a DIB here\");\n\n /////////////////////////////////////////////////////\n // Put It Back Into Off-screen?\n //\n // We take this opportunity to decide if we want to\n // put the DIB back into off-screen memory. This is\n // a pretty good place to do it because we have to\n // copy the bits to some portion of the screen,\n // anyway. So we would incur only an extra screen-to-\n // screen blt at this time, much of which will be\n // over-lapped with the CPU.\n //\n // The simple approach we have taken is to move a DIB\n // back into off-screen memory only if there's already\n // room -- we won't throw stuff out to make space\n // (because it's tough to know what ones to throw out,\n // and it's easy to get into thrashing scenarios).\n //\n // Because it takes some time to see if there's room\n // in off-screen memory, we only check one in\n // HEAP_COUNT_DOWN times if there's room. To bias\n // in favour of bitmaps that are often blt, the\n // counters are reset every time any space is freed\n // up in off-screen memory. We also don't bother\n // checking if no space has been freed since the\n // last time we checked for this DIB.\n\n if (pdsurfSrc->iUniq == ppdev->iHeapUniq)\n {\n if (--pdsurfSrc->cBlt == 0)\n {\n if (bMoveDibToOffscreenDfbIfRoom(ppdev,\n pdsurfSrc))\n goto Screen_To_Screen;\n }\n }\n else\n {\n // Some space was freed up in off-screen memory,\n // so reset the counter for this DFB:\n\n pdsurfSrc->iUniq = ppdev->iHeapUniq;\n pdsurfSrc->cBlt = HEAP_COUNT_DOWN;\n }\n\n // Since the destination is definitely the screen,\n // we don't have to worry about creating a DIB to\n // DIB copy case (for which we would have to call\n // EngCopyBits):\n\n psoSrc = pdsurfSrc->pso;\n\n goto DIB_To_Screen;\n }\n }\n else // (pdsurfDst->dt != DT_SCREEN)\n {\n // Because the source is not a DIB, we don't have to\n // worry about creating a DIB to DIB case here (although\n // we'll have to check later to see if the source is\n // really a DIB that's masquerading as a DFB...)\n\n ASSERTDD(psoSrc->iType != STYPE_BITMAP,\n \"Source can't be a DIB here\");\n\n psoDst = pdsurfDst->pso;\n\n goto Screen_To_DIB;\n }\n }\n else if (psoSrc->iBitmapFormat == ppdev->iBitmapFormat)\n {\n // Make sure the destination is really the screen:\n\n if (pdsurfDst->dt == DT_SCREEN)\n {\n\n DIB_To_Screen:\n\n //////////////////////////////////////////////////////\n // DIB-to-screen\n\n ASSERTDD((psoDst->iType != STYPE_BITMAP) &&\n (pdsurfDst->dt == DT_SCREEN) &&\n (psoSrc->iType == STYPE_BITMAP) &&\n (psoSrc->iBitmapFormat == ppdev->iBitmapFormat),\n \"Should be a DIB-to-screen case\");\n\n // vPutBits takes absolute screen coordinates, so\n // we have to muck with the destination rectangle:\n\n pohDst = pdsurfDst->poh;\n\n rcl.left = prclDst->left + pohDst->x;\n rcl.right = prclDst->right + pohDst->x;\n rcl.top = prclDst->top + pohDst->y;\n rcl.bottom = prclDst->bottom + pohDst->y;\n\n // We use the memory aperture to do the transfer,\n // because that is supposed to be faster for SRCCOPY\n // blts than using the data-transfer register:\n\n vPutBits(ppdev, psoSrc, &rcl, pptlSrc);\n return(TRUE);\n }\n }\n }\n else // (psoDst->iType == STYPE_BITMAP)\n {\n\n Screen_To_DIB:\n\n pdsurfSrc = (DSURF*) psoSrc->dhsurf;\n ppdev = (PDEV*) psoSrc->dhpdev;\n\n if (psoDst->iBitmapFormat == ppdev->iBitmapFormat)\n {\n if (pdsurfSrc->dt == DT_SCREEN)\n {\n //////////////////////////////////////////////////////\n // Screen-to-DIB\n\n ASSERTDD((psoSrc->iType != STYPE_BITMAP) &&\n (pdsurfSrc->dt == DT_SCREEN) &&\n (psoDst->iType == STYPE_BITMAP) &&\n (psoDst->iBitmapFormat == ppdev->iBitmapFormat),\n \"Should be a screen-to-DIB case\");\n\n // vGetBits takes absolute screen coordinates, so we have\n // to muck with the source point:\n\n pohSrc = pdsurfSrc->poh;\n\n ptl.x = pptlSrc->x + pohSrc->x;\n ptl.y = pptlSrc->y + pohSrc->y;\n\n vGetBits(ppdev, psoDst, prclDst, &ptl);\n return(TRUE);\n }\n else\n {\n // The source is a DFB that's really a DIB. Since we\n // know that the destination is a DIB, we've got a DIB\n // to DIB operation, and should call EngCopyBits:\n\n psoSrc = pdsurfSrc->pso;\n goto EngCopyBits_It;\n }\n }\n }\n }\n\n // We can't call DrvBitBlt if we've accidentally converted both\n // surfaces to DIBs, because it isn't equipped to handle it:\n\n ASSERTDD((psoSrc->iType != STYPE_BITMAP) ||\n (psoDst->iType != STYPE_BITMAP),\n \"Accidentally converted both surfaces to DIBs\");\n\n /////////////////////////////////////////////////////////////////\n // A DrvCopyBits is after all just a simplified DrvBitBlt:\n\n return(DrvBitBlt(psoDst, psoSrc, NULL, pco, pxlo, prclDst, pptlSrc, NULL,\n NULL, NULL, 0x0000CCCC));\n\nEngCopyBits_It:\n\n ASSERTDD((psoDst->iType == STYPE_BITMAP) &&\n (psoSrc->iType == STYPE_BITMAP),\n \"Both surfaces should be DIBs to call EngCopyBits\");\n\n return(EngCopyBits(psoDst, psoSrc, pco, pxlo, prclDst, pptlSrc));\n}\n"},"authors":{"kind":"list like","value":["polarisdp@gmail.com"],"string":"[\n \"polarisdp@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"polarisdp@gmail.com"}}},{"rowIdx":971171,"cells":{"blob_id":{"kind":"string","value":"9d05a8d5034521bf66c04c9b22fff31685e6c453"},"directory_id":{"kind":"string","value":"197043eca562582d3d3829a9a349ca4f45ba1797"},"path":{"kind":"string","value":"/0x19-hash_tables/hash_tables.h"},"content_id":{"kind":"string","value":"8551d9676c05ee8775a2f66b64fc79e1d2527c1f"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"cynergist/holbertonschool-low_level_programming"},"snapshot_id":{"kind":"string","value":"352249e94a176f35fb3cab3a9be4fda2c29ab2b3"},"revision_id":{"kind":"string","value":"812c5fe887d17a86a1a17cf242468bef62975e74"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2020-04-21T10:59:40.493660","string":"2020-04-21T10:59:40.493660"},"revision_date":{"kind":"timestamp","value":"2019-10-21T06:16:09","string":"2019-10-21T06:16:09"},"committer_date":{"kind":"timestamp","value":"2019-10-21T06:16:09","string":"2019-10-21T06:16:09"},"github_id":{"kind":"number","value":169505274,"string":"169,505,274"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":1229,"string":"1,229"},"extension":{"kind":"string","value":"h"},"content":{"kind":"string","value":"#ifndef _HASH_TABLES_H_\n#define _HASH_TABLES_H_\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n/**\n * struct hash_node_s - Node of a hash table\n *\n * @key: The key, string\n * The key is unique in the HashTable\n * @value: The value corresponding to a key\n * @next: A pointer to the next node of the List\n */\ntypedef struct hash_node_s\n{\n\tchar *key;\n\tchar *value;\n\tstruct hash_node_s *next;\n} hash_node_t;\n\n/**\n * struct hash_table_s - Hash table data structure\n *\n * @size: The size of the array\n * @array: An array of size @size\n * Each cell of this array is a pointer to the first node of a linked list,\n * because we want our HashTable to use a Chaining collision handling\n */\ntypedef struct hash_table_s\n{\n\tunsigned long int size;\n\thash_node_t **array;\n} hash_table_t;\n\nhash_table_t *hash_table_create(unsigned long int size);\nunsigned long int hash_djb2(const unsigned char *str);\nunsigned long int key_index(const unsigned char *key, unsigned long int size);\nint hash_table_set(hash_table_t *ht, const char *key, const char *value);\nchar *hash_table_get(const hash_table_t *ht, const char *key);\nvoid hash_table_print(const hash_table_t *ht);\nvoid hash_table_delete(hash_table_t *ht);\n#endif /* HASH_TABLES_H */\n"},"authors":{"kind":"list like","value":["cmdominguez@gmail.com"],"string":"[\n \"cmdominguez@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"cmdominguez@gmail.com"}}},{"rowIdx":971172,"cells":{"blob_id":{"kind":"string","value":"dd171b373feb70dd6caa2442dfec64e703b486b9"},"directory_id":{"kind":"string","value":"55f7b2dec9683e36b721303dfc3bb49aa6d162a5"},"path":{"kind":"string","value":"/Ch02/RecursiveBinarySearch.c"},"content_id":{"kind":"string","value":"aafceb3b403ca2f572c619127cfbeb994afa40c8"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"LaSTand/Data_Structure"},"snapshot_id":{"kind":"string","value":"1d538c12058c33aeef36617e6d2f751a7a960b2b"},"revision_id":{"kind":"string","value":"7ce04eaafe95035d604a6e017724d896c6ed2d2c"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2021-01-13T03:17:47.490830","string":"2021-01-13T03:17:47.490830"},"revision_date":{"kind":"timestamp","value":"2017-02-15T10:43:13","string":"2017-02-15T10:43:13"},"committer_date":{"kind":"timestamp","value":"2017-02-15T10:43:13","string":"2017-02-15T10:43:13"},"github_id":{"kind":"number","value":77590280,"string":"77,590,280"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":817,"string":"817"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"#include <stdio.h>\r\n\r\nint BSearchRecur(int ar[], int first, int last, int target)\r\n{\r\n\tint mid;\r\n\tif(first > last)\r\n\t\treturn -1; // -1 means search failed \r\n\tmid = (first+last) / 2; // Calc the mid-value\r\n\r\n\tif(ar[mid] == target)\r\n\t\treturn mid; // End searching\r\n\telse if(target < ar[mid])\r\n\t\treturn BSearchRecur(ar, first, mid-1, target);\r\n\telse\r\n\t\treturn BSearchRecur(ar, mid+1, last, target);\r\n}\r\n\r\nint main(void)\r\n{\r\n\tint arr[] = {1, 3, 5, 7, 9};\r\n\tint idx;\r\n\r\n\tidx = BSearchRecur(arr, 0, sizeof(arr)/sizeof(int)-1, 7);\r\n\tif(idx == -1)\r\n\t\tprintf(\"Search Failed! \\n\");\r\n\telse\r\n\t\tprintf(\"Target located index : %d \\n\", idx);\r\n\r\n\tidx = BSearchRecur(arr, 0, sizeof(arr)/sizeof(int)-1, 2);\r\n\tif(idx == -1)\r\n\t\tprintf(\"Search Failed! \\n\");\r\n\telse\r\n\t\tprintf(\"Target located index : %d \\n\", idx);\r\n\r\n\treturn 0;\r\n}"},"authors":{"kind":"list like","value":["lastand73@gmail.com"],"string":"[\n \"lastand73@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"lastand73@gmail.com"}}},{"rowIdx":971173,"cells":{"blob_id":{"kind":"string","value":"2f88fd56fb6a6bb896a9e26ff114e22c50653655"},"directory_id":{"kind":"string","value":"f395c2daed5962a3f6fce062da5b28e08ab48263"},"path":{"kind":"string","value":"/libxc-2.2.0/src/gga_c_lm.c"},"content_id":{"kind":"string","value":"8b77ec8aef984e1ff4cad130127e8bf99596e0af"},"detected_licenses":{"kind":"list like","value":["LGPL-3.0-only","BSD-3-Clause"],"string":"[\n \"LGPL-3.0-only\",\n \"BSD-3-Clause\"\n]","isConversational":false},"license_type":{"kind":"string","value":"permissive"},"repo_name":{"kind":"string","value":"JefferyQ/lsms"},"snapshot_id":{"kind":"string","value":"c72dc9d81098258ca66daa6850cd9bfc785bfec7"},"revision_id":{"kind":"string","value":"2d975008a829b328161f503109e324a9eae26768"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2020-07-27T14:48:47.312249","string":"2020-07-27T14:48:47.312249"},"revision_date":{"kind":"timestamp","value":"2019-09-17T16:08:36","string":"2019-09-17T16:08:36"},"committer_date":{"kind":"timestamp","value":"2019-09-17T16:08:36","string":"2019-09-17T16:08:36"},"github_id":{"kind":"number","value":209129996,"string":"209,129,996"},"star_events_count":{"kind":"number","value":1,"string":"1"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"string","value":"BSD-3-Clause"},"gha_event_created_at":{"kind":"timestamp","value":"2019-09-17T18:35:44","string":"2019-09-17T18:35:44"},"gha_created_at":{"kind":"timestamp","value":"2019-09-17T18:35:43","string":"2019-09-17T18:35:43"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":5362,"string":"5,362"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"/*\n Copyright (C) 2006-2007 M.A.L. Marques\n\n This program is free software; you can redistribute it and/or modify\n it under the terms of the GNU Lesser General Public License as published by\n the Free Software Foundation; either version 3 of the License, or\n (at your option) any later version.\n \n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Lesser General Public License for more details.\n \n You should have received a copy of the GNU Lesser General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n*/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <assert.h>\n\n#include \"util.h\"\n\n/************************************************************************\n This functional is provided for historical reasons.\n It was one of the first GGAs that ever appeared.\n************************************************************************/\n\n#define XC_GGA_C_LM 137 /* Langreth and Mehl correlation */\n\nstatic void \ngga_c_lm_init(XC(func_type) *p)\n{\n p->n_func_aux = 1;\n p->func_aux = (XC(func_type) **) malloc(1*sizeof(XC(func_type) *));\n p->func_aux[0] = (XC(func_type) *) malloc( sizeof(XC(func_type)));\n\n XC(func_init)(p->func_aux[0], XC_LDA_C_vBH, p->nspin);\n}\n\n\nstatic inline void \nfunc(const XC(func_type) *p, XC(gga_work_c_t) *r)\n{\n const FLOAT a2 = -0.262;\n const FLOAT a3 = -7.0/(9.0*2.0*M_CBRT2*M_CBRT2);\n\n FLOAT a1, alpha;\n FLOAT opz, omz, opz13, omz13, DD, dDDdz, d2DDdz2;\n FLOAT aux1, aux2, daux1drs, daux1dxt, d2aux1drs2, d2aux1dxt2, d2aux1drsxt;\n FLOAT t1, t2, dt1drs, dt1dz, dt1dxt, dt2dz, d2t1drs2, d2t1dxt2, d2t1dz2, d2t2dz2, d2t1drsz, d2t1drsxt, d2t1dzxt;\n\n XC(lda_work_t) pw;\n\n alpha = POW(4.0*M_PI/3.0, 1.0/6.0);\n a1 = M_PI/(16.0*POW(3*M_PI*M_PI, 4/3)); /* 4.28e-3/2.0, where the 2 comes from the covertion from Ryd. to Hartree */\n\n pw.order = r->order;\n pw.rs[0] = SQRT(r->rs);\n pw.rs[1] = r->rs;\n pw.rs[2] = r->rs*r->rs;\n pw.zeta = r->zeta;\n\n XC(lda_c_hl_func)(p->func_aux[0], &pw);\n\n opz = 1.0 + r->zeta;\n omz = 1.0 - r->zeta;\n opz13 = CBRT(opz);\n omz13 = CBRT(omz);\n\n DD = SQRT(opz*opz13*opz13 + omz*omz13*omz13)/M_SQRT2;\n\n aux1 = EXP(a2*r->xt/(alpha*pw.rs[0]));\n aux2 = a1/(alpha*alpha*r->rs);\n\n t1 = r->xt*r->xt*aux1/DD;\n t2 = a3*(r->xs[0]*r->xs[0]*opz*opz13 + r->xs[1]*r->xs[1]*omz*omz13);\n\n r->f = pw.zk + aux2*(t1 + t2);\n\n if(r->order < 1) return;\n\n dDDdz = 5.0/(3.0*4.0*DD)*(opz13*opz13 - omz13*omz13);\n daux1drs = -a2*r->xt/(2.0*alpha*r->rs*pw.rs[0])*aux1;\n daux1dxt = a2/(alpha*pw.rs[0])*aux1;\n\n dt1drs = r->xt*r->xt*daux1drs/DD;\n dt1dz = -r->xt*r->xt*aux1*dDDdz/(DD*DD);\n dt1dxt = r->xt*(2.0*aux1 + r->xt*daux1dxt)/DD;\n\n dt2dz = a3*(4.0/3.0)*(r->xs[0]*r->xs[0]*opz13 - r->xs[1]*r->xs[1]*omz13);\n\n r->dfdrs = pw.dedrs + aux2*(-(t1 + t2)/r->rs + dt1drs);\n r->dfdz = pw.dedz + aux2*(dt1dz + dt2dz);\n r->dfdxt = aux2*dt1dxt;\n r->dfdxs[0] = aux2*(a3*2.0*r->xs[0]*opz*opz13);\n r->dfdxs[1] = aux2*(a3*2.0*r->xs[1]*omz*omz13);\n\n if(r->order < 2) return;\n\n d2DDdz2 = d2t2dz2 = 0.0;\n if(r->zeta < 1.0){\n d2DDdz2 += 1.0/omz13;\n d2t2dz2 += r->xs[1]*r->xs[1]/(omz13*omz13);\n }\n if(r->zeta > -1.0){\n d2DDdz2 += 1.0/opz13;\n d2t2dz2 += r->xs[0]*r->xs[0]/(opz13*opz13);\n }\n\n d2DDdz2 = -dDDdz*dDDdz/DD + 10.0/(36.0*DD)*d2DDdz2;\n d2t2dz2 = a3*(4.0/9.0)*d2t2dz2;\n\n d2aux1drs2 = -a2*r->xt/(2.0*alpha*r->rs*pw.rs[0])*(-3.0/2.0*aux1/r->rs + daux1drs);\n d2aux1drsxt = -a2/(2.0*alpha*r->rs*pw.rs[0])*(aux1 + r->xt*daux1dxt);\n d2aux1dxt2 = a2/(alpha*pw.rs[0])*daux1dxt;\n\n d2t1drs2 = r->xt*r->xt*d2aux1drs2/DD;\n d2t1drsz = -r->xt*r->xt*daux1drs*dDDdz/(DD*DD);\n d2t1drsxt = r->xt*(2.0*daux1drs + r->xt*d2aux1drsxt)/DD;\n d2t1dz2 = r->xt*r->xt*aux1*(2.0*dDDdz*dDDdz - DD*d2DDdz2)/(DD*DD*DD);\n d2t1dzxt = -r->xt*(2.0*aux1 + r->xt*daux1dxt)*dDDdz/(DD*DD);\n\n d2t1dxt2 = (2.0*aux1 + 4.0*r->xt*daux1dxt + r->xt*r->xt*d2aux1dxt2)/DD;\n\n r->d2fdrs2 = pw.d2edrs2 + aux2*(d2t1drs2 - 2.0*dt1drs/r->rs + 2.0*(t1 + t2)/pw.rs[2]);\n r->d2fdrsz = pw.d2edrsz + aux2*(d2t1drsz - (dt1dz + dt2dz)/r->rs);\n r->d2fdrsxt = aux2*(d2t1drsxt - dt1dxt/r->rs);\n r->d2fdrsxs[0] = -aux2/r->rs*(a3*2.0*r->xs[0]*opz*opz13);\n r->d2fdrsxs[1] = -aux2/r->rs*(a3*2.0*r->xs[1]*omz*omz13);\n r->d2fdz2 = pw.d2edz2 + aux2*(d2t1dz2 + d2t2dz2);\n r->d2fdzxt = aux2*d2t1dzxt;;\n r->d2fdzxs[0] = aux2*(a3*8.0/3.0*r->xs[0]*opz13);\n r->d2fdzxs[1] = -aux2*(a3*8.0/3.0*r->xs[1]*omz13);\n r->d2fdxt2 = aux2*d2t1dxt2;\n r->d2fdxtxs[0] = 0.0;\n r->d2fdxtxs[1] = 0.0;\n r->d2fdxs2[0] = aux2*(a3*2.0*opz*opz13);\n r->d2fdxs2[1] = 0.0;\n r->d2fdxs2[2] = aux2*(a3*2.0*omz*omz13);\n\n}\n\n#include \"work_gga_c.c\"\n\nconst XC(func_info_type) XC(func_info_gga_c_lm) = {\n XC_GGA_C_LM,\n XC_CORRELATION,\n \"Langreth & Mehl\",\n XC_FAMILY_GGA,\n \"DC Langreth and MJ Mehl, Phys. Rev. Lett. 47, 446 (1981)\\n\"\n \"CD Hu and DC Langreth, Phys. Scr. 32, 391 (1985)\",\n XC_FLAGS_3D | XC_FLAGS_HAVE_EXC | XC_FLAGS_HAVE_VXC | XC_FLAGS_HAVE_FXC,\n 1e-10, 1e-32, 0.0, 1e-32,\n gga_c_lm_init,\n NULL,\n NULL, /* this is not an LDA */\n work_gga_c,\n NULL\n};\n\n"},"authors":{"kind":"list like","value":["me4@me4macbook.ornl.gov"],"string":"[\n \"me4@me4macbook.ornl.gov\"\n]","isConversational":false},"author_id":{"kind":"string","value":"me4@me4macbook.ornl.gov"}}},{"rowIdx":971174,"cells":{"blob_id":{"kind":"string","value":"805c6cc83e6e69f10fd9d370c0ac51e2b7b8b982"},"directory_id":{"kind":"string","value":"260d6586601ef4e5acca36f77ce11f5efd17a227"},"path":{"kind":"string","value":"/system/STM32L4xx/Include/stm32l4_system.h"},"content_id":{"kind":"string","value":"f907e856b3217887d3b3d08b9fbea0515b1ef292"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"kriswiner/arduino-STM32L4"},"snapshot_id":{"kind":"string","value":"f3636c2d8d577d47e04907c4c2eddf5f63a0c90d"},"revision_id":{"kind":"string","value":"a53ca9d50e0586a7e938318fa3cd09a7e3dc4290"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2020-06-21T11:37:44.963855","string":"2020-06-21T11:37:44.963855"},"revision_date":{"kind":"timestamp","value":"2016-11-25T21:18:50","string":"2016-11-25T21:18:50"},"committer_date":{"kind":"timestamp","value":"2016-11-25T21:18:50","string":"2016-11-25T21:18:50"},"github_id":{"kind":"number","value":74789369,"string":"74,789,369"},"star_events_count":{"kind":"number","value":4,"string":"4"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"timestamp","value":"2016-11-25T21:34:13","string":"2016-11-25T21:34:13"},"gha_created_at":{"kind":"timestamp","value":"2016-11-25T21:34:13","string":"2016-11-25T21:34:13"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":6095,"string":"6,095"},"extension":{"kind":"string","value":"h"},"content":{"kind":"string","value":"/*\n * Copyright (c) 2016 Thomas Roell. All rights reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal with the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimers.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimers in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of Thomas Roell, nor the names of its contributors\n * may be used to endorse or promote products derived from this Software\n * without specific prior written permission.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * WITH THE SOFTWARE.\n */\n\n#if !defined(_STM32L4_SYSTEM_H)\n#define _STM32L4_SYSTEM_H\n\n#include \"armv7m.h\"\n\n#include \"stm32l4xx.h\"\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\nenum {\n SYSTEM_PERIPH_FLASH = 0,\n SYSTEM_PERIPH_SRAM1,\n SYSTEM_PERIPH_SRAM2,\n SYSTEM_PERIPH_DMA1,\n SYSTEM_PERIPH_DMA2,\n SYSTEM_PERIPH_GPIOA,\n SYSTEM_PERIPH_GPIOB,\n#if defined(STM32L433xx) || defined(STM32L476xx)\n SYSTEM_PERIPH_GPIOC,\n SYSTEM_PERIPH_GPIOD,\n SYSTEM_PERIPH_GPIOE,\n#endif\n#if defined(STM32L476xx)\n SYSTEM_PERIPH_GPIOF,\n SYSTEM_PERIPH_GPIOG,\n#endif\n SYSTEM_PERIPH_GPIOH,\n SYSTEM_PERIPH_USB,\n SYSTEM_PERIPH_ADC,\n SYSTEM_PERIPH_QSPI,\n SYSTEM_PERIPH_USART1,\n SYSTEM_PERIPH_USART2,\n#if defined(STM32L433xx) || defined(STM32L476xx)\n SYSTEM_PERIPH_USART3,\n#endif\n#if defined(STM32L476xx)\n SYSTEM_PERIPH_UART4,\n SYSTEM_PERIPH_UART5,\n#endif\n SYSTEM_PERIPH_LPUART1,\n SYSTEM_PERIPH_I2C1,\n#if defined(STM32L433xx) || defined(STM32L476xx)\n SYSTEM_PERIPH_I2C2,\n#endif\n SYSTEM_PERIPH_I2C3,\n SYSTEM_PERIPH_SPI1,\n#if defined(STM32L433xx) || defined(STM32L476xx)\n SYSTEM_PERIPH_SPI2,\n#endif\n SYSTEM_PERIPH_SPI3,\n#if defined(STM32L433xx) || defined(STM32L476xx)\n SYSTEM_PERIPH_SDIO,\n#endif\n SYSTEM_PERIPH_SAI1,\n#if defined(STM32L476xx)\n SYSTEM_PERIPH_SAI2,\n SYSTEM_PERIPH_DFSDM,\n#endif\n SYSTEM_PERIPH_CAN,\n SYSTEM_PERIPH_TIM1,\n SYSTEM_PERIPH_TIM2,\n#if defined(STM32L476xx)\n SYSTEM_PERIPH_TIM3,\n SYSTEM_PERIPH_TIM4,\n SYSTEM_PERIPH_TIM5,\n#endif\n SYSTEM_PERIPH_TIM6,\n SYSTEM_PERIPH_TIM7,\n#if defined(STM32L476xx)\n SYSTEM_PERIPH_TIM8,\n#endif\n SYSTEM_PERIPH_TIM15,\n SYSTEM_PERIPH_TIM16,\n#if defined(STM32L476xx)\n SYSTEM_PERIPH_TIM17,\n#endif\n SYSTEM_PERIPH_LPTIM1,\n SYSTEM_PERIPH_LPTIM2,\n SYSTEM_PERIPH_DAC,\n SYSTEM_PERIPH_COUNT\n};\n\n#define SYSTEM_NOTIFY_COUNT 16\n#define SYSTEM_EVENT_COUNT 5\n\n#define SYSTEM_LOCK_SLEEP 0\n#define SYSTEM_LOCK_STOP_0 1\n#define SYSTEM_LOCK_STOP_1 2\n#define SYSTEM_LOCK_STOP_2 3\n#define SYSTEM_LOCK_STANDBY 4\n#define SYSTEM_LOCK_COUNT 5\n\n#define SYSTEM_EVENT_SUSPEND 0x00000001\n#define SYSTEM_EVENT_RESUME 0x00000002\n#define SYSTEM_EVENT_STANDBY 0x00000004\n#define SYSTEM_EVENT_SHUTDOWN 0x00000008\n#define SYSTEM_EVENT_RESET 0x00000010\n\n#define SYSTEM_INDEX_SUSPEND 0\n#define SYSTEM_INDEX_RESUME 1\n#define SYSTEM_INDEX_STANDBY 2\n#define SYSTEM_INDEX_SHUTDOWN 3\n#define SYSTEM_INDEX_RESET 4\n\ntypedef void (*stm32l4_system_callback_t)(void *context, uint32_t events);\n\nextern void stm32l4_system_periph_reset(unsigned int periph);\nextern void stm32l4_system_periph_enable(unsigned int periph);\nextern void stm32l4_system_periph_disable(unsigned int periph);\nextern void stm32l4_system_periph_wake(unsigned int periph);\nextern void stm32l4_system_periph_sleep(unsigned int periph);\nextern void stm32l4_system_periph_cond_enable(unsigned int periph, volatile uint32_t *p_mask, uint32_t mask);\nextern void stm32l4_system_periph_cond_disable(unsigned int periph, volatile uint32_t *p_mask, uint32_t mask);\nextern void stm32l4_system_periph_cond_wake(unsigned int periph, volatile uint32_t *p_mask, uint32_t mask);\nextern void stm32l4_system_periph_cond_sleep(unsigned int periph, volatile uint32_t *p_mask, uint32_t mask);\nextern bool stm32l4_system_configure(uint32_t lseclk, uint32_t hseclk, uint32_t hclk, uint32_t pclk1, uint32_t pclk2);\nextern bool stm32l4_system_clk48_enable(void);\nextern bool stm32l4_system_clk48_disable(void);\nextern void stm32l4_system_hsi16_enable(void);\nextern void stm32l4_system_hsi16_disable(void);\nextern uint32_t stm32l4_system_lseclk(void);\nextern uint32_t stm32l4_system_hseclk(void);\nextern uint32_t stm32l4_system_sysclk(void);\nextern uint32_t stm32l4_system_hclk(void);\nextern uint32_t stm32l4_system_pclk1(void);\nextern uint32_t stm32l4_system_pclk2(void);\nextern void stm32l4_system_notify(uint32_t slot, stm32l4_system_callback_t callback, void *context, uint32_t events); \nextern void stm32l4_system_lock(uint32_t lock); \nextern void stm32l4_system_unlock(uint32_t lock);\nextern bool stm32l4_system_stop(void);\nextern bool stm32l4_system_standby(void);\nextern bool stm32l4_system_shutdown(void);\nextern void stm32l4_system_reset(void);\nextern void stm32l4_system_bootloader(void);\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif /* _STM32L4_SYSTEM_H */\n"},"authors":{"kind":"list like","value":["grumpyoldpizza@gmail.com"],"string":"[\n \"grumpyoldpizza@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"grumpyoldpizza@gmail.com"}}},{"rowIdx":971175,"cells":{"blob_id":{"kind":"string","value":"3a976cba0b3b13951929d042e35b9503d1f32372"},"directory_id":{"kind":"string","value":"b3c60089697a3ac4b60987af43d35228dac5d959"},"path":{"kind":"string","value":"/Source/modio/Public/Customizables/ModioFilterCreator.h"},"content_id":{"kind":"string","value":"e963a01d632d3f52b9166b36aef5ab1d6f2ef84a"},"detected_licenses":{"kind":"list like","value":["MIT"],"string":"[\n \"MIT\"\n]","isConversational":false},"license_type":{"kind":"string","value":"permissive"},"repo_name":{"kind":"string","value":"Turupawn/UE4Plugin"},"snapshot_id":{"kind":"string","value":"7c755a543b2bb16ff20aa3d00e41940f9529457e"},"revision_id":{"kind":"string","value":"f01de1609aedb95f7733924f64bd59a4770bf2d1"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2023-05-25T02:39:48.106964","string":"2023-05-25T02:39:48.106964"},"revision_date":{"kind":"timestamp","value":"2020-05-18T02:14:55","string":"2020-05-18T02:14:55"},"committer_date":{"kind":"timestamp","value":"2020-05-18T02:14:55","string":"2020-05-18T02:14:55"},"github_id":{"kind":"number","value":174268322,"string":"174,268,322"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"string","value":"MIT"},"gha_event_created_at":{"kind":"timestamp","value":"2020-06-02T23:48:56","string":"2020-06-02T23:48:56"},"gha_created_at":{"kind":"timestamp","value":"2019-03-07T03:57:24","string":"2019-03-07T03:57:24"},"gha_language":{"kind":"string","value":"C++"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":647,"string":"647"},"extension":{"kind":"string","value":"h"},"content":{"kind":"string","value":"// Copyright 2019 modio. All Rights Reserved.\n// Released under MIT.\n\n#pragma once\n\n#include \"Customizables/ModioFieldFilterCreator.h\"\n#include \"Customizables/ModioSortCreator.h\"\n#include \"Runtime/Core/Public/Containers/Map.h\"\n#include \"ModioFilterCreator.generated.h\"\n\nUSTRUCT(BlueprintType)\nstruct FModioFilterCreator\n{\n GENERATED_BODY()\n\n UPROPERTY(EditAnywhere, BlueprintReadWrite, Category = \"mod.io\")\n FModioSortCreator Sort;\n UPROPERTY(EditAnywhere, BlueprintReadWrite, Category = \"mod.io\")\n FString FullTextSearch;\n UPROPERTY(EditAnywhere, BlueprintReadWrite, Category = \"mod.io\")\n TArray <FModioFieldFilterCreator> FieldFilters;\n};"},"authors":{"kind":"list like","value":["ahmed.hn.43@gmail.com"],"string":"[\n \"ahmed.hn.43@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"ahmed.hn.43@gmail.com"}}},{"rowIdx":971176,"cells":{"blob_id":{"kind":"string","value":"a539d717ccd401b1d6cfbe552a112021e7373490"},"directory_id":{"kind":"string","value":"46367579a54a09dd220dd9a678b1452f06897f11"},"path":{"kind":"string","value":"/branches/hdf5_1_8_swapped_fheap_id/src/H5Ofill.c"},"content_id":{"kind":"string","value":"f403b81ebe9cc99e5ff6afb4a30466afca3d583f"},"detected_licenses":{"kind":"list like","value":["LicenseRef-scancode-llnl","LicenseRef-scancode-hdf4"],"string":"[\n \"LicenseRef-scancode-llnl\",\n \"LicenseRef-scancode-hdf4\"\n]","isConversational":false},"license_type":{"kind":"string","value":"permissive"},"repo_name":{"kind":"string","value":"TPLink32/hdf5"},"snapshot_id":{"kind":"string","value":"33ff24c9b6133f0f51cb6cc2b722fba7bb1777dd"},"revision_id":{"kind":"string","value":"0d6987c15284bd9f34c7e44452a152833d42a738"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2021-05-31T01:15:39.463663","string":"2021-05-31T01:15:39.463663"},"revision_date":{"kind":"timestamp","value":"2016-04-14T23:02:09","string":"2016-04-14T23:02:09"},"committer_date":{"kind":"timestamp","value":"2016-04-14T23:02:09","string":"2016-04-14T23:02:09"},"github_id":{"kind":"null"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":36294,"string":"36,294"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *\n * Copyright by The HDF Group. *\n * Copyright by the Board of Trustees of the University of Illinois. *\n * All rights reserved. *\n * *\n * This file is part of HDF5. The full HDF5 copyright notice, including *\n * terms governing use, modification, and redistribution, is contained in *\n * the files COPYING and Copyright.html. COPYING can be found at the root *\n * of the source code distribution tree; Copyright.html can be found at the *\n * root level of an installed copy of the electronic HDF5 document set and *\n * is linked from the top-level documents page. It can also be found at *\n * http://hdfgroup.org/HDF5/doc/Copyright.html. If you do not have *\n * access to either file, you may request a copy from help@hdfgroup.org. *\n * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */\n\n/* Programmer: Robb Matzke <matzke@llnl.gov>\n * Wednesday, September 30, 1998\n *\n * Purpose:\tThe fill message indicates a bit pattern to use for\n *\t\tuninitialized data points of a dataset.\n */\n\n#define H5O_PACKAGE\t\t/*suppress error about including H5Opkg\t */\n\n#include \"H5private.h\"\t\t/* Generic Functions\t\t\t*/\n#include \"H5Dprivate.h\"\t\t/* Datasets\t\t\t\t*/\n#include \"H5Eprivate.h\"\t\t/* Error handling\t\t \t*/\n#include \"H5FLprivate.h\"\t/* Free Lists\t\t\t\t*/\n#include \"H5Iprivate.h\"\t\t/* IDs\t\t\t \t\t*/\n#include \"H5MMprivate.h\"\t/* Memory management\t\t\t*/\n#include \"H5Opkg.h\" /* Object headers\t\t\t*/\n#include \"H5Pprivate.h\"\t\t/* Property lists\t\t\t*/\n#include \"H5Sprivate.h\"\t\t/* Dataspaces\t\t\t\t*/\n\n\nstatic void *H5O_fill_old_decode(H5F_t *f, hid_t dxpl_id, H5O_t *open_oh,\n unsigned mesg_flags, unsigned *ioflags, const uint8_t *p);\nstatic herr_t H5O_fill_old_encode(H5F_t *f, uint8_t *p, const void *_mesg);\nstatic size_t H5O_fill_old_size(const H5F_t *f, const void *_mesg);\nstatic void *H5O_fill_new_decode(H5F_t *f, hid_t dxpl_id, H5O_t *open_oh,\n unsigned mesg_flags, unsigned *ioflags, const uint8_t *p);\nstatic herr_t H5O_fill_new_encode(H5F_t *f, uint8_t *p, const void *_mesg);\nstatic size_t H5O_fill_new_size(const H5F_t *f, const void *_mesg);\nstatic void *H5O_fill_copy(const void *_mesg, void *_dest);\nstatic herr_t H5O_fill_reset(void *_mesg);\nstatic herr_t H5O_fill_free(void *_mesg);\nstatic herr_t H5O_fill_debug(H5F_t *f, hid_t dxpl_id, const void *_mesg, FILE *stream,\n\t\t\t int indent, int fwidth);\n\n/* Set up & include shared message \"interface\" info */\n#define H5O_SHARED_TYPE\t\t\tH5O_MSG_FILL\n#define H5O_SHARED_DECODE\t\tH5O_fill_shared_decode\n#define H5O_SHARED_DECODE_REAL\t\tH5O_fill_old_decode\n#define H5O_SHARED_ENCODE\t\tH5O_fill_shared_encode\n#define H5O_SHARED_ENCODE_REAL\t\tH5O_fill_old_encode\n#define H5O_SHARED_SIZE\t\t\tH5O_fill_shared_size\n#define H5O_SHARED_SIZE_REAL\t\tH5O_fill_old_size\n#define H5O_SHARED_DELETE\t\tH5O_fill_shared_delete\n#undef H5O_SHARED_DELETE_REAL\n#define H5O_SHARED_LINK\t\t\tH5O_fill_shared_link\n#undef H5O_SHARED_LINK_REAL\n#define H5O_SHARED_COPY_FILE\t\tH5O_fill_shared_copy_file\n#undef H5O_SHARED_COPY_FILE_REAL\n#define H5O_SHARED_POST_COPY_FILE\tH5O_fill_shared_post_copy_file\n#undef H5O_SHARED_POST_COPY_FILE_REAL\n#define H5O_SHARED_DEBUG\t\tH5O_fill_shared_debug\n#define H5O_SHARED_DEBUG_REAL\t\tH5O_fill_debug\n#include \"H5Oshared.h\"\t\t\t/* Shared Object Header Message Callbacks */\n\n/* Set up & include shared message \"interface\" info */\n/* (Kludgy 'undef's in order to re-include the H5Oshared.h header) */\n#undef H5O_SHARED_TYPE\n#define H5O_SHARED_TYPE\t\t\tH5O_MSG_FILL_NEW\n#undef H5O_SHARED_DECODE\n#define H5O_SHARED_DECODE\t\tH5O_fill_new_shared_decode\n#undef H5O_SHARED_DECODE_REAL\n#define H5O_SHARED_DECODE_REAL\t\tH5O_fill_new_decode\n#undef H5O_SHARED_ENCODE\n#define H5O_SHARED_ENCODE\t\tH5O_fill_new_shared_encode\n#undef H5O_SHARED_ENCODE_REAL\n#define H5O_SHARED_ENCODE_REAL\t\tH5O_fill_new_encode\n#undef H5O_SHARED_SIZE\n#define H5O_SHARED_SIZE\t\t\tH5O_fill_new_shared_size\n#undef H5O_SHARED_SIZE_REAL\n#define H5O_SHARED_SIZE_REAL\t\tH5O_fill_new_size\n#undef H5O_SHARED_DELETE\n#define H5O_SHARED_DELETE\t\tH5O_fill_new_shared_delete\n#undef H5O_SHARED_DELETE_REAL\n#undef H5O_SHARED_LINK\n#define H5O_SHARED_LINK\t\t\tH5O_fill_new_shared_link\n#undef H5O_SHARED_LINK_REAL\n#undef H5O_SHARED_COPY_FILE\n#define H5O_SHARED_COPY_FILE\t\tH5O_fill_new_shared_copy_file\n#undef H5O_SHARED_COPY_FILE_REAL\n#undef H5O_SHARED_POST_COPY_FILE\n#define H5O_SHARED_POST_COPY_FILE\tH5O_fill_new_shared_post_copy_file\n#undef H5O_SHARED_POST_COPY_FILE_REAL\n#undef H5O_SHARED_DEBUG\n#define H5O_SHARED_DEBUG\t\tH5O_fill_new_shared_debug\n#undef H5O_SHARED_DEBUG_REAL\n#define H5O_SHARED_DEBUG_REAL\t\tH5O_fill_debug\n#undef H5Oshared_H\n#include \"H5Oshared.h\"\t\t\t/* Shared Object Header Message Callbacks */\n\n/* This message derives from H5O message class, for old fill value before version 1.5 */\nconst H5O_msg_class_t H5O_MSG_FILL[1] = {{\n H5O_FILL_ID, /*message id number */\n \"fill\", /*message name for debugging */\n sizeof(H5O_fill_t),\t\t/*native message size */\n H5O_SHARE_IS_SHARABLE|H5O_SHARE_IN_OHDR,\t/* messages are sharable? */\n H5O_fill_shared_decode,\t/*decode message */\n H5O_fill_shared_encode,\t/*encode message */\n H5O_fill_copy,\t\t/*copy the native value */\n H5O_fill_shared_size,\t/*raw message size\t\t\t*/\n H5O_fill_reset,\t\t/*free internal memory\t\t\t*/\n H5O_fill_free,\t\t/* free method\t\t\t\t*/\n H5O_fill_shared_delete,\t/* file delete method\t\t\t*/\n H5O_fill_shared_link,\t/* link method\t\t\t\t*/\n NULL,\t\t\t/* set share method\t\t\t*/\n NULL,\t\t \t/*can share method\t\t*/\n NULL,\t\t\t/* pre copy native value to file\t*/\n H5O_fill_shared_copy_file,\t/* copy native value to file\t\t*/\n NULL,\t\t\t/* post copy native value to file\t*/\n NULL,\t\t\t/* get creation index\t\t*/\n NULL,\t\t\t/* set creation index\t\t*/\n H5O_fill_shared_debug /*debug the message\t\t\t*/\n}};\n\n/* This message derives from H5O message class, for new fill value after version 1.4 */\nconst H5O_msg_class_t H5O_MSG_FILL_NEW[1] = {{\n H5O_FILL_NEW_ID,\t\t/*message id number\t\t\t*/\n \"fill_new\", \t\t/*message name for debugging\t\t*/\n sizeof(H5O_fill_t),\t\t/*native message size\t\t\t*/\n H5O_SHARE_IS_SHARABLE|H5O_SHARE_IN_OHDR,\t/* messages are sharable? */\n H5O_fill_new_shared_decode,\t/*decode message\t\t\t*/\n H5O_fill_new_shared_encode,\t/*encode message\t\t\t*/\n H5O_fill_copy,\t\t/*copy the native value\t\t\t*/\n H5O_fill_new_shared_size,\t/*raw message size\t\t\t*/\n H5O_fill_reset,\t\t/*free internal memory\t\t\t*/\n H5O_fill_free,\t\t/* free method\t\t\t\t*/\n H5O_fill_new_shared_delete,\t/* file delete method\t\t\t*/\n H5O_fill_new_shared_link,\t/* link method\t\t\t\t*/\n NULL,\t\t\t/* set share method\t\t\t*/\n NULL,\t\t \t/*can share method\t\t*/\n NULL,\t\t\t/* pre copy native value to file\t*/\n H5O_fill_new_shared_copy_file, /* copy native value to file\t\t*/\n NULL,\t\t\t/* post copy native value to file\t*/\n NULL,\t\t\t/* get creation index\t\t*/\n NULL,\t\t\t/* set creation index\t\t*/\n H5O_fill_new_shared_debug\t/*debug the message\t\t\t*/\n}};\n\n/* Masks, shift values & flags for fill value message */\n#define H5O_FILL_MASK_ALLOC_TIME 0x03\n#define H5O_FILL_SHIFT_ALLOC_TIME 0\n#define H5O_FILL_MASK_FILL_TIME 0x03\n#define H5O_FILL_SHIFT_FILL_TIME 2\n#define H5O_FILL_FLAG_UNDEFINED_VALUE 0x10\n#define H5O_FILL_FLAG_HAVE_VALUE 0x20\n#define H5O_FILL_FLAGS_ALL (H5O_FILL_MASK_ALLOC_TIME | (H5O_FILL_MASK_FILL_TIME << H5O_FILL_SHIFT_FILL_TIME) | H5O_FILL_FLAG_UNDEFINED_VALUE | H5O_FILL_FLAG_HAVE_VALUE)\n\n/* Declare a free list to manage the H5O_fill_t struct */\nH5FL_DEFINE(H5O_fill_t);\n\n/* Declare extern the free list to manage blocks of type conversion data */\nH5FL_BLK_EXTERN(type_conv);\n\n\f\n/*-------------------------------------------------------------------------\n * Function:\tH5O_fill_new_decode\n *\n * Purpose:\tDecode a new fill value message. The new fill value\n * \t\tmessage is fill value plus space allocation time and\n * \t\tfill value writing time and whether fill value is defined.\n *\n * Return:\tSuccess:\tPtr to new message in native struct.\n *\t\tFailure:\tNULL\n *\n * Programmer: Raymond Lu\n * Feb 26, 2002\n *\n *-------------------------------------------------------------------------\n */\nstatic void *\nH5O_fill_new_decode(H5F_t UNUSED *f, hid_t UNUSED dxpl_id, H5O_t UNUSED *open_oh,\n unsigned UNUSED mesg_flags, unsigned UNUSED *ioflags, const uint8_t *p)\n{\n H5O_fill_t\t*fill = NULL;\n void\t*ret_value;\n\n FUNC_ENTER_NOAPI_NOINIT(H5O_fill_new_decode)\n\n HDassert(f);\n HDassert(p);\n\n if(NULL == (fill = H5FL_CALLOC(H5O_fill_t)))\n\tHGOTO_ERROR(H5E_RESOURCE, H5E_NOSPACE, NULL, \"memory allocation failed for fill value message\")\n\n /* Version */\n fill->version = *p++;\n if(fill->version < H5O_FILL_VERSION_1 || fill->version > H5O_FILL_VERSION_LATEST)\n HGOTO_ERROR(H5E_OHDR, H5E_CANTLOAD, NULL, \"bad version number for fill value message\")\n\n /* Decode each version */\n if(fill->version < H5O_FILL_VERSION_3) {\n /* Space allocation time */\n fill->alloc_time = (H5D_alloc_time_t)*p++;\n\n /* Fill value write time */\n fill->fill_time = (H5D_fill_time_t)*p++;\n\n /* Whether fill value is defined */\n fill->fill_defined = *p++;\n\n /* Only decode fill value information if one is defined */\n if(fill->fill_defined) {\n INT32DECODE(p, fill->size);\n if(fill->size > 0) {\n H5_CHECK_OVERFLOW(fill->size, ssize_t, size_t);\n if(NULL == (fill->buf = H5MM_malloc((size_t)fill->size)))\n HGOTO_ERROR(H5E_RESOURCE, H5E_NOSPACE, NULL, \"memory allocation failed for fill value\")\n HDmemcpy(fill->buf, p, (size_t)fill->size);\n } /* end if */\n } /* end if */\n else\n fill->size = (-1);\n } /* end if */\n else {\n unsigned flags; /* Status flags */\n\n /* Flags */\n flags = *p++;\n\n /* Check for unknown flags */\n if(flags & (unsigned)~H5O_FILL_FLAGS_ALL)\n HGOTO_ERROR(H5E_OHDR, H5E_CANTLOAD, NULL, \"unknown flag for fill value message\")\n\n /* Space allocation time */\n fill->alloc_time = (H5D_alloc_time_t)((flags >> H5O_FILL_SHIFT_ALLOC_TIME) & H5O_FILL_MASK_ALLOC_TIME);\n\n /* Fill value write time */\n fill->fill_time = (H5D_fill_time_t)((flags >> H5O_FILL_SHIFT_FILL_TIME) & H5O_FILL_MASK_FILL_TIME);\n\n /* Check for undefined fill value */\n if(flags & H5O_FILL_FLAG_UNDEFINED_VALUE) {\n /* Sanity check */\n HDassert(!(flags & H5O_FILL_FLAG_HAVE_VALUE));\n\n /* Set value for \"undefined\" fill value */\n fill->size = (-1);\n } /* end if */\n else if(flags & H5O_FILL_FLAG_HAVE_VALUE) {\n /* Fill value size */\n UINT32DECODE(p, fill->size);\n\n /* Fill value */\n H5_CHECK_OVERFLOW(fill->size, ssize_t, size_t);\n if(NULL == (fill->buf = H5MM_malloc((size_t)fill->size)))\n HGOTO_ERROR(H5E_RESOURCE, H5E_NOSPACE, NULL, \"memory allocation failed for fill value\")\n HDmemcpy(fill->buf, p, (size_t)fill->size);\n\n /* Set the \"defined\" flag */\n fill->fill_defined = TRUE;\n } /* end else */\n else {\n /* Set the \"defined\" flag */\n fill->fill_defined = TRUE;\n } /* end else */\n } /* end else */\n\n /* Set return value */\n ret_value = (void *)fill;\n\ndone:\n if(!ret_value && fill) {\n if(fill->buf)\n H5MM_xfree(fill->buf);\n\t(void)H5FL_FREE(H5O_fill_t, fill);\n } /* end if */\n\n FUNC_LEAVE_NOAPI(ret_value)\n} /* end H5O_fill_new_decode() */\n\n\f\n/*-------------------------------------------------------------------------\n * Function: H5O_fill_old_decode\n *\n * Purpose: Decode an old fill value message.\n *\n * Return: Success: Ptr to new message in native struct.\n * Failure: NULL\n *\n * Programmer: Robb Matzke\n * Wednesday, September 30, 1998\n *\n *-------------------------------------------------------------------------\n */\nstatic void *\nH5O_fill_old_decode(H5F_t UNUSED *f, hid_t UNUSED dxpl_id, H5O_t UNUSED *open_oh,\n unsigned UNUSED mesg_flags, unsigned UNUSED *ioflags, const uint8_t *p)\n{\n H5O_fill_t *fill = NULL;\t\t/* Decoded fill value message */\n void *ret_value; /* Return value */\n\n FUNC_ENTER_NOAPI_NOINIT(H5O_fill_old_decode)\n\n HDassert(f);\n HDassert(p);\n\n if(NULL == (fill = H5FL_CALLOC(H5O_fill_t)))\n HGOTO_ERROR(H5E_RESOURCE, H5E_NOSPACE, NULL, \"memory allocation failed for fill value message\")\n\n /* Set non-zero default fields */\n fill->version = H5O_FILL_VERSION_2;\n fill->alloc_time = H5D_ALLOC_TIME_LATE;\n fill->fill_time = H5D_FILL_TIME_IFSET;\n\n /* Fill value size */\n UINT32DECODE(p, fill->size);\n\n /* Only decode the fill value itself if there is one */\n if(fill->size > 0) {\n if(NULL == (fill->buf = H5MM_malloc((size_t)fill->size)))\n HGOTO_ERROR(H5E_RESOURCE, H5E_NOSPACE, NULL, \"memory allocation failed for fill value\")\n HDmemcpy(fill->buf, p, (size_t)fill->size);\n fill->fill_defined = TRUE;\n } /* end if */\n else\n fill->size = (-1);\n\n /* Set return value */\n ret_value = (void*)fill;\n\ndone:\n if(!ret_value && fill) {\n if(fill->buf)\n H5MM_xfree(fill->buf);\n\t(void)H5FL_FREE(H5O_fill_t, fill);\n } /* end if */\n\n FUNC_LEAVE_NOAPI(ret_value)\n} /* end H5O_fill_old_decode() */\n\n\f\n/*-------------------------------------------------------------------------\n * Function:\tH5O_fill_new_encode\n *\n * Purpose:\tEncode a new fill value message. The new fill value\n * message is fill value plus space allocation time and\n * fill value writing time and whether fill value is defined.\n *\n * Return:\tNon-negative on success/Negative on failure\n *\n * Programmer: Raymond Lu\n * Feb 26, 2002\n *\n *-------------------------------------------------------------------------\n */\nstatic herr_t\nH5O_fill_new_encode(H5F_t UNUSED *f, uint8_t *p, const void *_fill)\n{\n const H5O_fill_t\t*fill = (const H5O_fill_t *)_fill;\n\n FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5O_fill_new_encode)\n\n HDassert(f);\n HDassert(p);\n HDassert(fill && NULL == fill->type);\n\n /* Version */\n *p++ = (uint8_t)fill->version;\n\n if(fill->version < H5O_FILL_VERSION_3) {\n /* Space allocation time */\n *p++ = fill->alloc_time;\n\n /* Fill value writing time */\n *p++ = fill->fill_time;\n\n /* Whether fill value is defined */\n *p++ = (uint8_t)fill->fill_defined;\n\n /* Only write out the size and fill value if it is defined */\n if(fill->fill_defined) {\n UINT32ENCODE(p, fill->size);\n if(fill->size > 0)\n if(fill->buf) {\n H5_CHECK_OVERFLOW(fill->size, ssize_t, size_t);\n HDmemcpy(p, fill->buf, (size_t)fill->size);\n } /* end if */\n } /* end if */\n } /* end if */\n else {\n uint8_t flags = 0; /* Fill value setting flags */\n\n /* Encode space allocation time */\n HDassert(fill->alloc_time == (H5O_FILL_MASK_ALLOC_TIME & fill->alloc_time));\n flags |= (H5O_FILL_MASK_ALLOC_TIME & fill->alloc_time) << H5O_FILL_SHIFT_ALLOC_TIME;\n\n /* Encode fill value writing time */\n HDassert(fill->fill_time == (H5O_FILL_MASK_FILL_TIME & fill->fill_time));\n flags |= (H5O_FILL_MASK_FILL_TIME & fill->fill_time) << H5O_FILL_SHIFT_FILL_TIME;\n\n /* Check if we need to encode a fill value size */\n if(fill->size < 0) {\n /* Indicate that the fill value has been \"undefined\" by the user */\n flags |= H5O_FILL_FLAG_UNDEFINED_VALUE;\n\n /* Flags */\n *p++ = (uint8_t)flags;\n\n /* Sanity check */\n HDassert(!fill->buf);\n } /* end if */\n else if(fill->size > 0) {\n /* Indicate that a fill value size is present */\n flags |= H5O_FILL_FLAG_HAVE_VALUE;\n\n /* Flags */\n *p++ = (uint8_t)flags;\n\n /* Encode the size of fill value */\n INT32ENCODE(p, fill->size);\n\n /* Encode the fill value */\n HDassert(fill->buf);\n H5_CHECK_OVERFLOW(fill->size, ssize_t, size_t);\n HDmemcpy(p, fill->buf, (size_t)fill->size);\n } /* end if */\n else {\n /* Flags */\n *p++ = (uint8_t)flags;\n\n /* Sanity check */\n HDassert(!fill->buf);\n } /* end else */\n } /* end else */\n\n FUNC_LEAVE_NOAPI(SUCCEED)\n} /* end H5O_fill_new_encode() */\n\n\f\n/*-------------------------------------------------------------------------\n * Function: H5O_fill_old_encode\n *\n * Purpose: Encode an old fill value message.\n *\n * Return: Non-negative on success/Negative on failure\n *\n * Programmer: Robb Matzke\n * Thursday, October 1, 1998\n *\n *-------------------------------------------------------------------------\n */\nstatic herr_t\nH5O_fill_old_encode(H5F_t UNUSED *f, uint8_t *p, const void *_fill)\n{\n const H5O_fill_t *fill = (const H5O_fill_t *)_fill;\n\n FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5O_fill_old_encode)\n\n HDassert(f);\n HDassert(p);\n HDassert(fill && NULL == fill->type);\n\n UINT32ENCODE(p, fill->size);\n if(fill->buf)\n HDmemcpy(p, fill->buf, (size_t)fill->size);\n\n FUNC_LEAVE_NOAPI(SUCCEED)\n} /* end H5O_fill_old_encode() */\n\n\f\n/*-------------------------------------------------------------------------\n * Function:\tH5O_fill_copy\n *\n * Purpose:\tCopies a message from _MESG to _DEST, allocating _DEST if\n *\t\tnecessary. The new fill value message is fill value plus\n *\t\tspace allocation time and fill value writing time and\n *\t\twhether fill value is defined.\n *\n * Return:\tSuccess:\tPtr to _DEST\n *\t\tFailure:\tNULL\n *\n * Programmer: Raymond Lu\n * Feb 26, 2002\n *\n *-------------------------------------------------------------------------\n */\nstatic void *\nH5O_fill_copy(const void *_src, void *_dst)\n{\n const H5O_fill_t\t*src = (const H5O_fill_t *)_src;\n H5O_fill_t\t\t*dst = (H5O_fill_t *)_dst;\n void\t\t*ret_value;\n\n FUNC_ENTER_NOAPI_NOINIT(H5O_fill_copy)\n\n HDassert(src);\n\n if(!dst && NULL == (dst = H5FL_MALLOC(H5O_fill_t)))\n\tHGOTO_ERROR(H5E_RESOURCE, H5E_NOSPACE, NULL, \"memory allocation failed for fill message\")\n\n /* Shallow copy basic fields */\n *dst = *src;\n\n /* Copy data type of fill value */\n if(src->type) {\n if(NULL == (dst->type = H5T_copy(src->type, H5T_COPY_TRANSIENT)))\n HGOTO_ERROR(H5E_OHDR, H5E_CANTCOPY, NULL, \"can't copy datatype\")\n } /* end if */\n else\n dst->type = NULL;\n\n /* Copy fill value and its size */\n if(src->buf) {\n H5_CHECK_OVERFLOW(src->size, ssize_t, size_t);\n\tif(NULL == (dst->buf = H5MM_malloc((size_t)src->size)))\n\t HGOTO_ERROR(H5E_RESOURCE, H5E_NOSPACE, NULL, \"memory allocation failed for fill value\")\n\tHDmemcpy(dst->buf, src->buf, (size_t)src->size);\n\n /* Check for needing to convert/copy fill value */\n if(src->type) {\n H5T_path_t *tpath; /* Conversion information */\n\n /* Set up type conversion function */\n if(NULL == (tpath = H5T_path_find(src->type, dst->type, NULL, NULL, H5AC_ind_dxpl_id, FALSE)))\n HGOTO_ERROR(H5E_DATASET, H5E_UNSUPPORTED, NULL, \"unable to convert between src and dst data types\")\n\n /* If necessary, convert fill value datatypes (which copies VL components, etc.) */\n if(!H5T_path_noop(tpath)) {\n hid_t dst_id, src_id; /* Source & destination datatypes for type conversion */\n uint8_t *bkg_buf = NULL; /* Background conversion buffer */\n size_t bkg_size; /* Size of background buffer */\n\n /* Wrap copies of types to convert */\n dst_id = H5I_register(H5I_DATATYPE, H5T_copy(dst->type, H5T_COPY_TRANSIENT), FALSE);\n if(dst_id < 0)\n HGOTO_ERROR(H5E_DATATYPE, H5E_CANTINIT, NULL, \"unable to copy/register datatype\")\n src_id = H5I_register(H5I_DATATYPE, H5T_copy(src->type, H5T_COPY_ALL), FALSE);\n if(src_id < 0) {\n H5I_dec_ref(dst_id, FALSE);\n HGOTO_ERROR(H5E_DATATYPE, H5E_CANTINIT, NULL, \"unable to copy/register datatype\")\n } /* end if */\n\n /* Allocate a background buffer */\n bkg_size = MAX(H5T_get_size(dst->type), H5T_get_size(src->type));\n if(H5T_path_bkg(tpath) && NULL == (bkg_buf = H5FL_BLK_CALLOC(type_conv, bkg_size))) {\n H5I_dec_ref(src_id, FALSE);\n H5I_dec_ref(dst_id, FALSE);\n HGOTO_ERROR(H5E_RESOURCE, H5E_NOSPACE, NULL, \"memory allocation failed\")\n } /* end if */\n\n /* Convert fill value */\n if(H5T_convert(tpath, src_id, dst_id, (size_t)1, (size_t)0, (size_t)0, dst->buf, bkg_buf, H5AC_ind_dxpl_id) < 0) {\n H5I_dec_ref(src_id, FALSE);\n H5I_dec_ref(dst_id, FALSE);\n if(bkg_buf)\n bkg_buf = H5FL_BLK_FREE(type_conv, bkg_buf);\n HGOTO_ERROR(H5E_DATASET, H5E_CANTCONVERT, NULL, \"datatype conversion failed\")\n } /* end if */\n\n /* Release the background buffer */\n H5I_dec_ref(src_id, FALSE);\n H5I_dec_ref(dst_id, FALSE);\n if(bkg_buf)\n bkg_buf = H5FL_BLK_FREE(type_conv, bkg_buf);\n } /* end if */\n } /* end if */\n } /* end if */\n else\n dst->buf = NULL;\n\n /* Set return value */\n ret_value = dst;\n\ndone:\n if(!ret_value && dst) {\n if(dst->buf)\n H5MM_xfree(dst->buf);\n\tif(dst->type)\n H5T_close(dst->type);\n\tif(!_dst)\n (void)H5FL_FREE(H5O_fill_t, dst);\n } /* end if */\n\n FUNC_LEAVE_NOAPI(ret_value)\n} /* end H5O_fill_copy() */\n\n\f\n/*-------------------------------------------------------------------------\n * Function:\tH5O_fill_new_size\n *\n * Purpose:\tReturns the size of the raw message in bytes not counting the\n *\t\tmessage type or size fields, but only the data fields. This\n *\t\tfunction doesn't take into account alignment. The new fill\n *\t\tvalue message is fill value plus space allocation time and\n * fill value writing time and whether fill value is defined.\n *\n * Return:\tSuccess:\tMessage data size in bytes w/o alignment.\n *\t\tFailure:\t0\n *\n * Programmer: Raymond Lu\n * Feb 26, 2002\n *\n *-------------------------------------------------------------------------\n */\nstatic size_t\nH5O_fill_new_size(const H5F_t UNUSED *f, const void *_fill)\n{\n const H5O_fill_t\t*fill = (const H5O_fill_t *)_fill;\n size_t\t\tret_value;\n\n FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5O_fill_new_size)\n\n HDassert(f);\n HDassert(fill);\n\n /* Determine size for different versions */\n if(fill->version < H5O_FILL_VERSION_3) {\n ret_value = 1 +\t \t\t/* Version number */\n 1 + \t\t/* Space allocation time */\n 1 + \t\t/* Fill value write time */\n 1; \t\t\t/* Fill value defined */\n if(fill->fill_defined)\n ret_value += 4 +\t/* Fill value size\t */\n (fill->size > 0 ? (size_t)fill->size : 0);\t/* Size of fill value\t */\n } /* end if */\n else {\n ret_value = 1 +\t \t\t/* Version number */\n 1;\t\t\t/* Status flags */\n if(fill->size > 0)\n ret_value += 4 +\t\t/* Fill value size\t */\n (size_t)fill->size;\t\t/* Size of fill value\t */\n } /* end else */\n\n FUNC_LEAVE_NOAPI(ret_value)\n} /* end H5O_fill_new_size() */\n\n\f\n/*-------------------------------------------------------------------------\n * Function: H5O_fill_old_size\n *\n * Purpose: Returns the size of the raw message in bytes not counting the\n * message type or size fields, but only the data fields. This\n * function doesn't take into account alignment.\n *\n * Return: Success: Message data size in bytes w/o alignment.\n * Failure: 0\n *\n * Programmer: Robb Matzke\n * Thursday, October 1, 1998\n *\n *-------------------------------------------------------------------------\n */\nstatic size_t\nH5O_fill_old_size(const H5F_t UNUSED *f, const void *_fill)\n{\n const H5O_fill_t *fill = (const H5O_fill_t *)_fill;\n\n FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5O_fill_old_size)\n\n HDassert(fill);\n\n FUNC_LEAVE_NOAPI(4 + (size_t)fill->size)\n} /* end H5O_fill_old_size() */\n\n\f\n/*-------------------------------------------------------------------------\n * Function:\tH5O_fill_reset_dyn\n *\n * Purpose:\tResets dynamic fill value fields\n *\n * Return:\tNon-negative on success/Negative on failure\n *\n * Programmer:\tQuincey Koziol\n * Monday, January 22, 2007\n *\n *-------------------------------------------------------------------------\n */\nherr_t\nH5O_fill_reset_dyn(H5O_fill_t *fill)\n{\n hid_t fill_type_id = -1; /* Datatype ID for fill value datatype when reclaiming VL fill values */\n herr_t ret_value = SUCCEED; /* Return value */\n\n FUNC_ENTER_NOAPI(H5O_fill_reset_dyn, FAIL)\n\n HDassert(fill);\n\n if(fill->buf) {\n if(fill->type && H5T_detect_class(fill->type, H5T_VLEN, FALSE) > 0) {\n H5T_t *fill_type; /* Copy of fill value datatype */\n H5S_t *fill_space; /* Scalar dataspace for fill value element */\n\n /* Copy the fill value datatype and get an ID for it */\n if(NULL == (fill_type = H5T_copy(fill->type, H5T_COPY_TRANSIENT)))\n HGOTO_ERROR(H5E_DATATYPE, H5E_CANTINIT, FAIL, \"unable to copy fill value datatype\")\n if((fill_type_id = H5I_register(H5I_DATATYPE, fill_type, FALSE)) < 0) {\n H5T_close(fill_type);\n HGOTO_ERROR(H5E_DATATYPE, H5E_CANTREGISTER, FAIL, \"unable to register fill value datatype\")\n } /* end if */\n\n /* Create a scalar dataspace for the fill value element */\n if(NULL == (fill_space = H5S_create(H5S_SCALAR)))\n HGOTO_ERROR(H5E_DATASPACE, H5E_CANTCREATE, FAIL, \"can't create scalar dataspace\")\n\n /* Reclaim any variable length components of the fill value */\n if(H5D_vlen_reclaim(fill_type_id, fill_space, H5P_DATASET_XFER_DEFAULT, fill->buf) < 0) {\n H5S_close(fill_space);\n HGOTO_ERROR(H5E_DATASET, H5E_BADITER, FAIL, \"unable to reclaim variable-length fill value data\")\n } /* end if */\n\n /* Release the scalar fill value dataspace */\n H5S_close(fill_space);\n } /* end if */\n\n /* Release the fill value buffer now */\n fill->buf = H5MM_xfree(fill->buf);\n } /* end if */\n fill->size = 0;\n if(fill->type) {\n\tH5T_close(fill->type);\n\tfill->type = NULL;\n } /* end if */\n\ndone:\n if(fill_type_id > 0)\n H5I_dec_ref(fill_type_id, FALSE);\n FUNC_LEAVE_NOAPI(ret_value)\n} /* end H5O_fill_reset_dyn() */\n\n\f\n/*-------------------------------------------------------------------------\n * Function:\tH5O_fill_reset\n *\n * Purpose:\tResets a message to an initial state.\n *\n * Return:\tNon-negative on success/Negative on failure\n *\n * Programmer:\tRobb Matzke\n * Thursday, October 1, 1998\n *\n *-------------------------------------------------------------------------\n */\nstatic herr_t\nH5O_fill_reset(void *_fill)\n{\n H5O_fill_t\t*fill = (H5O_fill_t *)_fill;\n\n FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5O_fill_reset)\n\n HDassert(fill);\n\n /* Reset dynamic fields */\n H5O_fill_reset_dyn(fill);\n\n /* Reset value fields */\n fill->alloc_time = H5D_ALLOC_TIME_LATE;\n fill->fill_time = H5D_FILL_TIME_IFSET;\n fill->fill_defined = FALSE;\n\n FUNC_LEAVE_NOAPI(SUCCEED)\n} /* end H5O_fill_reset() */\n\n\f\n/*-------------------------------------------------------------------------\n * Function:\tH5O_fill_free\n *\n * Purpose:\tFrees the message\n *\n * Return:\tNon-negative on success/Negative on failure\n *\n * Programmer:\tQuincey Koziol\n * Thursday, December 5, 2002\n *\n *-------------------------------------------------------------------------\n */\nstatic herr_t\nH5O_fill_free(void *fill)\n{\n FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5O_fill_free)\n\n HDassert(fill);\n\n (void)H5FL_FREE(H5O_fill_t, fill);\n\n FUNC_LEAVE_NOAPI(SUCCEED)\n} /* end H5O_fill_free() */\n\n\f\n/*-------------------------------------------------------------------------\n * Function:\tH5O_fill_debug\n *\n * Purpose:\tPrints debugging info for the message.\n *\n * Return:\tNon-negative on success/Negative on failure\n *\n * Programmer:\tRobb Matzke\n * Thursday, October 1, 1998\n *\n *-------------------------------------------------------------------------\n */\nstatic herr_t\nH5O_fill_debug(H5F_t UNUSED *f, hid_t UNUSED dxpl_id, const void *_fill, FILE *stream,\n\t int indent, int fwidth)\n{\n const H5O_fill_t *fill = (const H5O_fill_t *)_fill;\n H5D_fill_value_t fill_status; /* Whether the fill value is defined */\n\n FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5O_fill_debug)\n\n HDassert(f);\n HDassert(fill);\n HDassert(stream);\n HDassert(indent >= 0);\n HDassert(fwidth >= 0);\n\n HDfprintf(stream, \"%*s%-*s \", indent, \"\", fwidth, \"Space Allocation Time:\");\n switch(fill->alloc_time) {\n case H5D_ALLOC_TIME_EARLY:\n fprintf(stream,\"Early\\n\");\n break;\n\n case H5D_ALLOC_TIME_LATE:\n fprintf(stream,\"Late\\n\");\n break;\n\n case H5D_ALLOC_TIME_INCR:\n fprintf(stream,\"Incremental\\n\");\n break;\n\n default:\n fprintf(stream,\"Unknown!\\n\");\n break;\n\n } /* end switch */\n HDfprintf(stream, \"%*s%-*s \", indent, \"\", fwidth, \"Fill Time:\");\n switch(fill->fill_time) {\n case H5D_FILL_TIME_ALLOC:\n fprintf(stream,\"On Allocation\\n\");\n break;\n\n case H5D_FILL_TIME_NEVER:\n fprintf(stream,\"Never\\n\");\n break;\n\n case H5D_FILL_TIME_IFSET:\n fprintf(stream,\"If Set\\n\");\n break;\n\n default:\n fprintf(stream,\"Unknown!\\n\");\n break;\n\n } /* end switch */\n HDfprintf(stream, \"%*s%-*s \", indent, \"\", fwidth, \"Fill Value Defined:\");\n H5P_is_fill_value_defined((const H5O_fill_t *)fill, &fill_status);\n switch(fill_status) {\n case H5D_FILL_VALUE_UNDEFINED:\n fprintf(stream,\"Undefined\\n\");\n break;\n\n case H5D_FILL_VALUE_DEFAULT:\n fprintf(stream,\"Default\\n\");\n break;\n\n case H5D_FILL_VALUE_USER_DEFINED:\n fprintf(stream,\"User Defined\\n\");\n break;\n\n default:\n fprintf(stream,\"Unknown!\\n\");\n break;\n\n } /* end switch */\n HDfprintf(stream, \"%*s%-*s %Zd\\n\", indent, \"\", fwidth,\n\t \"Size:\", fill->size);\n HDfprintf(stream, \"%*s%-*s \", indent, \"\", fwidth, \"Data type:\");\n if(fill->type) {\n\tH5T_debug(fill->type, stream);\n\tfprintf(stream, \"\\n\");\n } /* end if */\n else\n\tfprintf(stream, \"<dataset type>\\n\");\n\n FUNC_LEAVE_NOAPI(SUCCEED);\n} /* end H5O_fill_debug() */\n\n\f\n/*-------------------------------------------------------------------------\n * Function:\tH5O_fill_convert\n *\n * Purpose:\tConvert a fill value from whatever data type it currently has\n *\t\tto the specified dataset type. The `type' field of the fill\n *\t\tvalue struct will be set to NULL to indicate that it has the\n *\t\tsame type as the dataset.\n *\n * Return:\tNon-negative on success/Negative on failure\n *\n * Programmer:\tRobb Matzke\n * Thursday, October 1, 1998\n *\n *-------------------------------------------------------------------------\n */\nherr_t\nH5O_fill_convert(H5O_fill_t *fill, H5T_t *dset_type, hbool_t *fill_changed, hid_t dxpl_id)\n{\n H5T_path_t\t\t*tpath;\t\t\t /* Type conversion info\t*/\n void\t\t*buf = NULL, *bkg = NULL; /* Conversion buffers\t*/\n hid_t\t\tsrc_id = -1, dst_id = -1; /* Datatype identifiers\t*/\n herr_t \tret_value = SUCCEED; /* Return value */\n\n FUNC_ENTER_NOAPI_NOINIT(H5O_fill_convert)\n\n HDassert(fill);\n HDassert(dset_type);\n HDassert(fill_changed);\n\n /* No-op cases */\n if(!fill->buf || !fill->type || 0 == H5T_cmp(fill->type, dset_type, FALSE)) {\n /* Don't need datatype for fill value */\n\tif(fill->type)\n H5T_close(fill->type);\n\tfill->type = NULL;\n\n /* Note that the fill value info has changed */\n *fill_changed = TRUE;\n\n\tHGOTO_DONE(SUCCEED);\n } /* end if */\n\n /*\n * Can we convert between source and destination data types?\n */\n if(NULL == (tpath = H5T_path_find(fill->type, dset_type, NULL, NULL, dxpl_id, FALSE)))\n\tHGOTO_ERROR(H5E_DATATYPE, H5E_CANTINIT, FAIL, \"unable to convert between src and dst datatypes\")\n\n /* Don't bother doing anything if there will be no actual conversion */\n if(!H5T_path_noop(tpath)) {\n if((src_id = H5I_register(H5I_DATATYPE, H5T_copy(fill->type, H5T_COPY_ALL), FALSE)) < 0 ||\n (dst_id = H5I_register(H5I_DATATYPE, H5T_copy(dset_type, H5T_COPY_ALL), FALSE)) < 0)\n HGOTO_ERROR(H5E_DATATYPE, H5E_CANTINIT, FAIL, \"unable to copy/register data type\")\n\n /*\n * Datatype conversions are always done in place, so we need a buffer\n * that is large enough for both source and destination.\n */\n if(H5T_get_size(fill->type) >= H5T_get_size(dset_type))\n buf = fill->buf;\n else {\n if(NULL == (buf = H5MM_malloc(H5T_get_size(dset_type))))\n HGOTO_ERROR(H5E_RESOURCE, H5E_NOSPACE, FAIL, \"memory allocation failed for type conversion\")\n HDmemcpy(buf, fill->buf, H5T_get_size(fill->type));\n } /* end else */\n\n /* Use CALLOC here to clear the buffer in case later the library thinks there's\n * data in the background. */\n if(H5T_path_bkg(tpath) && NULL == (bkg = H5MM_calloc(H5T_get_size(dset_type))))\n HGOTO_ERROR(H5E_RESOURCE, H5E_NOSPACE, FAIL, \"memory allocation failed for type conversion\")\n\n /* Do the conversion */\n if(H5T_convert(tpath, src_id, dst_id, (size_t)1, (size_t)0, (size_t)0, buf, bkg, dxpl_id) < 0)\n HGOTO_ERROR(H5E_DATATYPE, H5E_CANTINIT, FAIL, \"datatype conversion failed\")\n\n /* Update the fill message */\n if(buf != fill->buf) {\n H5MM_xfree(fill->buf);\n fill->buf = buf;\n } /* end if */\n H5T_close(fill->type);\n fill->type = NULL;\n H5_ASSIGN_OVERFLOW(fill->size, H5T_get_size(dset_type), size_t, ssize_t);\n\n /* Note that the fill value info has changed */\n *fill_changed = TRUE;\n } /* end if */\n\ndone:\n if(src_id >= 0)\n H5I_dec_ref(src_id, FALSE);\n if(dst_id >= 0)\n H5I_dec_ref(dst_id, FALSE);\n if(buf != fill->buf)\n H5MM_xfree(buf);\n if(bkg)\n H5MM_xfree(bkg);\n\n FUNC_LEAVE_NOAPI(ret_value);\n} /* end H5O_fill_convert() */\n\n\f\n/*-------------------------------------------------------------------------\n * Function: H5O_fill_set_latest_version\n *\n * Purpose: Set the encoding for a fill value to the latest version.\n *\n * Return:\tNon-negative on success/Negative on failure\n *\n * Programmer: Quincey Koziol\n * Tuesday, July 24, 2007\n *\n *-------------------------------------------------------------------------\n */\nherr_t\nH5O_fill_set_latest_version(H5O_fill_t *fill)\n{\n FUNC_ENTER_NOAPI_NOFUNC(H5O_fill_set_latest_version)\n\n /* Sanity check */\n HDassert(fill);\n\n /* Set encoding of fill value to latest version */\n fill->version = H5O_FILL_VERSION_LATEST;\n\n FUNC_LEAVE_NOAPI(SUCCEED)\n} /* end H5O_fill_set_latest_version() */\n\n"},"authors":{"kind":"list like","value":["koziol@dab4d1a6-ed17-0410-a064-d1ae371a2980"],"string":"[\n \"koziol@dab4d1a6-ed17-0410-a064-d1ae371a2980\"\n]","isConversational":false},"author_id":{"kind":"string","value":"koziol@dab4d1a6-ed17-0410-a064-d1ae371a2980"}}},{"rowIdx":971177,"cells":{"blob_id":{"kind":"string","value":"0f35a017680dd1a32a2ed549c57442cc872672c2"},"directory_id":{"kind":"string","value":"11e97f87deb25babb4a32c80941e7ff4e476c92a"},"path":{"kind":"string","value":"/TRS/HRI_530v/Motion/UtilDefine.h"},"content_id":{"kind":"string","value":"7e148582ed35a0a3dd6b8763ca810eca25b0f2c5"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"xhyangxianjun/Builder6-program"},"snapshot_id":{"kind":"string","value":"b9d03d98658db5a5a8cf1586210a373bc391dc48"},"revision_id":{"kind":"string","value":"a12d811d7a5fa3dba6d3e8c05989a41cb89783de"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2022-04-03T00:25:47.274355","string":"2022-04-03T00:25:47.274355"},"revision_date":{"kind":"timestamp","value":"2019-09-19T08:26:56","string":"2019-09-19T08:26:56"},"committer_date":{"kind":"timestamp","value":"2019-09-19T08:26:56","string":"2019-09-19T08:26:56"},"github_id":{"kind":"null"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UHC"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":47930,"string":"47,930"},"extension":{"kind":"string","value":"h"},"content":{"kind":"string","value":"#ifndef UTILDEFINEH\n#define UTILDEFINEH\n\n//sunsun 로더 언로더 인덱스바 투스타트 관련\n//소켓 플레이스 및 쉬프트 소켓 플레이스 인포 등등.\n//언로더 세퍼레이터 처음 켤때 뒤로 빠지는것.\n//랏엔드시에 스테이지 회전 하는것.\n//\n#define EQP_SERIAL_LIST \\\n\"\\\nTRS-14-1048,\\\n\"\n\n\n\n//소켓이나 툴의 갯수.\n#define MAX_TOOL_SOCK_COL 4\n\n//DD모터위의 스테이지의 갯수.\n#define MAX_STAGE 4\n\nenum { ccBwd = 0 , ccFwd = 1};\nenum { toBuff = 0 , toTabl = 1};\n\n//파트 아이디.\nenum EN_PART_ID {\n piSRT = 0 , //소터 mcLSP_Home\n piSTG , //DD모터 스테이지. mcLDR_Home\n piOST , //OST 업다운. mcLST_Home\n piVTI , //VT mcSRT_Home\n piVSN , //비젼. mcSTG_Home\n piLSP , //로더 서플라이. mcOST_Home\n piLDR , //로더. mcVTI_Home\n piLST , //로더 스탁. mcVSN_Home\n piUSP , //언로더 서플라이. mcUSP_Home\n piULD , //언로더. mcULD_Home\n piUST , //언로더 스탁. mcUST_Home\n MAX_PART\n};\n\nenum EN_ARAY_ID {\n riSRT =0 , //소터.\n riZIG , //얼라이너.\n\n riSTF , //앞 턴테이블1riSG1 , //턴테이블1\n riSTL , //왼쪽 턴테이블2riSG2 , //턴테이블2\n riSTB , //뒷쪽 턴테이블3riSG3 , //턴테이블3\n riSTR , //오른쪽 턴테이블4riSG4 , //턴테이블4\n\n riPRL , //프리 로더\n riLDR , //로더\n riPSL , //포스트 로더\n riPRU , //프리 언로더.\n riULD , //언로더.\n riPSU , //포스트 언로더\n riRJ1 , //리젝1\n riRJ2 , //리젝2\n riRJ3 , //리젝3\n riRJ4 , //리젝4\n\n riMOS , //메뉴얼 테스트용.OST\n riMVT , //메뉴얼 테스트용.VT\n riMVS , //메뉴얼 테스트용.VSN\n\n riSTU , //스테이지 STagebUffer 버퍼 원래 지역 변수 였으나 지역변수로 했을때 소멸자에서 팝업 매뉴등을 소멸 시키지 않아 메모리 누수있음. 스테이지 버퍼 스테이지 돌릴때 필요.\n\n MAX_ARAY\n};\n\n//프리버퍼 오리검사 레이져조사 비젼검사\n//Unkwn -> Mask Work Good\n// Fail\n\n//mi<파트명3자리>_<축방샹1자리><부가명칭4>\nenum EN_MOTR_ID {\n miLDR_YIndx = 0 , // 로더\n miLSP_ZElev = 1 , // 로더 서플라이 Z\n miSRT_YPckr = 2 , // 피커 무브 Y\n miSRT_ZPckr = 3 , // 피커 툴 Z\n miSRT_XPckr = 4 , // 피커 무브 X\n miSTG_TTble = 5 , // 턴테이블\n miSTG_YVisn = 6 , // 비젼 검사\n miSRT_XExpd = 7 , // 익스펜딩\n miULD_YIndx = 8 , // 언로더 Y\n miUSP_ZElev = 9 , // 언로더 Z\n\n MAX_MOTR\n};\n\n//ai<파트명3자리>_<부가명칭><FWD시에위치2자리><BWD시에위치2자리>\n//대기가 Bwd 작동이 Fwd\nenum EN_ACTR_ID {\n aiLSP_GuidFwBw = 0 , //로더 가이드\n aiLST_StckUpDn , //로더 스타커.\n aiLDR_IndxUpDn , //인덱스바\n aiSRT_FrstDnUp , //1번째 피커\n aiSRT_ScndDnUp , //2번째 피커\n aiSRT_ThrdDnUp , //3번째 피커\n aiSRT_FrthDnUp , //4번째 피커\n aiOST_PshrDnUp , //OST 푸셔\n aiOST_PTolUpDn , //핀 툴\n aiVTI_PshrDnUp , //VT 푸셔\n aiVTI_PTolUpDn , //VT 핀툴.\n aiSRT_AlgnFwBw , //얼라인 1,2,3,4번\n aiUSP_GuidFwBw , //언로더 가이드\n aiUST_StckUpDn , //이젝트\n aiULD_IndxUpDn , //인덱스바\n\n MAX_ACTR\n\n};\n\n//그냥 아이오. x+<파트 3자리>+_+<세부설명>\n//실린더 아이오 x+<파트 3자리>+_+<세부설명>+<해당행동2자리 ex) Fw,Bw,Up,Dn>\nenum EN_INPUT_ID {\n x0000 = 0 , xETC_StartSw = 0 , // x0000 = 0 , xETC_StartSw = 0 , //\n x0001 = 1 , xETC_StopSw = 1 , // x0001 = 1 , xETC_StopSw = 1 , //\n x0002 = 2 , xETC_ResetSw = 2 , // x0002 = 2 , xETC_ResetSw = 2 , //\n x0003 = 3 , xETC_AirSw = 3 , // x0003 = 3 , xETC_AirSw = 3 , //\n x0004 = 4 , xETC_InitSw = 4 , // x0004 = 4 , xETC_InitSw = 4 , //\n x0005 = 5 , xLDR_SideEmgSw = 5 , // x0005 = 5 , xLDR_SideEmgSw = 5 , //\n x0006 = 6 , xETC_FrntEmg1 = 6 , // x0006 = 6 , xETC_FrntEmg1 = 6 , //\n x0007 = 7 , xETC_FrntEmg2 = 7 , // x0007 = 7 , xETC_FrntEmg2 = 7 , //\n x0008 = 8 , xETC_MainPower = 8 , // x0008 = 8 , xETC_MainPower = 8 , //\n x0009 = 9 , xETC_MainAir = 9 , // x0009 = 9 , xETC_MainAir = 9 , //\n x000A = 10 , xETC_DoorLt = 10 , // x000A = 10 , xETC_FrntDoor1 = 10 , //\n x000B = 11 , xETC_DoorFt = 11 , // x000B = 11 , xETC_FrntDoor2 = 11 , //\n x000C = 12 , xETC_DoorRr = 12 , // x000C = 12 , xETC_RearDoor1 = 12 , //\n x000D = 13 , x013 = 13 , // x000D = 13 , xETC_RearDoor2 = 13 , //\n x000E = 14 , xLST_Tray1 = 14 , // x000E = 14 , xLST_Tray1 = 14 , //\n x000F = 15 , xLST_Tray2Full = 15 , // x000F = 15 , xLST_Tray2Full = 15 , //\n\n x0010 = 16 , xLDR_Tray3Work = 16 , // x0010 = 16 , xLDR_Tray3Work = 16 , //\n x0011 = 17 , xLSP_Tray4 = 17 , // x0011 = 17 , xLSP_Tray4 = 17 , //\n x0012 = 18 , xLSP_Tray5Sply = 18 , // x0012 = 18 , xLSP_Tray5Sply = 18 , //\n x0013 = 19 , xLSP_LGuidFw = 19 , // x0013 = 19 , xLSP_GuidFw = 19 , //\n x0014 = 20 , xLSP_RGuidFw = 20 , // x0014 = 20 , xLSP_GuidBw = 20 , //\n x0015 = 21 , xLDR_IndxUp = 21 , // x0015 = 21 , xLDR_IndxUp = 21 , //\n x0016 = 22 , xLST_EjctUpL = 22 , // x0016 = 22 , xLST_EjctUpL = 22 , //\n x0017 = 23 , xLST_EjctDnL = 23 , // x0017 = 23 , xLST_EjctDnL = 23 , //\n x0018 = 24 , xLST_EjctUpR = 24 , // x0018 = 24 , xLST_EjctUpR = 24 , //\n x0019 = 25 , xLST_EjctDnR = 25 , // x0019 = 25 , xLST_EjctDnR = 25 , //\n x001A = 26 , xSRT_VccSnsr1 = 26 , // x001A = 26 , xSRT_VccSnsr1 = 26 , //\n x001B = 27 , xSRT_VccSnsr2 = 27 , // x001B = 27 , xSRT_VccSnsr2 = 27 , //\n x001C = 28 , xSRT_VccSnsr3 = 28 , // x001C = 28 , xSRT_VccSnsr3 = 28 , //\n x001D = 29 , xSRT_VccSnsr4 = 29 , // x001D = 29 , xSRT_VccSnsr4 = 29 , //\n x001E = 30 , xSRT_PckrUp1 = 30 , // x001E = 30 , xSRT_PckrUp1 = 30 , //\n x001F = 31 , xSRT_PckrUp2 = 31 , // x001F = 31 , xSRT_PckrUp2 = 31 , //\n\n x0020 = 32 , xSRT_PckrUp3 = 32 , // x0020 = 32 , xSRT_PckrUp3 = 32 , //\n x0021 = 33 , xSRT_PckrUp4 = 33 , // x0021 = 33 , xSRT_PckrUp4 = 33 , //\n x0022 = 34 , xSRT_AlngFw1 = 34 , // x0022 = 34 , xSRT_AlngFw1 = 34 , //\n x0023 = 35 , xSRT_AlngBw1 = 35 , // x0023 = 35 , xSRT_AlngBw1 = 35 , //\n x0024 = 36 , xSRT_AlngFw2 = 36 , // x0024 = 36 , xSRT_AlngFw2 = 36 , //\n x0025 = 37 , xSRT_AlngBw2 = 37 , // x0025 = 37 , xSRT_AlngBw2 = 37 , //\n x0026 = 38 , xSRT_AlngFw3 = 38 , // x0026 = 38 , xSRT_AlngFw3 = 38 , //\n x0027 = 39 , xSRT_AlngBw3 = 39 , // x0027 = 39 , xSRT_AlngBw3 = 39 , //\n x0028 = 40 , xSRT_AlngFw4 = 40 , // x0028 = 40 , xSRT_AlngFw4 = 40 , //\n x0029 = 41 , xSRT_AlngBw4 = 41 , // x0029 = 41 , xSRT_AlngBw4 = 41 , //\n x002A = 42 , xOST_PshrUp = 42 , // x002A = 42 , xOST_PshrFw = 42 , //\n x002B = 43 , xOST_PshrDn = 43 , // x002B = 43 , xOST_PshrBw = 43 , //\n x002C = 44 , xVTI_PshrUp = 44 , // x002C = 44 , xVTI_PshrFw = 44 , //\n x002D = 45 , xVTI_PshrDn = 45 , // x002D = 45 , xVTI_PshrBw = 45 , //\n x002E = 46 , xOST_PTolUp = 46 , // x002E = 46 , xOST_PTolFw = 46 , //\n x002F = 47 , xOST_PTolDn = 47 , // x002F = 47 , xOST_PTolBw = 47 , //\n\n x0030 = 48 , xVTI_PTolUp = 48 , // x0030 = 48 , xVTI_PTolFw = 48 , //\n x0031 = 49 , xVTI_PTolDn = 49 , // x0031 = 49 , xVTI_PTolBw = 49 , //\n x0032 = 50 , xSRT_RjtTray1 = 50 , // x0032 = 50 , x050 = 50 , //\n x0033 = 51 , xSRT_RjtTray2 = 51 , // x0033 = 51 , x051 = 51 , //\n x0034 = 52 , xSRT_RjtTray3 = 52 , // x0034 = 52 , x052 = 52 , //\n x0035 = 53 , xSRT_RjtTray4 = 53 , // x0035 = 53 , x053 = 53 , //\n x0036 = 54 , xSRT_TrayDetect = 54 , // x0036 = 54 , x054 = 54 , //\n x0037 = 55 , x055 = 55 , // x0037 = 55 , x055 = 55 , //\n x0038 = 56 , xVSN_VsnReady1 = 56 , // x0038 = 56 , xVSN_VsnReady1 = 56 , //\n x0039 = 57 , xVSN_VsnBusy1 = 57 , // x0039 = 57 , xVSN_VsnBusy1 = 57 , //\n x003A = 58 , xVSN_VsnSpare1_1 = 58 , // x003A = 58 , xVSN_VsnSpare1_1 = 58 , //\n x003B = 59 , xVSN_VsnSpare1_2 = 59 , // x003B = 59 , xVSN_VsnSpare1_2 = 59 , //\n x003C = 60 , xVSN_VsnReady2 = 60 , // x003C = 60 , xVSN_VsnReady2 = 60 , //\n x003D = 61 , xVSN_VsnBusy2 = 61 , // x003D = 61 , xVSN_VsnBusy2 = 61 , //\n x003E = 62 , xVSN_VsnSpare2_1 = 62 , // x003E = 62 , xVSN_VsnSpare2_1 = 62 , //\n x003F = 63 , xVSN_VsnSpare2_2 = 63 , // x003F = 63 , xVSN_VsnSpare2_2 = 63 , //\n\n x0040 = 64 , xUST_Tray1 = 64 , // x0040 = 64 , xUST_Tray1 = 64 , //\n x0041 = 65 , xUST_Tray2Full = 65 , // x0041 = 65 , xUST_Tray2Full = 65 , //\n x0042 = 66 , xULD_Tray3Work = 66 , // x0042 = 66 , xULD_Tray3Work = 66 , //\n x0043 = 67 , xUSP_Tray4 = 67 , // x0043 = 67 , xUSP_Tray4Sply = 67 , //\n x0044 = 68 , xUSP_Tray5Sply = 68 , // x0044 = 68 , xUSP_Tray5 = 68 , //\n x0045 = 69 , xUSP_LGuidFw = 69 , // x0045 = 69 , xUSP_GuidFw = 69 , //\n x0046 = 70 , xUSP_RGuidFw = 70 , // x0046 = 70 , xUSP_GuidBw = 70 , //\n x0047 = 71 , xUST_IndxUp = 71 , // x0047 = 71 , xUST_IndxUp = 71 , //\n x0048 = 72 , xUST_LEjctUp = 72 , // x0048 = 72 , xUST_EjctUp1 = 72 , //\n x0049 = 73 , xUST_LEjctDn = 73 , // x0049 = 73 , xUST_EjctDn1 = 73 , //\n x004A = 74 , xUST_REjctUp = 74 , // x004A = 74 , xUST_EjctUp2 = 74 , //\n x004B = 75 , xUST_REjctDn = 75 , // x004B = 75 , xUST_EjctDn2 = 75 , //\n x004C = 76 , xETC_DoorRt = 76 , // x004C = 76 , x076 = 76 , //\n x004D = 77 , xULD_EmgSw = 77 , // x004D = 77 , xULD_EmgSw = 77 , //\n x004E = 78 , x078 = 78 , // x004E = 78 , x078 = 78 , //\n x004F = 79 , x079 = 79 , // x004F = 79 , x079 = 79 , //\n\n x0050 = 80 , xVTI_Ready1 = 80 , // VT x0050 = 80 , xVTI_Ready1 = 80 , // VT\n x0051 = 81 , xVTI_Busy1 = 81 , // x0051 = 81 , xVTI_Busy1 = 81 , //\n x0052 = 82 , xVTI_Spare1_1 = 82 , // x0052 = 82 , xVTI_Spare1_1 = 82 , //\n x0053 = 83 , xVTI_Spare1_2 = 83 , // x0053 = 83 , xVTI_Spare1_2 = 83 , //\n x0054 = 84 , xVTI_Ready2 = 84 , // x0054 = 84 , xVTI_Ready2 = 84 , //\n x0055 = 85 , xVTI_Busy2 = 85 , // x0055 = 85 , xVTI_Busy2 = 85 , //\n x0056 = 86 , xVTI_Spare2_1 = 86 , // x0056 = 86 , xVTI_Spare2_1 = 86 , //\n x0057 = 87 , xVTI_Spare2_2 = 87 , // x0057 = 87 , xVTI_Spare2_2 = 87 , //\n x0058 = 88 , xVTI_Ready3 = 88 , // x0058 = 88 , xVTI_Ready3 = 88 , //\n x0059 = 89 , xVTI_Busy3 = 89 , // x0059 = 89 , xVTI_Busy3 = 89 , //\n x005A = 90 , xVTI_Spare3_1 = 90 , // x005A = 90 , xVTI_Spare3_1 = 90 , //\n x005B = 91 , xVTI_Spare3_2 = 91 , // x005B = 91 , xVTI_Spare3_2 = 91 , //\n x005C = 92 , xVTI_Ready4 = 92 , // x005C = 92 , xVTI_Ready4 = 92 , //\n x005D = 93 , xVTI_Busy4 = 93 , // x005D = 93 , xVTI_Busy4 = 93 , //\n x005E = 94 , xVTI_Spare4_1 = 94 , // x005E = 94 , xVTI_Spare4_1 = 94 , //\n x005F = 95 , xVTI_Spare4_2 = 95 , // x005F = 95 , xVTI_Spare4_2 = 95 , //\n\n MAX_INPUT //MAX_INPUT\n};\n\n//그냥 아이오31. y+<파트 3자리>+_+<세부설명> 냥 아이오31. y+<파트 3자리>+_+<세부설명>\n//복동 실린더 아이오 y+<파트 3자리>+_+<세부설명>+<해당행동 ex) Fw , Bw , Dn 등등 2자리> 동 실린더 아이오 y+<파트 3자리>+_+<세부설명>+<해당행동 ex) Fw , Bw , Dn 등등 2자리\n//단동 실린더 아이오 y+<파트 3자리>+_+<세부설명>+<Fw시에해당행동2자리><Bw시에해당행동2자리> 동 실린더 아이오 y+<파트 3자리>+_+<세부설명>+<Fw시에해당행동2자리><Bw시에해당행동\nenum EN_OUTPUT_ID { // EN_OUTPUT_ID {\n y0000 = 0 , yETC_StartLp = 0 , // y0000 = 0 , yETC_StartLp = 0 , //\n y0001 = 1 , yETC_StopLp = 1 , // y0001 = 1 , yETC_StopLp = 1 , //\n y0002 = 2 , yETC_ResetLp = 2 , // y0002 = 2 , yETC_ResetLp = 2 , //\n y0003 = 3 , yETC_AirLp = 3 , // y0003 = 3 , yETC_AirLp = 3 , //\n y0004 = 4 , yETC_InitLp = 4 , // y0004 = 4 , yETC_InitLp = 4 , //\n y0005 = 5 , yETC_MainAir = 5 , // y0005 = 5 , yETC_MainAir = 5 , //\n y0006 = 6 , yETC_Light = 6 , // y0006 = 6 , yETC_Light = 6 , //\n y0007 = 7 , y007 = 7 , // y0007 = 7 , y007 = 7 , //\n y0008 = 8 , yETC_TwRedLp = 8 , // y0008 = 8 , yETC_TwRedLp = 8 , //\n y0009 = 9 , yETC_TwYelLp = 9 , // y0009 = 9 , yETC_TwYelLp = 9 , //\n y000A = 10 , yETC_TwGrnLp = 10 , // y000A = 10 , yETC_TwGrnLp = 10 , //\n y000B = 11 , yETC_TwBzz = 11 , // y000B = 11 , yETC_TwBzz = 11 , //\n y000C = 12 , yLSP_GuidBw = 12 , // y000C = 12 , yLSP_GuidBw = 12 , //\n y000D = 13 , yLDR_IndxUp = 13 , // y000D = 13 , yLDR_IndxUp = 13 , //\n y000E = 14 , yLST_StckUp = 14 , // y000E = 14 , yLST_StckUp = 14 , //\n y000F = 15 , yLDR_AirBlow = 15 , // y000F = 15 , yLDR_AirBlow = 15 , //\n\n y0010 = 16 , ySRT_Vcc1 = 16 , // yPRB_AirBlower y0010 = 16 , ySRT_Vcc1 = 16 , // yPRB_AirBlower\n y0011 = 17 , ySRT_Ejct1 = 17 , // yRAL_LIdxUpDn y0011 = 17 , ySRT_Ejct1 = 17 , // yRAL_LIdxUpDn\n y0012 = 18 , ySRT_Vcc2 = 18 , // yPSB_PshFwBw y0012 = 18 , ySRT_Vcc2 = 18 , // yPSB_PshFwBw\n y0013 = 19 , ySRT_Ejct2 = 19 , // yPSB_RlrDnUp y0013 = 19 , ySRT_Ejct2 = 19 , // yPSB_RlrDnUp\n y0014 = 20 , ySRT_Vcc3 = 20 , // yRAL_LRalVac y0014 = 20 , ySRT_Vcc3 = 20 , // yRAL_LRalVac\n y0015 = 21 , ySRT_Ejct3 = 21 , // yPSB_VsnVac y0015 = 21 , ySRT_Ejct3 = 21 , // yPSB_VsnVac\n y0016 = 22 , ySRT_Vcc4 = 22 , // yPSB_RwkVac y0016 = 22 , ySRT_Vcc4 = 22 , // yPSB_RwkVac\n y0017 = 23 , ySRT_Ejct4 = 23 , // yPRB_CmpDn y0017 = 23 , ySRT_Ejct4 = 23 , // yPRB_CmpDn\n y0018 = 24 , ySRT_PckrUp1 = 24 , // yPRB_CmpUp y0018 = 24 , ySRT_PckrUp1 = 24 , // yPRB_CmpUp\n y0019 = 25 , ySRT_PckrDn1 = 25 , // yPSB_CmpDn y0019 = 25 , ySRT_PckrDn1 = 25 , // yPSB_CmpDn\n y001A = 26 , ySRT_PckrUp2 = 26 , // yPSB_CmpUp y001A = 26 , ySRT_PckrUp2 = 26 , // yPSB_CmpUp\n y001B = 27 , ySRT_PckrDn2 = 27 , // y027/*yRWP_PkrVac*/ y001B = 27 , ySRT_PckrDn2 = 27 , // y027/*yRWP_PkrVac*/\n y001C = 28 , ySRT_PckrUp3 = 28 , // yRWB_BrdFw y001C = 28 , ySRT_PckrUp3 = 28 , // yRWB_BrdFw\n y001D = 29 , ySRT_PckrDn3 = 29 , // yCPK_PkrVac y001D = 29 , ySRT_PckrDn3 = 29 , // yCPK_PkrVac\n y001E = 30 , ySRT_PckrUp4 = 30 , // yCSP_AlnFw y001E = 30 , ySRT_PckrUp4 = 30 , // yCSP_AlnFw\n y001F = 31 , ySRT_PckrDn4 = 31 , // yATP_RtrRl y001F = 31 , ySRT_PckrDn4 = 31 , // yATP_RtrRl\n\n y0020 = 32 , ySRT_Vcc = 32 , // yATP_PkrVac y0020 = 32 , ySRT_Vcc = 32 , // yATP_PkrVac\n y0021 = 33 , ySRT_AlgnFw = 33 , // yATP_PkrEjt y0021 = 33 , ySRT_Algn12Up = 33 , // yATP_PkrEjt\n y0022 = 34 , y034 = 34 , // yPCP_PkrVacL y0022 = 34 , ySRT_Algn34Up = 34 , // yPCP_PkrVacL\n y0023 = 35 , ySRT_AlgnAirBlw = 35 , // yPCP_PkrEjtL y0023 = 35 , ySRT_AlgnAirBlw = 35 , // yPCP_PkrEjtL\n y0024 = 36 , yOST_PshrDn = 36 , // yPCP_PkrVacR y0024 = 36 , yOST_PshrDn = 36 , // yPCP_PkrVacR\n y0025 = 37 , yVTI_PshrDn = 37 , // yPCP_PkrEjtR y0025 = 37 , yVTI_PshrDn = 37 , // yPCP_PkrEjtR\n y0026 = 38 , yOST_PTolUp = 38 , // yRWP_PkrVac y0026 = 38 , yOST_PTolUp = 38 , // yRWP_PkrVac\n y0027 = 39 , yVTI_PTolUp = 39 , // yRWP_PkrEjt y0027 = 39 , yVTI_PTolUp = 39 , // yRWP_PkrEjt\n y0028 = 40 , ySRT_ZBreak = 40 , // yCUR_CmpDn y0028 = 40 , ySRT_ZBreak = 40 , // yCUR_CmpDn\n y0029 = 41 , yLDR_ZBreak = 41 , // yCUR_CmpUp y0029 = 41 , yLDR_ZBreak = 41 , // yCUR_CmpUp\n y002A = 42 , yVSN_TrgRellay1 = 42 , // yPCP_EpdFw y002A = 42 , y042 = 42 , // yPCP_EpdFw\n y002B = 43 , yVSN_TrgRellay2 = 43 , // y043 y002B = 43 , y043 = 43 , // y043\n y002C = 44 , y044 = 44 , // yPSB_FeedAC y002C = 44 , y044 = 44 , // yPSB_FeedAC\n y002D = 45 , y045 = 45 , // y045 y002D = 45 , y045 = 45 , // y045\n y002E = 46 , y046 = 46 , // y046 y002E = 46 , y046 = 46 , // y046\n y002F = 47 , yVTI_VTPower = 47 , // y047 y002F = 47 , y047 = 47 , // y047\n\n y0030 = 48 , y048 = 48 , //y048 y0030 = 48 , y048 = 48 , //y048\n y0031 = 49 , y049 = 49 , //y049 y0031 = 49 , y049 = 49 , //y049\n y0032 = 50 , y050 = 50 , //y050 y0032 = 50 , y050 = 50 , //y050\n y0033 = 51 , y051 = 51 , //y051 y0033 = 51 , y051 = 51 , //y051\n y0034 = 52 , y052 = 52 , //y052 y0034 = 52 , y052 = 52 , //y052\n y0035 = 53 , y053 = 53 , //y053 y0035 = 53 , y053 = 53 , //y053\n y0036 = 54 , y054 = 54 , //y054 y0036 = 54 , y054 = 54 , //y054\n y0037 = 55 , y055 = 55 , //y055 y0037 = 55 , y055 = 55 , //y055\n y0038 = 56 , yVSN_VsnReset1 = 56 , //y056 y0038 = 56 , yVSN_VsnReset1 = 56 , //y056\n y0039 = 57 , yVSN_VsnChang1 = 57 , //y057 y0039 = 57 , yVSN_VsnChang1 = 57 , //y057\n y003A = 58 , yVSN_VsnSpare1_1 = 58 , //y058 y003A = 58 , yVSN_VsnSpear1_1 = 58 , //y058\n y003B = 59 , yVSN_VsnLotStart1 = 59 , //y059 y003B = 59 , yVSN_VsnSpare1_2 = 59 , //y059\n y003C = 60 , yVSN_VsnReset2 = 60 , //y060 y003C = 60 , yVSN_VsnReset2 = 60 , //y060\n y003D = 61 , yVSN_VsnChang2 = 61 , //y061 y003D = 61 , yVSN_VsnChang2 = 61 , //y061\n y003E = 62 , yVSN_VsnSpare2_1 = 62 , //y062 y003E = 62 , yVSN_VsnSpare2_1 = 62 , //y062\n y003F = 63 , yVSN_VsnLotStart2 = 63 , //y063 y003F = 63 , yVSN_VsnSpare2_2 = 63 , //y063\n\n y0040 = 64 , yUSP_GuidFw = 64 , // y0040 = 64 , yUSP_GuidFw = 64 , //\n y0041 = 65 , yULD_IndxUp = 65 , // y0041 = 65 , yULD_IndxUp = 65 , //\n y0042 = 66 , yUST_StckUp = 66 , // y0042 = 66 , yUST_StckUp = 66 , //\n y0043 = 67 , y067 = 67 , // y0043 = 67 , y067 = 67 , //\n y0044 = 68 , yULD_ZBreak = 68 , // y0044 = 68 , yULD_ZBreak = 68 , //\n y0045 = 69 , y069 = 69 , // y0045 = 69 , y069 = 69 , //\n y0046 = 70 , y070 = 70 , // y0046 = 70 , y070 = 70 , //\n y0047 = 71 , y071 = 71 , // y0047 = 71 , y071 = 71 , //\n y0048 = 72 , y072 = 72 , // y0048 = 72 , y072 = 72 , //\n y0049 = 73 , y073 = 73 , // y0049 = 73 , y073 = 73 , //\n y004A = 74 , y074 = 74 , // y004A = 74 , y074 = 74 , //\n y004B = 75 , y075 = 75 , // y004B = 75 , y075 = 75 , //\n y004C = 76 , y076 = 76 , // y004C = 76 , y076 = 76 , //\n y004D = 77 , y077 = 77 , // y004D = 77 , y077 = 77 , //\n y004E = 78 , y078 = 78 , // y004E = 78 , y078 = 78 , //\n y004F = 79 , y079 = 79 , // y004F = 79 , y079 = 79 , //\n\n y0050 = 80 , yVTI_Start1 = 80 , // y0050 = 80 , yVTI_Start1 = 80 , //\n y0051 = 81 , yVTI_Reset1 = 81 , // y0051 = 81 , yVTI_Reset1 = 81 , //\n y0052 = 82 , yVTI_Change1 = 82 , // y0052 = 82 , yVTI_Change1 = 82 , //\n y0053 = 83 , yVTI_Spare1 = 83 , // y0053 = 83 , yVTI_Spare1 = 83 , //\n y0054 = 84 , yVTI_Start2 = 84 , // y0054 = 84 , yVTI_Start2 = 84 , //\n y0055 = 85 , yVTI_Reset2 = 85 , // y0055 = 85 , yVTI_Reset2 = 85 , //\n y0056 = 86 , yVTI_Change2 = 86 , // y0056 = 86 , yVTI_Change2 = 86 , //\n y0057 = 87 , yVTI_Spare2 = 87 , // y0057 = 87 , yVTI_Spare2 = 87 , //\n y0058 = 88 , yVTI_Start3 = 88 , // y0058 = 88 , yVTI_Start3 = 88 , //\n y0059 = 89 , yVTI_Reset3 = 89 , // y0059 = 89 , yVTI_Reset3 = 89 , //\n y005A = 90 , yVTI_Change3 = 90 , // y005A = 90 , yVTI_Change3 = 90 , //\n y005B = 91 , yVTI_Spare3 = 91 , // y005B = 91 , yVTI_Spare3 = 91 , //\n y005C = 92 , yVTI_Start4 = 92 , // y005C = 92 , yVTI_Start4 = 92 , //\n y005D = 93 , yVTI_Reset4 = 93 , // y005D = 93 , yVTI_Reset4 = 93 , //\n y005E = 94 , yVTI_Change4 = 94 , // y005E = 94 , yVTI_Change4 = 94 , //\n y005F = 95 , yVTI_Spare4 = 95 , // y005F = 95 , yVTI_Spare4 = 95 , //\n\n\n MAX_OUTPUT\n};\n\n// 포지션 벨류 pv+<파트3자리>+_+<부가설명>+<포지션설명>\n// 오프셑 오프셑 po+<파트3자리>+_+<부가설명>+<오프셑설명>\n/*\n miLDR_YIndx = 0 , // 로더\n miLSP_ZElev = 1 , // 로더 서플라이 Z\n miSRT_YPckr = 2 , // 피커 무브 Y\n miSRT_ZPckr = 3 , // 피커 툴 Z\n miSRT_XPckr = 4 , // 피커 무브 X\n miSTG_TTble = 5 , // 턴테이블\n miSTG_YVisn = 6 , // 비젼 검사\n miSRT_XExpd = 7 , // 익스펜딩\n miULD_YIndx = 8 , // 언로더 Y\n miULD_ZElev = 9 , // 언로더 Z\n*/\nenum EN_PSTN_VALUE { //\n pvLDR_YIndxWait = 0 ,\n pvLDR_YIndxGet , \n pvLDR_YIndxWorkStt , \n pvLDR_YIndxOut , \n MAX_PSTN_MOTR0 ,\n\n pvLSP_ZElevWait = 0 ,\n pvLSP_ZElevTop ,\n pvLSP_ZElevSperate , \n MAX_PSTN_MOTR1 , \n \n pvSRT_YPckrWait = 0 ,\n pvSRT_YPckrPick ,\n pvSRT_YPckrZig ,\n pvSRT_YPckrPocket ,\n pvSRT_YPckrReject1Stt ,\n pvSRT_YPckrReject2Stt ,\n pvSRT_YPckrReject3Stt ,\n pvSRT_YPckrReject4Stt ,\n pvSRT_YPckrPlace ,\n MAX_PSTN_MOTR2 ,\n\n pvSRT_ZPckrWait = 0 ,\n pvSRT_ZPckrMove ,\n pvSRT_ZPckrSTGPick ,\n pvSRT_ZPckrSTGPlace ,\n pvSRT_ZPckrZIGPick ,\n pvSRT_ZPckrZIGPlace ,\n pvSRT_ZPckrRJTPick ,\n pvSRT_ZPckrRJTPlace ,\n pvSRT_ZPckrLDRPick ,\n pvSRT_ZPckrLDRPlace ,\n pvSRT_ZPckrULDPick ,\n pvSRT_ZPckrULDPlace ,\n MAX_PSTN_MOTR3 ,\n\n pvSRT_XPckrWait = 0 ,\n pvSRT_XPckrPickStt ,\n pvSRT_XPckrZig ,\n pvSRT_XPckrPocket ,\n pvSRT_XPckrReject1Stt ,\n pvSRT_XPckrReject2Stt ,\n pvSRT_XPckrReject3Stt ,\n pvSRT_XPckrReject4Stt ,\n pvSRT_XPckrPlaceStt ,\n MAX_PSTN_MOTR4 ,\n\n pvSTG_TTbleWait = 0 ,\n pvSTG_TTbleWork ,\n MAX_PSTN_MOTR5 ,\n\n pvSTG_YVisnWait = 0 ,\n pvSTG_YVisnTrgStt1 ,\n pvSTG_YVisnTrgStt2 ,\n MAX_PSTN_MOTR6 ,\n\n pvSRT_XExpdWait = 0 ,\n pvSRT_XExpdLDRTray ,\n pvSRT_XExpdPocket ,\n pvSRT_XExpdReject ,\n pvSRT_XExpdZig ,\n pvSRT_XExpdULDTray ,\n MAX_PSTN_MOTR7 ,\n\n pvULD_YIndxWait = 0 ,\n pvULD_YIndxGet ,\n pvULD_YIndxWorkStt ,\n pvULD_YIndxOut ,\n MAX_PSTN_MOTR8 ,\n\n pvUSP_ZElevWait = 0 ,\n pvUSP_ZElevTop ,\n pvUSP_ZElevSperate ,\n MAX_PSTN_MOTR9\n};\n\n// 포지션 벨류 pi+<파트3자리>+_+<부가설명>+<포지션설명>\n// 포지션이 정해져 있지 않는 것은 (ex)piWRK_XIdxWork ,piLDR_ZCmpWork) 뒤로 빼야\n// PstnMan에서 CheckSafe및 버튼 클릭 시에 맞아 떨어진다. 주의....\nenum EN_PSTN_ID {\n piLDR_YIndxWait = 0 ,\n piLDR_YIndxGet ,\n piLDR_YIndxWorkStt ,\n piLDR_YIndxOut ,\n piLDR_YIndxWork ,\n MAX_PSTN_ID_MOTR0 ,\n\n piLSP_ZElevWait = 0 ,\n piLSP_ZElevTop ,\n piLSP_ZElevSperate ,\n MAX_PSTN_ID_MOTR1 ,\n\n piSRT_YPckrWait = 0 ,\n piSRT_YPckrPick ,\n piSRT_YPckrZig ,\n piSRT_YPckrPocket ,\n piSRT_YPckrReject1Stt ,\n piSRT_YPckrReject2Stt ,\n piSRT_YPckrReject3Stt ,\n piSRT_YPckrReject4Stt ,\n piSRT_YPckrPlace ,\n piSRT_YPckrReject1 ,//---------\n piSRT_YPckrReject2 ,\n piSRT_YPckrReject3 ,\n piSRT_YPckrReject4 ,\n MAX_PSTN_ID_MOTR2 ,\n\n piSRT_ZPckrWait = 0 ,\n piSRT_ZPckrMove ,\n piSRT_ZPckrSTGPick ,\n piSRT_ZPckrSTGPlace ,\n piSRT_ZPckrZIGPick ,\n piSRT_ZPckrZIGPlace ,\n piSRT_ZPckrRJTPick ,\n piSRT_ZPckrRJTPlace ,\n piSRT_ZPckrLDRPick ,\n piSRT_ZPckrLDRPlace ,\n piSRT_ZPckrULDPick ,\n piSRT_ZPckrULDPlace ,\n MAX_PSTN_ID_MOTR3 ,\n\n piSRT_XPckrWait = 0 ,\n piSRT_XPckrPickStt ,\n piSRT_XPckrZig ,\n piSRT_XPckrPocket ,\n piSRT_XPckrReject1Stt ,\n piSRT_XPckrReject2Stt ,\n piSRT_XPckrReject3Stt ,\n piSRT_XPckrReject4Stt ,\n piSRT_XPckrPlaceStt ,\n piSRT_XPckrPick ,//---------\n piSRT_XPckrReject1 ,\n piSRT_XPckrReject2 ,\n piSRT_XPckrReject3 ,\n piSRT_XPckrReject4 ,\n piSRT_XPckrPlace ,\n MAX_PSTN_ID_MOTR4 ,\n\n piSTG_TTbleWait = 0 ,\n piSTG_TTbleWork ,\n MAX_PSTN_ID_MOTR5 ,\n\n piSTG_YVisnWait = 0 ,\n piSTG_YVisnTrgStt1 ,\n piSTG_YVisnTrgStt2 ,\n piSTG_YVisnWorkStt1 ,\n piSTG_YVisnWorkEnd1 ,\n piSTG_YVisnWorkStt2 ,\n piSTG_YVisnWorkEnd2 ,\n MAX_PSTN_ID_MOTR6 ,\n\n piSRT_XExpdWait = 0 ,\n piSRT_XExpdLDRTray ,\n piSRT_XExpdPocket ,\n piSRT_XExpdReject ,\n piSRT_XExpdZig ,\n piSRT_XExpdULDTray ,\n MAX_PSTN_ID_MOTR7 ,\n\n piULD_YIndxWait = 0 ,\n piULD_YIndxGet ,\n piULD_YIndxWorkStt ,\n piULD_YIndxOut ,\n piULD_YIndxWork ,\n MAX_PSTN_ID_MOTR8 ,\n\n piUSP_ZElevWait = 0 ,\n piUSP_ZElevTop ,\n piUSP_ZElevSperate ,\n MAX_PSTN_ID_MOTR9\n\n};\n\n\nenum EN_MANUAL_CYCLE\n{\n//20140620 JS 정리.\n/*\n piPRB = 0 , //프리버퍼\n piRAL , //레이져,비젼 밑에 레일\n piLSR , //레이져\n piVSN , //비젼검사\n piPSB , //포스트버퍼\n piLDR , //로더.\n piULD , //언로더.\n*/\n\n\n mcNoneCycle = 0 ,\n mcAllHome = 1 ,\n\n mcLSP_Home = 10 ,\n mcLSP_CycleSupply ,\n mcLSP_GuidFwBw ,\n mcLDR_Home ,\n mcLDR_CycleIn ,\n mcLDR_CycleWork ,\n mcLDR_CycleOut ,\n mcLDR_AirBlow ,\n mcLDR_IndxUpDn ,\n mcLST_Home ,\n mcLST_CycleStock ,\n mcLST_StckUpDn ,\n\n mcSRT_Home = 30 ,\n mcSRT_CyclePickLDR ,\n mcSRT_CyclePlceLDR ,\n mcSRT_CyclePickSTG ,\n mcSRT_CyclePlceSTG ,\n mcSRT_CyclePickRJT1 ,\n mcSRT_CyclePlceRJT1 ,\n mcSRT_CyclePickRJT4 ,\n mcSRT_CyclePlceRJT4 ,\n mcSRT_CyclePickULD ,\n mcSRT_CyclePlceULD ,\n mcSRT_CyclePickZIG ,\n mcSRT_CyclePlceZIG ,\n mcSRT_CycleMoveLDR ,\n mcSRT_CycleMoveSTG ,\n mcSRT_CycleMoveRJT1 ,\n mcSRT_CycleMoveRJT4 ,\n mcSRT_CycleMoveULD ,\n mcSRT_CycleMoveZIG ,\n\n mcSTG_Home = 50 ,\n mcSTG_CycleWork ,\n mcSTG_Turn90 ,\n mcSTG_Turn90N ,\n mcSTG_Turn45 ,\n mcSTG_Turn45N ,\n mcOST_Home ,\n mcOST_CycleWork ,\n mcOST_CycleTest ,\n mcOST_PshrDnUp ,\n mcOST_PTolUpDn ,\n mcVTI_Home ,\n mcVTI_CycleWork ,\n mcVTI_CycleTest ,\n mcVTI_CycleBind ,\n mcVTI_CycleUnBind ,\n mcVTI_PshrDnUp ,\n mcVTI_PTolUpDn ,\n mcVTI_MainPwr ,\n mcVSN_Home ,\n mcVSN_CycleWork ,\n mcVSN_MoveP ,\n mcVSN_MoveN ,\n mcVSN_MoveTrg1 ,\n mcVSN_MoveTrg2 ,\n\n mcUSP_Home = 80 ,\n mcUSP_CycleSupply ,\n mcUSP_GuidFwBw ,\n mcULD_Home ,\n mcULD_CycleIn ,\n mcULD_CycleWork ,\n mcULD_CycleOut ,\n mcULD_IndxUpDn ,\n mcUST_Home ,\n mcUST_CycleStock ,\n mcUST_StckUpDn ,\n\n\n\n/*\n mcNoneCycle = 0 ,\n mcAllHome = 1 ,\n\n\n mcLSP_CycleSupply = 10 ,\n mcLDR_CycleIn ,\n mcLDR_CycleOut ,\n mcLST_CycleStock ,\n mcSTG_CycleWork ,\n mcOST_CycleWork ,\n mcVTI_CycleWork ,\n mcVSN_CycleWork ,\n mcUSP_CycleSupply ,\n mcULD_CycleIn ,\n mcULD_CycleOut ,\n mcUST_CycleStock ,\n mcVTI_CycleTest ,\n\n mcLSP_Home = 25 ,\n mcLSP_GuidFwBw ,\n\n mcLDR_Home = 30 ,\n mcLDR_CycleWork ,\n mcLDR_AirBlow ,\n mcLDR_IndxUpDn ,\n\n\n mcLST_Home = 35 ,\n mcLST_StckUpDn ,\n\n\n mcSRT_Home = 40 ,\n mcSRT_CyclePickSTG ,\n mcSRT_CyclePlceRJT ,\n mcSRT_CyclePlceULD ,\n mcSRT_CyclePickZIG ,\n mcSRT_CyclePlceSTG ,\n mcSRT_CyclePickLDR ,\n mcSRT_CyclePlceZIG ,\n mcSRT_Vcc1 ,\n mcSRT_Ejct1 ,\n mcSRT_Vcc2 ,\n mcSRT_Ejct2 ,\n mcSRT_Vcc3 ,\n mcSRT_Ejct3 ,\n mcSRT_Vcc4 ,\n mcSRT_Ejct4 ,\n mcSRT_MainVcc ,\n mcSRT_AlgnAirBlw ,\n mcSRT_FrstDnUp ,\n mcSRT_ScndDnUp ,\n mcSRT_ThrdDnUp ,\n mcSRT_FrtdDnUp ,\n mcSRT_AlgnUpDn ,\n\n mcSTG_Home = 70 ,\n\n mcOST_Home = 75 ,\n mcOST_PshrDnUp ,\n mcOST_PTolUpDn ,\n\n mcVTI_Home = 80 ,\n mcVTI_PshrDnUp ,\n mcVTI_PTolUpDn ,\n\n\n mcVSN_Home = 85 ,\n\n mcUSP_Home = 90 ,\n mcUSP_GuidFwBw ,\n\n mcULD_Home = 95 ,\n mcULD_CycleWork ,\n mcULD_IndxUpDn ,\n\n mcUST_Home = 100,\n mcUST_StckUpDn ,\n\n //Set Up용 Manual JS.\n mcSTU_Turn90 = 110,\n mcSTU_PickSTG ,\n mcSTU_PlaceSTG ,\n mcSTU_PickJIG ,\n mcSTU_PlaceJIG ,\n mcSTU_PickRJ1 ,\n mcSTU_PlaceRJ1 ,\n mcSTU_PickRJ2 ,\n mcSTU_PlaceRJ2 ,\n mcSTU_PickRJ3 ,\n mcSTU_PlaceRJ3 ,\n mcSTU_PickRJ4 ,\n mcSTU_PlaceRJ4 ,\n mcSTU_PickLDR ,\n mcSTU_PlaceLDR ,\n mcSTU_PickULD ,\n mcSTU_PlaceULD ,\n*/\n\n/*\n mcNoneCycle = 0 ,\n mcAllHome = 1 ,\n\n mcLSP_Home = 10 ,\n mcLSP_CycleSupply ,\n mcLSP_GuidFwBw ,\n\n mcLDR_Home = 15 ,\n mcLDR_CycleIn ,\n mcLDR_CycleWork ,\n mcLDR_CycleOut ,\n mcLDR_AirBlow ,\n mcLDR_IndxUpDn ,\n\n mcLST_Home = 25 ,\n mcLST_CycleStock ,\n mcLST_StckUpDn ,\n\n mcSRT_Home = 30 ,\n mcSRT_CyclePickSTG ,\n mcSRT_CyclePlceRJT ,\n mcSRT_CyclePlceULD ,\n mcSRT_CyclePickZIG ,\n mcSRT_CyclePlceSTG ,\n mcSRT_CyclePickLDR ,\n mcSRT_CyclePlceZIG ,\n mcSRT_Vcc1 ,\n mcSRT_Ejct1 ,\n mcSRT_Vcc2 ,\n mcSRT_Ejct2 ,\n mcSRT_Vcc3 ,\n mcSRT_Ejct3 ,\n mcSRT_Vcc4 ,\n mcSRT_Ejct4 ,\n mcSRT_Vcc ,\n mcSRT_AlgnAirBlw ,\n mcSRT_FrstDnUp ,\n mcSRT_ScndDnUp ,\n mcSRT_ThrdDnUp ,\n mcSRT_FrtdDnUp ,\n mcSRT_AlgnUpDn ,\n\n mcSTG_Home = 60 ,\n mcSTG_CycleWork ,\n\n mcOST_Home = 65 ,\n mcOST_CycleWork ,\n mcOST_PshrDnUp ,\n mcOST_PTolUpDn ,\n\n mcVTI_Home = 70 ,\n mcVTI_CycleWork ,\n mcVTI_PshrDnUp ,\n mcVTI_PTolUpDn ,\n\n\n mcVSN_Home = 75 ,\n mcVSN_CycleWork ,\n\n mcUSP_Home = 80 ,\n mcUSP_CycleSupply ,\n mcUSP_GuidFwBw ,\n\n mcULD_Home = 85 ,\n mcULD_CycleIn ,\n mcULD_CycleWork ,\n mcULD_CycleOut ,\n mcULD_IndxUpDn ,\n\n mcUST_Home = 95 ,\n mcUST_CycleStock ,\n mcUST_StckUpDn ,\n*/\n MAX_MANUAL_CYCLE\n};\n\nenum EN_ERR_ID {\n/*000*/eiETC_MainAir =0,\n/*001*/ei001 ,\n/*002*/eiETC_Emergency ,\n/*003*/ei003 ,\n/*004*/eiETC_Door ,\n/*005*/ei005 ,\n/*006*/ei006 ,\n/*007*/ei007 ,\n/*008*/ei008 ,\n/*009*/eiETC_ToStartTO , \n/*010*/eiETC_ToStopTO , \n/*011*/eiETC_AllHomeTO , \n/*012*/eiETC_ManCycleTO , \n/*013*/ei013 ,\n/*014*/eiPRT_CycleTO ,\n/*015*/eiPRT_HomeTo ,\n/*016*/eiPRT_ToStartTO ,\n/*017*/eiPRT_ToStopTO ,\n/*018*/ei018 , \n/*019*/eiMTR_HomeEnd , \n/*020*/eiMTR_NegLim , \n/*021*/eiMTR_PosLim , \n/*022*/eiMTR_Alarm ,\n/*023*/ei023 ,\n/*024*/eiATR_TimeOut ,\n/*025*/ei025 ,\n/*026*/eiPKG_Dispr ,\n/*027*/eiPKG_Unknwn , //--------------------------------- 장비공통에러.\n/*028*/ei028 ,\n/*029*/ei029 ,\n/*030*/eiLSP_NeedTray , //LDR\n/*031*/eiLST_FullTray ,\n/*032*/ei032 ,\n/*033*/ei033 ,\n/*034*/ei034 ,\n/*035*/eiUSP_NeedTray , //ULD\n/*036*/eiUST_FullTray ,\n/*037*/ei037 ,\n/*038*/ei038 ,\n/*039*/ei039 ,\n/*040*/eiVSN_SerialNG , //포켓별 연속에러.\n/*041*/eiVSN_Busy , //비지 않죽음.\n/*042*/eiVSN_NotReady , //레디 안됌.. 프로그램 안킴.\n/*043*/eiVSN_TimeOut , //비젼 시퀜스 타임아웃.\n/*044*/eiVSN_WrongData , //데이터 포멧이 맞지 않음.\n/*045*/ei045 ,\n/*046*/eiVTI_SerialNG , //포켓별 연속에러.\n/*047*/eiVTI_Busy , //비지 않죽음.\n/*048*/eiVTI_NotReady , //레디 안됌.. 프로그램 안킴.\n/*050*/eiVTI_TimeOut , //비젼 시퀜스 타임아웃.\n/*051*/eiVTI_WrongData , //파일 읽기 실패.\n/*052*/eiOST_SerialNG , //OST검사 연속에러.\n/*053*/eiOST_TimeOut , //OST검사 타임아웃 에러.\n/*054*/eiOST_WrongData , //OST 검사 결과값이 이상함.\n/*055*/eiLDR_VaccMiss , //로더쪽에서 픽 미스.\n/*056*/eiSRT_VaccMiss , //지그 및 소켓 에서 픽 미스.\n/*057*/eiSRT_PlceMiss ,\n/*058*/eiSRT_RejectFull , //리젝 다찼음.\n/*059*/eiSRT_RJTNeedTray , //리젝 구간 트레이 없음.\n/*060*/eiSRT_RJTTrayRelease , //트레이 테이블 빠짐.\n/*061*/ei061 , //\n/*062*/ei062 , //\n/*063*/ei063 , //\n/*064*/ei064 , //\n/*065*/ei065 , //\n/*066*/ei066 , //\n/*067*/ei067 , //\n/*068*/ei068 , //\n/*069*/ei069 , //\n/*070*/ei070 , //\nMAX_ERR\n};\n\n\n#endif\n\n"},"authors":{"kind":"list like","value":["sheepdw@gmail.com"],"string":"[\n \"sheepdw@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"sheepdw@gmail.com"}}},{"rowIdx":971178,"cells":{"blob_id":{"kind":"string","value":"0a04b3b7427d17136e30cbc0e8493e0cf774a0db"},"directory_id":{"kind":"string","value":"130f27d13aed7971680d4aad6f7418b97c0bb9fd"},"path":{"kind":"string","value":"/YesNoGame/YesNoGameExample.c"},"content_id":{"kind":"string","value":"8e6117cfdee1586fa7a54fb09eb3af9e8645216a"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"Zach-Weber/Class-Work"},"snapshot_id":{"kind":"string","value":"ef1e1d153bdb2639bc2d4339bd47bbf4202114eb"},"revision_id":{"kind":"string","value":"9b369f04408e22de3d295d56f88dd687ec52e42b"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2020-08-24T22:41:33.398970","string":"2020-08-24T22:41:33.398970"},"revision_date":{"kind":"timestamp","value":"2020-03-03T08:18:35","string":"2020-03-03T08:18:35"},"committer_date":{"kind":"timestamp","value":"2020-03-03T08:18:35","string":"2020-03-03T08:18:35"},"github_id":{"kind":"number","value":216920469,"string":"216,920,469"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":3211,"string":"3,211"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"/****************************\nFilename: YesNoGame.c\nName: Zach Weber\nDate Last Edited: 16 Sep 2019\nBrief Description: Starting point for a yes no game\ngcc -Wall -Wextra -Werror -ansi -pedantic -O YesNoGame.c -o game.exe\n****************************/\n\n\n/*printf, scanf*/\n#include <stdio.h>\n/*rand, srand*/\n#include <stdlib.h>\n/*time*/\n#include <time.h>\n\n#define INTRO -1\n\nint main(void)\n{\n\t/*valid inputs will be y, n, and q to quit*/\n\tchar input;\n\t/*-1 descibes the starter event*/\n\tint eventID = -1;\n\t/*change this if you want to add more events*/\n\tint maxEventID = 2;\n\t/*Add other game variables here, this could include a currency, special event triggers, how far down a specific event chain they are, ect.*/\n\t\n\t\n\t/*EXAMPLE extra variable*/\n\tint introSeq = 0;\n\t/*set a seed using time*/\n\tsrand(time(0));\n\t/*Add the introduction to the game here, explain the rules to user */\n\t\n\t\n\t\n\tdo\n\t{\n\t\t/*setting input to 'a' resets the input*/\n\t\tinput = 'a';\n\t\t/*switch on the event, in each have something desribe what the options are (y/n)*/\n\t\tswitch(eventID)\n\t\t{\n\t\t\tcase INTRO:\n\t\t\t\tif(introSeq == 0);\n\t\t\t\t{\n\t\t\t\t\tprintf(\"\\nAssistant: Hello! You must be our new manager. Welcome our diner, 'The Rusty Spoon'!\\n\");\n\t\t\t\t\tprintf(\"Your job is to manage the requests and complaints of the customers and staff\\n\");\n\t\t\t\t\tprintf(\"all while maintaining your staff numbers, customer happiness, and money.\\n\");\n\t\t\t\t\tprintf(\"\\nAssistant: Do you think your up to the task?\\n\");\n\t\t\t\t}\n\t\t\t\telse if(introSeq == 1\n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 0:\n\t\t\t\t/*Add what each case is asking here in each case*/\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\t/*Add what each case is asking here in each case*/\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\t/*Add what each case is asking here in each case*/\n\t\t\t\tbreak;\n\t\t}\n\t\t\n\t\t\n\t\t/*accept a character as input q quits everyting else should be n or y if none keep checking*/\n\t\twhile(input != 'n' && input != 'y'&& input != 'q')\n\t\t{\n\t\t\tprintf(\"\\nEnter 'y' for yes or 'n' for no ('q' to quit):\\n\");\n\t\t\t/*scanf goes here*/\n\t\t\tscanf(\" %c\", &input);\n\t\t\t\n\t\t}\n\t\t/*switch on the event change outcome based on input*/\n\t\tswitch(eventID)\n\t\t{\n\t\t\tcase -1:\n\t\t\t\tswitch(introSeq)\n\t\t\t\t{\n\t\t\t\t\tcase 0:\n\t\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 0:\n\t\t\t\t/*Add what happens in each answer down here, they can adjust variables*/\n\t\t\t\tif(input == 'y')\n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\telse if(input == 'n')\n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\t/*Example with an event sequence*/\n\t\t\t\tswitch(event1Seq){\n\t\t\t\t\tcase 0:\n\t\t\t\t\t\tif(input == 'y')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tprintf(\"Very Wise.\\n\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(input == 'n')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tprintf(\"Bring in more coconuts!\\n\");\n\t\t\t\t\t\t\t++event1Seq;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 1:\n\t\t\t\t\t\tif(input == 'y')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tprintf(\"The townspeople don't like this and are revolting!\");\n\t\t\t\t\t\t\t--event1Seq;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(input == 'n')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tprintf(\"Where did we even find all these coconuts, we aren't near a tropical climate...\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tif(input == 'y')\n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\telse if(input == 'n')\n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t}\n\t\t\n\t\t/*reset event id with rand*/\n\t\teventID = rand() % (maxEventID + 1);\n\t\tgetchar();\n\t\tgetchar();\n\t\t\n\t}while(input != 'q');\n\t\n\t\n\treturn 0;\n}\n\n"},"authors":{"kind":"list like","value":["zachary.weber@digipen.edu"],"string":"[\n \"zachary.weber@digipen.edu\"\n]","isConversational":false},"author_id":{"kind":"string","value":"zachary.weber@digipen.edu"}}},{"rowIdx":971179,"cells":{"blob_id":{"kind":"string","value":"459227fbbe34d022860b69274a2648de9a7658f2"},"directory_id":{"kind":"string","value":"89208be1fd89bf21636c6823bcda292fa5cc7961"},"path":{"kind":"string","value":"/src/config.h"},"content_id":{"kind":"string","value":"b4b405e970f9b5d2ef40179f7437fa8bed59abf9"},"detected_licenses":{"kind":"list like","value":["MIT"],"string":"[\n \"MIT\"\n]","isConversational":false},"license_type":{"kind":"string","value":"permissive"},"repo_name":{"kind":"string","value":"encryptogroup/UC"},"snapshot_id":{"kind":"string","value":"2c517b67b1ee2f651c007c24f61c1efd629760b8"},"revision_id":{"kind":"string","value":"befdd63b69337dcbed3d67bdd03412c49e3c662d"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2021-05-03T13:13:49.031171","string":"2021-05-03T13:13:49.031171"},"revision_date":{"kind":"timestamp","value":"2021-01-07T13:02:45","string":"2021-01-07T13:02:45"},"committer_date":{"kind":"timestamp","value":"2021-01-07T13:02:45","string":"2021-01-07T13:02:45"},"github_id":{"kind":"number","value":50654088,"string":"50,654,088"},"star_events_count":{"kind":"number","value":36,"string":"36"},"fork_events_count":{"kind":"number","value":11,"string":"11"},"gha_license_id":{"kind":"string","value":"MIT"},"gha_event_created_at":{"kind":"timestamp","value":"2021-01-07T13:01:13","string":"2021-01-07T13:01:13"},"gha_created_at":{"kind":"timestamp","value":"2016-01-29T09:54:36","string":"2016-01-29T09:54:36"},"gha_language":{"kind":"string","value":"C++"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":1621,"string":"1,621"},"extension":{"kind":"string","value":"h"},"content":{"kind":"string","value":"/**\n \\file \t\tconfig.h\n \\author \tguenther@rangar.de\n \\copyright\tValiant's Universal Circuit Construction Optimized for Private Function Evaluation\n\t\t\tCopyright (C) 2016 Engineering Cryptographic Protocols Group, TU Darmstadt\n\t\t\tThis program is free software: you can redistribute it and/or modify\n\t\t\tit under the terms of the GNU Affero General Public License as published\n\t\t\tby the Free Software Foundation, either version 3 of the License, or\n\t\t\t(at your option) any later version.\n\t\t\tThis program is distributed in the hope that it will be useful,\n\t\t\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\t\t\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\t\t\tGNU Affero General Public License for more details.\n\t\t\tYou should have received a copy of the GNU Affero General Public License\n\t\t\talong with this program. If not, see <http://www.gnu.org/licenses/>.\n \\brief\t\tConfiguration File of Valiant's UC Constructions\n */\n\n#ifndef VALIANTUC_CONFIG_H_H\n#define VALIANTUC_CONFIG_H_H\n\n#define TIME // measure time for building UC\n#define STATE // prints out the current state\n//#define CIRCUIT_DEBUG // prints out debug information of the circuit\n#define DEBUG_GRAPH //HAS TO BE UNDEFINED WHEN MEASURING PERFORMANCE!!! Prints out the graphvizz graphs\n#define DEBUG_CORRECTNESS // run some corrctness checks\n\n#define SHDL_CIRCUIT_FILE_FORMAT (\"\")\n#define SHDL_MOD_CIRCUIT_FILE_FORMAT (\"_Mod_SHDL.circuit\")\n#define CIRCUIT_FILE_FORMAT (\"_circ.txt\")\n#define PROGRAMMING_FILE_FORMAT (\"_prog.txt\")\n#define CIRCUIT_DIRECTORY (\"circuits/\")\n#define OUTPUT_DIRECTORY (\"output/\")\n\n#endif //VALIANTUC_CONFIG_H_H\n"},"authors":{"kind":"list like","value":["guenther@rangar.de"],"string":"[\n \"guenther@rangar.de\"\n]","isConversational":false},"author_id":{"kind":"string","value":"guenther@rangar.de"}}},{"rowIdx":971180,"cells":{"blob_id":{"kind":"string","value":"81344859a5409768789f8639318eb7692741337f"},"directory_id":{"kind":"string","value":"45a26f28a29ab6dd9d3bcf315117d814f50808b1"},"path":{"kind":"string","value":"/src/AppleOnboardAudio/AppleOnboardAudio-211.3.2/AppleLegacyAudio/AudioHardwareUtilities.h"},"content_id":{"kind":"string","value":"ea1df72a2ce4f356d8a0846f007e94f67ab0b87f"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"zeborrego/opensource.apple.com"},"snapshot_id":{"kind":"string","value":"0eb9161029ce8440dbdc4b5157b3927a6e381f8d"},"revision_id":{"kind":"string","value":"88cbaab4a42e97cbbfe6b660f2f0945536821be6"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2021-07-06T17:16:28.241638","string":"2021-07-06T17:16:28.241638"},"revision_date":{"kind":"timestamp","value":"2017-10-02T11:58:56","string":"2017-10-02T11:58:56"},"committer_date":{"kind":"timestamp","value":"2017-10-02T11:58:56","string":"2017-10-02T11:58:56"},"github_id":{"kind":"null"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":7537,"string":"7,537"},"extension":{"kind":"string","value":"h"},"content":{"kind":"string","value":"/*\n * AudioHardwareUtilities.h\n * Project : Apple02Audio\n *\n * Copyright (c) 1998-2000 Apple Computer, Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n * \n * Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved.\n * \n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n * \n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n * \n * @APPLE_LICENSE_HEADER_END@\n * \n * A series of macros used in the Apple02Audio code in order to simplify\n * reading.\n *\n */\n\n\n#ifndef __AUDIOHARDWAREUTILITIES__\n#define __AUDIOHARDWAREUTILITIES__\n\n//#define\tLOG_FAIL\n#ifdef DEBUG\n#ifndef LOG_FAIL\n#define\tLOG_FAIL\n#endif\n#endif\n\n#define\tkDebugIOSleepDelay\t\t20\n// Debugging help\n#ifdef DEBUGLOG\n// #define IOSleep(x) ;\n#define debugIOLog( message ) \\\n\t{IOLog( message ); IOSleep(kDebugIOSleepDelay);}\n#define debug2IOLog( message, arg2 ) \\\n\t{IOLog( message, arg2 ); IOSleep(kDebugIOSleepDelay);}\n#define debug3IOLog( message, arg2, arg3 ) \\\n\t{IOLog( message, arg2, arg3 ); IOSleep(kDebugIOSleepDelay);}\n#define debug4IOLog( message, arg2, arg3, arg4 ) \\\n\t{IOLog( message, arg2, arg3, arg4 ); IOSleep(kDebugIOSleepDelay);}\n#define debug5IOLog( message, arg2, arg3, arg4, arg5 ) \\\n\t{IOLog( message, arg2, arg3, arg4, arg5 ); IOSleep(kDebugIOSleepDelay);}\n#define debug6IOLog( message, arg2, arg3, arg4, arg5, arg6 ) \\\n\t{IOLog( message, arg2, arg3, arg4, arg5, arg6 ); IOSleep(kDebugIOSleepDelay);}\n#define debug7IOLog( message, arg2, arg3, arg4, arg5, arg6, arg7 ) \\\n\t{IOLog( message, arg2, arg3, arg4, arg5, arg6, arg7 ); IOSleep(kDebugIOSleepDelay);}\n#define debug8IOLog( message, arg2, arg3, arg4, arg5, arg6, arg7, arg8 ) \\\n\t{IOLog( message, arg2, arg3, arg4, arg5, arg6, arg7, arg8 ); IOSleep(kDebugIOSleepDelay);}\n#define debug9IOLog( message, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 ) \\\n {IOLog( message, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 ); IOSleep(kDebugIOSleepDelay);}\n#else\n#define debugIOLog( message ) ;\n#define debug2IOLog( message, arg2 ) ;\n#define debug3IOLog( message, arg2, arg3 ) ;\n#define debug4IOLog( message, arg2, arg3, arg4 ) ;\n#define debug5IOLog( message, arg2, arg3, arg4, arg5 ) ;\n#define debug6IOLog( message, arg2, arg3, arg4, arg5, arg6 ) ;\n#define debug7IOLog( message, arg2, arg3, arg4, arg5, arg6, arg7 ) ;\n#define debug8IOLog( message, arg2, arg3, arg4, arg5, arg6, arg7, arg8 ) ;\n#define debug9IOLog( message, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 ) ;\n#endif\n\n\n#ifdef DEBUGLOG\n#define debugIrqIOLog( message ) \\\n\t{IOLog( message );}\n#define debug2IrqIOLog( message, arg2 ) \\\n\t{IOLog( message, arg2 );}\n#define debug3IrqIOLog( message, arg2, arg3 ) \\\n\t{IOLog( message, arg2, arg3 );}\n#define debug4IrqIOLog( message, arg2, arg3, arg4 ) \\\n\t{IOLog( message, arg2, arg3, arg4 );}\n#define debug5IrqIOLog( message, arg2, arg3, arg4, arg5 ) \\\n\t{IOLog( message, arg2, arg3, arg4, arg5 );}\n#define debug6IrqIOLog( message, arg2, arg3, arg4, arg5, arg6 ) \\\n\t{IOLog( message, arg2, arg3, arg4, arg5, arg6 );}\n#define debug7IrqIOLog( message, arg2, arg3, arg4, arg5, arg6, arg7 ) \\\n\t{IOLog( message, arg2, arg3, arg4, arg5, arg6, arg7 );}\n#define debug8IrqIOLog( message, arg2, arg3, arg4, arg5, arg6, arg7, arg8 ) \\\n\t{IOLog( message, arg2, arg3, arg4, arg5, arg6, arg7, arg8 );}\n#define debug9IrqIOLog( message, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 ) \\\n {IOLog( message, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 );}\n#else\n#define debugIrqIOLog( message ) ;\n#define debug2IrqIOLog( message, arg2 ) ;\n#define debug3IrqIOLog( message, arg2, arg3 ) ;\n#define debug4IrqIOLog( message, arg2, arg3, arg4 ) ;\n#define debug5IrqIOLog( message, arg2, arg3, arg4, arg5 ) ;\n#define debug6IrqIOLog( message, arg2, arg3, arg4, arg5, arg6 ) ;\n#define debug7IrqIOLog( message, arg2, arg3, arg4, arg5, arg6, arg7 ) ;\n#define debug8IrqIOLog( message, arg2, arg3, arg4, arg5, arg6, arg7, arg8 ) ;\n#define debug9IrqIOLog( message, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 ) ;\n#endif\n\n#define DEBUG_IOLOG debugIOLog\n#define DEBUG2_IOLOG debug2IOLog\n#define DEBUG3_IOLOG debug3IOLog\n\n\n#ifdef DEBUGLOG \n #define CLOG( stuff ) IOLog( stuff )\n#else \n #define CLOG( stuff ) ; \n#endif\n\n// Bytes parsing\n#define NEXTENDOFSTRING(bytes, idx) while('\\0' != bytes[idx]) idx++;\n#define ASSIGNSTARTSTRING(startidx, parser) startidx = ++parser;\n#define ASSIGNSTOPSTRING(stopidx, parser) stopidx = parser+1;\n#define NEXTENDOFWORD(bytes, idx, size) while(' ' != bytes[idx] && idx <= size) idx++;\n#define ASSIGNNEXTWORD(bytes, startidx, stopidx) do {stopidx++; startidx = stopidx;}\\\n while((bytes[stopidx -1] == ' ') && (bytes[stopidx] == ' '))\n#define READWORDASNUMBER(result, bytesPtr, startidx, stopidx) \\\n {char temp[stopidx-startidx+1];memcpy(temp, bytesPtr+startidx, stopidx-startidx);temp[stopidx-startidx] = 0; result = getStringAsNumber(temp);};\n\n// Macros definitions\n#define CLEAN_RELEASE(thingPtr) if(thingPtr) {thingPtr->release(); thingPtr=NULL;}\n\n//\t-----------------------------------------------------------------\n#define SoundAssertionMessage( cond, file, line, handler ) \\\n \"Sound assertion \\\"\" #cond \"\\\" failed in \" #file \" at line \" #line \" goto \" #handler \"\\n\"\n\n#define SoundAssertionFailed( cond, file, line, handler ) \\\n IOLog( SoundAssertionMessage( cond, file, line, handler ));\n\n//\t-----------------------------------------------------------------\n#ifdef LOG_FAIL\n#define\tFailIf( cond, handler )\t\t\t\t\t\t\t\t\t\t\\\n if( cond ){\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n SoundAssertionFailed( cond, __FILE__, __LINE__, handler )\t\\\n goto handler; \t\t\t\t\t\t\t\t\t\t\t\t\\\n }\n#else\n#define\tFailIf( cond, handler )\t\t\t\t\t\t\t\t\t\t\\\n if( cond ){\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n goto handler; \t\t\t\t\t\t\t\t\t\t\t\t\\\n }\n#endif\n\n#ifdef LOG_FAIL\n#define\tFAIL_IF( cond, handler )\t\t\t\t\t\t\t\t\t\t\\\n if( cond ){\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n SoundAssertionFailed( cond, __FILE__, __LINE__, handler )\t\\\n goto handler; \t\t\t\t\t\t\t\t\t\t\t\t\\\n }\n#else\n#define\tFAIL_IF( cond, handler )\t\t\t\t\t\t\t\t\t\t\\\n if( cond ){\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n goto handler; \t\t\t\t\t\t\t\t\t\t\t\t\\\n }\n#endif\n\n\n//\t-----------------------------------------------------------------\n#ifdef LOG_FAIL\n#define\tFailWithAction( cond, action, handler )\t\t\t\t\t\t\\\n if( cond ){\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n SoundAssertionFailed( cond, __FILE__, __LINE__, handler )\t\\\n { action; }\t\t\t\t\t\t\t\t\t\t\t\t\\\n goto handler; \t\t\t\t\t\t\t\t\t\t\t\t\\\n }\n#else\n#define\tFailWithAction( cond, action, handler )\t\t\t\t\t\t\\\n if( cond ){\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n { action; }\t\t\t\t\t\t\t\t\t\t\t\t\\\n goto handler; \t\t\t\t\t\t\t\t\t\t\t\t\\\n }\n#endif\n\n//\t-----------------------------------------------------------------\n#ifdef LOG_FAIL\n#define FailMessage(cond)\t\tif (cond) SoundAssertionFailed(cond, __FILE__, __LINE__, handler)\n#else\n#define FailMessage(cond)\t\t{}\n#endif\n\n#endif //__AUDIOHARDWAREUTILITIES__\n"},"authors":{"kind":"list like","value":["mattl@cnuk.org"],"string":"[\n \"mattl@cnuk.org\"\n]","isConversational":false},"author_id":{"kind":"string","value":"mattl@cnuk.org"}}},{"rowIdx":971181,"cells":{"blob_id":{"kind":"string","value":"f1ad15e3393d756073d4b5fbd3f1355b2cd60d32"},"directory_id":{"kind":"string","value":"e51c55c9a627aa6d7fbed5b8005750ecdd7b053f"},"path":{"kind":"string","value":"/outros/Acepic28_Exemplos_PIC16_PIc18/PIC16F876A/USART/usart.c"},"content_id":{"kind":"string","value":"cb1289a1e50c167e11e8c4abc517d99a2265c97d"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"wavelee/microchip"},"snapshot_id":{"kind":"string","value":"9623701a1450b2a528dda310fc13383d5b644b5d"},"revision_id":{"kind":"string","value":"ddaf12a920f3ec8807cc2c8bd2cd6174bb82ba0b"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2020-12-26T04:04:24.463655","string":"2020-12-26T04:04:24.463655"},"revision_date":{"kind":"timestamp","value":"2014-04-05T19:59:42","string":"2014-04-05T19:59:42"},"committer_date":{"kind":"timestamp","value":"2014-04-05T19:59:42","string":"2014-04-05T19:59:42"},"github_id":{"kind":"null"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"ISO-8859-1"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":2464,"string":"2,464"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"//******************************************************************************\r\n//Kit de desenvolvimento ACEPIC 18\r\n//Projeto: Usart.c\r\n//Descrição: recebe um caracter pela serial e o envia novamente\r\n//Desenvolvimento: Eng.: Carlos Eduardo Sandrini Luz\r\n// ACEPIC Tecnologia e Treinamento LTDA\r\n//\r\n//Obs.: Colocar em ON a chaves 8 (LED) do DIP1\r\n// e chaves 7 (RA6-OSC1) e 8 (RA7-OSC2) do DIP2\r\n//******************************************************************************\r\n#include <16F876A.h>\r\n#use delay(clock=8000000)\r\n#fuses HS,NOWDT,PUT,NOBROWNOUT,NOLVP\r\n//Definições para a comunicação serial\r\n#use RS232 (Baud=4800, xmit = PIN_C6, rcv = PIN_C7)\r\n\r\nchar dado[10]; //matriz que receberá os caracteres \r\nint i; //variável de controle de índice para a matriz dado\r\n\r\nvoid main() \r\n{\r\nOutput_B(0x00); //Limpa toda a porta D\r\n\r\nfor (i=0;i<10;i++) dado[i] = 0; //Limpa todos os índices da matriz dado\r\n\r\ni = 0; //zera a variável i\r\n\r\n//Envia a string pela serial e muda o cursor para a próxima linha\r\nprintf(\"Microcontroladores PIC 16F887.\\r\\n\");\r\n\r\n//Envia a string pela serial e muda o cursor para a próxima linha\r\nprintf(\"LD1 - ACENDE L1.\\r\\n\");\r\n\r\n//Envia a string pela serial e muda o cursor para a próxima linha\r\nprintf(\"DL1 - APAGA L1.\\r\\n\");\r\n\r\nwhile(true)\r\n {\r\n dado[i] = getc(); /*Recebe um caractere de cada vez e armazena em dado \r\n com a posição i*/ \r\n\r\n printf(\"%c\",dado[i]); //envia novamente o caractere recebido\r\n \r\n if (dado[i] == 0x0D) //Se o caractere 0x0D (CR) for recebido\r\n {\r\n //Se a string contida na matriz dado = LD1\r\n if (dado[0] == 'L' && dado[1] == 'D' && dado[2] == '1')\r\n Output_Bit(PIN_B0,1); //Acende o LED L1\r\n \r\n //Se a string contida na matriz dado = DL1\r\n if (dado[0] == 'D' && dado[1] == 'L' && dado[2] == '1')\r\n Output_Bit(PIN_B0,0); //Apaga o LED L1\r\n \r\n for (i=0;i<10;i++) dado[i] = 0; //Limpa toda a matriz\r\n i=0; //retorna a variável i a 0 \r\n }\r\n else i++ ; /*Se o caractere recebido for diferente de 0x0d\r\n incrementa a variável i;*/ \r\n } \r\n}\r\n"},"authors":{"kind":"list like","value":["roneymonte@gmail.com"],"string":"[\n \"roneymonte@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"roneymonte@gmail.com"}}},{"rowIdx":971182,"cells":{"blob_id":{"kind":"string","value":"045995a5bf99b3deca8fca5879001f5a5f276693"},"directory_id":{"kind":"string","value":"a088d71ac58ef1f7dccd88e1d8eece6fe7cfde70"},"path":{"kind":"string","value":"/src/autocode/int3c2e.c"},"content_id":{"kind":"string","value":"dbd98271a0c5ee50a3ebfd722c44755f12e4c2ec"},"detected_licenses":{"kind":"list like","value":["GPL-1.0-or-later","GPL-3.0-only","BSD-2-Clause"],"string":"[\n \"GPL-1.0-or-later\",\n \"GPL-3.0-only\",\n \"BSD-2-Clause\"\n]","isConversational":false},"license_type":{"kind":"string","value":"permissive"},"repo_name":{"kind":"string","value":"pyscf/libcint"},"snapshot_id":{"kind":"string","value":"46eeeea08e386ea6271df886d9440526b3cdf1ec"},"revision_id":{"kind":"string","value":"544042e5798480dfac0e4309b51a2aefb3f5ca76"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2020-04-08T07:44:27.224312","string":"2020-04-08T07:44:27.224312"},"revision_date":{"kind":"timestamp","value":"2019-04-13T15:02:34","string":"2019-04-13T15:02:34"},"committer_date":{"kind":"timestamp","value":"2019-04-13T15:02:34","string":"2019-04-13T15:02:34"},"github_id":{"kind":"number","value":159149733,"string":"159,149,733"},"star_events_count":{"kind":"number","value":1,"string":"1"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"string","value":"BSD-2-Clause"},"gha_event_created_at":{"kind":"timestamp","value":"2019-04-13T15:02:35","string":"2019-04-13T15:02:35"},"gha_created_at":{"kind":"timestamp","value":"2018-11-26T10:14:50","string":"2018-11-26T10:14:50"},"gha_language":{"kind":"string","value":"C"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":52773,"string":"52,773"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"/*\n * Copyright (C) 2013- Qiming Sun <osirpt.sun@gmail.com>\n * Description: code generated by gen-code.cl\n */\n#include <stdlib.h>\n#include \"cint_bas.h\"\n#include \"cart2sph.h\"\n#include \"g1e.h\"\n#include \"g2e.h\"\n#include \"optimizer.h\"\n#include \"cint1e.h\"\n#include \"cint2e.h\"\n#include \"misc.h\"\n#include \"c2f.h\"\n/* (NABLA i j|R12 |k) */\nvoid CINTgout2e_int3c2e_ip1(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\nG2E_D_I(g1, g0, envs->i_l+0, envs->j_l, envs->k_l, 0);\ndouble s[3];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nswitch (nrys_roots) {\ncase 1:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0];\nbreak;\ncase 2:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1];\nbreak;\ncase 3:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1]+ g1[ix+2]*g0[iy+2]*g0[iz+2];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1]+ g0[ix+2]*g1[iy+2]*g0[iz+2];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1]+ g0[ix+2]*g0[iy+2]*g1[iz+2];\nbreak;\ncase 4:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1]+ g1[ix+2]*g0[iy+2]*g0[iz+2]+ g1[ix+3]*g0[iy+3]*g0[iz+3];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1]+ g0[ix+2]*g1[iy+2]*g0[iz+2]+ g0[ix+3]*g1[iy+3]*g0[iz+3];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1]+ g0[ix+2]*g0[iy+2]*g1[iz+2]+ g0[ix+3]*g0[iy+3]*g1[iz+3];\nbreak;\ndefault:\nfor (i = 0; i < 3; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g1[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g0[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g0[ix+i] * g0[iy+i] * g1[iz+i];\n} break;}\nif (gout_empty) {\ngout[n*3+0] = + s[0];\ngout[n*3+1] = + s[1];\ngout[n*3+2] = + s[2];\n} else {\ngout[n*3+0] += + s[0];\ngout[n*3+1] += + s[1];\ngout[n*3+2] += + s[2];\n}}}\nvoid int3c2e_ip1_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {1, 0, 0, 0, 1, 1, 1, 3};\nCINTall_3c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int3c2e_ip1_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 0, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ip1;\nreturn CINT3c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int3c2e_ip1_cart\nint int3c2e_ip1_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 0, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ip1;\nreturn CINT3c2e_spheric_drv(out, dims, &envs, opt, cache, &c2s_sph_3c2e1, 0);\n} // int3c2e_ip1_sph\nint int3c2e_ip1_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 0, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ip1;\nreturn CINT3c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_sf_3c2e1, 0);\n} // int3c2e_ip1_spinor\nALL_CINT(int3c2e_ip1)\nALL_CINT_FORTRAN_(int3c2e_ip1)\n/* (i j|R12 |NABLA k) */\nvoid CINTgout2e_int3c2e_ip2(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\nG2E_D_K(g1, g0, envs->i_l+0, envs->j_l+0, envs->k_l+0, 0);\ndouble s[3];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nswitch (nrys_roots) {\ncase 1:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0];\nbreak;\ncase 2:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1];\nbreak;\ncase 3:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1]+ g1[ix+2]*g0[iy+2]*g0[iz+2];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1]+ g0[ix+2]*g1[iy+2]*g0[iz+2];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1]+ g0[ix+2]*g0[iy+2]*g1[iz+2];\nbreak;\ncase 4:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1]+ g1[ix+2]*g0[iy+2]*g0[iz+2]+ g1[ix+3]*g0[iy+3]*g0[iz+3];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1]+ g0[ix+2]*g1[iy+2]*g0[iz+2]+ g0[ix+3]*g1[iy+3]*g0[iz+3];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1]+ g0[ix+2]*g0[iy+2]*g1[iz+2]+ g0[ix+3]*g0[iy+3]*g1[iz+3];\nbreak;\ndefault:\nfor (i = 0; i < 3; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g1[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g0[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g0[ix+i] * g0[iy+i] * g1[iz+i];\n} break;}\nif (gout_empty) {\ngout[n*3+0] = + s[0];\ngout[n*3+1] = + s[1];\ngout[n*3+2] = + s[2];\n} else {\ngout[n*3+0] += + s[0];\ngout[n*3+1] += + s[1];\ngout[n*3+2] += + s[2];\n}}}\nvoid int3c2e_ip2_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {0, 0, 1, 0, 1, 1, 1, 3};\nCINTall_3c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int3c2e_ip2_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {0, 0, 1, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ip2;\nreturn CINT3c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int3c2e_ip2_cart\nint int3c2e_ip2_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {0, 0, 1, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ip2;\nreturn CINT3c2e_spheric_drv(out, dims, &envs, opt, cache, &c2s_sph_3c2e1, 0);\n} // int3c2e_ip2_sph\nint int3c2e_ip2_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {0, 0, 1, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ip2;\nreturn CINT3c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_sf_3c2e1, 0);\n} // int3c2e_ip2_spinor\nALL_CINT(int3c2e_ip2)\nALL_CINT_FORTRAN_(int3c2e_ip2)\n/* (P* i DOT P j|R12 |k) */\nvoid CINTgout2e_int3c2e_pvp1(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\ndouble *g2 = g1 + envs->g_size * 3;\ndouble *g3 = g2 + envs->g_size * 3;\nG2E_D_J(g1, g0, envs->i_l+1, envs->j_l+0, envs->k_l, 0);\nG2E_D_I(g2, g0, envs->i_l+0, envs->j_l, envs->k_l, 0);\nG2E_D_I(g3, g1, envs->i_l+0, envs->j_l, envs->k_l, 0);\ndouble s[9];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nfor (i = 0; i < 9; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g3[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g2[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g2[ix+i] * g0[iy+i] * g1[iz+i];\ns[3] += g1[ix+i] * g2[iy+i] * g0[iz+i];\ns[4] += g0[ix+i] * g3[iy+i] * g0[iz+i];\ns[5] += g0[ix+i] * g2[iy+i] * g1[iz+i];\ns[6] += g1[ix+i] * g0[iy+i] * g2[iz+i];\ns[7] += g0[ix+i] * g1[iy+i] * g2[iz+i];\ns[8] += g0[ix+i] * g0[iy+i] * g3[iz+i];\n}\nif (gout_empty) {\ngout[n*1+0] = + s[0] + s[4] + s[8];\n} else {\ngout[n*1+0] += + s[0] + s[4] + s[8];\n}}}\nvoid int3c2e_pvp1_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {1, 1, 0, 0, 2, 1, 1, 1};\nCINTall_3c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int3c2e_pvp1_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 0, 0, 2, 1, 1, 1};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_pvp1;\nreturn CINT3c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int3c2e_pvp1_cart\nint int3c2e_pvp1_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 0, 0, 2, 1, 1, 1};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_pvp1;\nreturn CINT3c2e_spheric_drv(out, dims, &envs, opt, cache, &c2s_sph_3c2e1, 0);\n} // int3c2e_pvp1_sph\nint int3c2e_pvp1_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 0, 0, 2, 1, 1, 1};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_pvp1;\nreturn CINT3c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_sf_3c2e1, 0);\n} // int3c2e_pvp1_spinor\nALL_CINT(int3c2e_pvp1)\nALL_CINT_FORTRAN_(int3c2e_pvp1)\n/* (P* i CROSS P j|R12 |k) */\nvoid CINTgout2e_int3c2e_pvxp1(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\ndouble *g2 = g1 + envs->g_size * 3;\ndouble *g3 = g2 + envs->g_size * 3;\nG2E_D_J(g1, g0, envs->i_l+1, envs->j_l+0, envs->k_l, 0);\nG2E_D_I(g2, g0, envs->i_l+0, envs->j_l, envs->k_l, 0);\nG2E_D_I(g3, g1, envs->i_l+0, envs->j_l, envs->k_l, 0);\ndouble s[9];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nfor (i = 0; i < 9; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g3[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g2[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g2[ix+i] * g0[iy+i] * g1[iz+i];\ns[3] += g1[ix+i] * g2[iy+i] * g0[iz+i];\ns[4] += g0[ix+i] * g3[iy+i] * g0[iz+i];\ns[5] += g0[ix+i] * g2[iy+i] * g1[iz+i];\ns[6] += g1[ix+i] * g0[iy+i] * g2[iz+i];\ns[7] += g0[ix+i] * g1[iy+i] * g2[iz+i];\ns[8] += g0[ix+i] * g0[iy+i] * g3[iz+i];\n}\nif (gout_empty) {\ngout[n*3+0] = + s[5] - s[7];\ngout[n*3+1] = + s[6] - s[2];\ngout[n*3+2] = + s[1] - s[3];\n} else {\ngout[n*3+0] += + s[5] - s[7];\ngout[n*3+1] += + s[6] - s[2];\ngout[n*3+2] += + s[1] - s[3];\n}}}\nvoid int3c2e_pvxp1_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {1, 1, 0, 0, 2, 1, 1, 3};\nCINTall_3c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int3c2e_pvxp1_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 0, 0, 2, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_pvxp1;\nreturn CINT3c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int3c2e_pvxp1_cart\nint int3c2e_pvxp1_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 0, 0, 2, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_pvxp1;\nreturn CINT3c2e_spheric_drv(out, dims, &envs, opt, cache, &c2s_sph_3c2e1, 0);\n} // int3c2e_pvxp1_sph\nint int3c2e_pvxp1_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 0, 0, 2, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_pvxp1;\nreturn CINT3c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_sf_3c2e1, 0);\n} // int3c2e_pvxp1_spinor\nALL_CINT(int3c2e_pvxp1)\nALL_CINT_FORTRAN_(int3c2e_pvxp1)\n/* (NABLA i |R12 |j) */\nstatic void CINTgout2e_int2c2e_ip1(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\nG2E_D_I(g1, g0, envs->i_l+0, 0, envs->k_l, 0);\ndouble s[3];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nswitch (nrys_roots) {\ncase 1:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0];\nbreak;\ncase 2:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1];\nbreak;\ncase 3:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1]+ g1[ix+2]*g0[iy+2]*g0[iz+2];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1]+ g0[ix+2]*g1[iy+2]*g0[iz+2];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1]+ g0[ix+2]*g0[iy+2]*g1[iz+2];\nbreak;\ncase 4:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1]+ g1[ix+2]*g0[iy+2]*g0[iz+2]+ g1[ix+3]*g0[iy+3]*g0[iz+3];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1]+ g0[ix+2]*g1[iy+2]*g0[iz+2]+ g0[ix+3]*g1[iy+3]*g0[iz+3];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1]+ g0[ix+2]*g0[iy+2]*g1[iz+2]+ g0[ix+3]*g0[iy+3]*g1[iz+3];\nbreak;\ndefault:\nfor (i = 0; i < 3; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g1[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g0[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g0[ix+i] * g0[iy+i] * g1[iz+i];\n} break;}\nif (gout_empty) {\ngout[n*3+0] = + s[0];\ngout[n*3+1] = + s[1];\ngout[n*3+2] = + s[2];\n} else {\ngout[n*3+0] += + s[0];\ngout[n*3+1] += + s[1];\ngout[n*3+2] += + s[2];\n}}}\nvoid int2c2e_ip1_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {1, 0, 0, 0, 1, 1, 1, 3};\nCINTall_2c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int2c2e_ip1_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 0, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int2c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int2c2e_ip1;\nreturn CINT2c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int2c2e_ip1_cart\nint int2c2e_ip1_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 0, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int2c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int2c2e_ip1;\nreturn CINT2c2e_spheric_drv(out, dims, &envs, opt, cache);\n} // int2c2e_ip1_sph\nint int2c2e_ip1_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 0, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int2c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int2c2e_ip1;\nreturn CINT2c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_sf_1e);\n} // int2c2e_ip1_spinor\nALL_CINT(int2c2e_ip1)\nALL_CINT_FORTRAN_(int2c2e_ip1)\n/* (i |R12 |NABLA j) */\nstatic void CINTgout2e_int2c2e_ip2(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\nG2E_D_K(g1, g0, envs->i_l+0, 0, envs->k_l+0, 0);\ndouble s[3];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nswitch (nrys_roots) {\ncase 1:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0];\nbreak;\ncase 2:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1];\nbreak;\ncase 3:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1]+ g1[ix+2]*g0[iy+2]*g0[iz+2];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1]+ g0[ix+2]*g1[iy+2]*g0[iz+2];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1]+ g0[ix+2]*g0[iy+2]*g1[iz+2];\nbreak;\ncase 4:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1]+ g1[ix+2]*g0[iy+2]*g0[iz+2]+ g1[ix+3]*g0[iy+3]*g0[iz+3];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1]+ g0[ix+2]*g1[iy+2]*g0[iz+2]+ g0[ix+3]*g1[iy+3]*g0[iz+3];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1]+ g0[ix+2]*g0[iy+2]*g1[iz+2]+ g0[ix+3]*g0[iy+3]*g1[iz+3];\nbreak;\ndefault:\nfor (i = 0; i < 3; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g1[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g0[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g0[ix+i] * g0[iy+i] * g1[iz+i];\n} break;}\nif (gout_empty) {\ngout[n*3+0] = + s[0];\ngout[n*3+1] = + s[1];\ngout[n*3+2] = + s[2];\n} else {\ngout[n*3+0] += + s[0];\ngout[n*3+1] += + s[1];\ngout[n*3+2] += + s[2];\n}}}\nvoid int2c2e_ip2_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {0, 0, 1, 0, 1, 1, 1, 3};\nCINTall_2c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int2c2e_ip2_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {0, 0, 1, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int2c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int2c2e_ip2;\nreturn CINT2c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int2c2e_ip2_cart\nint int2c2e_ip2_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {0, 0, 1, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int2c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int2c2e_ip2;\nreturn CINT2c2e_spheric_drv(out, dims, &envs, opt, cache);\n} // int2c2e_ip2_sph\nint int2c2e_ip2_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {0, 0, 1, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int2c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int2c2e_ip2;\nreturn CINT2c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_sf_1e);\n} // int2c2e_ip2_spinor\nALL_CINT(int2c2e_ip2)\nALL_CINT_FORTRAN_(int2c2e_ip2)\n/* (G i j|R12 |k) */\nvoid CINTgout2e_int3c2e_ig1(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\ndouble rirj[3], c[3];\nrirj[0] = envs->ri[0] - envs->rj[0];\nrirj[1] = envs->ri[1] - envs->rj[1];\nrirj[2] = envs->ri[2] - envs->rj[2];\nc[0] = 1 * rirj[0];\nc[1] = 1 * rirj[1];\nc[2] = 1 * rirj[2];\nG2E_R0I(g1, g0, envs->i_l+0, envs->j_l, envs->k_l, 0);\ndouble s[3];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nswitch (nrys_roots) {\ncase 1:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0];\nbreak;\ncase 2:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1];\nbreak;\ncase 3:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1]+ g1[ix+2]*g0[iy+2]*g0[iz+2];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1]+ g0[ix+2]*g1[iy+2]*g0[iz+2];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1]+ g0[ix+2]*g0[iy+2]*g1[iz+2];\nbreak;\ncase 4:\ns[0] = + g1[ix+0]*g0[iy+0]*g0[iz+0]+ g1[ix+1]*g0[iy+1]*g0[iz+1]+ g1[ix+2]*g0[iy+2]*g0[iz+2]+ g1[ix+3]*g0[iy+3]*g0[iz+3];\ns[1] = + g0[ix+0]*g1[iy+0]*g0[iz+0]+ g0[ix+1]*g1[iy+1]*g0[iz+1]+ g0[ix+2]*g1[iy+2]*g0[iz+2]+ g0[ix+3]*g1[iy+3]*g0[iz+3];\ns[2] = + g0[ix+0]*g0[iy+0]*g1[iz+0]+ g0[ix+1]*g0[iy+1]*g1[iz+1]+ g0[ix+2]*g0[iy+2]*g1[iz+2]+ g0[ix+3]*g0[iy+3]*g1[iz+3];\nbreak;\ndefault:\nfor (i = 0; i < 3; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g1[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g0[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g0[ix+i] * g0[iy+i] * g1[iz+i];\n} break;}\nif (gout_empty) {\ngout[n*3+0] = - c[1]*s[2] + c[2]*s[1];\ngout[n*3+1] = - c[2]*s[0] + c[0]*s[2];\ngout[n*3+2] = - c[0]*s[1] + c[1]*s[0];\n} else {\ngout[n*3+0] += - c[1]*s[2] + c[2]*s[1];\ngout[n*3+1] += - c[2]*s[0] + c[0]*s[2];\ngout[n*3+2] += - c[0]*s[1] + c[1]*s[0];\n}}}\nvoid int3c2e_ig1_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {1, 0, 0, 0, 1, 1, 1, 3};\nCINTall_3c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int3c2e_ig1_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 0, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ig1;\nenvs.common_factor *= 0.5;\nint i, nout;\nint counts[4];\nif (out != NULL && envs.shls[0] == envs.shls[1]) {\ncounts[0] = envs.nfi * envs.x_ctr[0];\ncounts[1] = envs.nfj * envs.x_ctr[1];\ncounts[2] = envs.nfk * envs.x_ctr[2];\ncounts[3] = 1;\nif (dims == NULL) { dims = counts; }\nnout = dims[0] * dims[1] * dims[2];\nfor (i = 0; i < envs.ncomp_e1 * envs.ncomp_e2 * envs.ncomp_tensor; i++) {\nc2s_dset0(out+nout*i, dims, counts); }\nreturn 0; }\nreturn CINT3c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int3c2e_ig1_cart\nint int3c2e_ig1_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 0, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ig1;\nenvs.common_factor *= 0.5;\nint i, nout;\nint counts[4];\nif (out != NULL && envs.shls[0] == envs.shls[1]) {\ncounts[0] = (envs.i_l*2+1) * envs.x_ctr[0];\ncounts[1] = (envs.j_l*2+1) * envs.x_ctr[1];\ncounts[2] = (envs.k_l*2+1) * envs.x_ctr[2];\ncounts[3] = 1;\nif (dims == NULL) { dims = counts; }\nnout = dims[0] * dims[1] * dims[2];\nfor (i = 0; i < envs.ncomp_e1 * envs.ncomp_e2 * envs.ncomp_tensor; i++) {\nc2s_dset0(out+nout*i, dims, counts); }\nreturn 0; }\nreturn CINT3c2e_spheric_drv(out, dims, &envs, opt, cache, &c2s_sph_3c2e1, 0);\n} // int3c2e_ig1_sph\nint int3c2e_ig1_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 0, 0, 1, 1, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ig1;\nenvs.common_factor *= 0.5;\nint i, nout;\nint counts[4];\nif (out != NULL && envs.shls[0] == envs.shls[1]) {\ncounts[0] = CINTcgto_spinor(envs.shls[0], envs.bas);\ncounts[1] = CINTcgto_spinor(envs.shls[1], envs.bas);\ncounts[2] = (envs.k_l*2+1) * envs.x_ctr[2];\ncounts[3] = 1;\nif (dims == NULL) { dims = counts; }\nnout = dims[0] * dims[1] * dims[2];\nfor (i = 0; i < envs.ncomp_tensor; i++) {\nc2s_zset0(out+nout*i, dims, counts); }\nreturn 0; }\nreturn CINT3c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_sf_3c2e1, 0);\n} // int3c2e_ig1_spinor\nALL_CINT(int3c2e_ig1)\nALL_CINT_FORTRAN_(int3c2e_ig1)\n/* (SIGMA DOT P i SIGMA DOT P j|R12 |k) */\nvoid CINTgout2e_int3c2e_spsp1(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\ndouble *g2 = g1 + envs->g_size * 3;\ndouble *g3 = g2 + envs->g_size * 3;\nG2E_D_J(g1, g0, envs->i_l+1, envs->j_l+0, envs->k_l, 0);\nG2E_D_I(g2, g0, envs->i_l+0, envs->j_l, envs->k_l, 0);\nG2E_D_I(g3, g1, envs->i_l+0, envs->j_l, envs->k_l, 0);\ndouble s[9];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nfor (i = 0; i < 9; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g3[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g2[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g2[ix+i] * g0[iy+i] * g1[iz+i];\ns[3] += g1[ix+i] * g2[iy+i] * g0[iz+i];\ns[4] += g0[ix+i] * g3[iy+i] * g0[iz+i];\ns[5] += g0[ix+i] * g2[iy+i] * g1[iz+i];\ns[6] += g1[ix+i] * g0[iy+i] * g2[iz+i];\ns[7] += g0[ix+i] * g1[iy+i] * g2[iz+i];\ns[8] += g0[ix+i] * g0[iy+i] * g3[iz+i];\n}\nif (gout_empty) {\ngout[n*4+0] = + s[5] - s[7];\ngout[n*4+1] = + s[6] - s[2];\ngout[n*4+2] = + s[1] - s[3];\ngout[n*4+3] = + s[0] + s[4] + s[8];\n} else {\ngout[n*4+0] += + s[5] - s[7];\ngout[n*4+1] += + s[6] - s[2];\ngout[n*4+2] += + s[1] - s[3];\ngout[n*4+3] += + s[0] + s[4] + s[8];\n}}}\nvoid int3c2e_spsp1_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {1, 1, 0, 0, 2, 4, 1, 1};\nCINTall_3c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int3c2e_spsp1_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 0, 0, 2, 4, 1, 1};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_spsp1;\nreturn CINT3c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int3c2e_spsp1_cart\nint int3c2e_spsp1_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 0, 0, 2, 4, 1, 1};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_spsp1;\nreturn CINT3c2e_spheric_drv(out, dims, &envs, opt, cache, &c2s_sph_3c2e1, 0);\n} // int3c2e_spsp1_sph\nint int3c2e_spsp1_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 0, 0, 2, 4, 1, 1};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_spsp1;\nreturn CINT3c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_si_3c2e1, 0);\n} // int3c2e_spsp1_spinor\nALL_CINT(int3c2e_spsp1)\nALL_CINT_FORTRAN_(int3c2e_spsp1)\n/* (NABLA SIGMA DOT P i SIGMA DOT P j|R12 |k) */\nvoid CINTgout2e_int3c2e_ipspsp1(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\ndouble *g2 = g1 + envs->g_size * 3;\ndouble *g3 = g2 + envs->g_size * 3;\ndouble *g4 = g3 + envs->g_size * 3;\ndouble *g5 = g4 + envs->g_size * 3;\ndouble *g6 = g5 + envs->g_size * 3;\ndouble *g7 = g6 + envs->g_size * 3;\nG2E_D_J(g1, g0, envs->i_l+2, envs->j_l+0, envs->k_l, 0);\nG2E_D_I(g2, g0, envs->i_l+1, envs->j_l, envs->k_l, 0);\nG2E_D_I(g3, g1, envs->i_l+1, envs->j_l, envs->k_l, 0);\nG2E_D_I(g4, g0, envs->i_l+0, envs->j_l, envs->k_l, 0);\nG2E_D_I(g5, g1, envs->i_l+0, envs->j_l, envs->k_l, 0);\nG2E_D_I(g6, g2, envs->i_l+0, envs->j_l, envs->k_l, 0);\nG2E_D_I(g7, g3, envs->i_l+0, envs->j_l, envs->k_l, 0);\ndouble s[27];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nfor (i = 0; i < 27; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g7[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g6[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g6[ix+i] * g0[iy+i] * g1[iz+i];\ns[3] += g5[ix+i] * g2[iy+i] * g0[iz+i];\ns[4] += g4[ix+i] * g3[iy+i] * g0[iz+i];\ns[5] += g4[ix+i] * g2[iy+i] * g1[iz+i];\ns[6] += g5[ix+i] * g0[iy+i] * g2[iz+i];\ns[7] += g4[ix+i] * g1[iy+i] * g2[iz+i];\ns[8] += g4[ix+i] * g0[iy+i] * g3[iz+i];\ns[9] += g3[ix+i] * g4[iy+i] * g0[iz+i];\ns[10] += g2[ix+i] * g5[iy+i] * g0[iz+i];\ns[11] += g2[ix+i] * g4[iy+i] * g1[iz+i];\ns[12] += g1[ix+i] * g6[iy+i] * g0[iz+i];\ns[13] += g0[ix+i] * g7[iy+i] * g0[iz+i];\ns[14] += g0[ix+i] * g6[iy+i] * g1[iz+i];\ns[15] += g1[ix+i] * g4[iy+i] * g2[iz+i];\ns[16] += g0[ix+i] * g5[iy+i] * g2[iz+i];\ns[17] += g0[ix+i] * g4[iy+i] * g3[iz+i];\ns[18] += g3[ix+i] * g0[iy+i] * g4[iz+i];\ns[19] += g2[ix+i] * g1[iy+i] * g4[iz+i];\ns[20] += g2[ix+i] * g0[iy+i] * g5[iz+i];\ns[21] += g1[ix+i] * g2[iy+i] * g4[iz+i];\ns[22] += g0[ix+i] * g3[iy+i] * g4[iz+i];\ns[23] += g0[ix+i] * g2[iy+i] * g5[iz+i];\ns[24] += g1[ix+i] * g0[iy+i] * g6[iz+i];\ns[25] += g0[ix+i] * g1[iy+i] * g6[iz+i];\ns[26] += g0[ix+i] * g0[iy+i] * g7[iz+i];\n}\nif (gout_empty) {\ngout[n*12+0] = + s[11] - s[19];\ngout[n*12+1] = + s[18] - s[2];\ngout[n*12+2] = + s[1] - s[9];\ngout[n*12+3] = + s[0] + s[10] + s[20];\ngout[n*12+4] = + s[14] - s[22];\ngout[n*12+5] = + s[21] - s[5];\ngout[n*12+6] = + s[4] - s[12];\ngout[n*12+7] = + s[3] + s[13] + s[23];\ngout[n*12+8] = + s[17] - s[25];\ngout[n*12+9] = + s[24] - s[8];\ngout[n*12+10] = + s[7] - s[15];\ngout[n*12+11] = + s[6] + s[16] + s[26];\n} else {\ngout[n*12+0] += + s[11] - s[19];\ngout[n*12+1] += + s[18] - s[2];\ngout[n*12+2] += + s[1] - s[9];\ngout[n*12+3] += + s[0] + s[10] + s[20];\ngout[n*12+4] += + s[14] - s[22];\ngout[n*12+5] += + s[21] - s[5];\ngout[n*12+6] += + s[4] - s[12];\ngout[n*12+7] += + s[3] + s[13] + s[23];\ngout[n*12+8] += + s[17] - s[25];\ngout[n*12+9] += + s[24] - s[8];\ngout[n*12+10] += + s[7] - s[15];\ngout[n*12+11] += + s[6] + s[16] + s[26];\n}}}\nvoid int3c2e_ipspsp1_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {2, 1, 0, 0, 3, 4, 1, 3};\nCINTall_3c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int3c2e_ipspsp1_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {2, 1, 0, 0, 3, 4, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ipspsp1;\nreturn CINT3c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int3c2e_ipspsp1_cart\nint int3c2e_ipspsp1_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {2, 1, 0, 0, 3, 4, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ipspsp1;\nreturn CINT3c2e_spheric_drv(out, dims, &envs, opt, cache, &c2s_sph_3c2e1, 0);\n} // int3c2e_ipspsp1_sph\nint int3c2e_ipspsp1_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {2, 1, 0, 0, 3, 4, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ipspsp1;\nreturn CINT3c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_si_3c2e1, 0);\n} // int3c2e_ipspsp1_spinor\nALL_CINT(int3c2e_ipspsp1)\nALL_CINT_FORTRAN_(int3c2e_ipspsp1)\n/* (SIGMA DOT P i SIGMA DOT P j|R12 |NABLA k) */\nvoid CINTgout2e_int3c2e_spsp1ip2(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\ndouble *g2 = g1 + envs->g_size * 3;\ndouble *g3 = g2 + envs->g_size * 3;\ndouble *g4 = g3 + envs->g_size * 3;\ndouble *g5 = g4 + envs->g_size * 3;\ndouble *g6 = g5 + envs->g_size * 3;\ndouble *g7 = g6 + envs->g_size * 3;\nG2E_D_K(g1, g0, envs->i_l+1, envs->j_l+1, envs->k_l+0, 0);\nG2E_D_J(g2, g0, envs->i_l+1, envs->j_l+0, envs->k_l, 0);\nG2E_D_J(g3, g1, envs->i_l+1, envs->j_l+0, envs->k_l, 0);\nG2E_D_I(g4, g0, envs->i_l+0, envs->j_l, envs->k_l, 0);\nG2E_D_I(g5, g1, envs->i_l+0, envs->j_l, envs->k_l, 0);\nG2E_D_I(g6, g2, envs->i_l+0, envs->j_l, envs->k_l, 0);\nG2E_D_I(g7, g3, envs->i_l+0, envs->j_l, envs->k_l, 0);\ndouble s[27];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nfor (i = 0; i < 27; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g7[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g6[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g6[ix+i] * g0[iy+i] * g1[iz+i];\ns[3] += g5[ix+i] * g2[iy+i] * g0[iz+i];\ns[4] += g4[ix+i] * g3[iy+i] * g0[iz+i];\ns[5] += g4[ix+i] * g2[iy+i] * g1[iz+i];\ns[6] += g5[ix+i] * g0[iy+i] * g2[iz+i];\ns[7] += g4[ix+i] * g1[iy+i] * g2[iz+i];\ns[8] += g4[ix+i] * g0[iy+i] * g3[iz+i];\ns[9] += g3[ix+i] * g4[iy+i] * g0[iz+i];\ns[10] += g2[ix+i] * g5[iy+i] * g0[iz+i];\ns[11] += g2[ix+i] * g4[iy+i] * g1[iz+i];\ns[12] += g1[ix+i] * g6[iy+i] * g0[iz+i];\ns[13] += g0[ix+i] * g7[iy+i] * g0[iz+i];\ns[14] += g0[ix+i] * g6[iy+i] * g1[iz+i];\ns[15] += g1[ix+i] * g4[iy+i] * g2[iz+i];\ns[16] += g0[ix+i] * g5[iy+i] * g2[iz+i];\ns[17] += g0[ix+i] * g4[iy+i] * g3[iz+i];\ns[18] += g3[ix+i] * g0[iy+i] * g4[iz+i];\ns[19] += g2[ix+i] * g1[iy+i] * g4[iz+i];\ns[20] += g2[ix+i] * g0[iy+i] * g5[iz+i];\ns[21] += g1[ix+i] * g2[iy+i] * g4[iz+i];\ns[22] += g0[ix+i] * g3[iy+i] * g4[iz+i];\ns[23] += g0[ix+i] * g2[iy+i] * g5[iz+i];\ns[24] += g1[ix+i] * g0[iy+i] * g6[iz+i];\ns[25] += g0[ix+i] * g1[iy+i] * g6[iz+i];\ns[26] += g0[ix+i] * g0[iy+i] * g7[iz+i];\n}\nif (gout_empty) {\ngout[n*12+0] = + s[15] - s[21];\ngout[n*12+1] = + s[18] - s[6];\ngout[n*12+2] = + s[3] - s[9];\ngout[n*12+3] = + s[0] + s[12] + s[24];\ngout[n*12+4] = + s[16] - s[22];\ngout[n*12+5] = + s[19] - s[7];\ngout[n*12+6] = + s[4] - s[10];\ngout[n*12+7] = + s[1] + s[13] + s[25];\ngout[n*12+8] = + s[17] - s[23];\ngout[n*12+9] = + s[20] - s[8];\ngout[n*12+10] = + s[5] - s[11];\ngout[n*12+11] = + s[2] + s[14] + s[26];\n} else {\ngout[n*12+0] += + s[15] - s[21];\ngout[n*12+1] += + s[18] - s[6];\ngout[n*12+2] += + s[3] - s[9];\ngout[n*12+3] += + s[0] + s[12] + s[24];\ngout[n*12+4] += + s[16] - s[22];\ngout[n*12+5] += + s[19] - s[7];\ngout[n*12+6] += + s[4] - s[10];\ngout[n*12+7] += + s[1] + s[13] + s[25];\ngout[n*12+8] += + s[17] - s[23];\ngout[n*12+9] += + s[20] - s[8];\ngout[n*12+10] += + s[5] - s[11];\ngout[n*12+11] += + s[2] + s[14] + s[26];\n}}}\nvoid int3c2e_spsp1ip2_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {1, 1, 1, 0, 3, 4, 1, 3};\nCINTall_3c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int3c2e_spsp1ip2_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 1, 0, 3, 4, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_spsp1ip2;\nreturn CINT3c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int3c2e_spsp1ip2_cart\nint int3c2e_spsp1ip2_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 1, 0, 3, 4, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_spsp1ip2;\nreturn CINT3c2e_spheric_drv(out, dims, &envs, opt, cache, &c2s_sph_3c2e1, 0);\n} // int3c2e_spsp1ip2_sph\nint int3c2e_spsp1ip2_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 1, 0, 3, 4, 1, 3};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_spsp1ip2;\nreturn CINT3c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_si_3c2e1, 0);\n} // int3c2e_spsp1ip2_spinor\nALL_CINT(int3c2e_spsp1ip2)\nALL_CINT_FORTRAN_(int3c2e_spsp1ip2)\n/* (NABLA NABLA i j|R12 |k) */\nvoid CINTgout2e_int3c2e_ipip1(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\ndouble *g2 = g1 + envs->g_size * 3;\ndouble *g3 = g2 + envs->g_size * 3;\nG2E_D_I(g1, g0, envs->i_l+1, envs->j_l, envs->k_l, 0);\nG2E_D_I(g2, g0, envs->i_l+0, envs->j_l, envs->k_l, 0);\nG2E_D_I(g3, g1, envs->i_l+0, envs->j_l, envs->k_l, 0);\ndouble s[9];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nfor (i = 0; i < 9; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g3[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g2[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g2[ix+i] * g0[iy+i] * g1[iz+i];\ns[3] += g1[ix+i] * g2[iy+i] * g0[iz+i];\ns[4] += g0[ix+i] * g3[iy+i] * g0[iz+i];\ns[5] += g0[ix+i] * g2[iy+i] * g1[iz+i];\ns[6] += g1[ix+i] * g0[iy+i] * g2[iz+i];\ns[7] += g0[ix+i] * g1[iy+i] * g2[iz+i];\ns[8] += g0[ix+i] * g0[iy+i] * g3[iz+i];\n}\nif (gout_empty) {\ngout[n*9+0] = + s[0];\ngout[n*9+1] = + s[3];\ngout[n*9+2] = + s[6];\ngout[n*9+3] = + s[1];\ngout[n*9+4] = + s[4];\ngout[n*9+5] = + s[7];\ngout[n*9+6] = + s[2];\ngout[n*9+7] = + s[5];\ngout[n*9+8] = + s[8];\n} else {\ngout[n*9+0] += + s[0];\ngout[n*9+1] += + s[3];\ngout[n*9+2] += + s[6];\ngout[n*9+3] += + s[1];\ngout[n*9+4] += + s[4];\ngout[n*9+5] += + s[7];\ngout[n*9+6] += + s[2];\ngout[n*9+7] += + s[5];\ngout[n*9+8] += + s[8];\n}}}\nvoid int3c2e_ipip1_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {2, 0, 0, 0, 2, 1, 1, 9};\nCINTall_3c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int3c2e_ipip1_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {2, 0, 0, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ipip1;\nreturn CINT3c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int3c2e_ipip1_cart\nint int3c2e_ipip1_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {2, 0, 0, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ipip1;\nreturn CINT3c2e_spheric_drv(out, dims, &envs, opt, cache, &c2s_sph_3c2e1, 0);\n} // int3c2e_ipip1_sph\nint int3c2e_ipip1_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {2, 0, 0, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ipip1;\nreturn CINT3c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_sf_3c2e1, 0);\n} // int3c2e_ipip1_spinor\nALL_CINT(int3c2e_ipip1)\nALL_CINT_FORTRAN_(int3c2e_ipip1)\n/* (i j|R12 |NABLA NABLA k) */\nvoid CINTgout2e_int3c2e_ipip2(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\ndouble *g2 = g1 + envs->g_size * 3;\ndouble *g3 = g2 + envs->g_size * 3;\nG2E_D_K(g1, g0, envs->i_l+0, envs->j_l+0, envs->k_l+1, 0);\nG2E_D_K(g2, g0, envs->i_l+0, envs->j_l+0, envs->k_l+0, 0);\nG2E_D_K(g3, g1, envs->i_l+0, envs->j_l+0, envs->k_l+0, 0);\ndouble s[9];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nfor (i = 0; i < 9; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g3[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g2[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g2[ix+i] * g0[iy+i] * g1[iz+i];\ns[3] += g1[ix+i] * g2[iy+i] * g0[iz+i];\ns[4] += g0[ix+i] * g3[iy+i] * g0[iz+i];\ns[5] += g0[ix+i] * g2[iy+i] * g1[iz+i];\ns[6] += g1[ix+i] * g0[iy+i] * g2[iz+i];\ns[7] += g0[ix+i] * g1[iy+i] * g2[iz+i];\ns[8] += g0[ix+i] * g0[iy+i] * g3[iz+i];\n}\nif (gout_empty) {\ngout[n*9+0] = + s[0];\ngout[n*9+1] = + s[3];\ngout[n*9+2] = + s[6];\ngout[n*9+3] = + s[1];\ngout[n*9+4] = + s[4];\ngout[n*9+5] = + s[7];\ngout[n*9+6] = + s[2];\ngout[n*9+7] = + s[5];\ngout[n*9+8] = + s[8];\n} else {\ngout[n*9+0] += + s[0];\ngout[n*9+1] += + s[3];\ngout[n*9+2] += + s[6];\ngout[n*9+3] += + s[1];\ngout[n*9+4] += + s[4];\ngout[n*9+5] += + s[7];\ngout[n*9+6] += + s[2];\ngout[n*9+7] += + s[5];\ngout[n*9+8] += + s[8];\n}}}\nvoid int3c2e_ipip2_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {0, 0, 2, 0, 2, 1, 1, 9};\nCINTall_3c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int3c2e_ipip2_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {0, 0, 2, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ipip2;\nreturn CINT3c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int3c2e_ipip2_cart\nint int3c2e_ipip2_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {0, 0, 2, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ipip2;\nreturn CINT3c2e_spheric_drv(out, dims, &envs, opt, cache, &c2s_sph_3c2e1, 0);\n} // int3c2e_ipip2_sph\nint int3c2e_ipip2_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {0, 0, 2, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ipip2;\nreturn CINT3c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_sf_3c2e1, 0);\n} // int3c2e_ipip2_spinor\nALL_CINT(int3c2e_ipip2)\nALL_CINT_FORTRAN_(int3c2e_ipip2)\n/* (NABLA i NABLA j|R12 |k) */\nvoid CINTgout2e_int3c2e_ipvip1(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\ndouble *g2 = g1 + envs->g_size * 3;\ndouble *g3 = g2 + envs->g_size * 3;\nG2E_D_J(g1, g0, envs->i_l+1, envs->j_l+0, envs->k_l, 0);\nG2E_D_I(g2, g0, envs->i_l+0, envs->j_l, envs->k_l, 0);\nG2E_D_I(g3, g1, envs->i_l+0, envs->j_l, envs->k_l, 0);\ndouble s[9];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nfor (i = 0; i < 9; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g3[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g2[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g2[ix+i] * g0[iy+i] * g1[iz+i];\ns[3] += g1[ix+i] * g2[iy+i] * g0[iz+i];\ns[4] += g0[ix+i] * g3[iy+i] * g0[iz+i];\ns[5] += g0[ix+i] * g2[iy+i] * g1[iz+i];\ns[6] += g1[ix+i] * g0[iy+i] * g2[iz+i];\ns[7] += g0[ix+i] * g1[iy+i] * g2[iz+i];\ns[8] += g0[ix+i] * g0[iy+i] * g3[iz+i];\n}\nif (gout_empty) {\ngout[n*9+0] = + s[0];\ngout[n*9+1] = + s[1];\ngout[n*9+2] = + s[2];\ngout[n*9+3] = + s[3];\ngout[n*9+4] = + s[4];\ngout[n*9+5] = + s[5];\ngout[n*9+6] = + s[6];\ngout[n*9+7] = + s[7];\ngout[n*9+8] = + s[8];\n} else {\ngout[n*9+0] += + s[0];\ngout[n*9+1] += + s[1];\ngout[n*9+2] += + s[2];\ngout[n*9+3] += + s[3];\ngout[n*9+4] += + s[4];\ngout[n*9+5] += + s[5];\ngout[n*9+6] += + s[6];\ngout[n*9+7] += + s[7];\ngout[n*9+8] += + s[8];\n}}}\nvoid int3c2e_ipvip1_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {1, 1, 0, 0, 2, 1, 1, 9};\nCINTall_3c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int3c2e_ipvip1_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 0, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ipvip1;\nreturn CINT3c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int3c2e_ipvip1_cart\nint int3c2e_ipvip1_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 0, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ipvip1;\nreturn CINT3c2e_spheric_drv(out, dims, &envs, opt, cache, &c2s_sph_3c2e1, 0);\n} // int3c2e_ipvip1_sph\nint int3c2e_ipvip1_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 1, 0, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ipvip1;\nreturn CINT3c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_sf_3c2e1, 0);\n} // int3c2e_ipvip1_spinor\nALL_CINT(int3c2e_ipvip1)\nALL_CINT_FORTRAN_(int3c2e_ipvip1)\n/* (NABLA i j|R12 |NABLA k) */\nvoid CINTgout2e_int3c2e_ip1ip2(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\ndouble *g2 = g1 + envs->g_size * 3;\ndouble *g3 = g2 + envs->g_size * 3;\nG2E_D_K(g1, g0, envs->i_l+1, envs->j_l+0, envs->k_l+0, 0);\nG2E_D_I(g2, g0, envs->i_l+0, envs->j_l, envs->k_l, 0);\nG2E_D_I(g3, g1, envs->i_l+0, envs->j_l, envs->k_l, 0);\ndouble s[9];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nfor (i = 0; i < 9; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g3[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g2[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g2[ix+i] * g0[iy+i] * g1[iz+i];\ns[3] += g1[ix+i] * g2[iy+i] * g0[iz+i];\ns[4] += g0[ix+i] * g3[iy+i] * g0[iz+i];\ns[5] += g0[ix+i] * g2[iy+i] * g1[iz+i];\ns[6] += g1[ix+i] * g0[iy+i] * g2[iz+i];\ns[7] += g0[ix+i] * g1[iy+i] * g2[iz+i];\ns[8] += g0[ix+i] * g0[iy+i] * g3[iz+i];\n}\nif (gout_empty) {\ngout[n*9+0] = + s[0];\ngout[n*9+1] = + s[1];\ngout[n*9+2] = + s[2];\ngout[n*9+3] = + s[3];\ngout[n*9+4] = + s[4];\ngout[n*9+5] = + s[5];\ngout[n*9+6] = + s[6];\ngout[n*9+7] = + s[7];\ngout[n*9+8] = + s[8];\n} else {\ngout[n*9+0] += + s[0];\ngout[n*9+1] += + s[1];\ngout[n*9+2] += + s[2];\ngout[n*9+3] += + s[3];\ngout[n*9+4] += + s[4];\ngout[n*9+5] += + s[5];\ngout[n*9+6] += + s[6];\ngout[n*9+7] += + s[7];\ngout[n*9+8] += + s[8];\n}}}\nvoid int3c2e_ip1ip2_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {1, 0, 1, 0, 2, 1, 1, 9};\nCINTall_3c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int3c2e_ip1ip2_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 1, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ip1ip2;\nreturn CINT3c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int3c2e_ip1ip2_cart\nint int3c2e_ip1ip2_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 1, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ip1ip2;\nreturn CINT3c2e_spheric_drv(out, dims, &envs, opt, cache, &c2s_sph_3c2e1, 0);\n} // int3c2e_ip1ip2_sph\nint int3c2e_ip1ip2_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 1, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int3c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int3c2e_ip1ip2;\nreturn CINT3c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_sf_3c2e1, 0);\n} // int3c2e_ip1ip2_spinor\nALL_CINT(int3c2e_ip1ip2)\nALL_CINT_FORTRAN_(int3c2e_ip1ip2)\n/* (NABLA NABLA i |R12 |j) */\nstatic void CINTgout2e_int2c2e_ipip1(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\ndouble *g2 = g1 + envs->g_size * 3;\ndouble *g3 = g2 + envs->g_size * 3;\nG2E_D_I(g1, g0, envs->i_l+1, 0, envs->k_l, 0);\nG2E_D_I(g2, g0, envs->i_l+0, 0, envs->k_l, 0);\nG2E_D_I(g3, g1, envs->i_l+0, 0, envs->k_l, 0);\ndouble s[9];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nfor (i = 0; i < 9; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g3[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g2[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g2[ix+i] * g0[iy+i] * g1[iz+i];\ns[3] += g1[ix+i] * g2[iy+i] * g0[iz+i];\ns[4] += g0[ix+i] * g3[iy+i] * g0[iz+i];\ns[5] += g0[ix+i] * g2[iy+i] * g1[iz+i];\ns[6] += g1[ix+i] * g0[iy+i] * g2[iz+i];\ns[7] += g0[ix+i] * g1[iy+i] * g2[iz+i];\ns[8] += g0[ix+i] * g0[iy+i] * g3[iz+i];\n}\nif (gout_empty) {\ngout[n*9+0] = + s[0];\ngout[n*9+1] = + s[3];\ngout[n*9+2] = + s[6];\ngout[n*9+3] = + s[1];\ngout[n*9+4] = + s[4];\ngout[n*9+5] = + s[7];\ngout[n*9+6] = + s[2];\ngout[n*9+7] = + s[5];\ngout[n*9+8] = + s[8];\n} else {\ngout[n*9+0] += + s[0];\ngout[n*9+1] += + s[3];\ngout[n*9+2] += + s[6];\ngout[n*9+3] += + s[1];\ngout[n*9+4] += + s[4];\ngout[n*9+5] += + s[7];\ngout[n*9+6] += + s[2];\ngout[n*9+7] += + s[5];\ngout[n*9+8] += + s[8];\n}}}\nvoid int2c2e_ipip1_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {2, 0, 0, 0, 2, 1, 1, 9};\nCINTall_2c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int2c2e_ipip1_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {2, 0, 0, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int2c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int2c2e_ipip1;\nreturn CINT2c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int2c2e_ipip1_cart\nint int2c2e_ipip1_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {2, 0, 0, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int2c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int2c2e_ipip1;\nreturn CINT2c2e_spheric_drv(out, dims, &envs, opt, cache);\n} // int2c2e_ipip1_sph\nint int2c2e_ipip1_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {2, 0, 0, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int2c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int2c2e_ipip1;\nreturn CINT2c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_sf_1e);\n} // int2c2e_ipip1_spinor\nALL_CINT(int2c2e_ipip1)\nALL_CINT_FORTRAN_(int2c2e_ipip1)\n/* (NABLA i |R12 |NABLA j) */\nstatic void CINTgout2e_int2c2e_ip1ip2(double *gout,\ndouble *g, int *idx, CINTEnvVars *envs, int gout_empty) {\nint nf = envs->nf;\nint nrys_roots = envs->nrys_roots;\nint ix, iy, iz, i, n;\ndouble *g0 = g;\ndouble *g1 = g0 + envs->g_size * 3;\ndouble *g2 = g1 + envs->g_size * 3;\ndouble *g3 = g2 + envs->g_size * 3;\nG2E_D_K(g1, g0, envs->i_l+1, 0, envs->k_l+0, 0);\nG2E_D_I(g2, g0, envs->i_l+0, 0, envs->k_l, 0);\nG2E_D_I(g3, g1, envs->i_l+0, 0, envs->k_l, 0);\ndouble s[9];\nfor (n = 0; n < nf; n++) {\nix = idx[0+n*3];\niy = idx[1+n*3];\niz = idx[2+n*3];\nfor (i = 0; i < 9; i++) { s[i] = 0; }\nfor (i = 0; i < nrys_roots; i++) {\ns[0] += g3[ix+i] * g0[iy+i] * g0[iz+i];\ns[1] += g2[ix+i] * g1[iy+i] * g0[iz+i];\ns[2] += g2[ix+i] * g0[iy+i] * g1[iz+i];\ns[3] += g1[ix+i] * g2[iy+i] * g0[iz+i];\ns[4] += g0[ix+i] * g3[iy+i] * g0[iz+i];\ns[5] += g0[ix+i] * g2[iy+i] * g1[iz+i];\ns[6] += g1[ix+i] * g0[iy+i] * g2[iz+i];\ns[7] += g0[ix+i] * g1[iy+i] * g2[iz+i];\ns[8] += g0[ix+i] * g0[iy+i] * g3[iz+i];\n}\nif (gout_empty) {\ngout[n*9+0] = + s[0];\ngout[n*9+1] = + s[1];\ngout[n*9+2] = + s[2];\ngout[n*9+3] = + s[3];\ngout[n*9+4] = + s[4];\ngout[n*9+5] = + s[5];\ngout[n*9+6] = + s[6];\ngout[n*9+7] = + s[7];\ngout[n*9+8] = + s[8];\n} else {\ngout[n*9+0] += + s[0];\ngout[n*9+1] += + s[1];\ngout[n*9+2] += + s[2];\ngout[n*9+3] += + s[3];\ngout[n*9+4] += + s[4];\ngout[n*9+5] += + s[5];\ngout[n*9+6] += + s[6];\ngout[n*9+7] += + s[7];\ngout[n*9+8] += + s[8];\n}}}\nvoid int2c2e_ip1ip2_optimizer(CINTOpt **opt, int *atm, int natm, int *bas, int nbas, double *env) {\nint ng[] = {1, 0, 1, 0, 2, 1, 1, 9};\nCINTall_2c2e_optimizer(opt, ng, atm, natm, bas, nbas, env);\n}\nint int2c2e_ip1ip2_cart(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 1, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int2c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int2c2e_ip1ip2;\nreturn CINT2c2e_cart_drv(out, dims, &envs, opt, cache);\n} // int2c2e_ip1ip2_cart\nint int2c2e_ip1ip2_sph(double *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 1, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int2c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int2c2e_ip1ip2;\nreturn CINT2c2e_spheric_drv(out, dims, &envs, opt, cache);\n} // int2c2e_ip1ip2_sph\nint int2c2e_ip1ip2_spinor(double complex *out, int *dims, int *shls,\nint *atm, int natm, int *bas, int nbas, double *env, CINTOpt *opt, double *cache) {\nint ng[] = {1, 0, 1, 0, 2, 1, 1, 9};\nCINTEnvVars envs;\nCINTinit_int2c2e_EnvVars(&envs, ng, shls, atm, natm, bas, nbas, env);\nenvs.f_gout = &CINTgout2e_int2c2e_ip1ip2;\nreturn CINT2c2e_spinor_drv(out, dims, &envs, opt, cache, &c2s_sf_1e);\n} // int2c2e_ip1ip2_spinor\nALL_CINT(int2c2e_ip1ip2)\nALL_CINT_FORTRAN_(int2c2e_ip1ip2)\n"},"authors":{"kind":"list like","value":["osirpt.sun@gmail.com"],"string":"[\n \"osirpt.sun@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"osirpt.sun@gmail.com"}}},{"rowIdx":971183,"cells":{"blob_id":{"kind":"string","value":"082fe56d338640417dfb8d0eeb13be113bc2b4d0"},"directory_id":{"kind":"string","value":"313372fbe8ec5e0dfeffec78ec9eb9baeeadec78"},"path":{"kind":"string","value":"/loader/linux/include/debug.h"},"content_id":{"kind":"string","value":"5baa1c8e8d513752c4f3c525f877633277cae7a8"},"detected_licenses":{"kind":"list like","value":["MIT"],"string":"[\n \"MIT\"\n]","isConversational":false},"license_type":{"kind":"string","value":"permissive"},"repo_name":{"kind":"string","value":"SeanTBooker/hypervisor"},"snapshot_id":{"kind":"string","value":"80fe026cf695b3ec577e8ec3f5fd73e7279b229f"},"revision_id":{"kind":"string","value":"b4af35e31bbe54036710d0d142487233dc38b082"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2023-03-08T03:30:07.775334","string":"2023-03-08T03:30:07.775334"},"revision_date":{"kind":"timestamp","value":"2021-02-24T15:23:52","string":"2021-02-24T15:23:52"},"committer_date":{"kind":"timestamp","value":"2021-02-24T15:23:52","string":"2021-02-24T15:23:52"},"github_id":{"kind":"null"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":2123,"string":"2,123"},"extension":{"kind":"string","value":"h"},"content":{"kind":"string","value":"/* SPDX-License-Identifier: SPDX-License-Identifier: GPL-2.0 OR MIT */\n\n/**\n * @copyright\n * Copyright (C) 2020 Assured Information Security, Inc.\n *\n * @copyright\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * @copyright\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * @copyright\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\n#ifndef DEBUG_H\n#define DEBUG_H\n\n#include <linux/printk.h>\n\n#define BFSTR2(X) #X\n#define BFSTR(X) BFSTR2(X)\n\n#define BFINFO(...) printk(KERN_INFO \"[BAREFLANK DEBUG]: \" __VA_ARGS__)\n\n#define BFDEBUG(...) \\\n printk(KERN_INFO \"[BAREFLANK DEBUG]: \" __FILE__ \\\n \":\" BFSTR(__LINE__) \": \" __VA_ARGS__)\n#define BFALERT(...) \\\n printk(KERN_INFO \"[BAREFLANK ALERT]: \" __FILE__ \\\n \":\" BFSTR(__LINE__) \": \" __VA_ARGS__)\n#define BFERROR(...) \\\n printk(KERN_ALERT \"[BAREFLANK ERROR]: \" __FILE__ \\\n \":\" BFSTR(__LINE__) \": \" __VA_ARGS__)\n\n#endif\n"},"authors":{"kind":"list like","value":["rianquinn@gmail.com"],"string":"[\n \"rianquinn@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"rianquinn@gmail.com"}}},{"rowIdx":971184,"cells":{"blob_id":{"kind":"string","value":"95986a4d1ae39107e658bbc29f59dab3789463e2"},"directory_id":{"kind":"string","value":"2960167ca6fba5c49fcdf7fa4353017e1566246f"},"path":{"kind":"string","value":"/Programming/Vyacheslav_Diedov/Програмування/2.06.c"},"content_id":{"kind":"string","value":"ffe9b334cc34b5db6ffb0afce10d82c2f185b87b"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"FriedrichFrankenstein/A.19-Green"},"snapshot_id":{"kind":"string","value":"ed95e28a0e6bbaa48d24db372642ad97d6b42772"},"revision_id":{"kind":"string","value":"1444c54e0400bbc3ab4ed4eac058691d4407421d"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2020-07-29T20:37:21.584748","string":"2020-07-29T20:37:21.584748"},"revision_date":{"kind":"timestamp","value":"2019-10-16T13:39:42","string":"2019-10-16T13:39:42"},"committer_date":{"kind":"timestamp","value":"2019-10-16T13:39:42","string":"2019-10-16T13:39:42"},"github_id":{"kind":"number","value":209950683,"string":"209,950,683"},"star_events_count":{"kind":"number","value":5,"string":"5"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":310,"string":"310"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"#include <stdio.h>\n\nmain(){\nint a, b, c, i; \nprintf ( \"Input \\n\" ); \nfor( i = 0; i < 2; i++){\n switch(i){\n case 0: scanf(\"%i\", &a); \n\t\t\t \t\t\t\t\t\tbreak;\n case 1: scanf(\"%i\", &b); \n\t\t\t \t\t\t\t\t\tbreak;\n }\n}\nc = a + b; \nprintf ( \"Result: %d + %d = %d \\n\", a, b, c ); \ngetchar(); \n}\n"},"authors":{"kind":"list like","value":["diedov270@gmail.com"],"string":"[\n \"diedov270@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"diedov270@gmail.com"}}},{"rowIdx":971185,"cells":{"blob_id":{"kind":"string","value":"a2f80d7ef238020bf4eb89f57863084ce0b6ad95"},"directory_id":{"kind":"string","value":"a40f093dec7fd4c7a4252c69f2c871613540a418"},"path":{"kind":"string","value":"/threadSync/writer.c"},"content_id":{"kind":"string","value":"815a7109b56dec5f4cdf4958d9b79dc9426b0d8d"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"knsushma/Operating-System"},"snapshot_id":{"kind":"string","value":"abd7460c14b01bc04c58ef7d32d1d7af27872210"},"revision_id":{"kind":"string","value":"4a3a7a682b6476c5ba58b8611a42be4153e01380"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2020-03-29T13:20:18.183272","string":"2020-03-29T13:20:18.183272"},"revision_date":{"kind":"timestamp","value":"2019-01-21T18:55:54","string":"2019-01-21T18:55:54"},"committer_date":{"kind":"timestamp","value":"2019-01-21T18:55:54","string":"2019-01-21T18:55:54"},"github_id":{"kind":"number","value":150684237,"string":"150,684,237"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":783,"string":"783"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"/***\n* A program to demonstrate thread synchronization\n* Sushma K N <kudlurnirvan@wisc.edu>\n* Srujana <srujana@wisc.edu>\n*\n* File to read from Writer buffer and write data to stdout stream\n*\n*/\n#ifndef THREADDEMO_WRITER_C\n#define THREADDEMO_WRITER_C\n\n#include \"Queue.h\"\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <pthread.h>\n\n#define counter 0\n\nvoid * streamWriter(void* queue) {\n int stringCount = counter;\n while(1) {\n char * outputString = DequeueString((Queue *)queue);\n if (outputString == NULL) {\n printf(\"Number of strings processed: %d\\n\", stringCount);\n\t break;\n }\n\tstringCount += 1;\n printf(\"%s\\n\",outputString);\n //free(outputString);\n\toutputString = NULL;\n }\n pthread_exit(0);\n}\n\n#endif\n"},"authors":{"kind":"list like","value":["sushmakn@Sushmas-MacBook-Pro.local"],"string":"[\n \"sushmakn@Sushmas-MacBook-Pro.local\"\n]","isConversational":false},"author_id":{"kind":"string","value":"sushmakn@Sushmas-MacBook-Pro.local"}}},{"rowIdx":971186,"cells":{"blob_id":{"kind":"string","value":"993c90565fe396a51ff5a6458463b9a6f40e193d"},"directory_id":{"kind":"string","value":"83214753e9183327e98af0e6768e9be5385e5282"},"path":{"kind":"string","value":"/d/migong/lev9/npc/lev5.c"},"content_id":{"kind":"string","value":"68084ae692a52e2d8f5b239b91dfffc6c21f5315"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"MudRen/hymud"},"snapshot_id":{"kind":"string","value":"f5b3bb0e0232f23a48cb5f1db2e34f08be99614e"},"revision_id":{"kind":"string","value":"b9433df6cf48e936b07252b15b60806ff55bb2f3"},"branch_name":{"kind":"string","value":"refs/heads/main"},"visit_date":{"kind":"timestamp","value":"2023-04-04T22:44:23.880558","string":"2023-04-04T22:44:23.880558"},"revision_date":{"kind":"timestamp","value":"2021-04-07T15:45:16","string":"2021-04-07T15:45:16"},"committer_date":{"kind":"timestamp","value":"2021-04-07T15:45:16","string":"2021-04-07T15:45:16"},"github_id":{"kind":"number","value":318484633,"string":"318,484,633"},"star_events_count":{"kind":"number","value":1,"string":"1"},"fork_events_count":{"kind":"number","value":5,"string":"5"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"GB18030"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":6080,"string":"6,080"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"// migong lev9 九剑\n\n#include <ansi.h>\n\ninherit NPC;\n\n\nstring* names = ({\n\"赵\",\"钱\",\"孙\",\"李\",\"周\",\"吴\",\"郑\",\"王\",\"冯\",\"陈\",\"褚\",\"卫\",\n\"蒋\",\"沈\",\"韩\",\"杨\",\"朱\",\"秦\",\"尤\",\"许\",\"何\",\"吕\",\"施\",\"张\",\n\"孔\",\"曹\",\"严\",\"华\",\"金\",\"魏\",\"陶\",\"姜\",\"戚\",\"谢\",\"邹\",\"喻\",\n\"柏\",\"水\",\"窦\",\"章\",\"云\",\"苏\",\"潘\",\"葛\",\"奚\",\"范\",\"彭\",\"郎\",\n\"鲁\",\"韦\",\"昌\",\"马\",\"苗\",\"凤\",\"花\",\"方\",\"傻\",\"任\",\"袁\",\"柳\",\n\"邓\",\"鲍\",\"史\",\"唐\",\"费\",\"廉\",\"岑\",\"薛\",\"雷\",\"贺\",\"倪\",\"汤\",\n\"藤\",\"殷\",\"罗\",\"华\",\"郝\",\"邬\",\"安\",\"常\",\"乐\",\"呆\",\"时\",\"付\",\n\"皮\",\"卞\",\"齐\",\"康\",\"伍\",\"余\",\"元\",\"卜\",\"顾\",\"盈\",\"平\",\"黄\",\n\"和\",\"穆\",\"肖\",\"尹\",\"姚\",\"邵\",\"湛\",\"汪\",\"祁\",\"毛\",\"禹\",\"狄\",\n\"米\",\"贝\",\"明\",\"藏\",\"计\",\"伏\",\"成\",\"戴\",\"谈\",\"宋\",\"茅\",\"庞\",\n\"熊\",\"纪\",\"舒\",\"屈\",\"项\",\"祝\",\"董\",\"梁\",\"樊\",\"胡\",\"凌\",\"霍\",\n\"虞\",\"万\",\"支\",\"柯\",\"昝\",\"管\",\"卢\",\"英\",\"仇\",\"候\",\"岳\",\"帅\",\n\"司马\",\"上官\",\"欧阳\",\"夏候\",\"诸葛\",\"闻人\",\"东方\",\"赫连\",\"皇甫\",\n\"尉迟\",\"公羊\",\"澹台\",\"公治\",\"宗政\",\"濮阳\",\"淳于\",\"单于\",\"太叔\",\n\"申屠\",\"公孙\",\"仲孙\",\"辕轩\",\"令狐\",\"钟离\",\"宇文\",\"长孙\",\"幕容\",\n\"司徒\",\"师空\",\"颛孔\",\"端木\",\"巫马\",\"公西\",\"漆雕\",\"乐正\",\"壤驷\",\n\"公良\",\"拓趾\",\"夹谷\",\"宰父\",\"谷梁\",\"楚晋\",\"阎法\",\"汝鄢\",\"涂钦\",\n\"段千\",\"百里\",\"东郭\",\"南郭\",\"呼延\",\"归海\",\"羊舌\",\"微生\",\"梁丘\",\n\"左丘\",\"东门\",\"西门\",\"佰赏\",\"南官\",\n\n\"缑\",\"亢\",\"况\",\"后\",\"有\",\"琴\",\"商\",\"牟\",\"佘\",\"耳\",\"墨\",\"哈\",\n\"谯\",\"年\",\"爱\",\"阳\",\"佟\",\"第\",\"五\",\"言\",\"福\",\"蒯\",\"钟\",\"宗\",\n\"林\",\"石\",\n});\n\nstring* nm2 = ({\n\"忠\",\"孝\",\"礼\",\"义\",\"智\",\"勇\",\"仁\",\"匡\",\"宪\",\"令\",\"福\",\"禄\",\"大\",\"小\",\"晓\",\n\"高\",\"可\",\"阿\",\"金\",\"世\",\"克\",\"叔\",\"之\",\"公\",\"夫\",\"时\",\"若\",\"庆\",\"文\",\"武\",\n\"多\",\"才\",\"长\",\"子\",\"永\",\"友\",\"自\",\"人\",\"为\",\"铁\",\"\",\"\",\"\",\"\",\"\",\"\",\"\",\"\",\n\"\",\"\",\"\",\"\",\"\",\"\",\"\",\"\",\"\",\"\",\"\",\"\",\"\",\"\",\n});\n\nstring* nm3 = ({\n\"霸\",\"白\",\"班\",\"斌\",\"宾\",\"昌\",\"超\",\"诚\",\"川\",\"鼎\",\"定\",\"斗\",\n\"法\",\"飞\",\"风\",\"锋\",\"钢\",\"罡\",\"贯\",\"光\",\"海\",\"虎\",\"华\",\n\"浩\",\"宏\",\"济\",\"坚\",\"健\",\"剑\",\"江\",\"进\",\"杰\",\"俊\",\"康\",\n\"良\",\"麟\",\"民\",\"明\",\"鸣\",\"宁\",\"培\",\"启\",\"强\",\"荣\",\"山\",\n\"泰\",\"涛\",\"挺\",\"伟\",\"熙\",\"祥\",\"雄\",\"旭\",\n\"毅\",\"瑜\",\"羽\",\"宇\",\"岳\",\"舟\",\n});\n\n\nvoid create()\n{\n \n int i = random(sizeof(names));\n set_name(names[i]+nm2[random(sizeof(nm2))]+nm3[random(sizeof(nm3))], \n ({ \"man\" }));\n \nset(\"title\", HIB\"武林败类\"NOR);\n set(\"gender\", \"男性\" );\n set(\"long\",\n\"无恶不做的江湖败类。\\n\");\n set(\"attitude\", \"aggressive\");\n set(\"vendetta/authority\",1);\n\t set(\"force_factor\",100+random(200));\n set(\"max_qi\",6000+random(2000));\n set(\"max_jing\",6000+random(2000));\n set(\"max_sen\",2000+random(2000));\n set(\"max_neili\",12000+random(2000));\n set(\"max_mana\",2000+random(2000));\n set(\"eff_neili\",12000+random(2000));\n set(\"neili\",2000+random(2000));\n set(\"per\", 1);\n set(\"age\", 32);\n\n set(\"jiali\" , 100);\n set(\"shen\", -10000);\n set(\"intellgent\",1);\n\tset(\"pursuer\",1);\n set(\"combat_exp\", 3500000+random(1200000));\n set_skill(\"strike\", 330+random(50));\n\n set_skill(\"sword\", 330+random(50));\n\nset_skill(\"zixia-shengong\", 330+random(50));\n\nset_skill(\"huashan-zhangfa\", 330+random(50));\n\nset_skill(\"force\", 330+random(50));\nset_skill(\"lonely-sword\", 330+random(50));\n\nset_skill(\"parry\", 330+random(50));\n\nset_skill(\"dodge\", 330+random(50));\n\nset_skill(\"feiyan-huixiang\", 330+random(50));\n\n \n map_skill(\"strike\", \"huashan-zhangfa\");\n \n map_skill(\"parry\", \"lonely-sword\");\n\n map_skill(\"force\", \"zixia-shengong\");\n\n map_skill(\"dodge\", \"feiyan-huixiang\");\n \nmap_skill(\"sword\" , \"lonely-sword\");\nprepare_skill(\"strike\", \"huashan-zhangfa\");\nset(\"chat_chance_combat\", 80);\n set(\"chat_msg_combat\", ({\n \t\n (: perform_action, \"dodge.huiyanfeiwu\" :),\n\t\n (: exert_function, \"recover\" :),\n (: command(\"wield jian\") :),\n (: command(\"wield jian\") :),\n (: exert_function, \"powerup\" :),\n }) );\n set_temp(\"apply/attack\", 150);\n set_temp(\"apply/defense\", 150);\n \n set_temp(\"apply/armor\", 150);\n set_temp(\"apply/damage\", 150);\n\n set(\"chat_chance\", 30);\n set(\"chat_msg\", ({\n\t\t(: command(\"get silver\") :),\n\t\t(: command(\"get gold\") :),\n\t\t(: command(\"get coin\") :),\n (: random_move :),\n }) );\n setup();\n\n carry_object(\"/d/migong/obj/cloth\")->wear();\n \ncarry_object(\"/d/migong/obj/sword\")->wield();\n \ncarry_object(\"/d/migong/obj/sword\");\n \ncarry_object(\"/d/migong/obj/sword\");\n \ncarry_object(\"/d/migong/obj/sword\");\n \ncarry_object(\"/d/migong/obj/sword\");\n \ncarry_object(\"/d/migong/obj/sword\");\n \nadd_money(\"silver\", random(10));\n\n\n}\n\nvoid init( )\n{\n\tobject ob;\t\n remove_call_out(\"hunting\");\n\tif( interactive(ob = this_player()) ) {\n ob->start_busy(1);\n call_out(\"hunting\",0);\n }\n\tif(!environment()->query(\"no_fight\") && random(10) < 5)\n call_out(\"hunting\",0);\n}\n\nvoid hunting()\n{\n\tint i;\n object *ob;\n ob = all_inventory(environment());\n for(i=sizeof(ob)-1; i>=0; i--) {\n if( !ob[i]->is_character() || ob[i]==this_object() || !living(ob[i])) continue;\n if(ob[i]->query(\"vendetta/authority\")) continue;\n kill_ob(ob[i]);\n ob[i]->fight(this_object());\n }\n}\n\nvoid die()\n{\n object ob, me, corpse;int exp,pot;\n \n ob = this_object();\n me = query_temp(\"last_damage_from\");\n if (!me) return; \n me->add(\"score\",1);\n me->add(\"shen\",10);\n\n message_vision(WHT\"$N口中鲜血狂喷,倒地而亡。\\n\"NOR,ob,me);\nexp=30+random(20);\n if((int)me->query(\"combat_exp\") < 6500000) exp=exp*5;\npot=exp*3/4;\n message(\"vision\", me->name() + \"获得了\"+exp+\"点经验和\"+pot+\"点潜能。\\n\", me);\n me->add(\"combat_exp\",exp);\n me->add(\"potential\",pot);\n\n\t::die();\n}\n"},"authors":{"kind":"list like","value":["i@oiuv.cn"],"string":"[\n \"i@oiuv.cn\"\n]","isConversational":false},"author_id":{"kind":"string","value":"i@oiuv.cn"}}},{"rowIdx":971187,"cells":{"blob_id":{"kind":"string","value":"d42dea619314b11938788b5b00907297e24aade8"},"directory_id":{"kind":"string","value":"20d9c2e8bb67aa90a40abe00197fab8f18fe509c"},"path":{"kind":"string","value":"/new/Starter Code/starter_code/handler.c"},"content_id":{"kind":"string","value":"fb83cd0d8170da1a8899d5ba56c04b2fdf710194"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"yiqingqiu23187/bit-torrent-like-P2P-File-Transfer-Application"},"snapshot_id":{"kind":"string","value":"8650233625d3f6c2cabceecc2277b7cce1e120f2"},"revision_id":{"kind":"string","value":"04d34140eb216f1c0c64680b879fc1df8701d5d8"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2023-04-26T02:55:34.988822","string":"2023-04-26T02:55:34.988822"},"revision_date":{"kind":"timestamp","value":"2021-05-12T09:11:40","string":"2021-05-12T09:11:40"},"committer_date":{"kind":"timestamp","value":"2021-05-12T09:11:40","string":"2021-05-12T09:11:40"},"github_id":{"kind":"number","value":366655642,"string":"366,655,642"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":11649,"string":"11,649"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"//peers invoke this part to handler whohas/Ihave, etc\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n#include <signal.h>\n#include \"handler.h\"\n#include \"sha.h\"\n#include \"list.h\"\n#include \"store.h\"\n#include \"task_get.h\"\n#include \"spiffy.h\"\n#include \"chunk.h\"\n\nextern list_t *chunk_tracker;\nextern list_t *chunk_ihave;\nextern task_get_t task_get;\nextern up_pool_t up_pool;\nextern down_pool_t down_pool;\nextern char master_file_name[256];\nextern bt_config_t config;\nstatic up_conn_t *this_up_conn;\n\nvoid pkt_ntoh(packet_t *packet)\n{\n packet->header.magic = ntohs(packet->header.magic);\n packet->header.header_len = ntohs(packet->header.header_len);\n packet->header.packet_len = ntohs(packet->header.packet_len);\n packet->header.seq_num = ntohl(packet->header.seq_num);\n packet->header.ack_num = ntohl(packet->header.ack_num);\n}\n\nint parse_type(packet_t *packet)\n{\n header_t header = packet->header;\n if (header.magic != MAGIC_NUM || header.version != 1 || header.type < 0 || header.type > 5)\n {\n return -1;\n }\n else\n {\n return header.type;\n }\n}\n\npacket_t *handle_whohas(packet_t *pkt_whohas)\n{\n int req_num = pkt_whohas->data[0];\n int has_num = 0;\n int from_here = 4;\n char payload[DATALEN];\n char *chunk_hash = pkt_whohas->data + from_here;\n\n for (int i = 0; i < req_num; i++)\n {\n if (has_chunk(chunk_hash))\n {\n has_num++;\n memcpy(payload + from_here, chunk_hash, SHA1_HASH_SIZE);\n from_here += SHA1_HASH_SIZE;\n }\n chunk_hash += SHA1_HASH_SIZE;\n }\n\n if (has_num == 0)\n {\n return NULL;\n }\n else\n {\n memset(payload, 0, 4);\n payload[0] = has_num;\n return new_pkt(IHAVE, HEADERLEN + from_here, 0, 0, payload);\n }\n}\n\npacket_t *new_pkt(unsigned char type, unsigned short packet_len,\n unsigned int seq_num, unsigned int ack_num, char *payload)\n{\n packet_t *packet = (packet_t *)malloc(sizeof(packet_t));\n packet->header.magic = htons(MAGIC_NUM);\n packet->header.version = 1;\n packet->header.type = type;\n packet->header.header_len = htons(HEADERLEN);\n packet->header.packet_len = htons(packet_len);\n packet->header.seq_num = htonl(seq_num);\n packet->header.ack_num = htonl(ack_num);\n if (payload != NULL)\n {\n memcpy(packet->data, payload, packet_len - HEADERLEN);\n }\n return packet;\n}\n\nint has_chunk(char *chunk_hash)\n{\n if (chunk_ihave->node_num == 0)\n {\n return 0;\n }\n else\n {\n node_t *curr_node = chunk_ihave->head;\n chunk_t *curr_chunk;\n while (curr_node != NULL)\n {\n curr_chunk = (chunk_t *)(curr_node->data);\n if (memcmp(curr_chunk->chunk_hash, chunk_hash, SHA1_HASH_SIZE) == 0)\n {\n return 1;\n }\n curr_node = curr_node->next;\n }\n return 0;\n }\n}\n\nlist_t *new_whohas_pkt()\n{\n list_t *list = init_list();\n char payload[DATALEN];\n unsigned short pkt_len;\n\n if (task_get.get_num > MAX_CHUNK_NUM)\n { //need more than one packet to send WHOHAS data\n int quotient = task_get.get_num / MAX_CHUNK_NUM;\n int remainder = task_get.get_num - quotient * MAX_CHUNK_NUM;\n for (int i = 0; i < quotient; i++)\n {\n pkt_len = HEADERLEN + 4 + MAX_CHUNK_NUM * SHA1_HASH_SIZE;\n assemble_chunk_hash(payload, MAX_CHUNK_NUM, task_get.get_chunks + i * MAX_CHUNK_NUM);\n add_node(list, new_pkt(WHOHAS, pkt_len, 0, 0, payload));\n }\n\n pkt_len = HEADERLEN + 4 + remainder * SHA1_HASH_SIZE;\n assemble_chunk_hash(payload, remainder, task_get.get_chunks + quotient * MAX_CHUNK_NUM);\n add_node(list, new_pkt(WHOHAS, pkt_len, 0, 0, payload));\n }\n else\n {\n pkt_len = HEADERLEN + 4 + task_get.get_num * SHA1_HASH_SIZE;\n assemble_chunk_hash(payload, task_get.get_num, task_get.get_chunks);\n add_node(list, new_pkt(WHOHAS, pkt_len, 0, 0, payload));\n }\n return list;\n}\n\nvoid assemble_chunk_hash(char *payload, int chunk_num, chunk_t *chunks)\n{\n int need = 0;\n char *hash_stater_p = payload + 4;\n for (int i = 0; i < chunk_num; i++)\n {\n if (task_get.providers[i] != NULL)\n { //there exists a peer to send the chunk data\n continue;\n }\n memcpy(hash_stater_p + i * SHA1_HASH_SIZE, chunks[i].chunk_hash, SHA1_HASH_SIZE);\n need++;\n }\n\n memset(payload, 0, 4);\n payload[0] = need;\n}\n\nlist_t *split_into_chunks(void *payload)\n{\n list_t *chunks = init_list();\n int num = ((char *)payload)[0];\n char *from_here = payload + 4;\n for (int i = 0; i < num; i++)\n {\n char *chunk = malloc(SHA1_HASH_SIZE);\n memcpy(chunk, from_here + i * SHA1_HASH_SIZE, SHA1_HASH_SIZE);\n add_node(chunks, chunk);\n }\n return chunks;\n}\n\npacket_t *handle_ihave(packet_t *pkt, bt_peer_t *peer)\n{\n if (get_down_conn(&down_pool, peer) != NULL)\n {\n return NULL;\n }\n else\n {\n list_t *chunks = split_into_chunks(pkt->data);\n if (down_pool.conn_num >= down_pool.max_conn)\n {\n fprintf(stderr, \"download pool is full, please wait!\");\n return NULL;\n }\n else\n {\n char *to_download = update_provider(chunks, peer);\n chunk_buffer_t *chunk_buf = init_chunk_buffer(to_download);\n add_to_down_pool(&down_pool, peer, chunk_buf);\n packet_t *get_pkt = new_pkt(GET, HEADERLEN + SHA1_HASH_SIZE, 0, 0, to_download);\n return get_pkt;\n }\n }\n}\n\nvoid handle_get(int sock, packet_t *pkt, bt_peer_t *peer)\n{\n up_conn_t *up_conn = get_up_conn(&up_pool, peer);\n //consider the situation of duplicate GET packets\n if (up_conn != NULL)\n {\n remove_from_up_pool(&up_pool, peer);\n up_conn = NULL;\n }\n\n if (up_pool.conn_num >= up_pool.max_conn)\n {\n fprintf(stderr, \"upload pool is full!\");\n }\n else\n {\n char to_upload[SHA1_HASH_SIZE];\n memcpy(to_upload, pkt->data, SHA1_HASH_SIZE);\n packet_t **data_pkt = get_data_pkts(to_upload);\n up_conn = add_to_up_pool(&up_pool, peer, data_pkt);\n this_up_conn = up_conn;\n send_data_pkts(up_conn, sock, (struct sockaddr *)(&(peer->addr)));\n alarm(2); //start timer: 2s\n }\n}\n\npacket_t **get_data_pkts(char *chunk_hash)\n{\n int id;\n for (node_t *node = chunk_tracker->head; node != NULL; node = node->next)\n {\n char *this_chunk_hash = ((chunk_t *)(node->data))->chunk_hash;\n if (memcmp(this_chunk_hash, chunk_hash, SHA1_HASH_SIZE) == 0)\n {\n id = ((chunk_t *)(node->data))->id;\n break;\n }\n }\n\n FILE *fd = fopen(master_file_name, \"r\");\n fseek(fd, id * BT_CHUNK_SIZE, SEEK_SET);\n char data[1024];\n packet_t **data_pkts = malloc(CHUNK_SIZE * sizeof(packet_t *));\n for (unsigned int i = 0; i < CHUNK_SIZE; i++)\n {\n fread(data, 1024, 1, fd);\n data_pkts[i] = new_pkt(DATA, HEADERLEN + 1024, i + 1, 0, data);\n }\n fclose(fd);\n return data_pkts;\n}\n\nvoid send_data_pkts(up_conn_t *conn, int sock, struct sockaddr *to)\n{\n int id_sender = config.identity;\n int id_receiver = conn->receiver->id;\n long now_time = clock();\n FILE *fd = fopen(\"problem2-peer.txt\", \"at\");\n fprintf(fd, \"%s%d-%d %ld %d\\n\", \"conn\", id_sender, id_receiver, now_time - conn->begin_time, conn->cwnd);\n fclose(fd);\n\n while (conn->to_send < conn->available)\n {\n spiffy_sendto(sock, conn->pkts[conn->to_send],\n conn->pkts[conn->to_send]->header.packet_len, 0, to, sizeof(*to));\n conn->to_send++;\n }\n}\n\nvoid handle_data(int sock, packet_t *pkt, bt_peer_t *peer)\n{\n down_conn_t *down_conn = get_down_conn(&down_pool, peer);\n unsigned int seq = pkt->header.seq_num;\n int data_len = pkt->header.packet_len - HEADERLEN;\n if (down_conn == NULL)\n {\n return NULL;\n }\n\n packet_t *ack_pkt;\n if (seq == down_conn->next_ack)\n {\n memcpy(down_conn->chunk_buf->data_buf + down_conn->from_here, pkt->data, data_len);\n down_conn->from_here += data_len;\n down_conn->next_ack += 1;\n ack_pkt = new_pkt(ACK, HEADERLEN, 0, seq, NULL);\n }\n else\n {\n ack_pkt = new_pkt(ACK, HEADERLEN, 0, down_conn->next_ack - 1, NULL);\n }\n\n struct sockaddr *to = (struct sockaddr *)(&(peer->addr));\n spiffy_sendto(sock, ack_pkt, ack_pkt->header.packet_len, 0, to, sizeof(*to));\n free(ack_pkt);\n\n if (down_conn->from_here == BT_CHUNK_SIZE)\n {\n add_and_check_data(down_conn->chunk_buf->chunk_hash, down_conn->chunk_buf->data_buf);\n remove_from_down_pool(&down_pool, peer);\n if (is_task_finish())\n {\n printf(\"write data to the target file\\n\");\n write_data();\n }\n else\n {\n printf(\"continue GET task\\n\");\n for (int i = 0; i < task_get.get_num; i++)\n {\n if (task_get.status[i] == 0 && task_get.providers[i] != NULL)\n {\n char *to_download = task_get.get_chunks[i].chunk_hash;\n chunk_buffer_t *chunk_buf = init_chunk_buffer(to_download);\n add_to_down_pool(&down_pool, task_get.providers[i], chunk_buf);\n packet_t *get_pkt = new_pkt(GET, HEADERLEN + SHA1_HASH_SIZE, 0, 0, to_download);\n struct sockaddr *get_data_from = (struct sockaddr *)(&(task_get.providers[i]->addr));\n spiffy_sendto(sock, get_pkt, get_pkt->header.packet_len, 0, get_data_from, sizeof(*get_data_from));\n task_get.status[i] = 2;\n break;\n }\n }\n }\n }\n}\n\nvoid handle_ack(int sock, packet_t *pkt, bt_peer_t *peer)\n{\n int ack_num = pkt->header.ack_num;\n\n //to show the change of cwnd more clearly\n FILE *fd = fopen(\"problem2-peer.txt\", \"at\");\n fprintf(fd, \"receive ACK %d\\n\", ack_num);\n fclose(fd);\n\n up_conn_t *up_conn = get_up_conn(&up_pool, peer);\n if (up_conn == NULL)\n {\n return NULL;\n }\n\n if (ack_num == CHUNK_SIZE)\n {\n alarm(0); //stop timer\n remove_from_up_pool(&up_pool, peer);\n }\n else if (ack_num > up_conn->last_ack)\n {\n alarm(0);\n up_conn->last_ack = ack_num;\n up_conn->dup_times = 0;\n\n //up_conn->to_send = up_conn->to_send > ack_num ? up_conn->to_send : ack_num;\n int next_available = ack_num + up_conn->cwnd;\n up_conn->available = next_available <= CHUNK_SIZE ? next_available : CHUNK_SIZE;\n send_data_pkts(up_conn, sock, (struct sockaddr *)(&(peer->addr)));\n alarm(2);\n }\n else if (ack_num == up_conn->last_ack)\n {\n up_conn->dup_times++;\n if (up_conn->dup_times >= 3)\n {\n alarm(0);\n up_conn->dup_times = 0;\n up_conn->to_send = ack_num;\n int available = up_conn->to_send + up_conn->cwnd;\n up_conn->available = available < CHUNK_SIZE ? available : CHUNK_SIZE;\n send_data_pkts(up_conn, sock, (struct sockaddr *)(&(peer->addr)));\n alarm(2);\n }\n }\n}\n\nvoid handle_timeout()\n{\n this_up_conn->to_send = this_up_conn->last_ack;\n this_up_conn->dup_times = 0;\n int next_available = this_up_conn->to_send + this_up_conn->cwnd;\n this_up_conn->available = next_available <= CHUNK_SIZE ? next_available : CHUNK_SIZE;\n send_data_pkts(this_up_conn, config.sock, (struct sockaddr *)(&(this_up_conn->receiver->addr)));\n alarm(2);\n}\n"},"authors":{"kind":"list like","value":["18302010034@fudan.edu.cn"],"string":"[\n \"18302010034@fudan.edu.cn\"\n]","isConversational":false},"author_id":{"kind":"string","value":"18302010034@fudan.edu.cn"}}},{"rowIdx":971188,"cells":{"blob_id":{"kind":"string","value":"e4d28b12ee6512dc1cbc44338ded72c9385a6bcd"},"directory_id":{"kind":"string","value":"ef23e388061a637f82b815d32f7af8cb60c5bb1f"},"path":{"kind":"string","value":"/src/mess/machine/mz80.c"},"content_id":{"kind":"string","value":"a4ead343735f0ad5240c312d382efa5264519133"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"marcellodash/psmame"},"snapshot_id":{"kind":"string","value":"76fd877a210d50d34f23e50d338e65a17deff066"},"revision_id":{"kind":"string","value":"09f52313bd3b06311b910ed67a0e7c70c2dd2535"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2021-05-29T23:57:23.333706","string":"2021-05-29T23:57:23.333706"},"revision_date":{"kind":"timestamp","value":"2011-06-23T20:11:22","string":"2011-06-23T20:11:22"},"committer_date":{"kind":"timestamp","value":"2011-06-23T20:11:22","string":"2011-06-23T20:11:22"},"github_id":{"kind":"null"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":3189,"string":"3,189"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"/***************************************************************************\n\n MZ80 driver by Miodrag Milanovic\n\n 22/11/2008 Preliminary driver.\n\n****************************************************************************/\n\n#include \"emu.h\"\n#include \"machine/i8255a.h\"\n#include \"machine/pit8253.h\"\n#include \"imagedev/cassette.h\"\n#include \"sound/speaker.h\"\n#include \"includes/mz80.h\"\n\nUINT8 mz80k_tempo_strobe = 0;\nUINT8 mz80k_vertical = 0;\nUINT8 mz80k_cursor_cnt = 0;\n\n\n/* Driver initialization */\nDRIVER_INIT(mz80k)\n{\n}\n\nMACHINE_RESET( mz80k )\n{\n\tmz80_state *state = machine.driver_data<mz80_state>();\n\tstate->m_mz80k_tempo_strobe = 0;\n\tstate->m_mz80k_8255_portc = 0;\n\tstate->m_mz80k_vertical = 0;\n\tstate->m_mz80k_cursor_cnt = 0;\n\tstate->m_mz80k_keyboard_line = 0;\n}\n\n\nstatic READ8_DEVICE_HANDLER(mz80k_8255_portb_r)\n{\n\tmz80_state *state = device->machine().driver_data<mz80_state>();\n\tstatic const char *const keynames[] = { \"LINE0\", \"LINE1\", \"LINE2\", \"LINE3\", \"LINE4\", \"LINE5\", \"LINE6\", \"LINE7\", \"LINE8\", \"LINE9\" };\n\tif (state->m_mz80k_keyboard_line > 9) {\n\t\treturn 0xff;\n\t} else {\n\t\treturn input_port_read(device->machine(), keynames[state->m_mz80k_keyboard_line]);\n\t}\n}\n\nstatic READ8_DEVICE_HANDLER(mz80k_8255_portc_r)\n{\n\tmz80_state *state = device->machine().driver_data<mz80_state>();\n\tUINT8 val = 0;\n\tval |= state->m_mz80k_vertical ? 0x80 : 0x00;\n\tval |= (state->m_mz80k_cursor_cnt > 31) ? 0x40 : 0x00;\n val |= (cassette_get_state(device->machine().device(\"cassette\")) & CASSETTE_MASK_UISTATE)== CASSETTE_PLAY ? 0x10 : 0x00;\n\n if (cassette_input(device->machine().device(\"cassette\")) > 0.00)\n val |= 0x20;\n\n\treturn val;\n}\n\nstatic WRITE8_DEVICE_HANDLER(mz80k_8255_porta_w)\n{\n\tmz80_state *state = device->machine().driver_data<mz80_state>();\n\tstate->m_mz80k_keyboard_line = data & 0x0f;\n}\n\nstatic WRITE8_DEVICE_HANDLER(mz80k_8255_portc_w)\n{\n// logerror(\"mz80k_8255_portc_w %02x\\n\",data);\n}\n\n\nstatic WRITE_LINE_DEVICE_HANDLER( pit_out0_changed )\n{\n\tmz80_state *drvstate = device->machine().driver_data<mz80_state>();\n\tdevice_t *speaker = device->machine().device(\"speaker\");\n\tif((drvstate->m_prev_state==0) && (state==1)) {\n\t\tdrvstate->m_speaker_level ^= 1;\n\t}\n\tdrvstate->m_prev_state = state;\n\tspeaker_level_w( speaker, drvstate->m_speaker_level);\n}\n\nstatic WRITE_LINE_DEVICE_HANDLER( pit_out2_changed )\n{\n\tcputag_set_input_line(device->machine(), \"maincpu\", 0, HOLD_LINE);\n}\n\nI8255A_INTERFACE( mz80k_8255_int )\n{\n\tDEVCB_NULL,\n\tDEVCB_HANDLER(mz80k_8255_portb_r),\n\tDEVCB_HANDLER(mz80k_8255_portc_r),\n\tDEVCB_HANDLER(mz80k_8255_porta_w),\n\tDEVCB_NULL,\n\tDEVCB_HANDLER(mz80k_8255_portc_w),\n};\n\nconst struct pit8253_config mz80k_pit8253_config =\n{\n\t{\n\t\t/* clockin gate callback */\n\t\t{ XTAL_8MHz/ 4, DEVCB_NULL, DEVCB_LINE(pit_out0_changed) },\n\t\t{ XTAL_8MHz/256, DEVCB_NULL, DEVCB_LINE(pit8253_clk2_w) },\n\t\t{\t\t 0, DEVCB_NULL, DEVCB_LINE(pit_out2_changed) },\n\t}\n};\n\nREAD8_HANDLER(mz80k_strobe_r)\n{\n\tmz80_state *state = space->machine().driver_data<mz80_state>();\n\treturn(0x7e | state->m_mz80k_tempo_strobe);\n}\nWRITE8_HANDLER(mz80k_strobe_w)\n{\n\tdevice_t *pit = space->machine().device(\"pit8253\");\n\tpit8253_gate0_w(pit, BIT(data, 0));\n}\n"},"authors":{"kind":"list like","value":["Mike@localhost"],"string":"[\n \"Mike@localhost\"\n]","isConversational":false},"author_id":{"kind":"string","value":"Mike@localhost"}}},{"rowIdx":971189,"cells":{"blob_id":{"kind":"string","value":"4491cf4f42e5aa87182ca1edc42a96c4bd744776"},"directory_id":{"kind":"string","value":"3c027d8374a78462b3b27c5ca43509d0229b5af3"},"path":{"kind":"string","value":"/register_types.h"},"content_id":{"kind":"string","value":"badaa1435b16e2a73dcea26d84949867ed84a8fc"},"detected_licenses":{"kind":"list like","value":["MIT"],"string":"[\n \"MIT\"\n]","isConversational":false},"license_type":{"kind":"string","value":"permissive"},"repo_name":{"kind":"string","value":"mauville-technologies/gdopenvr"},"snapshot_id":{"kind":"string","value":"7f7826773c6b278ff67e3dd8106d37dbce451f43"},"revision_id":{"kind":"string","value":"38ccc67f16ce6dd705e0b1502f80acb61b292c34"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2023-02-10T18:15:40.084053","string":"2023-02-10T18:15:40.084053"},"revision_date":{"kind":"timestamp","value":"2021-01-06T23:03:13","string":"2021-01-06T23:03:13"},"committer_date":{"kind":"timestamp","value":"2021-01-06T23:03:13","string":"2021-01-06T23:03:13"},"github_id":{"kind":"number","value":325690515,"string":"325,690,515"},"star_events_count":{"kind":"number","value":1,"string":"1"},"fork_events_count":{"kind":"number","value":1,"string":"1"},"gha_license_id":{"kind":"string","value":"MIT"},"gha_event_created_at":{"kind":"timestamp","value":"2021-11-12T19:27:09","string":"2021-11-12T19:27:09"},"gha_created_at":{"kind":"timestamp","value":"2020-12-31T02:04:14","string":"2020-12-31T02:04:14"},"gha_language":{"kind":"string","value":"C++"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":80,"string":"80"},"extension":{"kind":"string","value":"h"},"content":{"kind":"string","value":"#pragma once\n\nvoid register_gdopenvr_types();\nvoid unregister_gdopenvr_types();\n"},"authors":{"kind":"list like","value":["p.a.mauviel@gmail.com"],"string":"[\n \"p.a.mauviel@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"p.a.mauviel@gmail.com"}}},{"rowIdx":971190,"cells":{"blob_id":{"kind":"string","value":"4ed8b21a3587cba34caa7a4e2f74790ab5e5fcfc"},"directory_id":{"kind":"string","value":"ca549b5eb4c4f27d42b465483558b718aeff3431"},"path":{"kind":"string","value":"/src/common/test/TestAlphabetTransform.c"},"content_id":{"kind":"string","value":"800ef397de214ff4fa55f762b939e6607847dd65"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"beardog-ukr/MaroonRacoon"},"snapshot_id":{"kind":"string","value":"088bb27f3e38981a3132ce8e728311f6eb19b52d"},"revision_id":{"kind":"string","value":"53f1feb770ca42c527954697cd48ae0dd320d621"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2020-12-02T22:43:46.095209","string":"2020-12-02T22:43:46.095209"},"revision_date":{"kind":"timestamp","value":"2017-09-22T19:49:34","string":"2017-09-22T19:49:34"},"committer_date":{"kind":"timestamp","value":"2017-09-22T19:49:34","string":"2017-09-22T19:49:34"},"github_id":{"kind":"number","value":96173539,"string":"96,173,539"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":1164,"string":"1,164"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"#include \"TestAlphabetTransform.h\"\r\n#include \"AlphabetTransform.h\"\r\n\r\n#include <stdio.h> //printf, fgetc, fopen, snprintf\r\n#include <string.h> //strcmp\r\n#include <stdlib.h> // malloc\r\n\r\n// ===========================================================================\r\n//bool checkKey(const AlphabetTransform* const at, const char* const key);\r\nbool tst_checkKey_A(char* errorBuf, const int errorBufLim) {\r\n AlphabetTransform at ;\r\n at.basic = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\r\n at.n=26;\r\n //\r\n const char* k1 = \"G\";\r\n if (checkKey(&at, k1)!=true) {\r\n snprintf(errorBuf, errorBufLim, \"%s: bad for \\\"%s\\\"\", __func__, k1);\r\n return false;\r\n }\r\n\r\n if (checkKey(&at, \"BOO\")!=true) {\r\n snprintf(errorBuf, errorBufLim, \"%s: bad for \\\"BOO\\\"\", __func__);\r\n return false;\r\n }\r\n\r\n if (checkKey(&at, \"\")!=false) {\r\n snprintf(errorBuf, errorBufLim, \"%s: bad for \\\"empty string\\\"\", __func__);\r\n return false;\r\n }\r\n\r\n if (checkKey(&at, \"Baaa\")!=false) {\r\n snprintf(errorBuf, errorBufLim, \"%s: bad for \\\"Baaa\\\"\", __func__);\r\n return false;\r\n }\r\n\r\n return true;\r\n}\r\n\r\n// ===========================================================================\r\n"},"authors":{"kind":"list like","value":["beardog@beardog.in.ua"],"string":"[\n \"beardog@beardog.in.ua\"\n]","isConversational":false},"author_id":{"kind":"string","value":"beardog@beardog.in.ua"}}},{"rowIdx":971191,"cells":{"blob_id":{"kind":"string","value":"7b8768ef710b58afb701115690ca49d4d821c7b4"},"directory_id":{"kind":"string","value":"9c1f5a99c02411b4da5113425930c61cadf2a5c4"},"path":{"kind":"string","value":"/pset4/filter less/filter.c"},"content_id":{"kind":"string","value":"119d351dc101641ae7f8f8b4804349fd3c984f8d"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"ZahidKamil/CS50x_2020"},"snapshot_id":{"kind":"string","value":"55bad945dbd2ce4dd7a53a9c901b4f5db64eedaf"},"revision_id":{"kind":"string","value":"5750d19d4a98c75559e0fa3124cd0779fad54640"},"branch_name":{"kind":"string","value":"refs/heads/main"},"visit_date":{"kind":"timestamp","value":"2023-08-24T09:59:04.967490","string":"2023-08-24T09:59:04.967490"},"revision_date":{"kind":"timestamp","value":"2021-11-02T03:12:11","string":"2021-11-02T03:12:11"},"committer_date":{"kind":"timestamp","value":"2021-11-02T03:12:11","string":"2021-11-02T03:12:11"},"github_id":{"kind":"number","value":423691147,"string":"423,691,147"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":3757,"string":"3,757"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"#include <getopt.h>\n#include <stdio.h>\n#include <stdlib.h>\n\n#include \"helpers.h\"\n\nint main(int argc, char *argv[])\n{\n\n // Define allowable filters\n char *filters = \"bgrs\";\n\n // Get filter flag and check validity using getopt which parses command-line arguments. optstring is a string containing the legitimate option characters.\n char filter = getopt(argc, argv, filters);\n if (filter == '?')\n {\n fprintf(stderr, \"Invalid filter.\\n\");\n return 1;\n }\n\n // Ensure only one filter\n if (getopt(argc, argv, filters) != -1) //If there are no more option characters, getopt() returns -1.\n {\n fprintf(stderr, \"Only one filter allowed.\\n\");\n return 2;\n }\n\n // Ensure proper usage\n if (argc != optind + 2) //Then optind is the index in argv of the first argv-element that is not an option.\n {\n fprintf(stderr, \"Usage: filter [flag] infile outfile\\n\");\n return 3;\n }\n\n // Remember filenames\n char *infile = argv[optind];\n char *outfile = argv[optind + 1];\n\n // Open input file\n FILE *inptr = fopen(infile, \"r\");\n if (inptr == NULL)\n {\n fprintf(stderr, \"Could not open %s.\\n\", infile);\n return 4;\n }\n\n // Open output file\n FILE *outptr = fopen(outfile, \"w\");\n if (outptr == NULL)\n {\n fclose(inptr);\n fprintf(stderr, \"Could not create %s.\\n\", outfile);\n return 5;\n }\n\n // Read infile's BITMAPFILEHEADER\n BITMAPFILEHEADER bf;\n fread(&bf, sizeof(BITMAPFILEHEADER), 1, inptr);\n\n // Read infile's BITMAPINFOHEADER\n BITMAPINFOHEADER bi;\n fread(&bi, sizeof(BITMAPINFOHEADER), 1, inptr);\n\n // Ensure infile is (likely) a 24-bit uncompressed BMP 4.0\n if (bf.bfType != 0x4d42 || bf.bfOffBits != 54 || bi.biSize != 40 ||\n bi.biBitCount != 24 || bi.biCompression != 0)\n {\n fclose(outptr);\n fclose(inptr);\n fprintf(stderr, \"Unsupported file format.\\n\");\n return 6;\n }\n\n int height = abs(bi.biHeight);\n int width = bi.biWidth;\n\n // Allocate memory for image\n RGBTRIPLE(*image)[width] = calloc(height, width * sizeof(RGBTRIPLE));\n if (image == NULL)\n {\n fprintf(stderr, \"Not enough memory to store image.\\n\");\n fclose(outptr);\n fclose(inptr);\n return 7;\n }\n\n // Determine padding for scanlines\n int padding = (4 - (width * sizeof(RGBTRIPLE)) % 4) % 4;\n\n // Iterate over infile's scanlines\n for (int i = 0; i < height; i++)\n {\n // Read row into pixel array\n fread(image[i], sizeof(RGBTRIPLE), width, inptr);\n\n // Skip over padding\n fseek(inptr, padding, SEEK_CUR);\n }\n\n // Filter image\n switch (filter)\n {\n // Blur\n case 'b':\n blur(height, width, image);\n break;\n\n // Grayscale\n case 'g':\n grayscale(height, width, image);\n break;\n\n // Reflection\n case 'r':\n reflect(height, width, image);\n break;\n\n // Sepia\n case 's':\n sepia(height, width, image);\n break;\n }\n\n // Write outfile's BITMAPFILEHEADER\n fwrite(&bf, sizeof(BITMAPFILEHEADER), 1, outptr);\n\n // Write outfile's BITMAPINFOHEADER\n fwrite(&bi, sizeof(BITMAPINFOHEADER), 1, outptr);\n\n // Write new pixels to outfile\n for (int i = 0; i < height; i++)\n {\n // Write row to outfile\n fwrite(image[i], sizeof(RGBTRIPLE), width, outptr);\n\n // Write padding at end of row\n for (int k = 0; k < padding; k++)\n {\n fputc(0x00, outptr);\n }\n }\n\n // Free memory for image\n free(image);\n\n // Close infile\n fclose(inptr);\n\n // Close outfile\n fclose(outptr);\n\n return 0;\n}\n"},"authors":{"kind":"list like","value":["zahid.kamil1573@gmail.com"],"string":"[\n \"zahid.kamil1573@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"zahid.kamil1573@gmail.com"}}},{"rowIdx":971192,"cells":{"blob_id":{"kind":"string","value":"b642efc3cde2659df19e76ea84f34a261cecfb64"},"directory_id":{"kind":"string","value":"44cedb194610f0211bc9398440f37dca15b944fd"},"path":{"kind":"string","value":"/critbit-test.c"},"content_id":{"kind":"string","value":"9cd1c2bcab30acb636e24e12e9d9540ed53ff4f0"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"aniruddha-a/critbit2"},"snapshot_id":{"kind":"string","value":"475cee539cb55166c927b40b81b2ac4e307bbf58"},"revision_id":{"kind":"string","value":"42b25594eee32dcb1e3dc554145af5008ede600c"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2021-01-13T02:29:51.282918","string":"2021-01-13T02:29:51.282918"},"revision_date":{"kind":"timestamp","value":"2013-12-18T06:20:39","string":"2013-12-18T06:20:39"},"committer_date":{"kind":"timestamp","value":"2013-12-18T06:20:39","string":"2013-12-18T06:20:39"},"github_id":{"kind":"number","value":15275284,"string":"15,275,284"},"star_events_count":{"kind":"number","value":1,"string":"1"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":1472,"string":"1,472"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <stdint.h>\n#include <inttypes.h>\n#include \"critbit.h\"\n\n/* Given the string in a lib, get the data associated with it\n * s - string given by critbit \n * v - our data pointer \n */\n#define CB_GET_DATA_STR(s,v) memcpy(&v, s+strlen(s)+1, sizeof(void*))\nint cbk (const char *e, void *p)\n{\n int *v;\n CB_GET_DATA_STR(e, v);\n printf (\"\\n ToFree PTRs: p [%s], %p, =%d=\", e, (v) , *v);\n free(v);\n return 1;\n}\n\nint main()\n{\n critbit0_tree tree = { 0 };\n \n int *v;\n int i;\n\n static const char *elems[] =\n { \"10.10.1.0\", \"10.10.255.0\", \"10.10.12.0\", NULL};\n\n for (i = 0; elems[i]; ++i) {\n v = malloc(sizeof(int));\n *v = 10+strlen(elems[i]);\n printf (\"\\n Insert %s = %d at %p\\n\", elems[i], *v, v );\n\tcritbit0_insert(&tree, elems[i], v);\n }\n\n int x;\n uintptr_t p;\n\n for (i = 0; elems[i]; ++i) {\n if (critbit0_contains(&tree, elems[i], &p)) {\n x = *(int*)p;\n printf (\"\\n Contains: %s %\"PRIxPTR\", > %d\\n\",elems[i], p, x);\n }\n }\n\n#if 0 \n for (i = 0; elems[i]; ++i) {\n if (critbit0_delete(&tree, elems[i], &p)) {\n x = *(int*)p;\n printf (\"\\n Deleted: %s %\"PRIxPTR\", > %d\\n\",elems[i], p, x);\n free((int*)p);\n }\n }\n#endif \n\n critbit0_allprefixed(&tree, \"\", cbk, NULL); // to free all nodes \n critbit0_clear(&tree);\n\n printf (\"\\n\\n\");\n return 0;\n\n}\n"},"authors":{"kind":"list like","value":["ani@versa-networks.com"],"string":"[\n \"ani@versa-networks.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"ani@versa-networks.com"}}},{"rowIdx":971193,"cells":{"blob_id":{"kind":"string","value":"b19da884d5fa1278c295b6919fde59b76b694dc0"},"directory_id":{"kind":"string","value":"e4a46cd3cd8dd8c3b4dfd4a267d7a1d512a3771f"},"path":{"kind":"string","value":"/parent child/threads/diningPhilosophers.c"},"content_id":{"kind":"string","value":"5828b96557da39d0773d47ad55178ed26188d59c"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"sohan99/practiceset"},"snapshot_id":{"kind":"string","value":"0effb44a2987e36999c6af8e4db907ad03e28cdf"},"revision_id":{"kind":"string","value":"a579e0fca632435d4555fb25611167c9647764ef"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2016-09-05T12:56:59.088219","string":"2016-09-05T12:56:59.088219"},"revision_date":{"kind":"timestamp","value":"2015-12-07T04:55:30","string":"2015-12-07T04:55:30"},"committer_date":{"kind":"timestamp","value":"2015-12-07T04:55:30","string":"2015-12-07T04:55:30"},"github_id":{"kind":"number","value":40240482,"string":"40,240,482"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":949,"string":"949"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"#include <stdio.h>\n#include <pthread.h>\n#include <stdlib.h>\n#include <unistd.h>\n\nvoid * HungryWantToEat(void *);\n\npthread_mutex_t lock;\nint chopstick = 5;\nint main(){\n\n\tpthread_t\ttid1,tid2,tid3,tid4,tid5;\n\n\tpthread_attr_t attr;\n\n\tpthread_attr_init(&attr);\n\t//while(1){\n\tpthread_create(&tid1,&attr,HungryWantToEat,NULL);\n\tpthread_create(&tid2,&attr,HungryWantToEat,NULL);\n\tpthread_create(&tid3,&attr,HungryWantToEat,NULL);\n\tpthread_create(&tid4,&attr,HungryWantToEat,NULL);\n\tpthread_create(&tid5,&attr,HungryWantToEat,NULL);\n\t//}\n\n\t\n\n\tpthread_mutex_init(&lock,NULL);\n\n\tpthread_join(tid1,NULL);\n\n\treturn 0;\n}\n/// sample for inconsistency\nvoid * HungryWantToEat(void *tmp){\n\t//while(1){\n\t\tpthread_mutex_lock(&lock);\n\t\t\twhile(chopstick <2);\n\t\t\tchopstick = chopstick -2;\n\t\t\tsleep(3);\n\t\t\tprintf(\" %ld thread , chopstick count %d\\n\",(long)tmp,chopstick);\n\t\t\tchopstick = chopstick+2;\n\t\tpthread_mutex_unlock(&lock);\n\t//}\n\tpthread_exit(NULL);\n\treturn NULL;\n}\n"},"authors":{"kind":"list like","value":["sohanspoojary99@gmail.com"],"string":"[\n \"sohanspoojary99@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"sohanspoojary99@gmail.com"}}},{"rowIdx":971194,"cells":{"blob_id":{"kind":"string","value":"2b31ccf3f19d954ee45da229c807bb41992edfad"},"directory_id":{"kind":"string","value":"1427bfdb2bc7ad43a7d4862e1e5770549eeee8eb"},"path":{"kind":"string","value":"/TDIP/CubeSat_Dev_Code/drivers/fsl_pmc.c"},"content_id":{"kind":"string","value":"f0759aa5215e7f1999867f5a6c74b50986c2c22f"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"Toddgs/CubeSat_Dev_Code---Current"},"snapshot_id":{"kind":"string","value":"e428cc636c7553bf150cb86433e1ebb62335aef1"},"revision_id":{"kind":"string","value":"487be3f37dd8daefb612ab7b86062a05ef7f0dda"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2020-03-25T19:16:15.239523","string":"2020-03-25T19:16:15.239523"},"revision_date":{"kind":"timestamp","value":"2019-05-14T18:52:55","string":"2019-05-14T18:52:55"},"committer_date":{"kind":"timestamp","value":"2019-05-14T18:52:55","string":"2019-05-14T18:52:55"},"github_id":{"kind":"number","value":144074289,"string":"144,074,289"},"star_events_count":{"kind":"number","value":2,"string":"2"},"fork_events_count":{"kind":"number","value":3,"string":"3"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"timestamp","value":"2018-08-14T13:55:48","string":"2018-08-14T13:55:48"},"gha_created_at":{"kind":"timestamp","value":"2018-08-08T22:31:11","string":"2018-08-08T22:31:11"},"gha_language":{"kind":"string","value":"C"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":4621,"string":"4,621"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"/*\r\n * Copyright (c) 2015, Freescale Semiconductor, Inc.\r\n * All rights reserved.\r\n *\r\n * Redistribution and use in source and binary forms, with or without modification,\r\n * are permitted provided that the following conditions are met:\r\n *\r\n * o Redistributions of source code must retain the above copyright notice, this list\r\n * of conditions and the following disclaimer.\r\n *\r\n * o Redistributions in binary form must reproduce the above copyright notice, this\r\n * list of conditions and the following disclaimer in the documentation and/or\r\n * other materials provided with the distribution.\r\n *\r\n * o Neither the name of Freescale Semiconductor, Inc. nor the names of its\r\n * contributors may be used to endorse or promote products derived from this\r\n * software without specific prior written permission.\r\n *\r\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\r\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\r\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\r\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR\r\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\r\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\r\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\r\n * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\r\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\r\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r\n */\r\n#include \"fsl_pmc.h\"\r\n\r\n#if (defined(FSL_FEATURE_PMC_HAS_PARAM) && FSL_FEATURE_PMC_HAS_PARAM)\r\nvoid PMC_GetParam(PMC_Type *base, pmc_param_t *param)\r\n{\r\n uint32_t reg = base->PARAM;\r\n ;\r\n param->vlpoEnable = (bool)(reg & PMC_PARAM_VLPOE_MASK);\r\n param->hvdEnable = (bool)(reg & PMC_PARAM_HVDE_MASK);\r\n}\r\n#endif /* FSL_FEATURE_PMC_HAS_PARAM */\r\n\r\nvoid PMC_ConfigureLowVoltDetect(PMC_Type *base, const pmc_low_volt_detect_config_t *config)\r\n{\r\n base->LVDSC1 = (0U |\r\n#if (defined(FSL_FEATURE_PMC_HAS_LVDV) && FSL_FEATURE_PMC_HAS_LVDV)\r\n ((uint32_t)config->voltSelect << PMC_LVDSC1_LVDV_SHIFT) |\r\n#endif\r\n ((uint32_t)config->enableInt << PMC_LVDSC1_LVDIE_SHIFT) |\r\n ((uint32_t)config->enableReset << PMC_LVDSC1_LVDRE_SHIFT)\r\n /* Clear the Low Voltage Detect Flag with previouse power detect setting */\r\n | PMC_LVDSC1_LVDACK_MASK);\r\n}\r\n\r\nvoid PMC_ConfigureLowVoltWarning(PMC_Type *base, const pmc_low_volt_warning_config_t *config)\r\n{\r\n base->LVDSC2 = (0U |\r\n#if (defined(FSL_FEATURE_PMC_HAS_LVWV) && FSL_FEATURE_PMC_HAS_LVWV)\r\n ((uint32_t)config->voltSelect << PMC_LVDSC2_LVWV_SHIFT) |\r\n#endif\r\n ((uint32_t)config->enableInt << PMC_LVDSC2_LVWIE_SHIFT)\r\n /* Clear the Low Voltage Warning Flag with previouse power detect setting */\r\n | PMC_LVDSC2_LVWACK_MASK);\r\n}\r\n\r\n#if (defined(FSL_FEATURE_PMC_HAS_HVDSC1) && FSL_FEATURE_PMC_HAS_HVDSC1)\r\nvoid PMC_ConfigureHighVoltDetect(PMC_Type *base, const pmc_high_volt_detect_config_t *config)\r\n{\r\n base->HVDSC1 = (((uint32_t)config->voltSelect << PMC_HVDSC1_HVDV_SHIFT) |\r\n ((uint32_t)config->enableInt << PMC_HVDSC1_HVDIE_SHIFT) |\r\n ((uint32_t)config->enableReset << PMC_HVDSC1_HVDRE_SHIFT)\r\n /* Clear the High Voltage Detect Flag with previouse power detect setting */\r\n | PMC_HVDSC1_HVDACK_MASK);\r\n}\r\n#endif /* FSL_FEATURE_PMC_HAS_HVDSC1 */\r\n\r\n#if ((defined(FSL_FEATURE_PMC_HAS_BGBE) && FSL_FEATURE_PMC_HAS_BGBE) || \\\r\n (defined(FSL_FEATURE_PMC_HAS_BGEN) && FSL_FEATURE_PMC_HAS_BGEN) || \\\r\n (defined(FSL_FEATURE_PMC_HAS_BGBDS) && FSL_FEATURE_PMC_HAS_BGBDS))\r\nvoid PMC_ConfigureBandgapBuffer(PMC_Type *base, const pmc_bandgap_buffer_config_t *config)\r\n{\r\n base->REGSC = (0U\r\n#if (defined(FSL_FEATURE_PMC_HAS_BGBE) && FSL_FEATURE_PMC_HAS_BGBE)\r\n | ((uint32_t)config->enable << PMC_REGSC_BGBE_SHIFT)\r\n#endif /* FSL_FEATURE_PMC_HAS_BGBE */\r\n#if (defined(FSL_FEATURE_PMC_HAS_BGEN) && FSL_FEATURE_PMC_HAS_BGEN)\r\n | (((uint32_t)config->enableInLowPowerMode << PMC_REGSC_BGEN_SHIFT))\r\n#endif /* FSL_FEATURE_PMC_HAS_BGEN */\r\n#if (defined(FSL_FEATURE_PMC_HAS_BGBDS) && FSL_FEATURE_PMC_HAS_BGBDS)\r\n | ((uint32_t)config->drive << PMC_REGSC_BGBDS_SHIFT)\r\n#endif /* FSL_FEATURE_PMC_HAS_BGBDS */\r\n );\r\n}\r\n#endif\r\n"},"authors":{"kind":"list like","value":["tgs1621@jagmail.southalabama.edu"],"string":"[\n \"tgs1621@jagmail.southalabama.edu\"\n]","isConversational":false},"author_id":{"kind":"string","value":"tgs1621@jagmail.southalabama.edu"}}},{"rowIdx":971195,"cells":{"blob_id":{"kind":"string","value":"e42997f5a95992d114695917f2a4585ae2302586"},"directory_id":{"kind":"string","value":"2bdedcda705f6dcf45a1e9a090377f892bcb58bb"},"path":{"kind":"string","value":"/src/main/output/law/history/oauth_change_business/day/generic/fact/party/power/force.c"},"content_id":{"kind":"string","value":"9b3debf0ea001407ba7a6a5fa8fa1f98ca8f88a7"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"matkosoric/GenericNameTesting"},"snapshot_id":{"kind":"string","value":"860a22af1098dda9ea9e24a1fc681bb728aa2d69"},"revision_id":{"kind":"string","value":"03f4a38229c28bc6d83258e5a84fce4b189d5f00"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2021-01-08T22:35:20.022350","string":"2021-01-08T22:35:20.022350"},"revision_date":{"kind":"timestamp","value":"2020-02-21T11:28:21","string":"2020-02-21T11:28:21"},"committer_date":{"kind":"timestamp","value":"2020-02-21T11:28:21","string":"2020-02-21T11:28:21"},"github_id":{"kind":"number","value":242123053,"string":"242,123,053"},"star_events_count":{"kind":"number","value":1,"string":"1"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":10054,"string":"10,054"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"import org.apache.http.HttpEntity;\nimport org.apache.http.HttpResponse;\nimport org.apache.http.client.HttpClient;\nimport org.apache.http.client.methods.HttpGet;\nimport org.apache.http.client.methods.HttpPost;\nimport org.apache.http.client.utils.URIBuilder;\nimport org.apache.http.entity.StringEntity;\nimport org.apache.http.impl.client.DefaultHttpClient;\nimport org.apache.http.util.EntityUtils;\n\n\npublic class RequestHelper\n{\n\n\tprivate static String token = \"\";\n\tprivate static long lastTokenFetch = 0;\n\tprivate static final long MILLIS_PER_10_MINUTES = 1000L * 60L * 10L;\n\tprivate static final long EARLIER = 1000 * 30L; // make the call 30 seconds earlier\n\n\tpublic static String emotionRequest( String subscriptionKey, String picUrl )\n\t{\n\t\tString result = null;\n\n\t\tHttpClient httpClient = new DefaultHttpClient( );\n\n\t\ttry\n\t\t{\n\t\t\t// NOTE: You must use the same region in your REST call as you used to obtain your subscription keys.\n\t\t\t// For example, if you obtained your subscription keys from westcentralus, replace \"westus\" in the\n\t\t\t// URL below with \"westcentralus\".\n\t\t\tURIBuilder uriBuilder =\n\t\t\t\tnew URIBuilder( \"https://westus.api.cognitive.microsoft.com/emotion/v1.0/recognize\" );\n\n\t\t\tURI uri = uriBuilder.build( );\n\t\t\tHttpPost request = new HttpPost( uri );\n\n\t\t\t// Request headers. Replace the example key below with your valid subscription key.\n\t\t\trequest.setHeader( \"Content-Type\", \"application/json\" );\n\t\t\trequest.setHeader( \"bc28351f88415650f0be8f1fef91396b\" );\n\n\t\t\t// Request body. Replace the example URL below with the URL of the image you want to analyze.\n\t\t\tStringEntity reqEntity = new StringEntity( \"{ \\\"url\\\": \\\"\" + picUrl + \"\\\" }\" );\n\t\t\trequest.setEntity( reqEntity );\n\n\t\t\tHttpResponse response = httpClient.execute( request );\n\t\t\tHttpEntity entity = response.getEntity( );\n\n\t\t\tif ( entity != null )\n\t\t\t{\n\t\t\t\tresult = EntityUtils.toString( entity );\n\t\t\t}\n\t\t}\n\t\tcatch ( Exception e )\n\t\t{\n\t\t\tSystem.out.println( e.getMessage( ) );\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static String faceRequest( String subscriptionKey, String picUrl )\n\t{\n\t\tString result = null;\n\t\tHttpClient httpclient = new DefaultHttpClient( );\n\n\t\ttry\n\t\t{\n\t\t\tURIBuilder builder = new URIBuilder( \"https://westeurope.api.cognitive.microsoft.com/face/v1.0/detect\" );\n\n\t\t\t// Request parameters. All of them are optional.\n\t\t\tbuilder.setParameter( \"returnFaceId\", \"true\" );\n\t\t\tbuilder.setParameter( \"returnFaceLandmarks\", \"false\" );\n\t\t\tbuilder.setParameter( \"returnFaceAttributes\",\n\t\t\t\t\"age,gender,headPose,smile,facialHair,glasses,emotion,hair,makeup,occlusion,accessories,blur,exposure,noise\" );\n\n\t\t\t// Prepare the URI for the REST API call.\n\t\t\tURI uri = builder.build( );\n\t\t\tHttpPost request = new HttpPost( uri );\n\n\t\t\t// Request headers.\n\t\t\trequest.setHeader( \"Content-Type\", \"application/json\" );\n\t\t\trequest.setHeader( \"376d4c49a0ad31ccbe7b6dad2f9d40ca\", subscriptionKey );\n\n\t\t\t// Request body.\n\t\t\tStringEntity reqEntity = new StringEntity(\n\t\t\t\t\"{\\\"url\\\":\\\"\" + picUrl + \"\\\"}\" );\n\t\t\trequest.setEntity( reqEntity );\n\n\t\t\t// Execute the REST API call and get the response entity.\n\t\t\tHttpResponse response = httpclient.execute( request );\n\t\t\tHttpEntity entity = response.getEntity( );\n\n\t\t\tif ( entity != null )\n\t\t\t{\n\t\t\t\t// Format and display the JSON response.\n\t\t\t\tSystem.out.println( \"REST Response:\\n\" );\n\n\t\t\t\tresult = EntityUtils.toString( entity ).trim( );\n\t\t\t}\n\t\t}\n\t\tcatch ( Exception e )\n\t\t{\n\t\t\t// Display error message.\n\t\t\tSystem.out.println( e.getMessage( ) );\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static String identifyRequest( String subscriptionKey, String picUrl, String faceId )\n\t{\n\t\tString result = null;\n\t\tHttpClient httpclient = new DefaultHttpClient( );\n\n\t\ttry\n\t\t{\n\t\t\tURIBuilder builder = new URIBuilder( \"https://westeurope.api.cognitive.microsoft.com/face/v1.0/identify\" );\n\n\t\t\t// Prepare the URI for the REST API call.\n\t\t\tURI uri = builder.build( );\n\t\t\tHttpPost request = new HttpPost( uri );\n\n\t\t\t// Request headers.\n\t\t\trequest.setHeader( \"Content-Type\", \"application/json\" );\n\t\t\trequest.setHeader( \"b843ebde1286f1e8153f66651d9c0d23\", subscriptionKey );\n\n\t\t\t// Request body.\n\t\t\tStringEntity reqEntity = new StringEntity(\n\t\t\t\t\"{\\\"personGroupId\\\":\\\"emotion_test\\\",\\\"faceIds\\\":[\\\"\" + faceId +\n\t\t\t\t\t\"\\\"],\\\"maxNumOfCandidatesReturned\\\":1,\\\"confidenceThreshold\\\": 0.5}\" );\n\t\t\trequest.setEntity( reqEntity );\n\n\t\t\t// Execute the REST API call and get the response entity.\n\t\t\tHttpResponse response = httpclient.execute( request );\n\t\t\tHttpEntity entity = response.getEntity( );\n\n\t\t\tif ( entity != null )\n\t\t\t{\n\t\t\t\t// Format and display the JSON response.\n\t\t\t\tSystem.out.println( \"REST Response:\\n\" );\n\n\t\t\t\tresult = EntityUtils.toString( entity ).trim( );\n\t\t\t}\n\t\t}\n\t\tcatch ( Exception e )\n\t\t{\n\t\t\t// Display error message.\n\t\t\tSystem.out.println( e.getMessage( ) );\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static String personRequest( String subscriptionKey, String picUrl, String personId )\n\t{\n\t\tString result = null;\n\n\t\tHttpClient httpClient = new DefaultHttpClient( );\n\n\t\ttry\n\t\t{\n\t\t\t// NOTE: You must use the same region in your REST call as you used to obtain your subscription keys.\n\t\t\t// For example, if you obtained your subscription keys from westcentralus, replace \"westus\" in the\n\t\t\t// URL below with \"westcentralus\".\n\t\t\tURIBuilder uriBuilder =\n\t\t\t\tnew URIBuilder(\n\t\t\t\t\t\"https://westeurope.api.cognitive.microsoft.com/face/v1.0/persongroups/emotion_test/persons/\" +\n\t\t\t\t\t\tpersonId );\n\n\t\t\tURI uri = uriBuilder.build( );\n\t\t\tHttpGet request = new HttpGet( uri );\n\n\t\t\t// Request headers. Replace the example key below with your valid subscription key.\n\t\t\trequest.setHeader( \"53e660316737bb0fdc98084ce3e1e7ff\", subscriptionKey );\n\n\t\t\tHttpResponse response = httpClient.execute( request );\n\t\t\tHttpEntity entity = response.getEntity( );\n\n\t\t\tif ( entity != null )\n\t\t\t{\n\t\t\t\tresult = EntityUtils.toString( entity );\n\t\t\t}\n\t\t}\n\t\tcatch ( Exception e )\n\t\t{\n\t\t\tSystem.out.println( e.getMessage( ) );\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static String objectRequest( String subscriptionKey, String picUrl )\n\t{\n\t\tHttpClient httpclient = new DefaultHttpClient( );\n\n\t\ttry\n\t\t{\n\t\t\tURIBuilder builder = new URIBuilder( \"https://westeurope.api.cognitive.microsoft.com/vision/v1.0/analyze\" );\n\n\t\t\t// Request parameters. All of them are optional.\n\t\t\tbuilder.setParameter( \"visualFeatures\", \"Categories,Description,Color\" );\n\t\t\tbuilder.setParameter( \"language\", \"en\" );\n\n\t\t\t// Prepare the URI for the REST API call.\n\t\t\tURI uri = builder.build( );\n\t\t\tHttpPost request = new HttpPost( uri );\n\n\t\t\t// Request headers.\n\t\t\trequest.setHeader( \"Content-Type\", \"application/json\" );\n\t\t\trequest.setHeader( \"3b4f90d78141a6b983ba17b0acaf078a\", subscriptionKey );\n\n\t\t\t// Request body.\n\t\t\tStringEntity reqEntity = new StringEntity(\n\t\t\t\t\"{\\\"url\\\":\\\"\" + picUrl + \"\\\"}\" );\n\t\t\trequest.setEntity( reqEntity );\n\n\t\t\t// Execute the REST API call and get the response entity.\n\t\t\tHttpResponse response = httpclient.execute( request );\n\t\t\tHttpEntity entity = response.getEntity( );\n\n\t\t\tif ( entity != null )\n\t\t\t{\n\t\t\t\t// Format and display the JSON response.\n\t\t\t\treturn EntityUtils.toString( entity );\n\t\t\t}\n\t\t}\n\t\tcatch ( Exception e )\n\t\t{\n\t\t\t// Display error message.\n\t\t\tSystem.out.println( e.getMessage( ) );\n\t\t}\n\t\treturn null;\n\t}\n\n\t/**\n\t * https://docs.microsofttranslator.com/text-translate.html#!/default/get_Translate\n\t *\n\t * @param subscriptionKey\n\t * @param textToTranslate\n\t * @return translated text\n\t */\n\tpublic static String translationRequest( String subscriptionKey, String textToTranslate,\n\t\tString langCodeToTranslateTo )\n\t{\n\t\tHttpClient httpclient = new DefaultHttpClient( );\n\n\t\ttry\n\t\t{\n\t\t\tURIBuilder builder = new URIBuilder( \"https://api.microsofttranslator.com/V2/Http.svc/Translate\" );\n\n\t\t\tbuilder.setParameter( \"text\", textToTranslate );\n\t\t\tbuilder.setParameter( \"to\", langCodeToTranslateTo );\n\n\t\t\t// Prepare the URI for the REST API call.\n\t\t\tURI uri = builder.build( );\n\t\t\tHttpGet request = new HttpGet( uri );\n\n\t\t\t// Request headers.\n\t\t\trequest.setHeader( \"d3f1b54305ba2720ebe5fb47b70c6e90\" + getToken( subscriptionKey ) );\n\n\t\t\t// Execute the REST API call and get the response entity.\n\t\t\tHttpResponse response = httpclient.execute( request );\n\t\t\tHttpEntity entity = response.getEntity( );\n\n\t\t\tif ( entity != null )\n\t\t\t{\n\t\t\t\t// Format and display the JSON response.\n\t\t\t\tString translatedTextXml = EntityUtils.toString( entity );\n\t\t\t\tString translatedText = translatedTextXml.substring( translatedTextXml.indexOf( \">\" ) + 1,\n\t\t\t\t\ttranslatedTextXml.lastIndexOf( \"<\" ) );\n\t\t\t\treturn translatedText;\n\t\t\t}\n\t\t}\n\t\tcatch ( Exception e )\n\t\t{\n\t\t\t// Display error message.\n\t\t\tSystem.out.println( e.getMessage( ) );\n\t\t}\n\t\treturn \"?\";\n\t}\n\n\tpublic static String getToken( String subscriptionKey )\n\t{\n\t\tif ( System.currentTimeMillis( ) - lastTokenFetch >= MILLIS_PER_10_MINUTES - EARLIER )\n\t\t{\n\t\t\t// TODO: log that we're fetching a new token - to check if it works correctly (doesn't get called too often)\n\t\t\ttoken = tokenRequest( subscriptionKey );\n\t\t}\n\t\treturn token;\n\t}\n\n\t/**\n\t * Use: Fetch new token every 10 minutes\n\t *\n\t * https://docs.microsofttranslator.com/oauth-token.html\n\t *\n\t * @param subscriptionKey\n\t * @return token\n\t */\n\tprivate static String tokenRequest( String subscriptionKey )\n\t{\n\t\tHttpClient httpclient = new DefaultHttpClient( );\n\n\t\ttry\n\t\t{\n\t\t\tURIBuilder builder = new URIBuilder( \"https://api.cognitive.microsoft.com/sts/v1.0/issueToken\" );\n\n\t\t\t// Prepare the URI for the REST API call.\n\t\t\tURI uri = builder.build( );\n\t\t\tHttpPost request = new HttpPost( uri );\n\n\t\t\t// Request headers.\n\t\t\trequest.setHeader( \"2361ab01f19c14e9958ccefaa2cc682b\", subscriptionKey );\n\n\t\t\t// Request body.\n\t\t\tStringEntity reqEntity = new StringEntity( \"\" );\n\t\t\trequest.setEntity( reqEntity );\n\n\t\t\t// Execute the REST API call and get the response entity.\n\t\t\tHttpResponse response = httpclient.execute( request );\n\t\t\tHttpEntity entity = response.getEntity( );\n\n\t\t\tif ( entity != null )\n\t\t\t{\n\t\t\t\t// Format and display the JSON response.\n\t\t\t\treturn EntityUtils.toString( entity );\n\t\t\t}\n\t\t}\n\t\tcatch ( Exception e )\n\t\t{\n\t\t\t// Display error message.\n\t\t\tSystem.out.println( e.getMessage( ) );\n\t\t}\n\t\treturn null;\n\n\t}\n\n}\n"},"authors":{"kind":"list like","value":["soric.matko@gmail.com"],"string":"[\n \"soric.matko@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"soric.matko@gmail.com"}}},{"rowIdx":971196,"cells":{"blob_id":{"kind":"string","value":"b6b000e1b3034655925fa328302356993a84bcd0"},"directory_id":{"kind":"string","value":"8072c1cf03f82fd1891536e93b6c28f16df82ea4"},"path":{"kind":"string","value":"/metamorphosys/META/externals/HCDDES/src/FRODO/tests/main.h"},"content_id":{"kind":"string","value":"5e4622dc1b9a89c63fdda74ed0ce3730e4cbda69"},"detected_licenses":{"kind":"list like","value":["LicenseRef-scancode-other-permissive"],"string":"[\n \"LicenseRef-scancode-other-permissive\"\n]","isConversational":false},"license_type":{"kind":"string","value":"permissive"},"repo_name":{"kind":"string","value":"15831944/metamorphosys-desktop"},"snapshot_id":{"kind":"string","value":"90a26c6700c444accd58358c457d675eb2fdd59f"},"revision_id":{"kind":"string","value":"4adb71c18f7811289fc4ba4dcb465e99e93d8e60"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2021-05-30T13:34:07.037424","string":"2021-05-30T13:34:07.037424"},"revision_date":{"kind":"timestamp","value":"2015-09-24T22:09:05","string":"2015-09-24T22:09:05"},"committer_date":{"kind":"timestamp","value":"2015-09-24T22:09:05","string":"2015-09-24T22:09:05"},"github_id":{"kind":"null"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":1220,"string":"1,220"},"extension":{"kind":"string","value":"h"},"content":{"kind":"string","value":"/*** Generated by the FRODO code generator -- DO NOT HAND EDIT ***/\r\n\r\n\r\n#ifndef __FRODO_GENERATED_MAIN_H__\r\n#define __FRODO_GENERATED_MAIN_H__\r\n\r\n\r\n/*** Included Header Files ***/\r\n#include \"arch/win32/win32_platform.h\"\r\n\r\n\r\n/*** Optional Optimization Global Values ***/\r\n// Scheduler\r\n#define FS_MAXTASKNAMELENGTH\t\t\t\t16\r\n#define\tFS_MAXSCHEDULABLES\t\t\t\t\t8\r\n#define\tFS_MAXPERIODICINSTANCES\t\t\t\t16\r\n#define\tFS_MAXSPORADICINSTANCES\t\t\t\t16\r\n#define FS_MAXSYNCCHANNELS\t\t\t\t\t8\r\n// Generic Peripherals\r\n#define\tFP_MAXMESSAGESIZE\t\t\t\t\t256\r\n// UDP Peripherals\r\n#define UDP_MAXCHANNELS\t\t\t\t\t\t1\r\n#define UDP_MAXSYNCEXPECTATIONS\t\t\t\t8\r\n#define UDP_MAXASYNCEXPECTATIONS\t\t\t8\r\n#define UDP_MAXSYNCTIMES\t\t\t\t\t8\r\n#define UDP_MAXPEERS\t\t\t\t\t\t8\r\n#define UDP_LOCALADDRESS\t\t\t\t\t\"129.59.129.183\"\r\n#define UDP_REMOTEADDRESS\t\t\t\t\t\"129.59.129.255\"\t//\"129.59.129.139\"\r\n#define UDP_SYNCWAIT\t\t\t\t\t\t100.0\r\n#define UDP_SYNCPOLLWAIT\t\t\t\t\t500\r\n#define UDP_ASYNCPRIORITY\t\t\t\t\t128\r\n#define UDP_NAMELENGTH\t\t\t\t\t\t32\r\n#define UDP_MAXEXPECTINSTANCES\t\t\t\t8\r\n// Logger\r\n#define LOGGER_MAXENTRIES\t\t\t\t\t1024 * 1024\r\n#define LOGGER_TEXTLENGTH\t\t\t\t\t128\r\n\r\n\r\n/*****************************************************************************/\r\n\r\n\r\n#endif // __FRODO_GENERATED_MAIN_H__\r\n\r\n"},"authors":{"kind":"list like","value":["adam.nagel+git@gmail.com"],"string":"[\n \"adam.nagel+git@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"adam.nagel+git@gmail.com"}}},{"rowIdx":971197,"cells":{"blob_id":{"kind":"string","value":"952dfd3cb37d31a7510254c62b8d77416620e1d5"},"directory_id":{"kind":"string","value":"1ad4dd5261a185f3cf92d7fd3226de28679747c5"},"path":{"kind":"string","value":"/kernel/drivers/power/supply/twl4030_madc_battery.c"},"content_id":{"kind":"string","value":"4d41acb985761ad976f9de2b2cdc265a50fc9dea"},"detected_licenses":{"kind":"list like","value":["MIT","Linux-syscall-note","GPL-2.0-only"],"string":"[\n \"MIT\",\n \"Linux-syscall-note\",\n \"GPL-2.0-only\"\n]","isConversational":false},"license_type":{"kind":"string","value":"permissive"},"repo_name":{"kind":"string","value":"oslab-swrc/libmpk"},"snapshot_id":{"kind":"string","value":"b30c8fa2eea834a8ab441fdd9f7789296781ec17"},"revision_id":{"kind":"string","value":"a0b20ab8819d60d22d2a90f0d54eccae40ae6b05"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2022-05-01T01:36:07.491532","string":"2022-05-01T01:36:07.491532"},"revision_date":{"kind":"timestamp","value":"2022-03-18T05:44:14","string":"2022-03-18T05:44:14"},"committer_date":{"kind":"timestamp","value":"2022-03-18T05:44:14","string":"2022-03-18T05:44:14"},"github_id":{"kind":"number","value":223290854,"string":"223,290,854"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"string","value":"MIT"},"gha_event_created_at":{"kind":"timestamp","value":"2019-11-22T00:30:13","string":"2019-11-22T00:30:13"},"gha_created_at":{"kind":"timestamp","value":"2019-11-22T00:30:12","string":"2019-11-22T00:30:12"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":7583,"string":"7,583"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"/*\n * Dumb driver for LiIon batteries using TWL4030 madc.\n *\n * Copyright 2013 Golden Delicious Computers\n * Lukas Märdian <lukas@goldelico.com>\n *\n * Based on dumb driver for gta01 battery\n * Copyright 2009 Openmoko, Inc\n * Balaji Rao <balajirrao@openmoko.org>\n */\n\n#include <linux/module.h>\n#include <linux/param.h>\n#include <linux/delay.h>\n#include <linux/workqueue.h>\n#include <linux/platform_device.h>\n#include <linux/power_supply.h>\n#include <linux/slab.h>\n#include <linux/sort.h>\n#include <linux/power/twl4030_madc_battery.h>\n#include <linux/iio/consumer.h>\n\nstruct twl4030_madc_battery {\n\tstruct power_supply *psy;\n\tstruct twl4030_madc_bat_platform_data *pdata;\n\tstruct iio_channel *channel_temp;\n\tstruct iio_channel *channel_ichg;\n\tstruct iio_channel *channel_vbat;\n};\n\nstatic enum power_supply_property twl4030_madc_bat_props[] = {\n\tPOWER_SUPPLY_PROP_PRESENT,\n\tPOWER_SUPPLY_PROP_STATUS,\n\tPOWER_SUPPLY_PROP_TECHNOLOGY,\n\tPOWER_SUPPLY_PROP_VOLTAGE_NOW,\n\tPOWER_SUPPLY_PROP_CURRENT_NOW,\n\tPOWER_SUPPLY_PROP_CAPACITY,\n\tPOWER_SUPPLY_PROP_CHARGE_FULL,\n\tPOWER_SUPPLY_PROP_CHARGE_NOW,\n\tPOWER_SUPPLY_PROP_TEMP,\n\tPOWER_SUPPLY_PROP_TIME_TO_EMPTY_NOW,\n};\n\nstatic int madc_read(struct iio_channel *channel)\n{\n\tint val, err;\n\terr = iio_read_channel_processed(channel, &val);\n\tif (err < 0)\n\t\treturn err;\n\n\treturn val;\n}\n\nstatic int twl4030_madc_bat_get_charging_status(struct twl4030_madc_battery *bt)\n{\n\treturn (madc_read(bt->channel_ichg) > 0) ? 1 : 0;\n}\n\nstatic int twl4030_madc_bat_get_voltage(struct twl4030_madc_battery *bt)\n{\n\treturn madc_read(bt->channel_vbat);\n}\n\nstatic int twl4030_madc_bat_get_current(struct twl4030_madc_battery *bt)\n{\n\treturn madc_read(bt->channel_ichg) * 1000;\n}\n\nstatic int twl4030_madc_bat_get_temp(struct twl4030_madc_battery *bt)\n{\n\treturn madc_read(bt->channel_temp) * 10;\n}\n\nstatic int twl4030_madc_bat_voltscale(struct twl4030_madc_battery *bat,\n\t\t\t\t\tint volt)\n{\n\tstruct twl4030_madc_bat_calibration *calibration;\n\tint i, res = 0;\n\n\t/* choose charging curve */\n\tif (twl4030_madc_bat_get_charging_status(bat))\n\t\tcalibration = bat->pdata->charging;\n\telse\n\t\tcalibration = bat->pdata->discharging;\n\n\tif (volt > calibration[0].voltage) {\n\t\tres = calibration[0].level;\n\t} else {\n\t\tfor (i = 0; calibration[i+1].voltage >= 0; i++) {\n\t\t\tif (volt <= calibration[i].voltage &&\n\t\t\t\t\tvolt >= calibration[i+1].voltage) {\n\t\t\t\t/* interval found - interpolate within range */\n\t\t\t\tres = calibration[i].level -\n\t\t\t\t\t((calibration[i].voltage - volt) *\n\t\t\t\t\t(calibration[i].level -\n\t\t\t\t\tcalibration[i+1].level)) /\n\t\t\t\t\t(calibration[i].voltage -\n\t\t\t\t\tcalibration[i+1].voltage);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn res;\n}\n\nstatic int twl4030_madc_bat_get_property(struct power_supply *psy,\n\t\t\t\t\tenum power_supply_property psp,\n\t\t\t\t\tunion power_supply_propval *val)\n{\n\tstruct twl4030_madc_battery *bat = power_supply_get_drvdata(psy);\n\n\tswitch (psp) {\n\tcase POWER_SUPPLY_PROP_STATUS:\n\t\tif (twl4030_madc_bat_voltscale(bat,\n\t\t\t\ttwl4030_madc_bat_get_voltage(bat)) > 95)\n\t\t\tval->intval = POWER_SUPPLY_STATUS_FULL;\n\t\telse {\n\t\t\tif (twl4030_madc_bat_get_charging_status(bat))\n\t\t\t\tval->intval = POWER_SUPPLY_STATUS_CHARGING;\n\t\t\telse\n\t\t\t\tval->intval = POWER_SUPPLY_STATUS_DISCHARGING;\n\t\t}\n\t\tbreak;\n\tcase POWER_SUPPLY_PROP_VOLTAGE_NOW:\n\t\tval->intval = twl4030_madc_bat_get_voltage(bat) * 1000;\n\t\tbreak;\n\tcase POWER_SUPPLY_PROP_TECHNOLOGY:\n\t\tval->intval = POWER_SUPPLY_TECHNOLOGY_LION;\n\t\tbreak;\n\tcase POWER_SUPPLY_PROP_CURRENT_NOW:\n\t\tval->intval = twl4030_madc_bat_get_current(bat);\n\t\tbreak;\n\tcase POWER_SUPPLY_PROP_PRESENT:\n\t\t/* assume battery is always present */\n\t\tval->intval = 1;\n\t\tbreak;\n\tcase POWER_SUPPLY_PROP_CHARGE_NOW: {\n\t\t\tint percent = twl4030_madc_bat_voltscale(bat,\n\t\t\t\t\ttwl4030_madc_bat_get_voltage(bat));\n\t\t\tval->intval = (percent * bat->pdata->capacity) / 100;\n\t\t\tbreak;\n\t\t}\n\tcase POWER_SUPPLY_PROP_CAPACITY:\n\t\tval->intval = twl4030_madc_bat_voltscale(bat,\n\t\t\t\t\ttwl4030_madc_bat_get_voltage(bat));\n\t\tbreak;\n\tcase POWER_SUPPLY_PROP_CHARGE_FULL:\n\t\tval->intval = bat->pdata->capacity;\n\t\tbreak;\n\tcase POWER_SUPPLY_PROP_TEMP:\n\t\tval->intval = twl4030_madc_bat_get_temp(bat);\n\t\tbreak;\n\tcase POWER_SUPPLY_PROP_TIME_TO_EMPTY_NOW: {\n\t\t\tint percent = twl4030_madc_bat_voltscale(bat,\n\t\t\t\t\ttwl4030_madc_bat_get_voltage(bat));\n\t\t\t/* in mAh */\n\t\t\tint chg = (percent * (bat->pdata->capacity/1000))/100;\n\n\t\t\t/* assume discharge with 400 mA (ca. 1.5W) */\n\t\t\tval->intval = (3600l * chg) / 400;\n\t\t\tbreak;\n\t\t}\n\tdefault:\n\t\treturn -EINVAL;\n\t}\n\n\treturn 0;\n}\n\nstatic void twl4030_madc_bat_ext_changed(struct power_supply *psy)\n{\n\tpower_supply_changed(psy);\n}\n\nstatic const struct power_supply_desc twl4030_madc_bat_desc = {\n\t.name\t\t\t= \"twl4030_battery\",\n\t.type\t\t\t= POWER_SUPPLY_TYPE_BATTERY,\n\t.properties\t\t= twl4030_madc_bat_props,\n\t.num_properties\t\t= ARRAY_SIZE(twl4030_madc_bat_props),\n\t.get_property\t\t= twl4030_madc_bat_get_property,\n\t.external_power_changed\t= twl4030_madc_bat_ext_changed,\n\n};\n\nstatic int twl4030_cmp(const void *a, const void *b)\n{\n\treturn ((struct twl4030_madc_bat_calibration *)b)->voltage -\n\t\t((struct twl4030_madc_bat_calibration *)a)->voltage;\n}\n\nstatic int twl4030_madc_battery_probe(struct platform_device *pdev)\n{\n\tstruct twl4030_madc_battery *twl4030_madc_bat;\n\tstruct twl4030_madc_bat_platform_data *pdata = pdev->dev.platform_data;\n\tstruct power_supply_config psy_cfg = {};\n\tint ret = 0;\n\n\ttwl4030_madc_bat = devm_kzalloc(&pdev->dev, sizeof(*twl4030_madc_bat),\n\t\t\t\tGFP_KERNEL);\n\tif (!twl4030_madc_bat)\n\t\treturn -ENOMEM;\n\n\ttwl4030_madc_bat->channel_temp = iio_channel_get(&pdev->dev, \"temp\");\n\tif (IS_ERR(twl4030_madc_bat->channel_temp)) {\n\t\tret = PTR_ERR(twl4030_madc_bat->channel_temp);\n\t\tgoto err;\n\t}\n\n\ttwl4030_madc_bat->channel_ichg = iio_channel_get(&pdev->dev, \"ichg\");\n\tif (IS_ERR(twl4030_madc_bat->channel_ichg)) {\n\t\tret = PTR_ERR(twl4030_madc_bat->channel_ichg);\n\t\tgoto err_temp;\n\t}\n\n\ttwl4030_madc_bat->channel_vbat = iio_channel_get(&pdev->dev, \"vbat\");\n\tif (IS_ERR(twl4030_madc_bat->channel_vbat)) {\n\t\tret = PTR_ERR(twl4030_madc_bat->channel_vbat);\n\t\tgoto err_ichg;\n\t}\n\n\t/* sort charging and discharging calibration data */\n\tsort(pdata->charging, pdata->charging_size,\n\t\tsizeof(struct twl4030_madc_bat_calibration),\n\t\ttwl4030_cmp, NULL);\n\tsort(pdata->discharging, pdata->discharging_size,\n\t\tsizeof(struct twl4030_madc_bat_calibration),\n\t\ttwl4030_cmp, NULL);\n\n\ttwl4030_madc_bat->pdata = pdata;\n\tplatform_set_drvdata(pdev, twl4030_madc_bat);\n\tpsy_cfg.drv_data = twl4030_madc_bat;\n\ttwl4030_madc_bat->psy = power_supply_register(&pdev->dev,\n\t\t\t\t\t\t &twl4030_madc_bat_desc,\n\t\t\t\t\t\t &psy_cfg);\n\tif (IS_ERR(twl4030_madc_bat->psy)) {\n\t\tret = PTR_ERR(twl4030_madc_bat->psy);\n\t\tgoto err_vbat;\n\t}\n\n\treturn 0;\n\nerr_vbat:\n\tiio_channel_release(twl4030_madc_bat->channel_vbat);\nerr_ichg:\n\tiio_channel_release(twl4030_madc_bat->channel_ichg);\nerr_temp:\n\tiio_channel_release(twl4030_madc_bat->channel_temp);\nerr:\n\treturn ret;\n}\n\nstatic int twl4030_madc_battery_remove(struct platform_device *pdev)\n{\n\tstruct twl4030_madc_battery *bat = platform_get_drvdata(pdev);\n\n\tpower_supply_unregister(bat->psy);\n\n\tiio_channel_release(bat->channel_vbat);\n\tiio_channel_release(bat->channel_ichg);\n\tiio_channel_release(bat->channel_temp);\n\n\treturn 0;\n}\n\nstatic struct platform_driver twl4030_madc_battery_driver = {\n\t.driver = {\n\t\t.name = \"twl4030_madc_battery\",\n\t},\n\t.probe = twl4030_madc_battery_probe,\n\t.remove = twl4030_madc_battery_remove,\n};\nmodule_platform_driver(twl4030_madc_battery_driver);\n\nMODULE_LICENSE(\"GPL\");\nMODULE_AUTHOR(\"Lukas Märdian <lukas@goldelico.com>\");\nMODULE_DESCRIPTION(\"twl4030_madc battery driver\");\nMODULE_ALIAS(\"platform:twl4030_madc_battery\");\n"},"authors":{"kind":"list like","value":["spark720@gatech.edu"],"string":"[\n \"spark720@gatech.edu\"\n]","isConversational":false},"author_id":{"kind":"string","value":"spark720@gatech.edu"}}},{"rowIdx":971198,"cells":{"blob_id":{"kind":"string","value":"79d5bc7e7b0f58f2265ccab7604b7acd757b6cfa"},"directory_id":{"kind":"string","value":"0ac21e360b757a46c4b22b2289ae21cdb21b7a4c"},"path":{"kind":"string","value":"/drivers/fsl_swm.h"},"content_id":{"kind":"string","value":"a80bf4e5c39a05c5f03f1fb779044bef09518319"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"xiongyu0523/azure-rtos-threadx-demo-lpc802"},"snapshot_id":{"kind":"string","value":"64ccd69f6cc842bdeba7b1139114c38da9de9dd7"},"revision_id":{"kind":"string","value":"b6b12bbfe250047641c504c7b6a1f24b8bfb0c98"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2022-11-14T14:31:23.183288","string":"2022-11-14T14:31:23.183288"},"revision_date":{"kind":"timestamp","value":"2020-07-10T10:10:46","string":"2020-07-10T10:10:46"},"committer_date":{"kind":"timestamp","value":"2020-07-10T10:10:46","string":"2020-07-10T10:10:46"},"github_id":{"kind":"number","value":278575978,"string":"278,575,978"},"star_events_count":{"kind":"number","value":3,"string":"3"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"UTF-8"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":2333,"string":"2,333"},"extension":{"kind":"string","value":"h"},"content":{"kind":"string","value":"/*\n * Copyright 2017-2019 NXP\n * All rights reserved.\n *\n *\n * SPDX-License-Identifier: BSD-3-Clause\n */\n#ifndef _FSL_SWM_H_\n#define _FSL_SWM_H_\n\n#include \"fsl_swm_connections.h\"\n\n/*!\n * @addtogroup swm\n * @{\n */\n\n/*! @file */\n\n/*******************************************************************************\n * Definitions\n ******************************************************************************/\n\n/*! @name Driver version */\n/*@{*/\n#define FSL_SWM_DRIVER_VERSION (MAKE_VERSION(2, 0, 1)) /*!< Version 2.0.1 */\n/*@}*/\n\n/*******************************************************************************\n * API\n ******************************************************************************/\n\n#if defined(__cplusplus)\nextern \"C\" {\n#endif\n\n/*!\n * @brief Assignment of digital peripheral functions to pins.\n *\n * This function will selects a pin (designated by its GPIO port and\n * bit numbers) to a function.\n *\n * @param base SWM peripheral base address.\n * @param func any function name that is movable.\n * @param swm_port_pin any pin which has a GPIO port number and bit number.\n */\nvoid SWM_SetMovablePinSelect(SWM_Type *base, swm_select_movable_t func, swm_port_pin_type_t swm_port_pin);\n\n#if (defined(FSL_FEATURE_SWM_HAS_PINASSIGNFIXED0_REGISTER) && (FSL_FEATURE_SWM_HAS_PINASSIGNFIXED0_REGISTER == 1))\n/*!\n * @brief Assignment of digital peripheral functions to pins.\n *\n * This function will selects a pin (designated by its GPIO port and\n * bit numbers) to a function.\n *\n * @param base SWM peripheral base address.\n * @param func any function name that is movable.\n * @param swm_port_pin any pin which has a GPIO port number and bit number.\n */\nvoid SWM_SetFixedMovablePinSelect(SWM_Type *base,\n swm_select_fixed_movable_t func,\n swm_fixed_port_pin_type_t swm_port_pin);\n#endif /* FSL_FEATURE_SWM_HAS_PINASSIGNFIXED0_REGISTER */\n\n/*!\n * @brief Enable the fixed-pin function.\n *\n * This function will enables a fixed-pin function in PINENABLE0 or PINENABLE1.\n *\n * @param base SWM peripheral base address.\n * @param func any function name that is fixed pin.\n * @param enable enable or disable.\n */\nvoid SWM_SetFixedPinSelect(SWM_Type *base, swm_select_fixed_pin_t func, bool enable);\n\n#if defined(__cplusplus)\n}\n#endif\n\n/*! @}*/\n\n#endif /* _FSL_SWM_H_ */\n"},"authors":{"kind":"list like","value":["xiongyu0523@gmail.com"],"string":"[\n \"xiongyu0523@gmail.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"xiongyu0523@gmail.com"}}},{"rowIdx":971199,"cells":{"blob_id":{"kind":"string","value":"564f1016591fb59acd0bb93bf1eff3b206e1b51c"},"directory_id":{"kind":"string","value":"852ca3e259848d8498072245a08254224a5c4ee6"},"path":{"kind":"string","value":"/fy4/feature/message.c"},"content_id":{"kind":"string","value":"e091263e9aeb1e81fabf4565f0e8227692c1376d"},"detected_licenses":{"kind":"list like","value":[],"string":"[]","isConversational":false},"license_type":{"kind":"string","value":"no_license"},"repo_name":{"kind":"string","value":"losep/fy2005"},"snapshot_id":{"kind":"string","value":"2fa3d5e6d607c663edaab190bf66899789b83929"},"revision_id":{"kind":"string","value":"6ff35a0f7a33c454d9195ee1e28f310d65ec954b"},"branch_name":{"kind":"string","value":"refs/heads/master"},"visit_date":{"kind":"timestamp","value":"2020-07-16T16:08:23.397485","string":"2020-07-16T16:08:23.397485"},"revision_date":{"kind":"timestamp","value":"2016-01-05T05:07:46","string":"2016-01-05T05:07:46"},"committer_date":{"kind":"timestamp","value":"2016-01-05T05:07:46","string":"2016-01-05T05:07:46"},"github_id":{"kind":"null"},"star_events_count":{"kind":"number","value":0,"string":"0"},"fork_events_count":{"kind":"number","value":0,"string":"0"},"gha_license_id":{"kind":"null"},"gha_event_created_at":{"kind":"null"},"gha_created_at":{"kind":"null"},"gha_language":{"kind":"null"},"src_encoding":{"kind":"string","value":"WINDOWS-1252"},"language":{"kind":"string","value":"C"},"is_vendor":{"kind":"bool","value":false,"string":"false"},"is_generated":{"kind":"bool","value":false,"string":"false"},"length_bytes":{"kind":"number","value":1307,"string":"1,307"},"extension":{"kind":"string","value":"c"},"content":{"kind":"string","value":"// message.c\r\n\r\n#include <ansi.h>\r\n#include <dbase.h>\r\n\r\n#define MAX_MSG_BUFFER 500\r\n\r\nstatic string *msg_buffer = ({});\r\n\r\nvoid receive_message(string msgclass, string msg)\r\n{\r\n\tstring subclass, *ch;\r\n\r\n\tif( !interactive(this_object()) ) {\r\n\t\tthis_object()->relay_message(msgclass, msg);\r\n\t\treturn;\r\n\t}\r\n\r\n\tif( sscanf(msgclass, \"%s:%s\", subclass, msgclass)==2 ) {\r\n\t\tswitch(subclass) {\r\n\t\t\tcase \"channel\":\r\n\t\t\t\tif( !pointerp(ch = query(\"channels\"))\r\n\t\t\t\t||\tmember_array(msgclass, ch)==-1 )\r\n\t\t\t\t\treturn;\r\n\t\t\t\tbreak;\r\n\t\t\tcase \"outdoor\":\r\n\t\t\t\tif( !environment() || !environment()->query(\"outdoors\") )\r\n\t\t\t\t\treturn;\r\n\t\t\t\tbreak;\r\n\t\t\tdefault:\r\n\t\t\t\terror(\"Message: Invalid Subclass \" + subclass + \".\\n\");\r\n\t\t}\r\n\t}\r\n\r\n\tif( query_temp(\"block_msg/all\") || query_temp(\"block_msg/\" + msgclass) )\r\n\t\treturn;\r\n\r\n\tif( in_input(this_object()) || in_edit(this_object()) ) {\r\n\t\tif( sizeof(msg_buffer) < MAX_MSG_BUFFER )\r\n\t\t\tmsg_buffer += ({ msg });\r\n\t} else\r\n\t\treceive( msg );\r\n}\r\n\r\nvoid write_prompt()\r\n{\r\n\tif( sizeof(msg_buffer) ) {\r\n\t\treceive(BOLD \"[ÊäÈëʱÔÝ´æѶϢ]\\n\" NOR);\r\n\t\tfor(int i=0; i<(sizeof(msg_buffer)>MAX_MSG_BUFFER? MAX_MSG_BUFFER:sizeof(msg_buffer)); i++)\r\n\t\t\treceive(msg_buffer[i]);\r\n\t\tmsg_buffer = ({});\r\n\t}\r\n\twrite(\"> \");\r\n}\r\n\r\nvoid receive_snoop(string msg)\r\n{\r\n\treceive(\"%\" + msg);\r\n}\r\n"},"authors":{"kind":"list like","value":["liang.huang@transmension.com"],"string":"[\n \"liang.huang@transmension.com\"\n]","isConversational":false},"author_id":{"kind":"string","value":"liang.huang@transmension.com"}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":9711,"numItemsPerPage":100,"numTotalItems":1000000,"offset":971100,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc4NzAzOTU3MywianRpIjoiMDcxODc0NmQtZmE4OC00NWEzLTlhZWQtNzExMjQyY2M3OTQ1Iiwic3ViIjoiL2RhdGFzZXRzL1Jlc2V0MjMvdGhlLXN0YWNrLXYyLWMiLCJleHAiOjE3ODcwNDMxNzMsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.7lstM8yAAYKz5u1nilzdyP-xrVgou_BLuo-fAS0s6bfD3z-SLtEfd52DtnrFcJtLny7yvidywA9P9TTsyP4hCw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":1000000,"numBytesParquet":4809725800}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 2 268 | content_id stringlengths 40 40 | detected_licenses listlengths 0 58 | license_type stringclasses 2
values | repo_name stringlengths 5 118 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 816
values | visit_date timestamp[us] | revision_date timestamp[us] | committer_date timestamp[us] | github_id int64 2.31k 677M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 23
values | gha_event_created_at timestamp[us] | gha_created_at timestamp[us] | gha_language stringclasses 151
values | src_encoding stringclasses 33
values | language stringclasses 1
value | is_vendor bool 2
classes | is_generated bool 2
classes | length_bytes int64 3 10.3M | extension stringclasses 119
values | content stringlengths 3 10.3M | authors listlengths 1 1 | author_id stringlengths 0 228 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
4e0f6e1756cfba141faa6c68ef2f52d9e45c895b | b1d017f04aa49267c3c5274cad297529e598c7ef | /chapter6/e9.c | 22ccb6c416c28b32cf0564fee06950208bddc544 | [] | no_license | devitalio/cprimerplus-6th | 9235e66f68a2deb88f44166c97d1c8d48df4c618 | 30656ca7c6648cf933cb78c5bfb5b9002e3bde4f | refs/heads/master | 2022-10-30T23:46:26.143542 | 2020-06-18T19:17:58 | 2020-06-18T19:17:58 | 269,574,674 | 1 | 0 | null | null | null | null | UTF-8 | C | false | false | 284 | c | #include <stdio.h>
float calculate(float x, float y)
{
return (x -y)/(x * y);
}
int main(void)
{
float x,y;
printf("Enter 2 decimals: ");
while(scanf("%f%f", &x,&y) == 2)
{
printf("%.4f\n", calculate(x,y));
}
printf("\n");
return 0;
}
| [
"devitalio@users.noreply.github.com"
] | devitalio@users.noreply.github.com |
9f6ce8ef4c15b16b06e780465d6eaa3ff87430e8 | ba5c98f736e101a864a531723ad0589d0bcf66c3 | /colle/colle04.c | 6eb5c8564df607e68d16ae662d17bee513577f9e | [] | no_license | isaacgounton/CercoIA_43_Piscine_C | e05e3e5d78825a71b6a86d979bc8801f09373581 | 61852b2a10aedc57d6e0337c84e7822fca7a31c6 | refs/heads/master | 2021-01-02T11:36:32.245586 | 2020-02-26T03:53:36 | 2020-02-26T03:53:36 | 239,606,066 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 938 | c |
/* GROUPE 20 */
#include "colle.h"
void colle04(int x, int y)
{
int i;
int j;
j=1;
while(j<=y)
{
i=1;
while(i<=x)
{
if (j == 1)
{
if (i == 1)
ft_putchar('A');
else if (i== x)
... | [
"noreply@github.com"
] | isaacgounton.noreply@github.com |
c0b7e92d7784ddcc3cab4df033fb15ec64b02009 | 0c5d3b088080577388f5766431487534f93a2c40 | /Github-Projects-Origin/linux-master/drivers/clk/socfpga/clk-periph-a10.c.bak.c | 7b2ad97dd17848451ca6cc40786f4429d709848a | [] | no_license | zhiyuanjia/WoBench | 878255ce45e76ef57f88743c7f43acdfa59e93e7 | 6b337780cbd598de98fc0eabd19efaf1a01b6012 | refs/heads/master | 2021-09-23T03:12:08.091319 | 2018-06-14T10:17:59 | 2018-06-14T10:17:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 3,795 | c | #include <assert.h>
#include <string.h>
#define INCLUDEMAIN
/*
* Copyright (C) 2015 Altera Corporation. All rights reserved
*
* This program is free software; you can redistribute it and/or modify
* it under the terms and conditions of the GNU General Public License,
* version 2, as published by the Free Software ... | [
"wangcong15@mails.tsinghua.edu.cn"
] | wangcong15@mails.tsinghua.edu.cn |
0ea41f765c66c6f9614785575a19afc082668ec7 | ecb2d57efbbc66fc8fc2925a0b323921aa753022 | /src/selective_OLS_B.c | 355c0e347e68c7a6f7f3bc66bbcfb1530ec5ca96 | [] | no_license | cran/DESP | 4061c3e976b4dc31de4af9c6b2dbf3766ff0ca57 | 2aa2ecc69f210a4d02ffb836d9ddc57508228582 | refs/heads/master | 2021-05-04T11:23:00.139024 | 2017-02-02T10:33:51 | 2017-02-02T10:33:51 | 36,498,322 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 3,425 | c | /*
* DESP/src/selective_OLS_B.c by A. S. Dalalyan and S. Balmand Copyright (C) 2015-
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License (version 3) as published by
* the Free Software Foundation.
*
* This program is distributed in... | [
"csardi.gabor+cran@gmail.com"
] | csardi.gabor+cran@gmail.com |
7f0ce31b0666fa1d2ae84d6715e4431381d5b64b | 38f8330b9178a76c85aed3b04beb1dffc3cf3716 | /llvm/tools/clang/test/CodeGen/tvm/runtime/shakerSort.c | 49401f173cb11513ca3056c9fb465e7ed18ff611 | [
"NCSA"
] | permissive | EnoRage/TON-Compiler | 62cb61744756b71737c6a1482d414f35e571636c | a16d9976e8f2a87512162dd5415a54a6ace925f8 | refs/heads/master | 2020-08-24T23:35:14.486000 | 2019-10-17T08:37:26 | 2019-10-21T21:39:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,413 | c | // XFAIL: *
// #define NATIVE
// RUN: %clang -w -O3 -S -c -target tvm %s -o - | tvm-testrun --no-trace --entry test | FileCheck %S/shared.h
long ag[] = {1,7,4,3,0,716,74,2,5,9,23,24};
void shaker_sort(long array[], long size)
{
for (long left_idx = 0, right_idx = size - 1;
left_idx < right_idx;)
{
... | [
"dmitriy.borisenkov89@gmail.com"
] | dmitriy.borisenkov89@gmail.com |
d91e33ed4f7f7f0cf8ae836cca8b27efdee495af | 50a94b73065352573428c54c7f3b1c4c624006fc | /TileGame/Pods/Headers/Private/ImageFilesPicker/JVTRecetImagesCollection.h | 17f48656cf265c63110a6213d36251a75ef2f027 | [] | no_license | artlemonexample/tilegame | d2de5aa24ee349c8d63a5fd2ee5acd8b7b1514ab | 2535f99fe007169ba1ebd8d3fa5c3b551821e7b0 | refs/heads/master | 2021-01-19T23:39:48.102760 | 2017-05-10T17:51:00 | 2017-05-10T17:51:00 | 89,002,015 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 73 | h | ../../../ImageFilesPicker/ImagePicker/Resource/JVTRecetImagesCollection.h | [
"ak_lemon_school@mail.ru"
] | ak_lemon_school@mail.ru |
4f8967ef02b624ed01138eab8a0f58434dcc89fe | 63a8f67013aa020d0d5efa82747a4ba5a51aad34 | /GPIO REQ8/GPIO_REQ8/GPIO_REQ8/pushButton.c | 887d7bde3726d10d87495df873d156f56b2eb7ac | [] | no_license | ayaayman12/GPIO-Challenge | b11772928b5be839979ba0d709b77295014b9c7b | 4f9012a0f8a3d207af8f2050869dd4897e3bc7f5 | refs/heads/master | 2020-12-13T23:19:01.654239 | 2020-01-19T07:31:30 | 2020-01-19T07:31:30 | 234,560,867 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 2,808 | c | /*
* pushButton.c
*
* Created: 1/18/2020 6:08:45 PM
* Author: A_ayman
*/
#include "pushButton.h"
void pushButtonInit(En_buttonId_t en_butotn_id)
{
switch (en_butotn_id)
{
case BTN_0:
{
gpioPinDirection(BTN_0_GPIO, BTN_0_BIT,INPUT);
break;
}
case BTN_1:
{
gpioPinDirection(BTN_1_GPIO, BTN_1_B... | [
"Ayaayman765@gmail.com"
] | Ayaayman765@gmail.com |
e40d41873639b6f4a4ca632ae8aa80d2d21db50c | 52c30bcb59b50f12f6fada5a420f5f565937a317 | /(08) - Strings/1.c | 2c258703aa1a577a8024d5337a465b61fb80387c | [] | no_license | chaves04/Logica-de-Programacao | c539f7c6a6b283ce3f8b7c8157abf37da752da09 | f5bae17e7c4ef3c74b12a32bc28bf26099078e56 | refs/heads/master | 2021-01-19T00:17:52.403732 | 2017-03-25T23:58:29 | 2017-03-26T00:00:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 500 | c | #include <stdio.h>
#include <string.h>
int main(void){
char string_1[21], string_2[21], string_3[41];
int i, j, k;
scanf(" %[^\n]s%", string_1);
scanf(" %[^\n]s%", string_2);
i = 0;
while (string_1[i] != '\0'){
string_3[i] = string_1[i];
i++;
}
string_3[i] = ' ';
j... | [
"filipegb@live.com"
] | filipegb@live.com |
9bea324715c19916035a51483664211fe7c81e8c | 0595b944f6b7cab8ebd14f7a62c3198a468ee1d4 | /C/8kyu/Smallest/Smallest.c | 3ea0c395cd7b8c656b88cd914ed7403caf392c6d | [] | no_license | lfteixeira996/CodeWars | a43fcd5a0ef02b5b94c562b362a721b6cdcdb3bf | ccea8d1bd0675a7fba6895033125a1e846e3eacc | refs/heads/master | 2023-05-31T14:26:52.035027 | 2023-05-05T14:22:59 | 2023-05-05T14:22:59 | 157,246,040 | 0 | 0 | null | 2020-08-20T09:23:01 | 2018-11-12T16:51:42 | C | UTF-8 | C | false | false | 517 | c | /***************************************
#Name : Smallest
#Author : Luis Teixeira
#Date : 27-11-2018
#E-Mail : filipe.teixeira.996@gmail.com
*************************************************/
#include <stddef.h>
int find_smallest_int(int *vec, size_t len)
{
int i;
int small = vec[0];
//one approach
fo... | [
"filipe.teixeira.996@gmail.com"
] | filipe.teixeira.996@gmail.com |
7dcd9d4f4a85b904c95ec135b0af3eba236ee409 | 138d36f5d3fb91d7bb9fd5c74eaa43603c50a28f | /kalkulator/kalkulator/StosOperatorow.h | df4c0dabd0885a49e325c19eee74c5e9651bacfe | [] | no_license | wojciechmizera/Programowanie-Proceduralne | ebc75e50a0a5170ffb6bab13b2e6f1ea6039b2ec | f40c3fbcac92331728e829310309aa3c0eaf9cf3 | refs/heads/master | 2021-09-07T13:20:09.767383 | 2018-02-23T12:27:28 | 2018-02-23T12:27:28 | 116,169,748 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 239 | h | #pragma once
#include "stdafx.h"
struct CharStack
{
char key;
CharStack* next;
};
void Push(CharStack** stos, char znak);
char Pop(CharStack** stos);
int IsEmpty(CharStack* stos);
void Del(CharStack** stos);
char Top(CharStack* stos); | [
"hceicjow.arezim@gmail.com"
] | hceicjow.arezim@gmail.com |
4a430fa2a742a468b171507fddcd14d5cc16f0f0 | da98ca264af4a7b20ba77540d001c21b1518c8a9 | /C09/ex00/ft_swap.c | a129b240e87ac2ebb68eaeaf1f48fafe50056161 | [] | no_license | Sylsee/piscine_42 | 8a1901f48573efbed01b6fe76769a5e4638fc9d7 | c3d43fbba4166411fdda8a7b15a49fae44ee8aee | refs/heads/main | 2022-12-27T05:45:44.249046 | 2020-10-09T22:37:09 | 2020-10-09T22:37:09 | 300,419,178 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 968 | c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_swap.c :+: :+: :+: ... | [
"sylvio.poliart@gmail.com"
] | sylvio.poliart@gmail.com |
3f44fb2186b814f29c590696507708b18895ab1b | c08a26d662bd1df1b2beaa36a36d0e9fecc1ebac | /ode/inc/util.h | 614b0119fe830437fecaabf743f98451c4d86752 | [] | no_license | SymbianSource/oss.FCL.sf.mw.classicui | 9c2e2c31023256126bb2e502e49225d5c58017fe | dcea899751dfa099dcca7a5508cf32eab64afa7a | refs/heads/master | 2021-01-11T02:38:59.198728 | 2010-10-08T14:24:02 | 2010-10-08T14:24:02 | 70,943,916 | 1 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,973 | h | /*************************************************************************
* *
* Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
* All rights reserved. Email: russ@q12.org Web: www.q12.org *
* ... | [
"kirill.dremov@nokia.com"
] | kirill.dremov@nokia.com |
a47f59bdd9be8537978018ed31d3633c5a8293a8 | 616dffaee4877192183594a365917e47c6a157ee | /lib/strerr.c | af8d5720cf3ab01f83cd1ac92a647742229b4986 | [] | no_license | archibate/osys | 9137dcbb2116754075c8b1273a53bc72d125f987 | bea060cd53a6184739cf4cf624c472c7e89daa65 | refs/heads/master | 2020-04-04T23:18:37.807610 | 2018-11-26T04:55:03 | 2018-11-26T04:55:03 | 156,354,106 | 3 | 0 | null | null | null | null | UTF-8 | C | false | false | 3,821 | c | static
const char *err_msgs[] = {
"success",
"Operation not permitted",
"No such file or directory",
"No such process",
"Interrupted system call",
"I/O error",
"No such device or address",
"Argument list too long",
"Exec format error",
"Bad file number",
"No child processes",
"Try again",
"Out of memory",
... | [
"m17721388340@163.com"
] | m17721388340@163.com |
4888df4b5efbf4205b17e92a4a688dea692b59d1 | b1d500a451cd9852089bf3d97e829df069daa9c8 | /Images/MC/Acceptance/truth/2DRatios/MomentumBinned/S18_AcceptanceSurfacePhi_0_250.C | fd1bba485edfa400f983a9d85ecd0330ecd04185 | [] | no_license | sam-grant/EDM | 486ea029bf766c968a3c7b41198ffcf9bc3c9b8a | 525e41de5f675c39014488c79144f47562910736 | refs/heads/master | 2022-10-30T22:35:42.979799 | 2022-10-19T18:44:54 | 2022-10-19T18:44:54 | 296,421,806 | 0 | 1 | null | null | null | null | UTF-8 | C | false | false | 8,971,218 | c | #ifdef __CLING__
#pragma cling optimize(0)
#endif
void S18_AcceptanceSurfacePhi_0_250()
{
//=========Macro generated from canvas: c/c
//========= (Tue Sep 6 16:27:16 2022) by ROOT version 6.26/04
TCanvas *c = new TCanvas("c", "c",0,0,800,600);
c->SetHighLightColor(2);
c->Range(nan,nan,nan,nan);
TView *vie... | [
"samuel.grant94@gmail.com"
] | samuel.grant94@gmail.com |
46d1e122fc8bd58d5f33f0aed0fff939e8d5a8c4 | 5de4b5afdf301e9d21d0a59db50b6183ee9e4b46 | /src/actors/squirrel_const.h | 1fba66bf9518e039b3aecae81fa1a75a656ff72b | [] | no_license | cameroncurry/Squirrels | 516baeefc460a49c3742aab3a4c1b4294674e521 | 63d5c69647a60ceec008ae84d9a473308f3ea872 | refs/heads/master | 2021-01-10T12:55:48.943136 | 2016-03-31T19:08:21 | 2016-03-31T19:08:21 | 53,144,902 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 410 | h | #ifndef SQUIRREL_CONST_H
#define SQUIRREL_CONST_H
#define MASTER_ACTOR 100
#define GRID_ACTOR 101
#define SQUIRREL_ACTOR 102
#define INFECTED_SQUIRREL_ACTOR 103
#define NEWBORN_SQUIRREL_ACTOR 104
#define GRID_SHUTDOWN 105
#define GRID_NEW_MONTH 106
#define SQUIRREL_BIRTH 107
#define SQUIRREL_DEATH 108
#define SQUIRR... | [
"cameroncurry@Camerons-MacBook-Pro.local"
] | cameroncurry@Camerons-MacBook-Pro.local |
193c13e0e0a478b4f8ae110e5113eb2db418e96f | 94e8344ee420ae4d2eb1643e95973845f341a3d2 | /gcc_4.3.0_mutants/mutant101894_tree-ssa-loop-ivopts.c | 1d5f4087faaed9ce11a9b149ca17cfb57980795d | [] | no_license | agroce/compilermutants | 94f1e9ac5b43e1f8e5c2fdc17fa627d434e082f3 | dc2f572c9bfe1eb7a38999aaf61d5e0a2bc98991 | refs/heads/master | 2022-02-26T21:19:35.873618 | 2019-09-24T15:30:14 | 2019-09-24T15:30:14 | 207,345,370 | 1 | 0 | null | null | null | null | UTF-8 | C | false | false | 140,709 | c | /* Induction variable optimizations.
Copyright (C) 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either versio... | [
"agroce@gmail.com"
] | agroce@gmail.com |
4d7fd7de8e5b2091703d98060a135fa8e13d4a07 | 950ea7cd54ef2911e92447cfae1ec80d0838474e | /tetris_final_quartus/software/tetris/main.c | f4f5692a24f835aef2bd7652f7712b78353fb4b4 | [] | no_license | kushxg/ece385 | ea93ae032586982bc97679dc9ab8f16b08e2cb58 | 0af1a6c40eaa8ab967f2f29f9b93256456728642 | refs/heads/master | 2022-11-29T23:06:06.253122 | 2019-12-09T23:13:25 | 2019-12-09T23:13:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 17,573 | c | /*---------------------------------------------------------------------------
-- main.c --
-- Christine Chen --
-- Ref. DE2-115 Demonstrations by Terasic Technologies Inc. --
-- F... | [
"kg3@illinois.edu"
] | kg3@illinois.edu |
24f418f77154b86764c1d406487a9f0d75916c0f | a6c5acfd73a40b25576e751fa4efd26b1ad2db70 | /niudan_src_new V2.9.21.7.3 leyaoyao/src/wifi.h | 3540e9bc19ce828185c249d566bba01c4230df75 | [] | no_license | c2194/ndjlyy | 58824e5aadebf52594b9c83f258e228776582d15 | 582585504ff2678737668fa0e7ad2385e1d68a2b | refs/heads/main | 2023-07-01T01:22:09.818132 | 2021-07-26T09:43:37 | 2021-07-26T09:43:37 | 389,578,791 | 0 | 0 | null | null | null | null | GB18030 | C | false | false | 1,301 | h | #ifndef __wifi_H
#define __wifi_H
#include "sys.h"
#include "delay.h"
extern u8 ICOMMAND;
extern u8 Internet_Linked ;
int Re_Str(char *InStr , char *reStr, char *chSrt,int lo);
int Re_Str2(char *InStr , char *reStr, char *chSrtSt ,char *chSrtEn);
int Re_Str3(unsigned char *InStr ,char *chSrtb);
void Wm_State(void)... | [
"c2194@qq.com"
] | c2194@qq.com |
ee7b76e0b65e31d3dbcbbcb57c8b0145d83f8509 | 7093bb58e18d0242849e7f66fe6ba7332f81dceb | /spatial/metadata.c | a8d125ee9980c37764af114f442f9c0e35b80701 | [] | no_license | priyankaDhingra/spatial-memory-protection | b2843df6bd720b0eb6e43b1460ffbf7c8e2efb05 | 76f96718da517dd6bbc03049a85775543f187300 | refs/heads/master | 2020-06-04T21:00:44.192661 | 2015-07-24T06:05:26 | 2015-07-24T06:05:26 | 37,633,276 | 0 | 1 | null | null | null | null | UTF-8 | C | false | false | 2,731 | c | /*
* metadata.c
*
* Created on: Jun 28, 2015
* Author: priyanka
*/
#include<stdio.h>
#include <stdlib.h>
#include <fcntl.h>
#include <string.h>
#include <sys/mman.h>
#define TRIE_PRIMARY_TABLE_ENTRIES (size_t)(8*1024*1024)
#define TRIE_SEC_TABLE_ENTRIES (size_t)(8*1024*1024)
int secondary_table_exists = 0;
... | [
"priyanka@Priyankas-MBP.home"
] | priyanka@Priyankas-MBP.home |
aebdde1e94c7ae54ead06f7a40c7b77344996f7e | c7805dedbe45f7d03745cae5e1502a17a58e2962 | /gassm2/gassm2.c | 8ff30df1e104a2ff4a91aef830dc89a273ca9190 | [] | no_license | MartinDrab/Genetics | 93f4ed333fcf05213e2ce9cb531004eaccede52c | d76811ed30dec492c1cad5e0abbc203c746809ee | refs/heads/master | 2020-05-21T20:03:16.722621 | 2017-09-05T19:09:54 | 2017-09-05T19:09:54 | 42,058,817 | 7 | 1 | null | null | null | null | UTF-8 | C | false | false | 29,774 | c |
#include <omp.h>
#include <stdio.h>
#include <inttypes.h>
#include <assert.h>
#include <stdlib.h>
#include <math.h>
#ifdef _WIN32
#include <direct.h>
#else
#include <sys/stat.h>
#endif
#include "tinydir.h"
#include "err.h"
#include "utils.h"
#include "kthread.h"
#include "utils-lookaside.h"
#include "file-utils.h"
#in... | [
"martin.drab@email.cz"
] | martin.drab@email.cz |
88bbf8ad3950b3305e8c3a209133452ee1762f23 | e721b3c2d62d47e48f7329e7f256198ab0876292 | /butterfly/ADC.c | 14a2dbfd9723e68529f251978f89efc07e67e2a7 | [] | no_license | nathanpegram/butterfly-atmel-studio | 0740c2363694e3b5a7456e580aaee3a6cec70b1c | fb5271673d20a44aed88073f819ee2cb668eda1b | refs/heads/master | 2021-05-04T07:54:34.160653 | 2016-10-12T17:57:18 | 2016-10-12T17:57:18 | 70,726,364 | 3 | 2 | null | null | null | null | UTF-8 | C | false | false | 16,228 | c | //***************************************************************************
//
// File........: ADC.c
//
// Author(s)...: ATMEL Norway
//
// Target(s)...: ATmega169
//
// Compiler....: AVR-GCC 3.3.1; avr-libc 1.0
//
// Description.: AVR Butterfly ADC routines
//
// Revisions...: 1.0
//
// YYYYMMDD - VER. - COM... | [
"nathan.pegram@gmail.com"
] | nathan.pegram@gmail.com |
cf09b865949beada453554f368f9ddaa1727fb9b | 54a138e84d6e092379d3b842dffc42b2b5062d13 | /DP/2096/2096.c | 5d8822c940b34d972a137bca54d0fa03c336e801 | [] | no_license | junheeyoon/Backjoon | b0d2663ab1fbea9640a39c6dc2fabd2fcbb1c145 | db54034ef5f456556e7d472c216b283b20fc7267 | refs/heads/master | 2020-03-23T07:03:36.857177 | 2018-08-20T14:21:09 | 2018-08-20T14:21:09 | 141,245,474 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 961 | c | #include <stdio.h>
int maxDp[100001][3];
int minDp[100001][3];
int check[3];
int maxValue;
int minValue;
int min(int a, int b){
if( a > b ) return b;
else return a;
}
int max(int a, int b){
if( a > b ) return a;
else return b;
}
int main(void) {
int N;
scanf("%d", &N);
for(int i = 1; i <= N; i++){
scanf("%d %d... | [
"enteryjh@ajou.ac.kr"
] | enteryjh@ajou.ac.kr |
a855bfcd76ca0c8ea41553b3fcf72f23b2acffbe | 264cc34d1d5322c9c955f351e5ed710836f6a1a5 | /cmake_targets/lte_build_oai/build/CMakeFiles/RRC_Rel14/CarrierFreqUTRA-TDD.c | 42c29ff5cca3d5fef78a424556165b6a37047ebe | [
"BSD-3-Clause",
"BSD-2-Clause",
"LicenseRef-scancode-warranty-disclaimer",
"LicenseRef-scancode-unknown-license-reference",
"LicenseRef-scancode-generic-cla"
] | permissive | mr-ytseng/openairinterface5g | 8d40a768b2046da8c521f58d34c0466226f1c154 | 54d541c22cdfcb774774089291c93e4e79294a1d | refs/heads/master | 2021-10-27T20:56:33.843199 | 2019-04-19T15:37:55 | 2019-04-19T15:37:55 | 177,127,103 | 0 | 1 | null | null | null | null | UTF-8 | C | false | false | 5,234 | c | /*
* Generated by asn1c-0.9.29 (http://lionet.info/asn1c)
* From ASN.1 module "EUTRA-RRC-Definitions"
* found in "/home/user/openairinterface5g/openair2/RRC/LTE/MESSAGES/asn1c/ASN1_files/lte-rrc-14.7.0.asn1"
* `asn1c -pdu=all -fcompound-names -gen-PER -no-gen-OER -no-gen-example -D /home/user/openairinterface5g/c... | [
"yuchia.tseng@irt-systemx.fr"
] | yuchia.tseng@irt-systemx.fr |
341bf95f1c03a291e19cfa1c99e5321f40ed6edd | 04c8d8da9cebc13513c1b9c7658707ecadfa0ed3 | /Roll a Ball/Temp/il2cppOutput/il2cppOutput/mscorlib_System_Collections_Generic_List_1_Enumerator_gen_66MethodDeclarations.h | 8bafa498dbb76dc3663be73247d8e1a34a513dcb | [] | no_license | fkieyhzen/RollABall | ed9ef9e93f3cfaecd2be10013797e97e9c1e479e | f083b660966094939ed2b5d2028e31bb4e86a67e | refs/heads/master | 2023-03-19T18:19:11.437779 | 2015-06-08T15:27:45 | 2015-06-08T15:27:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 2,542 | h | #pragma once
// System.Collections.Generic.List`1/Enumerator<System.Collections.Generic.IList`1<Parse.ParseACL>>
struct Enumerator_t7021;
// System.Object
struct Object_t;
// System.Collections.Generic.IList`1<Parse.ParseACL>
struct IList_1_t1800;
// System.Collections.Generic.List`1<System.Collections.Generic.IList`... | [
"patrick@beetheswarm"
] | patrick@beetheswarm |
a570a7bfdd2cc2829764a46d3e7201dc45d4fda1 | 2844cec789c9d335a8905435f187644faa9a6b0b | /src/consensus/consensus.h | 9de30229c053b54674506b1710609f30c15b4555 | [
"MIT"
] | permissive | Nugroho2534/zixxcore | db1340a6cf9146945ad168460f41d57ce2df113c | 4db1e8cc415abc133149393239ff9fb9c42e675c | refs/heads/master | 2020-04-22T04:52:15.935394 | 2018-12-18T17:36:13 | 2018-12-18T17:43:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,346 | h | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2015 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#ifndef BITCOIN_CONSENSUS_CONSENSUS_H
#define BITCOIN_CONSENSUS_CONSENSUS_H
/** ... | [
"dev@zixx.org"
] | dev@zixx.org |
c15f3645bef4b2ee744154361273dadcf210d169 | 0422a2babc7366f446b7e3a3c431bfd3bf5459d7 | /libft/libft.h | fc666219477b0bd8ab0a79a99657e35ae10ab48a | [] | no_license | lsjoberg98/Fillit | 09b75a5dc2dad9883988e5490aefb1ce507eb8c4 | 564d4e053212722ae232b714a79becb6fc8b931b | refs/heads/master | 2021-02-05T16:05:37.242476 | 2020-09-11T11:28:46 | 2020-09-11T11:28:46 | 243,800,962 | 1 | 0 | null | null | null | null | UTF-8 | C | false | false | 3,910 | h | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* libft.h :+: :+: :+: ... | [
"lucasjoberg@gmail.com"
] | lucasjoberg@gmail.com |
4fff8ff20a1e581d1245462bd333f167c599201d | 4a94716b2bf98f2aa3babdd225960cec0497d546 | /makingfunxyz-esp8266-NONOS/4.WebControlLED/app/user/user_webserver.c | bf509ba9fd702d4fa5ced9852a22852bbee50f14 | [
"MIT"
] | permissive | 408881465/makingfunxyz-esp8266 | 36b4b6acfc409007dd88dc9efd6c1e7e3a016649 | 96b47a6d8a299643ffd337f195983fd05547094c | refs/heads/master | 2020-04-21T16:10:23.880598 | 2018-12-26T14:38:29 | 2018-12-26T14:38:29 | null | 0 | 0 | null | null | null | null | GB18030 | C | false | false | 14,135 | c | /*
MIT License
Copyright (c) 2018 imliubo
Base On Dave Gamble and cJSON contributors
Github https://github.com/imliubo
Website https://www.makingfun.xyz
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the S... | [
"imliubo@makingfun.xyz"
] | imliubo@makingfun.xyz |
d5b57dca069fd9b50d6c7e19d2539d7814ddfe5f | 6119eb6af4643aeb511e33a30ff27aa4d467e5f7 | /Lab 4 Battleship Completed/battleship-4/EIFGENs/battleship/W_code/C3/ev1055d.c | 9822af3a0ffbd98f3565001153acbea78b9ee640 | [] | no_license | TheHackerGenesis/EECS-3311 | b197e6a470bfeaf8e3cb9e7c3e1ce8afd05032e7 | 858d6c0e71e31c8dba6dd3abc05fca79e49d0130 | refs/heads/master | 2022-01-20T04:18:07.883224 | 2019-06-28T11:36:52 | 2019-06-28T11:36:52 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 3,172 | c | /*
* Class EV_PARAGRAPH_CONSTANTS
*/
#include "eif_macros.h"
#ifdef __cplusplus
extern "C" {
#endif
static const EIF_TYPE_INDEX egt_0_1055 [] = {0xFF01,232,0xFFFF};
static const EIF_TYPE_INDEX egt_1_1055 [] = {0xFF01,245,1054,0xFFFF};
static const EIF_TYPE_INDEX egt_2_1055 [] = {0xFF01,1054,0xFFFF};
static const ... | [
"kishanpatel12@gmail.com"
] | kishanpatel12@gmail.com |
5ce526f73483b6144cfbdbd5006e882fc8e06814 | e25c8b65c0115053b14f8ecffaea94a964eefa1f | /ds/open/world1/cominging/area2/npc/fort_g.c | edc8ceb966a66bda12b0f11862147582ca963fbe | [] | no_license | zwshen/mudos-game-ds | c985b4b64c586bdc7347bd95d97ab12e78a2f20f | 07ea84ebdff5ee49cb482a520bdf1aaeda886cd0 | refs/heads/master | 2022-03-01T14:55:10.537294 | 2022-02-15T15:41:26 | 2022-02-15T15:41:26 | 244,925,365 | 4 | 1 | null | 2022-02-15T15:41:27 | 2020-03-04T14:44:49 | C | BIG5 | C | false | false | 1,397 | c | #include <ansi.h>
inherit NPC;
string drink();
string eat();
void create()
{
set_name("哨崗士兵", ({ "fort guard","guard" }) );
set("long",
"守衛塔頂樓的士兵，看察步靈城四周景象，戴著一付沉重的\n"
"鐵頭盔，所以看不清楚他的容貌，他瞪視著遠方，站著挺挺\n"
"的，一付精神毅毅的樣子。\n");
set("level",34+random(2));
set("age",30+random(3));
set("chat_chance_combat",120)... | [
"zwshen0603@gmail.com"
] | zwshen0603@gmail.com |
d8287f076c2bbd2d8c9f39bf01482be3937cd9fc | 16d48e992ed394ffd15f33958882e67837084a63 | /push_swap/src/stack_b_actions.c | 15158d4f820b6b64d6345f84529876ed819fb55b | [] | no_license | f0lio/push_swap | 4641795516d38f67bf9abd44d9d9629c21f09c84 | 58bb54f03b9c1fbfbb6c8aef26170ab3cc949641 | refs/heads/master | 2023-07-24T14:41:06.413138 | 2021-09-14T09:22:08 | 2021-09-14T09:22:08 | 405,313,103 | 1 | 0 | null | null | null | null | UTF-8 | C | false | false | 617 | c |
#include "push_swap.h"
void push_to(t_env *env, char stack_name)
{
if (stack_name == 'A')
push_a(env);
else if (stack_name == 'B')
push_b(env);
}
void swap_b(t_env *env)
{
swap_stack(&env->b);
SWAP_B;
}
void push_b(t_env *env)
{
t_stack *a;
t_stack *b;
a = env->a;
b = env->b;
if (a->stack ==... | [
"36214338+f0lio@users.noreply.github.com"
] | 36214338+f0lio@users.noreply.github.com |
7bdfccc4202b2787713941679123d46cf385082c | 7dfc46875f918916849fbb5601a434ad22bc1bcd | /shared/definitions.h | 17998367b1389670a73ce9db990ba72bcd156010 | [] | no_license | tysseng/controllerblocks | 1ed6112b8018d5062b4e32ece1d4a383cca5c80f | a5ba6364bab8bc4d71c8102c8154ead6ecef7934 | refs/heads/master | 2021-01-22T05:21:03.316578 | 2014-05-11T12:56:37 | 2014-05-11T12:56:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 366 | h | #ifndef _DEFINITIONS_H
#define _DEFINITIONS_H
//External storage
#define DONT_SEND_ACK 0
#define SEND_ACK 1
//Controller timers
#define TIMER0_SOURCE_TAP_TEMPO 0
#define TIMER0_SOURCE_KEY_REPEAT 1
#define TIMER0_SOURCE_DIAL_SPEED 2
// interrupt control
#define DISABLE_ALL_INTERRUPTS INTCON.GIE=0
#defin... | [
"joakim@tysseng.no"
] | joakim@tysseng.no |
e5a12769a05e061d482563c107f55e940184ecbe | 93de7999d11432b7ecaa8383df63310afa9f62b3 | /DOS/CMD/debug/MKTABLES.C | 46a1076b482210e20f333f06ba357ac0e6899cca | [
"LicenseRef-scancode-public-domain",
"BSD-3-Clause"
] | permissive | haizzus/SYSTEM-OS-OSFree | bc5745cf4192f3d8d8a59c7369c9a029fd071f3f | 20d79864a58cb7f1abe1622dfb259b99750dbeff | refs/heads/master | 2023-07-25T00:57:10.812543 | 2015-04-15T17:19:54 | 2015-04-15T17:24:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 28,170 | c | /*
* This program reads in the various data files, performs some checks,
* and spits out the tables needed for assembly and disassembly.
*
* The input files are:
* instr.set Instruction set
* instr.key Translation from one- or two-character keys to
* operand list types
* instr.ord Ordering relations to en... | [
"miturbide@nextstep.com.ec"
] | miturbide@nextstep.com.ec |
baa995ec97f79b7237e5cb69d50d20f2dd4c4bf4 | 5c84fa4aba1207b5dc6125455f8cf5118b42ebf0 | /os161/kern/fs/sfs/sfs_vnode.c | 1dcd64789be126a28e28e2bbc024f723c665f5a1 | [] | no_license | vamsi3296/hcs | b9b3628eb0ecba64fab82b2ddc2b37e16c854e68 | 45c5b9583c1e51a676b13a42e1ed773b66f6f147 | refs/heads/master | 2021-01-01T16:53:29.152009 | 2017-07-21T11:59:27 | 2017-07-21T12:03:13 | 97,943,469 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 37,234 | c | /*
* Copyright (c) 2000, 2001, 2002, 2003, 2004, 2005, 2008, 2009
* The President and Fellows of Harvard College.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain ... | [
"vamsikrishna3296@gmail.com"
] | vamsikrishna3296@gmail.com |
9ef9ed50e0ade7185e3cb3887cb4f001a920d862 | 28632387e1b38b4a7cdfdc4b0c37a89ab8e272bc | /Linguagem c c++/Vetores String e Matrizes/string.c | 26fc6abf29fc006bea8cf9803e9cdbb20392259c | [] | no_license | MTFrias/Linguagem-C | 43bf31ce2d02a7c5e750093d0ec7405948dd3938 | 619394e82ff5242ce96e00af023d40125a4b96ef | refs/heads/master | 2020-12-08T21:56:27.867240 | 2020-01-10T19:35:18 | 2020-01-10T19:35:18 | 233,106,181 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,173 | c | #include <stdlib.h>
#include <stdio.h>
#include <string.h> //biblioteca que tem a função strlen, para limpar o excesso de momoria não utilizada
int main()
{
char palavra[255];
printf("Digite uma palavra \n");
//limpar o buffer do teclado em primeiro lugar
setbuf(stdin, 0); // stdin é standard input ... | [
"miguelfrias16@gmail.com"
] | miguelfrias16@gmail.com |
5ad58b75b29f2d1b0c6f61d7547c46f78fb2ede3 | 9718311487693a7f348a3de2f1d75e43bcaf5b9d | /heaps/main.c | 9a328fe6944fc5a5e888977b620b6819bf840162 | [] | no_license | Roymprog/datastructuren | 7a0f46ced9aae69d26182ab74670222ef663cb8d | 35deee801913aae6a9583de78cb5d69adbef61bf | refs/heads/master | 2020-04-04T13:37:34.200112 | 2018-12-14T21:27:26 | 2018-12-14T21:27:26 | 155,968,968 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 5,580 | c | #include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <getopt.h>
#include "prioq.h"
#define BUF_SIZE 1024
static char buf[BUF_SIZE];
struct config {
// You can ignore these options until/unless you implement the
// bonus features.
// Set to 1 if -y i... | [
"royvsanten@gmail.com"
] | royvsanten@gmail.com |
eb1b36cb0be5c9730bcae1c0f82c15c5aab4542f | c52337f3eccdb3a9ca7e067e622b91d20931628f | /login-database/app.c | 1ae58812491998dbb714ae9ba0f39bd3bccf89df | [] | no_license | fairhopeweb/appweb-samples | 29f2ebe621e8f935df84a78e1bf8b584c91e4dae | 04ef7f56b7cf5ca4957a58a6c02e1871c1549c80 | refs/heads/master | 2023-08-04T02:21:59.602425 | 2021-09-27T21:41:40 | 2021-09-27T21:41:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 2,609 | c | /*
app.c - Application code to manage authentication
*/
#include "esp.h"
/*
Common base run for every request.
*/
static void commonBase(HttpStream *stream)
{
cchar *uri;
if (!httpIsAuthenticated(stream)) {
/*
Access to certain pages are permitted without authentication so the ... | [
"dev@embedthis.com"
] | dev@embedthis.com |
a91b2039627be6a354b2cd10faaa45bb114d1fc7 | 1cc5d45273d008e97497dad9ec004505cc68c765 | /cheatsheet/ops_doc-master/Service/cfaq/example_c/minheap_c_2/heap.h | 7b3f19f75848b341c9726144e574b6cf7ff2c4a9 | [] | no_license | wangfuli217/ld_note | 6efb802989c3ea8acf031a10ccf8a8a27c679142 | ad65bc3b711ec00844da7493fc55e5445d58639f | refs/heads/main | 2023-08-26T19:26:45.861748 | 2023-03-25T08:13:19 | 2023-03-25T08:13:19 | 375,861,686 | 5 | 6 | null | null | null | null | UTF-8 | C | false | false | 813 | h | #ifndef __HEAP_H__
#define __HEAP_H__
#include <errno.h>
#include <stdlib.h>
typedef struct heap_node_s {
long int index;
void *data;
} heap_node_t;
typedef struct heap_s {
heap_node_t **heap;
long int size;
... | [
"wangfl217@126.com"
] | wangfl217@126.com |
709414ed759602a6f6e62bed372f0a518d2ac2be | dfa39c783b1a522dd757f75ae5cede0c13596e07 | /UNIDAD 1/Ejercicio 75/gun.c | 09bfca64d207e20988db12e3a83da3d365cf818b | [] | no_license | Jos3GS/SO-2021 | 963c9f327e167f4441fd6baa016e1d812b809776 | 5b6bcd970ae34ae41e8cfe843799735698142139 | refs/heads/main | 2023-04-08T10:33:14.944471 | 2021-04-19T19:25:12 | 2021-04-19T19:25:12 | 334,157,694 | 1 | 0 | null | null | null | null | UTF-8 | C | false | false | 816 | c | #include <stdlib.h>
#include <stdio.h>
typedef int bool_t;
// Attribute structure
typedef struct {
int bullets;
} gun_t;
// Memory allocator
gun_t* gun_new() {
return (gun_t*)malloc(sizeof(gun_t));
}
// Constructor
void gun_ctor(gun_t* gun, int initia... | [
"gutierrez.sossa.j@gmail.com"
] | gutierrez.sossa.j@gmail.com |
c29fe01855ac0a7a77486d104c2b6439bb6a3b71 | c06a3fb05d9f27ec37eff46d7b104c758449b202 | /practice-曾经的练习程序/vedio/002Linux-C从入门到精通/059.c | 965d1fa7c68e324b7acc67d53c5445a74ceae78f | [] | no_license | xumenger/xumenger.github.shit | ceabdf1da3ad19c9e1583d36d40f2729562d8af6 | dfb691bcbb10695368522324d6429b7f69f11333 | refs/heads/master | 2020-12-26T00:26:34.034917 | 2016-07-27T15:21:53 | 2016-07-27T15:21:53 | 35,945,793 | 2 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,102 | c | #include<sys/types.h>
#include<sys/socket.h>
#include<netinet/in.h>
#include<arpa/inet.h>
#include<unistd.h>
#include<stdio.h>
#include<stdlib.h>
#define PORT 2345
int main(void)
{
int sockfd, newsockfd;
struct sockaddr_in addr;
int addr_len = sizeof(struct sockaddr_in);
if((sockfd = socket(AF_INET, SOCK_STREAM, ... | [
"xumenger@126.com"
] | xumenger@126.com |
f566ab66d81dc72f35c3cbc11e79114e0358ff27 | c3ad19b5970e66c8e5fdf1874e01841145b8faf0 | /Src/syscalls.c | 062e18c1aeaa74627ae08855a86c37e2c9a33d9e | [] | no_license | rirethy/InternetCareConnectedPlug | de07ee3fa279e2370515203c43d0957ef420d7a1 | 9a0bddd5775329adedd540a015825cdb42d73a8a | refs/heads/master | 2021-06-07T12:22:33.445511 | 2018-06-03T17:50:36 | 2018-06-03T17:50:36 | 135,839,068 | 0 | 1 | null | 2020-03-08T00:42:22 | 2018-06-02T17:40:12 | C | UTF-8 | C | false | false | 7,034 | c | /**
******************************************************************************
* File Name : syscalls.c
* Description : Support files for GNU libc. Files in the system
* namespace go here. Files in the C namespace (ie those
* that do not start ... | [
"projects@makethis.fr"
] | projects@makethis.fr |
816a1ef2accfd9316179afc706f869fbcdca1ac6 | 7a1f13e0711cc7b9f9b88863ebfebc824a9cf50b | /COMRED/Grafos/matrixavg.c | 9cd6b25876c9d898a5b13eaa29be77a9c16da363 | [] | no_license | JulioC/UFABC | aa21fc2a916286fe4d9f70d9cd143be2f2ed9633 | 5d880b7489b7349b0279b41bd8dcd961e428c8de | refs/heads/master | 2020-08-05T03:39:33.664286 | 2011-06-28T21:16:14 | 2011-06-28T21:16:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 597 | c | /*
* matrixavg
*
* Get the average of the values in a matrix
*
* Input:
* The number of rows and columns in the matrix, followed by n*n values
*
* Output:
* Average value
*/
#include <stdio.h>
int calc(int nodec, int *paths);
int main(int argc, char *argv[]) {
int aux, dim, dimq, i;
long int sum = 0;
... | [
"mail@thejcs.com.br"
] | mail@thejcs.com.br |
560bd7105712fa02fef6fd7b1549ba0f4970d8ba | 5ddc6cd75cd0b28118d73994aeedb3849b1a3f69 | /Project_Headers/scripts.h | cc4e5bf58e2f9506560d8fa6ce364da9880c0698 | [] | no_license | jimherd/Robokid_bot | 5a1103bbe1a6c8c85ed8ce9a82612326b3993cc7 | 6d64720def74b37157da22aeca48527551e703de | refs/heads/master | 2016-08-04T10:30:39.636891 | 2012-08-14T21:15:34 | 2012-08-14T21:15:34 | 1,682,713 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 202 | h | /*
* scripts.h
*
* Created on: 24-May-2011
* Author: jim
*/
#ifndef SCRIPTS_H_
#define SCRIPTS_H_
extern const char script_example[];
extern const char script1[];
#endif /* SCRIPTS_H_ */
| [
"jtherd@gmail.com"
] | jtherd@gmail.com |
dc50c76e4f3cf9cf8bc6cd519e79fb837181708c | 29a39f120f407d4be742a68f0964f67a75d278fc | /CSC214/InClass/01_25/pointers.c | f9627b72684c517672faa362769d04925a05f49f | [] | no_license | zezhyrule/school | 2bb73889a9b3f3c76683c86d2be02ce7519325a0 | 5d31860014bf77c1a21fe3d34ef13ef5ea5036d5 | refs/heads/master | 2021-05-03T18:23:05.365283 | 2017-12-14T20:20:00 | 2017-12-14T20:20:00 | 71,940,255 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 608 | c | #include<stdio.h>
#include<stdlib.h>
// updated comments will be online
int main(int argc, char **argv)
{
int num, i, *ptr, sum = 0;
printf("Enter number of elements: ");
scanf("%d", &num);
ptr = (int*) malloc(num * sizeof(int)); // memory allocated
if (ptr == NULL)
{
printf("Error! Memory not allocated.")... | [
"cs214107@cs.sfasu.edu"
] | cs214107@cs.sfasu.edu |
8c9ae4eb9ca5a0a79795f9a40030a58d78251fbb | 2fdc7552e7404636aacbdd65357b3a3fa8788789 | /H1.h | 1447c828ee41e3f99f1b64e22db16106eb5b849a | [] | no_license | AshishV123/Data-Structures-Project | c8decdf59f5c59c534e708c501c494d16845463e | cbb05c982378e412c93b72986ec50f33e4d4013b | refs/heads/master | 2021-08-31T17:38:39.729346 | 2017-12-22T08:22:22 | 2017-12-22T08:22:22 | 115,093,799 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 17 | h | #include"H13.h"
| [
"noreply@github.com"
] | AshishV123.noreply@github.com |
4548fbacdf4e34263040ee15cf84e38092c2a09f | 5b506b0f77a4e86b7b6c7002579c99591074d337 | /pilacarlos.c | e1a3455d5f8fe573202556436fafd44c234e0cf8 | [] | no_license | Carlos222Cuellar/ejerciciosC | 04fd135eeead121fc28d5fc72aecd29d652c3b6e | 685f1e741744d8cb1c26e01b8e90cff46c712f08 | refs/heads/master | 2021-08-08T00:46:16.143933 | 2017-11-09T07:53:34 | 2017-11-09T07:53:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,415 | c | #include <stdio.h>
#include <stdlib.h>
typedef struct nodo{
int dato;
struct nodo *siguiente;
}tiponodo;
typedef tiponodo *pNodo;
typedef tiponodo *Pila;
void insertar(Pila *pila, int num);
int eliminar(Pila *pila);
int main() {
int opcion;
int num;
Pila pila=NULL;
do{
printf("\n");
printf("\t***M... | [
"noreply@github.com"
] | Carlos222Cuellar.noreply@github.com |
b78f17161ef03e934c8399d965496971535e1fd5 | b28fdd2821255b7ab2d348481b1af550c4bfbac6 | /src/parseur/parseur2.c | 37291fce9b82cc3b11e312c363f917da34a10e25 | [] | no_license | julian-ladjani/wolf3d | cf621b59e14f2e98834bfd02fafcb39d41290a82 | 37c5d65e156deaffbee840a38372dfc1c703372a | refs/heads/master | 2021-07-02T01:34:23.740605 | 2017-09-20T22:54:27 | 2017-09-20T22:54:27 | 104,275,740 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,605 | c | /*
** parseur2.c for wireframe in /home/julian-ladjani/delivery/CGP/wireframe/src/parseur
**
** Made by Julian Ladjani
** Login <julian.ladjani@epitech.eu>
**
** Started on May Dec 8 14:41:15 2016 Julian Ladjani
** Last update Feb Dec 12 01:55:49 2016 Julian Ladjani
*/
#include "my.h"
int my_strcmp(char *s1, char ... | [
"julian.ladjani@epitech.eu"
] | julian.ladjani@epitech.eu |
55c6953d41a7858e0988819ee01b9b972cadae2a | d2a7f87f86dcabb6891003a96e76dfa921037339 | /Estrutura de dados/Pesquisas/ordenação.c | e0ffe473271e4bc7accf0cb5c49bcf6fa8d9163a | [
"MIT"
] | permissive | dudu1626/Programacao-em-C | d59f6eb7c6143cd83704e600eb02acc1a8b06bdf | 61850087e5d3172c0e1d165b99c34dda8a80ebb6 | refs/heads/main | 2023-03-26T12:38:49.963623 | 2021-03-27T01:47:20 | 2021-03-27T01:47:20 | 351,952,382 | 0 | 0 | null | null | null | null | ISO-8859-1 | C | false | false | 528 | c | // algoritmo de ordenação
#include <stdio.h>
#include <stdlib.h>
#define tamanho 10
int main (){
int vetor[] = {50, 80, 2, 10, 8, 79, 88, 7, 88, 2};
int aux, i, j;
for( i=0; i<tamanho-1; i++ ){
for( j=i+1; j<10; j++ ){
if( vetor[i] > vetor[j] ){
aux = veto... | [
"dudu_1626@hotmail.com"
] | dudu_1626@hotmail.com |
61774a310c0b7807e4af4136e23d7fabf7be216c | 31090b82fcf15fc8a52a12be3dd592e72300fe1b | /sys/arm/broadcom/bcm2835/bcm2835_gpio.c | 7bb841fd5ae846995731d3141d367bb35c94026b | [] | no_license | YuheiTakagawa/VPS_for_FreeBSD | 22e7b2f4e46b56e8289e7cd81eedf1d503ec2a0d | 1a6d0ed8808b875b998f2f344cfc5539eb84532d | refs/heads/master | 2020-07-15T09:24:26.928246 | 2017-08-11T17:43:29 | 2017-08-11T17:43:29 | 94,305,728 | 2 | 1 | null | null | null | null | UTF-8 | C | false | false | 18,889 | c | /*-
* Copyright (c) 2012 Oleksandr Tymoshenko <gonzo@freebsd.org>
* Copyright (c) 2012 Luiz Otavio O Souza.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source... | [
"b1014223@fun.ac.jp"
] | b1014223@fun.ac.jp |
35027763c5bff3db4a2a202e23eca1780ab80387 | 81c2ce6b7612e5a86900df50268aedd72a3b5030 | /circularQueue.c | 703d767fd395478bdf3f547c050e425a7fde241a | [] | no_license | abhishekbisht1429/C-Programming | e3f03a0008d5cf3b3c17feac05e8bb7b94fe3179 | af6e5580726c26249789c2918dc69f2240ad9866 | refs/heads/master | 2021-09-01T00:07:10.639361 | 2017-12-23T17:32:00 | 2017-12-23T17:32:00 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,442 | c | #define SIZE 5
#include<stdio.h>
int circularQ[SIZE];
int front=0,rear=-1;
int isEmpty() {
if(rear==-1)
return 1;
return 0;
}
int isFull() {
if(((rear==-1)?0:((rear+1)%SIZE==front))) // This condition is set so because on codition arises when
return 1; // rear=-1 and front =0 and incr... | [
"arkk.abhi1@gmail.com"
] | arkk.abhi1@gmail.com |
87f911f2e87019b3e3eb8af1f06e9723f96a51b8 | f231fd7cb34b042a91addf2e96468cc08ab785e3 | /courses/UTAustinX UT.PHP.16.01x/Assignments/Week2/C/Axpy.c | 7e09b314ff1c582a7891c34b750ce3d5bd97816b | [
"Apache-2.0"
] | permissive | xunilrj/sandbox | f1a0d7a1af536bea217bc713e748f04819c2480b | d65076ba487b8bf170368c9e0a0d23e0575fc09f | refs/heads/master | 2023-05-10T09:27:59.541942 | 2023-04-26T15:39:25 | 2023-04-26T15:39:25 | 64,613,121 | 8 | 5 | Apache-2.0 | 2023-03-07T01:57:24 | 2016-07-31T20:12:02 | C++ | UTF-8 | C | false | false | 286 | c | #define chi( i ) x[ (i)*incx ] // map chi( i ) to array x
#define psi( i ) y[ (i)*incy ] // map psi( i ) to array y
void Axpy( int n, double alpha, double *x, int incx, double *y, int incy )
{
for ( int i=0; i<n; i++ )
psi(i) += alpha * chi( i ); // Fused Multiply-Add
}
| [
"xunilrj@hotmail.com"
] | xunilrj@hotmail.com |
dd8b7ef91bee119beb73b4a6c3aa4e4fe3fee65b | a130cbf901caee3f0407409adddfef84bf4f9c7e | /src/tcpip/EMAC_LPC17xx.c | d99f00eedb12925abe0c8c2ee6b21b7b8d65329b | [] | no_license | samuelsilvaalves/Painel | aaaa756f8e069b9da3d9ee34b490f14ecf4119b3 | f80658b712de96c247b5e314e937e24b9d2a6681 | refs/heads/master | 2020-06-01T16:58:36.844854 | 2014-10-01T17:16:06 | 2014-10-01T17:16:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 25,623 | c | /*----------------------------------------------------------------------------
* RL-ARM - TCPnet
*----------------------------------------------------------------------------
* Name: EMAC_LPC17xx.c
* Purpose: Driver for NXP LPC1768 EMAC Ethernet Controller
* Rev.: V4.20 (Modificado para S... | [
"samuel.eletrotecnico@gmail.com"
] | samuel.eletrotecnico@gmail.com |
705e52e71d86faa291b96e804329d367553e6bd1 | bba55f806861b50d977e2e6906b152ce90eae3a0 | /include/solo_window_structs.h | 530c957b5d9347e8df97e80df9e1a761a439edc7 | [
"BSD-3-Clause"
] | permissive | XingGe0130/lrose-soloii | e634da26512a2c785e1e5e1c99e3a4b8c61b4722 | 33933d44002ea6e5e7081cbe6ba461cc13397c8d | refs/heads/master | 2023-06-11T10:56:26.458723 | 2021-07-06T22:38:07 | 2021-07-06T22:38:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 28,525 | h | /* $Id$ */
#ifndef SOLO_WINDOW_STRUCTS_H
#define SOLO_WINDOW_STRUCTS_H
/* FIXME! X dependencies to be removed */
# include <sii_image.h>
typedef struct {
int pixel;
int red;
int green;
int blue;
}XXColor;
typedef struct {
unsigned long pixel;
unsigned short red;
unsigned short green;
unsigned ... | [
"oye@f31e7c6d-f41f-0410-9234-e4ad7f416ffa"
] | oye@f31e7c6d-f41f-0410-9234-e4ad7f416ffa |
8dadc1ae3f473a82046c38ffc21a98d942c6dcf7 | 379ef13a9b8105fb32049c41feb60c6138c10918 | /utilitaire.c | d2f193925e6c091ff5a032d169c2b7cf52b0dec8 | [] | no_license | waliddafif/demineur | 602298f047540ff2a22f12870283176c61dc3a8b | 4057a1d6da116d4ee887dc8dcff6ee978dd778da | refs/heads/master | 2021-01-11T08:40:07.291682 | 2016-12-14T19:48:58 | 2016-12-14T19:48:58 | 76,490,517 | 0 | 0 | null | null | null | null | ISO-8859-1 | C | false | false | 2,770 | c | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
#include <stddef.h>
#include <string.h>
#include "constantes.h" /* constantes du programme */
// permet de choisir aléatoirement un nombre compris entre 1 et Max (variable)
int choisirNomreAleatoire(int Max)
{
return (rand() % ... | [
"noreply@github.com"
] | waliddafif.noreply@github.com |
89002d4824f2ffdbdc03d2ba9b97ef3f8c3df01e | a6e713bce397b2f5e66c07a2523e034b5fcd8236 | /MicroPython_BUILD/components/micropython/esp32/machine_dht.c | 1a5deaba11fde5e4bd273e174f2da5a6e5eb33af | [
"MIT",
"Apache-2.0"
] | permissive | YFROBOTZL/MicroPython-for-TTGO-T-Watch | f9bfc3f727a1ed29d350c1b3d1676200a17c1d76 | 43ab375858cf6ec21647aafd418548db2d527db5 | refs/heads/master | 2023-03-18T12:38:45.916583 | 2020-09-16T07:44:11 | 2020-09-16T07:44:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 13,943 | c | /*
* This file is part of the MicroPython project, http://micropython.org/
*
* The MIT License (MIT)
*
* Copyright (c) 2016 Damien P. George
* Copyright (c) 2018 LoBo (https://github.com/loboris)
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and as... | [
"lewisxhe@outlook.com"
] | lewisxhe@outlook.com |
d12b4d8b01b3d45fd4ab4b4205bd555aff26e71f | 2603b8f946c31273d7d64fe5b0ac2ba048675e52 | /ifelse.c | 8f3f58b9f051160d8d1d206a236502999e53898c | [] | no_license | AndreRdz7/C_Fundamentals | ad352d79c3a59461b8d7eaaf10eae98596afe2e7 | 14eeecf93f3b916bad25bd248a54a0474522fd96 | refs/heads/master | 2020-03-28T00:45:48.766631 | 2018-09-05T02:25:35 | 2018-09-05T02:25:35 | 147,447,775 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 350 | c | #include "stdio.h"
#include "stdlib.h"
#include "math.h"
int main(){
int a;
printf("Introduzca un numero para verificar que esta dentro del rango :");
scanf("%i",&a);
if (a>=0 && a<=10)
printf("El numero %i esta dentro del rango \n",a);
else
printf("El numero %i NO esta dentro del rango \n",a);
sys... | [
"A01730716@itesm.mx"
] | A01730716@itesm.mx |
dc7dcb120f4a2983be255dfa9ddce7e6a0629e0c | 16cb2a9f27699e866f53b90fa565a15db1ba85c1 | /最大公约数.c | 5d2d4819a65d7f8cccf91246b120c671272b8617 | [] | no_license | Tomy-Lee/C_ProblemsCodes | 03e81c5521251c67bcc4d648eea1a7270d42d37c | afc9a1be961a537abc834f44539692926536414b | refs/heads/master | 2021-01-23T14:12:36.709464 | 2017-12-01T05:37:36 | 2017-12-01T05:37:36 | 93,246,337 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 288 | c | #include <stdio.h>
int gcd(int m, int n) {
int t;
if(m<n) {
t=m;
m=n;
n=t;
}
if(m%n==0) return n;
gcd(m%n,n);
}
int main(){
int a, b;
while(scanf("%d%d", &a, &b)!=EOF) {
printf("%d\n", gcd(a,b));
}
return 0;
}
| [
"1335275309@qq.com"
] | 1335275309@qq.com |
992f18de6f49201680acd0c1d32ccb65095f0710 | 94e8344ee420ae4d2eb1643e95973845f341a3d2 | /gcc_4.3.0_mutants/mutant100409_alias.c | 9d03a416ff3a9670e1effd6c09b07ffee27acaf0 | [] | no_license | agroce/compilermutants | 94f1e9ac5b43e1f8e5c2fdc17fa627d434e082f3 | dc2f572c9bfe1eb7a38999aaf61d5e0a2bc98991 | refs/heads/master | 2022-02-26T21:19:35.873618 | 2019-09-24T15:30:14 | 2019-09-24T15:30:14 | 207,345,370 | 1 | 0 | null | null | null | null | UTF-8 | C | false | false | 78,708 | c | /* Alias analysis for GNU C
Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006,
2007 Free Software Foundation, Inc.
Contributed by John Carr (jfc@mit.edu).
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public ... | [
"agroce@gmail.com"
] | agroce@gmail.com |
386b9e61d08036f0919916c4b1bce1c2c72c3796 | 383cf8c069ea051c7769b37767ce1d78682f19be | /hw3/shell.c | cf1d72ccce1f5b0f96b7ad326247b42c7213ea14 | [] | no_license | HC-Mark/Operating-System | bd2c48845fbd8871d8657f0772e6c776e43d94bc | 4af7b77d6246ec7d7f82a984ac2af1313822c587 | refs/heads/master | 2021-05-03T13:42:03.307545 | 2018-05-16T15:13:09 | 2018-05-16T15:13:09 | 120,512,734 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 7,194 | c | /*
structure inspired by: https://github.com/jmreyes/simple-c-shell/blob/master/simple-c-shell.c
https://github.com/stpddream/OSHomework/tree/master/hw3
*/
#include <stdio.h>
#include <sys/types.h>
#include <signal.h>
//#include <sys/wait.h>
#include <fcntl.h>
#include <termios.h>
#include <pwd.h>
#include "parser.h... | [
"noreply@github.com"
] | HC-Mark.noreply@github.com |
8bc781e1e1bbd447444dac5d34a668a557b0e0ac | 4545588c8427debaf17f9dc71b0ace32f4fb5d67 | /sam0/drivers/system/clock/clock_samd20/module_config/conf_clocks.h | 14ce3210bd107f1103cd59756ee56a8812a23267 | [] | no_license | eewiki/asf | 02e06cec0465b28dd689dea801e6be6cbcd47eca | 8d0f55bd089f2e68d2b53aa76adbb02c07cdb166 | refs/heads/master | 2021-01-16T18:20:22.690176 | 2015-03-09T05:42:50 | 2015-03-09T05:42:50 | 18,419,213 | 34 | 30 | null | 2014-12-25T05:13:20 | 2014-04-03T21:42:46 | C | UTF-8 | C | false | false | 8,073 | h | /**
* \file
*
* \brief SAM D20 Clock configuration
*
* Copyright (C) 2012-2015 Atmel Corporation. All rights reserved.
*
* \asf_license_start
*
* \page License
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditi... | [
"buildmaster@atmel.com"
] | buildmaster@atmel.com |
dc9985e7aa7260b0e3ab85f3572a755c708a1afc | 371205325194b20f3a56c6a3ab32531da310d787 | /day3/thread1.c | d9b52eb4bf24d893a64200f406c666f46b41f0c2 | [] | no_license | Ashish-Surve/Linux_Programming | fb542ca0064ffa1381cb8aa3e4a49301e086c6cc | 9bb3783e3674cc3f38c19994b3b25e623c4768ba | refs/heads/master | 2021-04-17T05:18:47.150597 | 2020-11-17T11:28:08 | 2020-11-17T11:28:08 | 249,415,076 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 513 | c | #include<stdio.h>
#include<stdlib.h>
#include <pthread.h>
#include<unistd.h>
#include<sys/types.h>
void* func(void *arg)
{
int *x = (int *)arg;
printf("Thread starts... = %x\n",pthread_self());
//sleep(2);
while(++(*x)<100);
printf("Thread ends\n");
return NULL;
}
int main()
{
int err;
int x=0,y=0;
pthread_t... | [
"ashish.surve@outlook.in"
] | ashish.surve@outlook.in |
d989e784c2cb3849f54250a8d9c6bfe0ea855017 | 7e48d392300fbc123396c6a517dfe8ed1ea7179f | /RodentVR/Intermediate/Build/Win64/RodentVR/Shipping/TinyFileDialogs/Definitions.TinyFileDialogs.h | a0656360e7195886ba9eeeabaabeb28c4ab0f4a0 | [] | no_license | WestRyanK/Rodent-VR | f4920071b716df6a006b15c132bc72d3b0cba002 | 2033946f197a07b8c851b9a5075f0cb276033af6 | refs/heads/master | 2021-06-14T18:33:22.141793 | 2020-10-27T03:25:33 | 2020-10-27T03:25:33 | 154,956,842 | 1 | 1 | null | 2018-11-29T09:56:21 | 2018-10-27T11:23:11 | C++ | UTF-8 | C | false | false | 5,562 | h | #undef TINYFILEDIALOGS_API
#undef UE_IS_ENGINE_MODULE
#undef DEPRECATED_FORGAME
#define DEPRECATED_FORGAME DEPRECATED
#undef UE_DEPRECATED_FORGAME
#define UE_DEPRECATED_FORGAME UE_DEPRECATED
#define IS_PROGRAM 0
#define UE_GAME 1
#define ENABLE_PGO_PROFILE 0
#define USE_VORBIS_FOR_STREAMING 1
#define USE_XMA2_FOR_STREA... | [
"west.ryan.k@gmail.com"
] | west.ryan.k@gmail.com |
45533516fdcfe432eb5b36e4ec67257647891a8d | ff5e7a4ed7f3688ea155785123c207f7bd554894 | /Temp/il2cppOutput/il2cppOutput/mscorlib_System_Reflection_AssemblyCopyrightAttributeMethodDeclarations.h | 5a0a9745542bd75e85f0e33b70df2d48515c5439 | [] | no_license | VendorLisy09/CardboardDemo | b24c45b700bf1368425994d07de8dbc41a227d5d | 850ed8b3aed712b11e8387e2e930179fb2ee9671 | refs/heads/master | 2021-05-29T20:38:28.960540 | 2015-11-24T07:18:30 | 2015-11-24T07:18:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 592 | h | #pragma once
#include "il2cpp-config.h"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <stdint.h>
#include <assert.h>
#include <exception>
// System.Reflection.AssemblyCopyrightAttribute
struct AssemblyCopyrightAttribute_t1307;
// System.String
struct String_t;
#include "codegen/... | [
"suiyan.li@dena.com"
] | suiyan.li@dena.com |
9913f610916a258a8c3e08e5390c5d44e5b40771 | 2036a22d82533876ecc79fe35daf5d3ad3e1aa9d | /TicTacToe_MultiplePlayers/game.c | d93deb864d9103b0a396a2123b1832ce478f741c | [] | no_license | ma1371sao/TicTacToe | 3154ababcab0f81072a3ded9ba151af64f330192 | 366f83c3b5ce73764bcd9f08e138b468198d8d7a | refs/heads/master | 2021-09-13T07:43:19.935713 | 2018-04-26T18:00:59 | 2018-04-26T18:00:59 | 120,518,299 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 14,198 | c | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <errno.h>
#include <sys/socket.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <netdb.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <poll.h>
#include <time.h>
#include "game.h"
int tictactoeAI(char board[ROWS... | [
"noreply@github.com"
] | ma1371sao.noreply@github.com |
784813fa2a2a556f8d56921618981687987c4265 | fa1629cfc952b313e005d390c62e2b703bfe0ba1 | /twostacksort/twostacksort.c | bd47b1ae0312b07238f89e5d8af2487f2167f3ea | [] | no_license | steve1281/c_experiments | 2b86d18dcca20eed58a6b340bac5835db887cbdd | 39f15745c122ea379772a4eebb0d00fb4eb1ac59 | refs/heads/master | 2021-07-14T01:08:33.995280 | 2017-10-10T21:51:17 | 2017-10-10T21:51:17 | 105,527,365 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,377 | c | #include<stdio.h>
int stks[2][1000];
int tops[2];
int pop(int n)
{
if (tops[n]==0) {
return -1;
}
return stks[n][--tops[n]];
}
void push(int n, int v)
{
stks[n][tops[n]++] = v;
}
void init()
{
for (int j=0;j<2;j++) {
for (int i=0;i<1000;i++) {
stks[j][i] = 0;
... | [
"steve1281@hotmail.com"
] | steve1281@hotmail.com |
f899a5b54e6f0bbce7fffa6c25516ceb381814f6 | 209011aef896ef5d47ef68cc848a16bf1d74424c | /ir100_driver/src/tinkerforge/lib/tinkerforge/examples/bricklet/rs232/example_loopback.c | 2e04f668314def3c470ec3dd8b1e81589b97bdf1 | [
"CC0-1.0"
] | permissive | Sunspeed-Robotics/C100 | ec6f79180108b1a5489821006617c551b5eb9195 | 5400099ea0454e9008e9a5408382147e850a33ce | refs/heads/master | 2020-04-13T10:43:00.852283 | 2019-02-21T06:55:11 | 2019-02-21T06:55:11 | 163,150,659 | 0 | 1 | null | null | null | null | UTF-8 | C | false | false | 1,569 | c | #include <stdio.h>
// For this example connect the RX1 and TX pin to receive the send message
#include "ip_connection.h"
#include "bricklet_rs232.h"
#define HOST "localhost"
#define PORT 4223
#define UID "XYZ" // Change XYZ to the UID of your RS232 Bricklet
// Callback function for read callback
void cb_read(char m... | [
"robotics@sensorobots.net"
] | robotics@sensorobots.net |
6ccedc5811caedd759cb3eda1942f54d303aaf0a | 556b467b0e31835de656c71a8f4e0bfd4acb7442 | /d/wenchuan/shilu4.c | 4df72010568bbd1841168276bb36a3fd9d11a8fb | [] | no_license | afeizh/txmud | a4a48cb663eccfdf5aa0b951d34e93437a17c9fa | 717c8ef173bff8abe27e00fb8dc150cbf02b3c3a | refs/heads/main | 2023-08-07T20:33:48.154233 | 2021-09-16T15:34:37 | 2021-09-16T15:34:37 | null | 0 | 0 | null | null | null | null | GB18030 | C | false | false | 602 | c | // shilu4.c 石板路
inherit ROOM;
void create()
{
set("short", "石板路");
set("long", @LONG
小镇的石板路就快走完了，再往前可以看到一片树林，据当
地人说，过了树林就可以到达黄河渡口，路的西面有一家小宝石
行。
LONG
);
set("exits", ([
"north" : __DIR__"shilu3",
"south" : __DIR__"shulin",
... | [
"i@Mud.ren"
] | i@Mud.ren |
61029510b386e6fb70cf105e26f10dc7ef7b27dc | 6c585023161859afd9b2fc569027cdc4c184cc6e | /hook.c | 16cff155d60a22a7beb6951529d4ee61a9d4f360 | [] | no_license | bb33bb/heap-tracer | cfdbee515428086fcac57071c67e1af3a6cc88b0 | b3d6f4d2fa6d3e27b1109142e9f192cd7fff30be | refs/heads/master | 2023-06-08T03:57:35.672394 | 2017-12-31T14:29:19 | 2017-12-31T14:29:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,839 | c | #define _GNU_SOURCE
#define GREEN "\x1b[32m"
#define YELLOW "\x1b[33m"
#define BLUE "\x1b[34m"
#define RESET "\x1b[0m"
#include <stdlib.h>
#include <stdio.h>
#include <unistd.h>
#include <dlfcn.h>
#include <malloc.h>
#include <inttypes.h>
// gcc -o hook.so -fPIC -shared hook.c -ldl
// LD_PRELOAD=./hook.so ./myexecut... | [
"mail@katharina-maennle.de"
] | mail@katharina-maennle.de |
3db5e6a753e440d717d9d8f893b7f78551a8cfc5 | 7373f9f5ae26c9dba2d067f4a2580e7c53da3f03 | /src/standart/ft_isdigit.c | c6e46efe0e1129cb1349b605015c83c6626f9ac4 | [] | no_license | ValeraGin/libft | 645728fce446ec6ef427c913623daf5a96c4cddc | ea74a14180d2f469ae453bc77c356c6707a66d8d | refs/heads/master | 2022-04-07T06:45:16.195246 | 2020-03-07T17:36:05 | 2020-03-07T17:36:05 | 221,473,179 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 970 | c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_isdigit.c :+: :+: :+: ... | [
"hmathew@su-h4.21-school.ru"
] | hmathew@su-h4.21-school.ru |
088954caf6d539c87da5fab0cf3be32a16996087 | 9589309cbb793dc42e4961f4b2ee6f12b7699972 | /Piscine C - DAY_08 - 42/ex00/ft_split_whitespaces.c | ffe6914dde0c73081c9b53c0b260dc738bf04ffd | [] | no_license | Taikos/Piscine42 | 624fe695162cd61e5b51dd9735df059099dc5f46 | dee7582a6fffe5f28c3bf1de0e9f39defc6d0b98 | refs/heads/master | 2021-01-19T07:31:51.112139 | 2017-04-09T20:10:01 | 2017-04-09T20:10:01 | 87,552,169 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,732 | c | #include <stdlib.h>
char **insert(char *str, char **tab, int a)
{
int word;
int y;
int temp;
word = 0;
y = -1;
temp = 0;
while (word <= a && str[y + 1] != '\0')
{
y++;
if (str[y] != '\0' && str[y] != ' ' && str[y] != '\n' && str[y] != '\t')
{
while (str[y] != '\0'
&& (str[y] != ' ' && str[y] != '... | [
"MacBookAirArthur@macbook-air-de-arthur.home"
] | MacBookAirArthur@macbook-air-de-arthur.home |
7c889c3208cd9348114a2836eb025e4ba1d906a6 | 9082febbd9436c5b45b75a82edf18e5b11d2c215 | /mcu_sdk/protocol.c | b3524cd6fa055f37d4f8d30fea6b6f92577d392e | [
"MIT"
] | permissive | Jeremyhuang-lab/iot_device-thermometer | 4496e731801362e0bf5f3e438d98156ef3e711cb | 5cc1f90c351a43edb999cf7e5020c003c8abfbcc | refs/heads/main | 2023-03-20T06:31:32.258140 | 2021-03-10T10:32:04 | 2021-03-10T10:32:04 | 345,893,082 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 52,522 | c | /**********************************Copyright (c)**********************************
** 版权所有 (C), 2015-2020, 涂鸦科技
**
** http://www.tuya.com
**
*********************************************************************************/
/**
* @file protocol.c
* @author ... | [
"noreply@github.com"
] | Jeremyhuang-lab.noreply@github.com |
2e6a9a085bf95fdba2bbcf68037b7dd9c7e4370f | a763f6505331d1c1823d0e8620cc2d5f83048486 | /video/ms/8514a/disp/bitblt.c | 61bd4913788eb81699b52819ae908cbb3ece7231 | [] | no_license | KernelPanic-OpenSource/Win2K3_NT_drivers | 1dc9ccd83e38299f6643ecfd996a5df1357cc912 | 1b5d2672673ff31b60ee4a5b96922ddbcc203749 | refs/heads/master | 2023-04-11T08:18:29.881663 | 2021-04-14T04:30:34 | 2021-04-14T04:30:34 | 357,772,205 | 12 | 5 | null | null | null | null | UTF-8 | C | false | false | 86,444 | c | /******************************Module*Header*******************************\
* Module Name: bitblt.c
*
* Contains the high-level DrvBitBlt and DrvCopyBits functions. The low-
* level stuff lives in 'bltio.c'.
*
* Note: Since we've implemented device-bitmaps, any surface that GDI passes
* to us can have 3 values ... | [
"polarisdp@gmail.com"
] | polarisdp@gmail.com |
9d05a8d5034521bf66c04c9b22fff31685e6c453 | 197043eca562582d3d3829a9a349ca4f45ba1797 | /0x19-hash_tables/hash_tables.h | 8551d9676c05ee8775a2f66b64fc79e1d2527c1f | [] | no_license | cynergist/holbertonschool-low_level_programming | 352249e94a176f35fb3cab3a9be4fda2c29ab2b3 | 812c5fe887d17a86a1a17cf242468bef62975e74 | refs/heads/master | 2020-04-21T10:59:40.493660 | 2019-10-21T06:16:09 | 2019-10-21T06:16:09 | 169,505,274 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,229 | h | #ifndef _HASH_TABLES_H_
#define _HASH_TABLES_H_
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/**
* struct hash_node_s - Node of a hash table
*
* @key: The key, string
* The key is unique in the HashTable
* @value: The value corresponding to a key
* @next: A pointer to the next node of the List
*/
t... | [
"cmdominguez@gmail.com"
] | cmdominguez@gmail.com |
dd171b373feb70dd6caa2442dfec64e703b486b9 | 55f7b2dec9683e36b721303dfc3bb49aa6d162a5 | /Ch02/RecursiveBinarySearch.c | aafceb3b403ca2f572c619127cfbeb994afa40c8 | [] | no_license | LaSTand/Data_Structure | 1d538c12058c33aeef36617e6d2f751a7a960b2b | 7ce04eaafe95035d604a6e017724d896c6ed2d2c | refs/heads/master | 2021-01-13T03:17:47.490830 | 2017-02-15T10:43:13 | 2017-02-15T10:43:13 | 77,590,280 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 817 | c | #include <stdio.h>
int BSearchRecur(int ar[], int first, int last, int target)
{
int mid;
if(first > last)
return -1; // -1 means search failed
mid = (first+last) / 2; // Calc the mid-value
if(ar[mid] == target)
return mid; // End searching
else if(target < ar[mid])
return BSearchRecu... | [
"lastand73@gmail.com"
] | lastand73@gmail.com |
2f88fd56fb6a6bb896a9e26ff114e22c50653655 | f395c2daed5962a3f6fce062da5b28e08ab48263 | /libxc-2.2.0/src/gga_c_lm.c | 8b77ec8aef984e1ff4cad130127e8bf99596e0af | [
"LGPL-3.0-only",
"BSD-3-Clause"
] | permissive | JefferyQ/lsms | c72dc9d81098258ca66daa6850cd9bfc785bfec7 | 2d975008a829b328161f503109e324a9eae26768 | refs/heads/master | 2020-07-27T14:48:47.312249 | 2019-09-17T16:08:36 | 2019-09-17T16:08:36 | 209,129,996 | 1 | 0 | BSD-3-Clause | 2019-09-17T18:35:44 | 2019-09-17T18:35:43 | null | UTF-8 | C | false | false | 5,362 | c | /*
Copyright (C) 2006-2007 M.A.L. Marques
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distr... | [
"me4@me4macbook.ornl.gov"
] | me4@me4macbook.ornl.gov |
805c6cc83e6e69f10fd9d370c0ac51e2b7b8b982 | 260d6586601ef4e5acca36f77ce11f5efd17a227 | /system/STM32L4xx/Include/stm32l4_system.h | f907e856b3217887d3b3d08b9fbea0515b1ef292 | [] | no_license | kriswiner/arduino-STM32L4 | f3636c2d8d577d47e04907c4c2eddf5f63a0c90d | a53ca9d50e0586a7e938318fa3cd09a7e3dc4290 | refs/heads/master | 2020-06-21T11:37:44.963855 | 2016-11-25T21:18:50 | 2016-11-25T21:18:50 | 74,789,369 | 4 | 0 | null | 2016-11-25T21:34:13 | 2016-11-25T21:34:13 | null | UTF-8 | C | false | false | 6,095 | h | /*
* Copyright (c) 2016 Thomas Roell. All rights reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal with the Software without restriction, including without limitation the
* rights to use, co... | [
"grumpyoldpizza@gmail.com"
] | grumpyoldpizza@gmail.com |
3a976cba0b3b13951929d042e35b9503d1f32372 | b3c60089697a3ac4b60987af43d35228dac5d959 | /Source/modio/Public/Customizables/ModioFilterCreator.h | e963a01d632d3f52b9166b36aef5ab1d6f2ef84a | [
"MIT"
] | permissive | Turupawn/UE4Plugin | 7c755a543b2bb16ff20aa3d00e41940f9529457e | f01de1609aedb95f7733924f64bd59a4770bf2d1 | refs/heads/master | 2023-05-25T02:39:48.106964 | 2020-05-18T02:14:55 | 2020-05-18T02:14:55 | 174,268,322 | 0 | 0 | MIT | 2020-06-02T23:48:56 | 2019-03-07T03:57:24 | C++ | UTF-8 | C | false | false | 647 | h | // Copyright 2019 modio. All Rights Reserved.
// Released under MIT.
#pragma once
#include "Customizables/ModioFieldFilterCreator.h"
#include "Customizables/ModioSortCreator.h"
#include "Runtime/Core/Public/Containers/Map.h"
#include "ModioFilterCreator.generated.h"
USTRUCT(BlueprintType)
struct FModioFilterCreator
... | [
"ahmed.hn.43@gmail.com"
] | ahmed.hn.43@gmail.com |
a539d717ccd401b1d6cfbe552a112021e7373490 | 46367579a54a09dd220dd9a678b1452f06897f11 | /branches/hdf5_1_8_swapped_fheap_id/src/H5Ofill.c | f403b81ebe9cc99e5ff6afb4a30466afca3d583f | [
"LicenseRef-scancode-llnl",
"LicenseRef-scancode-hdf4"
] | permissive | TPLink32/hdf5 | 33ff24c9b6133f0f51cb6cc2b722fba7bb1777dd | 0d6987c15284bd9f34c7e44452a152833d42a738 | refs/heads/master | 2021-05-31T01:15:39.463663 | 2016-04-14T23:02:09 | 2016-04-14T23:02:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 36,294 | c | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by The HDF Group. *
* Copyright by the Board of Trustees of the University of Illinois. *
* All rights reserved. *
* ... | [
"koziol@dab4d1a6-ed17-0410-a064-d1ae371a2980"
] | koziol@dab4d1a6-ed17-0410-a064-d1ae371a2980 |
0f35a017680dd1a32a2ed549c57442cc872672c2 | 11e97f87deb25babb4a32c80941e7ff4e476c92a | /TRS/HRI_530v/Motion/UtilDefine.h | 7e148582ed35a0a3dd6b8763ca810eca25b0f2c5 | [] | no_license | xhyangxianjun/Builder6-program | b9d03d98658db5a5a8cf1586210a373bc391dc48 | a12d811d7a5fa3dba6d3e8c05989a41cb89783de | refs/heads/master | 2022-04-03T00:25:47.274355 | 2019-09-19T08:26:56 | 2019-09-19T08:26:56 | null | 0 | 0 | null | null | null | null | UHC | C | false | false | 47,930 | h | #ifndef UTILDEFINEH
#define UTILDEFINEH
//sunsun 로더 언로더 인덱스바 투스타트 관련
//소켓 플레이스 및 쉬프트 소켓 플레이스 인포 등등.
//언로더 세퍼레이터 처음 켤때 뒤로 빠지는것.
//랏엔드시에 스테이지 회전 하는것.
//
#define EQP_SERIAL_LIST \
"\
TRS-14-1048,\
"
//소켓이나 툴의 갯수.
#define MAX_TOOL_SOCK_COL 4
//DD모터위의 스테이지의 갯수.
#define MAX_STAGE 4
enum { ccBwd = 0 , ccFwd = 1};
enum... | [
"sheepdw@gmail.com"
] | sheepdw@gmail.com |
0a04b3b7427d17136e30cbc0e8493e0cf774a0db | 130f27d13aed7971680d4aad6f7418b97c0bb9fd | /YesNoGame/YesNoGameExample.c | 8e6117cfdee1586fa7a54fb09eb3af9e8645216a | [] | no_license | Zach-Weber/Class-Work | ef1e1d153bdb2639bc2d4339bd47bbf4202114eb | 9b369f04408e22de3d295d56f88dd687ec52e42b | refs/heads/master | 2020-08-24T22:41:33.398970 | 2020-03-03T08:18:35 | 2020-03-03T08:18:35 | 216,920,469 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 3,211 | c | /****************************
Filename: YesNoGame.c
Name: Zach Weber
Date Last Edited: 16 Sep 2019
Brief Description: Starting point for a yes no game
gcc -Wall -Wextra -Werror -ansi -pedantic -O YesNoGame.c -o game.exe
****************************/
/*printf, scanf*/
#include <stdio.h>
/*rand, srand*/
#include <stdli... | [
"zachary.weber@digipen.edu"
] | zachary.weber@digipen.edu |
459227fbbe34d022860b69274a2648de9a7658f2 | 89208be1fd89bf21636c6823bcda292fa5cc7961 | /src/config.h | b4b405e970f9b5d2ef40179f7437fa8bed59abf9 | [
"MIT"
] | permissive | encryptogroup/UC | 2c517b67b1ee2f651c007c24f61c1efd629760b8 | befdd63b69337dcbed3d67bdd03412c49e3c662d | refs/heads/master | 2021-05-03T13:13:49.031171 | 2021-01-07T13:02:45 | 2021-01-07T13:02:45 | 50,654,088 | 36 | 11 | MIT | 2021-01-07T13:01:13 | 2016-01-29T09:54:36 | C++ | UTF-8 | C | false | false | 1,621 | h | /**
\file config.h
\author guenther@rangar.de
\copyright Valiant's Universal Circuit Construction Optimized for Private Function Evaluation
Copyright (C) 2016 Engineering Cryptographic Protocols Group, TU Darmstadt
This program is free software: you can redistribute it and/or modify
it under the terms of... | [
"guenther@rangar.de"
] | guenther@rangar.de |
81344859a5409768789f8639318eb7692741337f | 45a26f28a29ab6dd9d3bcf315117d814f50808b1 | /src/AppleOnboardAudio/AppleOnboardAudio-211.3.2/AppleLegacyAudio/AudioHardwareUtilities.h | ea1df72a2ce4f356d8a0846f007e94f67ab0b87f | [] | no_license | zeborrego/opensource.apple.com | 0eb9161029ce8440dbdc4b5157b3927a6e381f8d | 88cbaab4a42e97cbbfe6b660f2f0945536821be6 | refs/heads/master | 2021-07-06T17:16:28.241638 | 2017-10-02T11:58:56 | 2017-10-02T11:58:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 7,537 | h | /*
* AudioHardwareUtilities.h
* Project : Apple02Audio
*
* Copyright (c) 1998-2000 Apple Computer, Inc. All rights reserved.
*
* @APPLE_LICENSE_HEADER_START@
*
* Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved.
*
* This file contains Original Code and/or Modifications of Original C... | [
"mattl@cnuk.org"
] | mattl@cnuk.org |
f1ad15e3393d756073d4b5fbd3f1355b2cd60d32 | e51c55c9a627aa6d7fbed5b8005750ecdd7b053f | /outros/Acepic28_Exemplos_PIC16_PIc18/PIC16F876A/USART/usart.c | cb1289a1e50c167e11e8c4abc517d99a2265c97d | [] | no_license | wavelee/microchip | 9623701a1450b2a528dda310fc13383d5b644b5d | ddaf12a920f3ec8807cc2c8bd2cd6174bb82ba0b | refs/heads/master | 2020-12-26T04:04:24.463655 | 2014-04-05T19:59:42 | 2014-04-05T19:59:42 | null | 0 | 0 | null | null | null | null | ISO-8859-1 | C | false | false | 2,464 | c | //******************************************************************************
//Kit de desenvolvimento ACEPIC 18
//Projeto: Usart.c
//Descrição: recebe um caracter pela serial e o envia novamente
//Desenvolvimento: Eng.: Carlos Eduardo Sandrini Luz
// ACEPIC Tecnologia e Treinamento LTDA
//
//... | [
"roneymonte@gmail.com"
] | roneymonte@gmail.com |
045995a5bf99b3deca8fca5879001f5a5f276693 | a088d71ac58ef1f7dccd88e1d8eece6fe7cfde70 | /src/autocode/int3c2e.c | dbd98271a0c5ee50a3ebfd722c44755f12e4c2ec | [
"GPL-1.0-or-later",
"GPL-3.0-only",
"BSD-2-Clause"
] | permissive | pyscf/libcint | 46eeeea08e386ea6271df886d9440526b3cdf1ec | 544042e5798480dfac0e4309b51a2aefb3f5ca76 | refs/heads/master | 2020-04-08T07:44:27.224312 | 2019-04-13T15:02:34 | 2019-04-13T15:02:34 | 159,149,733 | 1 | 0 | BSD-2-Clause | 2019-04-13T15:02:35 | 2018-11-26T10:14:50 | C | UTF-8 | C | false | false | 52,773 | c | /*
* Copyright (C) 2013- Qiming Sun <osirpt.sun@gmail.com>
* Description: code generated by gen-code.cl
*/
#include <stdlib.h>
#include "cint_bas.h"
#include "cart2sph.h"
#include "g1e.h"
#include "g2e.h"
#include "optimizer.h"
#include "cint1e.h"
#include "cint2e.h"
#include "misc.h"
#include "c2f.h"
/* (NABLA i ... | [
"osirpt.sun@gmail.com"
] | osirpt.sun@gmail.com |
082fe56d338640417dfb8d0eeb13be113bc2b4d0 | 313372fbe8ec5e0dfeffec78ec9eb9baeeadec78 | /loader/linux/include/debug.h | 5baa1c8e8d513752c4f3c525f877633277cae7a8 | [
"MIT"
] | permissive | SeanTBooker/hypervisor | 80fe026cf695b3ec577e8ec3f5fd73e7279b229f | b4af35e31bbe54036710d0d142487233dc38b082 | refs/heads/master | 2023-03-08T03:30:07.775334 | 2021-02-24T15:23:52 | 2021-02-24T15:23:52 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 2,123 | h | /* SPDX-License-Identifier: SPDX-License-Identifier: GPL-2.0 OR MIT */
/**
* @copyright
* Copyright (C) 2020 Assured Information Security, Inc.
*
* @copyright
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to ... | [
"rianquinn@gmail.com"
] | rianquinn@gmail.com |
95986a4d1ae39107e658bbc29f59dab3789463e2 | 2960167ca6fba5c49fcdf7fa4353017e1566246f | /Programming/Vyacheslav_Diedov/Програмування/2.06.c | ffe9b334cc34b5db6ffb0afce10d82c2f185b87b | [] | no_license | FriedrichFrankenstein/A.19-Green | ed95e28a0e6bbaa48d24db372642ad97d6b42772 | 1444c54e0400bbc3ab4ed4eac058691d4407421d | refs/heads/master | 2020-07-29T20:37:21.584748 | 2019-10-16T13:39:42 | 2019-10-16T13:39:42 | 209,950,683 | 5 | 0 | null | null | null | null | UTF-8 | C | false | false | 310 | c | #include <stdio.h>
main(){
int a, b, c, i;
printf ( "Input \n" );
for( i = 0; i < 2; i++){
switch(i){
case 0: scanf("%i", &a);
break;
case 1: scanf("%i", &b);
break;
}
}
c = a + b;
printf ( "Result: %d + %d = %d \n", a, b, c );
getchar();
}
| [
"diedov270@gmail.com"
] | diedov270@gmail.com |
a2f80d7ef238020bf4eb89f57863084ce0b6ad95 | a40f093dec7fd4c7a4252c69f2c871613540a418 | /threadSync/writer.c | 815a7109b56dec5f4cdf4958d9b79dc9426b0d8d | [] | no_license | knsushma/Operating-System | abd7460c14b01bc04c58ef7d32d1d7af27872210 | 4a3a7a682b6476c5ba58b8611a42be4153e01380 | refs/heads/master | 2020-03-29T13:20:18.183272 | 2019-01-21T18:55:54 | 2019-01-21T18:55:54 | 150,684,237 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 783 | c | /***
* A program to demonstrate thread synchronization
* Sushma K N <kudlurnirvan@wisc.edu>
* Srujana <srujana@wisc.edu>
*
* File to read from Writer buffer and write data to stdout stream
*
*/
#ifndef THREADDEMO_WRITER_C
#define THREADDEMO_WRITER_C
#include "Queue.h"
#include <stdio.h>
#include <stdlib.h>
#include <s... | [
"sushmakn@Sushmas-MacBook-Pro.local"
] | sushmakn@Sushmas-MacBook-Pro.local |
993c90565fe396a51ff5a6458463b9a6f40e193d | 83214753e9183327e98af0e6768e9be5385e5282 | /d/migong/lev9/npc/lev5.c | 68084ae692a52e2d8f5b239b91dfffc6c21f5315 | [] | no_license | MudRen/hymud | f5b3bb0e0232f23a48cb5f1db2e34f08be99614e | b9433df6cf48e936b07252b15b60806ff55bb2f3 | refs/heads/main | 2023-04-04T22:44:23.880558 | 2021-04-07T15:45:16 | 2021-04-07T15:45:16 | 318,484,633 | 1 | 5 | null | null | null | null | GB18030 | C | false | false | 6,080 | c | // migong lev9 九剑
#include <ansi.h>
inherit NPC;
string* names = ({
"赵","钱","孙","李","周","吴","郑","王","冯","陈","褚","卫",
"蒋","沈","韩","杨","朱","秦","尤","许","何","吕","施","张",
"孔","曹","严","华","金","魏","陶","姜","戚","谢","邹","喻",
"柏","水","窦","章","云","苏","潘","葛","奚","范","彭","郎",
"鲁","韦","昌","马","苗","凤","花","方","傻","任","袁","柳",
"邓"... | [
"i@oiuv.cn"
] | i@oiuv.cn |
d42dea619314b11938788b5b00907297e24aade8 | 20d9c2e8bb67aa90a40abe00197fab8f18fe509c | /new/Starter Code/starter_code/handler.c | fb83cd0d8170da1a8899d5ba56c04b2fdf710194 | [] | no_license | yiqingqiu23187/bit-torrent-like-P2P-File-Transfer-Application | 8650233625d3f6c2cabceecc2277b7cce1e120f2 | 04d34140eb216f1c0c64680b879fc1df8701d5d8 | refs/heads/master | 2023-04-26T02:55:34.988822 | 2021-05-12T09:11:40 | 2021-05-12T09:11:40 | 366,655,642 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 11,649 | c | //peers invoke this part to handler whohas/Ihave, etc
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <signal.h>
#include "handler.h"
#include "sha.h"
#include "list.h"
#include "store.h"
#include "task_get.h"
#include "spiffy.h"
#include "chunk.h"
extern list_t *chunk_tracker;
extern list_t *chunk_... | [
"18302010034@fudan.edu.cn"
] | 18302010034@fudan.edu.cn |
e4d28b12ee6512dc1cbc44338ded72c9385a6bcd | ef23e388061a637f82b815d32f7af8cb60c5bb1f | /src/mess/machine/mz80.c | a4ead343735f0ad5240c312d382efa5264519133 | [] | no_license | marcellodash/psmame | 76fd877a210d50d34f23e50d338e65a17deff066 | 09f52313bd3b06311b910ed67a0e7c70c2dd2535 | refs/heads/master | 2021-05-29T23:57:23.333706 | 2011-06-23T20:11:22 | 2011-06-23T20:11:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 3,189 | c | /***************************************************************************
MZ80 driver by Miodrag Milanovic
22/11/2008 Preliminary driver.
****************************************************************************/
#include "emu.h"
#include "machine/i8255a.h"
#include "machine/pit8253.h"
#includ... | [
"Mike@localhost"
] | Mike@localhost |
4491cf4f42e5aa87182ca1edc42a96c4bd744776 | 3c027d8374a78462b3b27c5ca43509d0229b5af3 | /register_types.h | badaa1435b16e2a73dcea26d84949867ed84a8fc | [
"MIT"
] | permissive | mauville-technologies/gdopenvr | 7f7826773c6b278ff67e3dd8106d37dbce451f43 | 38ccc67f16ce6dd705e0b1502f80acb61b292c34 | refs/heads/master | 2023-02-10T18:15:40.084053 | 2021-01-06T23:03:13 | 2021-01-06T23:03:13 | 325,690,515 | 1 | 1 | MIT | 2021-11-12T19:27:09 | 2020-12-31T02:04:14 | C++ | UTF-8 | C | false | false | 80 | h | #pragma once
void register_gdopenvr_types();
void unregister_gdopenvr_types();
| [
"p.a.mauviel@gmail.com"
] | p.a.mauviel@gmail.com |
4ed8b21a3587cba34caa7a4e2f74790ab5e5fcfc | ca549b5eb4c4f27d42b465483558b718aeff3431 | /src/common/test/TestAlphabetTransform.c | 800ef397de214ff4fa55f762b939e6607847dd65 | [] | no_license | beardog-ukr/MaroonRacoon | 088bb27f3e38981a3132ce8e728311f6eb19b52d | 53f1feb770ca42c527954697cd48ae0dd320d621 | refs/heads/master | 2020-12-02T22:43:46.095209 | 2017-09-22T19:49:34 | 2017-09-22T19:49:34 | 96,173,539 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,164 | c | #include "TestAlphabetTransform.h"
#include "AlphabetTransform.h"
#include <stdio.h> //printf, fgetc, fopen, snprintf
#include <string.h> //strcmp
#include <stdlib.h> // malloc
// ===========================================================================
//bool checkKey(const AlphabetTransform* const at, con... | [
"beardog@beardog.in.ua"
] | beardog@beardog.in.ua |
7b8768ef710b58afb701115690ca49d4d821c7b4 | 9c1f5a99c02411b4da5113425930c61cadf2a5c4 | /pset4/filter less/filter.c | 119d351dc101641ae7f8f8b4804349fd3c984f8d | [] | no_license | ZahidKamil/CS50x_2020 | 55bad945dbd2ce4dd7a53a9c901b4f5db64eedaf | 5750d19d4a98c75559e0fa3124cd0779fad54640 | refs/heads/main | 2023-08-24T09:59:04.967490 | 2021-11-02T03:12:11 | 2021-11-02T03:12:11 | 423,691,147 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 3,757 | c | #include <getopt.h>
#include <stdio.h>
#include <stdlib.h>
#include "helpers.h"
int main(int argc, char *argv[])
{
// Define allowable filters
char *filters = "bgrs";
// Get filter flag and check validity using getopt which parses command-line arguments. optstring is a string containing the legitimate o... | [
"zahid.kamil1573@gmail.com"
] | zahid.kamil1573@gmail.com |
b642efc3cde2659df19e76ea84f34a261cecfb64 | 44cedb194610f0211bc9398440f37dca15b944fd | /critbit-test.c | 9cd1c2bcab30acb636e24e12e9d9540ed53ff4f0 | [] | no_license | aniruddha-a/critbit2 | 475cee539cb55166c927b40b81b2ac4e307bbf58 | 42b25594eee32dcb1e3dc554145af5008ede600c | refs/heads/master | 2021-01-13T02:29:51.282918 | 2013-12-18T06:20:39 | 2013-12-18T06:20:39 | 15,275,284 | 1 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,472 | c |
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <stdint.h>
#include <inttypes.h>
#include "critbit.h"
/* Given the string in a lib, get the data associated with it
* s - string given by critbit
* v - our data pointer
*/
#define CB_GET_DATA_STR(s,v) memcpy(&v, s+strlen(s)+1, sizeof(void*))
in... | [
"ani@versa-networks.com"
] | ani@versa-networks.com |
b19da884d5fa1278c295b6919fde59b76b694dc0 | e4a46cd3cd8dd8c3b4dfd4a267d7a1d512a3771f | /parent child/threads/diningPhilosophers.c | 5828b96557da39d0773d47ad55178ed26188d59c | [] | no_license | sohan99/practiceset | 0effb44a2987e36999c6af8e4db907ad03e28cdf | a579e0fca632435d4555fb25611167c9647764ef | refs/heads/master | 2016-09-05T12:56:59.088219 | 2015-12-07T04:55:30 | 2015-12-07T04:55:30 | 40,240,482 | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 949 | c | #include <stdio.h>
#include <pthread.h>
#include <stdlib.h>
#include <unistd.h>
void * HungryWantToEat(void *);
pthread_mutex_t lock;
int chopstick = 5;
int main(){
pthread_t tid1,tid2,tid3,tid4,tid5;
pthread_attr_t attr;
pthread_attr_init(&attr);
//while(1){
pthread_create(&tid1,&attr,HungryWantToEat,NULL);
... | [
"sohanspoojary99@gmail.com"
] | sohanspoojary99@gmail.com |
2b31ccf3f19d954ee45da229c807bb41992edfad | 1427bfdb2bc7ad43a7d4862e1e5770549eeee8eb | /TDIP/CubeSat_Dev_Code/drivers/fsl_pmc.c | f0759aa5215e7f1999867f5a6c74b50986c2c22f | [] | no_license | Toddgs/CubeSat_Dev_Code---Current | e428cc636c7553bf150cb86433e1ebb62335aef1 | 487be3f37dd8daefb612ab7b86062a05ef7f0dda | refs/heads/master | 2020-03-25T19:16:15.239523 | 2019-05-14T18:52:55 | 2019-05-14T18:52:55 | 144,074,289 | 2 | 3 | null | 2018-08-14T13:55:48 | 2018-08-08T22:31:11 | C | UTF-8 | C | false | false | 4,621 | c | /*
* Copyright (c) 2015, Freescale Semiconductor, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* o Redistributions of source code must retain the above copyright notice, th... | [
"tgs1621@jagmail.southalabama.edu"
] | tgs1621@jagmail.southalabama.edu |
e42997f5a95992d114695917f2a4585ae2302586 | 2bdedcda705f6dcf45a1e9a090377f892bcb58bb | /src/main/output/law/history/oauth_change_business/day/generic/fact/party/power/force.c | 9b3debf0ea001407ba7a6a5fa8fa1f98ca8f88a7 | [] | no_license | matkosoric/GenericNameTesting | 860a22af1098dda9ea9e24a1fc681bb728aa2d69 | 03f4a38229c28bc6d83258e5a84fce4b189d5f00 | refs/heads/master | 2021-01-08T22:35:20.022350 | 2020-02-21T11:28:21 | 2020-02-21T11:28:21 | 242,123,053 | 1 | 0 | null | null | null | null | UTF-8 | C | false | false | 10,054 | c | import org.apache.http.HttpEntity;
import org.apache.http.HttpResponse;
import org.apache.http.client.HttpClient;
import org.apache.http.client.methods.HttpGet;
import org.apache.http.client.methods.HttpPost;
import org.apache.http.client.utils.URIBuilder;
import org.apache.http.entity.StringEntity;
import org.apache.h... | [
"soric.matko@gmail.com"
] | soric.matko@gmail.com |
b6b000e1b3034655925fa328302356993a84bcd0 | 8072c1cf03f82fd1891536e93b6c28f16df82ea4 | /metamorphosys/META/externals/HCDDES/src/FRODO/tests/main.h | 5e4622dc1b9a89c63fdda74ed0ce3730e4cbda69 | [
"LicenseRef-scancode-other-permissive"
] | permissive | 15831944/metamorphosys-desktop | 90a26c6700c444accd58358c457d675eb2fdd59f | 4adb71c18f7811289fc4ba4dcb465e99e93d8e60 | refs/heads/master | 2021-05-30T13:34:07.037424 | 2015-09-24T22:09:05 | 2015-09-24T22:09:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C | false | false | 1,220 | h | /*** Generated by the FRODO code generator -- DO NOT HAND EDIT ***/
#ifndef __FRODO_GENERATED_MAIN_H__
#define __FRODO_GENERATED_MAIN_H__
/*** Included Header Files ***/
#include "arch/win32/win32_platform.h"
/*** Optional Optimization Global Values ***/
// Scheduler
#define FS_MAXTASKNAMELENGTH 1... | [
"adam.nagel+git@gmail.com"
] | adam.nagel+git@gmail.com |
952dfd3cb37d31a7510254c62b8d77416620e1d5 | 1ad4dd5261a185f3cf92d7fd3226de28679747c5 | /kernel/drivers/power/supply/twl4030_madc_battery.c | 4d41acb985761ad976f9de2b2cdc265a50fc9dea | [
"MIT",
"Linux-syscall-note",
"GPL-2.0-only"
] | permissive | oslab-swrc/libmpk | b30c8fa2eea834a8ab441fdd9f7789296781ec17 | a0b20ab8819d60d22d2a90f0d54eccae40ae6b05 | refs/heads/master | 2022-05-01T01:36:07.491532 | 2022-03-18T05:44:14 | 2022-03-18T05:44:14 | 223,290,854 | 0 | 0 | MIT | 2019-11-22T00:30:13 | 2019-11-22T00:30:12 | null | UTF-8 | C | false | false | 7,583 | c | /*
* Dumb driver for LiIon batteries using TWL4030 madc.
*
* Copyright 2013 Golden Delicious Computers
* Lukas Märdian <lukas@goldelico.com>
*
* Based on dumb driver for gta01 battery
* Copyright 2009 Openmoko, Inc
* Balaji Rao <balajirrao@openmoko.org>
*/
#include <linux/module.h>
#include <linux/param.h>
#i... | [
"spark720@gatech.edu"
] | spark720@gatech.edu |
79d5bc7e7b0f58f2265ccab7604b7acd757b6cfa | 0ac21e360b757a46c4b22b2289ae21cdb21b7a4c | /drivers/fsl_swm.h | a80bf4e5c39a05c5f03f1fb779044bef09518319 | [] | no_license | xiongyu0523/azure-rtos-threadx-demo-lpc802 | 64ccd69f6cc842bdeba7b1139114c38da9de9dd7 | b6b12bbfe250047641c504c7b6a1f24b8bfb0c98 | refs/heads/master | 2022-11-14T14:31:23.183288 | 2020-07-10T10:10:46 | 2020-07-10T10:10:46 | 278,575,978 | 3 | 0 | null | null | null | null | UTF-8 | C | false | false | 2,333 | h | /*
* Copyright 2017-2019 NXP
* All rights reserved.
*
*
* SPDX-License-Identifier: BSD-3-Clause
*/
#ifndef _FSL_SWM_H_
#define _FSL_SWM_H_
#include "fsl_swm_connections.h"
/*!
* @addtogroup swm
* @{
*/
/*! @file */
/*******************************************************************************
* Definit... | [
"xiongyu0523@gmail.com"
] | xiongyu0523@gmail.com |
564f1016591fb59acd0bb93bf1eff3b206e1b51c | 852ca3e259848d8498072245a08254224a5c4ee6 | /fy4/feature/message.c | e091263e9aeb1e81fabf4565f0e8227692c1376d | [] | no_license | losep/fy2005 | 2fa3d5e6d607c663edaab190bf66899789b83929 | 6ff35a0f7a33c454d9195ee1e28f310d65ec954b | refs/heads/master | 2020-07-16T16:08:23.397485 | 2016-01-05T05:07:46 | 2016-01-05T05:07:46 | null | 0 | 0 | null | null | null | null | WINDOWS-1252 | C | false | false | 1,307 | c | // message.c
#include <ansi.h>
#include <dbase.h>
#define MAX_MSG_BUFFER 500
static string *msg_buffer = ({});
void receive_message(string msgclass, string msg)
{
string subclass, *ch;
if( !interactive(this_object()) ) {
this_object()->relay_message(msgclass, msg);
return;
}
if( sscanf(m... | [
"liang.huang@transmension.com"
] | liang.huang@transmension.com |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.