// Reason why cannot lock conn.PrepareContext
	// suppose the maxopen is 1, g1 is creating record and g2 is querying record.
	// 1. g1 begin tx, g1 is requeue because of waiting for the system call, now `db.ConnPool` db.numOpen == 1.
	// 2. g2 select lock `conn.PrepareContext(ctx, query)`, now db.numOpen == db.maxOpen , wait for release.
	// 3. g1 tx exec insert, wait for unlock `conn.PrepareContext(ctx, query)` to finish tx and release.

      writeUtf8(content)
    }
  }

  private fun generateSomeGarbageFiles() {
    val dir1 = cacheDir / "dir1"
    val dir2 = dir1 / "dir2"
    writeFile(getCleanFile("g1", 0), "A")
    writeFile(getCleanFile("g1", 1), "B")
    writeFile(getCleanFile("g2", 0), "C")
    writeFile(getCleanFile("g2", 1), "D")
    writeFile(getCleanFile("g2", 1), "D")
    writeFile(cacheDir / "otherFile0", "E")

		}
	}
	return nil
}

func isGroupDescEqual(g1, g2 madmin.GroupDesc) bool {
	if g1.Name != g2.Name ||
		g1.Status != g2.Status ||
		g1.Policy != g2.Policy {
		return false
	}
	if len(g1.Members) != len(g2.Members) {
		return false
	}
	for _, v1 := range g1.Members {
		var found bool
		for _, v2 := range g2.Members {
			if v1 == v2 {

  TF_Status* s = TF_NewStatus();
  TF_Graph* g1 = TF_NewGraph();
  TF_Graph* g2 = TF_NewGraph();

  TF_Operation* feed = Placeholder(g1, s);
  ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);

  // Attempt to create node in g2 with input from g1
  Neg(feed, g2, s);
  EXPECT_EQ(TF_INVALID_ARGUMENT, TF_GetCode(s));
  EXPECT_STREQ("foo", TF_Message(s));

  TF_DeleteGraph(g1);
  TF_DeleteGraph(g2);
  TF_DeleteStatus(s);

ê‰Ëù²LpzÛ!vâËàµÍ¼ w.Ñ R¢‡ç0 # ìÑ3ÈÓà mzZsœõ!Ê'¥G -Q \@øðO1 ¹ Þ~'= •²ÅÏá§ØèØ“àH† ð3&å C_Œé¿ö ÈW = ±zÆ› ŽŒ+6÷ä ³Ò¹Of5 ÿ 5¼} Ïa0Y×­2 "gÎðÐ £ G à’ºµ mž?zV ¤DÅ tõÇ» "ÑK †båL‹ ´ I5 R n Í ƒ`?. ,cØÅô™çï±~ âJ’E[zô"…ì#9Î é†`#Èá AU(¿ù# ëŸ Õyò˜3 59ÄO½ŒX ¯#äÓZï Ñ–g1 bœŽENkƒ '…m å Ñó¤â‰7X= o=è»=%ä›Òû´¿©]ÁŽ ® £a 3°¹ multisitea/data/disterasure/xl5/.minio.sys/pool.bin/xl.meta XL2 Æ w Ä$•Ä Ó ÉŸþ¥¹ °Ä ºHØH Å Kƒ¤Type ¥V2ObjÞ ¢IDÄ ¤DDirÄ 5 A·DoCÁ§slÂ0RÿŦEcAlgo £EcM £EcN §EcBSizeÒ §EcIndex ¦EcDistœ ¨CSumAlgo ¨PartNums‘...