// index收到一条新上报的监控数据,尝试用于增量更新索引
func ReceiveItem(item *cmodel.GraphItem, md5 string) {
if item == nil {
return
}
uuid := item.UUID()
// 已上报过的数据
if indexedItemCache.ContainsKey(md5) {
old := indexedItemCache.Get(md5).(*IndexCacheItem)
if uuid == old.UUID { // dsType+step没有发生变化,只更新缓存 TODO 存在线程安全的问题
old.Item = item
} else { // dsType+step变化了,当成一个新的增量来处理(甚至,不用rrd文件来过滤)
//indexedItemCache.Remove(md5)
unIndexedItemCache.Put(md5, NewIndexCacheItem(uuid, item))
}
return
}
// 是否有rrdtool文件存在,如果有 认为已建立索引
// 针对 索引缓存重建场景 做的优化, 结合索引全量更新 来保证一致性
rrdFileName := g.RrdFileName(g.Config().RRD.Storage, md5, item.DsType, item.Step)
if g.IsRrdFileExist(rrdFileName) {
indexedItemCache.Put(md5, NewIndexCacheItem(uuid, item))
return
}
// 缓存未命中, 放入增量更新队列
unIndexedItemCache.Put(md5, NewIndexCacheItem(uuid, item))
}
func FlushRRD(idx int) {
storageDir := g.Config().RRD.Storage
keys := store.GraphItems.KeysByIndex(idx)
if len(keys) == 0 {
return
}
for _, ckey := range keys {
// get md5, dstype, step
checksum, dsType, step, err := g.SplitRrdCacheKey(ckey)
if err != nil {
continue
}
items := store.GraphItems.PopAll(ckey)
size := len(items)
if size == 0 {
continue
}
filename := g.RrdFileName(storageDir, checksum, dsType, step)
Flush(filename, items)
Counter += 1
}
}
func fetch_rrd(client **rpc.Client, key string, addr string) error {
var (
err error
flag uint32
md5 string
dsType string
filename string
step, i int
rrdfile g.File
)
cfg := g.Config()
if flag, err = store.GraphItems.GetFlag(key); err != nil {
return err
}
store.GraphItems.SetFlag(key, flag|g.GRAPH_F_FETCHING)
md5, dsType, step, _ = g.SplitRrdCacheKey(key)
filename = g.RrdFileName(cfg.RRD.Storage, md5, dsType, step)
for i = 0; i < 3; i++ {
err = rpc_call(*client, "Graph.GetRrd", key, &rrdfile,
time.Duration(cfg.CallTimeout)*time.Millisecond)
if err == nil {
done := make(chan error, 1)
io_task_chan <- &io_task_t{
method: IO_TASK_M_WRITE,
args: &g.File{
Filename: filename,
Body: rrdfile.Body[:],
},
done: done,
}
if err = <-done; err != nil {
goto out
} else {
flag &= ^g.GRAPH_F_MISS
goto out
}
} else {
log.Println(err)
}
if err == rpc.ErrShutdown {
reconnection(client, addr)
}
}
out:
flag &= ^g.GRAPH_F_FETCHING
store.GraphItems.SetFlag(key, flag)
return err
}
func CommitByKey(key string) {
md5, dsType, step, err := g.SplitRrdCacheKey(key)
if err != nil {
return
}
filename := g.RrdFileName(g.Config().RRD.Storage, md5, dsType, step)
items := store.GraphItems.PopAll(key)
if len(items) == 0 {
return
}
FlushFile(filename, items)
}
func (this *Graph) GetRrd(key string, rrdfile *g.File) (err error) {
if md5, dsType, step, err := g.SplitRrdCacheKey(key); err != nil {
return err
} else {
rrdfile.Filename = g.RrdFileName(g.Config().RRD.Storage, md5, dsType, step)
}
items := store.GraphItems.PopAll(key)
if len(items) > 0 {
rrdtool.FlushFile(rrdfile.Filename, items)
}
rrdfile.Body, err = rrdtool.ReadFile(rrdfile.Filename)
return
}
func (this *GraphItemMap) PushFront(key string,
item *cmodel.GraphItem, md5 string, cfg *g.GlobalConfig) {
if linkedList, exists := this.Get(key); exists {
linkedList.PushFront(item)
} else {
//log.Println("new key:", key)
safeList := &SafeLinkedList{L: list.New()}
safeList.L.PushFront(item)
if cfg.Migrate.Enabled && !g.IsRrdFileExist(g.RrdFileName(
cfg.RRD.Storage, md5, item.DsType, item.Step)) {
safeList.Flag = g.GRAPH_F_MISS
}
this.Set(key, safeList)
}
}
func (this *Graph) Query(param cmodel.GraphQueryParam, resp *cmodel.GraphQueryResponse) error {
// statistics
proc.GraphQueryCnt.Incr()
// form empty response
resp.Values = []*cmodel.RRDData{}
resp.Endpoint = param.Endpoint
resp.Counter = param.Counter
dsType, step, exists := index.GetTypeAndStep(param.Endpoint, param.Counter) // complete dsType and step
if !exists {
return nil
}
resp.DsType = dsType
resp.Step = step
start_ts := param.Start - param.Start%int64(step)
end_ts := param.End - param.End%int64(step) + int64(step)
if end_ts-start_ts-int64(step) < 1 {
return nil
}
md5 := cutils.Md5(param.Endpoint + "/" + param.Counter)
ckey := g.FormRrdCacheKey(md5, dsType, step)
filename := g.RrdFileName(g.Config().RRD.Storage, md5, dsType, step)
// read data from rrd file
datas, _ := rrdtool.Fetch(filename, param.ConsolFun, start_ts, end_ts, step)
datas_size := len(datas)
// read cached items
items := store.GraphItems.FetchAll(ckey)
items_size := len(items)
nowTs := time.Now().Unix()
lastUpTs := nowTs - nowTs%int64(step)
rra1StartTs := lastUpTs - int64(rrdtool.RRA1PointCnt*step)
// consolidated, do not merge
if start_ts < rra1StartTs {
resp.Values = datas
goto _RETURN_OK
}
// no cached items, do not merge
if items_size < 1 {
resp.Values = datas
goto _RETURN_OK
}
// merge
{
// fmt cached items
var val cmodel.JsonFloat
cache := make([]*cmodel.RRDData, 0)
ts := items[0].Timestamp
itemEndTs := items[items_size-1].Timestamp
itemIdx := 0
if dsType == g.DERIVE || dsType == g.COUNTER {
for ts < itemEndTs {
if itemIdx < items_size-1 && ts == items[itemIdx].Timestamp &&
ts == items[itemIdx+1].Timestamp-int64(step) {
val = cmodel.JsonFloat(items[itemIdx+1].Value-items[itemIdx].Value) / cmodel.JsonFloat(step)
if val < 0 {
val = cmodel.JsonFloat(math.NaN())
}
itemIdx++
} else {
// missing
val = cmodel.JsonFloat(math.NaN())
}
if ts >= start_ts && ts <= end_ts {
cache = append(cache, &cmodel.RRDData{Timestamp: ts, Value: val})
}
ts = ts + int64(step)
}
} else if dsType == g.GAUGE {
for ts <= itemEndTs {
if itemIdx < items_size && ts == items[itemIdx].Timestamp {
val = cmodel.JsonFloat(items[itemIdx].Value)
itemIdx++
} else {
// missing
val = cmodel.JsonFloat(math.NaN())
}
if ts >= start_ts && ts <= end_ts {
cache = append(cache, &cmodel.RRDData{Timestamp: ts, Value: val})
}
ts = ts + int64(step)
}
}
cache_size := len(cache)
// do merging
merged := make([]*cmodel.RRDData, 0)
if datas_size > 0 {
for _, val := range datas {
if val.Timestamp >= start_ts && val.Timestamp <= end_ts {
merged = append(merged, val) //rrdtool返回的数据,时间戳是连续的、不会有跳点的情况
}
}
}
if cache_size > 0 {
rrdDataSize := len(merged)
lastTs := cache[0].Timestamp
// find junction
rrdDataIdx := 0
for rrdDataIdx = rrdDataSize - 1; rrdDataIdx >= 0; rrdDataIdx-- {
if merged[rrdDataIdx].Timestamp < cache[0].Timestamp {
lastTs = merged[rrdDataIdx].Timestamp
break
}
}
// fix missing
for ts := lastTs + int64(step); ts < cache[0].Timestamp; ts += int64(step) {
merged = append(merged, &cmodel.RRDData{Timestamp: ts, Value: cmodel.JsonFloat(math.NaN())})
}
// merge cached items to result
rrdDataIdx += 1
for cacheIdx := 0; cacheIdx < cache_size; cacheIdx++ {
if rrdDataIdx < rrdDataSize {
if !math.IsNaN(float64(cache[cacheIdx].Value)) {
merged[rrdDataIdx] = cache[cacheIdx]
}
} else {
merged = append(merged, cache[cacheIdx])
}
rrdDataIdx++
}
}
mergedSize := len(merged)
// fmt result
ret_size := int((end_ts - start_ts) / int64(step))
ret := make([]*cmodel.RRDData, ret_size, ret_size)
mergedIdx := 0
ts = start_ts
for i := 0; i < ret_size; i++ {
if mergedIdx < mergedSize && ts == merged[mergedIdx].Timestamp {
ret[i] = merged[mergedIdx]
mergedIdx++
} else {
ret[i] = &cmodel.RRDData{Timestamp: ts, Value: cmodel.JsonFloat(math.NaN())}
}
ts += int64(step)
}
resp.Values = ret
}
_RETURN_OK:
// statistics
proc.GraphQueryItemCnt.IncrBy(int64(len(resp.Values)))
return nil
}