StoreOrderSuccessServices.php 35 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700
  1. <?php
  2. // +----------------------------------------------------------------------
  3. // | CRMEB [ CRMEB赋能开发者,助力企业发展 ]
  4. // +----------------------------------------------------------------------
  5. // | Copyright (c) 2016~2023 https://www.crmeb.com All rights reserved.
  6. // +----------------------------------------------------------------------
  7. // | Licensed CRMEB并不是自由软件,未经许可不能去掉CRMEB相关版权
  8. // +----------------------------------------------------------------------
  9. // | Author: CRMEB Team <admin@crmeb.com>
  10. // +----------------------------------------------------------------------
  11. namespace app\services\order;
  12. use app\dao\order\StoreOrderDao;
  13. use app\services\activity\lottery\LuckLotteryServices;
  14. use app\services\activity\combination\StorePinkServices;
  15. use app\services\BaseServices;
  16. use app\services\pay\PayServices;
  17. use app\services\user\UserServices;
  18. use app\services\product\product\StoreProductGiftGroupService;
  19. use app\services\user\UserBrokerageServices;
  20. use crmeb\exceptions\ApiException;
  21. /**
  22. * Class StoreOrderSuccessServices
  23. * @package app\services\order
  24. * @method getOne(array $where, ?string $field = '*', array $with = []) 获取去一条数据
  25. */
  26. class StoreOrderSuccessServices extends BaseServices
  27. {
  28. /**
  29. *
  30. * StoreOrderSuccessServices constructor.
  31. * @param StoreOrderDao $dao
  32. */
  33. public function __construct(StoreOrderDao $dao)
  34. {
  35. $this->dao = $dao;
  36. }
  37. /**
  38. * 0元支付
  39. * @param array $orderInfo
  40. * @param int $uid
  41. * @return bool
  42. * @throws \think\Exception
  43. * @throws \think\db\exception\DataNotFoundException
  44. * @throws \think\db\exception\ModelNotFoundException
  45. * @throws \think\exception\DbException
  46. */
  47. public function zeroYuanPayment(array $orderInfo, int $uid, string $payType = PayServices::YUE_PAY)
  48. {
  49. if ($orderInfo['paid']) {
  50. throw new ApiException(410265);
  51. }
  52. return $this->paySuccess($orderInfo, $payType);//余额支付成功
  53. }
  54. /**
  55. * 支付成功
  56. * @param array $orderInfo
  57. * @param string $paytype
  58. * @param array $other
  59. * @return bool
  60. * @throws \Psr\SimpleCache\InvalidArgumentException
  61. * @throws \think\db\exception\DataNotFoundException
  62. * @throws \think\db\exception\DbException
  63. * @throws \think\db\exception\ModelNotFoundException
  64. */
  65. public function paySuccess(array $orderInfo, string $paytype = PayServices::WEIXIN_PAY, array $other = [])
  66. {
  67. $updata = ['paid' => 1, 'pay_type' => $paytype, 'pay_time' => time()];
  68. $orderInfo['pay_time'] = $updata['pay_time'];
  69. $orderInfo['pay_type'] = $paytype;
  70. if ($other && isset($other['trade_no'])) {
  71. $updata['trade_no'] = $other['trade_no'];
  72. }
  73. /** @var StoreOrderCartInfoServices $orderInfoServices */
  74. $orderInfoServices = app()->make(StoreOrderCartInfoServices::class);
  75. $orderInfo['storeName'] = $orderInfoServices->getCarIdByProductTitle((int)$orderInfo['id']);
  76. $res1 = $this->dao->update($orderInfo['id'], $updata);
  77. $resPink = true;
  78. if ($orderInfo['combination_id'] && $res1 && !$orderInfo['refund_status']) {
  79. /** @var StorePinkServices $pinkServices */
  80. $pinkServices = app()->make(StorePinkServices::class);
  81. /** @var StoreOrderServices $orderServices */
  82. $orderServices = app()->make(StoreOrderServices::class);
  83. $resPink = $pinkServices->createPink($orderServices->tidyOrder($orderInfo, true));//创建拼团
  84. }
  85. //缓存抽奖次数 除过线下支付
  86. if (isset($orderInfo['pay_type']) && $orderInfo['pay_type'] != 'offline') {
  87. /** @var LuckLotteryServices $luckLotteryServices */
  88. $luckLotteryServices = app()->make(LuckLotteryServices::class);
  89. $luckLotteryServices->setCacheLotteryNum((int)$orderInfo['uid'], 'order');
  90. }
  91. $orderInfo['send_name'] = $orderInfo['real_name'];
  92. //订单支付成功后置事件
  93. event('OrderPaySuccessListener', [$orderInfo]);
  94. //用户推送消息事件
  95. event('NoticeListener', [$orderInfo, 'order_pay_success']);
  96. //支付成功给客服发送消息
  97. event('NoticeListener', [$orderInfo, 'admin_pay_success_code']);
  98. // 推送订单
  99. event('OutPushListener', ['order_pay_push', ['order_id' => (int)$orderInfo['id']]]);
  100. //自定义消息-订单支付成功
  101. $orderInfo['time'] = date('Y-m-d H:i:s');
  102. $orderInfo['phone'] = $orderInfo['user_phone'];
  103. event('CustomNoticeListener', [$orderInfo['uid'], $orderInfo, 'order_pay_success']);
  104. //自定义事件-订单支付
  105. event('CustomEventListener', ['order_pay', [
  106. 'uid' => $orderInfo['uid'],
  107. 'id' => (int)$orderInfo['id'],
  108. 'order_id' => $orderInfo['order_id'],
  109. 'real_name' => $orderInfo['real_name'],
  110. 'user_phone' => $orderInfo['user_phone'],
  111. 'user_address' => $orderInfo['user_address'],
  112. 'total_num' => $orderInfo['total_num'],
  113. 'pay_price' => $orderInfo['pay_price'],
  114. 'pay_postage' => $orderInfo['pay_postage'],
  115. 'deduction_price' => $orderInfo['deduction_price'],
  116. 'coupon_price' => $orderInfo['coupon_price'],
  117. 'store_name' => $orderInfo['storeName'],
  118. 'add_time' => date('Y-m-d H:i:s', $orderInfo['add_time']),
  119. ]]);
  120. // 获取购物车信息
  121. $orderCartInfo = $orderInfoServices->getCartColunm(
  122. ['oid' => $orderInfo['id']],
  123. 'cart_info',
  124. 'unique'
  125. );
  126. $orderInfo['cart_info'] = [];
  127. foreach ($orderCartInfo as $k => $v) {
  128. $cart_info = is_string($v) ? json_decode($v, true) : $v;
  129. $orderInfo['cart_info'][] = $cart_info;
  130. }
  131. if ($orderInfo['is_lb'] == 1) {
  132. @file_put_contents('quanju.txt', $orderInfo['lb_spread_uid'] . "-礼包推荐人2\r\n", 8);
  133. self::createGiftRecommendationRelationship($orderInfo); //建立礼包推荐关系
  134. self::giftRecommendationBonus($orderInfo); //礼包升级分红
  135. }
  136. // if ($orderInfo['is_lb'] == 1) { //赠送礼包推荐奖金
  137. // @file_put_contents('quanju.txt', $orderInfo['is_lb'] . "-礼包订单2\r\n", 8);
  138. //
  139. // }
  140. $res = $res1 && $resPink;
  141. return false !== $res;
  142. }
  143. // 礼包商品分额度
  144. public function giftQuota($order)
  145. {
  146. try {
  147. // 检查 cart_info 是否存在且非空
  148. if (!isset($order['cart_info']) || empty($order['cart_info'])) {
  149. return false;
  150. }
  151. // 获取商品ID和订单金额
  152. $product_id = $order['cart_info'][0]['product_id'] ?? 0;
  153. $pay_price = $order['cart_info'][0]['truePrice'] ?? 0;
  154. if (!$product_id || !$pay_price) {
  155. return false;
  156. }
  157. // 获取额度倍数配置
  158. $quotaMultiple = sys_config('gift_quota', 10);
  159. // 计算增加的额度
  160. $quotaAmount = $pay_price * $quotaMultiple;
  161. // 获取用户信息
  162. $userServices = app()->make(UserServices::class);
  163. $userInfo = $userServices->getOne(['uid' => $order['uid']]);
  164. // 获取礼包额度服务
  165. $userGiftQuotaServices = app()->make(\app\services\user\UserGiftQuotaServices::class);
  166. // 更新用户额度字段
  167. $userServices->bcInc($order['uid'], 'quota', $quotaAmount, 'uid');
  168. // 记录额度增加记录
  169. $balance = bcadd($userInfo['quota'] ?? 0, $quotaAmount, 2);
  170. $userGiftQuotaServices->income('order_gift_quota', $order['uid'], [
  171. 'pay_price' => floatval($pay_price),
  172. 'number' => $quotaAmount
  173. ], $balance, $order['id']);
  174. @file_put_contents('quanju4.txt', '礼包额度: uid=' . $order['uid'] . ', 订单金额=' . $pay_price . ', 倍数=' . $quotaMultiple . ', 增加额度=' . $quotaAmount . "\r\n", 8);
  175. return true;
  176. } catch (\Exception $e) {
  177. @file_put_contents('quanju4.txt', $e->getMessage() . "-礼包额度报错内容\r\n", 8);
  178. @file_put_contents('quanju4.txt', $e->getFile() . "-文件\r\n", 8);
  179. @file_put_contents('quanju4.txt', $e->getLine() . "-位置\r\n", 8);
  180. @file_put_contents('quanju4.txt', $e->getTraceAsString() . "-堆栈\r\n", 8);
  181. }
  182. }
  183. // 创建礼包推荐关系
  184. public function createGiftRecommendationRelationship($order)
  185. {
  186. // @file_put_contents('quanju.txt', json_encode($order) . "-创建礼包推荐关系\r\n", 8);
  187. try {
  188. // 获取用户信息
  189. $userServices = app()->make(UserServices::class);
  190. $user = $userServices->getUserInfo($order['uid']);
  191. @file_put_contents('quanju.txt', $user['spread_uid'] . "-创建礼包推荐关系\r\n", 8);
  192. if ($user['spread_uid'] > 0) {
  193. // 如果用户有推广人,说明是通过推广链接支付的,需要创建礼包推荐关系,关系表是store_product_gift_group,需要保存product_id,uid,group_pid(小组上级),pid(真直推上级),fake_pid(假直推上级(直推上级的下级小组满人下放下来的人)),一个商品加一个pid推荐上级会形成一个小组,第一个加进小组的会是第二个加入的小组上级(group_pid),当一个小组满10人后,就会让第十人作为fake_pid直推上级建立新的10人小组,但pid还是真正的直推上级
  194. // 获取商品ID
  195. $product_id = $order['cart_info'][0]['product_id'] ?? 0;
  196. if (!$product_id) return false;
  197. // 获取推广人UID
  198. $spread_uid = $user['spread_uid'];
  199. // 获取礼包服务
  200. $giftGroupService = app()->make(StoreProductGiftGroupService::class);
  201. // 检查是否已有该商品的推荐关系
  202. $existRelation = $giftGroupService->getOne([
  203. 'product_id' => $product_id,
  204. 'uid' => $order['uid']
  205. ]);
  206. if ($existRelation) return true;
  207. // 检查推广人是否是自己的下级团队成员(防止循环推荐)
  208. if ($this->isSubordinate($order['uid'], $spread_uid, $product_id, $giftGroupService)) {
  209. return false;
  210. }
  211. // 获取直推上级的推荐关系
  212. $parentRelation = $giftGroupService->getOne([
  213. 'product_id' => $product_id,
  214. 'uid' => $spread_uid
  215. ]);
  216. // 设置关系数据
  217. $data = [
  218. 'product_id' => $product_id,
  219. 'uid' => $order['uid'],
  220. 'pid' => $spread_uid, // 真直推上级
  221. 'create_time' => time()
  222. ];
  223. // 处理小组关系
  224. // 获取小组人数上限配置
  225. $groupMaxNum = sys_config('gift_group_num', 10);
  226. // 判断直推上级在该商品下是否有小组成员(包括真直推下级和滑落的假直推下级)
  227. // 查找 fake_id=spread_uid 的小组成员
  228. $spreadFakeIdGroup = $giftGroupService->getList([
  229. 'product_id' => $product_id,
  230. 'fake_pid' => $spread_uid
  231. ], '*', 0, 0, 'create_time ASC');
  232. @file_put_contents('quanju4.txt', count($spreadFakeIdGroup) . "-fake_id=" . $spread_uid . "的小组人数\r\n", 8);
  233. if (count($spreadFakeIdGroup) > 0) {
  234. // 直推上级已有小组成员,需要判断是否需要加入该小组
  235. // 判断该小组是否满人
  236. if (count($spreadFakeIdGroup) < $groupMaxNum) {
  237. // 小组未满,新成员加入该小组,group_pid是该小组的最后一人
  238. $lastMember = end($spreadFakeIdGroup);
  239. $data['group_pid'] = $lastMember['uid'];
  240. $data['fake_pid'] = $spread_uid;
  241. @file_put_contents('quanju4.txt', $lastMember['uid'] . "-小组最后一人,新成员group_pid\r\n", 8);
  242. } else {
  243. // 小组已满,需要滑落到该小组最后一人的直推下级小组
  244. // 最后一人的直推下级小组 = 最后一人的uid作为fake_id的小组
  245. $lastMember = end($spreadFakeIdGroup);
  246. @file_put_contents('quanju4.txt', $lastMember['uid'] . "-小组最后一人uid\r\n", 8);
  247. // 查找最后一人的uid作为fake_id的小组
  248. $lastMemberUidFakeIdGroup = $giftGroupService->getList([
  249. 'product_id' => $product_id,
  250. 'fake_pid' => $lastMember['uid']
  251. ], '*', 0, 0, 'create_time ASC');
  252. @file_put_contents('quanju4.txt', count($lastMemberUidFakeIdGroup) . "-fake_id=" . $lastMember['uid'] . "的小组人数\r\n", 8);
  253. if (count($lastMemberUidFakeIdGroup) < $groupMaxNum) {
  254. // 该小组未满,新成员加入该小组
  255. if (count($lastMemberUidFakeIdGroup) > 0) {
  256. // 该小组已有成员,新成员的group_pid是该小组的最后一人
  257. $lastSubMember = end($lastMemberUidFakeIdGroup);
  258. $data['group_pid'] = $lastSubMember['uid'];
  259. $data['fake_pid'] = $lastMember['uid'];
  260. @file_put_contents('quanju4.txt', $lastSubMember['uid'] . "-fake_id小组最后一人,新成员group_pid,fake_pid=" . $lastMember['uid'] . "\r\n", 8);
  261. } else {
  262. // 该小组没有成员,新成员成为第一人
  263. $data['group_pid'] = 0;
  264. $data['fake_pid'] = $lastMember['uid'];
  265. @file_put_contents('quanju4.txt', '最后一人的uid作为fake_id小组没有成员,新成员成为第一人,fake_pid='. $lastMember['uid'] . "\r\n", 8);
  266. }
  267. } else {
  268. // 该小组也满了,从37的直推小组倒数第二人开始找
  269. // 从后往前遍历37的直推小组,找到第一个未满的uid作为fake_id的小组
  270. $foundGroup = false;
  271. for ($i = count($spreadFakeIdGroup) - 2; $i >= 0; $i--) {
  272. $prevMember = $spreadFakeIdGroup[$i];
  273. @file_put_contents('quanju4.txt', $prevMember['uid'] . "-检查倒数第" . (count($spreadFakeIdGroup) - $i) . "人的uid\r\n", 8);
  274. // 查找该人的uid作为fake_id的小组
  275. $prevMemberUidFakeIdGroup = $giftGroupService->getList([
  276. 'product_id' => $product_id,
  277. 'fake_pid' => $prevMember['uid']
  278. ], '*', 0, 0, 'create_time ASC');
  279. @file_put_contents('quanju4.txt', count($prevMemberUidFakeIdGroup) . "-fake_id=" . $prevMember['uid'] . "的小组人数\r\n", 8);
  280. if (count($prevMemberUidFakeIdGroup) < $groupMaxNum) {
  281. // 该小组未满,新成员加入该小组
  282. if (count($prevMemberUidFakeIdGroup) > 0) {
  283. $lastSubMember = end($prevMemberUidFakeIdGroup);
  284. $data['group_pid'] = $lastSubMember['uid'];
  285. $data['fake_pid'] = $prevMember['uid'];
  286. @file_put_contents('quanju4.txt', $lastSubMember['uid'] . "-fake_id小组最后一人,新成员group_pid,fake_pid=" . $prevMember['uid'] . "\r\n", 8);
  287. } else {
  288. $data['group_pid'] = 0;
  289. $data['fake_pid'] = $prevMember['uid'];
  290. @file_put_contents('quanju4.txt', '倒数人的uid作为fake_id小组没有成员,新成员成为第一人,fake_pid=' . $prevMember['uid'] . "\r\n", 8);
  291. }
  292. $foundGroup = true;
  293. break;
  294. }
  295. }
  296. // 如果所有倒数人的小组都满了,新成员以最后一个倒数人的uid作为fake_id,group_pid=0
  297. if (!$foundGroup) {
  298. $firstPrevMember = $spreadFakeIdGroup[0];
  299. $data['group_pid'] = 0;
  300. $data['fake_pid'] = $firstPrevMember['uid'];
  301. @file_put_contents('quanju4.txt', '所有倒数人的小组都满了,新成员fake_pid=' . $firstPrevMember['uid'] . "\r\n", 8);
  302. }
  303. }
  304. }
  305. } else {
  306. // 直推上级没有下级,这是该推广人的第一个下级,建立新小组
  307. $data['group_pid'] = 0;
  308. $data['fake_pid'] = $spread_uid;
  309. }
  310. // 保存推荐关系
  311. return $giftGroupService->save($data);
  312. }
  313. return false;
  314. } catch (\Exception $e) {
  315. @file_put_contents('quanju4.txt', $e->getMessage() . "-创建订单报错内容\r\n", 8);
  316. @file_put_contents('quanju4.txt', $e->getFile() . "-文件\r\n", 8);
  317. @file_put_contents('quanju4.txt', $e->getLine() . "-位置\r\n", 8);
  318. @file_put_contents('quanju4.txt', $e->getTraceAsString() . "-堆栈\r\n", 8);
  319. }
  320. }
  321. // 礼包上级分红
  322. public function giftRecommendationBonus($order)
  323. {
  324. try {
  325. @file_put_contents('quanju.txt', json_encode($order) . "-礼包上级分红\r\n", 8);
  326. // 获取礼包服务
  327. $giftGroupService = app()->make(StoreProductGiftGroupService::class);
  328. $userServices = app()->make(UserServices::class);
  329. // 检查 cart_info 是否存在且非空
  330. @file_put_contents('quanju4.txt', '开始检查cart_info' . "\r\n", 8);
  331. if (!isset($order['cart_info']) || empty($order['cart_info'])) {
  332. @file_put_contents('quanju4.txt', 'cart_info不存在或为空' . "\r\n", 8);
  333. return false;
  334. }
  335. // 获取商品ID和商品价格作为佣金计算基数
  336. $product_id = $order['cart_info'][0]['product_id'] ?? 0;
  337. $brokerage_price = $order['cart_info'][0]['truePrice'] ?? 0;
  338. @file_put_contents('quanju4.txt', 'product_id=' . $product_id . ', brokerage_price=' . $brokerage_price . "\r\n", 8);
  339. if (!$product_id || !$brokerage_price) {
  340. @file_put_contents('quanju4.txt', 'product_id或brokerage_price为0,返回false' . "\r\n", 8);
  341. return false;
  342. }
  343. @file_put_contents('quanju4.txt', $product_id . "-商品id\r\n", 8);
  344. // 获取用户的推荐关系
  345. $userRelation = $giftGroupService->getOne([
  346. 'product_id' => $product_id,
  347. 'uid' => $order['uid']
  348. ]);
  349. if (!$userRelation) return false;
  350. $userInfo = $userServices->getOne(['uid' => $order['uid']]);
  351. // 获取佣金服务(一次性创建,复用)
  352. /** @var UserBrokerageServices $userBrokerageServices */
  353. $userBrokerageServices = app()->make(UserBrokerageServices::class);
  354. //冻结时间
  355. $frozenTime = time() + intval(sys_config('extract_time')) * 86400;
  356. // 直推上级分成(全部给真直推上级)
  357. $directBrokerage = $brokerage_price * (sys_config('gift_direct_referral', 10) / 100);
  358. @file_put_contents('quanju4.txt', json_encode($userRelation) . "-礼包推荐关系表\r\n", 8);
  359. // 直推奖全部给真直推上级
  360. $pid_brokerage = $userServices->getOne(['uid' => $userRelation['pid']]);
  361. $userServices->bcInc($userRelation['pid'], 'brokerage_price', $directBrokerage, 'uid');
  362. @file_put_contents('quanju4.txt', $directBrokerage . "-直推奖励\r\n", 8);
  363. $balance = bcadd($pid_brokerage['brokerage_price'], $directBrokerage, 2);
  364. $userBrokerageServices->income('get_direct_referral_brokerage', $userRelation['pid'], [
  365. 'nickname' => $userInfo['nickname'],
  366. 'pay_price' => floatval($order['pay_price']),
  367. 'number' => $directBrokerage,
  368. 'frozen_time' => $frozenTime
  369. ], $balance, $order['id']);
  370. // 见点奖处理
  371. $spotBrokerage = $brokerage_price * (sys_config('gift_spot_bonus', 2.5) / 100);
  372. // 1. 向上查找:先找小组上级,没有就找假直推上级
  373. $spotUpLimit = sys_config('gift_spot_bonus_up', 15);
  374. $currentUid = $order['uid']; // 从当前用户开始
  375. $currentRelation = $userRelation; // 当前用户的推荐关系
  376. $originalPid = $userRelation['pid']; // 记录原始用户的真直推上级
  377. $originalFakePid = $userRelation['fake_pid']; // 记录原始用户的假直推上级
  378. $splitRatio = sys_config('gift_fake_pid_split_ratio', 50); // 假直推上级分成比例(给真直推上级的比例)
  379. // 判断原始用户是否是滑落的直推下级(pid != fake_pid)
  380. $isSlippedMember = ($originalPid != $originalFakePid);
  381. $hasGivenToFakePid = false; // 是否已经给fake_id发放过见点奖
  382. // 获取购买用户直推上级的推荐关系,用于判断是否需要分成
  383. $directParentRelation = null;
  384. if ($originalPid > 0) {
  385. $directParentRelation = $giftGroupService->getOne([
  386. 'product_id' => $product_id,
  387. 'uid' => $originalPid
  388. ]);
  389. }
  390. for ($i = 0; $i < $spotUpLimit; $i++) {
  391. $nextUid = null;
  392. // 优先查找小组上级
  393. if (!empty($currentRelation['group_pid'])) {
  394. $nextUid = $currentRelation['group_pid'];
  395. } else if (!empty($currentRelation['fake_pid'])) {
  396. // 没有小组上级,查找假直推上级
  397. $nextUid = $currentRelation['fake_pid'];
  398. }
  399. // 找不到上级,退出循环
  400. if (!$nextUid) break;
  401. // 判断是否需要分成
  402. $needSplit = false;
  403. $splitTargetPid = null; // 分成的目标pid(真直推上级)
  404. @file_put_contents('quanju4.txt', '分成判断检查: i=' . $i . ', currentUid=' . $currentUid . ', nextUid=' . $nextUid . ', currentRelation[fake_pid]=' . ($currentRelation['fake_pid'] ?? 'null') . ', currentRelation[pid]=' . ($currentRelation['pid'] ?? 'null') . "\r\n", 8);
  405. // 情况1:购买用户是滑落的,且第一次给fake_id发放
  406. if ($isSlippedMember && !$hasGivenToFakePid && $nextUid == $originalFakePid && $originalFakePid != $originalPid) {
  407. $needSplit = true;
  408. $splitTargetPid = $originalPid;
  409. $hasGivenToFakePid = true;
  410. @file_put_contents('quanju4.txt', '分成原因:购买用户是滑落的,第一次给fake_id发放' . "\r\n", 8);
  411. }
  412. // 情况2:购买用户的直推上级是滑落的,且第一次给该直推上级的fake_id发放
  413. // 判断条件:nextUid 是购买用户直推上级的 fake_id,且直推上级是滑落的
  414. else if (!$hasGivenToFakePid && $directParentRelation && !empty($directParentRelation['fake_pid']) && $nextUid == $directParentRelation['fake_pid'] && $directParentRelation['pid'] != $directParentRelation['fake_pid']) {
  415. $needSplit = true;
  416. $splitTargetPid = $directParentRelation['pid'];
  417. $hasGivenToFakePid = true;
  418. @file_put_contents('quanju4.txt', '分成原因:购买用户的直推上级是滑落的,第一次给该直推上级的fake_id发放' . "\r\n", 8);
  419. }
  420. @file_put_contents('quanju4.txt', '分成判断结果: needSplit=' . ($needSplit ? 'true' : 'false') . ($needSplit ? ', splitTargetPid=' . $splitTargetPid : '') . "\r\n", 8);
  421. if ($needSplit && $splitTargetPid) {
  422. // 需要分成:给真直推上级和假直推上级分别发放
  423. $splitAmount = $spotBrokerage * ($splitRatio / 100); // 给真直推上级的份额
  424. $remainderAmount = $spotBrokerage - $splitAmount; // 给假直推上级的份额
  425. // 给真直推上级发放
  426. $pidBrokerage = $userServices->getOne(['uid' => $splitTargetPid]);
  427. $userServices->bcInc($splitTargetPid, 'brokerage_price', $splitAmount, 'uid');
  428. $balance = bcadd($pidBrokerage['brokerage_price'], $splitAmount, 2);
  429. $userBrokerageServices->income('get_spot_brokerage', $splitTargetPid, [
  430. 'nickname' => $userInfo['nickname'],
  431. 'pay_price' => floatval($order['pay_price']),
  432. 'number' => $splitAmount,
  433. 'frozen_time' => $frozenTime
  434. ], $balance, $order['id']);
  435. @file_put_contents('quanju4.txt', '向上发放见点奖给真直推上级: uid=' . $splitTargetPid . ', 金额=' . $splitAmount . "\r\n", 8);
  436. // 给假直推上级发放
  437. $currentBrokerage = $userServices->getOne(['uid' => $nextUid]);
  438. $userServices->bcInc($nextUid, 'brokerage_price', $remainderAmount, 'uid');
  439. $balance = bcadd($currentBrokerage['brokerage_price'], $remainderAmount, 2);
  440. $userBrokerageServices->income('get_spot_brokerage', $nextUid, [
  441. 'nickname' => $userInfo['nickname'],
  442. 'pay_price' => floatval($order['pay_price']),
  443. 'number' => $remainderAmount,
  444. 'frozen_time' => $frozenTime
  445. ], $balance, $order['id']);
  446. @file_put_contents('quanju4.txt', '向上发放见点奖给假直推上级: uid=' . $nextUid . ', 金额=' . $remainderAmount . "\r\n", 8);
  447. } else {
  448. // 不需要分成:全部给上级
  449. $currentBrokerage = $userServices->getOne(['uid' => $nextUid]);
  450. $userServices->bcInc($nextUid, 'brokerage_price', $spotBrokerage, 'uid');
  451. $balance = bcadd($currentBrokerage['brokerage_price'], $spotBrokerage);
  452. $userBrokerageServices->income('get_spot_brokerage', $nextUid, [
  453. 'nickname' => $userInfo['nickname'],
  454. 'pay_price' => floatval($order['pay_price']),
  455. 'number' => $spotBrokerage,
  456. 'frozen_time' => $frozenTime
  457. ], $balance, $order['id']);
  458. @file_put_contents('quanju4.txt', '向上发放见点奖: uid=' . $nextUid . ', 金额=' . $spotBrokerage . "\r\n", 8);
  459. }
  460. // 更新当前用户ID,用于下一次循环的判断
  461. $currentUid = $nextUid;
  462. // 查找下一个上级的推荐关系
  463. $currentRelation = $giftGroupService->getOne([
  464. 'product_id' => $product_id,
  465. 'uid' => $nextUid
  466. ]);
  467. // 如果找不到推荐关系,退出循环
  468. if (!$currentRelation) break;
  469. }
  470. // 2. 向下查找:先找直推下级,不够再找同组下级
  471. $spotDownLimit = sys_config('gift_spot_bonus_down', 15);
  472. $totalDownSpots = 0;
  473. // 2.1 先找直推下级
  474. $directSubordinates = $giftGroupService->getList([
  475. 'product_id' => $product_id,
  476. 'pid' => $order['uid']
  477. ], '*', 0, $spotDownLimit, 'create_time asc');
  478. foreach ($directSubordinates as $subordinate) {
  479. $subBrokerage = $userServices->getOne(['uid' => $subordinate['uid']]);
  480. $userServices->bcInc($subordinate['uid'], 'brokerage_price', $spotBrokerage, 'uid');
  481. $balance = bcadd($subBrokerage['brokerage_price'], $spotBrokerage);
  482. $userBrokerageServices->income('get_spot_brokerage', $subordinate['uid'], [
  483. 'nickname' => $userInfo['nickname'],
  484. 'pay_price' => floatval($order['pay_price']),
  485. 'number' => $spotBrokerage,
  486. 'frozen_time' => $frozenTime
  487. ], $balance, $order['id']);
  488. @file_put_contents('quanju4.txt', '向下发放见点奖给直推下级: uid=' . $subordinate['uid'] . ', 金额=' . $spotBrokerage . "\r\n", 8);
  489. $totalDownSpots++;
  490. }
  491. // 2.2 如果直推下级不够,找同组下级
  492. if ($totalDownSpots < $spotDownLimit) {
  493. // 获取所有pid与当前用户pid相同的同级用户
  494. $samePidMembers = $giftGroupService->getList([
  495. 'product_id' => $product_id,
  496. 'pid' => $userRelation['pid']
  497. ], '*', 0, 0, 'create_time asc');
  498. // 找到当前用户在同级用户中的位置
  499. $currentIndex = null;
  500. foreach ($samePidMembers as $index => $member) {
  501. if ($member['uid'] == $order['uid']) {
  502. $currentIndex = $index;
  503. break;
  504. }
  505. }
  506. // 从当前用户之后的同级用户开始,查找同组下级
  507. if ($currentIndex !== null) {
  508. for ($i = $currentIndex + 1; $i < count($samePidMembers) && $totalDownSpots < $spotDownLimit; $i++) {
  509. $member = $samePidMembers[$i];
  510. // 检查这个同级用户的group_pid层级是否在当前用户或其下级中
  511. $isGroupSubordinate = $this->isGroupSubordinate($order['uid'], $member['group_pid'], $product_id, $giftGroupService);
  512. if ($isGroupSubordinate) {
  513. $memberBrokerage = $userServices->getOne(['uid' => $member['uid']]);
  514. $userServices->bcInc($member['uid'], 'brokerage_price', $spotBrokerage, 'uid');
  515. $balance = bcadd($memberBrokerage['brokerage_price'], $spotBrokerage);
  516. $userBrokerageServices->income('get_spot_brokerage', $member['uid'], [
  517. 'nickname' => $userInfo['nickname'],
  518. 'pay_price' => floatval($order['pay_price']),
  519. 'number' => $spotBrokerage,
  520. 'frozen_time' => $frozenTime
  521. ], $balance, $order['id']);
  522. @file_put_contents('quanju4.txt', '向下发放见点奖给同组下级: uid=' . $member['uid'] . ', 金额=' . $spotBrokerage . "\r\n", 8);
  523. $totalDownSpots++;
  524. }
  525. }
  526. }
  527. }
  528. return true;
  529. } catch (\Exception $e) {
  530. @file_put_contents('quanju4.txt', $e->getMessage() . "-上级分红报错内容\r\n", 8);
  531. @file_put_contents('quanju4.txt', $e->getFile() . "-文件\r\n", 8);
  532. @file_put_contents('quanju4.txt', $e->getLine() . "-位置\r\n", 8);
  533. @file_put_contents('quanju4.txt', $e->getTraceAsString() . "-堆栈\r\n", 8);
  534. }
  535. }
  536. /**
  537. * 检查某个用户是否是另一个用户的小组下级(通过group_pid层级关系)
  538. * @param int $baseUid 基准用户uid
  539. * @param int $groupPid 要检查的group_pid
  540. * @param int $productId 商品ID
  541. * @param StoreProductGiftGroupService $giftGroupService 礼包服务
  542. * @param array $checked 已检查的用户(防止循环)
  543. * @return bool 如果是小组下级返回true,否则返回false
  544. */
  545. protected function isGroupSubordinate($baseUid, $groupPid, $productId, $giftGroupService, $checked = [])
  546. {
  547. // 如果已经检查过这个groupPid,跳过(防止循环)
  548. if (isset($checked[$groupPid])) {
  549. return false;
  550. }
  551. $checked[$groupPid] = true;
  552. // 如果groupPid是0,说明没有小组关系
  553. if (empty($groupPid)) {
  554. return false;
  555. }
  556. // 如果groupPid等于基准用户,说明是直接下级
  557. if ($groupPid == $baseUid) {
  558. return true;
  559. }
  560. // 递归检查group_pid是否是基准用户的下级
  561. $member = $giftGroupService->getOne([
  562. 'product_id' => $productId,
  563. 'uid' => $groupPid
  564. ]);
  565. if ($member) {
  566. // 继续检查这个用户的group_pid
  567. return $this->isGroupSubordinate($baseUid, $member['group_pid'], $productId, $giftGroupService, $checked);
  568. }
  569. return false;
  570. }
  571. /**
  572. * 检查某个用户是否是另一个用户的下级团队成员
  573. * @param int $uid 当前用户
  574. * @param int $targetUid 要检查的目标用户
  575. * @param int $productId 商品ID
  576. * @param StoreProductGiftGroupService $giftGroupService 礼包服务
  577. * @param array $checked 已检查的用户(防止循环)
  578. * @return bool 如果是下级返回true,否则返回false
  579. */
  580. protected function isSubordinate($uid, $targetUid, $productId, $giftGroupService, $checked = [])
  581. {
  582. // 如果已经检查过这个用户,跳过(防止循环)
  583. if (isset($checked[$uid])) {
  584. return false;
  585. }
  586. $checked[$uid] = true;
  587. // 查找该用户的所有直推下级
  588. $subordinates = $giftGroupService->getList([
  589. 'product_id' => $productId,
  590. 'pid' => $uid
  591. ], 'uid', 0, 0, 'create_time asc');
  592. // 检查目标用户是否在直推下级中
  593. foreach ($subordinates as $sub) {
  594. if ($sub['uid'] == $targetUid) {
  595. return true; // 找到了,是下级
  596. }
  597. }
  598. // 递归检查每个下级的下级
  599. foreach ($subordinates as $sub) {
  600. if ($this->isSubordinate($sub['uid'], $targetUid, $productId, $giftGroupService, $checked)) {
  601. return true; // 在下级的下级中找到了
  602. }
  603. }
  604. return false; // 没找到,不是下级
  605. }
  606. }