PHP memcache Implementing Message Queuing instances

Source: Internet
Author: User

Memcache is now widely used in server caches. Let me introduce the Memcache message queue waiting for the sample implementation, there is a need to understand the friend can refer to.

Memche Message Queuing principle key on the fuss. Post-message or log.

The content is then dropped to a file or database via a timed program.


PHP's use of Message Queuing is an example of the time it takes to send a large number of messages when sending a message. Then the queue can be taken.


A lightweight queue server that facilitates the implementation of queues is:
Starling lightweight Persistent server with Memcache protocol support
Https://github.com/starling/starling
BEANSTALKD is lightweight, efficient, durable, capable of processing around 3000 queues per second
http://kr.github.com/beanstalkd/
Memcache/memcached can also be used to implement Message Queuing in PHP.

<?

php/*** Memcache Message Queuing class */class QMC {Const PREFIX = ' Asdfasdffwqke ';/*** initialize mc* @staticvar string $MC * @return Memcache*/sta Tic Private Function Mc_init () {Static $MC = Null;if (Is_null ($MC)) {$MC = new Memcache; $MC->connect (' 127.0.0.1 ', 11211 );} return $MC;} /*** The MC counter, adds a count and returns a new count * @param string $key counter * @param int $offset count increment, which can be negative. 0 is not changed count * @param int $time time * @retur n int/false failure is the return of false, the count after the update counter is returned */static public function Set_counter ($key, $offset, $time =0) {$MC = Self::mc_init (); $val = $MC->get ($key), if (!is_numeric ($val) | | $val < 0) {$ret = $MC->set ($key, 0, $time); if (! $ret) return false; $val = 0;} $offset = Intval ($offset), if ($offset > 0) {return $MC->increment ($key, $offset);} ElseIf ($offset < 0) {return $MC->decrement ($key,-$offset);} return $val;} /*** Write Queue * @param string $key * @param mixed $value * @return bool*/static Public Function input ($key, $value) {$MC = self: : Mc_init (); $w _key = self::P refix. $key. ' W '; $v _key = self::P refiX. $key. Self::set_counter ($w _key, 1); return $MC->set ($v _key, $value);} /*** read data in queue * @param string $key * @param int $max Maximum number of reads * @return array*/static Public Function output ($key, $max = 100) {$out = array (); $MC = Self::mc_init (); $r _key = self::P refix. $key. ' R '; $w _key = self::P refix. $key. ' W '; $r _p = Self::set_counter ($r _key, 0);//Read pointer $w_p = Self::set_counter ($w _key, 0);//write pointer if ($r _p = = 0) $r _p = 1;whil E ($w _p >= $r _p) {if (--$max < 0), $v _key = self::P refix. $key. $r _p; $r _p = Self::set_counter ($r _key, 1); $out [ ] = $MC->get ($v _key); $MC->delete ($v _key);} return $out;}} /** usage: qmc::input ($key, $value);//write Queue $list = Qmc::output ($key);//Read Queue */?>




Message Queuing based on PHP shared memory implementation:

<?php/*** PHP loop Memory queue implementation with shared memory * Supports multi-process, supports storage of various data types * Note: Complete the queue or team operation and use Unset () as soon as possible to release the critical area * * @author [email protected]  * @created 2009-12-23*/class Shmqueue{private $maxQSize = 0;//queue maximum length private $front = 0;//team head pointer private $rear = 0;  The tail pointer is private $blockSize = 256;  The size of the block (byte) private $memSize = 25600;  Maximum shared memory (byte) Private $shmId = 0;private $filePtr = './shmq.ptr ';p rivate $semId = 0;public function __construct () {$shmkey = Ftok (__file__, ' t '); $this->shmid = Shmop_open ($shmkey, "C", 0644, $this->memsize); $this->maxqsize = $this-&G t;memsize/$this->blocksize;//? A semaphore $this->semid = Sem_get ($shmkey, 1); Sem_acquire ($this->semid); Application for entry into the critical section $this->init ();} Private Function init () {if (file_exists ($this->fileptr)) {$contents = file_get_contents ($this->fileptr); $data = Explode (' | ', $contents), if (Isset ($data [0]) && isset ($data [1]) {$this->front = (int) $data [0]; $this Rear = (int) $data [1];}} Public Function GetLength () {return ($this->rear-$this->front + $this->memsize)% ($this->memsize))/$this->blocksize;} Public Function EnQueue ($value) {if ($this->ptrinc ($this->rear) = = $this->front) {//Team full return false;} $data = $this->encode ($value); Shmop_write ($this->shmid, $data, $this->rear); $this->rear = $this Ptrinc ($this->rear); return true;} Public Function DeQueue () {if ($this->front = = $this->rear) {//team NULL return FALSE;} $value = Shmop_read ($this->shmid, $this->front, $this->blocksize-1); $this->front = $this->ptrinc ($ This->front); return $this->decode ($value);} Private Function Ptrinc ($ptr) {return ($ptr + $this->blocksize)% ($this->memsize);} Private function Encode ($value) {$data = serialize ($value). "__eof"; echo "; Echo strlen ($data); echo"; Echo $this->blocksize-1;echo "; if (strlen ($data) > $this blockSize-1) {throw new Exception (strlen ($data). "is overload block size!");} return $data;} Private function decode ($value) {$data = exPlode ("__eof", $value); return unserialize ($data [0]);} Public Function __destruct () {$data = $this->front. ' | '. $this->rear;file_put_contents ($this->fileptr, $data); Sem_release ($this->semid); Out of the critical area, releasing the semaphore}}/*//into the team operation $SHMQ = new Shmqueue (); $data = ' test data '; $shmq->enqueue ($data); unset ($SHMQ);//exit Operation $SHMQ = n EW Shmqueue (); $data = $shmq->dequeue (); unset ($SHMQ);*/?>


For a very large message queue, the serialization and deserialization of large databases are frequently performed. There is too much expense.

Here is a message queue I implemented in PHP. Only need to insert a data at the tail, the operation of the tail, do not operate the entire message queue for reading, and operation. However, this message queue is not thread-safe, I just try to avoid the possibility of conflict. Suppose the message is not very dense, for example, a few seconds. Can still be considered for such use.  
If you want to implement thread-safe, one suggestion is to lock through the file and then do the operation. Here's the code :
The code is as follows:

Class Memcache_queue {private $memcache; private $name; private $prefix; function __construct ($maxSize, $name, $memcache, $prefix = "__memcache_queue__") {if ($memcache = = null) {throw new Exception ("Memcache object is null, new The object F Irst. "); $this->memcache = $memcache; $this->name = $name; $this->prefix = $prefix; $this->maxsize = $maxSize; $this->front = 0; $this->real = 0; $this->size = 0; } function __get ($name) {return $this->get ($name),} function __set ($name, $value) {$this->add ($name, $value); ret Urn $this; } function IsEmpty () {return $this->size = = 0;} function isfull () {return $this->size = = $this->maxsize;} fun Ction EnQueue ($data) {if ($this->isfull ()) {throw new Exception ("Queue is full"), $this->increment ("size"); $thi S->set ($this->real, $data); $this->set ("real", ($this->real + 1)% $this->maxsize); return $this; } function DeQueue () {if ($this->isempty ()) {throw new Exception ("Queue isEmpty "); } $this->decrement ("size"); $this->delete ($this->front); $this->set ("front", ($this->front + 1)% $this->maxsize); return $this; } function GetTop () {return $this->get ($this->front),} function GetAll () {return $this->getpage ();} function GetPage ($offset = 0, $limit = 0) {if ($this->isempty () | | $this->size < $offset) {return null;} $keys [] = $thi S->getkeybypos (($this->front + $offset)% $this->maxsize); $num = 1; for ($pos = ($this->front + $offset + 1)% $this->maxsize; $pos! = $this->real; $pos = ($pos + 1)% $this->max Size) {$keys [] = $this->getkeybypos ($pos), $num + +, if ($limit > 0 && $limit = = $num) {break;}} return AR Ray_values ($this->memcache->get ($keys)); } function Makeempty () {$keys = $this->getallkeys (); foreach ($keys as $value) {$this->delete ($value);} $this-&gt ;d elete ("real"); $this->delete ("front"); $this->delete ("size"); $this->delete ("maxSize"); } privatefunction Getallkeys () {if ($this->isempty ()) {return array ();} $keys [] = $this->getkeybypos ($this->front); for ($pos = ($this->front + 1)% $this->maxsize; $pos! = $this->real; $pos = ($pos + 1)% $this->maxsize) {$keys [] = $this->getkeybypos ($pos);} return $keys; } Private Function Add ($pos, $data) {$this->memcache->add ($this->getkeybypos ($pos), $data); return $this;} pri vate function Increment ($pos) {return $this->memcache->increment ($this->getkeybypos ($pos));} private function Decrement ($pos) {$this->memcache->decrement ($this->getkeybypos ($pos));} Private function set ($pos , $data) {$this->memcache->set ($this->getkeybypos ($pos), $data); return $this;} private function Get ($pos) {RE Turn $this->memcache->get ($this->getkeybypos ($pos)); } Private Function Delete ($pos) {return $this->memcache->delete ($this->getkeybypos ($pos));} Private function Getkeybypos ($pos) {return $this->prefix. $this->name. $pos;  } }



Copyright notice: This article Bo Master original articles, blogs, without consent may not be reproduced.

PHP memcache Implementing Message Queuing instances

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.